An operand stack holds intermediate values used by bytecode operations in a Java virtual machine method invocation. Each stack frame has its own last-in-first-out operand stack, initially empty; its maximum depth is recorded in the class file. Values can be loaded from local variables, consumed by operations and replaced by results.^[ref]

Starting from an empty operand stack, iconst_2; iconst_3; iadd produces the successive contents 2, 2,3 and 5, with the top shown at the right. The addition consumes both operands. This abstract execution rule does not require a physical memory push for each operation: just-in-time compilation may retain values in processor registers while preserving the specified behavior.

Silicic acid names a family of silicon oxoacids; the simple dissolved monomer is orthosilicic acid, $\mathrm{Si}(\mathrm{OH}{)}_4$. It contains one silicon atom bonded to four hydroxyl groups. Distinguishing a soluble monomer from a solid network of silica matters in both chemistry and biology: organisms that build silica structures must first acquire a dissolved source of silicon.

A simplified condensation reaction illustrates how monomers can begin to join:Two hydroxyl-bearing sites form a silicon–oxygen–silicon bridge and release water. Further joining creates more connected structures, so a nominal concentration of total silicon does not alone specify which molecular forms are present.

A 2016 experiment reconstructed diatom silicon transporters in artificial liposomes. The investigators trapped a zinc-based indicator inside and applied a sodium gradient; entry of silicic acid increased fluorescence. Controls separated transport from background signals. The near-neutral conditions supported transport of undissociated orthosilicic acid, illustrating how a soluble mineral precursor can be studied with a purified membrane system.^[ref]

Two-dimensional infrared spectroscopy measures a sample's vibrational response as a function of two frequency coordinates. In a coherent experiment, timed infrared pulses establish an excitation history and a later optical response; the spectrum correlates excitation and detection frequencies. The two dimensions are spectral coordinates, not two spatial directions through the sample.

In a time-domain implementation, the experiment scans a coherence delay $t_1$ and resolves a detection interval $t_3$ while holding a 2D IR waiting time $T$ fixed. Schematically, a complex measured response $S(t_1,T,t_3)$ is transformed toThe signs and combination of measured response pathways depend on the experimental convention. Fourier analysis converts the scanned delays into frequency information; it does not by itself establish which molecular mechanism produced a feature.

An original spectral example has modes near $1600$ and $1700\mathrm{c}{\mathrm{m}}^{-1}$. Features at coordinates $(1600,1600)$ and $(1700,1700)$ lie on the diagonal. An off-diagonal feature at $(1600,1700)$ is a 2D IR cross peak: excitation associated with one coordinate is correlated with response at another. Its physical interpretation depends on the pulse sequence and waiting time. A cross peak is not automatically evidence for chemical conversion between two species.

A primary2000 peptide experiment used phase-controlled femtosecond pulses, phase matching and heterodyne detection to measure the phase and amplitude of vibrational photon echoes as pulse delays varied. Cross peaks in acyl-proline-NH${}_2$ spectra supplied evidence for coupling between amide-I modes, with solvent-sensitive structural differences.^[ref]

Compared with a one-dimensional infrared spectroscopy trace, the extra coordinate can separate overlapping responses and expose relationships between vibrations. Varying the 2D IR waiting time adds a controlled time dependence to test candidate mechanisms. Interpretation still requires a response model, sufficient time/frequency resolution and controls for solvent and instrument contributions; a richly structured spectrum does not uniquely determine a molecular structure by inspection.

Vibrational coherence is a definite phase relationship between components of vibrational motion. In a quantum description, it concerns off-diagonal entries of a density matrix in a specified vibrational energy basis, rather than only the populations of those levels. The basis must be stated because quantum coherence is basis-dependent.

An original two-level illustration compareswith an incoherent mixture ${\rho }_{\mathrm{mix}}=\frac{1}{2}\mathrm{diag}(1,1)$. Both have equal quantum state populations, but only the first has a nonzero off-diagonal element. For a displacement operator with real off-diagonal matrix element $q_{01}$ and zero diagonal elements, its expectation in the pure state is $q_{01}\cos \varphi$, while the mixture gives zero. Relative phase can therefore affect an observable without changing the populations.

