Oxford English DictionaryThe Oxford English Dictionary (OED) is the principal historical dictionary of the English language, published by Oxford University Press (OUP). It traces the historical development of the English language, providing a comprehensive resource to scholars and academic researchers, as well as describing usage in its many variations throughout the world. Work began on the dictionary in 1857, but it was only in 1884 that it began to be published in unbound fascicles as work continued on the project, under the name of A New English Dictionary on Historical Principles; Founded Mainly on the Materials Collected by The Philological Society.
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.
Regularization (mathematics)In mathematics, statistics, finance, computer science, particularly in machine learning and inverse problems, regularization is a process that changes the result answer to be "simpler". It is often used to obtain results for ill-posed problems or to prevent overfitting. Although regularization procedures can be divided in many ways, the following delineation is particularly helpful: Explicit regularization is regularization whenever one explicitly adds a term to the optimization problem.
Challenger 2The FV4034 Challenger 2 (MoD designation "CR2") is a third generation British main battle tank (MBT) in service with the armies of the United Kingdom, Oman, and Ukraine. It was designed by Vickers Defence Systems (now BAE Systems Land & Armaments) as a private venture in 1986, and was an extensive redesign of the company's earlier Challenger 1 tank. The Ministry of Defence ordered a prototype in December 1988. Despite outward similarities to the Challenger 1, design and technological developments mean that only about 3% of components are interchangeable with the earlier vehicle.
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.
Occlusion (dentistry)Occlusion, in a dental context, means simply the contact between teeth. More technically, it is the relationship between the maxillary (upper) and mandibular (lower) teeth when they approach each other, as occurs during chewing or at rest. Static occlusion refers to contact between teeth when the jaw is closed and stationary, while dynamic occlusion refers to occlusal contacts made when the jaw is moving.
Main battle tankA main battle tank (MBT), also known as a battle tank or universal tank, is a tank that fills the role of armor-protected direct fire and maneuver in many modern armies. Cold War-era development of more powerful engines, better suspension systems and lighter composite armor allowed for the design of a tank that had the firepower of a super-heavy tank, the armor protection of a heavy tank, and the mobility of a light tank, in a package with the weight of a medium tank.
Pedestrian detectionPedestrian detection is an essential and significant task in any intelligent video surveillance system, as it provides the fundamental information for semantic understanding of the video footages. It has an obvious extension to automotive applications due to the potential for improving safety systems. Many car manufacturers (e.g. Volvo, Ford, GM, Nissan) offer this as an ADAS option in 2017.
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.
Hamiltonian path problemIn the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
