Machine definition

A Mine Hoist is classified as a machine, covered by the machinery (machine) definition assembly, fitted with or intended to be fitted with a drive system consisting of linked parts or components, at least one of which moves, and which are joined together for a specific application (ISO 12100 2010). 

Capacity Definitions In any analysis, the capacity per unit time of dynamic equipment (such as conveyors and bagging machines), as well as the rates at which they ac tuaUy perform, must be defined more precisely and realistically than by a mere statement of kilograms or pounds per hour. Some useful definitions employed by the equipment industi y are the following ... 

Service factor is mentioned nowhere in the NEMA standards for lai ge machines there is no definition of it. There is no standard for temperature rise or other characteristics at the service factor overload. In fact, the standards are being changed to state that the temperature rise tables are for motors with 1.0 service factors. Neither standard synchronous nor enclosed induction motors have included service factor for several years. 

Constants K and C can be readily obtained from experiments conducted on a prototype machine, from whence the volume of filtrate obtained for a definite time interval (for a specified filter, at the same pressure and temperature) can be calculated. If process parameters are varied, new constants K and C can be estimated from the above expressions. The last expression can be further modified by denoting the constant r as = CVK, and substituting ... 

Note, since different types of machine have different sigma values, always take care in checking the precise definition of S. 

The use of simple machines has sometimes been taken as a definition of what separates humans from animals however, some primates have been obseiwed fashioning probes out of sticks to pry out or to reach food. One of the most powerful images depicting the... 

Some of the definitions in this section apply to only specific types or sizes of machines.)... 

The vibration profile that results from motion is the result of a force imbalance. By definition, balance occurs in moving systems when all forces generated by, and acting on, the machine are in a state of equilibrium. In real-world applications, however, there is always some level of imbalance and all machines vibrate to some extent. This section discusses the more common sources of vibration for rotating machinery, as well as for machinery undergoing reciprocating and/or linear motion. 

For routine monitoring of machine vibration, however, this approach is not cost effective. The time required to manually isolate each of the frequency components and transient events contained in the waveform is prohibitive. However, time-domain data has a definite use in a total plant predictive maintenance or reliability improvement program. 

Although the definition of dynamic imbalance covers all two-plane situations, an understanding of the components of dynamic imbalance is needed so that its causes can be understood. Also, an understanding of the components makes it easier to understand why certain types of balancing do not always work with many older balancing machines for overhung rotors and very narrow rotors. The primary components of dynamic imbalance include number of points of imbalance, amount of imbalance, phase relationships, and rotor speed. 

The enormous scope of the subject of corrosion follows from the definition which has been adopted in the present work. Corrosion will include all reactions at a metal/environment interface irrespective of whether the reaction is beneficial or detrimental to the metal concerned —no distinction is made between chemical or electropolishing of a metal in an acid and the adventitious deterioration of metal plant by acid attack. It follows, therefore, that a comprehensive work on the subject of corrosion should include an account of batteries, electrorefining, chemical machining, chemical and electrochemical polishing, etc. 

Push-down Automata push-down automata generalize finite automata by introducing an internal memory. Just as for finite automata, push-down automata have a finite input alphabet and a finite set of intermediate states, a subset of which constitutes the set of its output (or accepting) states. The difference is that push-down automata have an additional stack-space, consisting of some or all of the symbols of the machine s alphabet (along with perhaps some additional symbols to be used as internal markers) which they can use to store information for later use. We can therefore generalize our definition for finite automata (equation 6.4) to ... 

Figure 2.13. The distance between the upper inhouse limit (IHL) and the upper specification (SL) limits is defined by the CI(A). The risk of the real value being outside the SL grows from negligible (measured value A far inside IHL) to 50% (measured value E on SL). Note that the definition of the upper inhouse limit takes into account the details of the analytical method (n, X, m, Vres) to set the minimal separation between IHL and SL for an error probability for (Xmean > SL) of less than p - 0.025. The alarm limits (AL), as drawn here, are very conservative when there is more confidence in man and machine, the AL will be placed closer to the IHL. IHL and AL need not be symmetrical relative to the SL.

In practice, the stepper consists of a machine incorporating a light source, a photomask holder and a lens for focusing the pattern on the photoresist layer on the silicon wafer. The pattern is repeated clear across the wafer, step by step, hence the name. The lens system must be of highest quality so that definition of lines and areas remain accurate and do not overlap each other. 

Case Report Tabulation Data Definition Specification (Define.xml). Define.xml is the upcoming replacement for the data definition file (define.pdf) sent to the FDA with electronic submissions. Define.xml is based on the CDISC ODM model and is intended to provide a machine-readable version of define.pdf. Because define.xml is machine readable, the metadata about the submission data sets can be easily read by computer applications. This allows the FDA to work more easily with the data submitted to it. 

More specifically, the basic notions of a Turing Machine, of computable functions and of undecidable properties are needed for Chapter VI (Decision Problems) the definitions of recursive, primitive recursive and partial recursive functions are helpful for Section F of Chapter IV and two of the proofs in Chapter VI. The basic facts regarding regular sets, context-free languages and pushdown store automata are helpful in Chapter VIII (Monadic Recursion Schemes) and in the proof of Theorem 3.14. For Chapter V (Correctness and Program Verification) it is useful to know the basic notation and ideas of the first order predicate calculus a highly abbreviated version of this material appears as Appendix A. 

---