On $0<x<L$, $t>0$, an initial condition $u(x,0)=g(x)$ gives the starting profile. For the heat equation, Dirichlet boundary conditions $u(0,t)=a(t)$, $u(L,t)=b(t)$ can model ends held at prescribed temperatures. Alternatively, zero Neumann boundary conditions describe insulated ends in the constant-conductivity model. These choices can produce different evolutions from the same initial condition.

For a continuous classical solution reaching the corners, the Dirichlet boundary data must satisfy $g(0)=a(0)$ and $g(L)=b(0)$; higher smoothness can require further compatibility. In dimensionless variables, a complete worked heat equation problem isIts exact classical solution is $u(x,t)=x+e^{-{\pi }^{2}t}\sin (\pi x)$. The straight profile $x$ is the equilibrium; the extra bump decays. Substituting verifies the equation and every datum, and the energy estimate proves uniqueness among smooth solutions with these data.

For the transport equation with $c>0$ on the same interval, prescribe an inflow transport boundary condition only at $x=0$. Backtracking a characteristic curve gives $g(x-ct)$ if $x\ge ct$, and $a(t-x/c)$ otherwise. Values at $x=L$ are determined by this formula; independently prescribing them can make the problem inconsistent.^[ref]

The recognition process performed by a parser, producing a structural description of text according to a programming language syntax.

Two strictly positive nonproportional utility gradients $g,h$ admit a transfer direction $\delta$ with $g\cdot \delta >0$ and $h\cdot \delta <0$. Choose $\delta =g-th$ with $(g\cdot h)/\Vert h{\Vert }^2<t<\Vert g{\Vert }^2/(g\cdot h)$; strict Cauchy-Schwarz inequality makes this interval nonempty. Small opposite transfers in this direction strictly improve both differentiable utilities. Absence of such trades therefore forces positive proportionality of all gradients in an unconstrained allocation space.

A microparasite is typically modelled as multiplying rapidly within a host, so infection status rather than the exact organism count is the first between-host state variable. SIS model, SIR model and SEIR model descriptions are examples. Additional within-host structure can still be required.

A macroparasite is typically modelled using the number of parasites carried by each host. Adult parasitic worms illustrate why within-host parasite burden, developmental stages, mating and host exposure heterogeneity matter beyond an infected/not-infected classification.

A delta cell is a pancreatic islet endocrine cell producing somatostatin. Local effects influence secretion by neighboring islet cells. It illustrates how one endocrine organ can combine communication within its own tissue with effects mediated through circulation.

A beta cell is a pancreatic islet endocrine cell producing insulin and associated secretory products. Coupling nutrient-related signals to secretion contributes to blood-glucose regulation. The action of released insulin also depends on the responsiveness of other tissues.

An alpha cell is a pancreatic islet endocrine cell whose principal hormone is glucagon. Its secretion contributes to regulation of glucose availability and other metabolic processes. Cell identity, hormone concentration and the target tissue’s response remain distinct measurements.

A page table is the data structure describing an address space's mappings from virtual page numbers to page frames, together with access and status information. A page table entry can describe a resident memory page and its permissions. Nonresident or unmapped memory pages require a representation that lets the operating system distinguish them; a hardware not-present flag alone need not make that distinction. On x86, additional operating system information determines whether a not-present mapping is legitimate. ^[ref]

The four rows drawn under paging are an illustrative model, combining page table and operating system information: virtual page 0x12 is resident in physical frame 0x07 with read-only permission; 0x13 is resident in 0x02 with read/write permission; 0x14 is mapped read/write but nonresident; 0x15 is unmapped. The labels deliberately separate mapping policy, residency and permission. They are not a literal x86 entry layout. A translation lookaside buffer valid flag is a fourth, independent notion: it says that a cached translation can be considered, not that every resident memory page has a cached translation.

A flat array with one page table entry per virtual page would have $2^{16}/256=256$ entries in this example. At an assumed four bytes per entry, it occupies $256\cdot 4=1024$ bytes, whether one memory page or all 256 memory pages are mapped. A multi-level page table saves space in sparse address spaces by allocating lower-level tables only for the regions that need them. The tradeoff is extra dependent lookups during a page table walk; a translation lookaside buffer avoids repeating those lookups on a hit. ^[ref]

