Acyanotic heart defectAn acyanotic heart defect, is a class of congenital heart defects. In these, blood is shunted (flows) from the left side of the heart to the right side of the heart, most often due to a structural defect (hole) in the interventricular septum. People often retain normal levels of oxyhemoglobin saturation in systemic circulation. This term is outdated, because a person with an acyanotic heart defect may show cyanosis (turn blue due to insufficient oxygen in the blood).
Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
Atrioventricular septal defectAtrioventricular septal defect (AVSD) or atrioventricular canal defect (AVCD), also known as "common atrioventricular canal" or "endocardial cushion defect" (ECD), is characterized by a deficiency of the atrioventricular septum of the heart that creates connections between all four of its chambers. It is a very specific combination of 3 defects: 1) Atrial Septal Defect (ASD), a hole in the wall between the right and left atria; 2) Ventricular Septal Defect (VSD), a hole in the wall between the right and left ventricles; and 3) Abnormalities of the mitral and/or tricuspid valves.
Atrial septal defectAtrial septal defect (ASD) is a congenital heart defect in which blood flows between the atria (upper chambers) of the heart. Some flow is a normal condition both pre-birth and immediately post-birth via the foramen ovale; however, when this does not naturally close after birth it is referred to as a patent (open) foramen ovale (PFO). It is common in patients with a congenital atrial septal aneurysm (ASA). After PFO closure the atria normally are separated by a dividing wall, the interatrial septum.
AlgorithmIn mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.
Short circuitA short circuit (sometimes abbreviated to short or s/c) is an electrical circuit that allows a current to travel along an unintended path with no or very low electrical impedance. This results in an excessive current flowing through the circuit. The opposite of a short circuit is an open circuit, which is an infinite resistance (or very high impedance) between two nodes. A short circuit is an abnormal connection between two nodes of an electric circuit intended to be at different voltages.
Randomized algorithmA randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables.
NAND gateIn digital electronics, a NAND gate (NOT-AND) is a logic gate which produces an output which is false only if all its inputs are true; thus its output is complement to that of an AND gate. A LOW (0) output results only if all the inputs to the gate are HIGH (1); if any input is LOW (0), a HIGH (1) output results. A NAND gate is made using transistors and junction diodes. By De Morgan's laws, a two-input NAND gate's logic may be expressed as =+, making a NAND gate equivalent to inverters followed by an OR gate.
Protective relayIn electrical engineering, a protective relay is a relay device designed to trip a circuit breaker when a fault is detected. The first protective relays were electromagnetic devices, relying on coils operating on moving parts to provide detection of abnormal operating conditions such as over-current, overvoltage, reverse power flow, over-frequency, and under-frequency. Microprocessor-based solid-state digital protection relays now emulate the original devices, as well as providing types of protection and supervision impractical with electromechanical relays.
OR gateThe OR gate is a digital logic gate that implements logical disjunction. The OR gate returns true if any of its inputs are true; otherwise it returns false. The input and output states are normally represented by different voltage levels. Any OR gate can be constructed with two or more inputs. It outputs a 1 if any of these inputs are 1, or outputs a 0 only if all inputs are 0. The inputs and outputs are binary digits ("bits") which have two possible logical states.
Digital electronicsDigital electronics is a field of electronics involving the study of digital signals and the engineering of devices that use or produce them. This is in contrast to analog electronics and analog signals. Digital electronic circuits are usually made from large assemblies of logic gates, often packaged in integrated circuits. Complex devices may have simple electronic representations of Boolean logic functions. The binary number system was refined by Gottfried Wilhelm Leibniz (published in 1705) and he also established that by using the binary system, the principles of arithmetic and logic could be joined.
XOR gateXOR gate (sometimes EOR, or EXOR and pronounced as Exclusive OR) is a digital logic gate that gives a true (1 or HIGH) output when the number of true inputs is odd. An XOR gate implements an exclusive or () from mathematical logic; that is, a true output results if one, and only one, of the inputs to the gate is true. If both inputs are false (0/LOW) or both are true, a false output results. XOR represents the inequality function, i.e., the output is true if the inputs are not alike otherwise the output is false.
