Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A threonine residue is a threonine unit incorporated into a peptide or protein chain, conventionally represented by T. Its hydroxyl-bearing side chain can participate in hydrogen bonding and can be phosphorylated by suitable protein kinases. The side chain is retained during peptide-bond formation, while the amino and carboxyl groups become part of the backbone. Residue identity and modification state are therefore distinct information. [ref]
Glycolysis converts glucose into two pyruvate molecules, with a net two ATP and reduced NADH; it does not directly consume molecular oxygen. Pyruvate processing and the citric acid cycle, also called the TCA cycle, release carbon dioxide and supply reduced carriers. Thus releasing carbon dioxide and consuming molecular oxygen occur at different stages.[ref]
Biology 2e by Mary Ann Clark and others. Biology 2e, §7.2, Outcomes of Glycolysis; §7.3, Breakdown of Pyruvate and Citric Acid Cycle
An electron transport chain reoxidizes carriers such as NADH. Coupling some of its redox steps to proton transport establishes an electrochemical gradient; ATP synthase can use that gradient to form ATP from adenosine diphosphate and inorganic phosphate. This is oxidative phosphorylation. A separate route, substrate-level phosphorylation, transfers a phosphate group from a reacting substrate to adenosine diphosphate. In typical eukaryotic biological cells, the respiratory chain occupies the inner membrane of a mitochondrion.[ref]
Biology 2e by Mary Ann Clark and others. Biology 2e, §7.1, Substrate Phosphorylation; §7.4, Electron Transport Chain and Chemiosmosis, Figures 7.12–7.14
The useful achievement is controlled transfer: fuel oxidation can replenish an ATP supply that supports active transport and synthesis. ATP is a reusable chemical carrier, not newly created energy; ATP hydrolysis and the coupled cellular process have their own net free energy balance. Some fuel energy is dissipated as heat.[ref]
Biology 2e by Mary Ann Clark and others. Biology 2e, §7.1, ATP in Living Systems and Energy from ATP; §7.4, ATP Yield
There is no universal yield of or ATP per glucose. Actual ATP recovery depends on carrier transfer routes, coupling and diversion of intermediates to other metabolism. In particular, an oxygen uptake rate cannot be converted into an ATP production rate by assuming one fixed multiplier.[ref]
Biology 2e by Mary Ann Clark and others. Biology 2e, §7.4, ATP Yield: shuttle differences and use of intermediates
In the 1981 study, investigators incubated human adipocytes or their cell membranes from fat near the abdominal lining with epinephrine. They combined detection of bound ligands by radioactive decay with biochemical readouts: adenylyl cyclase activity, cAMP and released glycerol. Blocking alpha-2 adrenergic receptors increased the epinephrine response; blocking alpha-1 adrenergic receptors did not. A separate labeled-phosphate incorporation readout in a phospholipid showed the reverse blocker sensitivity. Thus the comparisons separated response branches.[ref]
Pharmacological Characterizations of Adrenergic Receptors in Human Adipocytes by Thomas W. Burns and others. Abstract, first through fourth paragraphs: human properitoneal preparations, radioligand binding, biochemical readouts; yohimbine versus prazosin comparisons
The glycerol readout indicates lipolysis, rather than directly measuring whole-body fuel use. Isolated adipocytes omit circulation and nervous input; blocker selectivity also limits the inference. These comparisons support receptor-specific responses in that preparation, not identical behavior in all biological cells.
A compound action potential is an extracellularly recorded sum of activity from multiple axons. Amplitude and waveform depend on recruitment and relative arrival times. The documented neuronal paired-pulse recovery experiment illustrates why recovery of a summed response is not recovery of one neuron.
For a deterministic binary operation on an abstract data type, let be its specified operation on abstract values and the implementation on concrete states. For every permitted valid input pair , require bothThe first condition preserves the representation invariant. The second makes a commutative diagram: either execute and then apply the abstraction function, or apply the abstraction function to both inputs and then execute the abstract operation ; both paths reach the same value. These conditions state functional correctness of a completed operation; termination is an additional obligation for algorithm correctness.[ref]
8.3 Module Documentation. Sections 8.3.3, Commutative Diagrams, and 8.3.4, Representation Invariants: matching abstract results and preservation of valid representations
For addition in the unreduced rational representation, chooseFor example, represents , precisely the sum of and . The short correctness argument uses nonzero denominators: and imply , preserving the representation invariant, and
Correct rational addition makes both paths agree; an invariant-preserving incorrect operation gives a different value
. Details. Now consider an incorrect implementation that uses addition on the numerators and multiplication on the denominators:It preserves the representation invariant for every valid input pair because its denominator is still . Yet represents , not the specified sum . Even perfect checks of the representation invariant before and after this call would miss the error: the result is a legal representation of the wrong rational number.
The incorrect operation also exposes an accidental dependence on representation. Replace by the equivalent state while keeping . The correct operation gives , still representing ; the incorrect operation gives , representing instead of its previous . A correct addition must yield the same abstract result for equivalent inputs, although its concrete outputs may differ. This is why checks against the formal specification should compare abstract values, including unreduced representations and representations with a negative denominator, rather than demand identical stored pairs.
The calculation assumes exact integers. An implementation with bounded storage must additionally specify how it handles products and sums outside its supported range; the mathematical argument alone does not establish its functional correctness. The bounded queue with encapsulation illustrates the corresponding need to account for returned status values and failed operations, alongside the abstract state transition.
Consider an original abstract data type whose values are rational numbers. Store an ordered pair of integers, interpreted as a numerator and a denominator. Use exact, unbounded integer arithmetic in this model. The storage space, representation invariant and abstraction function areThe representation invariant does not require a positive denominator or a reduced fraction. Consequently , and are three different concrete states with the same abstract rational number . Similarly, and both represent zero. The abstraction function is a surjection: every rational number has an integer numerator and a nonzero integer denominator, so every abstract value has a representation.
Both and violate the representation invariant; neither has a value under this abstraction function. By contrast, is completely valid. Simplifying it to the reduced fraction may be a useful implementation choice, but is not a requirement of this representation. Strengthening the representation invariant to require a positive denominator and a greatest common divisor of one would choose a unique stored representative for each rational number; every constructor and operation would then need to establish that stronger condition.
Equality of abstract values is therefore different from equality of stored ordered pairs. For valid and ,This defines an equivalence relation on : each equivalence class contains all representations of one rational number. An API equality operation can compare these cross-products using exact integer arithmetic. Comparing the two fields individually would incorrectly declare and unequal as rational numbers. The general reason is that an abstraction function may map several concrete values to one abstract value.[ref]
8.3 Module Documentation. Section 8.3.1, Abstraction Functions: several concrete values mapping to one abstract value; Section 8.3.4, Representation Invariants: valid domain of AF
The peak-to-peak amplitude is the difference between a signal's largest and smallest values over a stated interval. For , it equals and is independent of the offset . It is thus distinct from the maximum value measured relative to zero.
An oscilloscope trace that runs from to has peak-to-peak amplitude . If the trace is sinusoidal, its offset is , its peak amplitude about that offset is , and its alternating component has root mean square . For a nonsinusoidal or noisy signal these conversion factors need not hold. Reporting the observation interval matters because a rare noise spike can change the extrema without much change in the root mean square.
For a synthetic illustration, choose , , and . Using molar gas constant gives and under the ideal gas law. These are chosen model inputs, not observations of a particular chemical substance.
Vapor molar mass inference: apparatus, independent readouts, and the assumptions behind a synthetic ideal gas law calculation
. Details. An error's direction follows the model. Extra exterior water raises the apparent and hence . If a fraction of the hot gas particles is residual air, and only the unknown vapor contributes to recovered , an otherwise ideal gas calculation gives . For a pure nonideal vapor, define ; then , so the direction depends on . The dye endpoint alone cannot establish gas purity, thermal equilibrium, or ideality. These conditional checks explain why the same apparatus cannot provide a universal molar mass measurement for arbitrary mixtures or substances that decompose on heating.
University Physics Volume 3 by Samuel J. Ling and others 2.3 Images Formed by Refraction by
Codex 0 2026-10-14
University Physics Volume 3 by Samuel J. Ling and others 2.8 Microscopes and Telescopes by
Codex 0 2026-10-14
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact









