Metal ion 2026-10-31
An ion of a metallic chemical element, whose electric charge and chemical surroundings affect its reactions.
Locally finite sorted-stream merge 2026-10-31
Compare the heads of two increasing lazy lists, emit the smaller and advance its input, or emit one copy and advance both when the heads are equal. This preserves strict order and removes duplicates. To enumerate the entire union as a list, each requested element must have finitely many smaller elements in the union. Without this condition, an increasing sequence tending to one can permanently precede an input element equal to two. For increasing integer streams bounded below, finiteness below each candidate guarantees that no candidate is starved.
In-place merge 2026-10-31
Combining adjacent sorted runs within their existing array segment. A simple constant-auxiliary-space version moves the smaller second-run head before the first-run head by shifting the intervening block one place right. The finished prefix is always a merge of the consumed portions. This can use quadratic running time; minimizing storage does not automatically preserve the linear cost of a disjoint-output merge.
List of medical writers 2026-10-31
Atomiser Created 2026-10-31 Updated 2026-11-05
Device that disperses a liquid into droplets. Reservoir concentration, emitted quantity and absorbed dose are different quantities.
Speculum Created 2026-10-31 Updated 2026-11-05
Row run length 2026-10-31
Least squares 2026-10-31
The least squares approach chooses parameters by minimizing the sum of squared residuals. A linear least-squares problem has affine residuals, whereas nonlinear least squares permits nonlinear dependence on the parameters. The Euclidean norm makes the objective ; the factor one-half simplifies its derivatives without changing its minimizers.
Minimum locus of a squared function 2026-10-31
If a real-valued function has a zero in the feasible region, then , with equality precisely on that zero set. The minimum can therefore occur along a curve or a higher-dimensional set rather than at isolated critical points. To maximize it on a compact feasible region, maximize : both the largest and the smallest values of must be considered, since a large negative value also has a large square.
Adding an optimization constraint shrinks the admissible set, so it cannot lower the infimum of the same objective function. Every value attained on the smaller set was already available on the larger set. If both minima exist and the larger problem has a unique minimizer absent from the smaller set, the inequality is strict. This compares beam energies for free, pinned, and clamped endpoints without evaluating the energy integrals.
Merit function 2026-10-31
A merit function is a scalar objective function used by an iterative constrained algorithm to balance objective reduction and feasibility. It permits a line search or other acceptance test even when the original objective function alone is insufficient to judge progress. Quadratic penalty methods and the augmented Lagrangian method give two constructions with different treatments of multiplier information.
Quadratic penalty method 2026-10-31
For constraints , , minimize the displayed merit function for progressively smaller , where . Increasing the quadratic penalty discourages constraint violation. In a violated inequality, differentiation gives the multiplier estimate ; an inactive inequality has estimate zero. Thus obtaining small violations by this method alone typically requires a very small , which may cause a large condition number in the inner minimization.
Augmented Lagrangian method 2026-10-31
For smooth constraints , minimizeapproximately in , then update the nonnegative Lagrange multipliers by the displayed projected rule. Equality constraints instead contribute and use the unprojected update . The construction combines Lagrangian duality with a quadratic penalty method.
For an inequality, the exact identity is . Its unshifted negative part satisfies . On a violated constraint, accurate new multipliers therefore give violation of the order of times the multiplier error. This can achieve high feasibility accuracy without a vanishingly small , reducing condition number difficulties. The negative-part qualification is essential if an iterate approaches a binding constraint from the feasible side.
Penalty method Created 2026-10-31 Updated 2026-11-05
A penalty method incorporates constraint violation into the objective with a parameter controlling its cost. For an equality constraint , the quadratic penalty method adds a multiple of ; a power penalty uses higher even powers. The penalty can allow infeasible iterates while encouraging feasibility as the cost grows. This differs from a logarithmic barrier, whose domain itself excludes the constraint boundary and exterior. Existence of a penalized stationary point, convergence of its constraint violation and convergence of the primal points are separate questions.
Sterile-release population threshold 2026-10-31
For the population map , extinction is a superstable fixed point. Below , two positive fixed points exist. Their multipliers are , making the lower one a threshold and the upper one attracting. A saddle-node bifurcation removes them at ; above it for every positive population, so every nonnegative orbit tends to extinction.
Competition model Created 2026-10-31 Updated 2026-11-05
In a biological competition model, increasing one population reduces the growth of another. A two-species example is , , with both cross-effects negative. This asymmetric example has self-limitation only in ; disappearance of therefore permits unbounded growth of . For its positive coexistence equilibrium is a saddle whose stable manifold separates exclusion outcomes.
Leslie-Gower predator-prey model Created 2026-10-31 Updated 2026-11-05
The system , combines logistic prey growth, saturating predation and a predator carrying level proportional to prey density. Its unique positive equilibrium is , where . Its Jacobian matrix has determinant and trace . The positive trapping construction for the Leslie-Gower model gives a compact positive region and a limit cycle whenever this equilibrium is a repeller.
Mass percentage 2026-10-31
The mass fraction multiplied by 100%.
Epithelioid macrophage Created 2026-10-31 Updated 2026-11-05
An epithelioid macrophage is an activated macrophage with an enlarged, epithelial-like appearance. Such macrophages can form tightly organized groups in a granuloma, a tissue response that contains persistent material or infection. The resemblance concerns cell shape and arrangement: it does not make the cell an epithelial cell. Some epithelioid macrophages participate in the formation of multinucleated giant cells. [ref]
Immunobiology: The Immune System in Health and Disease, 5th edition by Charles A. Janeway, Jr. and others. Chapter 8, T Cell-Mediated Immunity: macrophage activation and granuloma formation
Load instruction 2026-10-31
A machine instruction that reads a value from computer memory into a processor register. A demand cache miss may delay its result; a software prefetch has no such architectural result.
There are unlisted articles, also show them or only show them.