Nitrite reductase Created 2026-10-31 Updated 2026-11-05
Nitrite reductase catalyses reduction of nitrite. Assimilatory forms can produce ammonium for incorporation into cellular material; other forms produce nitric oxide in respiratory nitrogen metabolism. These are distinct reactions with different electron requirements and biological purposes. The generic name therefore needs a specified product and electron donor before it identifies a precise catalytic activity. [ref][ref]
Glutamine synthetase Created 2026-10-31 Updated 2026-11-05
Glutamine synthetase incorporates ammonium into glutamate to form glutamine, coupled to ATP hydrolysis. Glutamine can then supply nitrogen for other biosynthetic reactions, including the reaction catalysed by glutamate synthase. Coupling nitrogen incorporation to ATP consumption helps explain why nutrient assimilation depends on energy availability as well as the supply of ammonium. [ref]
Glutamate synthase Created 2026-10-31 Updated 2026-11-05
Glutamate synthase transfers the amide nitrogen of glutamine to 2-oxoglutarate with coupled reduction, producing two glutamate molecules. It works with glutamine synthetase in nitrogen assimilation: the first enzyme captures ammonium into glutamine and the second distributes that nitrogen into glutamate. Different forms use different electron donors, so the enzyme name alone does not specify whether NADPH, NADH or reduced ferredoxin supplies reducing power. [ref]
Biogeochemical cycle Created 2026-10-31 Updated 2026-11-05
A biogeochemical cycle is movement and transformation of a chemical element through living organisms and the nonliving environment. Uptake, feeding, decay and geological processes connect reservoirs such as the atmosphere, soils and oceans. The nitrogen cycle is an example in which transformations between chemical forms determine biological availability.
Soft state 2026-10-31
Soft state is maintained through refreshes and expires when they cease. Continuing participants can rebuild it through later communication, trading refresh overhead and temporary inconsistency for automatic cleanup and recovery.
Hard state 2026-10-31
Hard state persists until explicitly changed or deleted. The distinction from soft state concerns maintenance and recovery rules rather than simply whether the storage is volatile.
Termination detection 2026-10-31
Round-robin arbitration 2026-10-31
Binary-coded decimal 2026-10-31
Represent a decimal number by coding each decimal digit separately as four bits of weights . The codes 10–15 are unused for one digit; a Boolean circuit must specify whether these combinations produce a defined result or are don't-care conditions.
Seven-segment display 2026-10-31
Output pulse 2026-10-31
A temporary excursion of an output logic signal to its active level. A clocked controller may specify the duration in complete clock periods, rather than relying on an analogue delay.
Binary multiplier 2026-10-31
A digital circuit implementing binary multiplication. A combinational logic implementation forms shifted partial products with AND gates and combines them with adders. A sequential circuit can instead reuse one adder, storing a partial sum, a shifted multiplicand, and the remaining multiplier in digital registers. If those quantities are , the update , , preserves . Starting with and stopping when therefore produces , provided widths prevent overflow.
Moult Created 2026-10-31 Updated 2026-11-05
A moult is replacement or shedding of an outer covering during development. In an arthropod, shedding an exoskeleton permits expansion before the new covering hardens. The process therefore connects growth to temporary changes in mechanical protection.
Relational database 2026-10-31
Database query Created 2026-10-31 Updated 2026-11-05
A database query requests information computed from stored data. It can filter database tuples, project selected database attributes, combine database relations or aggregate groups. For example, a query can return the count of orders per customer rather than retrieving every order separately. The query specifies a result; a database query plan chooses operations for computing it. Equivalent result specifications can have very different costs under different indexes and data sizes. In SQL, duplicate rows and null values require conventions beyond the simplest mathematical relational algebra.
Database page 2026-10-31
A block transferred between storage and memory; database query plan costs are often estimated by the number of such transfers.
Database transaction Created 2026-10-31 Updated 2026-11-05
A database transaction groups database operations into a unit that can be committed or rolled back. Transaction atomicity means that its updates take effect together or not at all. Transaction durability concerns retaining an acknowledged committed result after a failure; transaction isolation controls which effects concurrent database transactions may observe.[ref]
Transactions in the PostgreSQL documentation. version 18, section 3.4, all-or-nothing updates, permanent recording and visibility
For example, transferring seven units from an account with balance twenty to one with balance five should produce balances thirteen and twelve. A failure after only the debit must not leave thirteen and five as a completed transfer. In SQL, a transaction block uses
BEGIN, then the related updates, then COMMIT; ROLLBACK abandons the uncommitted changes.[ref]Isolation is a separate question from grouping statements. Two concurrent transfers can each read an old balance before either writes. A correct application must select suitable transaction isolation or locking and handle possible conflicts; merely putting the statements in a database transaction does not establish every desired invariant. The corresponding database schedule records their interleaving.
Entity-relationship model Created 2026-10-31 Updated 2026-11-05
An entity-relationship model describes identifiable entities, their database attributes and the relationships between them before committing to a physical database layout. Entity types classify the objects being recorded; relationship types describe associations, possibly with their own database attributes. Peter Pin-Shan Chen developed the model as a way to retain the meaning of data while relating several existing database models.[ref]
The Entity-Relationship Model-Toward a Unified View of Data by Peter Pin-Shan Chen. sections 1–2.3, entities, relationships, attributes and multilevel views
For example, a laboratory records scientific instrument entities and measurement entities, with a relationship saying which scientific instrument produced each measurement. An scientific instrument's serial number is an identifying database attribute. A calibration date can describe an scientific instrument, while a usage duration can describe a particular relationship occurrence. Distinguishing these placements prevents unrelated facts from being conflated.
Cardinality and participation constraints add rules: every measurement might require exactly one scientific instrument, while an scientific instrument can produce zero or many measurements. An entity-relationship diagram records these choices. Translating the design to a relational schema introduces database relations, identifiers and appropriate foreign keys; the diagram itself does not require a particular index or file structure.
Referential integrity 2026-10-31
A constraint requiring stored identifiers or references to denote valid represented entities, except for explicitly permitted absent-reference markers. For a node set with successor identifiers, integrity can require each nonnull successor identifier to equal the identifier of some node in . This is separate from identifier uniqueness and from order constraints on values along edges.
Decimal counter 2026-10-31
A decimal counter stores a nonnegative integer using an array of base-ten digits, with the least significant digit first. Increment resets trailing nines and increases the next digit, or wraps modulo if all digits are nines. Starting at zero, the exact number of digit changes in increments is . This is an aggregate analysis proving a constant amortized cost per increment under unit-cost digit updates. An arbitrary initial value contributes an additional in Big O notation.
There are unlisted articles, also show them or only show them.