Effective displayed-library coverage describes which molecular sequence variants actually occur as usable displayed molecules, rather than merely being allowed by a library design or present in its input material. In mRNA display, successful translation, fusion formation and recovery connect input sequences to usable genotype-phenotype linkages. Duplicates of one sequence do not replace missing sequences.

An original occupancy model has $S$ equally likely sequence variants, $N$ independent input molecules and usable-display probability $f$ for each input. A particular variant is usable with probability $f/S$ per input. Thereforewhere $D$ is the number of distinct represented variants. The expected usable molecule count is $Nf$, which is generally larger than the expected distinct count.

For $S=1000$, $N=300,000$ and stipulated $f=0.01$, the expected usable count is 3000 but the expected distinct count is only about 950.2. An average 95% represented fraction does not imply 95% probability that every variant is represented. By the union bound,A sufficient condition for that probability to be at most $\delta$ is $N\ge (S/f)\log (S/\delta )$. With $\delta =0.05$ in this example, this requires at least 990,349 input molecules under the stated model.

The figure uses a Poissonized displayed-library occupancy model: independently Poisson-distributed usable counts per variant with mean $\lambda =Nf/S$. The expected represented fraction is $1-e^{-\lambda }$, while the probability of all $S$ variants being present is $(1-e^{-\lambda }{)}^S$. That is an explicitly different count model, providing a convenient comparison rather than an exact fixed-input formula.

Real variants need not have equal abundance or display probability. In the original RNA-peptide fusion experiment, the selected and unselected encoding-sequence ratios were affected by preferential translation and reverse transcription.^[ref] Coverage calculations therefore need assumptions about sequence representation and process losses; nominal library size alone does not validate them.

A pinned memory object is a normally movable memory object whose address must remain unchanged during a specified operation. Pinning permits a pointer to remain usable when the code consuming it cannot participate in the runtime's relocation of references. The pinning lifetime is part of that guarantee: an address retained beyond the protected operation need not remain valid. Microsoft's language reference specifies that a fixed statement prevents relocation during its body and restricts the declared pointer to that statement.^[ref]

For an original layout example, consider96 bytes with a pinned16-byte object at offsets $[32,48)$ and one other16-byte live object. The remaining64 bytes are free. Even if the other object can move anywhere, the pinned object divides the address range into regions of32 and48 bytes. A56-byte contiguous allocation cannot fit. Moving the other object into $[0,16)$ gives free intervals $[16,32)$ and $[48,96)$, whose largest size is48 bytes. If both live objects could move, placing them in $[0,32)$ would instead leave a64-byte interval. Pinning can therefore limit memory compaction despite ample total free capacity.

The numerical layout omits allocation headers and memory alignment; a real allocator must include them. Pinning an object's address also does not by itself specify how its virtual memory pages are backed. The garbage collector's object-relocation guarantee and an operating system's physical-page residency rules concern different layers. Likewise, a pinned buffer in a storage cache may mean protection from eviction rather than this object-relocation guarantee.

Once the protected operation is finished, releasing its pin can restore the runtime's freedom to move the object during a later collection. The program still has to obey the language's reference-lifetime rules: releasing a pin does not convert an old unmanaged address into a relocatable reference. The general garbage collection process must update references when it moves surviving objects.^[ref]

An amino sugar is a monosaccharide derivative in which an alcoholic hydroxy group is replaced by an amino group. This commonly occurs at carbon 2, but the position is part of the chemical identity rather than a requirement that all amino sugars share. IUPAC describes these compounds systematically as amino-deoxy derivatives; attachment of nitrogen at the anomeric position belongs to the distinct glycosylamine naming case.^[ref]

For example, glucosamine is 2-amino-2-deoxy-D-glucose: comparing it with glucose, replace the carbon-2 $\mathrm{OH}$ by $\mathrm{N}{\mathrm{H}}_2$. N-acetylglucosamine further modifies that nitrogen with an acetyl group. It remains an amino-sugar derivative; adding that modification does not make it a protein or an amino acid. The useful classification follows the monosaccharide framework and the location of the nitrogen-containing group.^[ref]

