id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
5,300 | If electron collection currents are high and/or ambient electron densities are low, the sheath at which electron current collection is sustained simply expands or shrinks until the required current is collected. In addition, the geometry affects the emission of the plasma from the HC as seen in the below figure. Here i... | Electrodynamic tether | 0.826141 |
5,301 | This section discusses the plasma physics theory that explains passive current collection to a large conductive body which will be applied at the end of an ED tether. When the size of the sheath is much smaller than the radius of the collecting body then depending on the polarity of the difference between the potential... | Electrodynamic tether | 0.826141 |
5,302 | It can be seen in the below chart what a typical I-V curve looks like for a hollow cathode in electron emission mode. Given a certain keeper geometry (the ring in the figure above that the electrons exit through), ion flow rate, and Vp, the I-V profile can be determined. . | Electrodynamic tether | 0.826141 |
5,303 | However, once the width exceeds this distance, then the collection increasingly deviates from this theory. If the tether geometry is a flat tape, then an approximation can be used to convert the normalized tape width to an equivalent cylinder radius. This was first done by Sanmartin and Estes and more recently using th... | Electrodynamic tether | 0.826141 |
5,304 | The concept of current collection to a bare conducting tether was first formalized by Sanmartin and Martinez-Sanchez. They note that the most area efficient current collecting cylindrical surface is one that has an effective radius less than ~1 Debye Length where current collection physics is known as orbital motion li... | Electrodynamic tether | 0.826141 |
5,305 | Much has to be learned about the interactions between the sheath structure, the geometry of the mesh, the size of the endbody, and its relation to current collection. This technology also has the potential to resolve a number of issues concerning EDTs. Diminishing returns with collection current and drag area have set ... | Electrodynamic tether | 0.826141 |
5,306 | In order to integrate all the most recent electron emitters, collectors, and theory into a single model, the EDT system must first be defined and derived. Once this is accomplished it will be possible to apply this theory toward determining optimizations of system attributes. There are a number of derivations that solv... | Electrodynamic tether | 0.826141 |
5,307 | It took another fifteen to twenty years, using somatic cell genetics, to show that the interferon action gene and interferon gene reside in different human chromosomes. The purification of human beta interferon did not occur until 1977. Y.H. | Interferon | 0.826133 |
5,308 | The type II IFN (IFN-γ) gene was also isolated around this time.Interferon was first synthesized manually at Rockefeller University in the lab of Dr. Bruce Merrifield, using solid phase peptide synthesis, one amino acid at a time. He later won the Nobel Prize in chemistry. Interferon was scarce and expensive until 1980... | Interferon | 0.826133 |
5,309 | Irreducible root systems classify a number of related objects in Lie theory, notably the following: simple complex Lie algebras (see the discussion above on root systems arising from semisimple Lie algebras), simply connected complex Lie groups which are simple modulo centers, and simply connected compact Lie groups wh... | Positive roots | 0.826132 |
5,310 | Next, we need to show that for each irreducible root system, there can be at most one Lie algebra, that is, that the root system determines the Lie algebra up to isomorphism. Finally, we must show that for each irreducible root system, there is an associated simple Lie algebra. This claim is obvious for the root system... | Positive roots | 0.826132 |
5,311 | We thus restrict attention to irreducible root systems and simple Lie algebras. First, we must establish that for each simple algebra g {\displaystyle {\mathfrak {g}}} there is only one root system. This assertion follows from the result that the Cartan subalgebra of g {\displaystyle {\mathfrak {g}}} is unique up to au... | Positive roots | 0.826132 |
5,312 | Some variations of formal semantics include the following: Action semantics is an approach that tries to modularize denotational semantics, splitting the formalization process in two layers (macro and microsemantics) and predefining three semantic entities (actions, data and yielders) to simplify the specification; Alg... | Programming language semantics | 0.826125 |
5,313 | In mathematics, a Relevance Vector Machine (RVM) is a machine learning technique that uses Bayesian inference to obtain parsimonious solutions for regression and probabilistic classification. The RVM has an identical functional form to the support vector machine, but provides probabilistic classification. It is actuall... | Relevance vector machine | 0.826125 |
5,314 | In theoretical physics, a local reference frame (local frame) refers to a coordinate system or frame of reference that is only expected to function over a small region or a restricted region of space or spacetime. The term is most often used in the context of the application of local inertial frames to small regions of... | Lab frame | 0.826124 |
5,315 | How do these capacities underlie our ability to perform complex calculations? What are the neural bases of these abilities, both in humans and in non-humans? What metaphorical capacities and processes allow us to extend our numerical understanding into complex domains such as the concept of infinity, the infinitesimal ... | Numerical Cognition | 0.826122 |
5,316 | Numerical cognition is a subdiscipline of cognitive science that studies the cognitive, developmental and neural bases of numbers and mathematics. As with many cognitive science endeavors, this is a highly interdisciplinary topic, and includes researchers in cognitive psychology, developmental psychology, neuroscience ... | Numerical Cognition | 0.826122 |
5,317 | There are promising experiments with genetic algorithms and annealing optimizations. To automate costly engineering processes, some EDA can take state tables that describe state machines and automatically produce a truth table or a function table for the combinational logic of a state machine. The state table is a piec... | Digital electronics | 0.826113 |
5,318 | Molecular Ecology is a twice monthly scientific journal covering investigations that use molecular techniques to address questions in ecology, evolution, behavior, and conservation. It is published by Wiley-Blackwell. Its 2022 impact factor is 4.9. It was established in 1992 with Harry Smith as founding editor-in-chief... | Molecular Ecology | 0.826112 |
5,319 | There is a reward depending on the current state of the machine. In a generalization called the "restless bandit problem", the states of non-played arms can also evolve over time. There has also been discussion of systems where the number of choices (about which arm to play) increases over time.Computer science researc... | Bandit problem | 0.826111 |
5,320 | Given a derivative algebra V with derivative operator D, we can form an interior algebra I(V) with the same underlying Boolean algebra as V, with interior and closure operators defined by xI = x·x ′ D ′ and xC = x + xD, respectively. Thus every derivative algebra can be regarded as an interior algebra. Moreover, given ... | S4 algebra | 0.826101 |
5,321 | Given an interior algebra A, the closure operator obeys the axioms of the derivative operator, D. Hence we can form a derivative algebra D(A) with the same underlying Boolean algebra as A by using the closure operator as a derivative operator. Thus interior algebras are derivative algebras. From this perspective, they ... | S4 algebra | 0.826101 |
5,322 | This construction is a special case of a more general result for modal algebras and modal logic. The open elements of L(M) correspond to sentences that are only true if they are necessarily true, while the closed elements correspond to those that are only false if they are necessarily false. Because of their relation t... | S4 algebra | 0.826101 |
5,323 | Given a theory (set of formal sentences) M in the modal logic S4, we can form its Lindenbaum–Tarski algebra: L(M) = ⟨M / ~, ∧, ∨, ¬, F, T, □⟩where ~ is the equivalence relation on sentences in M given by p ~ q if and only if p and q are logically equivalent in M, and M / ~ is the set of equivalence classes under this r... | S4 algebra | 0.826101 |
5,324 | They are also the interior algebras corresponding to the modal logic S5, and so have also been called S5 algebras. In the relationship between preordered sets and interior algebras they correspond to the case where the preorder is an equivalence relation, reflecting the fact that such preordered sets provide the Kripke... | S4 algebra | 0.826101 |
5,325 | Any monadic Boolean algebra can be considered to be an interior algebra where the interior operator is the universal quantifier and the closure operator is the existential quantifier. The monadic Boolean algebras are then precisely the variety of interior algebras satisfying the identity xIC = xI. In other words, they ... | S4 algebra | 0.826101 |
5,326 | In abstract algebra, an interior algebra is a certain type of algebraic structure that encodes the idea of the topological interior of a set. Interior algebras are to topology and the modal logic S4 what Boolean algebras are to set theory and ordinary propositional logic. Interior algebras form a variety of modal algeb... | S4 algebra | 0.8261 |
5,327 | In this regard, interior algebras are particularly interesting because of their connection to topology. The construction provides the preordered set X with a topology, the Alexandrov topology, producing a topological space T(X) whose open sets are: {O ⊆ X | for all x ∈ O and all y ∈ X, x « y implies y ∈ O}.The correspo... | S4 algebra | 0.8261 |
5,328 | Given a preordered set X = ⟨X, «⟩ we can construct an interior algebra B(X) = ⟨P(X), ∩, ∪, ′, ø, X, I⟩from the power set Boolean algebra of X where the interior operator I is given by SI = {x ∈ X | for all y ∈ X, x « y implies y ∈ S} for all S ⊆ X.The corresponding closure operator is given by SC = {x ∈ X | there exist... | S4 algebra | 0.8261 |
5,329 | Since interior algebras are (normal) Boolean algebras with operators, they can be represented by fields of sets on appropriate relational structures. In particular, since they are modal algebras, they can be represented as fields of sets on a set with a single binary relation, called a modal frame. The modal frames cor... | S4 algebra | 0.8261 |
5,330 | The term "algebra" denotes both a subject, namely the subject of algebra, and an object, namely an algebraic structure. Whereas the foregoing has addressed the subject of Boolean algebra, this section deals with mathematical objects called Boolean algebras, defined in full generality as any model of the Boolean laws. W... | Boolean operator (Boolean algebra) | 0.826096 |
5,331 | To clarify, writing down further laws of Boolean algebra cannot give rise to any new consequences of these axioms, nor can it rule out any model of them. In contrast, in a list of some but not all of the same laws, there could have been Boolean laws that did not follow from those on the list, and moreover there would h... | Boolean operator (Boolean algebra) | 0.826096 |
5,332 | The laws listed above define Boolean algebra, in the sense that they entail the rest of the subject. The laws Complementation 1 and 2, together with the monotone laws, suffice for this purpose and can therefore be taken as one possible complete set of laws or axiomatization of Boolean algebra. Every law of Boolean alge... | Boolean operator (Boolean algebra) | 0.826096 |
5,333 | Every Boolean algebra is representable.That is, up to isomorphism, abstract and concrete Boolean algebras are the same thing. This quite nontrivial result depends on the Boolean prime ideal theorem, a choice principle slightly weaker than the axiom of choice, and is treated in more detail in the article Stone's represe... | Boolean operator (Boolean algebra) | 0.826096 |
5,334 | However, if we represent each divisor of n by the set of its prime factors, we find that this nonconcrete Boolean algebra is isomorphic to the concrete Boolean algebra consisting of all sets of prime factors of n, with union corresponding to least common multiple, intersection to greatest common divisor, and complement... | Boolean operator (Boolean algebra) | 0.826096 |
5,335 | Although every concrete Boolean algebra is a Boolean algebra, not every Boolean algebra need be concrete. Let n be a square-free positive integer, one not divisible by the square of an integer, for example 30 but not 12. The operations of greatest common divisor, least common multiple, and division into n (that is, ¬x ... | Boolean operator (Boolean algebra) | 0.826096 |
5,336 | Entailment differs from implication in that whereas the latter is a binary operation that returns a value in a Boolean algebra, the former is a binary relation which either holds or does not hold. In this sense entailment is an external form of implication, meaning external to the Boolean algebra, thinking of the reade... | Boolean operator (Boolean algebra) | 0.826096 |
5,337 | Propositional calculus is commonly organized as a Hilbert system, whose operations are just those of Boolean algebra and whose theorems are Boolean tautologies, those Boolean terms equal to the Boolean constant 1. Another form is sequent calculus, which has two sorts, propositions as in ordinary propositional calculus,... | Boolean operator (Boolean algebra) | 0.826096 |
5,338 | Further, a deeper understanding of the disease processes at the level of molecular biology may determine new therapeutic procedures. Given the established importance of DNA in molecular biology and its central role in determining the fundamental operation of cellular processes, it is likely that expanded knowledge in t... | Human Genome Project | 0.826087 |
5,339 | With the sequence in hand, the next step was to identify the genetic variants that increase the risk for common diseases like cancer and diabetes.It is anticipated that detailed knowledge of the human genome will provide new avenues for advances in medicine and biotechnology. Clear practical results of the project emer... | Human Genome Project | 0.826087 |
5,340 | Other organizations, such as the UCSC Genome Browser at the University of California, Santa Cruz, and Ensembl present additional data and annotation and powerful tools for visualizing and searching it. Computer programs have been developed to analyze the data because the data itself is difficult to interpret without su... | Human Genome Project | 0.826087 |
5,341 | The U.S. National Center for Biotechnology Information (and sister organizations in Europe and Japan) house the gene sequence in a database known as GenBank, along with sequences of known and hypothetical genes and proteins. | Human Genome Project | 0.826087 |
5,342 | The process of identifying the boundaries between genes and other features in a raw DNA sequence is called genome annotation and is in the domain of bioinformatics. While expert biologists make the best annotators, their work proceeds slowly, and computer programs are increasingly used to meet the high-throughput deman... | Human Genome Project | 0.826087 |
5,343 | The biotechnology sector lost about $50 billion in market capitalization in two days. Although the working draft was announced in June 2000, it was not until February 2001 that Celera and the HGP scientists published details of their drafts. Special issues of Nature (which published the publicly funded project's scient... | Human Genome Project | 0.826087 |
5,344 | On July 7, 2000, the UCSC Genome Bioinformatics Group released a first working draft on the web. The scientific community downloaded about 500 GB of information from the UCSC genome server in the first 24 hours of free and unrestricted access.In March 2000, President Clinton, along with Prime Minister Tony Blair in a d... | Human Genome Project | 0.826087 |
5,345 | President Bill Clinton and British Prime Minister Tony Blair on June 26, 2000). This first available rough draft assembly of the genome was completed by the Genome Bioinformatics Group at the University of California, Santa Cruz, primarily led by then-graduate student Jim Kent and his advisor David Haussler. Ongoing se... | Human Genome Project | 0.826087 |
5,346 | Magnetic tension is particularly important in plasma physics and MHD, where it controls dynamics of some systems and the shape of magnetic structures. For example, in a homogeneous magnetic field and an absence of gravity, magnetic tension is the sole driver of linear Alfvén waves. | Magnetic tension | 0.826087 |
5,347 | In physics, magnetic tension is a restoring force with units of force density that acts to straighten bent magnetic field lines. In SI units, the force density f T {\displaystyle \mathbf {f} _{T}} exerted perpendicular to a magnetic field B {\displaystyle \mathbf {B} } can be expressed as f T = ( B ⋅ ∇ ) B μ 0 {\displa... | Magnetic tension | 0.826087 |
5,348 | A general PDAE is defined as: 0 = F ( x , y , ∂ y i ∂ x j , ∂ 2 y i ∂ x j ∂ x k , … , z ) , {\displaystyle 0=\mathbf {F} \left(\mathbf {x} ,\mathbf {y} ,{\frac {\partial y_{i}}{\partial x_{j}}},{\frac {\partial ^{2}y_{i}}{\partial x_{j}\partial x_{k}}},\ldots ,\mathbf {z} \right),} where: F is a set of arbitrary functi... | Partial differential algebraic equation | 0.826081 |
5,349 | Semi-discretization is a common method for solving PDAEs whose independent variables are those of time and space, and has been used for decades. This method involves removing the spatial variables using a discretization method, such as the finite volume method, and incorporating the resulting linear equations as part o... | Partial differential algebraic equation | 0.826081 |
5,350 | In mathematics a partial differential algebraic equation (PDAE) set is an incomplete system of partial differential equations that is closed with a set of algebraic equations. | Partial differential algebraic equation | 0.826081 |
5,351 | That is that we have found that the potential felt by an atom in a light induced potential follows the square of the time averaged electric field. This is important to a lot of experimental physics in cold atom physics where physicists use this fact to understand what potential is applied to the atoms using the known i... | Electric dipole transition | 0.826079 |
5,352 | Simple inductive Turing machines and general Turing machines are related to limiting partial recursive functions and trial and error predicates as Turing machines are related to partial recursive functions and lambda-calculus. Note that only simple inductive Turing machines have the same structure (but different functi... | Solomonoff's theory of inductive inference | 0.826076 |
5,353 | The third mathematically based direction of inductive inference makes use of the theory of automata and computation. In this context, the process of inductive inference is performed by an abstract automaton called an inductive Turing machine (Burgin, 2005). Inductive Turing machines represent the next step in the devel... | Solomonoff's theory of inductive inference | 0.826076 |
5,354 | The theory is based in philosophical foundations, and was founded by Ray Solomonoff around 1960. It is a mathematically formalized combination of Occam's razor and the Principle of Multiple Explanations. All computable theories which perfectly describe previous observations are used to calculate the probability of the ... | Solomonoff's theory of inductive inference | 0.826076 |
5,355 | Solomonoff's theory of inductive inference is a mathematical theory of induction introduced by Ray Solomonoff, based on probability theory and theoretical computer science. In essence, Solomonoff's induction derives the posterior probability of any computable theory, given a sequence of observed data. This posterior pr... | Solomonoff's theory of inductive inference | 0.826076 |
5,356 | Unfortunately, Solomonoff also proved that Solomonoff's induction is uncomputable. In fact, he showed that computability and completeness are mutually exclusive: any complete theory must be uncomputable. The proof of this is derived from a game between the induction and the environment. Essentially, any computable indu... | Solomonoff's theory of inductive inference | 0.826076 |
5,357 | The remarkable property of Solomonoff's induction is its completeness. In essence, the completeness theorem guarantees that the expected cumulative errors made by the predictions based on Solomonoff's induction are upper-bounded by the Kolmogorov complexity of the (stochastic) data generating process. The errors can be... | Solomonoff's theory of inductive inference | 0.826076 |
5,358 | To be more precise, for every ϵ {\displaystyle \epsilon } > 0, there is some length l such that the probability of all programs longer than l is at most ϵ {\displaystyle \epsilon } . This does not, however, preclude very long programs from having very high probability. Fundamental ingredients of the theory are the conc... | Solomonoff's theory of inductive inference | 0.826076 |
5,359 | Prefetching in computer science is a technique for speeding up fetch operations by beginning a fetch operation whose result is expected to be needed soon. Usually this is before it is known to be needed, so there is a risk of wasting time by prefetching data that will not be used. The technique can be applied in severa... | Prefetching | 0.826071 |
5,360 | Irreducibility only plays a role when G {\displaystyle G} has a factor of real rank one (otherwise the theorem always holds) and is not simple: it means that for any product decomposition G = G 1 × G 2 {\displaystyle G=G_{1}\times G_{2}} the lattice is not commensurable to a product of lattices in each of the factors G... | S-arithmetic group | 0.826065 |
5,361 | The spectacular result that Margulis obtained is a partial converse to the Borel—Harish-Chandra theorem: for certain Lie groups any lattice is arithmetic. This result is true for all irreducible lattice in semisimple Lie groups of real rank larger than two. For example, all lattices in S L n ( R ) {\displaystyle \mathr... | S-arithmetic group | 0.826065 |
5,362 | For every semisimple Lie group G {\displaystyle G} it is in theory possible to classify (up to commensurability) all arithmetic lattices in G {\displaystyle G} , in a manner similar to the cases G = S L 2 ( R ) , S L 2 ( C ) {\displaystyle G=\mathrm {SL} _{2}(\mathbb {R} ),\mathrm {SL} _{2}(\mathbb {C} )} explained abo... | S-arithmetic group | 0.826065 |
5,363 | Another classical example is given by the integral elements in the orthogonal group of a quadratic form defined over a number field, for example S O ( n , 1 ) ( Z ) {\displaystyle \mathrm {SO} (n,1)(\mathbb {Z} )} . A related construction is by taking the unit groups of orders in quaternion algebras over number fields ... | S-arithmetic group | 0.826065 |
5,364 | A natural generalisation of the construction above is as follows: let F {\displaystyle F} be a number field with ring of integers O {\displaystyle O} and G {\displaystyle \mathrm {G} } an algebraic group over F {\displaystyle F} . If we are given an embedding ρ: G → G L n {\displaystyle \rho :\mathrm {G} \to \mathrm {G... | S-arithmetic group | 0.826065 |
5,365 | A lattice in a Lie group is usually defined as a discrete subgroup with finite covolume. The terminology introduced above is coherent with this, as a theorem due to Borel and Harish-Chandra states that an arithmetic subgroup in a semisimple Lie group is of finite covolume (the discreteness is obvious). The theorem is m... | S-arithmetic group | 0.826065 |
5,366 | The Borel–Harish-Chandra theorem generalizes to S {\displaystyle S} -arithmetic groups as follows: if Γ {\displaystyle \Gamma } is an S {\displaystyle S} -arithmetic group in a Q {\displaystyle \mathbb {Q} } -algebraic group G {\displaystyle \mathrm {G} } then Γ {\displaystyle \Gamma } is a lattice in the locally compa... | S-arithmetic group | 0.826065 |
5,367 | The state of the art after this period was essentially fixed in Raghunathan's treatise, published in 1972.In the seventies Margulis revolutionised the topic by proving that in "most" cases the arithmetic constructions account for all lattices in a given Lie group. Some limited results in this direction had been obtaine... | S-arithmetic group | 0.826065 |
5,368 | For the modern theory to begin foundational work was needed, and was provided by the work of Armand Borel, André Weil, Jacques Tits and others on algebraic groups. Shortly afterwards the finiteness of covolume was proven in full generality by Borel and Harish-Chandra. Meanwhile, there was progress on the general theory... | S-arithmetic group | 0.826065 |
5,369 | The same groups also appeared in analytic number theory as the study of classical modular forms and their generalisations developed. Of course the two topics were related, as can be seen for example in Langlands' computation of the volume of certain fundamental domains using analytic methods. This classical theory culm... | S-arithmetic group | 0.826065 |
5,370 | One of the origins of the mathematical theory of arithmetic groups is algebraic number theory. The classical reduction theory of quadratic and Hermitian forms by Charles Hermite, Hermann Minkowski and others can be seen as computing fundamental domains for the action of certain arithmetic groups on the relevant symmetr... | S-arithmetic group | 0.826065 |
5,371 | An important resource for finding biological databases is a special yearly issue of the journal Nucleic Acids Research (NAR). The Database Issue of NAR is freely available, and categorizes many of the public biological databases. A companion database to the issue called the Online Molecular Biology Database Collection ... | Bioinformatics databanks | 0.826062 |
5,372 | Relational database concepts of computer science and Information retrieval concepts of digital libraries are important for understanding biological databases. Biological database design, development, and long-term management is a core area of the discipline of bioinformatics. Data contents include gene sequences, textu... | Bioinformatics databanks | 0.826062 |
5,373 | Yield point – In materials science and engineering, the yield point is the point on a stress-strain curve that indicates the limit of elastic behavior and the beginning of plastic behavior. Below the yield point, a material will deform elastically and will return to its original shape when the applied stress is removed... | Glossary of mechanical engineering | 0.826061 |
5,374 | Verification and Validation – Valve – a device or natural object (such as a heart valve) that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways Vector – a geometric object that has magnitude (or length) an... | Glossary of mechanical engineering | 0.826061 |
5,375 | Modern rear wheel drive cars with independent rear suspension typically use CV joints at the ends of the rear axle halfshafts and increasingly use them on the drive shafts. Constraint – Continuum mechanics – is a branch of mechanics that deals with the mechanical behavior of materials modeled as a continuous mass rathe... | Glossary of mechanical engineering | 0.826061 |
5,376 | A "complete" computer including the hardware, the operating system (main software), and peripheral equipment required and used for "full" operation can be referred to as a computer system. This term may as well be used for a group of computers that are connected and work together, in particular a computer network or co... | Glossary of mechanical engineering | 0.826061 |
5,377 | These properties have made carbon fiber very popular in aerospace, civil engineering, military, and motorsports, along with other competition sports. However, they are relatively expensive when compared with similar fibers, such as glass fibers or plastic fibers. Classical mechanics – describes the motion of macroscopi... | Glossary of mechanical engineering | 0.826061 |
5,378 | Calculus – is the mathematical study of continuous change. Car handling – Automobile handling and vehicle handling are descriptions of the way a wheeled vehicle responds and reacts to the inputs of a driver, as well as how it moves along a track or road. It is commonly judged by how a vehicle performs particularly duri... | Glossary of mechanical engineering | 0.826061 |
5,379 | Automobile handling – Automobile handling and vehicle handling are descriptions of the way a wheeled vehicle responds and reacts to the inputs of a driver, as well as how it moves along a track or road. It is commonly judged by how a vehicle performs particularly during cornering, acceleration, and braking as well as o... | Glossary of mechanical engineering | 0.826061 |
5,380 | The screw pump is commonly attributed to Archimedes, Artificial intelligence – (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence displayed by humans and other animals. In computer science AI research is defined as the study of "intelligent age... | Glossary of mechanical engineering | 0.826061 |
5,381 | Applied mechanics – describes the behavior of a body, in either a beginning state of rest or of motion, subjected to the action of forces. Applied mechanics, bridges the gap between physical theory and its application to technology. It is used in many fields of engineering, especially mechanical engineering and civil e... | Glossary of mechanical engineering | 0.826061 |
5,382 | Gradient values with respect to a particular quantity of interest can be efficiently calculated by solving the adjoint equation. Methods based on solution of adjoint equations are used in wing shape optimization, fluid flow control and uncertainty quantification. For example d X t = a ( X t ) d t + b ( X t ) d W {\disp... | Glossary of mechanical engineering | 0.826061 |
5,383 | Alternatively, ISO defines accuracy as describing a combination of both random and systematic observational error, so high accuracy requires both high precision and high trueness. Ackermann steering geometry – is a geometric arrangement of linkages in the steering of a car or other vehicle designed to solve the problem... | Glossary of mechanical engineering | 0.826061 |
5,384 | Acceleration – In physics, acceleration is the rate of change of velocity of an object with respect to time. An object's acceleration is the net result of any and all forces acting on the object, as described by Newton's Second Law. The SI unit for acceleration is metre per second squared (m s−2). | Glossary of mechanical engineering | 0.826061 |
5,385 | Tensile strength – also called ultimate tensile strength or ultimate strength, is the maximum stress that a material can withstand while being stretched or pulled before breaking. In brittle materials the ultimate tensile strength is close to the yield point, whereas in ductile materials the ultimate tensile strength c... | Glossary of mechanical engineering | 0.826061 |
5,386 | Rack and pinion – Rack railway – Railcar – Rail gauge – Railroad car – Railroad switch – Rail tracks – Random vibration – Reaction kinetics – Rear wheel drive – Refrigeration – Reliability engineering – Relief valve – RepRap Project – Resistive force – Resistor – Reverse engineering – Rheology – Rigid body – Robotics –... | Glossary of mechanical engineering | 0.826061 |
5,387 | Pascal (unit) – the SI unit of pressure, which uses the symbol Pa and is defined as one newton per square metre. It is also used to quantify internal pressure, stress, Young's modulus, and ultimate tensile strength. Physics – Pinion – Piston – Pitch drop experiment – Plain bearing – Plasma processing – Plasticity – Pne... | Glossary of mechanical engineering | 0.826061 |
5,388 | Nanotechnology – Newton (unit) – the SI unit of force, which uses the symbol N. It is defined as 1 kg⋅m/s2, the force which gives a mass of 1 kilogram an acceleration of 1 metre per second per second. It is named after Isaac Newton in recognition of his work on classical mechanics, specifically Newton's second law of m... | Glossary of mechanical engineering | 0.826061 |
5,389 | An electric generator is mechanically identical to an electric motor, but operates in the reverse direction, converting mechanical energy into electrical energy. Electrical engineering – Electrical engineering is an engineering discipline concerned with the study, design and application of equipment, devices and system... | Glossary of mechanical engineering | 0.826061 |
5,390 | Elasticity – In physics, elasticity is the ability of a body to resist a distorting influence and to return to its original size and shape when that influence or force is removed. Solid objects will deform when adequate forces are applied to them. If the material is elastic, the object will return to its initial shape ... | Glossary of mechanical engineering | 0.826061 |
5,391 | Differential –A differential is a gear train with three shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others, or a fixed multiple of that average. Dimensionless number – is a quantity to which no physical dimension is assigned. Dimensionless quantities are widel... | Glossary of mechanical engineering | 0.826061 |
5,392 | Biomechatronics – is an applied interdisciplinary science that aims to integrate biology, mechanics, and electronics. It also encompasses the fields of robotics and neuroscience. Biomechatronic devices encompass a wide range of applications from the development of prosthetic limbs to engineering solutions concerning re... | Glossary of mechanical engineering | 0.826061 |
5,393 | Most of the terms listed in Wikipedia glossaries are already defined and explained within Wikipedia itself. However, glossaries like this one are useful for looking up, comparing and reviewing large numbers of terms together. You can help enhance this page by adding new terms or writing definitions for existing ones. T... | Glossary of mechanical engineering | 0.826061 |
5,394 | Machine – Machine learning – Machinery's Handbook – is a classic, one-volume reference work in mechanical engineering and practical workshop mechanics published by Industrial Press, New York, since 1914; its 31st edition was published in 2020. Recent editions of the handbook contain chapters on mathematics, mechanics, ... | Glossary of mechanical engineering | 0.826061 |
5,395 | Until the late 1960s, soil chemistry focused primarily on chemical reactions in the soil that contribute to pedogenesis or that affect plant growth. Since then, concerns have grown about environmental pollution, organic and inorganic soil contamination and potential ecological health and environmental health risks. Con... | Soil chemistry | 0.826056 |
5,396 | Animals are essential to soil chemistry, as they regulate the cycling of nutrients and energy into different forms. This is primarily done through food webs. Some types of soil animals can be found below. | Soil chemistry | 0.826056 |
5,397 | Types of living soil biota can be divided into categories of plants (flora), animals (fauna), and microorganisms. Plants play a role in soil chemistry by exchanging nutrients with microorganisms and absorbing nutrients, creating concentration gradients of cations and anions. In addition to this, the differences in wate... | Soil chemistry | 0.826056 |
5,398 | The interactions of the soil's micropores and macropores are important to soil chemistry, as they allow for the provision of water and gaseous elements to the soil and the surrounding atmosphere. Macropores help transport molecules and substances in and out of the micropores. Micropores are comprised within the aggrega... | Soil chemistry | 0.826056 |
5,399 | Soil texture influences the soil chemistry pertaining to the soil's ability to maintain its structure, the restriction of water flow and the contents of the particles in the soil. Soil texture considers all particle types and a soil texture triangle is a chart that can be used to calculate the percentages of each parti... | Soil chemistry | 0.826056 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.