id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
9,200 | This is a very recent work published on March 9, 2015, in the journal Proceedings of the National Academy of Sciences, by researchers from Brown University and Johns Hopkins University. It evaluates how the computer vision systems understand the Images as compared to humans. Currently the test is written and the interr... | Visual Turing Test | 0.820537 |
9,201 | A large number of datasets have been annotated and generalised to benchmark performances of difference classes of algorithms to assess different vision tasks (e.g., object detection/recognition) on some image domain (e.g., scene images). One of the most famous datasets in computer vision is ImageNet which is used to as... | Visual Turing Test | 0.820537 |
9,202 | The Visual Turing Test, it is “an operator-assisted device that produces a stochastic sequence of binary questions from a given test image”. The query engine produces a sequence of questions that have unpredictable answers given the history of questions. The test is only about vision and does not require any natural la... | Visual Turing Test | 0.820537 |
9,203 | The Visual Turing Test (VTT) unlike the Turing test has a query engine system which interrogates a computer vision system in the presence of a human co-ordinator. It is a system that generates a random sequence of binary questions specific to the test image, such that the answer to any question k is unpredictable given... | Visual Turing Test | 0.820537 |
9,204 | He reported that there was a peak intensity that increased with temperature, that the shape of the spectrum was not symmetrical about the peak, that there was a strong fall-off of intensity when the wavelength was shorter than an approximate cut-off value for each temperature, that the approximate cut-off wavelength de... | Plancks law | 0.820529 |
9,205 | In 1859, not knowing of Stewart's work, Gustav Robert Kirchhoff reported the coincidence of the wavelengths of spectrally resolved lines of absorption and of emission of visible light. Importantly for thermal physics, he also observed that bright lines or dark lines were apparent depending on the temperature difference... | Plancks law | 0.820529 |
9,206 | However, although this equation worked, Planck himself said unless he could explain the formula derived from a "lucky intuition" into one of "true meaning" in physics, it did not have true significance. Planck explained that thereafter followed the hardest work of his life. Planck did not believe in atoms, nor did he t... | Plancks law | 0.820529 |
9,207 | Planck explained further that the respective definite unit, ϵ, of energy should be proportional to the respective characteristic oscillation frequency ν of the hypothetical oscillator, and in 1901 he expressed this with the constant of proportionality h: Planck did not propose that light propagating in free space is qu... | Plancks law | 0.820529 |
9,208 | Most compilers have at least the following compiler phases (which therefore occur at compile-time): syntax analysis, semantic analysis, and code generation. During optimization phases, constant expressions in the source code can also be evaluated at compile-time using compile-time execution, which reduces the constant ... | Compile time | 0.820525 |
9,209 | In computer science, compile time (or compile-time) describes the time window during which a language's statements are converted into 0s and 1s for the computer to understand. The term is used as an adjective to describe concepts related to the context of program compilation, as opposed to concepts related to the conte... | Compile time | 0.820525 |
9,210 | In mathematics and computer science, the sorting numbers are a sequence of numbers introduced in 1950 by Hugo Steinhaus for the analysis of comparison sort algorithms. These numbers give the worst-case number of comparisons used by both binary insertion sort and merge sort. However, there are other algorithms that use ... | Sorting number | 0.820522 |
9,211 | The FAQ has become an important component of websites, either as a stand-alone page or as a website section with multiple subpages per question or topic. Embedded links to FAQ pages have become commonplace in website navigation bars, bodies, or footers. The FAQ page is an important consideration in web design, in order... | FAQ | 0.820517 |
9,212 | As a fundamental aspect of thermodynamics and physics, several different approaches to entropy beyond that of Clausius and Boltzmann are valid. | Molar entropy | 0.820514 |
9,213 | Romanian American economist Nicholas Georgescu-Roegen, a progenitor in economics and a paradigm founder of ecological economics, made extensive use of the entropy concept in his magnum opus on The Entropy Law and the Economic Process. Due to Georgescu-Roegen's work, the laws of thermodynamics form an integral part of t... | Molar entropy | 0.820514 |
9,214 | In quantum statistical mechanics, the concept of entropy was developed by John von Neumann and is generally referred to as "von Neumann entropy", S = − k B Tr ( ρ ln ρ ) , {\displaystyle S=-k_{\text{B}}\operatorname {Tr} (\rho \ln \rho ),} where ρ is the density matrix, and Tr is the trace operator. This upholds th... | Molar entropy | 0.820514 |
9,215 | Matter is made up by atoms (formed by protons and other subatomic particles). When the environment is right, atoms can join together and form molecules, which give rise to most materials studied in materials science. But certain environments, such as high temperatures, don't allow atoms to form molecules. Stars have ve... | Molecules in stars | 0.820513 |
9,216 | In organic chemistry, kinetic resolution is a means of differentiating two enantiomers in a racemic mixture. In kinetic resolution, two enantiomers react with different reaction rates in a chemical reaction with a chiral catalyst or reagent, resulting in an enantioenriched sample of the less reactive enantiomer. As opp... | Kinetic resolution | 0.820513 |
9,217 | The International Symposium on Computational Geometry (SoCG) is an academic conference in computational geometry. It was founded in 1985, with program committee consisting of David Dobkin, Joseph O'Rourke, Franco Preparata, and Godfried Toussaint; O'Rourke was the conference chair. The symposium was originally sponsore... | Symposium on Computational Geometry | 0.820512 |
9,218 | The projective linear group is not special because there exist Azumaya algebras, which are trivial over a finite separable extension, but not over the base field. Special groups were defined in 1958 by Jean-Pierre Serre and classified soon thereafter by Alexander Grothendieck. == References == | Special group (algebraic group theory) | 0.820504 |
9,219 | In the theory of algebraic groups, a special group is a linear algebraic group G with the property that every principal G-bundle is locally trivial in the Zariski topology. Special groups include the general linear group, the special linear group, and the symplectic group. Special groups are necessarily connected. Prod... | Special group (algebraic group theory) | 0.820504 |
9,220 | A geometry template is a piece of clear plastic with cut-out shapes for use in mathematics and other subjects in primary school through secondary school. It also has various measurements on its sides to be used like a ruler. In Australia, popular brands include Mathomat and MathAid. | Geometry template | 0.820504 |
9,221 | In molecular biology, the plant calmodulin-binding domain is a protein domain found repeated in a number of plant calmodulin-binding proteins. These domains are thought to constitute the calmodulin-binding domains of these proteins. Binding of the proteins to calmodulin depends on the presence of calcium ions. These pr... | Plant calmodulin-binding domain | 0.820503 |
9,222 | A stopping time τ {\displaystyle \tau } can define a σ {\displaystyle \sigma } -algebra F τ , {\displaystyle {\mathcal {F}}_{\tau },} the so-called stopping time sigma-algebra, which in a filtered probability space describes the information up to the random time τ {\displaystyle \tau } in the sense that, if the filtere... | Σ-algebra | 0.820488 |
9,223 | Suppose Y {\displaystyle Y} is a subset of X {\displaystyle X} and let ( X , Σ ) {\displaystyle (X,\Sigma )} be a measurable space. The collection { Y ∩ B: B ∈ Σ } {\displaystyle \{Y\cap B:B\in \Sigma \}} is a σ-algebra of subsets of Y . {\displaystyle Y.} Suppose ( Y , Λ ) {\displaystyle (Y,\Lambda )} is a measurable ... | Σ-algebra | 0.820488 |
9,224 | This is the σ-algebra generated by the singletons of X . {\displaystyle X.} Note: "countable" includes finite or empty. The collection of all unions of sets in a countable partition of X {\displaystyle X} is a σ-algebra. | Σ-algebra | 0.820488 |
9,225 | The collection { ∅ , A , X ∖ A , X } {\displaystyle \{\varnothing ,A,X\setminus A,X\}} is a simple σ-algebra generated by the subset A . {\displaystyle A.} The collection of subsets of X {\displaystyle X} which are countable or whose complements are countable is a σ-algebra (which is distinct from the power set of X {\... | Σ-algebra | 0.820488 |
9,226 | Let X {\displaystyle X} be any set. The family consisting only of the empty set and the set X , {\displaystyle X,} called the minimal or trivial σ-algebra over X . {\displaystyle X.} The power set of X , {\displaystyle X,} called the discrete σ-algebra. | Σ-algebra | 0.820488 |
9,227 | It includes basic arithmetic functionality as well as numerical methods, dense and sparse linear algebra. The DoubleFloats package provides support for double-double computations for the Julia programming language. The doubledouble.py library enables double-double computations in Python.Mathematica supports IEEE quad-p... | IEEE quad precision | 0.820484 |
9,228 | Plant lipid transfer proteins consist of 4 alpha-helices in a right-handed superhelix with a folded leaf topology. The structure is stabilised by disulfide bridges linking the helices to each other. The structure forms an internal hydrophobic cavity in which 1-2 lipids can be bound. The outer surface of the protein is ... | Plant lipid transfer proteins | 0.820482 |
9,229 | In social sciences and other domains, representative sequences are whole sequences that best characterize or summarize a set of sequences. In bioinformatics, representative sequences also designate substrings of a sequence that characterize the sequence. | Representative sequences | 0.820477 |
9,230 | A great deal of engineering, chemistry and material science was completed. After final components were developed, operational testing completed with 4,000 hours of continuous operation, 2,000 on Montana Rosebud, 2,000 on Illinois No. 6. The testing ended in 1993. | MHD dynamo | 0.820473 |
9,231 | A joint U.S.-China national programme ended in 1992 by retrofitting the coal-fired No. 3 plant in Asbach. A further eleven-year program was approved in March 1994. This established centres of research in: The Institute of Electrical Engineering in the Chinese Academy of Sciences, Beijing, concerned with MHD generator d... | MHD dynamo | 0.820473 |
9,232 | In mathematics, particularly in differential geometry, an osculating plane is a plane in a Euclidean space or affine space which meets a submanifold at a point in such a way as to have a second order of contact at the point. The word osculate is from the Latin osculatus which is a past participle of osculari, meaning t... | Osculating plane | 0.820462 |
9,233 | The impetus of the puzzles included with the device was the frustration of the programmer and chemistry professor Paul Boswell (along with his wife, Alyssa Boswell, a DIY maker), then at the University of Minnesota, at the lack of computing prowess of other scientists which was necessary for their own projects. Boswell... | Turing Tumble | 0.82046 |
9,234 | Named after Alan Turing, the game itself could (abstractly) duplicate the processes of any computer whatsoever if the game field itself were sufficiently large. This follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles is allowed. The device has imp... | Turing Tumble | 0.82046 |
9,235 | The Protein Structure Initiative (PSI), funded by the U.S. National Institute of General Medical Sciences (NIGMS), part of the National Institutes of Health (NIH), has among its aim to determine three-dimensional protein structures and to develop techniques for use in structural biology, including for membrane proteins... | Integral protein | 0.820442 |
9,236 | The boundaries of the polytopes, the data dependencies, and the transformations are often described using systems of constraints, and this approach is often referred to as a constraint-based approach to loop optimization. For example, a single statement within an outer loop 'for i := 0 to n' and an inner loop 'for j :=... | Loop optimization | 0.820439 |
9,237 | This can help eliminate dependencies and thus enable other optimizations. Certain architectures utilize looping constructs at assembly level that count in a single direction only (e.g., decrement-jump-if-not-zero ). Scheduling – this divides a loop into multiple parts that may be run concurrently on multiple processors... | Loop optimization | 0.820439 |
9,238 | It can be done automatically by compilers (automatic parallelization) or manually (inserting parallel directives like OpenMP). Reversal – a subtle optimization that reverses the order in which values are assigned to the index variable. | Loop optimization | 0.820439 |
9,239 | This can improve locality of reference, both of the data being accessed in the loop and the code in the loop's body. Fusion or combining – this combines the bodies of two adjacent loops that would iterate the same number of times (whether or not that number is known at compile time), as long as they make no reference t... | Loop optimization | 0.820439 |
9,240 | Loop optimization can be viewed as the application of a sequence of specific loop transformations (listed below or in Compiler transformations for high-performance computing) to the source code or intermediate representation, with each transformation having an associated test for legality. A transformation (or sequence... | Loop optimization | 0.820439 |
9,241 | Since instructions inside loops can be executed repeatedly, it is frequently not possible to give a bound on the number of instruction executions that will be impacted by a loop optimization. This presents challenges when reasoning about the correctness and benefits of a loop optimization, specifically the representati... | Loop optimization | 0.820439 |
9,242 | In compiler theory, loop optimization is the process of increasing execution speed and reducing the overheads associated with loops. It plays an important role in improving cache performance and making effective use of parallel processing capabilities. Most execution time of a scientific program is spent on loops; as s... | Loop optimization | 0.820439 |
9,243 | The study of electricity leakage led to many insights in the study of electricity. The machine was last modified in 1791. For the friction, cushions were used as an improvement over the mercury bath used in the earlier model. For a complete description of the electrostatic generator, an explanation was produced in 1868... | Large electrostatic generator (Teylers) | 0.820437 |
9,244 | The device is a larger version of a similar model built in Groningen by Gerhard Kuyper in 1774 for physics student Martin van Marum, who used it to make a name for himself in the study of electricity with his lectures and demonstrations.It was Van Marum's dream to create a larger version, and he applied to the Teylers ... | Large electrostatic generator (Teylers) | 0.820437 |
9,245 | Several different control strategies have been devised in the past years. These vary from extremely general ones (PID controller), to others devoted to very particular classes of systems (especially robotics or aircraft cruise control). A control problem can have several specifications. Stability, of course, is always ... | Control Theory | 0.82043 |
9,246 | The adjective which corresponds to squaring is quadratic. The square of an integer may also be called a square number or a perfect square. In algebra, the operation of squaring is often generalized to polynomials, other expressions, or values in systems of mathematical values other than the numbers. | Modulus squared | 0.820426 |
9,247 | There has long been a standard account of the development of geometry in ancient Egypt, followed by Greek mathematics and the emergence of deductive logic. The modern sense of the term mathematics, as meaning only those systems justified with reference to axioms, is however an anachronism if read back into history. Sev... | Informal mathematics | 0.820419 |
9,248 | This is of direct interest in anthropology and psychology: it casts light on the perceptions and agreements of other cultures. It is also of interest in developmental psychology as it reflects a naïve understanding of the relationships between numbers and things. Another term used for informal mathematics is folk mathe... | Informal mathematics | 0.820419 |
9,249 | When developing algorithms for Galois field computation on small Galois fields, a common performance optimization approach is to find a generator g and use the identity: a b = g log g ( a b ) = g log g ( a ) + log g ( b ) {\displaystyle ab=g^{\log _{g}(ab)}=g^{\log _{g}(a)+\log _{g}(b)}} to implement multiplicati... | Finite field arithmetic | 0.820418 |
9,250 | This D program will multiply numbers in Rijndael's finite field and generate a PGM image: This example does not use any branches or table lookups in order to avoid side channels and is therefore suitable for use in cryptography. | Finite field arithmetic | 0.820418 |
9,251 | Here is some C code which will add and multiply numbers in the characteristic 2 finite field of order 28, used for example by Rijndael algorithm or Reed–Solomon, using the Russian peasant multiplication algorithm: This example has cache, timing, and branch prediction side-channel leaks, and is not suitable for use in c... | Finite field arithmetic | 0.820418 |
9,252 | Addition and subtraction are performed by adding or subtracting two of these polynomials together, and reducing the result modulo the characteristic. In a finite field with characteristic 2, addition modulo 2, subtraction modulo 2, and XOR are identical. Thus, Under regular addition of polynomials, the sum would contai... | Finite field arithmetic | 0.820418 |
9,253 | In mathematics, finite field arithmetic is arithmetic in a finite field (a field containing a finite number of elements) contrary to arithmetic in a field with an infinite number of elements, like the field of rational numbers. There are infinitely many different finite fields. Their number of elements is necessarily o... | Finite field arithmetic | 0.820418 |
9,254 | Logical Methods in Computer Science (LMCS) is a peer-reviewed open access scientific journal covering theoretical computer science and applied logic. It opened to submissions on September 1, 2004. The editor-in-chief is Stefan Milius (Friedrich-Alexander Universität Erlangen-Nürnberg). | Logical Methods in Computer Science | 0.820411 |
9,255 | Photochemical & Photobiological Sciences is a monthly peer-reviewed scientific journal covering all areas of photochemistry and photobiology. It was established in 2002 and is published by Springer Science+Business Media on behalf of the European Photochemistry Association and the European Society for Photobiology. The... | Photochemical and Photobiological Sciences | 0.82041 |
9,256 | Antoine Lavoisier, in his famed 1789 Traité Élémentaire de Chimie (Elements of Chemistry), refers to Bergman's work and discusses the concept of elective affinities or attractions. According to chemistry historian Henry Leicester, the influential 1923 textbook Thermodynamics and the Free Energy of Chemical Reactions by... | Chemical affinity | 0.820405 |
9,257 | The broad definition, used generally throughout history, is that chemical affinity is that whereby substances enter into or resist decomposition.The modern term chemical affinity is a somewhat modified variation of its eighteenth-century precursor "elective affinity" or elective attractions, a term that was used by the... | Chemical affinity | 0.820405 |
9,258 | 1600 in discussions of structural relationships in chemistry, philology, etc., and reference to "natural attraction" is from 1616. "Chemical affinity", historically, has referred to the "force" that causes chemical reactions. as well as, more generally, and earlier, the ″tendency to combine″ of any pair of substances. | Chemical affinity | 0.820405 |
9,259 | The idea of affinity is extremely old. Many attempts have been made at identifying its origins. The majority of such attempts, however, except in a general manner, end in futility since "affinities" lie at the basis of all magic, thereby pre-dating science. Physical chemistry, however, was one of the first branches of ... | Chemical affinity | 0.820405 |
9,260 | In chemical physics and physical chemistry, chemical affinity is the electronic property by which dissimilar chemical species are capable of forming chemical compounds. Chemical affinity can also refer to the tendency of an atom or compound to combine by chemical reaction with atoms or compounds of unlike composition. | Chemical affinity | 0.820405 |
9,261 | During the 18th century many versions of the table were proposed with leading chemists like Torbern Bergman in Sweden and Joseph Black in Scotland adapting it to accommodate new chemical discoveries. All the tables were essentially lists, prepared by collating observations on the actions of substances one upon another,... | Chemical affinity | 0.820405 |
9,262 | A computer-assisted parallel program generation support(P-NCAS), is a PSE, creates a new way to reduce the programming hard task for the computer programming. This program can avoid or reduce the chance that huge computer software breaking down so this restrict uncertainty and major accidents in the society. Moreover, ... | Problem Solving Environment | 0.820405 |
9,263 | Many PSEs were introduced in the 1990s. They use the language of the respective field and often employ modern graphical user interfaces. The goal is to make the software easy to use for specialists in fields other than computer science. PSEs are available for generic problems like data visualization or large systems of... | Problem Solving Environment | 0.820405 |
9,264 | Professor of physics Michael Fisher won the Wolf Prize in 1980 (together with Kenneth G. Wilson and Leo Kadanoff) and the IUPAP Boltzmann Medal in 1983. James A. Yorke, a distinguished university professor of mathematics and physics and chair of the mathematics department, won the 2003 Japan Prize for his work in chaot... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,265 | In 2006, John C. Mather was awarded the prize in physics alongside George Smoot for their work in the discovery of blackbody form and anisotropy of the cosmic microwave background radiation. In addition, two University of Maryland alumni are Nobel Prize laureates; Herbert Hauptman won the 1985 prize in chemistry, and R... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,266 | The university hosts "living-learning" programs (LLPs) that allow students with similar academic interests to live in the same residential community take specialized courses and perform research in those areas of expertise. These include CIVICUS, focused on politics and community service; Hinman CEOs, an entrepreneursh... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,267 | from the university in 1991 and gave $5 million for the construction of a state-of-the-art engineering building. Philip Merrill, a media figure, donated $10 million to the College of Journalism. Robert E. Fischell, physicist, inventor, and holder of more than 200 U.S. and foreign medical patents donated $30 million to ... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,268 | Attendees within the fields of science and mathematics are Nobel laureates Raymond Davis Jr., 2002 winner in Physics; Herbert Hauptman, 1985 winner in Chemistry, and Fields Medal winner Charles Fefferman. Other alumni include George Dantzig, considered the father of linear programming; late NASA astronaut Judith Resnik... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,269 | The university's faculty has included four Nobel Prize laureates. The earliest recipient (1956), was Juan Ramón Jiménez, a Spanish language and literature professor. Four decades later, physics professor William Daniel Phillips won a prize in physics for his contributions to laser cooling. In 2005, Thomas Schelling was... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,270 | As a result of the data breaches, the university offered free credit protection for five years to the students and faculty affected.In 2012, the University of Maryland, College Park and the University of Maryland, Baltimore united under the MPowering the State initiative to leverage the strengths of both institutions. ... | Center for Bioinformatics and Computational Biology | 0.820404 |
9,271 | In these terms, Hilbert's tenth problem asks whether there is an algorithm to determine if a given Diophantine set is non-empty. The work on the problem has been in terms of solutions in natural numbers (understood as the non-negative integers) rather than arbitrary integers. The two problems are equivalent: any genera... | Hilbert's 10th problem | 0.8204 |
9,272 | Shlapentokh and Thanases Pheidas (independently of one another) obtained the same result for algebraic number fields admitting exactly one pair of complex conjugate embeddings. The problem for the ring of integers of algebraic number fields other than those covered by the results above remains open. | Hilbert's 10th problem | 0.8204 |
9,273 | Although Hilbert posed the problem for the rational integers, it can be just as well asked for many rings (in particular, for any ring whose number of elements is countable). Obvious examples are the rings of integers of algebraic number fields as well as the rational numbers. There has been much work on Hilbert's tent... | Hilbert's 10th problem | 0.8204 |
9,274 | Let A {\displaystyle A} be an algorithm that outputs a sequence of natural numbers n {\displaystyle n} such that the corresponding equation p ( n , x 1 , … , x k ) = 0 {\displaystyle p(n,x_{1},\ldots ,x_{k})=0} has no solutions in natural numbers. Then there is a number n 0 {\displaystyle n_{0}} which is not output by ... | Hilbert's 10th problem | 0.8204 |
9,275 | Π 1 0 {\displaystyle \Pi _{1}^{0}} sentences have the special property that if they are false, that fact will be provable in any of the usual formal systems. This is because the falsity amounts to the existence of a counter-example which can be verified by simple arithmetic. So if a Π 1 0 {\displaystyle \Pi _{1}^{0}} s... | Hilbert's 10th problem | 0.8204 |
9,276 | A number of important and celebrated problems are of this form: in particular, Fermat's Last Theorem, the Riemann hypothesis, and the Four color theorem. In addition the assertion that particular formal systems such as Peano arithmetic or ZFC are consistent can be expressed as Π 1 0 {\displaystyle \Pi _{1}^{0}} sentenc... | Hilbert's 10th problem | 0.8204 |
9,277 | The same holds for other recursively enumerable sets of natural numbers: the factorial, the binomial coefficients, the fibonacci numbers, etc. Other applications concern what logicians refer to as Π 1 0 {\displaystyle \Pi _{1}^{0}} propositions, sometimes also called propositions of Goldbach type. These are like Goldba... | Hilbert's 10th problem | 0.8204 |
9,278 | The Matiyasevich/MRDP Theorem relates two notions – one from computability theory, the other from number theory — and has some surprising consequences. Perhaps the most surprising is the existence of a universal Diophantine equation: There exists a polynomial p ( a , n , x 1 , … , x k ) {\displaystyle p(a,n,x_{1},\ldot... | Hilbert's 10th problem | 0.8204 |
9,279 | Natural language can be broadly defined as different from artificial and constructed languages, e.g. computer programming languages constructed international auxiliary languages non-human communication systems in nature such as whale and other marine mammal vocalizations or honey bees' waggle dance.All varieties of wor... | Natural language | 0.8204 |
9,280 | In biology, function has been defined in many ways. In physiology, it is simply what an organ, tissue, cell or molecule does. In the philosophy of biology, talk of function inevitably suggests some kind of teleological purpose, even though natural selection operates without any goal for the future. All the same, biolog... | Function (biology) | 0.820396 |
9,281 | In evolutionary biology, function is the reason some object or process occurred in a system that evolved through natural selection. That reason is typically that it achieves some result, such as that chlorophyll helps to capture the energy of sunlight in photosynthesis. Hence, the organism that contains it is more like... | Function (biology) | 0.820396 |
9,282 | To say 'a tree grows flowers to attract pollinators' would be incorrect if the 'to' implies purpose. A function describes what something does, not what its 'purpose' is. However, teleological language is often used by biologists as a shorthand way of describing function, even though its applicability is disputed.In con... | Function (biology) | 0.820396 |
9,283 | Function is not the same as purpose in the teleological sense, that is, possessing conscious mental intention to achieve a goal. In the philosophy of biology, evolution is a blind process which has no 'goal' for the future. For example, a tree does not grow flowers for any purpose, but does so simply because it has evo... | Function (biology) | 0.820396 |
9,284 | A functional characteristic is known in evolutionary biology as an adaptation, and the research strategy for investigating whether a character is adaptive is known as adaptationism. Although assuming that a character is functional may be helpful in research, some characteristics of organisms are non-functional, formed ... | Function (biology) | 0.820396 |
9,285 | The second part of Descartes on Polyhedra reviews this debate, and compares the reasoning of Descartes and Euler on these topics. Ultimately, the book concludes that Descartes probably did not discover Euler's formula, and reviewers Senechal and H. S. M. Coxeter agree, writing that Descartes did not have a concept for ... | Descartes on Polyhedra | 0.820386 |
9,286 | Descartes used this theorem to prove that the five Platonic solids are the only possible regular polyhedra. It is also possible to derive Euler's formula V − E + F = 2 {\displaystyle V-E+F=2} relating the numbers of vertices, edges, and faces of a convex polyhedron from Descartes' theorem, and De solidorum elementis al... | Descartes on Polyhedra | 0.820386 |
9,287 | The original Latin manuscript of De solidorum elementis was written circa 1630 by Descartes; reviewer Marjorie Senechal calls it "the first general treatment of polyhedra", Descartes' only work in this area, and unfinished, with its statements disordered and some incorrect. It turned up in Stockholm in Descartes' estat... | Descartes on Polyhedra | 0.820386 |
9,288 | Reviewer F. A. Sherk, after noting the obvious relevance of Descartes on Polyhedra to historians of mathematics, recommends it as well to geometers and to amateur mathematicians. He writes that it provides a good introduction to some important topics in the mathematics of polyhedra, makes an interesting connection to n... | Descartes on Polyhedra | 0.820386 |
9,289 | Institute of Education Sciences (IES), Washington, DC, is the statistics, research, and evaluation arm of the U.S. Department of Education. It funds independent education research, evaluation and statistics. | Evidence-based learning | 0.820381 |
9,290 | In fact, p e = − log {\displaystyle pe=-\log} is defined as the negative logarithm of the free electron concentration in solution, and is directly proportional to the redox potential. Sometimes p e {\displaystyle pe} is used as a unit of reduction potential instead of E h {\displaystyle E_{h}} , for example, in envi... | Oxidation potential | 0.82038 |
9,291 | In the field of environmental chemistry, the reduction potential is used to determine if oxidizing or reducing conditions are prevalent in water or soil, and to predict the states of different chemical species in the water, such as dissolved metals. pe values in water range from -12 to 25; the levels where the water it... | Oxidation potential | 0.82038 |
9,292 | New Biotechnology is a peer-reviewed scientific journal and the official journal of the European Federation of Biotechnology. It is published bimonthly by Elsevier. The journal covers research, industrial, and commercial aspects of biotechnology, in areas such as: healthcare and pharmaceuticals; food and agriculture; b... | New Biotechnology | 0.820379 |
9,293 | In mathematics, an operator or transform is a function from one space of functions to another. Operators occur commonly in engineering, physics and mathematics. Many are integral operators and differential operators. In the following L is an operator L: F → G {\displaystyle L:{\mathcal {F}}\to {\mathcal {G}}} which tak... | List of mathematic operators | 0.820378 |
9,294 | This short form of writing Maxwell's equations illustrates an idea shared amongst some physicists, namely that the laws of physics take on a simpler form when written using tensors. By lowering the indices on Fαβ to obtain Fαβ: F α β = η α λ η β μ F λ μ {\displaystyle F_{\alpha \beta }=\eta _{\alpha \lambda }\eta _{\be... | Classical electromagnetism and special relativity | 0.820372 |
9,295 | The laws and mathematical objects in classical electromagnetism can be written in a form which is manifestly covariant. Here, this is only done so for vacuum (or for the microscopic Maxwell equations, not using macroscopic descriptions of materials such as electric permittivity), and uses SI units. This section uses Ei... | Classical electromagnetism and special relativity | 0.820372 |
9,296 | The chosen reference frame determines whether an electromagnetic phenomenon is viewed as an electric or magnetic effect or a combination of the two. Authors usually derive magnetism from electrostatics when special relativity and charge invariance are taken into account. The Feynman Lectures on Physics (vol. 2, ch. | Classical electromagnetism and special relativity | 0.820372 |
9,297 | Similarities are computed as probabilities that a document is relevant for a given query. Probabilistic theorems like the Bayes' theorem are often used in these models. Binary Independence Model Probabilistic relevance model on which is based the okapi (BM25) relevance function Uncertain inference Language models Diver... | Information storage and retrieval systems | 0.820368 |
9,298 | Set-theoretic models represent documents as sets of words or phrases. Similarities are usually derived from set-theoretic operations on those sets. Common models are: Standard Boolean model Extended Boolean model Fuzzy retrieval Algebraic models represent documents and queries usually as vectors, matrices, or tuples. T... | Information storage and retrieval systems | 0.820368 |
9,299 | A generator with an internal impedance (i.e. non-ideal generator) can be represented as either an ideal voltage generator or an ideal current generator plus the impedance. These two forms are equivalent and the transformations are given below. If the two networks are equivalent with respect to terminals ab, then V and ... | Circuit Analysis | 0.820366 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.