These modified building blocks help connect sugar chemistry to biological materials. Hyaluronic acid alternates N-acetylglucosamine with glucuronic acid, so every two-residue repeat contains one amino-sugar derivative. In an ideal segment with 100 complete repeats, there are 100 residues of each type, not 200 N-acetylglucosamine residues.^[ref]

Glucuronic acid is the uronic acid corresponding to glucose; in the usual D form, carbon 6 of D-glucose carries a carboxyl group instead of its primary alcohol group. Its neutral free-acid molecular formula is ${\mathrm{C}}_6{\mathrm{H}}_{10}{\mathrm{O}}_7$. The reference carbon numbering remains that of glucose.^[ref]

Check the atom count: changing $\mathrm{C}{\mathrm{H}}_2\mathrm{OH}$ into $\mathrm{COOH}$ adds one oxygen and removes two hydrogen atoms. Loss of the acidic proton gives glucuronate, with negative electric charge. The free monomer's formula should not be substituted unchanged for a residue inside a linked polysaccharide.

In a synthesis experiment, P. L. DeAngelis used UDP-glucuronic acid together with UDP-N-acetylglucosamine as activated substrates for hyaluronan synthase. Incorporation of the two sugar types into hyaluronic acid turns a repeating structural description into a reaction whose components can be varied.^[ref]

A uronic acid is a monosaccharide derivative in which the terminal primary alcohol group opposite the potential aldehyde group has become a carboxyl group. The reference numbering of the original aldose is retained: carbon 1 remains the potential aldehyde carbon, rather than becoming the number assigned to the new carboxyl group.^[ref]

For glucose, the relevant terminal group is at carbon 6. Replacing its $\mathrm{C}{\mathrm{H}}_2\mathrm{OH}$ reference group by $\mathrm{COOH}$ gives glucuronic acid, while preserving the arrangement at the intervening stereocenters. This distinguishes the position of a modification from the mere presence of a carboxyl group. Glucuronic acid supplies one of the two alternating sugar residues in hyaluronic acid, connecting the chemical classification with a biological polysaccharide.

Galactose is an aldohexose, a six-carbon monosaccharide whose open-chain reference form has an aldehyde group. It is the carbon-4 epimer of glucose: the corresponding structures differ at that one stereocenter. Its molecular formula is ${\mathrm{C}}_6{\mathrm{H}}_{12}{\mathrm{O}}_6$.^[ref]

A Fischer projection makes the difference precise. With the aldehyde at the top, the carbon-2 through carbon-5 hydroxyl group pattern of D-glucose is right–left–right–right. Changing carbon 4 alone gives right–left–left–right for D-galactose. Reversing every stereocenter would instead make an enantiomer; the single-position change is an epimerization.

Neither the formula nor an accurate mass measurement distinguishes these two sugars, because moving a hydroxyl group from one side of a stereocenter to the other changes no atom counts. Their different spatial arrangements nevertheless present different binding surfaces to an enzyme. This is a useful example of why carbohydrate identification needs structural information in addition to elemental composition. The D designation fixes the reference stereochemistry; it does not itself select a single cyclic anomer or state the sign of optical rotation.

Mannose is an aldohexose, a six-carbon monosaccharide. The commonly discussed biological form, D-mannose, has neutral molecular formula ${\mathrm{C}}_6{\mathrm{H}}_{12}{\mathrm{O}}_6$. Like other sugars, it can have distinct cyclic forms; specifying D configuration does not by itself identify an alpha or beta anomer.^[ref]

A Fischer projection provides an original structural comparison with D-glucose. Reading hydroxyl positions from carbon2 to carbon5, D-glucose has the pattern right–left–right–right, while D-mannose has left–left–right–right. The difference is at carbon2 alone, so they are epimers. Reversing all four stereocenters would be a different operation, producing the corresponding enantiomer.

