Railway trackA railway track (British English and UIC terminology) or railroad track (American English), also known as a train track or permanent way, is the structure on a railway or railroad consisting of the , fasteners, railroad ties (sleepers, British English) and ballast (or slab track), plus the underlying subgrade. It enables trains to move by providing a dependable surface for their wheels to roll upon. Early tracks were constructed with wooden or cast iron rails, and wooden or stone sleepers; since the 1870s, rails have almost universally been made from steel.
Train stationA train station, railway station, railroad station, or railway depot is a railway facility where trains stop to load or unload passengers, freight, or both. It generally consists of at least one platform, one track, and a station building providing such ancillary services as ticket sales, waiting rooms, and baggage/freight service. If a station is on a single-track line, it often has a passing loop to facilitate traffic movements.
Parallel computingParallel computing is a type of computation in which many calculations or processes are carried out simultaneously. Large problems can often be divided into smaller ones, which can then be solved at the same time. There are several different forms of parallel computing: bit-level, instruction-level, data, and task parallelism. Parallelism has long been employed in high-performance computing, but has gained broader interest due to the physical constraints preventing frequency scaling.
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.
Track geometryTrack geometry is concerned with the properties and relations of points, lines, curves, and surfaces in the three-dimensional positioning of railroad track. The term is also applied to measurements used in design, construction and maintenance of track. Track geometry involves standards, speed limits and other regulations in the areas of track gauge, alignment, elevation, curvature and track surface. Standards are usually separately expressed for horizontal and vertical layouts although track geometry is three-dimensional.
Train driverA train driver, engine driver, engineman or locomotive driver, commonly known as an engineer or railroad engineer in the United States and Canada, and also as a locomotive handler, locomotive engineer, locomotive operator, train operator, or motorman, is a person who operates a train, railcar, or other rail transport vehicle. The driver is in charge of and is responsible for the mechanical operation of the train, train speed, and all of the train handling (also known as brake handling).
Time complexityIn computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.
TimeTime is the continued sequence of existence and events that occurs in an apparently irreversible succession from the past, through the present, into the future. It is a component quantity of various measurements used to sequence events, to compare the duration of events or the intervals between them, and to quantify rates of change of quantities in material reality or in the conscious experience. Time is often referred to as a fourth dimension, along with three spatial dimensions.
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.
Online shoppingOnline shopping is a form of electronic commerce which allows consumers to directly buy goods or services from a seller over the Internet using a web browser or a mobile app. Consumers find a product of interest by visiting the website of the retailer directly or by searching among alternative vendors using a shopping search engine, which displays the same product's availability and pricing at different e-retailers. As of 2020, customers can shop online using a range of different computers and devices, including desktop computers, laptops, tablet computers and smartphones.
