id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
20,200 | Other large numbers, as regards length and time, are found in astronomy and cosmology. For example, the current Big Bang model suggests that the universe is 13.8 billion years (4.355 × 1017 seconds) old, and that the observable universe is 93 billion light years across (8.8 × 1026 metres), and contains about 5 × 1022 s... | Large numbers | 0.811013 |
20,201 | Large numbers are numbers significantly larger than those typically used in everyday life (for instance in simple counting or in monetary transactions), appearing frequently in fields such as mathematics, cosmology, cryptography, and statistical mechanics. They are typically large positive integers, or more generally, ... | Large numbers | 0.811013 |
20,202 | Therefore, the nuclear physics information that can be obtained from the investigation of the isomeric shift, is superior to what can be obtained from isotopic-shift studies. The measurements through the isomeric shift of e.g. the difference of nuclear radii of the excited and ground state constitute one of the most se... | Isomeric shift | 0.811009 |
20,203 | The notion of isomer also appears in other fields such as chemistry and meteorology. Therefore, in the first publications devoted to this effect the name nuclear isomeric shift on spectral lines was used. Before the discovery of the Mössbauer effect, the isomeric shift referred exclusively to atomic spectra; this expla... | Isomeric shift | 0.811009 |
20,204 | By measuring this shift, one obtains important and extremely precise information, both about the nuclear isomer states and about the physical, chemical or biological environment of the atoms, represented by the electronic wave functions. Under its Mössbauer variant, the isomeric shift has found important applications i... | Isomeric shift | 0.811009 |
20,205 | Word Processing in Groups is a monograph in mathematics on the theory of automatic groups; these are a type of abstract algebra whose operations are defined by the behavior of finite automata. The book's authors are David B. A. Epstein, James W. Cannon, Derek F. Holt, Silvio V. F. Levy, Mike Paterson, and William Thurs... | Word Processing in Groups | 0.811009 |
20,206 | Although not primarily a textbook, the first part of the book could be used as the basis for a graduate course. More generally, reviewer Gilbert Baumslag recommends it "very strongly to everyone who is interested in either group theory or topology, as well as to computer scientists." Baumslag was an expert in a related... | Word Processing in Groups | 0.811009 |
20,207 | The book is divided into two parts, one on the basic theory of these structures and another on recent research, connections to geometry and topology, and other related topics.The first part has eight chapters. They cover automata theory and regular languages, and the closure properties of regular languages under logica... | Word Processing in Groups | 0.811009 |
20,208 | In quantum mechanics, in particular quantum information, the Range criterion is a necessary condition that a state must satisfy in order to be separable. In other words, it is a separability criterion. | Range criterion | 0.811007 |
20,209 | A (real) irrational number has an infinite non-repeating representation in all integer bases. Examples are the non-solvable nth roots y = x n {\displaystyle y={\sqrt{x}}} with y n = x {\displaystyle y^{n}=x} and y ∉ Q, numbers which are called algebraic, or numbers like π , e {\displaystyle \pi ,e} which are transcende... | Place value notation | 0.811007 |
20,210 | In computer science, an abstract machine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions. It is similar to a mathematical function in that it receives inputs and produces outputs based on predefined rules. Abstract machines vary from literal machines in that the... | Abstract machine | 0.811002 |
20,211 | Predicate calculus (first order logic) is the foundation of logic programming languages. The most well-known logic programming language is Prolog. The rules in Prolog are written in a uniform format known as universally quantified 'Horn clauses', which means to begin the calculation that attempts to discover a proof of... | Abstract machine | 0.811002 |
20,212 | The Eschenmoser sulfide contraction is an organic reaction first described by Albert Eschenmoser for the synthesis of 1,3-dicarbonyl compounds from a thioester. The method requires a base and a tertiary phosphine. The method is of some relevance to organic chemistry and has been notably applied in the vitamin B12 total... | Eschenmoser sulfide contraction | 0.810996 |
20,213 | Tim Maudlin writes that quantum "logic 'solves' the problem by making the problem impossible to state." Quantum logic remains in limited use among logicians as an extremely pathological counterexample (Dalla Chiara and Giuntini: "Why quantum logics? Simply because 'quantum logics are there!'"). Although the central in... | Quantum Logic | 0.810996 |
20,214 | It is far from evident (albeit true) that quantum logic is a logic, in the sense of describing a process of reasoning, as opposed to a particularly convenient language to summarize the measurements performed by quantum apparatuses. In particular, modern philosophers of science argue that quantum logic attempts to subst... | Quantum Logic | 0.810996 |
20,215 | Later, Putnam retracted his views, albeit with much less fanfare, but the damage had been done. While Birkhoff and von Neumann's original work only attempted to organize the calculations associated with the Copenhagen interpretation of quantum mechanics, a school of researchers had now sprung up, either hoping that qua... | Quantum Logic | 0.810996 |
20,216 | Given a orthocomplemented lattice Q, a Mackey observable φ is a countably additive homomorphism from the orthocomplemented lattice of Borel subsets of R to Q. In symbols, this means that for any sequence {Si}i of pairwise disjoint Borel subsets of R, {φ(Si)}i are pairwise orthogonal propositions (elements of Q) and φ (... | Quantum Logic | 0.810996 |
20,217 | In his classic 1932 treatise Mathematical Foundations of Quantum Mechanics, John von Neumann noted that projections on a Hilbert space can be viewed as propositions about physical observables; that is, as potential yes-or-no questions an observer might ask about the state of a physical system, questions that could be s... | Quantum Logic | 0.810996 |
20,218 | DOI: 10.1007/978-3-642-70029-3. ISBN 978-3-642-70029-3. Quantum Logic at the nLab C. Piron, Foundations of Quantum Physics, W. A. Benjamin, 1976. | Quantum Logic | 0.810996 |
20,219 | Released in English as: Günther Ludwig, Foundations of Quantum Mechanics, vol. 1, trans. Carl A. Hein; Springer-Verlag, 1983.Günther Ludwig, An Axiomatic Basis for Quantum Mechanics, vol. | Quantum Logic | 0.810996 |
20,220 | Although many treatments of quantum logic assume that the underlying lattice must be orthomodular, such logics cannot handle multiple interacting quantum systems. In an example due to Foulis and Randall, there are orthomodular propositions with finite-dimensional Hilbert models whose pairing admits no orthomodular mode... | Quantum Logic | 0.810996 |
20,221 | A. Baltag and S. Smets, "LQP: The Dynamic Logic of Quantum Information", Mathematical Structures in Computer Science, vol. 16, issue 3, pp. 491-525, 2006. DOI 10.1017/S0960129506005299 arXiv 2110.01361 A. Baltag, J. Bergfeld, K. Kishida, J. Sack, S. Smets and S. Zhong, "PLQP & Company: Decidable Logics for Quantum Algo... | Quantum Logic | 0.810996 |
20,222 | 20, 1974, pp. 395-406. G. Kalmbach Orthomodular Logic as a Hilbert Type Calculus, in Current Issues in Quantum Logic, Plenum Press, New York, ed. E. Beltrametti et al., 1981, pp. 333-340 G. Kalmbach Orthomodular Lattices, Academic Press, London, 1983 | Quantum Logic | 0.810996 |
20,223 | G. Mackey, Mathematical Foundations of Quantum Mechanics, W. A. Benjamin, 1963. HathiTrust 2027/mdp.39015001329567. H. Putnam, Is Logic Empirical?, Boston Studies in the Philosophy of Science V, ed. | Quantum Logic | 0.810996 |
20,224 | 1955 edition available at the Internet Archive. G. Birkhoff and J. von Neumann, "The Logic of Quantum Mechanics," Annals of Mathematics, series II, vol. 37, issue 4, pp. | Quantum Logic | 0.810996 |
20,225 | Organized chronologicallyJ. von Neumann, Mathematical Foundations of Quantum Mechanics, trans. Robert T. Beyer, ed. Nicholas A. Wheeler; Princeton University Press, 2018 (original 1932). | Quantum Logic | 0.810996 |
20,226 | in which he analysed the epistemological status of the rules of propositional logic. Modern philosophers reject quantum logic as a basis for reasoning, because it lacks a material conditional; a common alternative is the system of linear logic, of which quantum logic is a fragment. Mathematically, quantum logic is form... | Quantum Logic | 0.810996 |
20,227 | In the mathematical study of logic and the physical analysis of quantum foundations, quantum logic is a set of rules for manipulation of propositions inspired by the structure of quantum theory. The formal system takes as its starting point an observation of Garrett Birkhoff and John von Neumann, that the structure o... | Quantum Logic | 0.810996 |
20,228 | The structure of Q immediately points to a difference with the partial order structure of a classical proposition system. In the classical case, given a proposition p, the equations ⊤=p∨q and ⊥=p∧qhave exactly one solution, namely the set-theoretic complement of p. In the case of the lattice of projections there are in... | Quantum Logic | 0.810996 |
20,229 | The standard semantics of quantum logic is that quantum logic is the logic of projection operators in a separable Hilbert or pre-Hilbert space, where an observable p is associated with the set of quantum states for which p (when measured) has eigenvalue 1. From there, ¬p is the orthogonal complement of p (since for tho... | Quantum Logic | 0.810996 |
20,230 | Internet Encyclopedia of Philosophy. Wilce, Alexander. "Quantum Logic and Probability Theory". | Quantum Logic | 0.810996 |
20,231 | Let |p|↾>1 be the restriction of |p| to momenta that are (in absolute value) >1. (a ∧ b) ∨ (a ∧ c) corresponds to states with |p1|↾>1 = |p2|↾>1 = 0 (this holds even if we defined p differently so as to make such states possible; also, a ∧ b corresponds to |p1|↾>1=0 and p2=0). As an operator, p=p1+p2, and nonzero |p1|↾>... | Quantum Logic | 0.810996 |
20,232 | Formally, Theorem. Suppose Q is the lattice of closed subspaces of a separable Hilbert space of complex dimension at least 3. Then for any quantum probability measure P on Q there exists a unique trace class operator S such that for any self-adjoint projection E in Q. | Quantum Logic | 0.810996 |
20,233 | For classical systems, the value f(x), that is the value of f for some particular system state x, is obtained by a process of measurement of f. The propositions concerning a classical system are generated from basic statements of the form "Measurement of f yields a value in the interval for some real numbers a, b. "th... | Quantum Logic | 0.810996 |
20,234 | Quantum logic embeds into linear logic and the modal logic B. Indeed, modern logics for the analysis of quantum computation often begin with quantum logic, and attempt to graft desirable features of an extension of classical logic thereonto; the results then necessarily embed quantum logic.The orthocomplemented lattice... | Quantum Logic | 0.810996 |
20,235 | Some authors restrict to orthomodular lattices, which additionally satisfy the orthomodular law: If ⊤=¬(¬a∨¬b)∨¬(a∨b) then a=b. ("⊤" is the traditional notation for truth and ""⊥" the traditional notation for falsity.) Alternative formulations include propositions derivable via a natural deduction, sequent calculus or ... | Quantum Logic | 0.810996 |
20,236 | In the Hilbert space formulation of quantum mechanics as presented by von Neumann, a physical observable is represented by some (possibly unbounded) densely defined self-adjoint operator A on a Hilbert space H. A has a spectral decomposition, which is a projection-valued measure E defined on the Borel subsets of R. In ... | Quantum Logic | 0.810996 |
20,237 | The average silhouette of the data is another useful criterion for assessing the natural number of clusters. The silhouette of a data instance is a measure of how closely it is matched to data within its cluster and how loosely it is matched to data of the neighboring cluster, i.e., the cluster whose average distance f... | Determining the number of clusters in a data set | 0.810994 |
20,238 | Robert Tibshirani, Guenther Walther, and Trevor Hastie proposed estimating the number of clusters in a data set via the gap statistic. The gap statistics, based on theoretical grounds, measures how far is the pooled within-cluster sum of squares around the cluster centers from the sum of squares expected under the null... | Determining the number of clusters in a data set | 0.810994 |
20,239 | In statistics and data mining, X-means clustering is a variation of k-means clustering that refines cluster assignments by repeatedly attempting subdivision, and keeping the best resulting splits, until a criterion such as the Akaike information criterion (AIC) or Bayesian information criterion (BIC) is reached. | Determining the number of clusters in a data set | 0.810994 |
20,240 | Let g and h be germs. If | h 0 − g 0 | < r {\displaystyle |h_{0}-g_{0}| 0, and let U r ( g ) = { h ∈ G: g ≥ h , | g 0 − h 0 | < r } . {\displaystyle U_{r}(g)=\{h\in {\mathcal {G}}:g\geq h,|g_{0}-h_{0}| 0 and g ∈ G {\displaystyle g\in {\mathcal {G}}} define a basis of open sets for the topology on G {\displaystyle {\mat... | Analytic extension | 0.810992 |
20,241 | The monodromy theorem gives a sufficient condition for the existence of a direct analytic continuation (i.e., an extension of an analytic function to an analytic function on a bigger set). Suppose D ⊂ C {\displaystyle D\subset \mathbb {C} } is an open set and f an analytic function on D. If G is a simply connected doma... | Analytic extension | 0.810992 |
20,242 | Let f ( z ) = ∑ k = 0 ∞ α k ( z − z 0 ) k {\displaystyle f(z)=\sum _{k=0}^{\infty }\alpha _{k}(z-z_{0})^{k}} be a power series, then there exist εk ∈ {−1, 1} such that f ( z ) = ∑ k = 0 ∞ ε k α k ( z − z 0 ) k {\displaystyle f(z)=\sum _{k=0}^{\infty }\varepsilon _{k}\alpha _{k}(z-z_{0})^{k}} has the convergence disc of... | Analytic extension | 0.810992 |
20,243 | The uniqueness theorem for analytic functions also extends to sheaves of analytic functions: if the sheaf of an analytic function contains the zero germ (i.e., the sheaf is uniformly zero in some neighborhood) then the entire sheaf is zero. Armed with this result, we can see that if we take any germ g of the sheaf S of... | Analytic extension | 0.810992 |
20,244 | A dynamic equation on Q → R {\displaystyle Q\to \mathbb {R} } is a differential equation which is algebraically solved for a higher-order derivatives. In particular, a first-order dynamic equation on a fiber bundle Q → R {\displaystyle Q\to \mathbb {R} } is a kernel of the covariant differential of some connection Γ {\... | Non-autonomous system (mathematics) | 0.810991 |
20,245 | This means that the simulated system is treated as a unit cell in a lattice, and when a particle moves out of the cell, it automatically comes in through the other side (making the system a topological torus). According to a perspective published nearly fifty years later by William L. Jorgensen, "Metropolis et al. intr... | Equation of State Calculations by Fast Computing Machines | 0.810989 |
20,246 | A microwave radiometer (MWR) is a radiometer that measures energy emitted at one millimeter-to-metre wavelengths (frequencies of 0.3–300 GHz) known as microwaves. Microwave radiometers are very sensitive receivers designed to measure thermally-emitted electromagnetic radiation. They are usually equipped with multiple r... | Dicke radiometer | 0.810989 |
20,247 | A further complication is that, except for the Roy's greatest root, the distribution of these statistics under the null hypothesis is not straightforward and can only be approximated except in a few low-dimensional cases. An algorithm for the distribution of the Roy's largest root under the null hypothesis was derived ... | Multivariate analysis of variance | 0.810989 |
20,248 | In statistics, multivariate analysis of variance (MANOVA) is a procedure for comparing multivariate sample means. As a multivariate procedure, it is used when there are two or more dependent variables, and is often followed by significance tests involving individual dependent variables separately.Without relation to th... | Multivariate analysis of variance | 0.810989 |
20,249 | The Classical Heisenberg model, developed by Werner Heisenberg, is the n = 3 {\displaystyle n=3} case of the n-vector model, one of the models used in statistical physics to model ferromagnetism, and other phenomena. | Heisenberg model (classical) | 0.810982 |
20,250 | Independently of the range of the interaction, at low enough temperature the magnetization is positive. Conjecturally, in each of the low temperature extremal states the truncated correlations decay algebraically. | Heisenberg model (classical) | 0.810982 |
20,251 | An alternate approach to the semantics of first-order logic proceeds via abstract algebra. This approach generalizes the Lindenbaum–Tarski algebras of propositional logic. There are three ways of eliminating quantified variables from first-order logic that do not involve replacing quantifiers with other variable bindin... | First order predicate logic | 0.810982 |
20,252 | : 32–33 This fragment is of great interest because it suffices for Peano arithmetic and most axiomatic set theory, including the canonical ZFC. They also prove that first-order logic with a primitive ordered pair is equivalent to a relation algebra with two ordered pair projection functions. : 803 | First order predicate logic | 0.810981 |
20,253 | Infinitary logic allows infinitely long sentences. For example, one may allow a conjunction or disjunction of infinitely many formulas, or quantification over infinitely many variables. Infinitely long sentences arise in areas of mathematics including topology and model theory. Infinitary logic generalizes first-order ... | First order predicate logic | 0.810981 |
20,254 | SIMD instructions are widely used to process 3D graphics, although modern graphics cards with embedded SIMD have largely taken over this task from the CPU. Some systems also include permute functions that re-pack elements inside vectors, making them particularly useful for data processing and compression. They are also... | Single Instruction Multiple Data | 0.810979 |
20,255 | Automatic vectorization in compilers is an active area of computer science research. (Compare vector processing.) Programming with particular SIMD instruction sets can involve numerous low-level challenges. | Single Instruction Multiple Data | 0.810979 |
20,256 | The idea behind statistical machine translation comes from information theory. A document is translated according to the probability distribution p ( e | f ) {\displaystyle p(e|f)} that a string e {\displaystyle e} in the target language (for example, English) is the translation of a string f {\displaystyle f} in the s... | Statistical machine translation | 0.810978 |
20,257 | Statistical machine translation (SMT) was a machine translation approach, that superseded the previous, rule-based approach because it required explicit description of each and every linguistic rule, which was costly, and which often did not generalize to other languages. Since 2003, the statistical approach itself has... | Statistical machine translation | 0.810978 |
20,258 | Lie algebras are equipped with a bracket : g × g → g {\displaystyle :{\mathfrak {g}}\times {\mathfrak {g}}\rightarrow {\mathfrak {g}}} . The partial application gives a map ad: g → End ( g ) {\displaystyle {\text{ad}}:{\mathfrak {g}}\rightarrow {\text{End}}({\mathfrak {g}})} . The axioms for the bracket ensure this map... | Partial application | 0.810971 |
20,259 | The partial application of the cross product × {\displaystyle \times } on R 3 {\displaystyle \mathbb {R} ^{3}} is × ( ⋅ , − ): R 3 ↦ End ( R 3 ) {\displaystyle \times (\,\cdot \,,-):\mathbb {R} ^{3}\mapsto {\text{End}}(\mathbb {R} ^{3})} . The image of the vector u {\displaystyle \mathbf {u} } is a linear map T u {\dis... | Partial application | 0.810971 |
20,260 | In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments to a function, producing another function of smaller arity. Given a function f: ( X × Y × Z ) → N {\displaystyle f\colon (X\times Y\times Z)\to N} , we might fix (or 'bind') the first argumen... | Partial application | 0.810971 |
20,261 | An inner-product on a vector space V {\displaystyle V} over a field K {\displaystyle K} is a map ϕ: V × V → K {\displaystyle \phi :V\times V\rightarrow K} . The partial evaluation provides a canonical map to the dual vector space, ϕ ( ⋅ , − ): V → V ∗ ⊂ ( V → K ) {\displaystyle \phi (\,\cdot \,,-):V\rightarrow V^{*}\su... | Partial application | 0.810971 |
20,262 | In the simply-typed lambda calculus with function and product types (λ→,×) partial application, currying and uncurrying can be defined as papply (((a × b) → c) × a) → (b → c) = λ(f, x). λy. f (x, y) curry ((a × b) → c) → (a → (b → c)) = λf. λx. | Partial application | 0.810971 |
20,263 | The MIT150 is a list published by the Boston Globe, in honor of the 150th anniversary of the Massachusetts Institute of Technology (MIT) in 2011, listing 150 of the most significant innovators, inventions or ideas from MIT, its alumni, faculty, and related people and organizations in the 150 year history of the institu... | MIT150 | 0.81097 |
20,264 | I argued in such a world the allocation of resources would be independent of the legal position, a result which Stigler dubbed the "Coase theorem".Thus, while Coase himself appears to have considered the "Coase theorem" and Coasian solutions as simplified constructs to ultimately consider the real 20th-century world of... | Free-rider problem | 0.810967 |
20,265 | A Coasian solution, named for the economist Ronald Coase, proposes that potential beneficiaries of a public good can negotiate to pool their resources and create it, based on each party's self-interested willingness to pay. His treatise, The Problem of Social Cost (1960), argued that if the transaction costs between po... | Free-rider problem | 0.810967 |
20,266 | A timeline of atomic and subatomic physics. | Timeline of atomic and subatomic physics | 0.810965 |
20,267 | Schücker, Thomas (2005) Forces from Connes's geometry. Lecture Notes in Physics 659, Springer. Noncommutative standard model Noncommutative geometry | Timeline of atomic and subatomic physics | 0.810965 |
20,268 | 155: 109. -------- (2006) "Noncommutative geometry and physics," -------- and M. Marcolli, Noncommutative Geometry: Quantum Fields and Motives. American Mathematical Society (2007). | Timeline of atomic and subatomic physics | 0.810965 |
20,269 | -------- (1996) "Gravity coupled with matter and the foundation of noncommutative geometry," Comm. Math. Phys. | Timeline of atomic and subatomic physics | 0.810965 |
20,270 | -------- (1995) "Noncommutative geometry and reality", J. Math. Phys. 36: 6194. | Timeline of atomic and subatomic physics | 0.810965 |
20,271 | Alain Connes (1994) Noncommutative geometry. Academic Press. ISBN 0-12-185860-X. | Timeline of atomic and subatomic physics | 0.810965 |
20,272 | (2003) "Quantum Field Theory on Noncommutative Spaces," Physics Reports 378: 207–99. An expository article on noncommutative quantum field theories. Noncommutative quantum field theory, see statistics on arxiv.org Seiberg, N. and E. Witten (1999) "String Theory and Noncommutative Geometry," Journal of High Energy Physi... | Timeline of atomic and subatomic physics | 0.810965 |
20,273 | 2000 Steven Weinberg. Supersymmetry and Quantum Gravity. 2003 Leonid Vainerman. Quantum groups, Hopf algebras and quantum field applications. | Timeline of atomic and subatomic physics | 0.810965 |
20,274 | 1999 Ahmed Zewail wins the Nobel prize in chemistry for his work on femtochemistry for atoms and molecules. 2001 The Sudbury Neutrino Observatory (Canada) confirms the existence of neutrino oscillations. 2005 At the RHIC accelerator of Brookhaven National Laboratory they have created a quark–gluon liquid of very low vi... | Timeline of atomic and subatomic physics | 0.810965 |
20,275 | the Aharonov–Bohm effect 1960 R.G. Chambers experimentally confirms the Aharonov–Bohm effect 1961 Murray Gell-Mann and Yuval Ne'eman discover the Eightfold Way patterns, the SU(3) group 1961 Jeffrey Goldstone considers the breaking of global phase symmetry 1962 Leon Lederman shows that the electron neutrino is distinct... | Timeline of atomic and subatomic physics | 0.810965 |
20,276 | Stevenson discover muons using cloud chamber measurements of cosmic rays 1939 Richard Feynman finds the Hellmann–Feynman theorem 1939 Otto Hahn and Fritz Strassmann bombard uranium salts with thermal neutrons and discover barium among the reaction products 1939 Lise Meitner and Otto Robert Frisch determine that nuclear... | Timeline of atomic and subatomic physics | 0.810965 |
20,277 | 1937 Hans Hellmann finds the Hellmann–Feynman theorem 1937 Seth Neddermeyer, Carl Anderson, J.C. Street, and E.C. | Timeline of atomic and subatomic physics | 0.810965 |
20,278 | 1924 John Lennard-Jones proposes a semiempirical interatomic force law 1924 Santiago Antúnez de Mayolo proposes a neutron. 1924 Satyendra Bose and Albert Einstein introduce Bose–Einstein statistics 1925 Wolfgang Pauli states the quantum exclusion principle for electrons 1925 George Uhlenbeck and Samuel Goudsmit postula... | Timeline of atomic and subatomic physics | 0.810965 |
20,279 | 1766 Henry Cavendish discovers and studies hydrogen 1778 Carl Scheele and Antoine Lavoisier discover that air is composed mostly of nitrogen and oxygen 1781 Joseph Priestley creates water by igniting hydrogen and oxygen 1800 William Nicholson and Anthony Carlisle use electrolysis to separate water into hydrogen and oxy... | Timeline of atomic and subatomic physics | 0.810965 |
20,280 | It has no sequence specificity. Well-known versions include S1 found in Aspergillus oryzae (yellow koji mold) and Nuclease P1 found in Penicillium citrinum. Members of the S1/P1 family are found in both prokaryotes and eukaryotes and are thought to be associated in programmed cell death and also in tissue differentiati... | Nuclease S1 | 0.810964 |
20,281 | In analytical chemistry, a calibration curve, also known as a standard curve, is a general method for determining the concentration of a substance in an unknown sample by comparing the unknown to a set of standard samples of known concentration. A calibration curve is one approach to the problem of instrument calibrati... | Calibration curve | 0.810962 |
20,282 | Most analytical techniques use a calibration curve. There are a number of advantages to this approach. First, the calibration curve provides a reliable way to calculate the uncertainty of the concentration calculated from the calibration curve (using the statistics of the least squares line fit to the data).Second, the... | Calibration curve | 0.810962 |
20,283 | International Fruit Genetics (IFG) is a private Bakersfield, California-based fruit breeding company that licenses patented breeds of fruit to growers worldwide. The largest breeder of table grapes has licensed one type of this fruit to Bakersfield-based grower Grapery, Cotton Candy.In August 2023, it was announced tha... | International Fruit Genetics | 0.81096 |
20,284 | The usual algebraic constructions for ordinary vector spaces have their counterpart in the super vector space setting. | Super linear algebra | 0.81096 |
20,285 | Just as one may generalize vector spaces over a field to modules over a commutative ring, one may generalize super vector spaces over a field to supermodules over a supercommutative algebra (or ring). A common construction when working with super vector spaces is to enlarge the field of scalars to a supercommutative Gr... | Super linear algebra | 0.81096 |
20,286 | During this early period, the Mathematics Institute also helped with designing the wings of the Fokker F27 Friendship airplane, voted in 2006 as the most beautiful Dutch design of the 20th century.The computer science component developed soon after. Adriaan van Wijngaarden, considered the founder of computer science (o... | Mathematical Centre | 0.810954 |
20,287 | The institute is known for its work in fields such as operations research, software engineering, information processing, and mathematical applications in life sciences and logistics. More recent examples of research results from CWI include the development of scheduling algorithms for the Dutch railway system (the Nede... | Mathematical Centre | 0.810954 |
20,288 | The Centrum Wiskunde & Informatica (abbr. CWI; English: "National Research Institute for Mathematics and Computer Science") is a research centre in the field of mathematics and theoretical computer science. It is part of the institutes organization of the Dutch Research Council (NWO) and is located at the Amsterdam Sci... | Mathematical Centre | 0.810954 |
20,289 | Understanding the structure of the atomic nucleus is one of the central challenges in nuclear physics. | Nuclear structure | 0.810953 |
20,290 | This amounts to replacing an N-body problem (N particles interacting) by N single-body problems. This essential simplification of the problem is the cornerstone of mean field theories. These are also widely used in atomic physics, where electrons move in a mean field due to the central nucleus and the electron cloud it... | Nuclear structure | 0.810953 |
20,291 | The expression "shell model" is ambiguous in that it refers to two different items. It was previously used to describe the existence of nucleon shells according to an approach closer to what is now called mean field theory. Nowadays, it refers to a formalism analogous to the configuration interaction formalism used in ... | Nuclear structure | 0.810953 |
20,292 | In view of the non-perturbative nature of strong interaction, and also in view of the fact that the exact potential form of this interaction between groups of nucleons is relatively badly known, the use of such an approach in the case of atomic nuclei requires drastic approximations. The main simplification consists in... | Nuclear structure | 0.810953 |
20,293 | One of the focal points of all physics is symmetry. The nucleon–nucleon interaction and all effective interactions used in practice have certain symmetries. They are invariant by translation (changing the frame of reference so that directions are not altered), by rotation (turning the frame of reference around some axi... | Nuclear structure | 0.810953 |
20,294 | Luc Valentin ; Le monde subatomique - Des quarks aux centrales nucléaires, Hermann (1986). Luc Valentin ; Noyaux et particules - Modèles et symétries, Hermann (1997). David Halliday ; Introductory Nuclear Physics, Wiley & Sons (1957). Kenneth Krane ; Introductory Nuclear Physics, Wiley & Sons (1987). Carlos Bertulani ;... | Nuclear structure | 0.810953 |
20,295 | This phenomenon is closely analogous to that of Type 1 superconductivity in solid state physics. The first theoretical description of nuclear pairing was proposed at the end of the 1950s by Aage Bohr, Ben Mottelson, and David Pines (which contributed to the reception of the Nobel Prize in Physics in 1975 by Bohr and Mo... | Nuclear structure | 0.810953 |
20,296 | The interacting boson model (IBM) is a model in nuclear physics in which nucleons are represented as pairs, each of them acting as a boson particle, with integral spin of 0, 2 or 4. This makes calculations feasible for larger nuclei. There are several branches of this model - in one of them (IBM-1) one can group all ty... | Nuclear structure | 0.810953 |
20,297 | To obviate this difficulty, the space of possible single-particle states is divided into core and valence, by analogy with chemistry (see core electron and valence electron). The core is a set of single-particles which are assumed to be inactive, in the sense that they are the well bound lowest-energy states, and that ... | Nuclear structure | 0.810953 |
20,298 | The latter are written as Slater determinants.In the case of the Hartree–Fock approaches, the trouble is not to find the mathematical function which describes best the nuclear potential, but that which describes best the nucleon–nucleon interaction. Indeed, in contrast with atomic physics where the interaction is known... | Nuclear structure | 0.810953 |
20,299 | A. Bohr & B. Mottelson ; Nuclear Structure, 2 vol., Benjamin (1969–1975). Volume 1: Single Particle Motion ; Volume 2: Nuclear Deformations. Réédité par World Scientific Publishing Company (1998), ISBN 981-02-3197-0. P. Ring & P. Schuck; The nuclear many-body problem, Springer Verlag (1980), ISBN 3-540-21206-X A. de Sh... | Nuclear structure | 0.810953 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.