Changing that one spatial arrangement changes neither the number of carbon atoms nor the total hydrogen and oxygen counts. A molecular-mass measurement therefore cannot, by itself, distinguish the two sugars. An identifying experiment must supply additional structural discrimination, for example through an appropriately interpreted nuclear magnetic resonance spectrum.

The useful distinction is between composition and configuration. The D label concerns a reference stereocenter; alpha/beta labels concern the anomeric center in cyclic forms. Neither label should be read as a direct statement about sweetness or the sign of optical rotation.^[ref]

In the algebraic convention used here, a tensor category over a field $k$ is a locally finite $k$-linear abelian category with a bilinear monoidal tensor product, left and right duals for every object, and a simple monoidal unit object whose endomorphisms are $k$. A locally finite category has finite-dimensional morphism spaces and objects of finite length. In broader usage, “tensor category” may mean merely a monoidal category; the extra hypotheses should therefore be stated.^[ref]

Finite-dimensional representations of a group over $k$ give a model example: the tensor product has diagonal group action, the unit is the one-dimensional trivial representation, and the dual is the dual vector space with the contragredient action. A tensor category need not have a braiding; swapping two tensor factors compatibly is additional structure.

A fully dualizable object in a symmetric monoidal $(\infty ,n)$-category has a categorical dual together with adjoints for the evaluation and coevaluation data, recursively through the required higher levels. The meaning depends on $n$. For $n=1$, full dualizability is just ordinary dualizability. For $n=2$, the evaluation morphism and coevaluation morphism must have both left and right adjoints. This is a finiteness condition expressed through composition and the monoidal tensor product.^[ref]

In the ordinary symmetric monoidal category of vector spaces over $k$, a finite-dimensional vector space $V$ has dual $V^{\ast }$, evaluation $v\otimes \lambda \mapsto \lambda (v)$ and coevaluationThe dual-basis identities make the two resulting zigzag composites the identity. Conversely, any algebraic tensor used as a coevaluation is a finite sum, so these identities force the whole space to be spanned by finitely many vectors. Infinite-dimensional vector spaces have algebraic duals but are not dualizable in this monoidal category.^[ref]

The cobordism hypothesis identifies fully dualizable objects as the possible values on a point of fully extended framed topological quantum field theories. The higher adjoints supply the compatibility needed when bordisms are cut and glued in multiple dimensions.

The Black-Litterman model combines equilibrium-implied expected returns with additional views whose uncertainty is stated explicitly. Fischer Black and Robert Litterman introduced it to make portfolio optimization less dependent on unstable unconstrained return estimates.^[ref]

In a standard Gaussian formulation, let the unknown return-mean vector have prior $\mu \sim N(\pi ,C)$, often $C=\tau \Sigma$ for asset-return covariance matrix $\Sigma$. Views take the form $q=P\mu +\epsilon$, with independent $\epsilon \sim N(0,\Omega )$. The Gaussian conditional expectation formula gives posterior meanThe matrix $P$ describes absolute or relative views, while $\Omega$ describes their uncertainty.

For one mean with prior $4\%$, prior variance $0.0004$, and a view of $8\%$ with equal variance, the posterior mean is $6\%$. Increasing the view variance pulls the result toward $4\%$; making it very small pulls toward $8\%$. The uncertainty $C$ about a mean is distinct from the covariance matrix $\Sigma$ of fluctuating returns, and must not be substituted for it without specifying the portfolio model.

Portfolio optimization chooses asset allocations to optimize an objective under specified constraints. In a one-period mean-variance optimization model, the return vector $R$ has mean $\mu$ and covariance matrix $\Sigma$. Portfolio weights $w$ give expected return ${\mu }^{T}w$ and return variance $w^T\Sigma w$. A standard problem isThe constraints describe a fully invested portfolio, a target expected return and no short selling. Different assumptions produce different optimization problems. Harry Markowitz made the dependence on covariance and the tradeoff between mean and variance central to portfolio selection.^[ref]

