Boolean logic gate

The first observation consists merely of an alternative but natural interpretation of the presence or absence of balls the movement of balls is equated with the communication of binary signals. Once this interpretation is made, the second observation also becomes a natural one wherever balls collide, either among themselves or with some collection of rigid mirrors, the effect of the collision may be viewed as a Boolean logic gate. 

Renaud N, Joachim C (2011) Classical Boolean logic gates with quantum systems. J Phys A 44 155302... 

Yoshida, W., Yokobayashi, Y. (2007). Photonic boolean logic gates based on DNA aptamers. Chem Commun 2, 195-197. 

Figure 1 lays out the truth tables of some Boolean logic gates relevant to our discussion. Molecular-level examples of some of these have been detailed in a companion review titled Molecular Logic Gates, Supramolecular Devices, as well as in other reference works. Therefore, that exercise is not repeated here. Instead, we discuss logic gates... 

FTA is a top-down, deductive analytical method. In FTA, initiating primary events, such as component failures, human errors, and external events are traced through Boolean logic gates to an undesired top event, such as an aircraft crash or nuclear reactor core meltdown. 

Stock G, Pita M, Omatska M, Katz E. Boolean logic gates using enzymes as input signals. ChemBioChem 2008 9 1260-1266. 

A set G of logic gates is universal if an arbitrary ri-variable Boolean function T can be written as a composition of the logic gates in G a universal set of gates 9u- - dm is. sometimes also said to gorm a basis set for T. It is easy to show that the set consisting of the Boolean operators AND, OR and NOT, for example, is universal. ... 

FTA is a deductive method that uses Boolean logic symbols (i.e., AND gates, OR gates) to break down the causes of the top event into basic equipment failures and human errors. The analysts begin with the top event and identify the causes and the logical relationships between the causes and the top event. Each of the causes, called intermediate events, is examined in the same manner until the basic causes for every intermediate event have been identified. 

Then one must apply Boolean algebra to each logic gate to determine the probability of each intermediate event. Ultimately, the analysis calculates the probability for the top event. Example 36-1 illustrates the fundamentals of this process for the fault tree shown in Figure 36-5. 

Fault Tree Analysis (FTA) is a well known and widely used safety tool, implementing a deductive, top down approach. It starts with a top level hazard, which has to be known in advance and "works the way down" through all causal factors of this hazard, combined with Boolean Logic (mainly AND and OR gates). It can consider hardware, software and human errors and identifies both single and multiple points of failure. Both a quantitative and qualitative analysis is possible. 

Gate A transistor assembly that combines input signals according to Boolean logic to produce a specific output signal. 

As a specific example, we can consider H+-driven YES and PASS 1 logic gates 5 and 6, respectively, both of which carry the same fluorophore, that is, the same excitation and emission colors. However, tag 5 switches on its fluorescence as pH is reduced to low values while 6 shows pH-independent fluorescence. This is the distinction between the two tags. Many other distinctions, that is, other Boolean logic actions, can be built up in similar ways. The different pH-dependent fluorescence behavior of 5 and 6 arises from the presence of the tertiary amine receptor in 5 and its absence in 6. As seen in the previous sections, the amine is the donor component in the PET process whereas the anthracene fluorophore serves as the acceptor. Thus, fluorescence is minimal in neutral solutions, but under... 

---