Information economicsInformation economics or the economics of information is the branch of microeconomics that studies how information and information systems affect an economy and economic decisions. One application considers information embodied in certain types of commodities that are "expensive to produce but cheap to reproduce." Examples include computer software (e.g., Microsoft Windows), pharmaceuticals, and technical books. Once information is recorded "on paper, in a computer, or on a compact disc, it can be reproduced and used by a second person essentially for free.
Decision problemIn computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm whether a given natural number is prime. Another is the problem "given two numbers x and y, does x evenly divide y?". The answer is either 'yes' or 'no' depending upon the values of x and y. A method for solving a decision problem, given in the form of an algorithm, is called a decision procedure for that problem.
Side-channel attackIn computer security, a side-channel attack is any attack based on extra information that can be gathered because of the fundamental way a computer protocol or algorithm is implemented, rather than flaws in the design of the protocol or algorithm itself (e.g. flaws found in a cryptanalysis of a cryptographic algorithm) or minor, but potentially devastating, mistakes or oversights in the implementation. (Cryptanalysis also includes searching for side-channel attacks.
Total fertility rateThe total fertility rate (TFR) of a population is the average number of children that would be born to a female over their lifetime if: they were to experience the exact current age-specific fertility rates (ASFRs) through their lifetime they were to live from birth until the end of their reproductive life. It is obtained by summing the single-year age-specific rates at a given time. , the total fertility rate varied widely across the world, from 0.78 in South Korea to 6.73 in Niger.
Sampling (signal processing)In signal processing, sampling is the reduction of a continuous-time signal to a discrete-time signal. A common example is the conversion of a sound wave to a sequence of "samples". A sample is a value of the signal at a point in time and/or space; this definition differs from the term's usage in statistics, which refers to a set of such values. A sampler is a subsystem or operation that extracts samples from a continuous signal. A theoretical ideal sampler produces samples equivalent to the instantaneous value of the continuous signal at the desired points.
Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
Birth rateBirth rate, also known as natality, is the total number of live human births per 1,000 population for a given period divided by the length of the period in years. The number of live births is normally taken from a universal registration system for births; population counts from a census, and estimation through specialized demographic techniques. The birth rate (along with mortality and migration rates) is used to calculate population growth. The estimated average population may be taken as the mid-year population.
Gaussian integerIn number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as or Gaussian integers share many properties with integers: they form a Euclidean domain, and have thus a Euclidean division and a Euclidean algorithm; this implies unique factorization and many related properties. However, Gaussian integers do not have a total ordering that respects arithmetic.
Quadratic reciprocityIn number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is: Let p and q be distinct odd prime numbers, and define the Legendre symbol as: Then: This law, together with its supplements, allows the easy calculation of any Legendre symbol, making it possible to determine whether there is an integer solution for any quadratic equation of the form for an odd prime ; that is, to determine the "perfect squares" modulo .
Gaussian rationalIn mathematics, a Gaussian rational number is a complex number of the form p + qi, where p and q are both rational numbers. The set of all Gaussian rationals forms the Gaussian rational field, denoted Q(i), obtained by adjoining the imaginary number i to the field of rationals Q. The field of Gaussian rationals provides an example of an algebraic number field, which is both a quadratic field and a cyclotomic field (since i is a 4th root of unity).
Excess burden of taxationIn economics, the excess burden of taxation, also known as the deadweight cost or deadweight loss of taxation, is one of the economic losses that society suffers as the result of taxes or subsidies. Economic theory posits that distortions change the amount and type of economic behavior from that which would occur in a free market without the tax. Excess burdens can be measured using the average cost of funds or the marginal cost of funds (MCF). Excess burdens were first discussed by Adam Smith.
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.
