Detector volume averaging is the spatial averaging of a nonuniform radiation field over a detector's finite sensitive region. A reading associated with the detector centre need not equal the local absorbed dose at that point. This limits spatial resolution even if the detector position and electronic readout are exact.

For an idealized linear response, let $D(\mathbf{x})$ be the absorbed dose field in the undisturbed medium and let $w(\mathbf{u})\ge 0$ be a normalized spatial weighting function, with $\int w(\mathbf{u})d\mathbf{u}=1$. Model the spatially averaged quantity byThe model separates averaging from the change in the radiation field caused by inserting the detector. A real ionization chamber can require both effects to be considered. The IAEA definition compares a point dose with the average over the detector's sensitive volume, both evaluated in water with the detector absent.^[ref]

For an original one-dimensional example, suppose the detector averages uniformly over a full width $a>0$. ThenAn ideal sharp edge $D(x)=D_{0}H(x)$, where $H$ is the Heaviside step function, is recorded asThus a $4\mathrm{mm}$ detector gives a $2.4\mathrm{mm}$ distance between the 20-percent and 80-percent response points, although the stipulated field edge has zero transition width. A $1\mathrm{mm}$ detector gives $0.6\mathrm{mm}$ in the same model.

For a smooth field, a Taylor expansion under the symmetric uniform weighting gives $\overline{D}(x)=D(x)+a^2{D}^{\prime \prime }(x)/24+O(a^4)$. A constant slope averages to its centre value; curvature produces the leading local discrepancy. A detector-volume-averaging correction factor therefore depends on the field shape and detector geometry, rather than only on the detector's nominal volume.

A proposed apparatus test scans a stable radiation field with detectors of different effective widths or orientations, keeping depth and irradiation geometry fixed. Changes in the recorded edge width test spatial response, while a uniform region checks relative sensitivity. The IAEA's geometric weighting examples show why a projected detector area may need nonuniform weighting; finer scan steps alone cannot remove averaging within each reading.^[ref]

A potassium channel is an ion channel that preferentially conducts potassium ions. Its selectivity filter can compensate for the energetic cost of removing water from an ion, while discriminating between ions of different geometry. A crystal structure of a bacterial potassium channel revealed how repeated backbone oxygen atoms line the narrow filter. ^[ref]

Different potassium channels open under different conditions. Leak channels contribute to resting membrane potential, whereas voltage-dependent channels can support repolarization after an action potential. The direction of current depends on voltage relative to the potassium reversal potential, not simply on the channel's name. Selectivity and gating describe different aspects of its function.

A sodium channel is an ion channel that preferentially conducts sodium ions. In a voltage-gated sodium channel, changes in membrane potential control opening and inactivation. Under usual neuronal conditions, opening permits inward current that promotes depolarization, recruiting more voltage-gated sodium channels during the rising phase of an action potential. ^[ref]

An illustrative current relation is $I_{Na}=g_{Na}(V-E_{Na})$, with an explicitly chosen sign convention. Even a large conductance produces little net current near the sodium reversal potential. Channel availability, opening and ionic driving force are therefore distinct. Inactivation also differs from merely closing a resting activation gate: recovery depends on the preceding voltage history.

A channelrhodopsin is a light-gated ion channel associated with a retinal chromophore. Absorbing light changes the protein's conducting state, connecting photoreception directly with ion movement across a cell membrane. Naturally occurring members in Chlamydomonas reinhardtii participate in responses to illumination.^[ref]

The landmark channelrhodopsin-2 study expressed the protein in Xenopus laevis oocytes and mammalian cells and recorded light-evoked electric currents. Altering ionic conditions showed passage of multiple cations; continued illumination produced an initial response followed by a smaller sustained conductance. Expressing the channel in another cell type helped establish that light gating was a property of this molecular machinery.^[ref]

In an illustrative Ohmic model with outward-positive electric current, $I=g(V-E_{\mathrm{rev}})$. If light produces $g=1\mathrm{nS}$ at $V=-60\mathrm{mV}$ and $E_{\mathrm{rev}}=0$, then $I=-60\mathrm{pA}$: net inward positive electric charge. These invented values illustrate the driving force. Light opens a route whose direction depends on membrane potential and ionic conditions, a principle used in optogenetics.