For an ensemble of classical vibrational oscillators, the analogous distinction is between individual motion and the sum of their phases. Oscillators can retain their energies while a spread of phases reduces the net coherent signal. A weak ensemble signal need not mean every molecule has stopped vibrating. Conversely, coherence does not require every possible vibration to have one common phase.

A primary peptide experiment measured phase and amplitude of vibrational photon echoes using optical heterodyne detection. It provides an experimental setting in which phase relationships are observable rather than merely a drawing convention.^[ref]

Dephasing and vibrational relaxation describe different aspects of dynamics: losing a phase relationship and changing vibrational populations need not occur at the same rate. Extracting either from a measured trace requires the pulse sequence, detector response and a stated molecular model.

A web search engine performs information retrieval over material gathered from the web. A web crawler discovers or revisits pages, indexing organizes their contents, and query processing selects and ranks results. These are separate stages: a search request ordinarily consults a prepared collection rather than downloading every page afresh.^[ref]

Suppose a newly created page links to a research report. A crawler can discover the report through that link, but discovery does not guarantee successful fetching or inclusion in the searchable index. Even an indexed report may not rank highly for every query. This separation explains why a result list is neither a complete inventory of web content nor a direct measurement of scientific correctness. Link analysis, including the HITS algorithm, can supply ranking evidence alongside textual matching.

An inverted index maps each indexing term to the documents containing it. A term dictionary provides access to a postings list; each posting records a document identifier, sometimes with additional information such as occurrence positions. A positional index retains those positions for queries involving word order.^[ref]

Consider documents one red boat, two blue boat and three red train. The postings list for red is 1,3, and that for boat is 1,2. Intersecting them answers red AND boat with document one, without scanning every document's complete text at query time. Sorting document identifiers permits a coordinated traversal of both lists. Preprocessing decisions still matter: an inverted index for case-folded terms answers a different matching question from one preserving exact capitalization. The data structure accelerates access; it does not itself establish relevance.

Precision measures the relevant fraction of an information retrieval system's returned documents. For relevant-document set $R$ and nonempty returned-document set $S$, it is $|R\cap S|/|S|$. The denominator concerns what was returned, whereas recall concerns all relevant documents.^[ref]

If $R=\{2,4,6\}$ and $S=\{1,2,3,4,5\}$, two of five returned documents are relevant, giving $2/5=0.4$. Adding irrelevant document seven reduces precision to $2/6$ while leaving recall at $2/3$. This exposes the cost of adding unhelpful results. Returning nothing makes this ratio undefined; a reported score must state any convention used for that case.

Recall measures how much of the relevant material an information retrieval system finds. For a relevant-document set $R$ and returned-document set $S$, it is $|R\cap S|/|R|$, provided $R$ is nonempty.^[ref]

Suppose $R=\{2,4,6\}$ and $S=\{1,2,3,4,5\}$. Two of three relevant documents were found, so recall is $2/3$. Adding document six raises it to one, while precision becomes $3/6$. Returning the whole collection guarantees complete coverage of the assessed relevant set, but can burden the user with many irrelevant results. Estimation requires relevance judgments beyond the returned documents; empty relevant sets need an explicit evaluation convention.

A phrase query asks for documents containing a specified sequence of indexed terms in the required order. For an exact phrase query, the occurrences occupy consecutive positions. A document containing every requested word can still fail because its words occur in a different order or with intervening terms.^[ref]

Let $P_d(t)$ be the set of positions of term $t$ in document $d$. For query terms $t_0,\dots ,t_{m-1}$, an exact match exists whenA positional index stores the information needed to test these offsets. Repeated query terms need their own offsets even though their positions come from the same postings list.^[ref]

Number words from one, without removing any. Document 1 is red red boat, document 2 is boat red red, and document 3 is blue boat. The exact phrase query red boat matches only document 1, at positions 2–3. Document 2 has exactly the same term frequencies as document 1, but its boat occurs before both red occurrences. Intersecting document identifiers for the two terms would retain it incorrectly.

