id
int32
0
100k
text
stringlengths
21
3.54k
source
stringlengths
1
124
similarity
float32
0.78
0.88
2,400
Machine learning poses a host of ethical questions. Systems that are trained on datasets collected with biases may exhibit these biases upon use (algorithmic bias), thus digitizing cultural prejudices. For example, in 1988, the UK's Commission for Racial Equality found that St. George's Medical School had been using a ...
Applications of machine learning
0.834588
2,401
Machine learning and data mining often employ the same methods and overlap significantly, but while machine learning focuses on prediction, based on known properties learned from the training data, data mining focuses on the discovery of (previously) unknown properties in the data (this is the analysis step of knowledg...
Applications of machine learning
0.834588
2,402
Soil physics is the study of soil's physical properties and processes. It is applied to management and prediction under natural and managed ecosystems. Soil physics deals with the dynamics of physical soil components and their phases as solids, liquids, and gases. It draws on the principles of physics, physical chemist...
Soil physics
0.83458
2,403
Marine microorganisms, including protists and bacteria and their associated viruses, have been variously estimated as constituting about 70% or about 90% of the total marine biomass. Marine life is studied scientifically in both marine biology and in biological oceanography. The term marine comes from the Latin mare, m...
Marine organism
0.834549
2,404
The Bradford assay is a molecular biology technique which enables the fast, accurate quantitation of protein molecules utilizing the unique properties of a dye called Coomassie Brilliant Blue G-250. Coomassie Blue undergoes a visible color shift from reddish-brown to bright blue upon binding to protein. In its unstable...
Molecular Biologist
0.834538
2,405
The PRS platform utilizes a neural network to fit data sets to a regression function resulting in a parabolic surface that provides a direct quantitative relationship between drug dose and efficacy. The governing function for the PRS platform is given as the following: E ( C , t ) = x 0 + ∑ i = 1 M x i C i + ∑ i = 1 M ...
Phenotypic response surfaces
0.834531
2,406
Phenotypic response surfaces (PRS) is an artificial intelligence-guided personalized medicine platform that relies on combinatorial optimization principles to quantify drug interactions and efficacies to develop optimized combination therapies to treat a broad spectrum of illnesses. Phenotypic response surfaces fit a p...
Phenotypic response surfaces
0.834531
2,407
Combinatory therapy treatments provide significant benefits over monotherapy alternatives including greater efficacies and lower side effects and fatality rates, making them ideal candidates to optimize. In 2011 the PRS methodology was developed by a team led by Dr. Ibrahim Al-Shyoukh and Dr. Chih Ming Ho of the Univer...
Phenotypic response surfaces
0.834531
2,408
Optimization of combination therapies is of particular importance in oncology. Conventional cancer treatments often rely on the sequential use of chemotherapy drugs, with each new drug starting as soon as the pervious agent loses efficacy. However, this methodology allows for cancerous cells, due to their rapid rate of...
Phenotypic response surfaces
0.834531
2,409
Some problems are known to be solvable in polynomial time, but no concrete algorithm is known for solving them. For example, the Robertson–Seymour theorem guarantees that there is a finite list of forbidden minors that characterizes (for example) the set of graphs that can be embedded on a torus; moreover, Robertson an...
Complexity class P
0.834517
2,410
This provides a partial converse to Lagrange's theorem giving information about how many subgroups of a given order are contained in G.
Finite group
0.83451
2,411
Finite groups often occur when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. The theory of Lie groups, which may be viewed as dealing with "continuous symmetry", is strongly influenced by the associated Weyl groups. These...
Finite group
0.83451
2,412
Burnside's theorem in group theory states that if G is a finite group of order paqb, where p and q are prime numbers, and a and b are non-negative integers, then G is solvable. Hence each non-Abelian finite simple group has order divisible by at least three distinct primes.
Finite group
0.83451
2,413
In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. Important examples of finite groups include cyclic groups and per...
Finite group
0.83451
2,414
Cayley's theorem, named in honour of Arthur Cayley, states that every group G is isomorphic to a subgroup of the symmetric group acting on G. This can be understood as an example of the group action of G on the elements of G.
Finite group
0.83451
2,415
Moreover, as in the case of compact simple Lie groups, the corresponding groups turned out to be almost simple as abstract groups (Tits simplicity theorem). Although it was known since 19th century that other finite simple groups exist (for example, Mathieu groups), gradually a belief formed that nearly all finite simp...
Finite group
0.83451
2,416
This theorem generalizes to projective groups of higher dimensions and gives an important infinite family PSL(n, q) of finite simple groups. Other classical groups were studied by Leonard Dickson in the beginning of 20th century. In the 1950s Claude Chevalley realized that after an appropriate reformulation, many theor...
Finite group
0.83451
2,417
A group of Lie type is a group closely related to the group G(k) of rational points of a reductive linear algebraic group G with values in the field k. Finite groups of Lie type give the bulk of nonabelian finite simple groups. Special cases include the classical groups, the Chevalley groups, the Steinberg groups, and ...
Finite group
0.83451
2,418
The classification of finite simple groups is a theorem stating that every finite simple group belongs to one of the following families: A cyclic group with prime order; An alternating group of degree at least 5; A simple group of Lie type; One of the 26 sporadic simple groups; The Tits group (sometimes considered as a...
Finite group
0.83451
2,419
The Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson (1962, 1963)
Finite group
0.83451
2,420
In a June 2016 interview with Forbes, Baszucki stated that the idea for Roblox was inspired by the success of his Interactive Physics and Working Model software applications, especially among young students.Baszucki owns a roughly 13% stake in the Roblox Corporation, the company that owns Roblox, a stake estimated to b...
Interactive Physics
0.834494
2,421
In 2004, Baszucki, along with Erik Cassel – who worked as Baszucki's VP of Engineering for Interactive Physics – began working on an early prototype of Roblox under the working title DynaBlocks. It was later renamed Roblox, a portmanteau of "robots" and "blocks", in 2005. The website officially launched in 2006.
Interactive Physics
0.834494
2,422
He later went on to host his own talk radio show for KSCO Radio Santa Cruz from February to July 2003. Baszucki studied engineering and computer science at Stanford University. While there, he did a summer internship at General Motors where he worked in a lab focused on controlling car engines with software. He graduat...
Interactive Physics
0.834494
2,423
In the late 1980s, Baszucki, together with his brother Greg Baszucki, founded the company Knowledge Revolution and developed and distributed a simulation called "Interactive Physics", which was designed as an educational supplement that would allow the creation of 2D physics experiments.As a follow-up to Interactive Ph...
Interactive Physics
0.834494
2,424
In 1955 a new department was founded - Physical Electronics. In following years the Telecommunications department was broadened in the areas of electronics, automatics and computer science. The fourth department - Computer science - was formed in 1987. The most recent addition is the department of Software Engineering,...
University of Belgrade School of Electrical Engineering
0.834479
2,425
Due to the lack of lab equipment forming of the fourth department (telecommunications) was postponed until the end of the Second World War. In 1946 the Department of Electrical Engineering was formed. That department grew into the School of Electrical Engineering two years later, with its Power Systems Engineering and ...
University of Belgrade School of Electrical Engineering
0.834479
2,426
First diplomas in this area were given in 1922. The education of electrical engineers has been considerably expanded after reorganization of the engineering department in 1935. The mechanical department became Mechanical Electrical Engineering department, within which, in 1937, four new departments were formed- mechani...
University of Belgrade School of Electrical Engineering
0.834479
2,427
The first university level lecture in the area of electrical engineering was held in 1894. Professor Stevan Markovic was the first lecturer and founder of Electrical Engineering Chair with Engineering department of Belgrade Higher School. Only four years later, Professor Markovic also founded electrical engineering lab...
University of Belgrade School of Electrical Engineering
0.834479
2,428
In 1898, Marković also founded the first electrical engineering laboratory in Serbia. The school consists of a number of departments: Software Engineering, which is a separate department students enroll from year one, and the General Course, where from year two the students can select one of the following. Basic Electr...
University of Belgrade School of Electrical Engineering
0.834479
2,429
The University of Belgrade School of Electrical Engineering also known as Faculty of Electrical Engineering (Serbian: Електротехнички факултет Универзитета у Београду/Elektrotehnički fakultet Univerziteta u Beogradu) is a constituent body of the University of Belgrade. The word Faculty in Europe stands for an academic ...
University of Belgrade School of Electrical Engineering
0.834479
2,430
The 19th Olympiad was held 27 June - 3 July 2016 and the 20th Olympiad was held 1-7 July 2017, both at Leiden University and organized by the International Computer Game Association, the Leiden Institute of Advanced Computer Science, and the Leiden Centre of Data Science. The 21st Olympiad was held 7-13 July 2018 in Ta...
Computer Olympiad
0.834477
2,431
The 10th Olympiad was in 2005 in Taipei; the 11th, in 2006 in Turin; the 12th, in 2007 at the Amsterdam Science Park; the 13th, in 2008 at the Beijing Golden Century Golf Club; and the 14th, in 2009 in Pamplona. The 10th Olympiad wasa held at the same time and location as the 11th Advances in Computer Games and its org...
Computer Olympiad
0.834477
2,432
The 15th Olympiad was held in 2010 in Kanazawa, Japan along with the 18th World Computer Chess Championship (WCCC), and a scientific conference on computer games. The 16th Olympiad was held in 2011 at Tilburg University at the same time as the 19th WCCC. The 17th Olympiad was held in 2013 at Keio University's Collabora...
Computer Olympiad
0.834477
2,433
What is E ∩ F in this case? No living human being is over 1000 years old, so E ∩ F must be the empty set {}. For any set A, the power set P ( A ) {\displaystyle P(A)} is a Boolean algebra under the operations of union and intersection.
Naive Set Theory
0.834462
2,434
An explicit ruling out of all conceivable inconsistencies (paradoxes) cannot be achieved for an axiomatic set theory anyway, due to Gödel's second incompleteness theorem, so this does not at all hamper the utility of naive set theory as compared to axiomatic set theory in the simple contexts considered below. It merely...
Naive Set Theory
0.834462
2,435
Complex numbers are sums of a real and an imaginary number: r + s i {\displaystyle r+s\,i} . Here either r {\displaystyle r} or s {\displaystyle s} (or both) can be zero; thus, the set of real numbers and the set of strictly imaginary numbers are subsets of the set of complex numbers, which form an algebraic closure fo...
Naive Set Theory
0.834462
2,436
Likewise, an axiomatic set theory is not necessarily consistent: not necessarily free of paradoxes. It follows from Gödel's incompleteness theorems that a sufficiently complicated first order logic system (which includes most common axiomatic set theories) cannot be proved consistent from within the theory itself – eve...
Naïve set theory
0.834462
2,437
If A and B are sets, then the Cartesian product (or simply product) is defined to be: A × B = {(a,b) | a ∈ A and b ∈ B}.That is, A × B is the set of all ordered pairs whose first coordinate is an element of A and whose second coordinate is an element of B. This definition may be extended to a set A × B × C of ordered t...
Naive Set Theory
0.834462
2,438
Real numbers represent the "real line" and include all numbers that can be approximated by rationals. These numbers may be rational or algebraic but may also be transcendental numbers, which cannot appear as solutions to polynomial equations with rational coefficients. A blackboard bold capital R ( R {\displaystyle \ma...
Naive Set Theory
0.834462
2,439
Algebraic numbers appear as solutions to polynomial equations (with integer coefficients) and may involve radicals (including i = − 1 {\displaystyle i={\sqrt {-1\,}}} ) and certain other irrational numbers. A Q with an overline ( Q ¯ {\displaystyle {\overline {\mathbb {Q} }}} ) often represents this set. The overline d...
Naive Set Theory
0.834462
2,440
With the axiom schema of separation as an axiom of the theory, it follows, as a theorem of the theory: Or, more spectacularly (Halmos' phrasing): There is no universe. Proof: Suppose that it exists and call it U. Now apply the axiom schema of separation with X = U and for P(x) use x ∉ x. This leads to Russell's paradox...
Naive Set Theory
0.834462
2,441
Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics (...
Naïve set theory
0.834462
2,442
Important algorithms in computational group theory include: the Schreier–Sims algorithm for finding the order of a permutation group the Todd–Coxeter algorithm and Knuth–Bendix algorithm for coset enumeration the product-replacement algorithm for finding random elements of a groupTwo important computer algebra systems ...
Computational group theory
0.834446
2,443
The Algebra Project is a national U.S. mathematics literacy program aimed at helping low-income students and students of color achieve the mathematical skills in high school that are a prerequisite for a college preparatory mathematics sequence. Founded by Civil Rights activist and Math educator Bob Moses in the 1980s,...
Algebra Project
0.834443
2,444
Founded in 1996, the Young People's Project (YPP) is a spin-off of the Algebra Project, which recruits and trains high school and college age "Math Literacy Workers" to tutor younger students in mathematics, and is directed by Omowale Moses. YPP has established sites in Jackson, Mississippi, Chicago, and the Greater Bo...
Algebra Project
0.834443
2,445
The Algebra Project was founded in 1982 by Bob Moses in Cambridge, Massachusetts. Moses worked with his daughter's eighth-grade teacher, Mary Lou Mehrling, to provide extra tutoring for several students in her class in algebra. Moses, who had taught secondary school mathematics in New York City and Tanzania, wanted to ...
Algebra Project
0.834443
2,446
Geometric constraint solving is constraint satisfaction in a computational geometry setting, which has primary applications in computer aided design. A problem to be solved consists of a given set of geometric elements and a description of geometric constraints between the elements, which could be non-parametric (tange...
Geometric constraint solving
0.834399
2,447
Geometric constraint solving has applications in a wide variety of fields, such as computer aided design, mechanical engineering, inverse kinematics and robotics, architecture and construction, molecular chemistry, and geometric theorem proving. The primary application area is computer aided design, where geometric con...
Geometric constraint solving
0.834399
2,448
A general scheme of geometric constraint solving consists of modeling a set of geometric elements and constraints by a system of equations, and then solving this system by non-linear algebraic solver. For the sake of performance, a number of decomposition techniques could be used in order to decrease the size of an equ...
Geometric constraint solving
0.834399
2,449
Primary is a term used in organic chemistry to classify various types of compounds (e.g. alcohols, alkyl halides, amines) or reactive intermediates (e.g. alkyl radicals, carbocations).
Primary (chemistry)
0.834397
2,450
Electron scattering by isolated atoms and molecules occurs in the gas phase. It plays a key role in plasma physics and chemistry and it's important for such applications as semiconductor physics. Electron-molecule/atom scattering is normally treated by means of quantum mechanics. The leading approach to compute the cro...
Electron scattering experiment
0.834385
2,451
Stanford Linear Accelerator Center is located near Stanford University, California. Construction began on the 2 mile long linear accelerator in 1962 and was completed in 1967, and in 1968 the first experimental evidence of quarks was discovered resulting in the 1990 Nobel Prize in Physics, shared by SLAC's Richard Tayl...
Electron scattering experiment
0.834385
2,452
The Stanford Positron Electron Asymmetric Ring (SPEAR) addition to the SLAC made further such discoveries possible, leading to the discovery in 1974 of the J/psi particle, which consists of a paired charm quark and anti-charm quark, and another Nobel Prize in Physics in 1976. This was followed up with Martin Perl's ann...
Electron scattering experiment
0.834385
2,453
There are several widely used undergraduate textbooks in electromagnetism, including David Griffiths' Introduction to Electrodynamics as well as Electricity and Magnetism by Edward Mills Purcell and D. J. Morin. The Feynman Lectures on Physics also include a volume on electromagnetism that is available to read online f...
List of textbooks in electromagnetism
0.834377
2,454
The study of electromagnetism in higher education, as a fundamental part of both physics and engineering, is typically accompanied by textbooks devoted to the subject. The American Physical Society and the American Association of Physics Teachers recommend a full year of graduate study in electromagnetism for all physi...
List of textbooks in electromagnetism
0.834376
2,455
A 2006 report by a joint taskforce between the American Physical Society and the American Association of Physics Teachers found that 76 of the 80 physics departments surveyed require a first-year graduate course in John David Jackson's Classical Electrodynamics. This made Jackson's book the most popular textbook in any...
List of textbooks in electromagnetism
0.834376
2,456
This is a list of geometry topics.
List of geometry topics
0.834376
2,457
Coordinate-free treatment Chirality Handedness Relative direction Mirror image Erlangen program Four-dimensional space Geometric shape Geometric space Group action, invariant Hadwiger's theorem Infinitesimal transformation Pi Polar sine Symmetry, shape, pattern Crystal system Frieze group Isometry Lattice Point group P...
List of geometry topics
0.834376
2,458
Astronomy Computer graphics Image analysis Robot control The Strähle construction is used in the design of some musical instruments. Burmester's theory for the design of mechanical linkages
List of geometry topics
0.834376
2,459
3D projection 3D computer graphics Binary space partitioning Ray tracing Graham scan Borromean rings Cavalieri's principle Cross section Crystal Cuisenaire rods Desargues' theorem Right circular cone Hyperboloid Napkin ring problem Pappus's centroid theorem Paraboloid Polyhedron Defect Dihedral angle Prism Prismatoid H...
List of geometry topics
0.834376
2,460
Projective geometry Arc (projective geometry) Desargues' theorem Girard Desargues Desarguesian plane Line at infinity Point at infinity Plane at infinity Hyperplane at infinity Projective line Projective plane Oval (projective plane) Roman surface Projective space Complex projective line Complex projective plane Fundam...
List of geometry topics
0.834376
2,461
Another dichotomy theorem for constraint languages is the Hell-Nesetril theorem, which shows a dichotomy for problems on binary constraints with a single fixed symmetric relation. In terms of the homomorphism problem, every such problem is equivalent to the existence of a homomorphism from a relational structure to a g...
Complexity of constraint satisfaction
0.834361
2,462
The best known such result is Schaefer's dichotomy theorem, which proves the existence of a dichotomy in the set of constraint languages on a binary domain. More precisely, it proves that a relation restriction on a binary domain is tractable if all its relations belong to one of six classes, and is NP-complete otherwi...
Complexity of constraint satisfaction
0.834361
2,463
Some constraint languages (or non-uniform problems) are known to correspond to problems solvable in polynomial time, and some others are known to express NP-complete problems. However, it is possible that some constraint languages are neither. It is known by Ladner's theorem that if P is not equal to NP, then there exi...
Complexity of constraint satisfaction
0.834361
2,464
Since kinetic energy is entirely a function of an object mass and velocity, the above result may be used with the parallel axis theorem to obtain the kinetic energy associated with simple rolling K rolling = K translation + K rotation {\displaystyle K_{\text{rolling}}=K_{\text{translation}}+K_{\text{rotation}}}
Rolling
0.834319
2,465
With evidence showing that different memories excite different neurons or system of neurons in the brain the technique of destroying select neurons in the brain to erase specific memories is also being researched. Studies have started to investigate the possibility of using distinct toxins along with biotechnology that...
Memory erasure
0.834315
2,466
The neuronal firings look like tiny green fireworks, randomly bursting against a black background, but the scientists have deciphered clear patterns in the chaos. "We can literally figure out where the mouse is in the arena by looking at these lights," said Mark Schnizer, an associate professor of biology and of applie...
Memory erasure
0.834314
2,467
As early as 2009 researchers were able to trace and destroy neurons involved in supporting the specific type of memory that they were trying to erase. This caused the erasure of the target memory.Aside from the biotechnology approach to studying memory, research in psychiatry on how memories work has also been going on...
Memory erasure
0.834314
2,468
R. E. Bellman, Dynamic Programming, Princeton University Press, Princeton, 1957 Abraham Charnes, William W. Cooper, Management Models and Industrial Applications of Linear Programming, Volumes I and II, New York, John Wiley & Sons, 1961 Abraham Charnes, William W. Cooper, A. Henderson, An Introduction to Linear Program...
Operations Research
0.83431
2,469
In 1967 Stafford Beer characterized the field of management science as "the business use of operations research". Like operational research itself, management science (MS) is an interdisciplinary branch of applied mathematics devoted to optimal decision planning, with strong links with economics, business, engineering,...
Operations Research
0.83431
2,470
Operational research (OR) encompasses the development and the use of a wide range of problem-solving techniques and methods applied in the pursuit of improved decision-making and efficiency, such as simulation, mathematical optimization, queueing theory and other stochastic-process models, Markov decision processes, ec...
Operations Research
0.83431
2,471
The most basic area formula is the formula for the area of a rectangle. Given a rectangle with length l and width w, the formula for the area is: A = lw (rectangle).That is, the area of the rectangle is the length multiplied by the width. As a special case, as l = w in the case of a square, the area of a square with si...
Area (geometry)
0.834301
2,472
In ancient times, the method of exhaustion was used in a similar way to find the area of the circle, and this method is now recognized as a precursor to integral calculus. Using modern methods, the area of a circle can be computed using a definite integral: A = 2 ∫ − r r r 2 − x 2 d x = π r 2 . {\displaystyle A\;=\;2\i...
Area (geometry)
0.834301
2,473
Thus, the total area of the circle is πr2: A = πr2 (circle).Though the dissection used in this formula is only approximate, the error becomes smaller and smaller as the circle is partitioned into more and more sectors. The limit of the areas of the approximate parallelograms is exactly πr2, which is the area of the cir...
Area (geometry)
0.834301
2,474
The area enclosed by a parametric curve u → ( t ) = ( x ( t ) , y ( t ) ) {\displaystyle {\vec {u}}(t)=(x(t),y(t))} with endpoints u → ( t 0 ) = u → ( t 1 ) {\displaystyle {\vec {u}}(t_{0})={\vec {u}}(t_{1})} is given by the line integrals: ∮ t 0 t 1 x y ˙ d t = − ∮ t 0 t 1 y x ˙ d t = 1 2 ∮ t 0 t 1 ( x y ˙ − y x ˙ ) d...
Area (geometry)
0.834301
2,475
The formula for the surface area of a sphere was first obtained by Archimedes in his work On the Sphere and Cylinder. The formula is: A = 4πr2 (sphere),where r is the radius of the sphere. As with the formula for the area of a circle, any derivation of this formula inherently uses methods similar to calculus.
Area (geometry)
0.834301
2,476
Food microbiology laboratory. CRC Press. p. 121. ISBN 0-8493-1267-1.
Z-value (temperature)
0.834284
2,477
There are several distinct branches of mathematical physics, and these roughly correspond to particular historical parts of our world.
Mathematical Physics
0.834258
2,478
The rigorous, abstract and advanced reformulation of Newtonian mechanics adopting the Lagrangian mechanics and the Hamiltonian mechanics even in the presence of constraints. Both formulations are embodied in analytical mechanics and lead to understanding the deep interplay of the notions of symmetry and conserved quant...
Mathematical Physics
0.834258
2,479
The gravitational field is Minkowski spacetime itself, the 4D topology of Einstein aether modeled on a Lorentzian manifold that "curves" geometrically, according to the Riemann curvature tensor. The concept of Newton's gravity: "two masses attract each other" replaced by the geometrical argument: "mass transform curvat...
Mathematical Physics
0.834258
2,480
), Springer-Verlag, ISBN 978-3-642-07711-1 von Neumann, John (2018), Mathematical Foundations of Quantum Mechanics, Princeton University Press, ISBN 978-0-691-17856-1 Weyl, Hermann (2014), The Theory of Groups and Quantum Mechanics, Martino Fine Books, ISBN 978-1614275800 Ynduráin, Francisco J. (2006), The Theory of Qu...
Mathematical Physics
0.834258
2,481
), Springer, doi:10.1007/978-3-319-70706-8, ISBN 978-3-319-70705-1, S2CID 125121522 Robert, Didier; Combescure, Monique (2021), Coherent States and Applications in Mathematical Physics (2nd ed. ), Springer, ISBN 978-3-030-70844-3 Tasaki, Hal (2020), Physics and mathematics of quantum many-body systems, Springer, ISBN 9...
Mathematical Physics
0.834258
2,482
(2017), Mathematical Gauge Theory: With Applications to the Standard Model of Particle Physics, Springer, ISBN 978-3-319-68438-3 Hawking, Stephen W.; Ellis, George F. R. (1973), The Large Scale Structure of Space-Time, Cambridge University Press, ISBN 0-521-20016-4 Jackiw, Roman (1995), Diverse Topics in Theoretical an...
Mathematical Physics
0.834258
2,483
), Springer-Verlag, ISBN 0-387-96477-0 Haag, Rudolf (1996), Local Quantum Physics: Fields, Particles, Algebras (2nd ed. ), Springer-Verlag, ISBN 3-540-61049-9 Hall, Brian C. (2013), Quantum Theory for Mathematicians, Springer, ISBN 978-1-4614-7115-8 Hamilton, Mark J. D.
Mathematical Physics
0.834258
2,484
Baez, John C.; Muniain, Javier P. (1994), Gauge Fields, Knots, and Gravity, World Scientific, ISBN 981-02-2034-0 Blank, Jiří; Exner, Pavel; Havlíček, Miloslav (2008), Hilbert Space Operators in Quantum Physics (2nd ed. ), Springer, ISBN 978-1-4020-8869-8 Engel, Eberhard; Dreizler, Reiner M. (2011), Density Functional T...
Mathematical Physics
0.834258
2,485
Statistical mechanics forms a separate field, which includes the theory of phase transitions. It relies upon the Hamiltonian mechanics (or its quantum version) and it is closely related with the more mathematical ergodic theory and some parts of probability theory. There are increasing interactions between combinatoric...
Mathematical Physics
0.834258
2,486
Prominent contributors to the 20th century's mathematical physics include (ordered by birth date): William Thomson (Lord Kelvin) Oliver Heaviside Jules Henri Poincaré David Hilbert Arnold Sommerfeld Constantin Carathéodory Albert Einstein Max Born George David Birkhoff Hermann Weyl Satyendra Nath Bose Norber...
Mathematical Physics
0.834258
2,487
Some 3VL modular algebras have been introduced more recently, motivated by circuit problems rather than philosophical issues: Cohn algebra Pradhan algebra Dubrova and Muzio algebra
Three-valued logic
0.834241
2,488
Matrices, versors (quaternions), and other algebraic things: see the section Linear and Multilinear Algebra Formalism for details.A general rotation in four dimensions has only one fixed point, the centre of rotation, and no axis of rotation; see rotations in 4-dimensional Euclidean space for details. Instead the rotat...
Rotation (geometry)
0.834185
2,489
Medivir is listed on the Nasdaq Stockholm Mid Cap List. In February 2020, Medivir announced that the company has signed a licensing agreement for Xerclear with Chinese company Shijiazhuang Yuanmai Biotechnology Co Ltd (SYB). The agreement gives SYB the right to register, manufacture and market the product in China.
Medivir
0.834174
2,490
Its mathematical formalization is part of the field of topological graph theory which studies the embedding of graphs on surfaces. An important part of the puzzle, but one that is often not stated explicitly in informal wordings of the puzzle, is that the houses, companies, and lines must all be placed on a two-dimensi...
Three utilities problem
0.834169
2,491
This puzzle can be formalized as a problem in topological graph theory by asking whether the complete bipartite graph K 3 , 3 {\displaystyle K_{3,3}} , with vertices representing the houses and utilities and edges representing their connections, has a graph embedding in the plane. The impossibility of the puzzle corres...
Three utilities problem
0.834169
2,492
Physical Chemistry Chemical Physics is a weekly peer-reviewed scientific journal publishing research and review articles on any aspect of physical chemistry, chemical physics, and biophysical chemistry. It is published by the Royal Society of Chemistry on behalf of eighteen participating societies. The editor-in-chief ...
Physical Chemistry Chemical Physics
0.83416
2,493
Medical biology is a field of biology that has practical applications in medicine, health care and laboratory diagnostics. It includes many biomedical disciplines and areas of specialty that typically contains the "bio-" prefix such as: molecular biology, biochemistry, biophysics, biotechnology, cell biology, embryolog...
Medical biology
0.834131
2,494
Greedy algorithms have a long history of study in combinatorial optimization and theoretical computer science. Greedy heuristics are known to produce suboptimal results on many problems, and so natural questions are: For which problems do greedy algorithms perform optimally? For which problems do greedy algorithms guar...
Exchange algorithm
0.834122
2,495
A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reason...
Exchange algorithm
0.834122
2,496
Genome skimming is a cost-effective, rapid and reliable method to generate large shallow datasets, since several datasets (plastid, mitochondrial, nuclear) are generated per run. It is very simple to implement, requires less lab work and optimization, and does not require a priori knowledge of the organism nor its geno...
Genome skimming
0.834106
2,497
Both the wet-lab and the bioinformatics parts of genome skimming have certain challenges with scalability. Although the cost of sequencing in genome skimming is affordable at $80 for 1 Gb in 2016, the library preparation for sequencing is still very expensive, at least ~$200 per sample (as of 2016). Additionally, most ...
Genome skimming
0.834106
2,498
In herbaria, even with low yield and low-quality DNA, one study was still able to produce "high-quality complete chloroplast and ribosomal DNA sequences" at a large scale for downstream analyses.In field studies, invertebrates are stored in ethanol which is usually discarded during DNA-based studies. Genome skimming ha...
Genome skimming
0.834106
2,499
Geneious is a integrative software platform that allows users to perform various steps in bioinformatic analysis such as assembly, alignment, and phylogenetics by incorporating other tools within a GUI based platform.
Genome skimming
0.834106