TRPM1 is a cation-channel protein required for the normal depolarizing response of retinal ON-bipolar cells to increased illumination. In this pathway, reduced glutamate release from light-stimulated sensory cells changes signaling through mGluR6, permitting a depolarizing electric current. Thus TRPM1 participates in a synaptic response to light rather than acting as a pigment that directly absorbs the light.^[ref]

A 2009 experiment combined tissue localization with functional tests. Mice lacking TRPM1 retained an essentially normal initial a-wave in electroretinography, but lacked the later b-wave. The early sensory response could therefore survive while a downstream response failed. Whole-cell patch clamp recordings in retinal slices then bypassed the upstream sensory cells by chemically simulating their signal: responses were abolished in rod retinal ON-bipolar cells and strongly altered in cone retinal ON-bipolar cells.^[ref]

The paired tests illustrate a useful localization argument. A missing summed waveform alone does not uniquely identify the damaged step. Combining that measurement with a direct cellular test more specifically connects the missing protein to the response-generating machinery.

A Riemannian metric is boundary rigid within a specified class if the distances it induces between all pairs of boundary points determine the interior metric, up to a diffeomorphism that fixes the boundary pointwise. The qualification is unavoidable: relabeling interior points in this way changes the coordinate expression of the metric without changing any boundary distance.

This inverse problem idealizes recovering an interior wave-speed geometry from boundary travel times. Its data are shortest-path distances, so arbitrary trapped regions need not be visible. For a Euclidean disk, multiplying the metric by $c^2$ multiplies every boundary distance by $c$; this simple experiment already distinguishes a uniform change of travel-time scale. Determining a general spatially varying metric is much harder. A landmark theorem proves boundary rigidity for compact simple two-dimensional Riemannian manifolds, where the boundary is strictly convex and the relevant geodesics have no conjugate-point ambiguity.^[ref]

An intermediate precision condition of measurement is part of the specified conditions used to assess intermediate measurement precision. The measurement procedure and location remain common, while replicate measurements extend over a longer period. Declared changes can include operators, measuring systems, reference devices used for measurement calibration, or new calibrations.^[ref] The record should state what changed as well as what was held fixed.

For an original length study, use the same laboratory, reference block and written comparator procedure in two sessions three weeks apart. Two operators each perform the complete remove-and-replace measurement cycle in both sessions. Record instrument identity, measurement calibration, temperature and settling conditions rather than treating “same laboratory” as a complete description.

Consider the following stipulated session means in millimetres:The operator difference is $6\mu \mathrm{m}$ within either session, and the session difference is $10\mu \mathrm{m}$ for either operator. In an additive model, those two comparisons distinguish the respective contributions because both operators appear in both sessions.

If operator A had measured only in session 1 and operator B only in session 2, the observed $16\mu \mathrm{m}$ difference would combine the two changes. It could not be uniquely attributed to operator or elapsed time from that design alone. Repeated complete trials within each operator-session combination are still needed to assess random scatter; four chosen means do not establish a general precision value.

A measurement repeatability study keeps more conditions fixed over a short interval. Changing locations and measuring systems leads toward reproducibility conditions of measurement. The intermediate specification identifies the particular longer-term changes included in the precision study, rather than promising that every source of variation has been sampled.

Shared bias in an interlaboratory consensus occurs when a common systematic error shifts several laboratories' results together. Their interlaboratory consensus value can then be highly reproducible while displaced from an independent reference. Shared calibration standards, a common correction or the same inadequately modeled measurement step can create such dependence. The GUM explicitly warns that using the same instrument, standard or reference datum can correlate input quantities.^[ref]

A simple original model iswhere $\theta$ is the target quantity value, $b$ a common fixed offset and ${\epsilon }_i$ a laboratory-specific deviation. The arithmetic mean is $\bar{x}=\theta +b+\bar{\epsilon }$. Increasing the number of independent laboratories reduces the fluctuations in $\bar{\epsilon }$ but leaves $b$ in place.

