id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
10,100 | Polyhedra is a family of relational database management systems offered by ENEA AB, a Swedish company. The original version of Polyhedra (now referred to as Polyhedra IMDB) was an in-memory database management system which could be used in high availability configurations; in 2006 Polyhedra Flash DBMS was introduced to... | Polyhedra DBMS | 0.819401 |
10,101 | Letters in Mathematical Physics is a peer-reviewed scientific journal in mathematical physics published by Springer Science+Business Media. It publishes letters and longer research articles, occasionally also articles containing topical reviews. It is essentially a platform for the rapid dissemination of short contribu... | Letters in Mathematical Physics | 0.819378 |
10,102 | The following services abstract or index Letters in Mathematical Physics: Academic OneFile, Academic Search, Astrophysics Data System, Chemical Abstracts Service, Current Contents/Physical, Chemical and Earth Sciences, Current Index to Statistics, EBSCO, EI-Compendex, INIS Atomindex, Inspec, Mathematical Reviews, ProQu... | Letters in Mathematical Physics | 0.819378 |
10,103 | Like other molecular-based approaches, metabarcoding only gives qualitative results on the presence/absence of prey species in the gut or fecal samples. However, this knowledge of the identity of prey consumed by predators of the same species in a given environment enables a "pragmatic and useful surrogate for truly qu... | EDNA metabarcoding | 0.819377 |
10,104 | Inverse Problems is a peer-reviewed, broad-based interdisciplinary journal for pure and applied mathematicians and physicists produced by IOP Publishing. It combines theoretical, experimental and mathematical papers on inverse problems with numerical and practical approaches to their solution. The journal has a special... | Inverse Problems | 0.819377 |
10,105 | An alternative method of representing a consensus sequence uses a sequence logo. This is a graphical representation of the consensus sequence, in which the size of a symbol is related to the frequency that a given nucleotide (or amino acid) occurs at a certain position. In sequence logos the more conserved the residue,... | Consensus sequence | 0.819376 |
10,106 | A comic book adaptation was made, scripted by Don R. Christensen, pencilled by Tony Strobl, and inked by Steve Steere. However, this version differs in some ways from the original film version, providing a better context for Donald's excursion into Mathmagic Land. The House of Mouse episode "Gone Goofy" features an adv... | Donald in Mathmagic Land | 0.819376 |
10,107 | In mathematics, in the representation theory of algebraic groups, an observable subgroup is an algebraic subgroup of a linear algebraic group whose every finite-dimensional rational representation arises as the restriction to the subgroup of a finite-dimensional rational representation of the whole group. An equivalent... | Observable subgroup | 0.819372 |
10,108 | In psychology and neuroscience, memory span is the longest list of items that a person can repeat back in correct order immediately after presentation on 50% of all trials. Items may include words, numbers, or letters. The task is known as digit span when numbers are used. | Memory Span | 0.819371 |
10,109 | For general problems a variety of methods are commonly used, including interior point, active set, augmented Lagrangian, conjugate gradient, gradient projection, extensions of the simplex algorithm.In the case in which Q is positive definite, the problem is a special case of the more general field of convex optimizatio... | Quadratic programming | 0.819371 |
10,110 | "Programming" in this context refers to a formal procedure for solving mathematical problems. This usage dates to the 1940s and is not specifically tied to the more recent notion of "computer programming." To avoid confusion, some practitioners prefer the term "optimization" — e.g., "quadratic optimization." | Quadratic programming | 0.819371 |
10,111 | Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear program... | Quadratic programming | 0.819371 |
10,112 | The cobalt-containing Vitamin B12 (also known as cobalamin) catalyzes the transfer of methyl (−CH3) groups between two molecules, which involves the breaking of C−C bonds, a process that is energetically expensive in organic reactions. The metal ion lowers the activation energy for the process by forming a transient Co... | Metalloprotein | 0.819368 |
10,113 | The elongated Cu−S2 bonding destabilizes the Cu(II) form and increases the redox potential of the protein. The blue color (597 nm peak absorption) is due to the Cu−S1 bond where S(pπ) to Cu(dx2−y2) charge transfer occurs.In the reduced form of plastocyanin, His-87 will become protonated with a pKa of 4.4. Protonation p... | Metalloprotein | 0.819368 |
10,114 | Oxidation and reduction reactions are not common in organic chemistry as few organic molecules can act as oxidizing or reducing agents. Iron(II), on the other hand, can easily be oxidized to iron(III). This functionality is used in cytochromes, which function as electron-transfer vectors. The presence of the metal ion ... | Metalloprotein | 0.819368 |
10,115 | Metalloenzymes all have one feature in common, namely that the metal ion is bound to the protein with one labile coordination site. As with all enzymes, the shape of the active site is crucial. The metal ion is usually located in a pocket whose shape fits the substrate. The metal ion catalyzes reactions that are diffic... | Metalloprotein | 0.819368 |
10,116 | Oxidation: M(n+1)+ + O−2 → Mn+ + O2 Reduction: Mn+ + O−2 + 2 H+ → M(n+1)+ + H2O2.In human SOD the active metal is copper, as Cu(II) or Cu(I), coordinated tetrahedrally by four histidine residues. This enzyme also contains zinc ions for stabilization and is activated by copper chaperone for superoxide dismutase (CCS). O... | Metalloprotein | 0.819368 |
10,117 | In solutions at neutral pH, the superoxide ion disproportionates to molecular oxygen and hydrogen peroxide. 2 O−2 + 2 H+ → O2 + H2O2In biology this type of reaction is called a dismutation reaction. It involves both oxidation and reduction of superoxide ions. | Metalloprotein | 0.819368 |
10,118 | In mathematics, constraint counting is counting the number of constraints in order to compare it with the number of variables, parameters, etc. that are free to be determined, the idea being that in most cases the number of independent choices that can be made is the excess of the latter over the former. For example, i... | Constraint counting | 0.819367 |
10,119 | {\displaystyle \cdots \to H^{i}(X)\to H^{i}(Y)\to H^{i}(Z)\to H^{i+1}(X)\to \cdots .} In applications to algebraic topology, the cohomology functors may be denoted π n {\displaystyle \pi _{n}} instead of H n {\displaystyle H^{n}} . The cohomology functors take values in the heart D ♡ {\displaystyle {\mathcal {D}}^{\hea... | T-structure | 0.819366 |
10,120 | A conjectural example in the theory of motives is the so-called motivic t-structure. Its (conjectural) existence is closely related to certain standard conjectures on algebraic cycles and vanishing conjectures, such as the Beilinson-Soulé conjecture. | T-structure | 0.819366 |
10,121 | The category of perverse sheaves is, by definition, the core of the so-called perverse t-structure on the derived category of the category of sheaves on a complex analytic space X or (working with l-adic sheaves) an algebraic variety over a finite field. As was explained above, the heart of the standard t-structure sim... | T-structure | 0.819366 |
10,122 | In the branch of mathematics called homological algebra, a t-structure is a way to axiomatize the properties of an abelian subcategory of a derived category. A t-structure on D {\displaystyle {\mathcal {D}}} consists of two subcategories ( D ≤ 0 , D ≥ 0 ) {\displaystyle ({\mathcal {D}}^{\leq 0},{\mathcal {D}}^{\geq 0})... | T-structure | 0.819366 |
10,123 | In his inquiry into problems of Emil Post (the tag system) and Hilbert's 10th problem (Hilbert's problems, Diophantine equation) led Minsky to the following definition of: "an interesting basis for recursive function theory involving programs of only the simplest arithmetic operations" (Minsky (1961) p. 437).His "Theor... | Counter-machine model | 0.819358 |
10,124 | On page 218 Shepherdson and Sturgis references Minsky (1961) as it appeared for them in the form of an MIT Lincoln Laboratory report: In Section 10 we show that theorems (including Minsky's results ) on the computation of partial recursive functions by one or two tapes can be obtained rather easily from one of our inte... | Counter-machine model | 0.819358 |
10,125 | But this analogy must not be taken too far as the tension in an elastic membrane is dependent on the amount of deformation of the membrane while surface tension is an inherent property of the liquid–air or liquid–vapour interface.Because of the relatively high attraction of water molecules to each other through a web o... | Interfacial energy | 0.819351 |
10,126 | In mathematics and physics, acceleration is the rate of change of velocity of a curve with respect to a given linear connection. This operation provides us with a measure of the rate and direction of the "bend". | Acceleration vector | 0.819344 |
10,127 | Set-theoretic topology studies questions of general topology that are set-theoretic in nature or that require advanced methods of set theory for their solution. Many of these theorems are independent of ZFC, requiring stronger axioms for their proof. A famous problem is the normal Moore space question, a question in ge... | Axiomatic Set Theory | 0.81934 |
10,128 | Explicitly, Sn acts on the n-dimensional space Rn by permuting coordinates (in matrices, as permutation matrices). This has a 1-dimensional trivial subrepresentation corresponding to vectors with all coordinates equal, and the complementary (n−1)-dimensional subrepresentation (of vectors whose coordinates sum to 0) is ... | Covering groups of the alternating and symmetric groups | 0.819336 |
10,129 | A rich mathematical theory of infinite dimensional Lie algebras evolved. An account of the subject, which also includes works of many others is given in (Kac 1990). See also (Seligman 1987). | Kac algebra | 0.819332 |
10,130 | Simultaneously, Z-graded Lie algebras were being studied in Moscow where I. L. Kantor introduced and studied a general class of Lie algebras including what eventually became known as Kac–Moody algebras. Victor Kac was also studying simple or nearly simple Lie algebras with polynomial growth. | Kac algebra | 0.819332 |
10,131 | Kac and Moody noticed that if Wilhelm Killing's conditions were relaxed, it was still possible to associate to the Cartan matrix a Lie algebra which, necessarily, would be infinite dimensional." – A. J. ColemanIn his 1967 thesis, Robert Moody considered Lie algebras whose Cartan matrix is no longer positive definite. T... | Kac algebra | 0.819332 |
10,132 | The initial construction by Élie Cartan and Wilhelm Killing of finite dimensional simple Lie algebras from the Cartan integers was type dependent. In 1966 Jean-Pierre Serre showed that relations of Claude Chevalley and Harish-Chandra, with simplifications by Nathan Jacobson, give a defining presentation for the Lie alg... | Kac algebra | 0.819332 |
10,133 | They correspond to Dynkin diagrams and affine Dynkin diagrams. Little is known about the Kac–Moody algebras of indefinite type, although the groups corresponding to these Kac–Moody algebras were constructed over arbitrary fields by Jacques Tits.Among the Kac–Moody algebras of indefinite type, most work has focused on t... | Kac algebra | 0.819332 |
10,134 | A positive semidefinite matrix S gives rise to an infinite-dimensional Kac–Moody algebra of affine type, or an affine Lie algebra. An indefinite matrix S gives rise to a Kac–Moody algebra of indefinite type. Since the diagonal entries of C and S are positive, S cannot be negative definite or negative semidefinite.Symme... | Kac algebra | 0.819332 |
10,135 | Properties of a Kac–Moody algebra are controlled by the algebraic properties of its generalized Cartan matrix C. In order to classify Kac–Moody algebras, it is enough to consider the case of an indecomposable matrix C, that is, assume that there is no decomposition of the set of indices I into a disjoint union of non-e... | Kac algebra | 0.819332 |
10,136 | In mathematics, a Kac–Moody algebra (named for Victor Kac and Robert Moody, who independently and simultaneously discovered them in 1968) is a Lie algebra, usually infinite-dimensional, that can be defined by generators and relations through a generalized Cartan matrix. These algebras form a generalization of finite-di... | Kac algebra | 0.819332 |
10,137 | Any locally compact field is spherically complete. This includes, in particular, the fields Qp of p-adic numbers, and any of their finite extensions. Every spherically complete field is complete. On the other hand, Cp, the completion of the algebraic closure of Qp, is not spherically complete. Any field of Hahn series ... | Spherically complete field | 0.819326 |
10,138 | In mathematics, a field K with an absolute value is called spherically complete if the intersection of every decreasing sequence of balls (in the sense of the metric induced by the absolute value) is nonempty: B 1 ⊇ B 2 ⊇ ⋯ ⇒ ⋂ n ∈ N B n ≠ ∅ . {\displaystyle B_{1}\supseteq B_{2}\supseteq \cdots \Rightarrow \bigcap _{n\... | Spherically complete field | 0.819326 |
10,139 | The Bulletin of the American Mathematical Society said, "The under review written by a distinguished mathematician the first textbooks successfully to present to students of mathematics and physics, classical mechanics in a modern setting. "A book review in the journal Celestial Mechanics said, "In summary, the au... | Mathematical Methods of Classical Mechanics | 0.819316 |
10,140 | In 2013, Jeffrey Beall reported that OMICS has added conducting "predatory meetings" to its publications activity including under the ConferenceSeries banner. Beall criticised the financial arrangements for OMICS conferences and urged all scholars to refrain from any dealing with these conferences.An example of such a ... | Chemical Informatics | 0.819315 |
10,141 | OMICS Publishing Group was founded in 2007 by Srinubabu Gedela, who remains the company's director. He founded OMICS because of his difficulty in accessing high-cost journal contents as a PhD student.It started its first open-access journal, the Journal of Proteomics & Bioinformatics, in 2008. In 2012, OMICS Group had ... | Chemical Informatics | 0.819315 |
10,142 | In the 1980s, Karl Norris (while working at the USDA Instrumentation Research Laboratory, Beltsville, USA) pioneered the use NIR spectroscopy for quality assessments of agricultural products. Since then, use has expanded from food and agricultural to chemical, polymer, and petroleum industries; pharmaceutical industry;... | Near ir spectroscopy | 0.819311 |
10,143 | Applications of oximetry by NIRS methods include neuroscience, ergonomics, rehabilitation, brain-computer interface, urology, the detection of illnesses that affect the blood circulation (e.g., peripheral vascular disease), the detection and assessment of breast tumors, and the optimization of training in sports medici... | Near ir spectroscopy | 0.819311 |
10,144 | Throughout the first and the modern era of quantum mechanics the concept that classical mechanics must be valid macroscopically constrained possible quantum models. This concept was formalized by Bohr in 1923 as the correspondence principle. It requires quantum theory to converge to classical limits. : 29 One principal... | Basic quantum mechanics | 0.819306 |
10,145 | In 1924, Wolfgang Pauli proposed a new quantum degree of freedom (or quantum number), with two possible values, to resolve inconsistencies between observed molecular spectra and the predictions of quantum mechanics. In particular, the spectrum of atomic hydrogen had a doublet, or pair of lines differing by a small amou... | Basic quantum mechanics | 0.819306 |
10,146 | In the same year, Erwin Schrödinger used the word "entanglement" and declared: "I would not call that one but rather the characteristic trait of quantum mechanics." Ever since Irish physicist John Stewart Bell theoretically and experimentally disproved the "hidden variables" theory of Einstein, Podolsky, and Rosen, mos... | Basic quantum mechanics | 0.819306 |
10,147 | Assuming what is now usually called local realism, EPR attempted to show from quantum theory that a particle has both position and momentum simultaneously, while according to the Copenhagen interpretation, only one of those two properties actually exists and only at the moment that it is being measured. EPR concluded t... | Basic quantum mechanics | 0.819306 |
10,148 | In trying to show that quantum mechanics was not a complete theory, Einstein started with the theory's prediction that two or more particles that have interacted in the past can appear strongly correlated when their various properties are later measured. He sought to explain this seeming interaction classically, throug... | Basic quantum mechanics | 0.819306 |
10,149 | The Dimensionally Extended 9-Intersection Model (DE-9IM) is a topological model and a standard used to describe the spatial relations of two regions (two geometries in two-dimensions, R2), in geometry, point-set topology, geospatial topology, and fields related to computer spatial analysis. The spatial relations expres... | Dimensionally Extended 9-Intersection Model | 0.819304 |
10,150 | Unit conversion is a notorious source of errors. Many people apply individual rules, e.g. "to obtain length in centimeters multiply the length in inches by 2.54", but combining several such conversions is laborious and prone to mistakes. A better way is to use the factor-label method, which is closely related to dimens... | Quantities, Units and Symbols in Physical Chemistry | 0.819294 |
10,151 | The Green Book is a direct successor of the Manual of Symbols and Terminology for Physicochemical Quantities and Units, originally prepared for publication on behalf of IUPAC's Physical Chemistry Division by M. L. McGlashen in 1969. A full history of the Green Book's various editions is provided in the historical intro... | Quantities, Units and Symbols in Physical Chemistry | 0.819294 |
10,152 | A concise four-page summary of the most important material in the Green Book was published in the July–August 2011 issue of Chemistry International, the IUPAC news magazine. The second edition of the Green Book (ISBN 0-632-03583-8) was first published in 1993. It was reprinted in 1995, 1996, and 1998. | Quantities, Units and Symbols in Physical Chemistry | 0.819294 |
10,153 | Quantities, Units and Symbols in Physical Chemistry, also known as the Green Book, is a compilation of terms and symbols widely used in the field of physical chemistry. It also includes a table of physical constants, tables listing the properties of elementary particles, chemical elements, and nuclides, and information... | Quantities, Units and Symbols in Physical Chemistry | 0.819294 |
10,154 | {\displaystyle \Gamma _{\text{right}}=\sigma \alpha +\tau \beta .} The analogous identity for the left GCD is nearly the same: Γ left = α σ + β τ . {\displaystyle \Gamma _{\text{left}}=\alpha \sigma +\beta \tau .} Bézout's identity can be used to solve Diophantine equations. For instance, one of the standard proofs of ... | Euclid's algorithm | 0.81929 |
10,155 | Euclid's algorithm can also be used to solve multiple linear Diophantine equations. Such equations arise in the Chinese remainder theorem, which describes a novel method to represent an integer x. Instead of representing an integer by its digits, it may be represented by its remainders xi modulo a set of N coprime numb... | Euclid's algorithm | 0.81929 |
10,156 | Bézout's identity provides yet another definition of the greatest common divisor g of two numbers a and b. Consider the set of all numbers ua + vb, where u and v are any two integers. Since a and b are both divisible by g, every number in the set is divisible by g. In other words, every number of the set is an integer ... | Euclid's algorithm | 0.81929 |
10,157 | Although the Euclidean algorithm is used to find the greatest common divisor of two natural numbers (positive integers), it may be generalized to the real numbers, and to other mathematical objects, such as polynomials, quadratic integers and Hurwitz quaternions. In the latter cases, the Euclidean algorithm is used to ... | Euclid's algorithm | 0.81929 |
10,158 | Computations using this algorithm form part of the cryptographic protocols that are used to secure internet communications, and in methods for breaking these cryptosystems by factoring large composite numbers. The Euclidean algorithm may be used to solve Diophantine equations, such as finding numbers that satisfy multi... | Euclid's algorithm | 0.81929 |
10,159 | A more efficient version of the algorithm shortcuts these steps, instead replacing the larger of the two numbers by its remainder when divided by the smaller of the two (with this version, the algorithm stops when reaching a zero remainder). With this improvement, the algorithm never requires more steps than five times... | Euclid's algorithm | 0.81929 |
10,160 | One of the earliest group automorphisms (automorphism of a group, not simply a group of automorphisms of points) was given by the Irish mathematician William Rowan Hamilton in 1856, in his icosian calculus, where he discovered an order two automorphism, writing: so that μ {\displaystyle \mu } is a new fifth root of uni... | Automorphism | 0.819281 |
10,161 | The inner automorphisms form a normal subgroup of Aut(G), denoted by Inn(G); this is called Goursat's lemma. The other automorphisms are called outer automorphisms. The quotient group Aut(G) / Inn(G) is usually denoted by Out(G); the non-trivial elements are the cosets that contain the outer automorphisms. The same def... | Automorphism | 0.819281 |
10,162 | In some categories—notably groups, rings, and Lie algebras—it is possible to separate automorphisms into two types, called "inner" and "outer" automorphisms. In the case of groups, the inner automorphisms are the conjugations by the elements of the group itself. For each element a of a group G, conjugation by a is the ... | Automorphism | 0.819281 |
10,163 | Obviously, if the graph can be embedded without crossings into a (orientable, connected, closed) surface with genus g, it can be embedded without crossings into all (orientable, connected, closed) surfaces with greater or equal genus. There are also other concepts in graph theory that are called "X genus" with "X" some... | Planar Graph | 0.819278 |
10,164 | Outerplanar graphs are graphs with an embedding in the plane such that all vertices belong to the unbounded face of the embedding. Every outerplanar graph is planar, but the converse is not true: K4 is planar but not outerplanar. A theorem similar to Kuratowski's states that a finite graph is outerplanar if and only if... | Planar Graph | 0.819278 |
10,165 | In computer science, a rule-based system is used to store and manipulate knowledge to interpret information in a useful way. It is often used in artificial intelligence applications and research. Normally, the term rule-based system is applied to systems involving human-crafted or curated rule sets. Rule-based systems ... | Rule base | 0.819275 |
10,166 | A classic example of a rule-based system is the domain-specific expert system that uses rules to make deductions or choices. For example, an expert system might help a doctor choose the correct diagnosis based on a cluster of symptoms, or select tactical moves to play a game. Rule-based systems can be used to perform l... | Rule base | 0.819275 |
10,167 | The Mu to E Gamma (MEG) is a particle physics experiment dedicated to measuring the decay of the muon into an electron and a photon, a decay mode which is heavily suppressed in the Standard Model by lepton flavour conservation, but enhanced in supersymmetry and grand unified theories. It is located at the Paul Scherrer... | Mu to E Gamma | 0.819273 |
10,168 | In particle physics, the electron mass (symbol: me) is the mass of a stationary electron, also known as the invariant mass of the electron. It is one of the fundamental constants of physics. It has a value of about 9.109×10−31 kilograms or about 5.486×10−4 daltons, which has an energy-equivalent of about 8.187×10−14 jo... | Electron mass | 0.819271 |
10,169 | Methyllysine is derivative of the amino acid residue lysine where the sidechain ammonium group has been methylated one or more times.Such methylated lysines play an important role in epigenetics; the methylation of specific lysines of certain histones in a nucleosome alters the binding of the surrounding DNA to those h... | Methyllysine | 0.819264 |
10,170 | As previously noted, this interaction energy is highly dependent on geometry. Indeed, large aromatic dimers are only stabilized relative to their saturated counterparts in a sandwich geometry, while their energies are similar in a T-shaped interaction. | Pi stacking | 0.819257 |
10,171 | Grimme reported that the interaction energies of smaller dimers consisting of one or two rings are very similar for both aromatic and saturated compounds. This finding is of particular relevance to biology, and suggests that the contribution of pi systems to phenomena such as stacked nucleobases may be overestimated. H... | Pi stacking | 0.819257 |
10,172 | For example, the cyclohexyl ester favored the folded state more so than the phenyl ester, and the tert-butyl ester favored the folded state by a preference greater than that shown by any aryl ester. This suggests that aromaticity is not a strict requirement for favorable interaction with an aromatic ring. Other evidenc... | Pi stacking | 0.819257 |
10,173 | The folded state had a well-defined pi stacking interaction with a T-shaped geometry, whereas the unfolded state had no aryl–aryl interactions. The NMR chemical shifts of the two conformations were distinct and could be used to determine the ratio of the two states, which was interpreted as a measure of intramolecular ... | Pi stacking | 0.819257 |
10,174 | Every human being has a unique virome with a unique balance of species. Lifestyle, age, geographic location, and even the season of the year can affect an individual's exposure to viruses, and one's susceptibility to any disease that might be caused by those viruses is also affected by pre-existing immunity and both vi... | Human virome | 0.819255 |
10,175 | Multiple methods are available for the isolation and study of human viruses: Deep sequencing is a rapid DNA sequencing technique that is useful for characterizing virome richness, stability, gene function and the association with disease phenotypes. This technology creates large amounts of sequence information and is c... | Human virome | 0.819255 |
10,176 | In addition to invited talks and symposia, NeurIPS also organizes two named lectureships to recognize distinguished researchers. The NeurIPS Board introduced the Posner Lectureship in honor of NeurIPS founder Ed Posner; two Posner Lectures were given each year up to 2015. Past lecturers have included: 2010 – Josh Tenen... | Neural Information Processing Systems | 0.819251 |
10,177 | The NeurIPS meeting was first proposed in 1986 at the annual invitation-only Snowbird Meeting on Neural Networks for Computing organized by The California Institute of Technology and Bell Laboratories. NeurIPS was designed as a complementary open interdisciplinary meeting for researchers exploring biological and artifi... | Neural Information Processing Systems | 0.819251 |
10,178 | Along with machine learning and neuroscience, other fields represented at NeurIPS include cognitive science, psychology, computer vision, statistical linguistics, and information theory. Over the years, NeurIPS became a premier conference on machine learning and although the 'Neural' in the NeurIPS acronym had become s... | Neural Information Processing Systems | 0.819251 |
10,179 | The board of trustees consists of previous general chairs of the NeurIPS Conference. The first proceedings was published in book form by the American Institute of Physics in 1987, and was entitled Neural Information Processing Systems, then the proceedings from the following conferences have been published by Morgan Ka... | Neural Information Processing Systems | 0.819251 |
10,180 | Research presented in the early NeurIPS meetings included a wide range of topics from efforts to solve purely engineering problems to the use of computer models as a tool for understanding biological nervous systems. Since then, the biological and artificial systems research streams have diverged, and recent NeurIPS pr... | Neural Information Processing Systems | 0.819251 |
10,181 | The Conference and Workshop on Neural Information Processing Systems (abbreviated as NeurIPS and formerly NIPS) is a machine learning and computational neuroscience conference held every December. The conference is currently a double-track meeting (single-track until 2015) that includes invited talks as well as oral an... | Neural Information Processing Systems | 0.819251 |
10,182 | LIBSVM and LIBLINEAR are two popular open source machine learning libraries, both developed at the National Taiwan University and both written in C++ though with a C API. LIBSVM implements the sequential minimal optimization (SMO) algorithm for kernelized support vector machines (SVMs), supporting classification and re... | LIBSVM | 0.81925 |
10,183 | Quadratic variations and covariations of all semimartingales can be shown to exist. They form an important part of the theory of stochastic calculus, appearing in Itô's lemma, which is the generalization of the chain rule to the Itô integral. The quadratic covariation also appears in the integration by parts formula X ... | Quadratic variation | 0.819249 |
10,184 | Turing's paper ... contains, in essence, the invention of the modern computer and some of the programming techniques that accompanied it. In terms of computational complexity, a multi-tape universal Turing machine need only be slower by logarithmic factor compared to the machines it simulates. This result was obtained ... | Deterministic Turing machine | 0.819249 |
10,185 | All càdlàg martingales, and local martingales have well defined quadratic variation, which follows from the fact that such processes are examples of semimartingales. It can be shown that the quadratic variation {\displaystyle } of a general locally square integrable martingale M {\displaystyle M} is the unique right-c... | Quadratic variation | 0.819249 |
10,186 | Here, c p < C p {\displaystyle c_{p} 0 {\displaystyle p>0} . An alternative process, the predictable quadratic variation is sometimes used for locally square integrable martingales. This is written as ⟨ M t ⟩ {\displaystyle \langle M_{t}\rangle } , and is defined to be the unique right-continuous and increasing predict... | Quadratic variation | 0.819249 |
10,187 | Church's work intertwined with Turing's to form the basis for the Church-Turing thesis. This thesis states that Turing machines, lambda calculus, and other similar formalisms of computation do indeed capture the informal notion of effective methods in logic and mathematics and thus provide a model through which one can... | Deterministic Turing machine | 0.819249 |
10,188 | This is famously demonstrated through lambda calculus. A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine (UTM, or simply a universal machine). Another mathematical formalism, lambda calculus, with a similar "universal" nature was introduced by Alonzo Church. | Deterministic Turing machine | 0.819249 |
10,189 | The x87 floating point architecture is an example of a set of registers organised as a stack where direct access to individual registers (relative to the current top) is also possible. Having the top-of-stack as an implicit argument allows for a small machine code footprint with a good usage of bus bandwidth and code c... | Stack (abstract data type) | 0.819244 |
10,190 | Elimination methods are algorithms that preferentially eliminate a specified set of derivatives from a set of differential equations, commonly done to better understand and solve sets of differential equations. Categories of elimination methods include characteristic set methods, differential Gröbner bases methods and ... | Differential field | 0.819244 |
10,191 | : 343 Thus, a differential ring is an algebra over its differential subring. This is the natural structure of an algebra over its subring. : 75 | Differential field | 0.819244 |
10,192 | Any ring with identity is a Z - {\textstyle \operatorname {{\mathcal {Z}}-} } algebra. : 343 Thus a differential ring is a Z - {\textstyle \operatorname {{\mathcal {Z}}-} } algebra. If ring R {\textstyle {\mathcal {R}}} is a subring of the center of unital ring M {\textstyle {\mathcal {M}}} , then M {\textstyle {\mathc... | Differential field | 0.819244 |
10,193 | {\textstyle {\mathcal {I}}_{\text{dif}}=:H_{\Omega }^{\infty }.} Regular algebraic ideal: I dif = ( A ): H Ω ∞ . {\textstyle {\mathcal {I}}_{\text{dif}}=(A):H_{\Omega }^{\infty }.} | Differential field | 0.819244 |
10,194 | A regular system Ω {\textstyle \Omega } contains a autoreduced and coherent set of differential equations A {\textstyle A} and a inequation set H Ω ⊇ H A {\textstyle H_{\Omega }\supseteq H_{A}} with set H Ω {\textstyle H_{\Omega }} reduced with respect to the equation set. : 160 Regular differential ideal I dif {\texts... | Differential field | 0.819244 |
10,195 | A differential graded algebra is a graded algebra A {\textstyle A} with a linear derivation d: A → A {\textstyle d:A\to A} with d ∘ d = 0 {\displaystyle d\circ d=0} that follows the graded Leibniz product rule. : 58–59 Graded Leibniz product rule: ∀ a , b ∈ A , d ( a ⋅ b ) = d ( a ) ⋅ b + ( − 1 ) | a | ⋅ a ⋅ d ( b ) {\... | Differential field | 0.819244 |
10,196 | This allows representing a radical differential ideal by such a finite set of generators, and computing with these ideals. However, some usual computations of the algebraic case cannot be extended. | Differential field | 0.819244 |
10,197 | The second fact is that, if the field K {\displaystyle K} contains the field of rational numbers, the rings of differential polynomials over K {\displaystyle K} satisfy the ascending chain condition on radical differential ideals. This Ritt’s theorem is implied by its generalization, sometimes called the Ritt-Raudenbus... | Differential field | 0.819244 |
10,198 | In mathematics, differential algebra is, broadly speaking, the area of mathematics consisting in the study of differential equations and differential operators as algebraic objects in view of deriving properties of differential equations and operators without computing the solutions, similarly as polynomial algebras ar... | Differential field | 0.819244 |
10,199 | Quantum mechanics describes the spatial and energetic properties of electrons as molecular orbitals that surround two or more atoms in a molecule and contain valence electrons between atoms. Molecular orbital theory revolutionized the study of chemical bonding by approximating the states of bonded electrons—the molecul... | Molecular Orbital Theory | 0.819241 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.