id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
13,900 | It is a poor oxidising agent (Si + 4e → Si4 = –0.147 at pH 0). As a metalloid the chemistry of silicon is largely covalent in nature, noting it can form alloys with metals such as iron and copper. The common oxide of silicon (SiO2) is weakly acidic. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,901 | It has a high ionisation energy (1086.5 kJ/mol), moderate electron affinity (122 kJ/mol), and high electronegativity (2.55). Carbon is a poor oxidising agent (C + 4e− → CH4 = 0.13 V at pH 0). Its chemistry is largely covalent in nature, noting it can form salt-like carbides with highly electropositive metals. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,902 | It is a semiconductor with a band gap of about 1.56 eV. Boron has a moderate ionisation energy (800.6 kJ/mol), low electron affinity (27 kJ/mol), and moderate electronegativity (2.04). Being a metalloid, most of its chemistry is nonmetallic in nature. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,903 | It is a poor oxidising agent (Te + 2e− → H2Te = −0.45 V at pH 0). The chemistry of tellurium is largely covalent in nature, noting it has an extensive organometallic chemistry and that many tellurides can be regarded as metallic alloys. The common oxide of tellurium (TeO2) is amphoteric. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,904 | The chemistry of selenium is largely covalent in nature, noting it can form ionic selenides with highly electropositive metals. The common oxide of selenium (SeO3) is strongly acidic. Tellurium is a silvery-white, moderately reactive, shiny solid, that has a density of 6.24 g/cm3 and is soft (MH 2.25) and brittle. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,905 | The chemistry of sulfur is largely covalent in nature, noting it can form ionic sulfides with highly electropositive metals. The common oxide of sulfur (SO3) is strongly acidic. Selenium is a metallic-looking, moderately reactive solid with a density of 4.81 g/cm3 and is soft (MH 2.0) and brittle. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,906 | As a metalloid, its chemistry is largely covalent in nature, noting it can form alloys with one or more metals such as aluminium, iron, nickel, copper, zinc, tin, lead and bismuth, and has an extensive organometallic chemistry. Most alloys of antimony with metals have metallic or semimetallic conductivity. The common o... | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,907 | Arsenic is a poor oxidising agent (As + 3e → AsH3 = –0.22 at pH 0). As a metalloid, its chemistry is largely covalent in nature, noting it can form brittle alloys with metals, and has an extensive organometallic chemistry. Most alloys of arsenic with metals lack metallic or semimetallic conductivity. | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,908 | Phosphorus is a poor oxidising agent (P4 + 3e− → PH3– = −0.046 V at pH 0 for the white form, −0.088 V for the red). Its chemistry is largely covalent in nature, noting it can form salt-like phosphides with highly electropositive metals. Compared to nitrogen, electrons have more space on phosphorus, which lowers their m... | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,909 | Only when it is in a positive oxidation state, that is, in combination with oxygen or fluorine, are its compounds good oxidising agents, for example, 2NO3− → N2 = 1.25 V. Its chemistry is largely covalent in nature; anion formation is energetically unfavourable owing to strong inter electron repulsions associated with ... | Properties of nonmetals (and metalloids) by group | 0.815694 |
13,910 | In fluid dynamics, the Euler equations are a set of quasilinear partial differential equations governing adiabatic and inviscid flow. They are named after Leonhard Euler. In particular, they correspond to the Navier–Stokes equations with zero viscosity and zero thermal conductivity.The Euler equations can be applied to... | Euler Equations (fluid dynamics) | 0.815692 |
13,911 | For certain problems, especially when used to analyze compressible flow in a duct or in case the flow is cylindrically or spherically symmetric, the one-dimensional Euler equations are a useful first approximation. Generally, the Euler equations are solved by Riemann's method of characteristics. This involves finding c... | Euler Equations (fluid dynamics) | 0.815692 |
13,912 | The Euler equations first appeared in published form in Euler's article "Principes généraux du mouvement des fluides", published in Mémoires de l'Académie des Sciences de Berlin in 1757 (although Euler had previously presented his work to the Berlin Academy in 1752). The Euler equations were among the first partial dif... | Euler Equations (fluid dynamics) | 0.815692 |
13,913 | Physically this represents a breakdown of the assumptions that led to the formulation of the differential equations, and to extract further information from the equations we must go back to the more fundamental integral form. Then, weak solutions are formulated by working in 'jumps' (discontinuities) into the flow quan... | Euler Equations (fluid dynamics) | 0.815692 |
13,914 | On the other hand, by integrating a generic conservation equation: ∂ y ∂ t + ∇ ⋅ F = s {\displaystyle {\frac {\partial \mathbf {y} }{\partial t}}+\nabla \cdot \mathbf {F} =\mathbf {s} } on a fixed volume Vm, and then basing on the divergence theorem, it becomes: d d t ∫ V m y d V + ∮ ∂ V m F ⋅ n ^ d s = S . {\displayst... | Euler Equations (fluid dynamics) | 0.815692 |
13,915 | Although this relationship between the pressure field and flow curvature is very useful, it doesn't have a name in the English-language scientific literature. Japanese fluid-dynamicists call the relationship the "Streamline curvature theorem".This "theorem" explains clearly why there are such low pressures in the centr... | Euler Equations (fluid dynamics) | 0.815692 |
13,916 | Bernoulli's theorem is a direct consequence of the Euler equations. | Euler Equations (fluid dynamics) | 0.815692 |
13,917 | In 1D the volume reduces to an interval, its boundary being its extrema, then the divergence theorem reduces to the fundamental theorem of calculus: ∫ x m x m + 1 F ( x ′ ) d x ′ = 0 , {\displaystyle \int _{x_{m}}^{x_{m+1}}\mathbf {F} (x')\,dx'=\mathbf {0} ,} that is the simple finite difference equation, known as the ... | Euler Equations (fluid dynamics) | 0.815692 |
13,918 | Then, basing on the divergence theorem, we can transform this integral in a boundary integral of the flux: ∮ ∂ V m F d s = 0 . {\displaystyle \oint _{\partial V_{m}}\mathbf {F} \,ds=\mathbf {0} .} This global form simply states that there is no net flux of a conserved quantity passing through a region in the case stead... | Euler Equations (fluid dynamics) | 0.815692 |
13,919 | simulating the Ising model: Swendsen–Wang algorithm — entire sample is divided into equal-spin clusters Wolff algorithm — improvement of the Swendsen–Wang algorithm Metropolis–Hastings algorithm Auxiliary field Monte Carlo — computes averages of operators in many-body quantum mechanical problems Cross-entropy method — ... | List of numerical analysis topics | 0.815691 |
13,920 | Variants of the Monte Carlo method: Direct simulation Monte Carlo Quasi-Monte Carlo method Markov chain Monte Carlo Metropolis–Hastings algorithm Multiple-try Metropolis — modification which allows larger step sizes Wang and Landau algorithm — extension of Metropolis Monte Carlo Equation of State Calculations by Fast C... | List of numerical analysis topics | 0.815691 |
13,921 | the Cholesky factorization Incomplete LU factorization — sparse approximation to the LU factorization Uzawa iteration — for saddle node problems Underdetermined and overdetermined systems (systems that have no or more than one solution): Numerical computation of null space — find all solutions of an underdetermined sys... | List of numerical analysis topics | 0.815691 |
13,922 | Gaussian elimination Row echelon form — matrix in which all entries below a nonzero entry are zero Bareiss algorithm — variant which ensures that all entries remain integers if the initial matrix has integer entries Tridiagonal matrix algorithm — simplified form of Gaussian elimination for tridiagonal matrices LU decom... | List of numerical analysis topics | 0.815691 |
13,923 | Finite difference method — based on approximating differential operators with difference operators Finite difference — the discrete analogue of a differential operator Finite difference coefficient — table of coefficients of finite-difference approximations to derivatives Discrete Laplace operator — finite-difference a... | List of numerical analysis topics | 0.815691 |
13,924 | Active set Candidate solution Constraint (mathematics) Constrained optimization — studies optimization problems with constraints Binary constraint — a constraint that involves exactly two variables Corner solution Feasible region — contains all solutions that satisfy the constraints but may not be optimal Global optimu... | List of numerical analysis topics | 0.815691 |
13,925 | See #Numerical linear algebra for linear equationsRoot-finding algorithm — algorithms for solving the equation f(x) = 0 General methods: Bisection method — simple and robust; linear convergence Lehmer–Schur algorithm — variant for complex functions Fixed-point iteration Newton's method — based on linear approximation a... | List of numerical analysis topics | 0.815691 |
13,926 | Numerical partial differential equations — the numerical solution of partial differential equations (PDEs) | List of numerical analysis topics | 0.815691 |
13,927 | Numerical linear algebra — study of numerical algorithms for linear algebra problems | List of numerical analysis topics | 0.815691 |
13,928 | Validated numerics Iterative method Rate of convergence — the speed at which a convergent sequence approaches its limit Order of accuracy — rate at which numerical solution of differential equation converges to exact solution Series acceleration — methods to accelerate the speed of convergence of a series Aitken's delt... | List of numerical analysis topics | 0.815691 |
13,929 | In geometry: Geometric median — the point minimizing the sum of distances to a given set of points Chebyshev center — the centre of the smallest ball containing a given set of points In statistics: Iterated conditional modes — maximizing joint probability of Markov random field Response surface methodology — used in th... | List of numerical analysis topics | 0.815691 |
13,930 | Grid classification / Types of mesh: Polygon mesh — consists of polygons in 2D or 3D Triangle mesh — consists of triangles in 2D or 3D Triangulation (geometry) — subdivision of given region in triangles, or higher-dimensional analogue Nonobtuse mesh — mesh in which all angles are less than or equal to 90° Point-set tri... | List of numerical analysis topics | 0.815691 |
13,931 | analysis — integrates finite elements into conventional NURBS-based CAD design tools Loubignac iteration Stiffness matrix — finite-dimensional analogue of differential operator Combination with meshfree methods: Weakened weak form — form of a PDE that is weaker than the standard weak form G space — functional space use... | List of numerical analysis topics | 0.815691 |
13,932 | Finite element method — based on a discretization of the space of solutions gradient discretisation method — based on both the discretization of the solution and of its gradient Finite element method in structural mechanics — a physical approach to finite element methods Galerkin method — a finite element method in whi... | List of numerical analysis topics | 0.815691 |
13,933 | Convex optimization Quadratic programming Linear least squares (mathematics) Total least squares Frank–Wolfe algorithm Sequential minimal optimization — breaks up large QP problems into a series of smallest possible QP problems Bilinear program Basis pursuit — minimize L1-norm of vector subject to linear constraints Ba... | List of numerical analysis topics | 0.815691 |
13,934 | Convex analysis — function f such that f(tx + (1 − t)y) ≥ tf(x) + (1 − t)f(y) for t ∈ Pseudoconvex function — function f such that ∇f · (y − x) ≥ 0 implies f(y) ≥ f(x) Quasiconvex function — function f such that f(tx + (1 − t)y) ≤ max(f(x), f(y)) for t ∈ Subderivative Geodesic convexity — convexity for functions defi... | List of numerical analysis topics | 0.815691 |
13,935 | Computational physics Computational electromagnetics Computational fluid dynamics (CFD) Numerical methods in fluid mechanics Large eddy simulation Smoothed-particle hydrodynamics Aeroacoustic analogy — used in numerical aeroacoustics to reduce sound sources to simple emitter types Stochastic Eulerian Lagrangian method ... | List of numerical analysis topics | 0.815691 |
13,936 | Combinatorial optimization Dynamic programming Bellman equation Hamilton–Jacobi–Bellman equation — continuous-time analogue of Bellman equation Backward induction — solving dynamic programming problems by reasoning backwards in time Optimal stopping — choosing the optimal time to take a particular action Odds algorithm... | List of numerical analysis topics | 0.815691 |
13,937 | Approaches to deal with uncertainty: Markov decision process Partially observable Markov decision process Robust optimization Wald's maximin model Scenario optimization — constraints are uncertain Stochastic approximation Stochastic optimization Stochastic programming Stochastic gradient descent Random optimization alg... | List of numerical analysis topics | 0.815691 |
13,938 | Spline interpolation — interpolation by piecewise polynomials Spline (mathematics) — the piecewise polynomials used as interpolants Perfect spline — polynomial spline of degree m whose mth derivate is ±1 Cubic Hermite spline Centripetal Catmull–Rom spline — special case of cubic Hermite splines without self-intersectio... | List of numerical analysis topics | 0.815691 |
13,939 | Optimal control Pontryagin's minimum principle — infinite-dimensional version of Lagrange multipliers Costate equations — equation for the "Lagrange multipliers" in Pontryagin's minimum principle Hamiltonian (control theory) — minimum principle says that this function should be minimized Types of problems: Linear-quadr... | List of numerical analysis topics | 0.815691 |
13,940 | Numerical integration — the numerical evaluation of an integral Rectangle method — first-order method, based on (piecewise) constant approximation Trapezoidal rule — second-order method, based on (piecewise) linear approximation Simpson's rule — fourth-order method, based on (piecewise) quadratic approximation Adaptive... | List of numerical analysis topics | 0.815691 |
13,941 | Mathematical optimization — algorithm for finding maxima or minima of a given function | List of numerical analysis topics | 0.815691 |
13,942 | Lax equivalence theorem — a consistent method is convergent if and only if it is stable Courant–Friedrichs–Lewy condition — stability condition for hyperbolic PDEs Von Neumann stability analysis — all Fourier components of the error should be stable Numerical diffusion — diffusion introduced by the numerical method, ab... | List of numerical analysis topics | 0.815691 |
13,943 | The reciprocating motion of a non-offset piston connected to a rotating crank through a connecting rod (as would be found in internal combustion engines) can be expressed by equations of motion. This article shows how these equations of motion can be derived using calculus as functions of angle (angle domain) and of ti... | Piston motion equations | 0.81569 |
13,944 | From the geometry shown in the diagram above, the following variables are defined: l {\displaystyle l} rod length (distance between piston pin and crank pin) r {\displaystyle r} crank radius (distance between crank center and crank pin, i.e. half stroke) A {\displaystyle A} crank angle (from cylinder bore centerline at... | Piston motion equations | 0.81569 |
13,945 | The angle domain equations of the piston's reciprocating motion are derived from the system's geometry equations as follows. | Piston motion equations | 0.81569 |
13,946 | The geometry of the system consisting of the piston, rod and crank is represented as shown in the following diagram: | Piston motion equations | 0.81569 |
13,947 | Note that for the automotive/hotrod use-case the most convenient (used by enthusiasts) unit of length for the piston-rod-crank geometry is the inch, with typical dimensions being 6" (inch) rod length and 2" (inch) crank radius. This article uses units of inch (") for position, velocity and acceleration, as shown in the... | Piston motion equations | 0.81569 |
13,948 | Mathematical Methods in the Physical Sciences is a 1966 textbook by mathematician Mary L. Boas intended to develop skills in mathematical problem solving needed for junior to senior-graduate courses in engineering, physics, and chemistry. The book provides a comprehensive survey of analytic techniques and provides care... | Mathematical Methods in the Physical Sciences | 0.815687 |
13,949 | Infinite series, power series Complex numbers Linear algebra Partial differentiation Multiple integrals Vector analysis Fourier series and transforms Ordinary differential equations Calculus of variations Tensor analysis Special functions Series solution of differential equations; Legendre, Bessel, Hermite, and Laguerr... | Mathematical Methods in the Physical Sciences | 0.815687 |
13,950 | In molecular biology and pharmacology, a small molecule or micromolecule is a low molecular weight (≤ 1000 daltons) organic compound that may regulate a biological process, with a size on the order of 1 nm. Many drugs are small molecules; the terms are equivalent in the literature. Larger structures such as nucleic aci... | Small molecules | 0.815684 |
13,951 | If the condition of equal length in Sylvester's theorem is dropped and one considers merely three arbitrary pairwise distinct vectors, then the equation above does not hold anymore. However the relation with the centroid remains true, that is: 3 ⋅ O S → = u → + v → + w → {\displaystyle 3\cdot {\overrightarrow {OS}}={\v... | Sylvester's triangle problem | 0.815677 |
13,952 | Sylvester's theorem or Sylvester's formula describes a particular interpretation of the sum of three pairwise distinct vectors of equal length in the context of triangle geometry. It is also referred to as Sylvester's (triangle) problem in literature, when it is given as a problem rather than a theorem. The theorem is ... | Sylvester's triangle problem | 0.815677 |
13,953 | In the theory of elliptic curves, Tate's algorithm takes as input an integral model of an elliptic curve E over Q {\displaystyle \mathbb {Q} } , or more generally an algebraic number field, and a prime or prime ideal p. It returns the exponent fp of p in the conductor of E, the type of reduction at p, the local index c... | Tate's algorithm | 0.815676 |
13,954 | The algorithm is implemented for algebraic number fields in the PARI/GP computer algebra system, available through the function elllocalred. | Tate's algorithm | 0.815676 |
13,955 | In many cases, a well-understood experimental system can be "black-boxed" as a standard technique, which can then be a component of other experimental systems. Rheinberger divides experimental systems into two parts: the part under investigation ("epistemic things") and the well-understood part that provides a stable c... | Experimental system | 0.815674 |
13,956 | In scientific research, an experimental system is the physical, technical and procedural basis for an experiment or series of experiments. Historian of science Hans-Jörg Rheinberger defines an experimental system as: "A basic unit of experimental activity combining local, technical, instrumental, institutional, social,... | Experimental system | 0.815674 |
13,957 | The first Congress of Biochemistry was held in 1949 in Cambridge, UK, and was inspired by German-born British biochemist Sir Hans Adolf Krebs as a means of bringing together biochemists who had been separated by World War II from collaborating. At the time, biochemistry was blossoming as a discipline and was seeking it... | International Union of Biochemistry and Molecular Biology | 0.815667 |
13,958 | IUBMB organizes a triennial Congress of Biochemistry and Molecular Biology and sponsors three annual Focussed Meetings. In addition, it supports symposia, educational activities (including the Tang Fellowships), award lectures (including Jubilee Lectures), and travel grants for students around the world. | International Union of Biochemistry and Molecular Biology | 0.815667 |
13,959 | The International Union of Biochemistry and Molecular Biology (IUBMB) is an international non-governmental organisation concerned with biochemistry and molecular biology. Formed in 1955 as the International Union of Biochemistry (IUB), the union has presently 79 member countries and regions (as of 2020). The Union is d... | International Union of Biochemistry and Molecular Biology | 0.815667 |
13,960 | The IUBMB unites biochemists and molecular biologists in 75 countries that belong to the IUBMB as an Adhering Body or Associate Adhering Body represented by a biochemical society, a national research council or an academy of sciences. It also represents the regional organizations, Federation of Asian Oceanian Biochemis... | International Union of Biochemistry and Molecular Biology | 0.815667 |
13,961 | The IUBMB publishes standards on biochemical nomenclature, including Enzyme Commission number nomenclature, in some cases jointly with the International Union of Pure and Applied Chemistry (IUPAC). The enzyme nomenclature scheme was developed in 1955 at the International Congress of Biochemistry and, with the addition ... | International Union of Biochemistry and Molecular Biology | 0.815667 |
13,962 | The IUBMB is committed to providing training opportunities to biochemists and molecular biologists around the world. The Wood Whelan Research fellowship, established in honor of past-Presidents Harland G. Wood and William Joseph Whelan, provides opportunities for students to travel to a laboratory in a different countr... | International Union of Biochemistry and Molecular Biology | 0.815667 |
13,963 | INSPIRE-HEP is an open access digital library for the field of high energy physics (HEP). It is the successor of the Stanford Physics Information Retrieval System (SPIRES) database, the main literature database for high energy physics since the 1970s. | INSPIRE-HEP | 0.815667 |
13,964 | INSPIRE-HEP combines the SPIRES-HEP database content with the open source digital library software Invenio and the content of the CERN Document server. In addition to scientific papers, INSPIRE-HEP provides other information such-as citation metrics, plots extracted from papers or internal experiment notes and tools fo... | INSPIRE-HEP | 0.815667 |
13,965 | It interacts with other HEP service providers like arXiv.org, Particle Data Group, NASA's Astrophysics Data System. and HEPdata. In April 2010, a beta version of INSPIRE-HEP was freely accessible, in April 2012, it fully replaced SPIRES. A new and upgraded INSPIRE platform was officially released in March 2020. | INSPIRE-HEP | 0.815667 |
13,966 | SPIRES was (in addition to the CERN Document Server (CDS), arXiv and parts of Astrophysics Data System) one of the main Particle Information Resources. A survey conducted in 2007 found that SPIRES database users wanted the portal to provide more services than the, at that time, already 30-year-old system could provide.... | INSPIRE-HEP | 0.815667 |
13,967 | In the mathematical field of representation theory, group representations describe abstract groups in terms of bijective linear transformations of a vector space to itself (i.e. vector space automorphisms); in particular, they can be used to represent group elements as invertible matrices so that the group operation ca... | Group representations | 0.815664 |
13,968 | ML's strengths are mostly applied in language design and manipulation (compilers, analyzers, theorem provers), but it is a general-purpose language also used in bioinformatics and financial systems. ML was developed by Robin Milner and others in the early 1970s at the University of Edinburgh, and its syntax is inspired... | ML programming language | 0.81566 |
13,969 | Features of ML include a call-by-value evaluation strategy, first-class functions, automatic memory management through garbage collection, parametric polymorphism, static typing, type inference, algebraic data types, pattern matching, and exception handling. ML uses static scoping rules.ML can be referred to as an impu... | ML programming language | 0.81566 |
13,970 | ML (Meta Language) is a functional programming language. It is known for its use of the polymorphic Hindley–Milner type system, which automatically assigns the types of most expressions without requiring explicit type annotations (type inference), and ensures type safety – there is a formal proof that a well-typed ML p... | ML programming language | 0.81566 |
13,971 | Several researchers have studied the complexity of exponential time algorithms restricted to cubic graphs. For instance, by applying dynamic programming to a path decomposition of the graph, Fomin and Høie showed how to find their maximum independent sets in time 2n/6 + o(n). The travelling salesman problem in cubic gr... | Trivalent graph | 0.815658 |
13,972 | Cubic graphs arise naturally in topology in several ways. For example, if one considers a graph to be a 1-dimensional CW complex, cubic graphs are generic in that most 1-cell attaching maps are disjoint from the 0-skeleton of the graph. Cubic graphs are also formed as the graphs of simple polyhedra in three dimensions,... | Trivalent graph | 0.815658 |
13,973 | They may be involved in designing and constructing plants as a project engineer. Chemical engineers serving as project engineers use their knowledge in selecting optimal production methods and plant equipment to minimize costs and maximize safety and profitability. After plant construction, chemical engineering project... | Chemical Technology | 0.815651 |
13,974 | Chemical engineers "develop economic ways of using materials and energy". Chemical engineers use chemistry and engineering to turn raw materials into usable products, such as medicine, petrochemicals, and plastics on a large-scale, industrial setting. They are also involved in waste management and research. Both applie... | Chemical Technology | 0.815651 |
13,975 | Advancements in computer science found applications for designing and managing plants, simplifying calculations and drawings that previously had to be done manually. The completion of the Human Genome Project is also seen as a major development, not only advancing chemical engineering but genetic engineering and genomi... | Chemical Technology | 0.815651 |
13,976 | A 1996 article cites James F. Donnelly for mentioning an 1839 reference to chemical engineering in relation to the production of sulfuric acid. In the same paper, however, George E. Davis, an English consultant, was credited with having coined the term. Davis also tried to found a Society of Chemical Engineering, but i... | Chemical Technology | 0.815651 |
13,977 | Developments in chemical engineering before and after World War II were mainly incited by the petrochemical industry; however, advances in other fields were made as well. Advancements in biochemical engineering in the 1940s, for example, found application in the pharmaceutical industry, and allowed for the mass product... | Chemical Technology | 0.815651 |
13,978 | In the 1940s, it became clear that unit operations alone were insufficient in developing chemical reactors. While the predominance of unit operations in chemical engineering courses in Britain and the United States continued until the 1960s, transport phenomena started to receive greater focus. Along with other novel c... | Chemical Technology | 0.815651 |
13,979 | A unit operation is a physical step in an individual chemical engineering process. Unit operations (such as crystallization, filtration, drying and evaporation) are used to prepare reactants, purifying and separating its products, recycling unspent reactants, and controlling energy transfer in reactors. On the other ha... | Chemical Technology | 0.815651 |
13,980 | In mathematics, a supersolvable arrangement is a hyperplane arrangement which has a maximal flag with only modular elements. Equivalently, the intersection semilattice of the arrangement is a supersolvable lattice, in the sense of Richard P. Stanley. As shown by Hiroaki Terao, a complex hyperplane arrangement is supers... | Supersolvable arrangement | 0.815647 |
13,981 | Human variability is attributed to a combination of environmental and genetic sources including: For the genetic variables listed above, few of the traits characterizing human variability are controlled by simple Mendelian inheritance. Most are polygenic or are determined by a complex combination of genetics and enviro... | Human variability | 0.815643 |
13,982 | Epigenetics may result from methylation of gene sequences leading to the blocking of expression or changes to histone protein structuring as a result of environmental or biological cues. Such alterations influence how genetic material is handled by the cell and to what extent certain DNA sections are expressed and comp... | Human variability | 0.815643 |
13,983 | For example, there has long been a debate among sex researchers on whether sexual orientation is due to evolution and biology (the "essentialist" position), or a result of mutually reinforcing social perceptions and behavioral choices (the "constructivist" perspective). The essentialist position emphasizes inclusive fi... | Human variability | 0.815643 |
13,984 | Measurement of human variation can fall under the purview of several scholarly disciplines, many of which lie at the intersection of biology and statistics. The methods of biostatistics, the application of statistical methods to the analysis of biological data, and bioinformatics, the application of information technol... | Human variability | 0.815643 |
13,985 | Human genomics and population genetics are the study of the human genome and variome, respectively. Studies in these areas may concern the patterns and trends in human DNA. The Human Genome Project and The Human Variome Project are examples of large scale studies of the entire human population to collect data which can... | Human variability | 0.815643 |
13,986 | Epistatic interactions in of themselves vary further with their dependency on the results of the mechanisms of recombination and crossing over. The ability of genes to be expressed may also be a source of variation between individuals and result in changes to phenotype. This may be the result of epigenetics, which are ... | Human variability | 0.815643 |
13,987 | Genetic variation in humans may mean any variance in phenotype which results from heritable allele expression, mutations, and epigenetic changes. While human phenotypes may seem diverse, individuals actually differ by only 1 in every 1,000 base pairs and is primarily the result of inherited genetic differences. Pure co... | Human variability | 0.815643 |
13,988 | Examples such as this demonstrate that preserving a healthy phenotype largely rests on nutritional decision-making skills. The concept that nutrition and diet affect phenotype extends to what the mother eats during pregnancy, which can have drastic effects on the outcome of the phenotype of the child. A recent study by... | Human variability | 0.815643 |
13,989 | Phenotypic variation is a combination of one's genetics and their surrounding environment, with no interaction or mutual influence between the two. This means that a significant portion of human variability can be controlled by human behavior. Nutrition and diet play a substantial role in determining phenotype because ... | Human variability | 0.815643 |
13,990 | The RASP's finite-state machine is equipped with the capability for indirect addressing (e.g., the contents of one register can be used as an address to specify another register); thus the RASP's "program" can address any register in the register-sequence. The upshot of this distinction is that there are computational ... | Turing Machine | 0.815637 |
13,991 | Over the rational numbers, the shuffle algebra is isomorphic to the polynomial algebra in the Lyndon words. The shuffle product occurs in generic settings in non-commutative algebras; this is because it is able to preserve the relative order of factors being multiplied together - the riffle shuffle permutation. This ca... | Shuffle algebra | 0.815634 |
13,992 | In mathematics, a shuffle algebra is a Hopf algebra with a basis corresponding to words on some set, whose product is given by the shuffle product X ⧢ Y of two words X, Y: the sum of all ways of interlacing them. The interlacing is given by the riffle shuffle permutation. The shuffle algebra on a finite set is the grad... | Shuffle algebra | 0.815634 |
13,993 | Plant viruses can be used to engineer viral vectors, tools commonly used to deliver genetic material into plant cells; they are also sources of biomaterials and nanotechnology devices. Tobacco mosaic virus (TMV) is the first virus to be discovered. Viral vectors based on tobacco mosaic virus include those of the magnIC... | Live vector vaccine | 0.815633 |
13,994 | Viral vectors were originally developed as an alternative to transfection of naked DNA for molecular genetics experiments. Compared to traditional methods of transfection (like calcium phosphate precipitation), transduction can ensure that nearly 100% of cells are infected without severely affecting cell viability. Fur... | Live vector vaccine | 0.815633 |
13,995 | Even though it is impossible to make perfect copies of an unknown quantum state, it is possible to produce imperfect copies. This can be done by coupling a larger auxiliary system to the system that is to be cloned, and applying a unitary transformation to the combined system. If the unitary transformation is chosen co... | No clone theorem | 0.815631 |
13,996 | The no-cloning theorem (as generally understood) concerns only pure states whereas the generalized statement regarding mixed states is known as the no-broadcast theorem. The no-cloning theorem has a time-reversed dual, the no-deleting theorem. Together, these underpin the interpretation of quantum mechanics in terms of... | No clone theorem | 0.815631 |
13,997 | In physics, the no-cloning theorem states that it is impossible to create an independent and identical copy of an arbitrary unknown quantum state, a statement which has profound implications in the field of quantum computing among others. The theorem is an evolution of the 1970 no-go theorem authored by James Park, in ... | No clone theorem | 0.815631 |
13,998 | Alternately, a different proof can be given that works directly with mixed states; in this case, the theorem is often known as the no-broadcast theorem. Similarly, an arbitrary quantum operation can be implemented via introducing an ancilla and performing a suitable unitary evolution. Thus the no-cloning theorem holds ... | No clone theorem | 0.815631 |
13,999 | In the statement of the theorem, two assumptions were made: the state to be copied is a pure state and the proposed copier acts via unitary time evolution. These assumptions cause no loss of generality. If the state to be copied is a mixed state, it can be "purified," i.e. treated as a pure state of a larger system. | No clone theorem | 0.815631 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.