Structural integrity and failureStructural integrity and failure is an aspect of engineering that deals with the ability of a structure to support a designed structural load (weight, force, etc.) without breaking and includes the study of past structural failures in order to prevent failures in future designs. Structural integrity is the ability of an item—either a structural component or a structure consisting of many components—to hold together under a load, including its own weight, without breaking or deforming excessively.
CW complexA CW complex (also called cellular complex or cell complex) is a kind of a topological space that is particularly important in algebraic topology. It was introduced by J. H. C. Whitehead to meet the needs of homotopy theory. This class of spaces is broader and has some better properties than simplicial complexes, but still retains a combinatorial nature that allows for computation (often with a much smaller complex). The C stands for "closure-finite", and the W for "weak" topology.
Passive nuclear safetyPassive nuclear safety is a design approach for safety features, implemented in a nuclear reactor, that does not require any active intervention on the part of the operator or electrical/electronic feedback in order to bring the reactor to a safe shutdown state, in the event of a particular type of emergency (usually overheating resulting from a loss of coolant or loss of coolant flow).
Dual systemIn mathematics, a dual system, dual pair, or duality over a field is a triple consisting of two vector spaces and over and a non-degenerate bilinear map . Duality theory, the study of dual systems, is part of functional analysis. It is separate and distinct to Dual-system Theory in psychology. Pairings A or pair over a field is a triple which may also be denoted by consisting of two vector spaces and over (which this article assumes is the field either of real numbers or the complex numbers ).
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.
Mathematical proofA mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".
Spectrum of a ringIn commutative algebra, the prime spectrum (or simply the spectrum) of a ring R is the set of all prime ideals of R, and is usually denoted by ; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings . For any ideal I of R, define to be the set of prime ideals containing I. We can put a topology on by defining the to be This topology is called the Zariski topology. A basis for the Zariski topology can be constructed as follows. For f ∈ R, define Df to be the set of prime ideals of R not containing f.
Track transition curveA transition curve (also, spiral easement or, simply, spiral) is a spiral-shaped length of highway or railroad track that is used between sections having different profiles and radii, such as between straightaways (tangents) and curves, or between two different curves. In the horizontal plane, the radius of a transition curve varies continually over its length between the disparate radii of the sections that it joins—for example, from infinite radius at a tangent to the nominal radius of a smooth curve.
Extended Euclidean algorithmIn arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that This is a certifying algorithm, because the gcd is the only number that can simultaneously satisfy this equation and divide the inputs. It allows one to compute also, with almost no extra cost, the quotients of a and b by their greatest common divisor.