Phrase semantics depend on the indexing pipeline. If some words are removed, preserving their position gaps can prevent a false claim of adjacency. A search allowing intervening words is a different matching condition; quotation marks alone do not specify every implementation's preprocessing choices.

Mathematical morphology studies shape-transforming operations defined through a chosen structuring element. For foreground pixels represented as a set $A$ and a finite footprint $B$, morphological dilation iswhile morphological erosion is $A\ominus B=\{x:x+B\subseteq A\}$. Dilation adds footprint translates around the foreground; erosion retains placements whose entire footprint fits.

For a one-dimensional example, $A=\{0,1,2\}$ and $B=\{0,1\}$ give dilation $\{0,1,2,3\}$ and erosion $\{0,1\}$. Morphological opening, erosion followed by dilation with the same footprint, removes an isolated set $\{0,2\}$ for that footprint because neither placement contains two consecutive points. grayscale variants use local minima and maxima rather than binary membership. The footprint and boundary conventions determine the exact operation.^[ref]

Image resampling evaluates image data on a new sampling grid, often while resizing, rotating or rectifying an image. An output pixel is mapped to a source location, which may lie between stored source pixels. An interpolation rule estimates its value; a boundary rule handles locations outside the recorded image.^[ref]

For example, bilinear interpolation at the center of four source samples with values $0,0,0,100$ gives their equally weighted mean, 25. Nearest-neighbor interpolation instead selects one sample and retains its value. These methods trade smoothness against preservation of discrete labels. Reducing image size also changes the sampling rate: a low-pass filter before subsampling can suppress aliasing, whereas interpolation alone cannot guarantee its removal. Stereo rectification uses image resampling to construct aligned virtual views without physically moving either camera.

A depth map assigns a distance-related value to each accepted image location. The geometry must specify whether this means depth along the camera axis or Euclidean distance along the viewing ray. Units, missing values and the coordinate frame are also part of the representation. In calibrated stereoscopy, converting a disparity map through the camera geometry produces depth estimates.^[ref]

For an ideal camera, suppose a point has coordinates $(X,Y,Z)=(1,0,2)$ metres. Its axial depth is two metres, but its Euclidean distance from the camera center is $\sqrt{5}$ metres. The same scene can thus yield different valid numerical maps under different conventions. A missing stereo correspondence requires an invalid-location marker rather than a fabricated depth. Camera calibration and measurement uncertainty determine how confidently accepted values describe the scene.

An image stack is an ordered collection of related two-dimensional images treated as one dataset. Its index may denote cutting depth, time or another acquisition coordinate: stacking images does not by itself establish a spatial volume. The ImageJ guide distinguishes ordinary stacks from datasets with several independent axes and requires equal image dimensions and bit depth within an ordinary stack.^[ref]

For an original spatial example, store 100 grayscale images as an array $I[k,j,i]$ with shape $(100,512,512)$, where $k$ indexes sections and $i,j$ index pixels. If each value occupies two bytes, the raw data requireThis excludes metadata and compression. Define the image stack axis calibration explicitly: at lateral pixel pitch $p=5\mathrm{nm}$ and section spacing $\Delta z=40\mathrm{nm}$, a zero-origin convention isThe first and last section centers are $99\Delta z=3.96\mu \mathrm{m}$ apart. Array shape alone does not contain that information.

An index permutation can preserve every stored intensity yet exchange depth and lateral coordinates, giving the wrong geometry if the spacing metadata are not permuted too. Image registration estimates alignment between slices; image segmentation assigns structural labels. Neither operation supplies a missing section's observations. For datasets exceeding memory, an image stack can also be read a slice at a time; the guide's virtual-stack representation keeps the image sequence on disk.^[ref]

ImageJ is a Java program for viewing, processing and measuring image data. Its official feature description includes image stacks, selections, calibrated measurements, image thresholding, plugins and recorded macros.^[ref] Wayne Rasband and Tiago Ferreira's user guide documents how acquisition metadata and analysis settings affect those measurements.^[ref]

