Hiyama couplingThe Hiyama coupling is a palladium-catalyzed cross-coupling reaction of organosilanes with organic halides used in organic chemistry to form carbon–carbon bonds (C-C bonds). This reaction was discovered in 1988 by Tamejiro Hiyama and Yasuo Hatanaka as a method to form carbon-carbon bonds synthetically with chemo- and regioselectivity. The Hiyama coupling has been applied to the synthesis of various natural products.
Kumada couplingIn organic chemistry, the Kumada coupling is a type of cross coupling reaction, useful for generating carbon–carbon bonds by the reaction of a Grignard reagent and an organic halide. The procedure uses transition metal catalysts, typically nickel or palladium, to couple a combination of two alkyl, aryl or vinyl groups. The groups of Robert Corriu and Makoto Kumada reported the reaction independently in 1972. The reaction is notable for being among the first reported catalytic cross-coupling methods.
Suzuki reactionThe Suzuki reaction is an organic reaction, classified as a cross-coupling reaction, where the coupling partners are a boronic acid and an organohalide and the catalyst is a palladium(0) complex. It was first published in 1979 by Akira Suzuki, and he shared the 2010 Nobel Prize in Chemistry with Richard F. Heck and Ei-ichi Negishi for their contribution to the discovery and development of palladium-catalyzed cross-couplings in organic synthesis. This reaction is also known as the Suzuki–Miyaura reaction or simply as the Suzuki coupling.
Stille reactionThe Stille reaction is a chemical reaction widely used in organic synthesis. The reaction involves the coupling of two organic groups, one of which is carried as an organotin compound (also known as organostannanes). A variety of organic electrophiles provide the other coupling partner. The Stille reaction is one of many palladium-catalyzed coupling reactions. Allyl, alkenyl, aryl, benzyl,acyl halides (Cl, Br, I), pseudohalides (OTf, OPO(OR)2), OAc The R1 group attached to the trialkyltin is normally sp2-hybridized, including vinyl, and aryl groups.
Physics engineA physics engine is computer software that provides an approximate simulation of certain physical systems, such as rigid body dynamics (including collision detection), soft body dynamics, and fluid dynamics, of use in the domains of computer graphics, video games and film (). Their main uses are in video games (typically as middleware), in which case the simulations are in real-time. The term is sometimes used more generally to describe any software system for simulating physical phenomena, such as high-performance scientific simulation.
Soft-body dynamicsSoft-body dynamics is a field of computer graphics that focuses on visually realistic physical simulations of the motion and properties of deformable objects (or soft bodies). The applications are mostly in video games and films. Unlike in simulation of rigid bodies, the shape of soft bodies can change, meaning that the relative distance of two points on the object is not fixed. While the relative distances of points are not fixed, the body is expected to retain its shape to some degree (unlike a fluid).
Finite-state machineA finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.
Quantum finite automatonIn quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process. They provide a mathematical abstraction of real-world quantum computers. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFAs are, in turn, special cases of geometric finite automata or topological finite automata.
