HydraulicsHydraulics () is a technology and applied science using engineering, chemistry, and other sciences involving the mechanical properties and use of liquids. At a very basic level, hydraulics is the liquid counterpart of pneumatics, which concerns gases. Fluid mechanics provides the theoretical foundation for hydraulics, which focuses on applied engineering using the properties of fluids. In its fluid power applications, hydraulics is used for the generation, control, and transmission of power by the use of pressurized liquids.
Hydraulic machineryHydraulic machines use liquid fluid power to perform work. Heavy construction vehicles are a common example. In this type of machine, hydraulic fluid is pumped to various hydraulic motors and hydraulic cylinders throughout the machine and becomes pressurized according to the resistance present. The fluid is controlled directly or automatically by control valves and distributed through hoses, tubes, or pipes.
Hydraulic cylinderA hydraulic cylinder (also called a linear hydraulic motor) is a mechanical actuator that is used to give a unidirectional force through a unidirectional stroke. It has many applications, notably in construction equipment (engineering vehicles), manufacturing machinery, elevators, and civil engineering. A hydraulic cylinder is a hydraulic actuator that provides linear motion when hydraulic energy is converted into mechanical movement. It can be likened to a muscle in that, when the hydraulic system of a machine is activated, the cylinder is responsible for providing the motion.
Hydraulic motorA hydraulic motor is a mechanical actuator that converts hydraulic pressure and flow into torque and angular displacement (rotation). The hydraulic motor is the rotary counterpart of the hydraulic cylinder as a linear actuator. Most broadly, the category of devices called hydraulic motors has sometimes included those that run on hydropower (namely, water engines and water motors) but in today's terminology the name usually refers more specifically to motors that use hydraulic fluid as part of closed hydraulic circuits in modern hydraulic machinery.
Hydraulic fluidA hydraulic fluid or hydraulic liquid is the medium by which power is transferred in hydraulic machinery. Common hydraulic fluids are based on mineral oil or water. Examples of equipment that might use hydraulic fluids are excavators and backhoes, hydraulic brakes, power steering systems, automatic transmissions, garbage trucks, aircraft flight control systems, lifts, and industrial machinery. Hydraulic systems like the ones mentioned above will work most efficiently if the hydraulic fluid used has zero compressibility.
Hydraulic brakeA hydraulic brake is an arrangement of braking mechanism which uses brake fluid, typically containing glycol ethers or diethylene glycol, to transfer pressure from the controlling mechanism to the braking mechanism. During 1904, Frederick George Heath (Heath Hydraulic Brake Co., Ltd.), Redditch, England devised and fitted a hydraulic (water/glycerine) brake system to a cycle using a handlebar lever and piston. He obtained patent GB190403651A for “Improvements in hydraulic actuated brakes for cycles and motors”, as well as subsequently for improved flexible rubber hydraulic pipes.
Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
RhôneThe Rhône (rəʊn , ʁon) is a major river in France and Switzerland, rising in the Alps and flowing west and south through Lake Geneva and southeastern France before discharging into the Mediterranean Sea. At Arles, near its mouth, the river divides into the Great Rhône (le Grand Rhône) and the Little Rhône (le Petit Rhône). The resulting delta forms the Camargue region. The river's source is the Rhône Glacier, at the east edge of the Swiss canton of Valais.
Cross-validation (statistics)Cross-validation, sometimes called rotation estimation or out-of-sample testing, is any of various similar model validation techniques for assessing how the results of a statistical analysis will generalize to an independent data set. Cross-validation is a resampling method that uses different portions of the data to test and train a model on different iterations. It is mainly used in settings where the goal is prediction, and one wants to estimate how accurately a predictive model will perform in practice.
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.
Banking in SwitzerlandBanking in Switzerland dates to the early eighteenth century through Switzerland's merchant trade and has, over the centuries, grown into a complex, regulated, and international industry. Banking is seen as emblematic of Switzerland. The country has a long history of banking secrecy and client confidentiality reaching back to the early 1700s. Starting as a way to protect wealthy European banking interests, Swiss banking secrecy was codified in 1934 with the passage of the landmark federal law, the Federal Act on Banks and Savings Banks.
Space complexityThe space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely. This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space. Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as etc.
Parameterized complexityIn computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input.
ComplexityComplexity characterises the behaviour of a system or model whose components interact in multiple ways and follow local rules, leading to non-linearity, randomness, collective dynamics, hierarchy, and emergence. The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of emergence greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of complex systems theory.
Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
Optimizing compilerIn computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.
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.
SwitzerlandSwitzerland, officially the Swiss Confederation, is a landlocked country located at the confluence of Western, Central and Southern Europe. It is bordered by Italy to the south, France to the west, Germany to the north and Austria and Liechtenstein to the east. Switzerland is geographically divided among the Swiss Plateau, the Alps and the Jura; the Alps occupy the greater part of the territory, whereas most of the country's population of 8.7 million are concentrated on the plateau, which hosts the largest cities and economic centres, including Zürich, Geneva and Basel.
Embarrassingly parallelIn parallel computing, an embarrassingly parallel workload or problem (also called embarrassingly parallelizable, perfectly parallel, delightfully parallel or pleasingly parallel) is one where little or no effort is needed to separate the problem into a number of parallel tasks. This is often the case where there is little or no dependency or need for communication between those parallel tasks, or for results between them. Thus, these are different from distributed computing problems that need communication between tasks, especially communication of intermediate results.
