id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
20,800 | Kirkus Reviews described the book as "Brilliantly inventive and amusing – whole sections read like strings of knowing jokes – but a mess: Chattering spaceships with splendid if confusing names don't compensate for the absence of real characters." A few who praised it commented that Excession's complexity and frequent ... | Outside Context Problem | 0.810664 |
20,801 | When generating well defined styles, music can be seen as a combinatorial optimization problem, whereby the aim is to find the right combination of notes such that the objective function is minimized. This objective function typically contains rules of a particular style, but could be learned using machine learning met... | Algorithmic composition | 0.810663 |
20,802 | Evolutionary methods, combined with developmental processes, constitute the evo-devo approach for generation and optimization of complex structures. These methods have also been applied to music composition, where the musical structure is obtained by an iterative process that transform a very simple composition (made o... | Algorithmic composition | 0.810663 |
20,803 | Learning systems are programs that have no given knowledge of the genre of music they are working with. Instead, they collect the learning material by themselves from the example material supplied by the user or programmer. The material is then processed into a piece of music similar to the example material. This metho... | Algorithmic composition | 0.810663 |
20,804 | Markov random fields find application in a variety of fields, ranging from computer graphics to computer vision, machine learning or computational biology, and information retrieval. MRFs are used in image processing to generate textures as they can be used to generate flexible and stochastic image models. In image mod... | Markov random field | 0.810662 |
20,805 | The underlying graph of a Markov random field may be finite or infinite. When the joint probability density of the random variables is strictly positive, it is also referred to as a Gibbs random field, because, according to the Hammersley–Clifford theorem, it can then be represented by a Gibbs measure for an appropriat... | Markov random field | 0.810662 |
20,806 | In the domain of physics and probability, a Markov random field (MRF), Markov network or undirected graphical model is a set of random variables having a Markov property described by an undirected graph. In other words, a random field is said to be a Markov random field if it satisfies Markov properties. The concept or... | Markov random field | 0.810662 |
20,807 | In number theory, an unusual number is a natural number n whose largest prime factor is strictly greater than n {\displaystyle {\sqrt {n}}} . A k-smooth number has all its prime factors less than or equal to k, therefore, an unusual number is non- n {\displaystyle {\sqrt {n}}} -smooth. | Unusual number | 0.810661 |
20,808 | The optimization problem is formulated as follows. Minimize ρ x {\displaystyle \rho _{x}} + ρ y {\displaystyle \rho _{y}} + ρ z {\displaystyle \rho _{z}} subject to all eigenvalues of the brittle material stress tensor are less than or equal to zero (negative-semidefinite). Additional constraints are ρ x {\displaystyle... | Reinforced solid | 0.81066 |
20,809 | The above solution can be very useful to design reinforcement; however, it has some practical limitations. The following aspects can be included too, if the problem is solved using convex optimization: Multiple stress tensors in one point due to multiple loads on the structure instead of only one stress tensor A constr... | Reinforced solid | 0.81066 |
20,810 | The reinforced concrete will continue to carry the load provided that sufficient reinforcement is present. A typical design problem is to find the smallest amount of reinforcement that can carry the stresses on a small cube (Fig. 1). This can be formulated as an optimization problem. | Reinforced solid | 0.81066 |
20,811 | The term cycle may also refer to an element of the cycle space of a graph. There are many cycle spaces, one for each coefficient field or ring. The most common is the binary cycle space (usually called simply the cycle space), which consists of the edge sets that have even degree at every vertex; it forms a vector spac... | Simple cycle | 0.81066 |
20,812 | A chordless cycle in a graph, also called a hole or an induced cycle, is a cycle such that no two vertices of the cycle are connected by an edge that does not itself belong to the cycle. An antihole is the complement of a graph hole. Chordless cycles may be used to characterize perfect graphs: by the strong perfect gra... | Simple cycle | 0.81066 |
20,813 | Under its college level status within Texas A&M Health, the IBT consists of thematic Centers (departments) led by a Center Director and tenured and tenure-track faculty, research track faculty and associate and adjunct faculty. The approximately $10 million operating budget of the IBT consists of about 30% state funds,... | Institute of Biosciences and Technology | 0.810656 |
20,814 | The Texas A&M Institute of Biosciences and Technology (IBT), a component of Texas A&M Health, and The Texas A&M University System, is located in the world's largest medical center, the Texas Medical Center, in Houston, Texas. The institute provides a bridge between Texas A&M University System scientists and other insti... | Institute of Biosciences and Technology | 0.810656 |
20,815 | Under Arntzen's leadership, Centers for Animal Genetics, Advanced Invertebrate Molecular Sciences and Biotechnology Policy and Ethics were established and funding secured for additional endowed chairs from the Allen, John S. Dunn, and Neva and Wesley West (see Wesley West) Foundations. In 1990, he recruited Dr. Robert ... | Institute of Biosciences and Technology | 0.810656 |
20,816 | The IBT was first established as part of the Texas A&M University System with the broad goal to expand biotechnology in the system. Plans for an institutional campus in Houston came to fruition in 1986 under Mr. David Eller (Chairman of the Texas A&M University System Board of Regents) and Dr. Richard Wainerdi (Chairma... | Institute of Biosciences and Technology | 0.810656 |
20,817 | TIme-dependent neutronics and temperatures (TINTE) is a two-group diffusion code for the study of nuclear and thermal behavior of high temperature reactors. It was developed by Forschungszentrum Jülich in Germany, formally known as KFA (German: Kernforschungsanlage), to investigate HTGRs in 2D (r-Z) geometry. | Time-dependent neutronics and temperatures | 0.810652 |
20,818 | In 1981, R.L.White was appointed EE chair, with a number of successions over the next two decades.In 1997, James Plummer became the department chair, as the John M. Fluke Professor of Electrical Engineering. He became dean of the overall engineering department in 1999. Mark Horowitz was appointed chair of EE in 2009.Je... | Stanford University School of Engineering | 0.81065 |
20,819 | The Stanford University Department of Electrical Engineering offers Bachelor of Science degrees with a major in electrical engineering, full-time Master of Science degrees, and doctoral of philosophy (EE PhD) degrees.Degree programs offer some flexible options, such as coterminal BS and MS degrees completed in 5 years.... | Stanford University School of Engineering | 0.81065 |
20,820 | The Stanford Department of Electrical Engineering, also known as EE; Double E, is a department at Stanford University. Established in 1894, it is one of nine engineering departments that comprise the school of engineering, and in 1971, had the largest graduate enrollment of any department at Stanford University. The de... | Stanford University School of Engineering | 0.81065 |
20,821 | Henline as assistant professor, and two instructors. Henline started the communications laboratory in 1924.In 1925, Stanford established the school of engineering, with all undergraduate degrees in engineering given out by the school instead of the departments with the new change. F.E. Terman joined EE as an instructor... | Stanford University School of Engineering | 0.81065 |
20,822 | In 1919, Leonard F. Fuller earned a PhD degree at Stanford's electrical engineering department. Primary faculty of the EE department as of 1923 included Ryan as professor, J.C. Clark as associate professor, H.H. | Stanford University School of Engineering | 0.81065 |
20,823 | The group also used the publishing materials in the basement to product documents linking Stanford trustees to defense contractors. The sit-in ultimately led to the school severing ties with the former Stanford Research Institute and moving its military research off campus.In later 1969, the Applied Electronics Laborat... | Stanford University School of Engineering | 0.81065 |
20,824 | John G. Linvill was appointed EE chair in 1964 and subsequently built the semiconductor program at Stanford.In May 1966, after comments by Stanford administration about contracts, there was picketing by students at Stanford University protesting the Electrical Engineering Department's contract with the Central Intellig... | Stanford University School of Engineering | 0.81065 |
20,825 | The school of engineering was established in 1926, when Stanford organized the previously independent academic departments into a school. The original departments in the school were: Civil engineering, one of the original university departments (1891), later to become civil and environmental engineering Electrical engi... | Stanford University School of Engineering | 0.81065 |
20,826 | Electrical Engineering is a broad subject. Stanford's EE Department presents their research in 3 core areas, and 2 interdisciplinary areas. Information Systems & Science Hardware/Software Systems Physical Technology & Science (Interdisciplinary) Energy (Interdisciplinary) Biomedical | Stanford University School of Engineering | 0.81065 |
20,827 | Aeronautics and astronautics, started as aeronautical engineering in 1958 Chemical engineering in 1961 (split from chemistry) Computer science, established in 1965 in the school of humanities and sciences, but moved to the school of engineering in 1985 Materials science and engineering in 1961 (originally known as mate... | Stanford University School of Engineering | 0.81065 |
20,828 | Aeronautics and astronautics Bioengineering and chemical engineering (also in the School of Medicine) Chemical engineering Civil and environmental engineering Computer science Stanford Department of Electrical Engineering Materials science and engineering Management science and engineering Mechanical engineeringIn addi... | Stanford University School of Engineering | 0.81065 |
20,829 | In 1955, the department held its first courses in digital and analog computing. In 1955, Stanford merged the Electronics Research Laboratory and the Applied Electronics Laboratory into the Systems Engineering Laboratory, to focus on electronic warfare under Terman. According to Stanford, the Applied Electronics Laborat... | Stanford University School of Engineering | 0.81065 |
20,830 | According to historian Piero Scaruffi, in 1946, Frederick E. Terman became dean of Stanford's engineering school, using his connections with the military and the Office of Naval Research to both start and fund the Electronics Research Lab (ERL). The Korean War in 1950 brought in a new infusion of funds from the Office ... | Stanford University School of Engineering | 0.81065 |
20,831 | When Perrine left in 1898, the department was administered instead by civil or mechanical engineering professors instead until 1905. That year, Harris J. Ryan was named both professor and chair of electrical engineering. Under Ryan, the department began teaching high voltage transmission of electric power.A branch asso... | Stanford University School of Engineering | 0.81065 |
20,832 | Perrine gave the project to students, with the land having been purchased by private owners prior for a railroad that had fallen through. The design proposed no overhead wires, with the plant to be owned by Stanford University, and the engineering and management to be entirely constructed by the different engineering d... | Stanford University School of Engineering | 0.81065 |
20,833 | Perrine, in 1893, made an acknowledgement of gifts to Stanford's Electrical Engineering Department in The Stanford Daily, among them 30 horse power double reduction street-railroad motor, field magnets, and various machines from the General Electric Company and wires from American Electrical Works and New England Butt ... | Stanford University School of Engineering | 0.81065 |
20,834 | In 1983, when F.A.C. Perrine was appointed Stanford's first professor of electrical engineering, the program focused on central generating plants for electricity. Frederic A.C. | Stanford University School of Engineering | 0.81065 |
20,835 | Stanford University opened in 1891, and within the year, courses addressing topics such as electrical currents and magnetism were being taught by professors such as A.P. Carman. Professor Frederic A.C. Perrine was the first faculty to teach the subject of electrical engineering at Stanford, in 1893. | Stanford University School of Engineering | 0.81065 |
20,836 | Stanford University School of Engineering is one of the schools of Stanford University. The current dean is Jennifer Widom, the former senior associate dean of faculty affairs and computer science chair. She is the school's 10th dean. | Stanford University School of Engineering | 0.81065 |
20,837 | The robot errors gathered by pose measurements can be minimized by numerical optimization. For kinematic calibration, a complete kinematical model of the geometric structure must be developed, whose parameters can then be calculated by mathematical optimization. The common system behaviour can be described with the vec... | Robot calibration | 0.810648 |
20,838 | Nof, Shimon Y. Handbook of industrial robotics (Chapter 5, Section 9). Vol. | Robot calibration | 0.810648 |
20,839 | A. Nubiola and I.A. Bonev, "Absolute calibration of an ABB IRB 1600 robot using a laser tracker," Robotics and Computer-Integrated Manufacturing, Vol. 29 No. 1, 2013, pp. | Robot calibration | 0.810648 |
20,840 | Trevelyan, J. P.: Robot Calibration with a Kalman Filter. Presentation at International Conference on Advanced Robotics and Computer Vision (ICARCV96), Singapore 1996. N.N. | Robot calibration | 0.810648 |
20,841 | The variables k, l, m, n and their derivates describe the dimensions of the single vector spaces. Minimization of the residual error r for identification of the optimal parameter vector p follows from the difference between both output vectors using the Euclidean norm. For solving the kinematical optimization problems ... | Robot calibration | 0.810648 |
20,842 | If H is a path-connected, locally path-connected, and semilocally simply connected group then it has a universal cover. By the previous construction the universal cover can be made into a topological group with the covering map a continuous homomorphism. This group is called the universal covering group of H. There is ... | Lattice of covering groups | 0.810644 |
20,843 | The above definitions and constructions all apply to the special case of Lie groups. In particular, every covering of a manifold is a manifold, and the covering homomorphism becomes a smooth map. Likewise, given any discrete normal subgroup of a Lie group the quotient group is a Lie group and the quotient map is a cove... | Lattice of covering groups | 0.810644 |
20,844 | Cognitive meaningfulness was variously defined: having a truth value; corresponding to a possible state of affairs; intelligible or understandable as are scientific statements.Ethics and aesthetics were subjective preferences, while theology and other metaphysics contained "pseudostatements", neither true nor false. Th... | Protocol statement | 0.810642 |
20,845 | The logical positivists' initial stance was that a statement is "cognitively meaningful" in terms of conveying truth value, information or factual content only if some finite procedure conclusively determines its truth. By this verifiability principle, only statements verifiable either by their analyticity or by empiri... | Protocol statement | 0.810642 |
20,846 | Logical positivists picked from Ludwig Wittgenstein's early philosophy of language the verifiability principle or criterion of meaningfulness. As in Ernst Mach's phenomenalism, whereby the mind knows only actual or potential sensory experience, verificationists took all sciences' basic content to be only sensory experi... | Protocol statement | 0.810642 |
20,847 | Atlas of AI: Power, Politics, and the Planetary Costs of Artificial Intelligence is a book by Australian academic Kate Crawford. It is based on Crawford's research into the development and labor behind artificial intelligence, as well as AI's impact on the world. | Atlas of AI | 0.810641 |
20,848 | The book is mainly concerned with the ethics of artificial intelligence. | Atlas of AI | 0.810641 |
20,849 | The book received positive reviews from critics, who singled out its exploration of issues like exploitation of labour and the environment, algorithmic bias, and false claims about AI's ability to recognize human emotion.The book was considered a seminal work by Anais Resseguier of Ethics and AI. It was included on the... | Atlas of AI | 0.81064 |
20,850 | This allows free public access to the data as deposited. From the deposited data, selected information is extracted to prepare the validated and curated CSD entry which was assigned the refcode 'MITGUT'. As a part of the curation process, CCDC also applies an algorithm, DeCIFer, to help the editors assign chemistry to ... | Cambridge Structural Database | 0.810636 |
20,851 | Chem. 25. 8,789 structures were reported in New Journal of ChemistryThese 25 journals account for 704,541 of the 996,193 or 70.7% of the structures in the CSD. | Cambridge Structural Database | 0.810636 |
20,852 | As of January 2019, the summary statistics are as follows: As of January 2019, the top 25 scientific journals in terms of publication of structures in the CSD repository were: 1. 73,070 structures were reported in Inorg. Chem. | Cambridge Structural Database | 0.810636 |
20,853 | The CSD is updated with about 50,000 new structures each year, and with improvements to existing entries. Entries (structures) in the repository are released for public access as soon as the corresponding entry has appeared in the peer-reviewed scientific literature. Meanwhile, data can also be deposited and published ... | Cambridge Structural Database | 0.810636 |
20,854 | The CCDC moved into purpose-built premises on the site of the University Department of Chemistry in 1992. Kennard retired as Director in 1997 and was succeeded by David Hartley (1997-2002) and Frank Allen (2002-2008). Colin Groom was appointed as executive director from 1 October 2008 to September 2017. | Cambridge Structural Database | 0.810636 |
20,855 | The CCDC grew out of the activities of the crystallography group led by Olga Kennard OBE FRS in the Department of Organic, Inorganic and Theoretical Chemistry of the University of Cambridge. From 1965, the group began to collect published bibliographic, chemical and crystal structure data for all small molecules studie... | Cambridge Structural Database | 0.810636 |
20,856 | Biological rhythms are repetitive biological processes. Some types of biological rhythms have been described as biological clocks. They can range in frequency from microseconds to less than one repetitive event per decade. Biological rhythms are studied by chronobiology. | Biochemical oscillations | 0.810634 |
20,857 | The best studied rhythm in chronobiology is the circadian rhythm, a roughly 24-hour cycle shown by physiological processes in all these organisms. The term circadian comes from the Latin circa, meaning "around" and dies, "day", meaning "approximately a day." It is regulated by circadian clocks. | Biochemical oscillations | 0.810634 |
20,858 | (This bound is tight, as a sequence of m − 1 {\displaystyle m-1} zeroes and m − 1 {\displaystyle m-1} ones cannot have any subset of size m {\displaystyle m} summing to zero.) There are known proofs of this result using the Cauchy-Davenport theorem, Fermat's little theorem, or the Chevalley–Warning theorem.Generalizing... | Zero-sum Ramsey theory | 0.810629 |
20,859 | In mathematics, zero-sum Ramsey theory or zero-sum theory is a branch of combinatorics. It deals with problems of the following kind: given a combinatorial structure whose elements are assigned different weights (usually elements from an Abelian group A {\displaystyle A} ), one seeks for conditions that guarantee the e... | Zero-sum Ramsey theory | 0.810629 |
20,860 | ESA was a novel (non-machine learning) based approach that represented words in the form of vectors with 100,000 dimensions (where each dimension represents an Article in Wikipedia). However practical applications of the approach are limited due to the large number of required dimensions in the vectors. More recently, ... | Semantic folding | 0.810628 |
20,861 | Rule-based and machine learning-based models are fixed on the keyword level and break down if the vocabulary differs from that defined in the rules or from the training material used for the statistical models. Research in semantic spaces dates back more than 20 years. | Semantic folding | 0.810628 |
20,862 | Cross-platform languages can reduce the need to make this tradeoff, though potentially at the expense of high performance on any given node (due to run-time interpretation or lack of optimization for the particular platform). Various middleware projects have created generic infrastructure to allow diverse scientific an... | GRID computing | 0.810625 |
20,863 | These variations can be accommodated by assigning large work units (thus reducing the need for continuous network connectivity) and reassigning work units when a given node fails to report its results in the expected time. Another set of what could be termed social compatibility issues in the early days of grid computi... | GRID computing | 0.810625 |
20,864 | A theory T {\displaystyle T} is called complete if it decides every formula, meaning that for every sentence φ , {\displaystyle \varphi ,} the theory contains the sentence or its negation but not both (that is, either T ⊢ φ {\displaystyle T\vdash \varphi } or T ⊢ ¬ φ {\displaystyle T\vdash \neg \varphi } ). Since the c... | Robinson's joint consistency theorem | 0.810623 |
20,865 | Robinson's joint consistency theorem is an important theorem of mathematical logic. It is related to Craig interpolation and Beth definability. The classical formulation of Robinson's joint consistency theorem is as follows: Let T 1 {\displaystyle T_{1}} and T 2 {\displaystyle T_{2}} be first-order theories. If T 1 {\d... | Robinson's joint consistency theorem | 0.810623 |
20,866 | Being able to get paid for medical services and collect statistics about unspecified, idiosyncratic reactions does not mean that MCS is recognized as a specific disease or that any particular cause has been defined by the German government. Healthcare providers can also bill for MCS-related services under the ICD-10 co... | Multiple chemical sensitivity | 0.810622 |
20,867 | MCS was first proposed as a distinct disease by Theron G. Randolph in 1950. In 1965, Randolph founded the Society for Clinical Ecology as an organization to promote his ideas about symptoms reported by his patients. As a consequence of his insistence upon his own, non-standard definition of allergy and his unusual theo... | Multiple chemical sensitivity | 0.810622 |
20,868 | This modification also potentially allows for selective degradation of RNA]within prokaryotes as different pathways are involved in the degradation of NAD+-capped and uncapped 5′-triphosphate-RNAs. In eukaryotic cells, while the more commonly observed m7G cap promotes the stability of the mRNA and supports translation,... | NAD+ Five-prime cap | 0.81062 |
20,869 | In molecular biology, the NAD+ five-prime cap (NAD+ 5’ cap) refers to a molecule of nicotinamide adenine dinucleotide (NAD+), a nucleoside-containing metabolite, covalently bonded the 5’ end of cellular mRNA. While the more common methylated guanosine (m7G) cap is added to RNA by a capping complex that associates with ... | NAD+ Five-prime cap | 0.81062 |
20,870 | Research in Number Theory is a peer-reviewed mathematics journal covering number theory and arithmetic geometry. The editors-in-chief are Jennifer Balakrishnan (Boston University), Florian Luca (University of Witwatersrand), Ken Ono (University of Virginia), and Andrew Sutherland (Massachusetts Institute of Technology)... | Research in Number Theory | 0.810619 |
20,871 | : 16 Guillaume-François Rouelle "attributed two functions to principles: that of forming mixts and that of being an agent or instrument of chemical principles. ": 61 Thus the four principles, earth, air, fire, and water, were principles both of the chemist's operations and of the mixts they operated upon. As instrument... | Principle (chemistry) | 0.810619 |
20,872 | Georg Ernst Stahl published Philosophical Principles of Universal Chemistry in 1730 as an early effort to distinguish between mixtures and compounds. He writes, "the simple are Principles, or the first material causes of Mixts;...": 3 To define a Principle, he wrote A Principle is defined, à priori, that in a mix’d mat... | Principle (chemistry) | 0.810619 |
20,873 | Principle, in chemistry, refers to a historical concept of the constituents of a substance, specifically those that produce a certain quality or effect in the substance, such as a bitter principle, which is any one of the numerous compounds having a bitter taste. The idea of chemical principles developed out of the cla... | Principle (chemistry) | 0.810619 |
20,874 | This is obvious from the fact that we are reading the output column wise and the number of rows is M {\displaystyle M} . By the theorem above for error correction capacity up to t , {\displaystyle t,} the maximum burst length allowed is M t . {\displaystyle Mt.} | Burst error-correcting code | 0.810617 |
20,875 | Out of those, only 2 ℓ − 2 − r {\displaystyle 2^{\ell -2-r}} are divisible by g ( x ) {\displaystyle g(x)} . Therefore, the detection failure probability is very small ( 2 − r {\displaystyle 2^{-r}} ) assuming a uniform distribution over all bursts of length ℓ {\displaystyle \ell } . We now consider a fundamental theor... | Burst error-correcting code | 0.810617 |
20,876 | {\displaystyle {\tfrac {\ell }{nd+1}}.} By the theorem above, for error correction capacity up to t {\displaystyle t} , maximum burst length allowed is ( n d + 1 ) ( t − 1 ) . {\displaystyle (nd+1)(t-1).} | Burst error-correcting code | 0.810617 |
20,877 | Therefore, a ( x ) + x b b ( x ) {\displaystyle a(x)+x^{b}b(x)} is either divisible by x 2 ℓ − 1 + 1 {\displaystyle x^{2\ell -1}+1} or is 0 {\displaystyle 0} . Applying the division theorem again, we see that there exists a polynomial d ( x ) {\displaystyle d(x)} with degree δ {\displaystyle \delta } such that: Then we... | Burst error-correcting code | 0.810617 |
20,878 | By the division theorem we can write: j − i = g ( 2 ℓ − 1 ) + r , {\displaystyle j-i=g(2\ell -1)+r,} for integers g {\displaystyle g} and r , 0 ⩽ r < 2 ℓ − 1 {\displaystyle r,0\leqslant r<2\ell -1} . We rewrite the polynomial v ( x ) {\displaystyle v(x)} as follows: Notice that at the second manipulation, we introduced... | Burst error-correcting code | 0.810617 |
20,879 | To remedy the issues that arise by the ambiguity of burst descriptions with the theorem below, however before doing so we need a definition first. Definition. The number of symbols in a given error pattern y , {\displaystyle y,} is denoted by l e n g t h ( y ) . | Burst error-correcting code | 0.810617 |
20,880 | Now, we repeat the same question but for error correction: given n {\displaystyle n} and k {\displaystyle k} , what is the upper bound on the length ℓ {\displaystyle \ell } of bursts that we can correct using any ( n , k ) {\displaystyle (n,k)} code? The following theorem provides a preliminary answer to this question:... | Burst error-correcting code | 0.810617 |
20,881 | A natural question to ask is: given n {\displaystyle n} and k {\displaystyle k} , what is the maximum ℓ {\displaystyle \ell } that we can never achieve beyond? In other words, what is the upper bound on the length ℓ {\displaystyle \ell } of bursts that we can detect using any ( n , k ) {\displaystyle (n,k)} code? The f... | Burst error-correcting code | 0.810617 |
20,882 | {\displaystyle \mathrm {length} (y).} A corollary of the above theorem is that we cannot have two distinct burst descriptions for bursts of length 1 2 ( n + 1 ) . {\displaystyle {\tfrac {1}{2}}(n+1).} | Burst error-correcting code | 0.810617 |
20,883 | Studies indicate that a substantial part of the modern vehicle's value comes from intelligent systems, and that these represent most of the current automotive innovation. To facilitate this, the modern automotive engineering process has to handle an increased use of mechatronics. Configuration and performance optimizat... | Automotive technology | 0.810616 |
20,884 | One way to effectively deal with the inherent multi-physics and the control systems development that is involved when including intelligent systems, is to adopt the V-Model approach to systems development, as has been widely used in the automotive industry for twenty years or more. In this V-approach, system-level requ... | Automotive technology | 0.810616 |
20,885 | The concept of biological computation proposes that living organisms perform computations, and that as such, abstract ideas of information and computation may be key to understanding biology. As a field, biological computation can include the study of the systems biology computations performed by biota the design of al... | Biological computation | 0.81061 |
20,886 | In mathematics, a direct limit of groups is the direct limit of a direct system of groups. These are central objects of study in algebraic topology, especially stable homotopy theory and homological algebra. They are sometimes called stable groups, though this term normally means something quite different in model theo... | Direct limit of groups | 0.810608 |
20,887 | Distributed computing systems and non-uniform memory access architectures are typically the most easily scaled to large numbers of processors, and thus would seem a natural target for software that exhibits scalable parallelism. However, applications with scalable parallelism may not have parallelism of sufficiently co... | Scalable parallelism | 0.810608 |
20,888 | Molecular biology has shown that the nicotinic and muscarinic receptors belong to distinct protein superfamilies. Nicotinic receptors are of two types: Nm and Nn. Nm is located in the neuromuscular junction which causes the contraction of skeletal muscles by way of end-plate potential (EPPs). Nn causes depolarization i... | Acetylcholine receptors | 0.810607 |
20,889 | The Schoof–Elkies–Atkin algorithm (SEA) is an algorithm used for finding the order of or calculating the number of points on an elliptic curve over a finite field. Its primary application is in elliptic curve cryptography. The algorithm is an extension of Schoof's algorithm by Noam Elkies and A. O. L. Atkin to signific... | Schoof–Elkies–Atkin algorithm | 0.8106 |
20,890 | Schoof–Elkies–Atkin algorithm is implemented in the PARI/GP computer algebra system in the GP function ellap. | Schoof–Elkies–Atkin algorithm | 0.8106 |
20,891 | . {\displaystyle G\times G\times G...} , such as anticipated in "topcolor" models of electroweak symmetry breaking. The little Higgs theories are also examples of phenomenologically interesting models inspired by deconstruction. Deconstruction is used in a supersymmetric context to address the hierarchy problem and mod... | Dimensional deconstruction | 0.810598 |
20,892 | Deconstruction is a lattice approximation to the real space of extra dimensions, while maintaining the full gauge symmetries and yields the low energy effective description of the physics. This leads to a rationale for extensions of the Standard Model based upon product gauge groups, G × G × G . . | Dimensional deconstruction | 0.810598 |
20,893 | In theoretical physics, dimensional deconstruction is a method to construct 4-dimensional theories that behave as higher-dimensional theories in a certain range of higher energies. The resulting theory is a gauge theory whose gauge group is a direct product of many copies of the same group; each copy may be interpreted... | Dimensional deconstruction | 0.810598 |
20,894 | In 2012, the IAU, as part of a new, self-consistent set of units and numerical standards for use in modern dynamical astronomy, redefined the astronomical unit as a conventional unit of length equal to 149597870700 m exactly, ... ... considering that the accuracy of modern range measurements makes the use of distance r... | Gaussian gravitational constant | 0.810597 |
20,895 | Gauss' constant is derived from the application of Kepler's third law to the system of Earth+Moon and the Sun considered as a two body problem, relating the period of revolution (P) to the major semi-axis of the orbit (a) and the total mass of the orbiting bodies (M). Its numerical value was obtained by setting the maj... | Gaussian gravitational constant | 0.810597 |
20,896 | {\displaystyle k={\frac {2\pi ab}{P{\sqrt {M+m}}{\sqrt {p}}}}.} Here, Gauss decides to use Earth to solve for k. From the geometry of an ellipse, p = b2/a. By setting Earth's semi-major axis, a = 1, p reduces to b2 and √p = b. Substituting, the area of the ellipse "is evidently" π√p, rather than πab. | Gaussian gravitational constant | 0.810597 |
20,897 | The Gaussian constant is closely related to Kepler's third law of planetary motion, and one is easily derived from the other. Beginning with the full definition of Gauss' constant, k = 2 π a b P M + m p , {\displaystyle k={\frac {2\pi ab}{P{\sqrt {M+m}}{\sqrt {p}}}},} where a is the semi-major axis of the elliptical or... | Gaussian gravitational constant | 0.810597 |
20,898 | Michael Faraday, in his concept of lines of force, emphasized that the field itself should be an object of study, which it has become throughout physics in the form of field theory. In addition to the magnetic field, other phenomena that were modeled by Faraday include the electrical field and light field. In recent de... | Vector Field | 0.810594 |
20,899 | The first widely used algorithm for solving this problem is an active-set method published by Lawson and Hanson in their 1974 book Solving Least Squares Problems. : 291 In pseudocode, this algorithm looks as follows: This algorithm takes a finite number of steps to reach a solution and smoothly improves its candidate s... | Non-negative least squares | 0.810592 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.