Manufacturer glossary entry describing inelastic-scattering spectra.

Manufacturer glossary entry explaining characteristic X-ray energy analysis.

Manufacturer-authored technical explanation of the helium mixture, dilution unit, mixing chamber, still and heat exchangers. This is a primary description of the operating principle, not a comparative product recommendation. No personal author or revision date inferred.

By Benjamin Thompson, credited as Benjamin Count of Rumford. Philosophical Transactions of the Royal Society of London 88, 80–102. DOI: doi.org/10.1098/rstl.1798.0006. Original paper scan hosted by the University of Notre Dame; read 25 January 1798. Inspected Experiment No. 3 and the metal-chip/strip calorimetry control near the beginning. OCR is imperfect; the experiment number is the primary locator.

By Duncan Haldane, credited as F. D. M. Haldane. Physical Review Letters 47, 1840–1843. Published 21 December 1981. Inspected abstract: long-wavelength density fluctuations give a universal low-energy description of one-dimensional Bose and Fermi fluids, with renormalized parameters. The publisher record links an erratum, Physical Review Letters 48, 569 (1982); no claim to full-text access is made.

By Lars Onsager. Physical Review 37, 405–426. Published 15 February 1931. The abstract and §§1–2 explain coupled irreversible processes and the derivation from microscopic reversibility; §7 states limitations with imposed magnetic fields and rotation.

Institutional apparatus description: cdac.carnegiescience.edu/facilities/carnegie-facilities/brillouin-spectroscopy-lab

The laboratory describes inelastic scattering by elastic waves, frequency shifts, and tandem Fabry–Pérot analysis.

Lamport's bakery algorithm is a mutual exclusion concurrent algorithm in which each participating process chooses a numbered ticket before entering a critical section. Process $i$ announces that it is choosing, sets its ticket to one more than the largest observed ticket, and finishes choosing. It then waits for each other process to finish choosing and for every smaller nonzero pair $(\text{ticket},\text{process identifier})$ to leave. Comparing identifiers breaks ties between equal tickets; setting one's ticket to zero announces departure.^[ref]

For example, simultaneous choices can give processes 2 and 5 the same ticket 7; pair $(7,2)$ precedes $(7,5)$. The choosing flag prevents treating an unfinished choice as an absent contender. Leslie Lamport's 1974 proof even permits an overlapping read to return an arbitrary value under the specified shared-register model. The mathematical model uses unbounded tickets; a bounded machine implementation must also address overflow and its memory model.^[ref]

Camera calibration estimates the parameters relating points in a scene to measured image coordinates. In the ideal pinhole model,where $K$ contains focal lengths and the principal point, while the rotation matrix $R$ and translation $t$ locate the camera relative to the scene. Lens distortion requires additional parameters.^[ref]

A calibration experiment photographs a flat board with a known grid from several orientations. Detected grid corners provide image measurements; their known spacing supplies geometric constraints and a length scale. Parameters are fitted by minimizing reprojection error. Multiple orientations help separate camera geometry from board pose. For an ideal camera with focal length 1000 pixels, a point displaced $0.1\mathrm{m}$ sideways at depth $2\mathrm{m}$ projects 50 pixels from the principal point.^[ref]

Stereo vision estimates three-dimensional structure from images taken at different viewpoints. After camera calibration and alignment into a common image geometry, a point's horizontal displacement between the two views is its stereo disparity $d$. For parallel ideal cameras with camera baseline $B$ and focal length $f$ in pixel units, similar triangles giveFor $f=800$ pixels, $B=0.10\mathrm{m}$ and $d=40$ pixels, the inferred depth is $2\mathrm{m}$. Doubling the depth halves the stereo disparity, making distant structure harder to measure accurately.^[ref]

A practical apparatus uses two rigidly mounted cameras, a calibration target and synchronized exposures. Matching the same physical feature is essential: repeated textures, hidden surfaces and motion can give false correspondences. The measurement is therefore geometric inference from matched observations, not an intrinsic depth label stored in each pixel.^[ref]

OpenCV is a software library for computer vision and image processing. Its camera-geometry tools connect observed pixel coordinates to models of imaging, including camera calibration, correction of lens distortion, stereo rectification and three-dimensional reconstruction.^[ref]

A checkerboard calibration target supplies known geometry that can be observed from several camera positions. Fitting the model compares detected image points with projected target points. The resulting reprojection error measures agreement in the image, rather than independently confirming every physical dimension of the reconstructed scene.

A simple perspective projection illustrates the distinction: in $u=fX/Z$, replacing $X$ and $Z$ by $kX$ and $kZ$ for $k>0$ leaves $u$ unchanged. This scale ambiguity of perspective projection means that image agreement alone cannot verify a chosen unit of length. A camera baseline or a target of known size supplies additional metric information. Using the library well therefore includes checking geometric assumptions and units, alongside the numerical fit.