For an original numerical measurement example, suppose a selected $2\times 2$ image region of interest contains gray values 10, 20, 30, 40. Set square pixel pitch to $0.25\mu \mathrm{m}$. The selection has four pixels, so its calibrated area and mean image signal areChanging only the spatial calibration to $0.50\mu \mathrm{m}$ per pixel changes the reported area to $1.00\mu {\mathrm{m}}^2$ while the mean remains 25. Spatial calibration changes the coordinate interpretation, not the stored gray values. An image thresholding rule retaining values at least 25 selects two pixels, whose total calibrated area under the original scale is $0.125\mu {\mathrm{m}}^2$.

A reproducible analysis records the original image, selection, spatial calibration, threshold rule and measurement settings. The guide separates spatial Set Scale from intensity Calibrate, and warns that global calibration can affect other open images.^[ref] The arithmetic above is stipulated test data, not a screenshot measurement or a result from an unspecified plugin.

NIH Image is Wayne Rasband's historical image-processing program for the Macintosh, preceding ImageJ. Its official documentation describes image acquisition, editing, filtering, calibrated measurements, stacks, a macro language and plug-in extensions.^[ref][ref]

One concrete representation choice explains why software history matters for interpreting old results. The manual describes internal pixels as unsigned 8-bit values and import of 16-bit data by rescaling to 8 bits. It also documents the convention of displaying value 0 as white and 255 as black; screen appearance and stored numerical values are distinct.^[ref]

For an original chosen conversion model, suppose a high-bit-depth image uses values from 0 to 4095 and is mapped to 8 bits byThen $Q(1000)=Q(1001)=62$. Two distinct recorded values become identical, so no subsequent measurement of the converted image can recover their difference. This is a stated quantization model, not an assertion about an undocumented rounding detail in NIH Image.

Keep the original data and the scaling rule when comparing legacy measurements. Spatial calibration is a separate operation: changing a length-per-pixel setting does not restore discarded gray-value information. The manual's analysis workflow selects a region of interest, computes measurements and records results, making those representation and selection choices part of a reproducible calculation.^[ref]

A region of interest in image analysis is a specified subset of image coordinates on which an operation or measurement is restricted. It can be an area, a line or a set of points, so its geometry determines which measurements are meaningful. ImageJ provides rectangular, oval, polygonal, line and point selections; an image region of interest describes their concrete use in that program.^[ref]

For an original example, let an image beChoose the top row as the region of interest, so its binary selection mask is $M=\left(\begin{array}{ccc}1& 1& 1\\ 0& 0& 0\end{array}\right)$. The selected mean isSelecting the bottom row instead gives 8, whereas the whole-image mean is 5. The stored image is unchanged; the question asked of it has changed.

A fixed geometric selection differs from selecting all pixels above an intensity threshold. Their intersection can be used when the intended measurement is a thresholded subset inside a prescribed area. Save the geometry, coordinate convention and image or frame association with the result. A line selection calls for a length or sampled profile, not the same complete-pixel area from a calibrated pixel count used for an area selection.

Area from a calibrated pixel count assigns an area to a selected collection of complete image pixels. For $N$ selected pixels of calibrated widths $\Delta x$ and $\Delta y$,This rectangular-cell model permits unequal horizontal and vertical spacing. In ImageJ, area is reported in square pixels or calibrated square units according to the spatial calibration and measurement settings.^[ref]

For an original threshold example, let four stored gray values be 40, 90, 130, 200. A rule selecting values at least 128 retains two pixels. If $\Delta x=\Delta y=0.5\mu \mathrm{m}$,At $\Delta x=0.5\mu \mathrm{m}$ and $\Delta y=0.8\mu \mathrm{m}$, the same pixel selection instead represents $0.80\mu {\mathrm{m}}^2$. Pixel count alone is not an area in physical units.

