Codex @codex  0

A relatively recent inflammatory syndrome involving the pericardium. It can produce pain and a friction rub with or without appreciable pericardial effusion; fluid amount and inflammatory activity are separate features.^[ref]

Accumulation of fluid in the pericardium. Its size and effect on the blood circulation are distinct questions.

An auscultatory sign produced by movement of inflamed pericardial surfaces.

For an equality-constrained optimization problem, an even integer $p\ge 2$ makes this a nonnegative penalty for constraint violation. Its derivative is $\nabla f+{\mu }^{-1}D{c}^T{c}^{p-1}$, with the power applied coordinatewise. The case $p=2$ is the quadratic penalty. Reducing $\mu$ increases the cost of infeasibility; it does not itself ensure that computed stationary points or minimizers stay bounded.

Explicit light-source sampling at a surface interaction: connect to a sampled source and use a shadow ray to test visibility. It avoids relying solely on a randomly continued path to hit an emitter; this is essential for ordinary continuous direction sampling with ideal point lights.

If $f:X\to Y$ is continuous and $X$ is path-connected, then $f(X)$ is path-connected. Choose preimages of any two image points and a continuous path between them in $X$. Its composition with $f$ supplies the required path inside $f(X)$. The conclusion uses the subspace topology on the image, not an assumption that $f$ maps onto the whole codomain.

If $X$ had a separation into two disjoint nonempty open subsets, a continuous path joining points in the two subsets would pull it back to a separation of $[0,1]$. This contradicts connectedness of an interval. Thus every path-connected space is connected. The converse fails, for example for the topologist's sine curve with its limiting vertical segment.

The displayed subspace of the Euclidean plane is path-connected: each vertical rational tooth joins the horizontal line at height one. Delete $(r,1)$ for rational $r$. The residual tooth $V=\{r\}\times [0,1)$ cannot be joined by a path to the top line. Before a path first reaches height one, its first coordinate is a continuous rational-valued function on an interval and must therefore be constant; it would reach the deleted point.

The punctured space remains connected. Its portions $L,R$ on either side of $x=r$ are path-connected, and $V\subseteq \overline{L}\cap \overline{R}$ by the density of the rational numbers. Adjoining limit points to a connected set preserves connectedness: a separation would place the connected subset on one side and prevent the other side from containing its limit points. Hence $L\cup V$ and $R\cup V$ are connected and intersect in $V$. Their union is connected. This example distinguishes connectedness from path-connected using the loss of a single attachment point.

The vectors need not form orthonormal bases. With the inner product linear in its second entry, expand the rank-one operator $|\Psi ⟩⟨\Psi |$ and take the trace on the second factor. This gives the displayed reduced positive operator. For every observable $A$ on the first factor,Positivity also follows directly from $⟨v,S_{1}v⟩=\Vert {\sum }_j⟨v,{\xi }_j⟩{\eta }_j{\Vert }^2$. Thus the physical density operator is $S_1/\Vert \Psi {\Vert }^2$ when the nonzero source vector is not normalized. The Gram matrix of the second-factor vectors supplies the cross coefficients; replacing those coefficients by Kronecker deltas without checking orthonormality changes the subsystem state. This formula is useful when an efficient product expansion uses nonorthogonal vectors, even though the partial trace itself is basis-independent.

A second-order partial differential equation is of mixed type when the type of its principal part changes across its domain. For $A{u}_{xx}+2B{u}_{xy}+C{u}_{yy}=0$, the sign of $B^2-AC$ distinguishes a hyperbolic partial differential equation, parabolic type and an elliptic partial differential equation. For example, $u_{xx}+\mathrm{sign}(y)u_{yy}=0$ is elliptic above $y=0$, hyperbolic below it, and degenerate on the interface. On its hyperbolic side, the change $\xi =x+y$, $\eta =x-y$ reduces it to $u_{\xi \eta }=0$; above it is the Laplace equation. Type classification alone supplies no matching rule for the normal derivative.

A free boundary problem determines both a field and part of its domain boundary. A glacier terminus, for example, separates positive ice thickness from bare bed. Mass conservation, nonnegative thickness, a rule for ice ablation only where ice exists, and suitable interface or entropy solution conditions are needed; a formal zero of one characteristic branch alone need not give the selected physical boundary.

For a differential equation $L[u]=0$ with its comparison order fixed, a supersolution satisfies $L[w]\ge 0$. For example, if $L={\partial }_t-{\partial }_x^2+Q$ with $Q\ge 0$, a sufficiently regular $w$ satisfying $L[w]\ge 0$ and dominating the initial and boundary data lies above a solution by the parabolic comparison principle. An unbounded-domain barrier such as $w=\eta e^{3t}(1+x^2)$ can provide the missing boundary control at large distance. The sign convention belongs to the chosen differential operator and must be stated.

A type scheme describing a family of instances through type variables. In Hindley-Milner type inference, a principal type describes the most general valid instance pattern; concrete types arise by consistently substituting for the quantified variables. Reusing one variable constrains the corresponding positions to the same type, whereas distinct variables can vary independently.

An object method with its own type parameters, instantiated or inferred at each call. In Scala, def identity[T](x: T): T = x is a generic method. A method def accept(x: T) inside class Box[T] instead uses a class type parameter fixed by the receiver's type argument; it is not itself a generic method with a separately chosen T on every call. This distinction matters in method overloading.

A reference parameter designates the caller's actual storage. Assigning through it can change what the caller subsequently observes; passing a complete independent copy would instead change only the local copy. A value parameter containing an object reference is another case: copying that reference does not copy the referenced software object.

In Oberon, a variable parameter is marked VAR and stands for the supplied actual variable. For example, a procedure accepting VAR x: INTEGER can increment the caller's integer through x.^[ref]

A read-only algorithm can use a reference parameter to avoid copying a large array, while its formal specification still prohibits writes. Reference aliasing remains relevant: two parameters can designate overlapping storage. A proof of algorithm correctness must account for the actual aliasing rules rather than assume that different parameter names denote independent values.

A parameter initialized from the actual argument's value. Whether passing an aggregate copies all elements or merely a reference is language-dependent; in whole-array copying semantics, a length-$L$ argument costs $\Theta (L)$ per call. This differs from a language that passes an object reference by value.

Evaluate argument expressions before invoking a function. A monadic interpreter must also specify the order of those evaluations when its computational monad represents effects.

Paraplegia is paralysis affecting both lower limbs, sometimes with additional lower-trunk impairment. It can result from disorders affecting the spinal cord or other relevant pathways; the level and completeness of the lesion determine which functions are affected.

Motor impairment, sensory loss and autonomic dysfunction are separate dimensions. The word paraplegia alone does not specify the presence or absence of every one of them.

Molecular oxygen in a chemical solution, distinguished from oxygen chemically bound in water molecules.