An alternating path in a matching $M$ is a graph path whose successive edges alternate between membership in $M$ and membership outside $M$. Here graph paths have no repeated vertices. Alternation alone does not make a graph path an augmenting path in a matching: its endpoints must both be unmatched vertices in a matching. For example, relative to $M=\{(2,3),(4,5)\}$ in the six-vertex path graph, $2,3,4,5$ alternates but has matched endpoints; toggling just those three edges loses one selected edge.

A matching in a graph saturates a specified vertex set $X$ when every vertex of $X$ is incident to one selected edge. Exactly one selected edge meets each such vertex, since matching edges have disjoint endpoints. Vertices outside $X$ may remain unmatched. A perfect matching saturates the entire vertex set; Hall's marriage theorem tests matching saturation of a specified side in a finite bipartite graph.

A vertex is an unmatched vertex in a matching $M$ if no edge of $M$ is incident to it. It is also called free or exposed, always relative to the specified matching in a graph: changing $M$ can change which vertices are free. The endpoints of an augmenting path in a matching must be distinct unmatched vertices in a matching before the change.

Mei-Sywe Hwang is identified as a statistician at the Center for Measurement Standards in Hsinchu, Taiwan, in a 1993 conference paper reprinted by NIST in 1994. The coauthored report examines electronic balances for gravimetric measurements, including solid and liquid density, pycnometer calibration and mass. Its examples connect a physical instrument's readings with corrections and uncertainty in an inferred quantity.^[ref]

The byline establishes her participation and historical affiliation; it does not identify an individual contribution to each experiment or establish later positions. The technical setting illustrates why measurement error and calibration are substantive parts of applied statistical work.

Shalabh works on statistical models whose assumptions reflect complications in observed data. His IIT Kanpur research page lists linear regression, econometrics, measurement-error models, missing-data models, panel-data models, restricted regression, spatial models and sampling theory.^[ref]

These subjects meet in a practical distinction: an observed variable need not equal the scientific quantity intended by the model. An errors-in-variables model describes noisy predictors, a missing-data model describes unobserved measurements, and a panel-data model represents repeated observations from the same units. Explicitly modelling those features separates uncertainty about the measurement process from uncertainty about regression parameters.

Identity and homepage: Shalabh's institutional homepage.

A researcher who coauthored an account of IP3 receptor activation, relating receptor structure, ligand action and cytosolic calcium regulation. The work distinguishes a channel’s capacity to open from the interacting signals that determine its behavior in a cell.^[ref]

Publication record: pubmed.ncbi.nlm.nih.gov/20980441/

A researcher who coauthored an account of IP3 receptor activation, relating receptor structure, ligand action and cytosolic calcium regulation. The work distinguishes a channel’s capacity to open from the interacting signals that determine its behavior in a cell.^[ref]

Homepage: www.phar.cam.ac.uk/research/taylor

Thomas J. Fellers is credited with Michael W. Davidson as an author of Linear Measurements (Micrometry) by Thomas J. Fellers and Michael W. Davidson, an educational account of quantitative optical microscopy. Its byline associates the authors with the National High Magnetic field Laboratory at Florida State University. ^[ref]

The account explains how a stage micrometer calibrates an eyepiece reticle. Matching a known specimen-plane length to reticle divisions converts an arbitrary scale into a physical measurement. Changing the objective lens changes that calibration, so magnification alone is insufficient for reliable microscopy. The article also discusses optical resolution and errors in locating scale edges. ^[ref]

A supercritical fluid is a fluid at temperature and pressure above its liquid-gas critical point. There is then no liquid–vapor coexistence boundary separating distinct bulk liquid and gas states. Density can change continuously from relatively gas-like to relatively liquid-like values along a suitable path.

This continuity does not mean that all supercritical states have identical properties. Density, compressibility, viscosity and solvent behavior can vary strongly, particularly near the critical region. Pressure can therefore tune a supercritical solvent's ability to dissolve material without crossing a boiling boundary. The absence of a liquid–vapor boundary applies to that transition; freezing or other transitions can still occur elsewhere in the phase diagram.

Take labels $E=\{a,b,c\}$ and vectors in the real vector space ${\mathbb{R}}^2$:Here is the complete independence check for all eight subsets. The empty set is independent. Each of $\{a\},\{b\},\{c\}$ is independent because its vector is nonzero. Every pair is independent: the determinants of the two-column matrices $[v_a{v}_b]$, $[v_a{v}_c]$, and $[v_b{v}_c]$ are respectively $1$, $1$, and $-1$. The triple is dependent because $v_c-v_a-v_b=0$. ThereforeDeleting elements from any listed subset stays in this list, verifying heredity. Every exchange comparison has sizes $(0,1)$, $(0,2)$, or $(1,2)$. From the empty set, any element of the larger matroid independent set works: this covers three singleton targets and three pair targets. From any singleton to any pair, every element of the pair outside the singleton works, since every resulting pair is independent. This covers all nine singleton-pair comparisons, including disjoint ones. There are no other comparisons: all fifteen ordered size-increasing pairs satisfy exchange.

The three matroid bases are $\{a,b\}$, $\{a,c\}$, and $\{b,c\}$, all of cardinality two, with weights $13$, $14$, and $11$. The matroid greedy algorithm considers $a$, then $c$, then $b$: it admits $a$, admits $c$ because their determinant is nonzero, and rejects $b$ because the triple is dependent. The resulting matroid basis $\{a,c\}$ has weight $8+6=14$, the largest of the three totals. Every singleton can grow, so none is maximal; the three pairs are both maximal and maximum in cardinality.

A light ray whose path remains in a plane containing the optical axis. In a straight step-index optical fiber, this geometry gives the complementary axis and interface-normal angles used to derive the optical fiber acceptance angle.

A thick lens retains the separation of its refracting surfaces when predicting image formation. In the paraxial approximation with air on both sides, object and image distances measured from the respective principal planes satisfy the familiar imaging equation. Measuring instead from one mechanical centre generally introduces an error.^[ref]