A translation lookaside buffer is a small hardware memory cache of virtual address to physical address mappings and their access attributes. A TLB hit finds a usable cached mapping for the current address space; access permissions still apply. A TLB miss means that mapping is absent from the translation lookaside buffer. It says nothing by itself about whether the memory page is resident. Evicting a translation lookaside buffer entry removes a cached translation, not the memory page's contents. ^[ref]

For the 256-byte example, a cached virtual page 0x12 to physical frame 0x07 mapping covers every offset from 0x00 to 0xff. Reads at virtual addresses 0x1234 and 0x1235 can reuse it to reach physical addresses 0x0734 and 0x0735. If the translation lookaside buffer is initially empty, the first read instead requires a page table walk; with a resident, readable mapping, it completes without a page fault. A write can fault even on a TLB hit because cached permissions deny it.

The diagrams show an ordinary x86 model with hardware page table walks. Some architectures use an operating system handler to refill the translation lookaside buffer after a TLB miss; that refill event alone is not a nonresident page fault. Temporal locality helps a small translation lookaside buffer serve repeated accesses, and one entry can cover many bytes. ^[ref]

A context switch does not universally flush the whole translation lookaside buffer. An address space identifier can distinguish translations with the same virtual page number in different address spaces; Intel's PCIDs support retaining translations across appropriate switches. The operating system must still invalidate stale translations when mappings or permissions change, following the architecture's rules, including coordination with other processors that could use them. ^[ref]

A page fault transfers control to the operating system when an access cannot proceed under the current paging translation or protection rules. The term includes both unavailable translations and forbidden accesses on x86. Intel's manual distinguishes these causes; AMD's error code likewise distinguishes ordinary not-present faults from protection violations. Other architectural causes, including malformed page table entries, also exist. ^[ref][ref]

The illustrative page table in paging separates three situations:

A page fault is not necessarily a program error or a storage-device read. Demand paging can allocate a zero-filled page frame without reading secondary storage. A copy-on-write write deliberately encounters read-only permissions; the operating system supplies a private copy and enables the write. A truly forbidden access may instead terminate the operating-system process. The handler interprets the fault using both architectural fault information and its own mapping policy. ^[ref]

For a nonresident memory page whose contents must be loaded, the handler obtains a page frame, possibly invokes page replacement, supplies the contents, updates the page table, arranges any necessary translation lookaside buffer invalidation, and resumes the operation. If no mapping or permission can legally be supplied, it reports failure. This mechanism lets ordinary accesses request work only when it becomes necessary. ^[ref]

// Target: computer-science.bigb

Choosing a resident memory page to evict when another memory page needs an occupied page frame. An unused page frame needs no eviction. A dirty memory page requires preservation before reuse, accounted for separately as page writeback. A page replacement policy balances likely future reuse against the overhead of tracking past memory references.

The opportunity comes from temporal locality: retaining a recently accessed memory page can spare a later nonresident page fault. Spatial locality helps consecutive accesses reuse the same memory page until they cross its boundary. A working set describes recent demand, while the resident set describes what is actually present. A small active footprint can fit in the available page frames even when the whole address space cannot. These are useful workload tendencies, not guarantees about future memory references.^[ref]

The page-reference trace below uses the counterexample discussed in Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others (chapter 22, p. 5) and makes the decisions explicit. FIFO page replacement ranks arrival time, LRU replacement ranks last access, CLOCK page replacement samples recent use, and optimal page replacement knows the remaining sequence in advance. Count misses first; page-replacement cost accounting separately counts page writeback and explains why fewer misses need not mean less total service time.

// Destination: computer-science.bigb

Making a memory page resident when it is first accessed, using a page fault to request the work. It can involve loading stored contents or allocating newly initialized contents.

// Target: computer-science.bigb

A slot in main computer memory that can hold one memory page of the selected size. Physical frame number 0x07 with 256-byte page frames starts at physical address 0x0700.