The obstacle is also one of identification. For any constant $c$, replacing $(\theta ,b)$ with $(\theta +c,b-c)$ leaves all predicted results unchanged. Pairwise differences $x_i-x_j$ cancel both terms. Thus the comparison's internal agreement cannot determine the absolute common offset without additional information.

To represent residual common-reference uncertainty, use an uncertain zero-centered quantity $B$ with standard uncertainty $u_B$, independent of mutually independent laboratory errors of variance ${\sigma }^2$. ThenThis is a stated uncertainty model, distinct from asserting that an unknown fixed bias has been observed to vary randomly. The common contribution is counted once in the mean's uncertainty; it is not divided by the number of laboratories.

For stipulated $u_B=0.50$, $\sigma =0.20$ and $n=25$, treating everything as independent would retain only $0.20/5=0.04$. The stated correlated model instead gives $u(\bar{x})=\sqrt{0.25+0.0016}\approx 0.502$, in the same units as the measurement. The appropriate covariance terms prevent the implausible conclusion that enough copies of a shared reference can remove its uncertainty.^[ref]

An independently characterized certified reference material, a different measurement principle or an independently calibrated reference can help test the suspected common shift. Independence must itself be checked: a nominally separate reference derived from the same calibration chain may retain the same dependency. Recognized biases should be corrected where appropriate, with the correction's uncertainty retained.

Completeness of an interactive proof guarantees that true statements can convince the verifier in an interactive proof when the designated prover in an interactive proof follows the protocol. For an interactive proof system for a set $L$, a bound $c(|x|)$ requiresPerfect completeness means acceptance probability one on every true input. This is different from soundness of an interactive proof, which concerns every cheating strategy on false inputs.^[ref]

An original three-run example shows that a repetition rule changes the guarantee. Suppose three independent runs on a true statement each accept with probability $c=0.9$. Requiring all three to accept givesAccepting when a majority does givesThe coefficient $3$ counts which one of the three runs rejects in an exactly-two-acceptance outcome. These stipulated independent trials illustrate the aggregation rule; the soundness of the majority rule must be assessed separately.

Thus lowering the chance of false acceptance is not the only design objective. A verifier that always rejects has excellent false-statement behavior but no useful completeness. A successful proof system needs both sides of its acceptance guarantee.

Soundness of an interactive proof bounds how often a verifier in an interactive proof can be induced to accept a false statement. For every false input $x$ and every cheating prover in an interactive proof strategy $P^{\ast }$, an acceptance bound $s(|x|)$ requiresIn the usual interactive proof system definition, the quantifier includes computationally unrestricted cheating strategies. Bounding only one tested strategy is insufficient.^[ref]

An original repetition example shows why conditional bounds matter. Suppose a single fair bit $B$ is reused in two tests, and both accept exactly when $B=0$. Each test separately accepts with probability $1/2$, but both accept with probability $1/2$, not $1/4$. Merely multiplying marginal probabilities would be wrong.

Instead, if every next test has acceptance probability at most $s$ conditional on every preceding accepting history, the chain rule for probabilities giveswith the first term unconditional and zero-probability histories handled trivially. For $s=1/2$ and $k=8$, the bound is $1/256$. The relevant protocol must justify those conditional bounds, rather than assuming that repetition automatically makes every transcript independent.

Soundness protects the false-statement side of verification. It neither guarantees acceptance of true statements nor establishes that a successful interaction hides a cryptographic witness; those are separate completeness and zero-knowledge proof questions.

A prover in an interactive proof is the participant that sends messages intended to convince a verifier in an interactive proof of a public statement. Formally it is a strategy: its next response can depend on the public input, the preceding conversation and any private information or randomness it has. The basic interactive proof system model does not impose the verifier's polynomial time bound on this strategy.^[ref]

An honest prover follows a designated strategy supporting completeness of an interactive proof. A cheating prover may depart from it; soundness of an interactive proof must still hold for every allowed cheating strategy. Calling a participant a prover therefore does not mean that its assertions are trusted.

A cryptographic witness can make an otherwise difficult response easy to produce. For an original composition example, let $\varphi :G_0\to G_1$ be a known graph isomorphism. If the prover sends $H=\pi (G_0)$ for a chosen permutation $\pi$, it can supply $\pi$ as an isomorphism from $G_0$ to $H$, or $\pi \circ {\varphi }^{-1}$ as an isomorphism from $G_1$ to $H$. Neither response requires solving a new isomorphism search problem from scratch.

