An event handler is code invoked to respond to a particular software event, such as a key press, resize or completed operation. The event's data identifies what happened; the event handler interprets it using the application's current state. Qt dispatches an event object to its target and then to an appropriate event-specific method.^[ref]

For example, a resize event handler can recompute a plot's displayed layout from the new dimensions. A later paint software event draws that layout. Keeping each response short lets an event loop handle other work promptly. When delivery is delayed, the application's state may already have changed, so the original occurrence and its eventual handling must be distinguished.

A computer program specifies operations or constraints that an implementation can execute or interpret. Its representation can be source code, bytecode or machine code; the same intended computation can have several computer program representations. Its behavior depends on the language semantics, input and execution environment.

For example, a source expression adding two variables is not yet one fixed result. A compiler can translate it into lower-level operations, while an interpreter or CPU performs those operations for particular values. Calling a library or reading a file makes additional parts of the environment relevant. A computer program is consequently distinct from its one observed execution trace and from the abstract algorithm it implements: two programs can implement the same algorithm with different representations, error behavior or resource costs.

Computer programming constructs, tests and revises programs that express computations in an executable or interpretable form. It connects a problem specification to data representations, algorithms, interfaces and error handling. Writing syntax is one part; deciding what results and failures should mean is also part of the task.

For example, computing an arithmetic mean requires representing the observations, accumulating their sum and dividing by the count. The computer program must also define what happens for an empty input, unavailable data or a number representation that cannot hold an intermediate result. Choosing an algorithm and testing ordinary examples does not automatically settle those boundary cases. A useful implementation makes its assumptions visible and supplies evidence through tests, analysis or proofs appropriate to the claim.

Formal methods use mathematically defined models, specifications and reasoning techniques to describe and analyze systems. They include writing a formal specification, proving properties through formal verification, exploring a finite model by model checking and deriving information through static program analysis. A method's guarantee is relative to its model and assumptions.

For example, a loop summing an array can maintain the invariant that the current accumulator equals the sum of the entries already visited. Initialization, preservation by one iteration and the exit condition establish the returned sum; a separate termination argument shows that an answer is reached. Arithmetic and array bounds must be specified, since a proof using unbounded integers need not describe overflowing machine arithmetic.^[ref]

A software package is a unit of software distribution or installation, typically containing code, associated files and metadata describing its identity, version and software dependencies. It may contain an application, several software libraries or supporting data. The exact packaging format determines which metadata and installation operations are available.

For example, installing a numerical application can also require installing a compatible array software library. Pip reads requirements from Python distribution files and uses dependency resolution to choose compatible versions.^[ref] One distribution unit need not correspond to one importable module. Distinguishing the shipped artifact from the names imported by code avoids assuming that every import name is also an installable package name.

Dependency resolution chooses compatible software package versions and their transitive requirements for a requested installation. It is a constraint satisfaction problem: choosing a version can introduce additional requirements, which may invalidate choices made earlier. Pip uses backtracking to reconsider such choices.^[ref]

If $A$ requires library $L$ at version at least 2 but below 4, and $B$ requires $L$ at least 3 but below 5, the shared allowed interval is versions at least 3 but below 4. If $B$ instead requires at least 4, no single version satisfies both. Downloading more candidates cannot remove that contradiction. Recording the selected versions preserves a solution to those constraints; it does not by itself record all execution conditions.

A dependency graph represents requirements as a directed graph. Choose an explicit edge convention: here $A\to B$ means that component $A$ requires component $B$. A direct edge records an immediate requirement; a directed path records a transitive requirement. Pip's resolver must discover both a requested software package's requirements and the requirements of its dependencies.^[ref]

For example, if application $A$ requires software library $B$ and $B$ requires $C$, changing $C$ can affect $A$ even without an edge $A\to C$. In an acyclic build dependency graph, a topological order of the reversed edges puts prerequisites first. Cycles require special treatment: the graph alone does not establish that a set of mutually dependent build steps can execute. Edge labels can additionally record required versions or build configurations.

A software library is reusable code exposed through an interface for other computer programs to call. It can supply operations such as sorting, text decoding or solving a linear system. Clients depend on the interface and its behavioral contract rather than having to copy the implementation.

A compiled software library can be linked into a computer program or supplied as a shared component loaded for execution. CMake distinguishes static, shared and other library targets in a build description.^[ref] For example, two applications can call the same numerical routine with different arrays. Reusing the implementation saves duplication, while both callers must still satisfy its dimension, precision and error-handling requirements. A software package is a distribution unit and can contain several software libraries.

A container image packages a filesystem description and execution configuration used to create software containers. It contains such things as application files, libraries and a default command. Image layers and content identifiers permit sharing unchanged content; a running container adds execution state and usually a separate writable layer.^[ref]

For example, two containers can start from the same image while receiving different input files and environment settings. Their results need not match merely because their image matches. A container image digest identifies particular image content, while a movable tag can later refer to a different image. Most containers share a host kernel, so an image is not necessarily a complete guest operating-system installation. Reproducing a calculation also requires its inputs, configuration and compatible host facilities.

