Automated reasoningIn computer science, in particular in knowledge representation and reasoning and metalogic, the area of automated reasoning is dedicated to understanding different aspects of reasoning. The study of automated reasoning helps produce computer programs that allow computers to reason completely, or nearly completely, automatically. Although automated reasoning is considered a sub-field of artificial intelligence, it also has connections with theoretical computer science and philosophy.
Ground-coupled heat exchangerA ground-coupled heat exchanger is an underground heat exchanger that can capture heat from and/or dissipate heat to the ground. They use the Earth's near constant subterranean temperature to warm or cool air or other fluids for residential, agricultural or industrial uses. If building air is blown through the heat exchanger for heat recovery ventilation, they are called earth tubes (or Canadian well, Provençal well, Solar chimney, also termed earth cooling tubes, earth warming tubes, earth-air heat exchangers (EAHE or EAHX), air-to-soil heat exchanger, earth channels, earth canals, earth-air tunnel systems, ground tube heat exchanger, hypocausts, subsoil heat exchangers, thermal labyrinths, underground air pipes, and others).
Level setIn mathematics, a level set of a real-valued function f of n real variables is a set where the function takes on a given constant value c, that is: When the number of independent variables is two, a level set is called a level curve, also known as contour line or isoline; so a level curve is the set of all real-valued solutions of an equation in two variables x_1 and x_2. When n = 3, a level set is called a level surface (or isosurface); so a level surface is the set of all real-valued roots of an equation in three variables x_1, x_2 and x_3.
Parity of a permutationIn mathematics, when X is a finite set with at least two elements, the permutations of X (i.e. the bijective functions from X to X) fall into two classes of equal size: the even permutations and the odd permutations. If any total ordering of X is fixed, the parity (oddness or evenness) of a permutation of X can be defined as the parity of the number of inversions for σ, i.e., of pairs of elements x, y of X such that x < y and σ(x) > σ(y). The sign, signature, or signum of a permutation σ is denoted sgn(σ) and defined as +1 if σ is even and −1 if σ is odd.