Thus a theoretical allowance of unlimited prover computation is different from a claim about implementation cost. Some protocols have efficient honest provers when the witness is supplied; others are studied primarily for the verification power they demonstrate.

A verifier in an interactive proof is the efficient participant that evaluates a public statement using messages from a prover in an interactive proof and its own random choices. Its algorithm specifies which challenge to send, how to process the response and when to accept or reject. In the standard model it runs in probabilistic polynomial time in the public input length.^[ref]

The verifier's guarantee concerns more than one successful conversation. Completeness of an interactive proof requires a suitable honest prover to succeed on true statements. Soundness of an interactive proof bounds success of every cheating strategy on false statements. A verifier that accepts whenever it receives any message meets neither requirement merely by being fast.

For an original checking example, suppose a response claims a graph isomorphism between two20-vertex graphs encoded by adjacency matrices. Checking that the vertex mapping is a bijection and that all $20^2=400$ adjacency entries agree with their mapped entries verifies that response. It does not require searching through all $20!$ vertex permutations.

An interactive proof system can use such inexpensive checks in a randomized conversation. The verifier's random choices must follow the specified protocol: exposing a challenge too early, reusing randomness in an unjustified way or changing the acceptance rule can alter its mathematical guarantees.

The general intelligence factor, conventionally $g$, is a latent variable used to account for shared variation among performances on different cognitive tasks. Charles Spearman's 1904 analysis distinguished a common component from task-specific contributions, helping establish the historical basis of this approach.^[ref]

A simple one-factor measurement model writes a standardized test score aswhere ${\lambda }_j$ is a factor loading. Suppose all variables have zero mean, $\mathrm{Var}(g)=1$, each ${ϵ}_j$ has zero covariance with $g$, and distinct residuals have zero covariance with one another. Then for different tests,Thus a single shared component can explain correlated scores even when the tests contain different content. The covariance equation follows from the stated assumptions; it does not identify a unique biological cause of the correlations.

Factor analysis estimates such models and evaluates their fit. The general intelligence factor should also be distinguished from a first component obtained by principal component analysis: one is a proposed latent structure with residual assumptions, while the other is a variance-maximizing summary of observed scores. Interpretation requires the tasks, population and measurement assumptions, rather than a number alone.

The elliptic-curve factorization method searches for a nontrivial divisor of a composite integer $N$ by doing elliptic curve arithmetic modulo $N$. Hendrik W. Lenstra's method replaces the multiplicative group in Pollard's p-1 algorithm with a group whose order varies as the curve varies. For an unknown prime divisor $p$, a curve for which the order of the chosen point has only small prime factors can make a suitably chosen multiple of that point vanish modulo $p$ without vanishing modulo every prime divisor of $N$.^[ref]

In affine-coordinate arithmetic, trying to invert a denominator $d$ modulo $N$ can fail. Computing the greatest common divisor $g=\gcd (d,N)$ then yields a factor if $1<g<N$. A full gcd of $N$ is inconclusive; another curve or point may be needed. Implementations can accumulate this information with projective coordinates rather than attempting an inversion at every step.

For a small worked example, take $N=35$, the curve $y^2=x^3+x+1$, and $P=(0,1)$. Its discriminant $-16(4+27)$ is coprime to $35$. The usual addition formulas give $2P=(9,12)$ and $3P=(2,16)$ modulo $35$. Adding these to form $5P$ calls for inversion of $9-2=7$. Since $\gcd (7,35)=7$, the failed division exposes a prime divisor. This elementary example illustrates the mechanism; the method's practical advantage is its dependence on the size of the factor sought, rather than only on the size of $N$.

An autoxidation inhibition period is a defined interval during which oxidation is suppressed relative to a matched uninhibited reaction. In an inhibited autoxidation assay, it can report how long a radical-trapping antioxidant retains effective capacity, but the operational start and end of the interval must be specified.