A colloidal particle is a small dispersed object whose dynamics can be strongly affected by thermal motion and interactions with the surrounding medium. Its behavior bridges molecular and macroscopic descriptions: an optical microscope can track a particle while the surrounding fluid produces unresolved random forces.

For a dilute spherical particle of radius $a$ in a Newtonian fluid of viscosity $\eta$, the Stokes–Einstein relation gives $D=k_{B}T/(6\pi \eta a)$ under its usual continuum assumptions. Larger particles diffuse more slowly. Surface forces, concentration, boundaries and nonspherical geometry can invalidate this simple expression, so the observed motion also probes the particle's environment.

Intergroup bias is a systematic difference in judgments, feelings or behavior toward people associated with different social groups. It can favor an ingroup, disadvantage an outgroup or combine both tendencies. Social categorization identifies the grouping; intergroup bias concerns an asymmetric evaluation or response, so group membership alone does not establish bias.

For an original measurement example, present otherwise matched descriptions with different group labels and compare resource allocations or evaluations. The comparison must specify the relevant equal-treatment baseline and control information that could independently affect the decision. A judgment task and an allocation task can reveal different aspects of the response.

Research on intergroup contact asks when interaction changes these outcomes. Thomas F. Pettigrew and collaborators' original meta-analysis combined evidence across many studies and examined the relation between contact and prejudice. Such a synthesis does not make every included association a randomized causal effect; study design and the conditions of contact remain part of the interpretation.^[ref]

Mental health stigma concerns devaluation and disadvantage associated with actual or attributed mental disorders. It can involve stereotypes, prejudice, avoidance and discrimination. These are related but distinguishable outcomes: knowing factual information about a condition does not necessarily determine how someone treats a person associated with it.

Sarah Clement and collaborators compared filmed social contact, live social contact and a lecture condition in a randomized controlled trial with student nurses. They measured attitudes, emotional reactions, intended proximity and knowledge immediately after the intervention and at four-month follow-up. Keeping these measures separate makes clear what a claim of reduced mental health stigma actually refers to.^[ref]

A stated willingness to interact is evidence about intended behavior, rather than a direct observation of every subsequent interaction. Interpreting an intervention therefore requires its measurement instruments, comparison condition and follow-up interval, not just a single positive summary label.

Social group size is the number of individuals assigned to a social group under a stated membership rule and observation period. A headcount at one moment, a count of regular members and the number present during an experiment can differ. Report which quantity was measured before comparing groups.

The way groups are sampled changes their apparent typical size. Consider two groups containing 2 and 8 animals. Their arithmetic mean size is $(2+8)/2=5$. If an animal is instead sampled uniformly from the ten individuals, the expected size of its group isMore animals experience the larger group. For group sizes $n_1,\dots ,n_k$, this individual-weighted mean group size is ${\sum }_i{n}_i^2/{\sum }_i{n}_i$, rather than ${\sum }_i{n}_i/k$. These are original illustrative calculations, not measured animal data.

Social group size also affects the interpretation of replication. A finch experiment used 70 Bengalese finches in seven groups and 58 white-rumped munias in six groups. The groups contained ten birds each except one eight-bird munia group. Those totals describe birds and groups, not interchangeable counts of independent treatment assignments.^[ref] The experimental unit must follow the design; a larger headcount alone does not solve pseudoreplication.

Slow-wave sleep is a deep stage of non-rapid eye movement sleep characterized by prominent slow, high-amplitude activity in an electroencephalography recording. It is a physiological classification based on measured brain activity and other sleep criteria, rather than simply an unusually motionless posture. In current human staging it broadly corresponds to N3. ^[ref]

Sleep-stage identification can guide interventions. In a human experiment, an odour associated with earlier learning was presented again during slow-wave sleep; subsequent declarative-memory performance was compared with control conditions. ^[ref] This links a defined physiological state to an experimentally timed cue; it does not establish that every kind of memory depends exclusively on that one stage.

Orthosilicic acid is the monomeric silicic acid $\mathrm{Si}(\mathrm{OH}{)}_4$, with four hydroxyl groups attached to a silicon center in approximately tetrahedral molecular geometry. The formula can also be written ${\mathrm{H}}_4\mathrm{Si}{\mathrm{O}}_4$. These are two ways of counting the same atoms, not two different compounds. Dissolved orthosilicic acid is a molecular precursor from which organisms can construct silica.^[ref]

Its distinction from a silica network is visible in a condensation reaction: two hydroxyl-bearing sites can form a silicon–oxygen–silicon bridge while releasing water. Continuing such reactions produces connected species, so total dissolved silicon is not automatically the concentration of free monomer.

For a numerical example, one millimole of molecular orthosilicic acid contains one millimole of silicon atoms and four millimoles of oxygen atoms. In a transport experiment, however, counting atoms alone is insufficient: a silicon transporter must recognize the actual dissolved species. Purified diatom transporters tested near neutral pH transported silicic acid in a sodium-dependent assay, linking this molecular form to biological uptake.^[ref]