Concepts
5,907Terms and methods explained by more than one lecturer. Each opens at the minute it is taught.
Engineering
264- BasisA set of linearly independent vectors that span a vector space.
- LinearizationApproximating a non-linear system with a linear system near a fixed point to determine its stability.
- Newton's methodAn iterative numerical method for finding successively better approximations to the roots of a real-valued function using tangent lines.
- Jacobian matrixA matrix of all first-order partial derivatives of a vector-valued function.
- Kalman filterAn optimal full-state estimator used to estimate the full state of a system from measurements and inputs.
- Eigenvalues and eigenvectorsA scalar lambda and a vector X such that multiplying the matrix Q by X yields lambda times X.
- ProjectionThe point along a line (or subspace) closest to a given vector.
- Rotation matrixA matrix that rotates any vector by an angle theta when multiplied by it.
- DimensionThe dimension of a space is the number of vectors in any basis for that space.
- State vectorA vector of complex numbers representing the quantum state of a system across different positions or bins.
- Null spaceThe null space of a matrix is the set of all solutions to the homogeneous equation Ax = 0.
- SpanThe set of all linear combinations of a given set of vectors.
- Gaussian eliminationAn algorithm for solving systems of linear equations through a sequence of row operations.
- SparsityA structural property of a matrix where a large number of its entries are zero.
- Transition matrixA matrix used to describe the probabilities of transitions between states in a Markov chain.
- Branch and boundAn algorithm design paradigm for discrete and combinatorial optimization problems that systematically enumerates candidate solutions.
- Instruction set architectureThe interface or contract between the hardware and the software that specifies what the programmer assumes the hardware will satisfy.
- Branch predictionA mechanism where the CPU tries to predict what branch a program will take and fills in the pipeline with its instructions.
- Matrix exponentialThe matrix exponential is defined by the power series I + At + 1/2!A²t² + …, analogous to the scalar exponential series.
- Processing-in-memoryComputing inside the memory chips to process data close to where it is stored.
- CacheA smaller, faster memory component used to store frequently accessed data for quicker retrieval.
- ContrapositiveAn equivalent logical statement formed by negating both parts of an implication and reversing their order, specifically if Q is not true then P is not true.
- Linear quadratic regulatorAn optimal control problem for a linear system with a quadratic cost function.
- Temporal localityThe principle that if you access an address, you are very likely in the near future to access it again.
- Truth tableA table that shows the logical output of a circuit for each possible input combination.
- Impulse responseThe output of a dynamical system when presented with a brief input signal, characterizing the system's behavior.
- Model predictive controlA control method using a dynamic model of the system to predict and optimize future behavior over a rolling time horizon.
- PrefetchingA technique to automatically anticipate and load needed memory addresses before they are requested to reduce latency.
- Spatial localityAccessing memory locations close to recently accessed locations.
- BlockingFetching an entire block of data instead of a single word to amortize the latency cost over multiple items.
- Stochastic matrixA non-negative matrix where all columns sum to one, representing a linear transformation of a probability vector.
- ViscosityA fluid property describing internal friction and forces parallel to fluid flow against boundaries.
- Lyapunov functionA scalar function used to prove the stability of an equilibrium point of a dynamical system.
- Finite state machineA model of computation consisting of a set of states, a start state, an input alphabet, and a transition function that maps input and current states to a next state.
- Memory hierarchyA structure of different memory types in a computer organized by capacity, speed, and cost, resembling a funnel from large/slow storage to fast/small processor storage.
- Complementary slacknessA condition relating the optimal primal and dual solutions in linear programming where either a variable is zero or its corresponding constraint is tight.
- DecoderA combinational logic block that acts as an input pattern detector with n inputs and outputs where exactly one output is active for each input pattern.
- Mass matrixA positive definite matrix mapping generalized accelerations to generalized forces, representing the inertial properties of the system.
- Open-loop controlA control strategy where the control input is computed based on a model without using sensor measurements of the output to correct for errors.
- StrideThe distance between consecutive elements of a data structure accessed in memory.
- Trajectory optimizationA specific problem of selecting a sequence of states and actions that optimize some outcome.
- Transfer functionA mathematical representation that maps system inputs to outputs in the frequency domain.
- EllipsoidA four-dimensional region in defined by the inequality (π |z₁|²)/a + (π |z₂|²)/b ≤ 1.
- Invariant setA set of states such that any trajectory starting in the set remains in the set for all time.
- NullspaceThe nullspace of a matrix is the set of vectors that are mapped to zero.
- ReachabilityThe property that a state xi in can be reached from the origin by some prescribed control input u(t).
- Riccati equationA matrix equation whose solution gives the cost matrix S needed to determine the optimal control law in an LQR problem.
- AdaptabilityThe ability of an organism to endure environmental change, thrive in novel environments, spread to new habitats, and respond in new ways to surroundings.
- Calcite compensation depthThe depth in the ocean below which the rate of supply of calcium carbonate is outpaced by the rate of dissolution, such that no calcite is preserved.
- ControllabilityA system property where a control input matrix allows placing the closed-loop system eigenvalues anywhere or steering the state to any desired location.
- ConvectionHeat transfer through fluid motion driven by temperature differences, where hot fluid rises and cold fluid sinks.
- Convex hullThe set of all convex combinations of points in a given set.
- DualityA foundational concept in optimization relating primal problems and their dual formulations through weights and constraints.
- Extravehicular activityActivities performed by astronauts outside of a spacecraft in space.
- Inertial measurement unitAn inertial measurement unit used for navigation and attitude determination on the spacecraft.
- Intersection of convex setsThe intersection of any two or more convex sets is always a convex set.
- Laplace transformA mathematical tool used to solve differential equations by transforming them into algebraic equations.
- Level setA set of points where a function takes on a constant value, corresponding to indifference curves in economics.
- Matrix-vector multiplicationAn operation where a matrix acts on a vector to produce another vector.
- OracleA black box that can answer membership queries for a specific language in a single step.
- Orthogonal transformationA linear transformation T that preserves lengths, meaning the norm of T(x) equals the norm of x for every vector x.
- PrecessionAn astronomical forcing cycle with a period of about 20,000 years that drives short-term climate and precipitation changes.
- RegisterThe smallest and fastest units of storage inside the CPU used to hold data currently being processed or calculated.
- Right inverseA matrix such that A A_right⁻¹ = I when the matrix has full row rank.
- Scalar multiplication of a vectorMultiplying a vector by a real number scales its magnitude and preserves or reverses its direction.
- Similarity transformationA transformation of a matrix that preserves its eigenvalues.
- State transition matrixA matrix that describes how the state vector of a system evolves from one time step to the next.
- TagA basic building block of HTML, typically consisting of an opening bracket, a word, and a closing bracket.
- Controllability matrixA matrix formed by concatenating powers of the system matrix multiplied by the input matrix, whose rank determines if the system is controllable.
- Content addressable memoryA specialized memory type that searches its contents based on input data rather than a memory address, used in caches to match tags.
- Phase portraitA geometric representation of the trajectories of a dynamical system in the phase plane.
- Systems engineeringAn interdisciplinary approach and means to enable the realization of successful systems, focusing on management, requirements, and complex technical integration.
- Asymptotic stabilityA system is asymptotically stable if the inner product of the forces and velocity is negative for non-zero velocity.
- Block eliminationA method for solving partitioned linear equations by eliminating variables corresponding to structured sub-blocks.
- Cholesky factorizationA factorization of a Hermitian positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose.
- Convex optimization problemAn optimization problem where the objective and constraint functions are convex.
- Critical pathThe longest delay path in the combinational logic that determines the minimum clock cycle time.
- Forward kinematicsThe mapping from joint space to operational space, determining the position and orientation of the robot's end effector from given joint parameters.
- Homoclinic orbitA trajectory that connects a saddle fixed point to itself.
- LU factorizationThe factorization of any nonsingular matrix into a permutation matrix, a lower triangular matrix, and an upper triangular matrix.
- ResidualThe vector , which equals the negative gradient of at .
- Single program multiple dataSPMD is what happens when you run the same program on each processing element, where each takes care of a different chunk of the problem split up by using the rank.
- Thermal protection systemA system designed to protect a spacecraft from the extreme temperatures experienced during atmospheric reentry.
- Tikhonov regularizationA scalarized least-squares problem that adds a scaled norm penalty on the weights to regularize the solution.
- WarpA group of 32 threads in the GPU executed together.
- Back substitutionA method used after Gaussian elimination to solve for individual variables in a triangular system.
- Bang-bang controlA control strategy that switches abruptly between maximum and minimum limits at all times.
- Binary encodingAn encoding scheme that uses the minimum possible number of bits to represent states.
- Cache missAn instance where requested data is not found in the CPU cache, forcing a slower fetch from main memory.
- CirculationAn element in the null space of the node incidence matrix representing a circulating flow in a network.
- Conflict missA cache miss that occurs when multiple distinct memory blocks map to the same cache location and evict each other.
- Critically damped systemA system state where it returns to equilibrium as quickly as possible without oscillating, occurring when zeta equals one.
- Direct-mapped cacheA cache organization where each memory block maps to exactly one specific cache line.
- Field programmable gate arrayAn FPGA is a software-reconfigurable hardware substrate containing reconfigurable functions, interconnections, and input/output interfaces.
- Fully associative cacheA cache organization where any memory block can be placed in any cache line.
- Hit rateThe percentage of memory accesses that successfully find their data in the cache rather than missing.
- Interior point methodAlgorithms that travel inside the feasible set rather than around the edges to solve optimization problems.
- Inverse kinematicsInverse kinematics gives you the required joint angles given a desired position for the hand.
- Jordan blockAn upper bidiagonal square matrix with repeated eigenvalues on the diagonal and ones on the superdiagonal.
- KinematicsThe study of motion of robotic systems without considering the forces that cause the motion.
- Krylov subspaceA subspace spanned by powers of a matrix applied to a vector, used in iterative methods to approximate solutions.
- Lagrange equationsEquations describing the dynamic behavior and motion of a robot as a function of applied torques through kinetic and potential energy.
- Linear quadratic GaussianA control problem with linear dynamics, quadratic cost functions, and additive Gaussian noise where the separation principle applies.
- Lookup tableA memory array used to perform logic functions where each address acts as a row in the truth table and each data bit stores the corresponding output value.
- Low rank approximationGetting an approximation of a full-rank matrix that is low rank to allow fast multiplications and efficient computations.
- Matrix normThe maximum gain of a matrix, defined as the square root of the largest eigenvalue of A transpose A.
- MetastabilityA third possible state of cross-coupled inverters where both outputs oscillate between 0 and 1 before eventually settling.
- MultiplexerA circuit that selects one of the N inputs to connect to the output based on a control input.
- Out-of-order executionA paradigm where a processor executes instructions in an order determined by data availability rather than the program's original sequence.
- Paleocene-Eocene thermal maximumA rapid global warming event driven by a massive release of carbon dioxide into the atmosphere approximately 56 million years ago.
- Semantic gapHow close instructions and data types are to a high-level programming language.
- Set-associative cacheA cache organization where each memory address can be placed in any of a fixed number of blocks within a specific set.
- Spectral normThe maximum singular value of a matrix, defined as the square root of the largest eigenvalue of X transpose X.
- State transferThe process of steering a system's state from an initial state at a given time to a desired state at a future time.
- State-space representationA mathematical model of a physical system as a set of input, output and state variables related by first-order differential equations.
- Stored program computerA computer model where instructions are stored in memory alongside data.
- Superscalar executionFetching, decoding, executing, and retiring multiple instructions per cycle.
- Address translationThe cooperative mechanism by system software and hardware that maps virtual memory addresses to physical memory addresses.
- Angle between vectorsThe angle between two nonzero vectors is the inverse cosine of their dot product divided by the product of their lengths.
- Angle of attackThe angle between the reference line of a body and the vector representing the motion of the body through the fluid.
- Aspect ratioThe ratio of the largest dimension to the smallest dimension of a particle used to describe its shape.
- BackpressurePausing operator execution when buffers are full or when waiting for remote I/O to prevent memory from ballooning.
- Backtracking line searchA line search method starting at t equals 1 and repeatedly multiplying by beta until the Armijo condition is satisfied.
- Backward designA curriculum design method starting with learning objectives and designing assessments before the instructional content.
- Basin of attractionThe set of initial conditions that lead to a particular attractor, such as a rolling or standing fixed point.
- Block matrix multiplicationA method of multiplying partitioned matrices in smaller sub-blocks that improves cache efficiency and performance.
- BreakpointA point in a program where execution is stopped to allow for examination of memory and register values.
- Cache hierarchyUsing multiple levels of caches, like level one and level two, to balance the need for fast single-cycle access and large cache capacity.
- Capacity missA cache miss that occurs because the cache is too small to hold all the memory blocks being accessed, even if the cache were fully associative.
- Center of pressureThe point on the ground where the resultant of all ground reaction forces acts, connected intimately to center of mass dynamics.
- Chance constraintConstraints that bound the probability of constraint violation below some scalar value alpha.
- Change of coordinatesRescaling coordinates to relate different physical variables like and in the harmonic oscillator.
- CliqueA set of vertices in a graph that are all pairwise connected with each other.
- Clock algorithmAn approximation of the LRU page replacement algorithm used by modern systems.
- Common sub-expression eliminationAn optimization that identifies identical sub-expressions in a query plan and computes them only once, sharing the result.
- CompressionFields amenable to compressive mathematical description where you write down short equations capturing the essence of a phenomenon.
- Computer programFrom a processor's perspective, a program is just a list of processor instructions.
- Condition codesSuffixes on conditional jumps and conditional moves that indicate which flags in the RFLAGS register to check.
- Conditional branch instructionAn instruction in LLVM IR that takes a boolean predicate and two basic-block labels to route control flow.
- Conservative systemsSystems in which energy is conserved between kinetic and potential energy without loss to friction or external forces.
- Controllability GramianA matrix that describes the quadratic form telling how hard it is to hit any point in state space with infinite leisure.
- Convex relaxationReplacing discrete constraints like binary variables with continuous bounds between 0 and 1 to make the problem convex.
- Cosmogenic nuclide datingDating records by correlating cosmogenic isotopes like in ice and in wood.
- Critical design reviewA major review phase where approximately 90% of vehicle drawings are released and frozen, making changes very expensive.
- De Morgan's lawRules that allow turning an and into an or (or vice versa) by moving the negation inward across the logical operator.
- DeconvolutionThe process of reversing the optical convolution or blur in an image if the point spread function is known.
- Defective matrixA matrix that is not diagonalizable because it lacks a full set of linearly independent eigenvectors.
- Determinant of a 2x2 matrixThe quantity ad - bc for a 2x2 matrix [a b; c d], which determines invertibility.
- DilatationStretching or scrunching something along the axes.
- Disturbance rejectionThe ability of a feedback control system to attenuate the effects of external disturbances on the system output.
- Dynamical systemA system described by a set of states (like heads or tails for a coin) that evolve over time.
- EigenspaceThe null space of , representing the span of steady state vectors corresponding to an eigenvalue of 1.
- EqualizationSubtracting a corrupted measurement component to compensate for distortion in a signal.
- Error budgetAn agreed-upon limit on how long a service can be unreliably functioning or down within a period.
- EustasyThe globally averaged value of sea level change, serving as a direct measure of ice volume.
- Execute phaseThe phase where a client transaction performs all its required reads and writes on primary servers.
- False negativeThe probability of selecting hypothesis 1 when the sample was actually generated by distribution 2.
- Feedback controlAdding a control input based on measured states to manipulate a system's behavior and eigenvalues.
- Flash memoryAn electronic non-volatile computer memory storage medium that can be electrically erased and reprogrammed.
- Flight control systemThe system comprising primary and backup software loads that control the spacecraft's attitude and trajectory.
- ForaminiferaBenthic foraminifers are marine organisms that live in brackish water where environmental conditions are conducive.
- FormalizationFormalization involves the addition of more structure to what you are working on by clearly articulating why and how you are performing it.
- Freeze valveA valve that melts when the temperature increases to drain the fuel to a drain tank.
- Full state feedbackThe requirement that the controller must know the exact current state of the system in order to execute the control action.
- FunctionalismThe view that phenomena can exist and be evaluated at the level of high-level rules or strategies independently of their underlying physical or code implementation.
- FunnelA time-varying Lyapunov function region around a trajectory that guarantees convergence to a target set.
- Global boundary Stratotype section and pointAn internationally agreed upon reference point on a stratigraphic section which defines the lower boundary of a stage on the geologic time scale.
- Gram-Schmidt procedureAn algorithm that takes a set of independent vectors and generates an orthonormal basis spanning the same subspace.
- HapticsHaptics comes from the Greek word describing the sense of touch, allowing haptic interaction with virtual or real environments.
- HazardA system state or condition that, together with the worst-case environment, will result in a loss.
- HydrazineA propellant and chemical compound used in aerospace systems that can leave corrosive residues when exposed to moisture.
- HyperplaneA set of the form {x | } where a is non-zero.
- Hypothesis testingA statistical method to decide between multiple possible models or distributions based on observed samples.
- Indirect addressing modeAn addressing mode where the calculated memory address points to a location containing the actual address of the data.
- InertiaResistance of any physical object to any change in its velocity.
- Integer linear programmingA linear programming variant where variable values are additionally constrained to be integers, making the problem NP-complete.
- Interface control documentDocuments that define and control the technical interfaces between different system modules, stages, or contractors.
- IrisAn iterative procedure that solves optimization problems to find big polytopes and then ellipses filling them up to generate big collision-free regions in configuration space.
- Irregular parallelismA problem where data structures are sparse or control structures are not basic for-loops, making parallelization difficult.
- Isostatic reboundThe rise of land masses that were depressed by the huge weight of ice sheets during the last glacial period.
- JammingA phenomenon where particles like rice or ants form bridge-like structures and get stuck together under high flow conditions.
- Joint spaceThe native space of the manipulator where motion and via points are planned directly using joint configurations.
- Jordan formThe nicest, most diagonal-like matrix in a family of similar matrices that shares the same eigenvalues.
- KKT matrixA block matrix that arises from the first-order optimality conditions of a constrained quadratic optimization problem.
- Laplace transform of a derivativeThe Laplace transform of the derivative of x is s times the Laplace transform of x minus the initial conditions.
- Large behavior modelsLarge-scale machine learning models trained on data to output robot behaviors and actions.
- Level of abstractionThe degree of detail in describing hardware, ranging from low-level gate implementations to high-level behavioral descriptions.
- Line searchA step in optimization that determines the positive step size t along a given search direction.
- LQRLinear Quadratic Regulator, a control strategy for linear systems with quadratic cost functions.
- Machine codeBinary- or hex-encoded instruction representations executed directly by computer hardware.
- Marine ice sheet instabilityA process where slightly warmer water melts the base of an ice shelf and causes the grounding line to retreat, increasing the ice flux.
- Matrix-matrix multiplicationThe composition of two linear operators represented as the product of their corresponding matrices.
- MicroprocessorAn entire computer processor integrated on a single piece of silicon using transistors.
- Min-termsA canonical product term in Boolean logic that evaluates to 1 for a single combination of input variables.
- Minimal elementAn element in is minimal if there is no other element in distinct from that is smaller than .
- Molten salt reactorA nuclear reactor in which the primary nuclear fuel is dissolved in molten fluoride salt rather than water.
- Monic polynomialA single-variable polynomial in which the leading coefficient is equal to one.
- MOS transistorA type of transistor that operates based on capacitive switching, requiring charge to change states.
- Multi-level page tableA hierarchical organization of page tables where only some parts are allocated in physical memory to save space.
- Natural frequencyThe frequency at which a mass and spring system will vibrate when pulled and let go, determined by k and m.
- Observation modelA function that maps the state vector to a vector of observations.
- Open circuit voltageThe voltage measured across a circuit's terminals when no current is flowing through them.
- Optimal solutionAn optimal solution is a point satisfying all constraints that achieves the smallest objective value among all feasible vectors.
- Orbital precessionThe wobble of the Earth's axis of rotation that influences insolation variability and tropical African climate.
- OverloadingOverloading occurs when two methods have the same name but different signatures.
- Page table entryData structures in the operating system that store the mapping between virtual addresses and physical addresses.
- PaleoclimatologyThe study dedicated to finding out what happened to past climate, when it happened, and why it happened.
- Perron-Frobenius eigenvalueThe largest eigenvalue of a non-negative matrix, which is associated with a positive eigenvector.
- Perspective functionA mathematical technique showing that non-negative scaling of a convex set or function preserves convexity.
- Phase planeA two-dimensional plane with axes representing phase variables, used to visualize vector fields of a system.
- PID controllerA control loop mechanism widely used in industrial control systems to keep variables like pressure, temperature, and concentration constant.
- Pipeline stagesThe five functional steps of execution in the MIPS processor architecture: Fetch, Decode, Execute, Memory, and Write-back.
- Pipeline stallWhen an instruction cannot move to the next stage, requiring previous stages to be held and no-ops to be inserted.
- PipeliningThe ability to take two or more programs and stick them together end-to-end so data flows automatically from one to the next.
- PivotAnother name for a leading coefficient in a matrix.
- Polynomial time algorithmAn algorithm where the number of operations is bounded by a polynomial of the input size measured in bits.
- PolytopeA geometric object with flat sides formed by the intersection of half-spaces defined by linear inequalities.
- Position representationAlternative coordinate systems such as Cartesian, cylindrical, or spherical used to specify a position.
- Potential functionA scalar function whose negative gradient gives the vector field of a dynamical system.
- PreconditioningChanging coordinates to make the spectrum of the system matrix clustered so that the conjugate gradient algorithm converges faster.
- Process noiseAn unknown disturbance or noise added to the state equation of a dynamical system.
- Quadratic programAn optimization problem with a quadratic objective function and linear constraints, which can be solved efficiently and reliably.
- Quadratic surfaceA surface in three-dimensional space defined by a polynomial equation of degree two involving monomials of degrees zero, one, and two.
- Rate controlA static optimization problem of assigning rates to flows in a network subject to link capacity constraints.
- Reachable setThe set of all states that can be reached from a given state or tree within a specific time bound or step.
- Reaction control systemA subsystem of thrusters used to provide attitude control and small velocity changes in spacecraft.
- Receiver operating characteristicAn analysis method used to evaluate diagnostic methods where an AUC of 0.7 to 0.8 indicates a test with good diagnostic potential.
- Recursive least squaresAn algorithm to compute least-squares estimates sequentially as new measurements arrive over time without recomputing the entire sum.
- Reflection matrixA 2 by 2 matrix with determinant -1 that reflects a vector across a line at angle theta over two.
- Relatively primeTwo numbers a and b are relatively prime if their greatest common divisor is equal to 1.
- Ridge regressionAn optimization problem involving the minimization of the L2 norm subject to linear equality constraints.
- Robustness (margin)A property where two points with different labels must be separated by a minimum distance called the margin.
- RoundingQuickly searching and turning fractional convex relaxation solutions into discrete binary path solutions.
- Row echelon formA matrix form where leading terms can be any nonzero real number and only require zeros below the leading term in its column.
- Row reduced echelon formA specific form of a matrix where all non-zero rows are above all zero rows and leading entries satisfy specific properties.
- Row-major orderA method of storing multi-dimensional arrays in linear memory where consecutive elements of a row are stored contiguously.
- S procedureA technique to test if an implication holds by adding a multiplier polynomial to fight negative values outside a region.
- SapropelsOrganic-rich sediment layers accumulated in the Mediterranean during periods of high Nile River outflow and anoxic bottom conditions.
- Second-order cone programmingAn optimization problem that minimizes a linear objective function subject to second-order cone constraints.
- Semidefinite programA generalization of linear programs where the variables are symmetric matrices constrained to be positive semidefinite.
- Sequential executionThe processor fetches instructions from memory sequentially by fetching one, decoding and executing it, and continuing with the next.
- Sherman-Morrison-Woodbury formulaA formula that computes the inverse of a rank-k perturbation of a matrix using the inverse of a smaller k-by-k matrix.
- Sigma notationA shorthand way to write out a sum of terms by incrementing an index from a starting value to an ending value.
- Sign extensionReplicating the top bit of a binary value for the remaining higher-order bits to preserve its signed value.
- Simplex algorithmAn algorithm used to execute on example inputs in linear programming that runs in worst-case exponential time.
- Skew-symmetric matrixA square matrix that is equal to its negative transpose, used here to represent the cross product operator as a matrix multiplication.
- Sparse LU factorizationThe ability to explicitly decompose a sparse matrix into the product of a lower triangular and an upper triangular matrix.
- Speed of light limitThe threshold where escaping requires exceeding the speed of light, represented by 45-degree light cones.
- Square-cube lawWhen shapes are scaled by a factor of , areas increase by a factor of and volumes scale by a factor of .
- StabilizabilityA system is stabilizable if and only if all of its unstable eigenvectors of A are in the controllable subspace.
- Stable limit cycleA closed trajectory in phase space toward which neighboring trajectories converge over time.
- State estimatorA system that estimates the internal states of a dynamical system from measurements of its outputs.
- Static schedulingThe process where the compiler schedules instructions at compile time rather than the hardware doing it at runtime.
- Stefan-Boltzmann lawThe mathematical relationship relating incoming stellar radiation to outgoing thermal radiation emitted by a planet.
- Support functionA function that maps a direction to the maximum value of the inner product of that direction with points in a convex set.
- TLB flushThe act of clearing the TLB entries, typically required when switching page tables to prevent the use of stale translations.
- TomographyImaging by sections or slicing, using measurements from different parts of a body to recover an underlying image.
- Trajectory generationTrajectory generation involves planning smooth paths in joint space or Cartesian space with constraints on velocity and acceleration.
- Transient stateA state vector whose length shrinks away over time when multiplied repeatedly by a matrix because its eigenvalue is less than 1.
- Triple point of waterThe thermodynamic state below which water cannot flash evaporate anymore under decreasing pressure.
- Uncanny ValleyA psychological phenomenon where computer graphics or images that appear almost human, but not quite, elicit feelings of eeriness or revulsion.
- Van der Pol oscillatorA non-conservative oscillator with non-linear damping governed by a second-order ordinary differential equation.
- Virtual addressAn address generated by each instruction in a program, distinct from the physical address used in main memory.
- ZonotopeAn H-polyhedron that is the affine projection of the unit box.