For a limiting model with antioxidant concentration $C_{A0}$, trapping stoichiometry $n$ and constant effective chain-initiation rate $R_i$, let $K_0=n{C}_{A0}$. If trapping is rapid and quantitative until exhaustion,At chosen values $C_{A0}=10\mu \mathrm{M}$, $n=2$ and $R_i=0.10\mu \mathrm{M}{\mathrm{s}}^{-1}$, the model gives $200\mathrm{s}$. Equal periods can arise from different combinations of concentration, stoichiometry and initiation rate, so an independent autoxidation initiation-rate calibration is needed to infer a capacity.

For changing initiation rate, capacity is consumed according to the integrated flux:An original decaying-flux example takes $R_i(t)=R_0{e}^{-kt}$, with $k>0$. Thenwhen $0<k{K}_0/R_0<1$. For $R_0=0.10\mu \mathrm{M}{\mathrm{s}}^{-1}$, $k=0.002{\mathrm{s}}^{-1}$ and $K_0=20\mu \mathrm{M}$, this gives about $255.4\mathrm{s}$, rather than the initial-rate approximation $200\mathrm{s}$.

Initiator-limited antioxidant exhaustion arises because this model supplies only total flux $R_0/k$. Here that limit is $50\mu \mathrm{M}$: a capacity $60\mu \mathrm{M}$ would never be exhausted by this modeled initiation source. Absence of a breakpoint would not demonstrate unlimited antioxidant capacity.

Experimentally, a delay can be defined by a stated curve-fitting or threshold rule, while the suppressed region can retain a nonzero oxidation slope. Primary spectrophotometric co-autoxidation work treats kinetics and stoichiometry as distinct properties of the radical-trapping reaction.^[ref] A longer apparent period can also reflect changed initiation, oxygen depletion or a readout effect. Comparing a matched blank, a reference antioxidant and a concentration series helps test which interpretation is supported.

Autoxidation initiation-rate calibration estimates the effective rate at which radical chains enter the specified inhibited autoxidation assay. It connects a measured inhibition delay to chemical trapping capacity. Initiator concentration by itself is not necessarily this effective rate: decomposition, radical escape and reaction conditions can affect how many chains are actually initiated.

For a known reference radical-trapping antioxidant at concentration $C_s$ with trapping stoichiometry $n_s$, assume constant effective initiation rate $R_i$ and rapid, quantitative trapping until exhaustion. Capacity balance givesThis calibrates the initiation rate only to the extent that the reference stoichiometry and the inhibition-period interpretation are valid. A single unknown antioxidant cannot generally determine both its own trapping capacity and $R_i$.

Autoxidation lag standard addition can expose a background capacity. Under an additive-capacity model,An original series with added reference concentrations $0$, $5$ and $10\mu \mathrm{M}$ and measured periods $20$, $120$ and $220\mathrm{s}$ has slope $20\mathrm{s}\mu {\mathrm{M}}^{-1}$. For $n_s=2$, this implies $R_i=0.10\mu \mathrm{M}{\mathrm{s}}^{-1}$. The intercept represents an equivalent pre-existing trapping capacity $R_i{\tau }_0=2\mu \mathrm{M}$ under this model; it does not identify the background chemical species.

Using $n_s{C}_s/\tau$ without accounting for the intercept would give about $0.0833$ and $0.0909\mu \mathrm{M}{\mathrm{s}}^{-1}$ at the two nonzero additions, instead of the common slope-based value. A concentration series therefore tests more than one isolated lag measurement. Curvature or changing slopes can indicate that addition changes the chemistry or that the initiation rate is not constant.

The signal still needs a reaction model. A primary visible-light method follows a BODIPY-based signal carrier co-autoxidizing with a hydrocarbon substrate, distinguishing radical-trapping kinetics from stoichiometry.^[ref] A fitted optical breakpoint is not automatically the instant of chemical exhaustion.

For time-dependent initiation, the balance becomes ${\int }_0^{\tau }{R}_i(t)\mathrm{d}t=n_s{C}_s$. Temperature, solvent, oxygen availability, reference identity and the observation procedure must therefore remain controlled or explicitly modeled. The calibration belongs to the assay conditions, rather than being an intrinsic constant transferable to every oxidation experiment.

