Paper machineA paper machine (or paper-making machine) is an industrial machine which is used in the pulp and paper industry to create paper in large quantities at high speed. Modern paper-making machines are based on the principles of the Fourdrinier Machine, which uses a moving woven mesh to create a continuous paper web by filtering out the fibres held in a paper stock and producing a continuously moving wet mat of fibre. This is dried in the machine to produce a strong paper web.
Register machineIn mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. The register machine gets its name from its use of one or more "registers". In contrast to the tape and head used by a Turing machine, the model uses multiple, uniquely addressed registers, each of which holds a single positive integer.
Electron-beam processingElectron-beam processing or electron irradiation (EBI) is a process that involves using electrons, usually of high energy, to treat an object for a variety of purposes. This may take place under elevated temperatures and nitrogen atmosphere. Possible uses for electron irradiation include sterilization, alteration of gemstone colors, and cross-linking of polymers. Electron energies typically vary from the keV to MeV range, depending on the depth of penetration required.
Renewable natural gasRenewable natural gas (RNG), also known as biomethane or sustainable natural gas (SNG), is a biogas which has been upgraded to a quality similar to fossil natural gas and has a methane concentration of 90% or greater. By removing CO2 and other impurities from biogas, and increasing the concentration of methane to a level similar to fossil natural gas, it becomes possible to distribute RNG to customers via existing gas pipeline networks. RNG can be used in existing appliances, including vehicles with natural gas burning engines (natural gas vehicles).
Crystal radioA crystal radio receiver, also called a crystal set, is a simple radio receiver, popular in the early days of radio. It uses only the power of the received radio signal to produce sound, needing no external power. It is named for its most important component, a crystal detector, originally made from a piece of crystalline mineral such as galena. This component is now called a diode.
Bravais latticeIn geometry and crystallography, a Bravais lattice, named after , is an infinite array of discrete points generated by a set of discrete translation operations described in three dimensional space by where the ni are any integers, and ai are primitive translation vectors, or primitive vectors, which lie in different directions (not necessarily mutually perpendicular) and span the lattice. The choice of primitive vectors for a given Bravais lattice is not unique.
Oracle machineIn complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to solve certain problems in a single operation. The problem can be of any complexity class. Even undecidable problems, such as the halting problem, can be used. An oracle machine can be conceived as a Turing machine connected to an oracle.
Cathode rayCathode rays or electron beam (e-beam) are streams of electrons observed in discharge tubes. If an evacuated glass tube is equipped with two electrodes and a voltage is applied, glass behind the positive electrode is observed to glow, due to electrons emitted from the cathode (the electrode connected to the negative terminal of the voltage supply). They were first observed in 1859 by German physicist Julius Plücker and Johann Wilhelm Hittorf, and were named in 1876 by Eugen Goldstein Kathodenstrahlen, or cathode rays.
Distributive latticeIn mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set union and intersection. Indeed, these lattices of sets describe the scenery completely: every distributive lattice is—up to isomorphism—given as such a lattice of sets. As in the case of arbitrary lattices, one can choose to consider a distributive lattice L either as a structure of order theory or of universal algebra.
Complemented latticeIn the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0. Complements need not be unique. A relatively complemented lattice is a lattice such that every interval [c, d], viewed as a bounded lattice in its own right, is a complemented lattice. An orthocomplementation on a complemented lattice is an involution that is order-reversing and maps each element to a complement.