For two uncorrelated assets with expected returns $4\%$ and $8\%$, each with standard deviation $20\%$, a weight $w$ in the first gives variance $0.04(w^2+(1-w{)}^2)$. Its unconstrained minimum is at $w=1/2$, yielding mean $6\%$ and standard deviation $\sqrt{0.02}\simeq 14.14\%$. A target of at least $7\%$ instead requires $w\le 1/4$, making the constrained minimum $w=1/4$. The same covariance matrix therefore gives a different solution when the objective's feasible set changes.

Estimated means and covariances are model inputs, rather than known future outcomes. Sampling uncertainty, transaction costs and additional allocation restrictions can materially change the resulting weights.

Symbolic model checking verifies a Transition system by representing sets of states and transitions as formulas or decision structures rather than enumerating each state separately. Encode a current state by bits $x$ and its successor by bits $x^{\prime }$. A formula $T(x,x^{\prime })$ describes the transition relation. If $R(x)$ denotes currently reachable states, the next reachable set isIterating from the initial-state formula $I$ reaches a fixed point in a finite system. Intersecting that set with a bad-state formula checks a safety property.

Binary decision diagrams can make these operations compact when the represented Boolean structure is favorable. A system with $n$ Boolean state components has up to $2^n$ states, so sharing structure can be decisive. The representation can nevertheless become exponentially large, and variable ordering strongly affects a decision diagram's size. Symbolic representation mitigates state-space explosion; it does not abolish it.

State-space explosion is the rapid growth of a model's possible global configurations as its components are combined. If $n$ independent components each have two local states, their Cartesian product has $2^n$ global states. Thirty such components already permit $1073741824$ combinations, before accounting for additional data values.

Model checking must establish a property over relevant reachable behavior, so checking one representative execution is insufficient. The reachable subset can be much smaller than the full product, and symbolic representations can compactly describe many configurations at once. However, compactness depends on structure; it is not a universal removal of exponential difficulty. The practical aim is to exploit shared structure without omitting behavior needed for the claimed formal verification.^[ref]

Gaussian beam overlap under lateral displacement quantifies how a transverse offset reduces interference between Gaussian beams. For equal linear polarizations, matched wavefront curvature and an unlimited receiving plane, use normalized field amplitudesThe parameter $w_j$ is the radius at which the intensity has fallen to $e^{-2}$ of its central value. Completing the square in their overlap integral givesThe equal-radius case reduces to the expression in mode-overlap factor in optical heterodyne detection. The prefactor shows that centring the beams does not remove waist-size mismatch in optical heterodyne mode matching.

For an original $w_2=2w_1$ example, centred beams have $|\gamma |=0.80$ and only $64\%$ of the perfectly matched beat power at fixed collected powers. Adding displacement $d=w_1$ gives $|\gamma |=0.8e^{-1/5}\approx 0.6550$, reducing the beat-power fraction to about $42.9\%$.

An alignment tolerance follows in the equal-radius case. To retain at least $90\%$ of the matched beat power, require $e^{-d^2/w^2}\ge 0.90$, hence $d\le 0.3246w$. A chosen $100\mu \mathrm{m}$ radius permits about $32.5\mu \mathrm{m}$ displacement under these assumptions.

NIST's primary heterodyne setup used a polarizer and single-mode fibre to ensure matching rather than infer it from total power alone.^[ref] These original overlap examples omit aperture clipping, angular tilt and wavefront-curvature mismatch. They describe the detector's optical field overlap, not a universal coupling efficiency for every fibre or lens arrangement.

Modal damping coupling is the interaction between undamped modal coordinates produced by off-diagonal entries of the modal damping matrix. With mass-normalized modes and $D={\Phi }^{T}C\Phi$, the equations areThus $D_{ij}{\dot{q}}_j$ contributes to mode $i$'s force when $j\ne i$. Distinct undamped natural frequencies fix the modal directions up to scaling and ordering; repeated-frequency subspaces admit additional basis rotations and must be treated before interpreting an off-diagonal entry as unavoidable nonclassical damping.^[ref]

For an original example, takeIts eigenvalues are $0.5$ and $0.1$, so it is positive definite. At modal velocities $\dot{q}=(1,-2{)}^T$, total dissipated power isA diagonal-only approximation would give1.5 instead, despite leaving both diagonal coefficients unchanged.