A spikelet is a small unit of the inflorescence of a grass, containing one or more florets on a short axis. Usually a pair of glumes occurs at the base, and each floret is associated with a lemma and palea.^[ref]

This hierarchy matters when counting. An apparent “grain-bearing unit” can be a spikelet with several flowers, so counting spikelets is not generally the same as counting flowers or mature seeds. To inspect one, separate the basal glumes and then examine the individual florets inside. The nested organization links a recognizable cereal head to the reproductive structures of other angiosperms.

Conversion bookkeeping for binary copolymers uses conserved component amounts to distinguish initial feed, residual feed and cumulative incorporated composition. It is an accounting constraint on a closed batch, separate from the kinetic prediction supplied by the copolymer composition equation.

Normalize initial total monomer amount to one mole. Let $f_0$ be its type-1 mole fraction, $X$ total molar conversion and $f$ the type-1 fraction in the remaining pool. Assume no additional feed, side losses or consumption outside the material being counted. The incorporated amounts areTheir sum is $X$, so the cumulative type-1 fraction isThis is a molar-unit balance; conversion by mass requires the corresponding component molar masses. The IUPAC terminology distinguishes instantaneous composition from integrated conversion/composition relationships.^[ref]

For an original example, choose $f_0=0.20$, $X=0.50$ and residual $f=0.30$. The incorporated amounts are 0.05 and 0.45 mol, giving ${\overline{F}}_1=0.10$. Individual monomer conversions are $0.05/0.20=25\%$ and $0.45/0.80=56.25\%$. The residual mixture becomes richer in the less-consumed component even though the polymer contains less of it than the initial feed.

Nonnegative incorporated and remaining amounts impose, for $0\le X<1$,For $f_0=0.20$ and $X=0.10$, a reported residual fraction of 0.50 is impossible under the assumptions: it would leave $0.90(0.50)=0.45$ mol of type 1 when only 0.20 mol was present initially.

For a differentiable conversion trajectory, the instantaneous fraction is $F_1=d(X{\overline{F}}_1)/dX=f-(1-X)df/dX$. Equivalently, $(1-X)df/dX=f-F_1$. This is the bridge between conservation and kinetic composition drift. At complete conversion there is no residual mixture to assign an $f$ value; the total incorporated composition nevertheless equals $f_0$ under the closed-batch assumptions. The IUPAC experimental recommendation measures conversion and composition separately rather than replacing both by an initial feed label.^[ref]

mRNA display is an in vitro selection method in which a peptide or protein is covalently linked to the messenger RNA encoding it. Selecting the displayed molecule can therefore retain recoverable sequence information about that same molecule: a physical genotype-phenotype linkage.

In the original experiment, synthetic messenger RNA carried puromycin at its 3′ end. During translation, this peptide acceptor enabled fusion of the message to its encoded peptide. Richard W. Roberts and Jack W. Szostak tested the linkage by selecting an encoded myc epitope tag with an antibody.^[ref]

The experimental readout went beyond observing binding. Following immunoprecipitation, reverse transcription and polymerase chain reaction recovered the encoding information. A restriction enzyme distinguished the selected myc sequence from background pool sequences, allowing before-and-after enrichment to be measured.^[ref] This tests whether selection of a molecular property can recover the associated sequence; it does not establish that every possible sequence displays equally well.

An original statistical sampling calculation distinguishes nominal input size from effective displayed-library coverage. Suppose $N$ independent input molecules contain a desired sequence class with probability $p$, and each such molecule forms a usable fusion with probability $f$. Before any binding selection,For $N=10^{12}$, $p=10^{-10}$ and stipulated $f=0.01$, the expected usable desired count is only one and the chance of none is approximately 36.8%. Raising the hypothetical yield to 0.10 raises the expected count to ten and reduces that probability to approximately 0.00454%. These are constructed independent-sampling examples, not fusion yields claimed for the original experiment.

Sequence-dependent translation, fusion formation, recovery and amplification can each change representation. A large input sequence pool is therefore different from a large usable displayed pool. Repeating selection and amplification can enrich retained variants, while an independent functional or binding affinity measurement tests whether the recovered sequence has the intended property.