Computational problemIn theoretical computer science, a computational problem is a problem that may be solved by an algorithm. For example, the problem of factoring "Given a positive integer n, find a nontrivial prime factor of n." is a computational problem. A computational problem can be viewed as a set of instances or cases together with a, possibly empty, set of solutions for every instance/case. For example, in the factoring problem, the instances are the integers n, and solutions are prime numbers p that are the nontrivial prime factors of n.
Inversion (linguistics)In linguistics, inversion is any of several grammatical constructions where two expressions switch their canonical order of appearance, that is, they invert. There are several types of subject-verb inversion in English: locative inversion, directive inversion, copular inversion, and quotative inversion. The most frequent type of inversion in English is subject–auxiliary inversion in which an auxiliary verb changes places with its subject; it often occurs in questions, such as Are you coming?, with the subject you is switched with the auxiliary are.
Quattro (four-wheel-drive system)Quattro (meaning four in Italian and stylized in lower case) is the trademark used by the automotive brand Audi to indicate that all-wheel drive (AWD) technologies or systems are used on specific models of its automobiles. The word "quattro" is a registered trademark of Audi AG, a subsidiary of the German automotive concern, Volkswagen Group. Quattro was first introduced in 1980 on the permanent four-wheel drive Audi Quattro model, often referred to as the Ur-Quattro (meaning "original" or "first").
Atmospheric modelIn atmospheric science, an atmospheric model is a mathematical model constructed around the full set of primitive, dynamical equations which govern atmospheric motions. It can supplement these equations with parameterizations for turbulent diffusion, radiation, moist processes (clouds and precipitation), heat exchange, soil, vegetation, surface water, the kinematic effects of terrain, and convection. Most atmospheric models are numerical, i.e. they discretize equations of motion.
Sustainable transportSustainable transport refers to ways of transportation that are sustainable in terms of their social and environmental impacts. Components for evaluating sustainability include the particular vehicles used for road, water or air transport; the source of energy; and the infrastructure used to accommodate the transport (roads, railways, airways, waterways, canals and terminals). Transport operations and logistics as well as transit-oriented development are also involved in evaluation.
General circulation modelA general circulation model (GCM) is a type of climate model. It employs a mathematical model of the general circulation of a planetary atmosphere or ocean. It uses the Navier–Stokes equations on a rotating sphere with thermodynamic terms for various energy sources (radiation, latent heat). These equations are the basis for computer programs used to simulate the Earth's atmosphere or oceans. Atmospheric and oceanic GCMs (AGCM and OGCM) are key components along with sea ice and land-surface components.
Force field (chemistry)In the context of chemistry and molecular modelling, a force field is a computational method that is used to estimate the forces between atoms within molecules and also between molecules. More precisely, the force field refers to the functional form and parameter sets used to calculate the potential energy of a system of atoms or coarse-grained particles in molecular mechanics, molecular dynamics, or Monte Carlo simulations. The parameters for a chosen energy function may be derived from experiments in physics and chemistry, calculations in quantum mechanics, or both.
Global Forecast SystemThe Global Forecast System (GFS) is a global numerical weather prediction system containing a global computer model and variational analysis run by the United States' National Weather Service (NWS). The mathematical model is run four times a day, and produces forecasts for up to 16 days in advance, but with decreased spatial resolution after 10 days. The forecast skill generally decreases with time (as with any numerical weather prediction model) and for longer term forecasts, only the larger scales retain significant accuracy.
Urban sprawlUrban sprawl (also known as suburban sprawl or urban encroachment) is defined as "the spreading of urban developments (such as houses and shopping centers) on undeveloped land near a city". Urban sprawl has been described as the unrestricted growth in many urban areas of housing, commercial development, and roads over large expanses of land, with little concern for urban planning. In addition to describing a special form of urbanization, the term also relates to the social and environmental consequences associated with this development.
Molecular dynamicsMolecular dynamics (MD) is a computer simulation method for analyzing the physical movements of atoms and molecules. The atoms and molecules are allowed to interact for a fixed period of time, giving a view of the dynamic "evolution" of the system. In the most common version, the trajectories of atoms and molecules are determined by numerically solving Newton's equations of motion for a system of interacting particles, where forces between the particles and their potential energies are often calculated using interatomic potentials or molecular mechanical force fields.
Placebo-controlled studyPlacebo-controlled studies are a way of testing a medical therapy in which, in addition to a group of subjects that receives the treatment to be evaluated, a separate control group receives a sham "placebo" treatment which is specifically designed to have no real effect. Placebos are most commonly used in blinded trials, where subjects do not know whether they are receiving real or placebo treatment. Often, there is also a further "natural history" group that does not receive any treatment at all.
Travelling salesman problemThe travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