The individual modal energies $E_i=\frac{1}{2}({\dot{q}}_i^2+{\omega }_i^2{q}_i^2)$ obey, with no external forcing,For these velocities, ${\dot{E}}_1=+0.1$ while ${\dot{E}}_2=-0.8$: one modal energy grows temporarily, even though the total falls at rate0.7. This modal energy transfer is compatible with a passive mechanical network; it is not evidence that an external energy source drives the growing coordinate.

For harmonic forcing, the complete response solvesOff-diagonal effects therefore depend on forcing frequency and the other dynamic terms, not solely on the size of $D_{ij}$ relative to $D_{ii}$. Neglecting them is an approximation whose error can be enhanced near nearby resonances. Solving the coupled equations or the damped quadratic eigenvalue problem retains those interactions; assigning independent scalar damping ratios does not, by itself, justify dropping them.

Mitral regurgitation is backward blood flow from the left ventricle into the left atrium through the mitral valve during ventricular systole. Incomplete leaflet coaptation permits a second outflow route while ventricular pressure drives forward ejection through the aortic valve. The imaging framework distinguishes primary leaflet disease from secondary dysfunction associated with the surrounding ventricular apparatus.^[ref]

An original volume balance separates total ventricular emptying from forward output. Suppose there is no other abnormal communication and no appreciable inlet flow during the chosen systolic interval. ThenFor stipulated total ejection 90 mL and forward aortic ejection 60 mL, the regurgitant volume is 30 mL and the regurgitant fraction relative to total ejection is $30/90=1/3$. Reporting only the 90 mL volume change would not identify how much reached the forward outlet. The technical report describes this complementary ventricular-volume/aortic-flow approach.^[ref]

Backward volume also depends on duration, not just instantaneous speed. For a chosen outlet surface $A(t)$ with normal directed toward the left atrium,This defines an integrated transport quantity. A short high-speed episode and a longer lower-speed episode can have the same integral, and a single peak velocity supplies neither surface area nor duration.

Consequently, leaflet anatomy, mitral coaptation index, regurgitant volume and chamber remodeling are distinct observations. Doppler echocardiography relates measured motion to flow, while anatomical imaging identifies the moving structures. Combining these measurements makes the question of leakage more precise than treating any one image dimension as a complete measure of mitral regurgitation.

Mitochondrial fusion is the joining of previously separate mitochondria, allowing their internal contents to mix. Because each mitochondrion has two boundary cell membranes, complete mitochondrial fusion requires joining both the outer and the inner mitochondrial membrane. Together with mitochondrial fission-fusion cycle, it makes mitochondria a changing network rather than a fixed collection of bean-shaped objects.

A useful experiment distinguishes joining from mere contact. Hsiuchen Chen and colleagues mixed mouse cells carrying differently coloured fluorescent proteins targeted to the mitochondrial interior, then fused the cells so both labelled populations shared one cytoplasm. Appearance of both colours within the same mitochondria reported content mixing. Loss of either mitofusin Mfn1 or Mfn2 reduced this mixing and produced fragmented mitochondria; restoring the missing protein rescued the defect. Mitochondrial fusion therefore has a measurable molecular requirement and permits exchange within the mitochondrial population.^[ref]

A strong liar for an odd composite integer $n$ is a base for which the Miller-Rabin primality test reports a pass. Write $n-1=2^{s}d$ with $d$ odd. A base $a$ is a strong liar whenThe base “lies” because these conditions hold for every allowed nonzero base when $n$ is prime, but can also hold for a composite.

For $n=2047=23\cdot 89$, base 2 is a strong liar because $2^{11}\equiv 1(\mathrm{mod}n)$ and $11$ divides $d=1023$. For every odd composite, strong liars occupy at most a quarter of the standard base sampling space; independently sampling $k$ bases bounds all-pass error by $4^{-k}$. A fixed handpicked list needs a separate guarantee for the intended input range.^[ref]