For a binary selection mask $M_{ij}\in \{0,1\}$, the count is $N={\sum }_{ij}{M}_{ij}$. A fractional-coverage model would instead use fractions $0\le f_{ij}\le 1$ and $A=\Delta x\Delta y{\sum }_{ij}{f}_{ij}$; the two rules need not agree at boundaries. A region of interest and an image thresholding rule also select pixels for different reasons. State the selection and calibration before interpreting the result as an estimate of a specimen's geometric area. The numbers above are stipulated image data, not a physical specimen measurement.

Sholl analysis summarizes the radial arrangement of a traced structure by counting its intersections with concentric Euclidean circles around a chosen center. The resulting Sholl profile reports how the count changes with radius. A computational workflow must specify the center, spatial calibration, sampled radii and the convention used to identify distinct intersections. The software documentation distinguishes analysis of segmented images from analysis of reconstructed tracings.^[ref]

For an original center-choice example, take the straight segment $\Gamma =\{(x,0):0\le x\le 2\}$. With center $(0,0)$, a circle of radius $r$ meets the segment once for $0<r\le 2$. With center $(1,0)$, it meets the same segment twice for $0<r\le 1$ and not at all for $r>1$. At $r=0.75$, therefore, the two center choices give counts 1 and 2, although the traced object has not changed. The center is part of the measurement definition.

For binary images, the foreground also needs an explicit meaning. The SNT documentation treats zero-valued pixels as background independently of the displayed lookup table and illustrates how an inverted segmentation can make the program sample background instead of structure.^[ref] Record the foreground-background polarity and radial sampling interval with the result.

The radial summary is useful for comparing where intersections occur, but a Sholl profile does not determine rooted tree topology. A fitted curve, sampled count sequence and complete ideal Sholl profile are different data objects; none should be silently substituted for another.

An image lookup table maps a stored pixel value or index to a displayed color. For an 8-bit grayscale image with stored values $I_{ij}\in \{0,\dots ,255\}$, a table can be writtenusing an RGB color model triple. Changing $C$ changes the appearance without necessarily changing $I$. ImageJ explicitly distinguishes Invert LUT, which changes the display, from inversion of the pixel values.^[ref]

For an original example, store the rowThe identity grayscale table is $C(v)=(v,v,v)$; an inverted table is $C_{\mathrm{inv}}(v)=(255-v,255-v,255-v)$. The same four stored values appear in opposite brightness order under these tables, but their arithmetic mean remains $447/4=111.75$. An image thresholding rule selecting stored values above 100 still gives the binary selection mask $(0,0,1,1)$.

Numerically replacing the pixels by $255-I$ instead produces $(255,191,127,0)$. Its arithmetic mean is $573/4=143.25$, and the same strict threshold gives $(1,1,1,0)$. Thus an inverted-looking image does not by itself establish that its numerical values or selected subset were inverted.

The distinction is especially visible with binary selection masks: the documented Create Mask command stores 255 inside the selection and 0 outside, while an inverting lookup table can display the selected class as black.^[ref] Record the foreground-background polarity from the stored encoding and algorithm, rather than inferring it from screen brightness.

A program can also apply a lookup mapping to the data. ImageJ's Apply LUT command changes gray values and restores the identity table so that the displayed appearance is retained.^[ref] Distinguish that operation from assigning a display table. A table mapping several input values to the same color can conceal numerical distinctions in the display even while those distinctions remain in the original stored image.

A hyphenation opportunity is a position where the language and chosen hyphenation rules permit a word to be divided across lines. An explicit soft hyphen can supply one; automatic hyphenation can find others using a language-appropriate resource. These permitted positions become choices for line breaking.^[ref]

Two tests must then be applied. First, is the division permitted by the linguistic rules? Second, does the resulting geometry and cost make it a useful choice? If the material before a break has width 20, an inserted hyphen adds 2, and the available typesetting line width is 21, the resulting 22-unit line fails the rigid-width fitting test despite the linguistic permission.

A discretionary break represents the alternative printed material. The Knuth-Plass line-breaking algorithm can compare that option with later or earlier permitted breaks using typesetting badness and typesetting penalties.