A contiguous unit of an address space used for paging. In the example, virtual page 0x12 consists of virtual addresses 0x1200 through 0x12ff.

For a nonnegative integer $n$ and a prime number $p$, the Legendre formula computes the prime exponent in a factorial without forming that huge product:Here $\lfloor x\rfloor$ is the floor function. The sum is finite: every term with $p^j>n$ is zero. When $n=0$, all terms vanish, agreeing with $0!=1$ and $v_p(1)=0$. The prime number hypothesis matters: a composite number does not give the same p-adic valuation or additive prime exponent. For example, the floor sum with $n=6,p=4$ is one, whereas $4^2$ divides $6!=720$.

Why count multiples repeatedly? Each multiple of $p$ in $1,\dots ,n$ contributes one factor of $p$; each multiple of $p^2$ contributes another; and so on. A factor $m$ with p-adic valuation $a$ occurs in exactly the first $a$ counts. Adding those contributions proves the formula.^[ref]

For the original example $n=50,p=3$,The five multiples $9,18,27,36,45$ each contribute a second factor of three. The factor $27$ contributes a third, so it appears in all three rows. Equivalently, among $1,\dots ,50$ there are eleven factors of p-adic valuation one, four of valuation two, and one of valuation three: $11+2\cdot 4+3\cdot 1=22$. Thus $3^{22}$ divides $50!$, while $3^{23}$ does not.

Repeated Euclidean division provides a practical evaluation: replace $q$ by $\lfloor q/p\rfloor$, starting from $q=n$, and add each new quotient until it is zero. This uses only the successive quotients $16,5,1,0$ for the example. The same calculation handles divisibility of binomial coefficients, where the p-adic valuations of the denominator factorials are subtracted.

Oxygen-16 is the stable oxygen isotope with eight protons and eight neutrons. It is the most abundant oxygen isotope in ordinary terrestrial material.

Its nucleus has spin zero, unlike oxygen-17, so isotope choice changes which nuclear-magnetic-resonance experiments are possible. Isotopic identity therefore affects both mass-sensitive measurements and nuclear-spin observability without changing the element's proton number.

An oxidation state is an electron-bookkeeping assignment to a chemical atom: its electric charge number after the ionic approximation of bonds. It helps identify oxidation and reduction and determine stoichiometry, even for covalent bonds without separate charged ions. In water, each hydrogen has oxidation state $+1$ and oxygen has $-2$; this does not assert that a water molecule contains two free protons and a free oxide ion.^[ref]

Three conventions answer different questions. Formal charge divides each bonding electron pair equally in a chosen Lewis structure. Oxidation state uses the ionic approximation of bonds. Partial atomic charge instead partitions the actual electron density and depends on that partition. In the ordinary water Lewis structure, every formal charge is zero although the oxidation states are not. Neither bookkeeping convention supplies numerical partial atomic charges.

An upward angular spectrum obtained from a horizontal field trace is exact in the homogeneous half-space above that reference plane. For a rough boundary $z=f(x)$, choose the plane above $\sup f$. A trace at $z=0$ is not physically defined in the medium if any part of the surface lies above it. Using such a mean-plane trace requires an analytic continuation convention; convergence of the continued spectrum down to the rough boundary is an additional hypothesis. Small-height boundary perturbation uses the reference plane formally order by order and is distinct from an exact expansion throughout an arbitrary rough domain.

Use $\hat{\psi }(\nu )=\int \psi (x,0)e^{-i\nu x}dx$ and $q(\nu )=\sqrt{k^2-{\nu }^2}$ on the upward branch. If the uncentered field correlation is translationally homogeneous and $⟨\hat{\psi }(\nu )\hat{\psi }({\nu }^{\prime }{)}^{\ast }⟩=2\pi S(\nu )\delta (\nu -{\nu }^{\prime })$, its correlation at height $z$ is the displayed integral. The propagating spectrum is unchanged; evanescent contributions decrease as $e^{-2\sqrt{{\nu }^2-k^2}z}$. A spectral measure of a stationary random field permits discrete coherent components. Without correlation homogeneity a double spectral covariance integral depends on both observation coordinates rather than only their separation.