Results 231 to 240 of about 1,682,433 (269)

Linearity of Sequential Machines

IEEE Transactions on Electronic Computers, 1966
A sequential machine is defined to be linear if its next-state function and output function are linear transformations from their domains (vector spaces) to their ranges (also vector spaces). It is shown that this definition is equivalent to those given by other authors.
Yau, S. S., Wang, K. C.
openaire   +1 more source

Comparison of Linear Primary Permanent Magnet Vernier Machine and Linear Vernier Hybrid Machine

IEEE Transactions on Magnetics, 2014
This paper presents the comparison of linear primary permanent magnet vernier (LPPMV) machine and linear vernier hybrid (LVH) machine. The LPPMV machine and the LVH machine both operate based on the magnetic gear principle, hence possessing the advantages of low speed and high thrust force density.
Mo, L   +7 more
openaire   +2 more sources

Linear-motion electrical machines

Proceedings of the IEEE, 1970
A survey of linear-motion electrical machines is presented. Although various types of dc and ac linear machines are briefly mentioned, linear induction motors are the main concern of the paper and they are discussed in considerable detail. Based on topological considerations, a classification of these machines is presented and their development through
E.R. Laithwaite, S.A. Nasar
openaire   +1 more source

Optimal quantum machines by linear and non‐linear optics

Fortschritte der Physik, 2004
AbstractSince manipulations of qubits are constrained by the quantum mechanical rules, several classical information tasks can not be perfectly extended to the quantum world. The more relevant limitations in quantum information processing are the impossibility to perfectly clone any unknown qubit and to map it in its orthogonal state. Even if these two
SCIARRINO, Fabio, DE MARTINI, Francesco
openaire   +3 more sources

Uniform Modular Realizations and Linear Machines

IEEE Transactions on Computers, 1971
It is shown that a single-output Moore-type n-state linear machine may be realized with no more than 2n copies of the AND–OR-delay (AOD) module of Newborn, Weiner, and Hopcroft. This bound is significantly lower than that for arbitrary single-output Moore-type machines, which is 2n.
Gelenbe, S. Erol, Rossi, N.
openaire   +1 more source

Home - About - Disclaimer - Privacy