id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
31,300 | The cluster-binding subdomains have the topology of an incomplete antiparallel β-barrel. One iron atom of the Rieske cluster in the domain is coordinated by two cysteine residues and the other is coordinated by two histidine residues through the Nδ atoms. The ligands coordinating the cluster originate from two loops;... | Rieske protein | 0.80451 |
31,301 | The crystal structures of a number of Rieske proteins are known. The overall fold, comprising two subdomains, is dominated by antiparallel β-structure and contains variable numbers of α-helices. The smaller "cluster-binding" subdomains in mitochondrial and chloroplast proteins are virtually identical, whereas the large... | Rieske protein | 0.80451 |
31,302 | However, the reverse is not true. For example, consider linear systems in two dimensions of the form x ˙ = A x {\displaystyle {\dot {x}}=Ax} . If the matrix, A {\displaystyle A} , has two positive real eigenvalues, the system has an unstable node; if the matrix has two complex eigenvalues with positive real part, the s... | Topologically conjugate | 0.804505 |
31,303 | More equivalence criteria can be studied if the flows, ϕ {\displaystyle \phi } and ψ {\displaystyle \psi } , arise from differential equations. Two dynamical systems defined by the differential equations, x ˙ = f ( x ) {\displaystyle {\dot {x}}=f(x)} and y ˙ = g ( y ) {\displaystyle {\dot {y}}=g(y)} , are said to be sm... | Topologically conjugate | 0.804505 |
31,304 | A space is realcompact if and only if it can be embedded homeomorphically as a closed subset in some (not necessarily finite) Cartesian power of the reals, with the product topology. Moreover, a (Hausdorff) space is realcompact if and only if it has the uniform topology and is complete for the uniform structure generat... | Realcompact space | 0.804501 |
31,305 | In mathematics, in the field of topology, a topological space is said to be realcompact if it is completely regular Hausdorff and it contains every point of its Stone–Čech compactification which is real (meaning that the quotient field at that point of the ring of real functions is the reals). Realcompact spaces have a... | Realcompact space | 0.804501 |
31,306 | Planète Sciences is a French voluntary association founded in 1962 dedicated to the sciences. The organization organizes the Coupe de France de robotique and Eurobot, an international amateur robotics contest | Planète Sciences | 0.804494 |
31,307 | How do mineral, and metal ore deposits form? What are the fundamental physics of plate tectonics and heat, mass, and fluid transfer through Earth's crust? How can people better interpret geophysical data used to determine the structure and properties of Earth's crust? | Scientific drilling | 0.804494 |
31,308 | Scientific drilling is used to address a wide range of problems, which cannot be addressed using rocks exposed on the surface or the seafloor. The Integrated Ocean Drilling Program has a broad set of research objectives, which can be divided into three principal themes: The nature of the deep biosphere and the oceanic ... | Scientific drilling | 0.804494 |
31,309 | The formation rules of a propositional calculus may, for instance, take a form such that; if we take Φ to be a propositional formula we can also take ¬ {\displaystyle \neg } Φ to be a formula; if we take Φ and Ψ to be a propositional formulas we can also take (Φ ∧ {\displaystyle \wedge } Ψ), (Φ → {\displaystyle \to } Ψ... | Formation rule | 0.804493 |
31,310 | A formal system (also called a logical calculus, or a logical system) consists of a formal language together with a deductive apparatus (also called a deductive system). The deductive apparatus may consist of a set of transformation rules (also called inference rules) or a set of axioms, or have both. A formal system i... | Formation rule | 0.804493 |
31,311 | When the input probabilities are themselves interval ranges, the Fréchet formulas still work as a probability bounds analysis. Hailperin considered the problem of evaluating probabilistic Boolean expressions involving many events in complex conjunctions and disjunctions. Some have suggested using the inequalities in va... | Fréchet inequalities | 0.804485 |
31,312 | It is evident that structurally the above inequalities are analogues of the classical Fréchet bounds for the logical conjunction. It is also worth to notice that when the matrices ρ A , ρ B {\displaystyle \rho ^{A},\rho ^{B}} and ρ A B {\displaystyle \rho ^{AB}} are restricted to be diagonal, we obtain the classical Fr... | Fréchet inequalities | 0.804485 |
31,313 | Similar bounds hold also in quantum mechanics in the case of separable quantum systems and that entangled states violate these bounds. Consider a composite quantum system. In particular, we focus on a composite quantum system AB made by two finite subsystems denoted as A and B. Assume that we know the density matrix of... | Fréchet inequalities | 0.804485 |
31,314 | In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions (AND operat... | Frechet inequalities | 0.804485 |
31,315 | Glucose oxidase (GOX) catalyzes the oxidation of β-D-glucose to D-glucono-δ-lactone with the simultaneous reduction of enzyme-bound flavin. GOX exists as a homodimer, with each subunit binding one FAD molecule. Crystal structures show that FAD binds in a deep pocket of the enzyme near the dimer interface. Studies showe... | Flavin adenine dinucleotide | 0.804482 |
31,316 | German scientists Otto Warburg and Walter Christian discovered a yeast derived yellow protein required for cellular respiration in 1932. Their colleague Hugo Theorell separated this yellow enzyme into apoenzyme and yellow pigment, and showed that neither the enzyme nor the pigment was capable of oxidizing NADH on their... | Flavin adenine dinucleotide | 0.804482 |
31,317 | Optogenetics allows control of biological events in a non-invasive manner. The field has advanced in recent years with a number of new tools, including those to trigger light sensitivity, such as the Blue-Light-Utilizing FAD domains (BLUF). BLUFs encode a 100 to 140 amino acid sequence that was derived from photorecept... | Flavin adenine dinucleotide | 0.804482 |
31,318 | In computer science, loop dependence analysis is a process which can be used to find dependencies within iterations of a loop with the goal of determining different relationships between statements. These dependent relationships are tied to the order in which different statements access memory locations. Using the anal... | Loop dependence analysis | 0.804482 |
31,319 | Loop dependence analysis occur on a normalized loop of the form: for i1 until U1 do for i2 until U2 do ... for in until Un do body done ... done done where body may contain: S1 a := ... ... S2 ... := a Where a is an m-dimensional array and fn, hn, etc. are functions mapping from all iteration indexes (in) to a memory a... | Loop dependence analysis | 0.804482 |
31,320 | The integral form of Gauss's law for magnetism states: where S is any closed surface (see image right), and dS is a vector, whose magnitude is the area of an infinitesimal piece of the surface S, and whose direction is the outward-pointing surface normal (see surface integral for more details). The left-hand side of th... | Gauss' law for magnetism | 0.804479 |
31,321 | In physics, Gauss's law for magnetism is one of the four Maxwell's equations that underlie classical electrodynamics. It states that the magnetic field B has divergence equal to zero, in other words, that it is a solenoidal vector field. It is equivalent to the statement that magnetic monopoles do not exist. Rather tha... | Gauss' law for magnetism | 0.804479 |
31,322 | These forms are equivalent due to the divergence theorem. The name "Gauss's law for magnetism" is not universally used. The law is also called "Absence of free magnetic poles". It is also referred to as the "transversality requirement" because for plane waves it requires that the polarization be transverse to the direc... | Gauss' law for magnetism | 0.804479 |
31,323 | As detailed in the article on infinite-dimensional Lebesgue measure, the only locally finite and translation-invariant Borel measure on an infinite-dimensional separable normed space is the trivial measure. However, it is possible to define Gaussian measures on infinite-dimensional topological vector spaces. The struct... | Set function | 0.804476 |
31,324 | As with any convergent series of real numbers, by the Riemann series theorem, the series ∑ i = 1 ∞ μ ( F i ) = lim N → ∞ μ ( F 1 ) + μ ( F 2 ) + ⋯ + μ ( F N ) {\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)={\displaystyle \lim _{N\to \infty }}\mu \left(F_{1}\right)+\mu \left(F_{2}\right)+\... | Set function | 0.804476 |
31,325 | {\displaystyle E\cup F,E\cap F\in {\mathcal {F}}.} Every finitely additive function on a field of sets is modular. In geometry, a set function valued in some abelian semigroup that possess this property is known as a valuation. | Set function | 0.804476 |
31,326 | Suppose that μ {\displaystyle \mu } is a set function on a semialgebra F {\displaystyle {\mathcal {F}}} over Ω {\displaystyle \Omega } and let which is the algebra on Ω {\displaystyle \Omega } generated by F . {\displaystyle {\mathcal {F}}.} The archetypal example of a semialgebra that is not also an algebra is the fam... | Set function | 0.804476 |
31,327 | "John Searle, on the other hand, suggests that a thinking machine is, at best, a simulation, and writes "No one supposes that computer simulations of a five-alarm fire will burn the neighborhood down or that a computer simulation of a rainstorm will leave us all drenched." The essential difference between a simulated m... | Synthetic intelligence | 0.804476 |
31,328 | The term was used by Haugeland in 1986 to describe artificial intelligence research up to that point, which he called "good old fashioned artificial intelligence" or "GOFAI". AI's first generation of researchers firmly believed their techniques would lead to real, human-like intelligence in machines. After the first AI... | Synthetic intelligence | 0.804476 |
31,329 | Synthetic intelligence (SI) is an alternative/opposite term for artificial intelligence emphasizing that the intelligence of machines need not be an imitation or in any way artificial; it can be a genuine form of intelligence. John Haugeland proposes an analogy with simulated diamonds and synthetic diamonds—only the sy... | Synthetic intelligence | 0.804476 |
31,330 | If τ {\displaystyle \tau } is a topology on Ω {\displaystyle \Omega } then a set function μ {\displaystyle \mu } is said to be: a Borel measure if it is a measure defined on the σ-algebra of all Borel sets, which is the smallest σ-algebra containing all open subsets (that is, containing τ {\displaystyle \tau } ). a Bai... | Set function | 0.804476 |
31,331 | If μ: F → {\displaystyle \mu :{\mathcal {F}}\to } is a pre-measure on a ring of sets (such as an algebra of sets) F {\displaystyle {\mathcal {F}}} over Ω {\displaystyle \Omega } then μ {\displaystyle \mu } has an extension to a measure μ ¯: σ ( F ) → {\displaystyle {\overline {\mu }}:\sigma ({\mathcal {F}})\to } on t... | Set function | 0.804476 |
31,332 | If μ ∗: ℘ ( Ω ) → {\displaystyle \mu ^{*}:\wp (\Omega )\to } is an outer measure on a set Ω , {\displaystyle \Omega ,} where (by definition) the domain is necessarily the power set ℘ ( Ω ) {\displaystyle \wp (\Omega )} of Ω , {\displaystyle \Omega ,} then a subset M ⊆ Ω {\displaystyle M\subseteq \Omega } is called μ ∗... | Set function | 0.804476 |
31,333 | a complex measure if it is a countably additive complex-valued set function μ: F → C {\displaystyle \mu :{\mathcal {F}}\to \mathbb {C} } whose domain is a σ-algebra. By definition, a complex measure never takes ± ∞ {\displaystyle \pm \infty } as a value and so has a null empty set.a random measure if it is a measure-va... | Set function | 0.804476 |
31,334 | For example, the counting measure on R {\displaystyle \mathbb {R} } (whose domain is ℘ ( R ) {\displaystyle \wp (\mathbb {R} )} ) is decomposable but not 𝜎-finite.a vector measure if it is a countably additive set function μ: F → X {\displaystyle \mu :{\mathcal {F}}\to X} valued in a topological vector space X {\displ... | Set function | 0.804476 |
31,335 | {\displaystyle 1.} an outer measure if it is non-negative, countably subadditive, has a null empty set, and has the power set ℘ ( Ω ) {\displaystyle \wp (\Omega )} as its domain. Outer measures appear in the Carathéodory's extension theorem and they are often restricted to Carathéodory measurable subsetsa signed measur... | Set function | 0.804476 |
31,336 | a measure if it is a pre-measure whose domain is a σ-algebra. That is to say, a measure is a non-negative countably additive set function on a σ-algebra that has a null empty set. a probability measure if it is a measure that has a mass of 1. | Set function | 0.804476 |
31,337 | This set function can be extended to the Lebesgue outer measure on R , {\displaystyle \mathbb {R} ,} which is the translation-invariant set function λ ∗: ℘ ( R ) → {\displaystyle \lambda ^{\!*\! }:\wp (\mathbb {R} )\to } that sends a subset E ⊆ R {\displaystyle E\subseteq \mathbb {R} } to the infimum Lebesgue outer me... | Set function | 0.804476 |
31,338 | The Lebesgue measure on R {\displaystyle \mathbb {R} } is a set function that assigns a non-negative real number to every set of real numbers that belongs to the Lebesgue σ {\displaystyle \sigma } -algebra.Its definition begins with the set Intervals ( R ) {\displaystyle \operatorname {Intervals} (\mathbb {R} )} of a... | Set function | 0.804476 |
31,339 | Examples of set functions include: The function assigning densities to sufficiently well-behaved subsets A ⊆ { 1 , 2 , 3 , … } , {\displaystyle A\subseteq \{1,2,3,\ldots \},} is a set function. A probability measure assigns a probability to each set in a σ-algebra. Specifically, the probability of the empty set is zero... | Set function | 0.804476 |
31,340 | The many tiny pores in porous silicon give it an enormous internal surface area, up to 1,000 m2/cm3. When exposed to an oxidant, especially a liquid oxidant, the high surface-area to volume ratio of p-Si creates a very efficient burn, accompanied by nano-explosions, and sometimes by ball-lightning-like plasmoids with, ... | Properties of metals, metalloids and nonmetals | 0.804475 |
31,341 | Boron Boron is the only element with a partially disordered structure in its most thermodynamically stable crystalline form. Boron, antimony These elements are record holders within the field of superacid chemistry. For seven decades, fluorosulfonic acid HSO3F and trifluoromethanesulfonic acid CF3SO3H were the stronges... | Properties of metals, metalloids and nonmetals | 0.804475 |
31,342 | DMM), a volatile colourless liquid, has been described as a 15. It is so dangerous that scientists have been encouraged to use less-toxic mercury compounds wherever possible. In 1997, Karen Wetterhahn, a professor of chemistry specialising in toxic metal exposure, died of mercury poisoning ten months after a few drops ... | Properties of metals, metalloids and nonmetals | 0.804475 |
31,343 | This concentration is comparable with that of magma in Earth's upper mantle. Although of considerable selenological interest, this insight does not mean that water is easily available since the sample originated many kilometers below the surface, and the inclusions are so difficult to access that it took 39 years to fi... | Lunar science | 0.804474 |
31,344 | Smart Eye provides automotive OEMs and Tier 1 suppliers with road-ready driver monitoring software that can be embedded in new vehicles that are produced. The company's AI-based software uses in-car cameras to analyze eye gaze, head movement, body posture, activities and objects to determine dangerous driving behavior ... | Smart Eye | 0.804474 |
31,345 | Smart Eye AB, is a Swedish artificial intelligence (AI) company founded in 1999 and headquartered in Gothenburg, Sweden. Smart Eye develops Human Insight AI, technology that understands, supports and predicts human behavior in complex environments. Smart Eye develops and deploys several core technologies that help gain... | Smart Eye | 0.804474 |
31,346 | Smart Eye AB was founded in 1999 with the vision of bridging the gap between humans and machines. Its first product was real-time and completely non-invasive eye tracking. 2001 – Release of Smart Eye Pro, a system with flexible camera configuration 2005 – Release of AntiSleep, a mono camera system built on cost efficie... | Smart Eye | 0.804474 |
31,347 | For example, to find the entropy change q r e v T {\displaystyle {\frac {q_{\mathrm {rev} }}{T}}} from 300 K to 310 K, measure the amount of energy transferred at dozens or hundreds of temperature increments, say from 300.00 K to 300.01 K and then 300.01 to 300.02 and so on, dividing the q by each T, and finally adding... | Introduction to entropy | 0.804472 |
31,348 | This is always true in spontaneous events in a thermodynamic system and it shows the predictive importance of entropy: the final net entropy after such an event is always greater than was the initial entropy. As the temperature of the cool water rises to that of the room and the room further cools imperceptibly, the su... | Introduction to entropy | 0.804472 |
31,349 | Descriptions of thermodynamic (heat) entropy on the microscopic level are found in statistical thermodynamics and statistical mechanics. For most of the 20th century, textbooks tended to describe entropy as "disorder", following Boltzmann's early conceptualisation of the "motional" (i.e. kinetic) energy of molecules. M... | Introduction to entropy | 0.804472 |
31,350 | Originally, entropy was named to describe the "waste heat", or more accurately, energy loss, from heat engines and other mechanical devices which could never run with 100% efficiency in converting energy into work. Later, the term came to acquire several additional descriptions, as more was understood about the behavio... | Introduction to entropy | 0.804472 |
31,351 | Progress on Eurler's conjecture did not pick up again until the late 19th century. The next theorem and corollary concern triangulated polyhedra. Theorem. | Geometric rigidity | 0.804471 |
31,352 | The 2 {\displaystyle 2} -skeleton of any polyhedral framework of the octahedron in 3 {\displaystyle 3} -dimensions is rigid. However, there exists a framework of the octahedron whose 1 {\displaystyle 1} -skeleton is not rigid in 3 {\displaystyle 3} -dimensions. The proof of the latter part of this theorem shows that th... | Geometric rigidity | 0.804471 |
31,353 | Much work has gone into proving this conjecture, which has now been proved false by counterexample. The first major result is by Cauchy in 1813 and is known as Cauchy's theorem. Cauchy's Theorem. | Geometric rigidity | 0.804471 |
31,354 | The configuration space C ( G , δ ) {\displaystyle {\mathcal {C}}(G,\delta )} is an algebraic set. Continuous and trivial motions. A continuous motion is a continuous path in C ( G , δ ) {\displaystyle {\mathcal {C}}(G,\delta )} that describes the physical motion between two frameworks of ( G , δ ) {\displaystyle (G,\d... | Geometric rigidity | 0.804471 |
31,355 | Every closed simply connected polyhedral surface with a 3 {\displaystyle 3} -dimensional framework is generically rigid. This theorem demonstrates that Euler's conjecture is true for almost all polyhedra. However, a non-generic polyhedron was found that is not rigid in 3 {\displaystyle 3} -dimensions, disproving the co... | Geometric rigidity | 0.804471 |
31,356 | This conjecture has been proved for some special cases. The next result applies in the generic setting, i.e., to almost all polyhedra with the same combinatorial structure, see structural rigidity. Theorem. | Geometric rigidity | 0.804471 |
31,357 | The following result shows that the triangulation condition in the above theorem is necessary. Theorem. The 1 {\displaystyle 1} -skeleton of a strictly convex polyhedron embedded in 3 {\displaystyle 3} -dimensions which has at least one non-triangluar face is not rigid. | Geometric rigidity | 0.804471 |
31,358 | In other words, if we treat the convex polyhedra as a set of rigid plates, i.e., as a variant of a body-bar-hinge framework, then the framework is rigid. The next result, by Bricard in 1897, shows that the strict convexity condition can be dropped for 2 {\displaystyle 2} -skeletons of the octahedron. Theorem. | Geometric rigidity | 0.804471 |
31,359 | The following corollary of Cauchy's theorem relates this result to rigidity. Corollary. The 2-skeleton of a strictly convex polyhedral framework in 3 {\displaystyle 3} -dimensions is rigid. | Geometric rigidity | 0.804471 |
31,360 | The following is a sufficient condition for global rigidity of generic tensegrity frameworks based on stress matrices. Theorem. Let ( G , p ) {\displaystyle (G,p)} be a d {\displaystyle d} -dimensional generic tensegrity framework with a proper equilibrium stress ω {\displaystyle \omega } . If the stress matrix Ω {\dis... | Geometric rigidity | 0.804471 |
31,361 | Such a packing can be modelled as a tensegrity with struts between pairs of tangent spheres and between the boundaries of the container and the spheres tangent to them. This model has been studied to compute local maximal densities of these packings.The next result demonstrates when tensegrity frameworks have the same ... | Geometric rigidity | 0.804471 |
31,362 | The following is a sufficient condition for second-order rigidity. Theorem. Let ( G , p ) {\displaystyle (G,p)} be a d {\displaystyle d} -dimensional tensegrity framework. | Geometric rigidity | 0.804471 |
31,363 | Theorem. Let ( G , p ) {\displaystyle (G,p)} be a d {\displaystyle d} -dimensional tensegrity framework with at least one cable or strut. Then ( G , p ) {\displaystyle (G,p)} is infinitesimally rigid in d {\displaystyle d} -dimensions if it is rigid in d {\displaystyle d} -dimensions as a bar-joint framework and has a ... | Geometric rigidity | 0.804471 |
31,364 | The following is a necessary condition for rigidity. Theorem. | Geometric rigidity | 0.804471 |
31,365 | Theorem. Let ( G , p ) {\displaystyle (G,p)} be a d {\displaystyle d} -dimensional tensegrity framework where: the vertices of G {\displaystyle G} are realized as a strictly convex polygon; the bars form a Hamilton cycle on the boundary of this polygon; and there are no struts. Then, ( G , p ) {\displaystyle (G,p)} is ... | Geometric rigidity | 0.804471 |
31,366 | Theorem. A graph G {\displaystyle G} has an infinitesimally rigid tensegrity framework in d {\displaystyle d} -dimensions, for some partition of the edges of G {\displaystyle G} into bars, cables, and struts if and only if G {\displaystyle G} is generically edge-redundantly rigid in d {\displaystyle d} -dimensions. The... | Geometric rigidity | 0.804471 |
31,367 | A d {\displaystyle d} -dimensional framework ( G , p ) {\displaystyle (G,p)} of a linkage ( G , δ ) {\displaystyle (G,\delta )} is globally rigid in d {\displaystyle d} -dimensions if all frameworks in the configuration space C ( G , δ ) {\displaystyle {\mathcal {C}}(G,\delta )} are equivalent up to trivial motions, i.... | Geometric rigidity | 0.804471 |
31,368 | Each of the following statements is sufficient for a d {\displaystyle d} -dimensional framework to be infinitesimally rigid in d {\displaystyle d} -dimensions: all its infinitesimal motions are trivial; the dimension of the kernel of R ( p ) {\displaystyle R(p)} is ( d + 1 2 ) {\displaystyle d+1 \choose 2} ; or the ran... | Geometric rigidity | 0.804471 |
31,369 | In discrete geometry, geometric rigidity is a theory for determining if a geometric constraint system (GCS) has finitely many d {\displaystyle d} -dimensional solutions, or frameworks, in some metric space. A framework of a GCS is rigid in d {\displaystyle d} -dimensions, for a given d {\displaystyle d} if it is an iso... | Geometric rigidity | 0.80447 |
31,370 | Several years after their identification of a Leukotriene B4 (LTB4) receptor termed BLT1 or BLTR1 and encoded by the LTB4R1 gene, Shimizu and colleagues identified a second LTB4 receptor, BLT2 or BLTR2, encoded by the LTB4R2 gene. LTBR1 and LTBR2 encode for proteins with 45% amino acid identity that belong to the G pro... | Leukotriene B4 receptor 2 | 0.80447 |
31,371 | In mathematics, compactly generated can refer to: Compactly generated group, a topological group which is algebraically generated by one of its compact subsets Compactly generated space, a topological space whose topology is coherent with the family of all compact subspaces | Compactly generated | 0.804467 |
31,372 | The aim of the soft chemistry is to synthesize materials, drawing capacity of living beings - more or less basic - such as diatoms capable of producing glass from silicates dissolved. It is a new branch of materials science that differs from conventional solid-state chemistry and its application to the intense energy t... | Soft chemical | 0.804465 |
31,373 | These different structures are more or less composite mobilized a wide range of applications ranging from health to the needs of the conquest of space. Beyond its mode of synthesis, a compound with the label soft chemistry combines the advantages of the mineral (resistance, transparency, repetition patterns, etc.) and ... | Soft chemical | 0.804465 |
31,374 | His mode of synthesis is similar generally for reactions involved in the polymerizations based on organic and the establishment of solutions reactive energy intake without essential polycondensation. The fundamental interest of this kind of polymerization mineral obtained at room temperature is to preserve organic mole... | Soft chemical | 0.804465 |
31,375 | Soft chemistry (also known as chimie douce) is a type of chemistry that uses reactions at ambient temperature in open reaction vessels with reactions similar to those occurring in biological systems. | Soft chemical | 0.804465 |
31,376 | The hydrogen atom has special significance in quantum mechanics and quantum field theory as a simple two-body problem physical system which has yielded many simple analytical solutions in closed-form. | Hydrogen wavefunction | 0.804465 |
31,377 | Given that the hydrogen atom contains a nucleus and an electron, quantum mechanics allows one to predict the probability of finding the electron at any given radial distance r {\displaystyle r} . It is given by the square of a mathematical function known as the "wavefunction", which is a solution of the Schrödinger equ... | Hydrogen wavefunction | 0.804465 |
31,378 | Pharmacognosy Research is a peer-reviewed open-access medical journal published on behalf of the Pharmacognosy Network Worldwide. The journal publishes articles on the subject of pharmacognosy, natural products, and phytochemistry and is indexed with CASPUR, EBSCO, ProQuest, and Scopus. | Pharmacognosy Research | 0.804464 |
31,379 | State space search often differs from traditional computer science search methods because the state space is implicit: the typical state space graph is much too large to generate and store in memory. Instead, nodes are generated as they are explored, and typically discarded thereafter. A solution to a combinatorial sea... | State space search | 0.804464 |
31,380 | State space search is a process used in the field of computer science, including artificial intelligence (AI), in which successive configurations or states of an instance are considered, with the intention of finding a goal state with the desired property. Problems are often modelled as a state space, a set of states t... | State space search | 0.804464 |
31,381 | Multiple, sometimes overlapping and conflicting terms are employed for similar concepts – e.g., multilateration without modification has been used for aviation systems employing both true-ranges and pseudo-ranges. Moreover, different fields of endeavor may employ different terms. In geometry, trilateration is defined a... | Pseudorange multilateration | 0.804463 |
31,382 | In 2017, Cold Atom Laboratory (CAL), an experimental instrument was developed for launch to the International Space Station (ISS) in 2018. The instrument has created extremely cold conditions in the microgravity environment of the ISS leading to the formation of Bose–Einstein condensates. In this space-based laboratory... | Absolute Zero | 0.804463 |
31,383 | A Bose–Einstein condensate (BEC) is a state of matter of a dilute gas of weakly interacting bosons confined in an external potential and cooled to temperatures very near absolute zero. Under such conditions, a large fraction of the bosons occupy the lowest quantum state of the external potential, at which point quantum... | Absolute Zero | 0.804463 |
31,384 | The British anthropologist Frederic Wood Jones and the South African paleontologist Robert Broom supported a neo-Lamarckian view of human evolution. The German anthropologist Hermann Klaatsch relied on a neo-Lamarckian model of evolution to try and explain the origin of bipedalism. Neo-Lamarckism remained influential i... | Soft inheritance | 0.804456 |
31,385 | The selection of basis vectors against to measure a quantum state will influence the outcome of the measurement. : 30–35: 22, 84–85, 185–188 See change of basis and Von Neumann entropy for details. In this article, we always use the computational basis, which means that we have labeled the 2 n {\displaystyle 2^{n}} bas... | Quantum logic gate | 0.804455 |
31,386 | The sum of all probabilities for all outcomes must always be equal to 1. Another way to say this is that the Pythagorean theorem generalized to C 2 n {\displaystyle \mathbb {C} ^{2^{n}}} has that all quantum states | Ψ ⟩ {\displaystyle |\Psi \rangle } with n qubits must satisfy 1 = ∑ x = 0 2 n − 1 | a x | 2 , {\textsty... | Quantum logic gate | 0.804455 |
31,387 | The IBM mainframe z/OS operating system or platform has arguably the most highly refined and evolved set of batch processing facilities owing to its origins, long history, and continuing evolution. Today such systems commonly support hundreds or even thousands of concurrent online and batch tasks within a single operat... | Batch processing | 0.804455 |
31,388 | However, drawing the sample contains an element of randomness; hence, the numerical descriptors from the sample are also prone to uncertainty. To draw meaningful conclusions about the entire population, inferential statistics are needed. It uses patterns in the sample data to draw inferences about the population repres... | Statistical analyses | 0.804454 |
31,389 | When a census is not feasible, a chosen subset of the population called a sample is studied. Once a sample that is representative of the population is determined, data is collected for the sample members in an observational or experimental setting. Again, descriptive statistics can be used to summarize the sample data. | Statistical analyses | 0.804454 |
31,390 | This may be organized by governmental statistical institutes. Descriptive statistics can be used to summarize the population data. Numerical descriptors include mean and standard deviation for continuous data (like income), while frequency and percentage are more useful in terms of describing categorical data (like edu... | Statistical analyses | 0.804454 |
31,391 | Statistics is a mathematical body of science that pertains to the collection, analysis, interpretation or explanation, and presentation of data, or as a branch of mathematics. Some consider statistics to be a distinct mathematical science rather than a branch of mathematics. While many scientific investigations make us... | Statistical analyses | 0.804454 |
31,392 | Statistical techniques are used in a wide range of types of scientific and social research, including: biostatistics, computational biology, computational sociology, network biology, social science, sociology and social research. Some fields of inquiry use applied statistics so extensively that they have specialized te... | Statistical analyses | 0.804454 |
31,393 | In electrical engineering, a common scheme is to gather all the voltage variables on one side and all the current variables on the other regardless of which are inputs or outputs. This results in all the elements of the transfer matrix being in units of impedance. The concept of impedance (and hence impedance matrices)... | Transfer function matrix | 0.804454 |
31,394 | In a system that consists of multiple energy domains, transfer matrices are required that can handle components with ports in different domains. In robotics and mechatronics, actuators are required. These usually consist of a transducer converting, for instance, signals from the control system in the electrical domain ... | Transfer function matrix | 0.804454 |
31,395 | The matrix is particularly useful when it is a proper rational matrix, that is, all its elements are proper rational functions. In this case the state-space representation can be applied.In systems engineering, the overall system transfer matrix G (s) is decomposed into two parts: H (s) representing the system being co... | Transfer function matrix | 0.804454 |
31,396 | The matrix representation of linear algebraic equations has been known for some time. Poincaré in 1907 was the first to describe a transducer as a pair of such equations relating electrical variables (voltage and current) to mechanical variables (force and velocity). Wegel, in 1921, was the first to express these equat... | Transfer function matrix | 0.804453 |
31,397 | 1983 - Orifice-type pulse tube refrigerator invented by Mikulin, Tarasov, and Shkrebyonock 1986 – Karl Alexander Müller and J. Georg Bednorz discover high-temperature superconductivity 1995 – Eric Cornell and Carl Wieman create the first Bose–Einstein condensate, using a dilute gas of Rubidium-87 cooled to 170 nK. They... | Low-temperature technology timeline | 0.804453 |
31,398 | The following is a timeline of low-temperature technology and cryogenic technology (refrigeration down to close to absolute zero, i.e. –273.15 °C, –459.67 °F or 0 K). It also lists important milestones in thermometry, thermodynamics, statistical physics and calorimetry, that were crucial in development of low temperatu... | Low-temperature technology timeline | 0.804453 |
31,399 | However most users choose passwords in predictable ways and many passwords are short enough that all possible combinations can be tested if fast hashes are used, even if the hash is rated secure against preimage attacks. Special hashes called key derivation functions have been created to slow searches. See Password cra... | Preimage resistance | 0.80445 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.