A numerical simulation evolves or solves a mathematical model by numerical approximation to study its predicted behavior. Its outputs combine the model assumptions with the properties of the discretization and implementation.

For the decay equation $y^{\prime }=-ky$, $k>0$, explicit Euler gives $y_{n+1}=(1-kh)y_n$. If $0<kh<1$, positive values decay monotonically; if $1<kh<2$, the approximation alternates sign even though its magnitude decreases. The exact solution remains positive for positive initial data. This shows that bounded numerical output can still contain behavior absent from the model, so convergence checks and physical interpretation must accompany a simulated trajectory.

A glyph index is a numerical identifier for a glyph inside a particular computer font. It identifies an entry in that font's own glyph collection, rather than a Unicode code point. In an OpenType computer font, the cmap table maps character codes to default glyph indices; unavailable characters map to index zero, whose special .notdef glyph indicates missing coverage.^[ref]

For a hypothetical example, one computer font might map U+0041 to index 37 while another maps the same character A to index 9. Both can display the correct letter. Carrying index 37 from the first computer font into the second can select an unrelated form. A later glyph substitution can also change the selected glyph index while leaving the underlying text characters unchanged. This distinction matters in rendering caches and when exchanging shaped text between systems.

OpenType is a table-based computer font format separating glyph representations, character mapping, measurements, naming metadata and optional layout rules. Its cmap table selects default glyph indices for encoded text characters; substitution and positioning tables support more elaborate text shaping.

An OpenType computer font can contain TrueType outlines or Compact Font Format outlines, and the specification also provides for bitmap and other glyph representations. The file format therefore does not prescribe a single kind of outline geometry. Extensions such as .ttf and .otf are useful conventions, but the actual table contents determine the available representation.^[ref]

This organization lets one system answer separate questions: which glyph represents this text, how much space should it occupy, and how should it be drawn at this size? A language's contextual forms can change the first answer without changing the original Unicode text.

TrueType is a computer font technology whose glyph outlines use quadratic Bézier curves and straight segments. The stored coordinates describe a scalable design in font units. Rendering scales that geometry to the requested size and applies rasterization to obtain pixels.

At small display sizes, geometrically accurate scaling can place important strokes between pixels. Font hinting supplies instructions that adjust the scaled outline relative to the output grid, helping preserve recognizable strokes and spacing. A small capital letter can therefore require more than shrinking a large image: the useful result depends on the relation between its geometry and the pixel grid.^[ref]

TrueType outlines can be stored in an OpenType computer font. The outline technology and the larger table-based file format describe different layers of the same rendering system.

A font unit measures distances in a computer font's design coordinates. If one em contains $U$ font units, a coordinate difference $q$ represents $q/U$ of an em. OpenType stores $U$ in the unitsPerEm field of its font-header table; its permitted range is 16–16384.^[ref]

The design coordinate is independent of a particular screen. Before grid fitting, an unrotated uniform scale with $p$ pixels per em sends a horizontal length $q$ toFor example, $U=2048$ and $p=12$ send a length of 512 font units to 3 pixels. Doubling the requested font size doubles that ideal geometric length without changing the stored outline.

A font unit is consequently not itself a pixel. Grid fitting can further change a scaled outline or its glyph advance to suit the pixel grid. Nor does the height of every visible glyph equal one em: the em fixes a scale, while individual glyphs have their own bounding boxes.

A font metric is a numerical measurement used to position text from a computer font. Measurements include glyph advances, glyph bearings, bounding boxes and face-level quantities such as font ascent, font descent and font line gap. These describe both logical movement and the geometry of the visible shapes.^[ref]

For a horizontal example, put the pen position at $x=0$, let a glyph have advance 12, and let its ink extend from $x=-2$ to $x=9$. Its ink width is $9-(-2)=11$, while the next pen position is $x=12$. The negative left glyph bearing describes an overhang; it does not imply a negative glyph advance.

A separate example illustrates vertical conventions. With font ascent $a=12$, signed descent $d=-3$ and font line gap $g=2$, the metric-based baseline separation isSome font formats store the descent magnitude with the opposite sign, so the convention must be checked before using the formula.^[ref] These measurements inform layout before rasterization determines the actual pixels.

Pseudorandomness means that specified tests cannot effectively distinguish a generated distribution from a genuinely random reference distribution. The allowed tests and their advantage are part of the definition. Passing a few frequency tests does not imply security against every feasible computation.

A pseudorandom generator expands a uniformly chosen $s$-bit seed to $m>s$ bits. For a test $D$, its distinguishing advantage isHere $U_k$ denotes a uniformly sampled $k$-bit string. There are at most $2^s$ generated strings, so an unrestricted test for membership in the generator's range distinguishes with advantage at least $1-2^{s-m}$. The useful claim is therefore computational indistinguishability for a restricted test class, not equality of the two distributions. Such a generator can replace random choices in an algorithm when the relevant computation is among the tests it fools.^[ref]