Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A virtual machine presents a specified machine interface implemented using another system. A system virtual machine supplies virtual processors, memory and devices to a guest operating system. A hypervisor mediates access to the underlying resources; execution can combine hardware assistance and software emulation.[ref]
Introduction to System Emulation in the QEMU documentation. system emulation and virtualisation accelerators
For example, a guest can maintain its own kernel and filesystem view while a host schedules several guests on one physical machine. A Java virtual machine instead exposes a bytecode execution model to programs, illustrating a different level of abstraction. A container usually shares the host kernel rather than supplying a separate full guest kernel. The interface being virtualized determines which compatibility and isolation properties a particular virtual machine provides.
The IBM 1401 is a transistorized data-processing computer introduced in 1959, used for business workloads involving punched cards, printing and magnetic tape. Its stored programs transformed records and coordinated input/output devices, making it a historically important example of computing organized around data processing.[ref]
It also provides a concrete scientific-computing benchmark. Bresenham reported a 333-core-location IBM 1401 program controlling an IBM 1627 Plotter, with approximately1.5 milliseconds of computation between successive plotted increments.[ref] The report connects an algorithm's arithmetic choices to actual program storage and timing. These are measurements for that implementation and task, rather than universal instruction timings for every 1401 program.
A plotter is a computer-controlled drawing device that produces physical marks by moving a pen or another marking tool relative to a surface. Geometric commands become motions and pen-up or pen-down actions. In a digital stepping plotter, available moves impose a coordinate mesh, so a mathematical line must be approximated by legal steps.
Jack Elton Bresenham's 1965 paper describes a plotter with eight possible neighbor moves, typically on a mesh spaced one hundredth of an inch apart.[ref]
Algorithm for computer control of a digital plotter by Jack Bresenham. printed p.25, movement directions, control pulses and mesh spacing
For a segment from to , the controller must distribute two upward increments among five rightward increments. Bresenham's line algorithm updates an integer decision value to choose successive moves. This connects computational geometry to an apparatus whose resolution and permitted motions determine the drawing.The Macintosh is a family of computers made by Apple. Its early machines provide a concrete example of integrating a processor, computer memory, a display and pointing-device input into an interactive system. The original 128K model and its 512K successor combined a built-in screen with keyboard and mouse connections; the service manual distinguishes their memory capacities.[ref]
Macintosh Service Source by Apple Computer. Basics, Overview; Specifications, Memory and I/O Devices
The early display contained pixels. To model a monochrome framebuffer with one bit per pixel, the minimum packed image storage isThat is bytes, before any additional image buffers or program data. This is an original storage calculation using the documented display dimensions, rather than a claim about a particular program's memory allocation.[ref]
Macintosh Service Source by Apple Computer. Specifications, Sound and Video p. 6, 512×342 bit-mapped display; one-bit depth also listed at support.apple.com/en-om/112190
The example connects a visible pixel to an addressable representation in computer memory. Drawing a black line requires changing selected bits; a graphical user interface uses such drawing operations to represent controls and documents. Raising either display dimension increases storage even if the processor and the number of values represented per pixel remain unchanged.
Direct numerical simulation of a turbulent fluid numerically solves the specified governing equations while resolving the dynamically relevant turbulent and dissipative scales. It does not replace unresolved turbulent motions with a subgrid-scale model. The calculation still assumes a continuum model, boundary conditions and a finite numerical representation; direct does not mean exact or atomistic.
A published example solves the coupled velocity, thermal and compositional equations for fingering convection with a pseudospectral method and triply periodic perturbations. The authors explicitly require resolving the dissipation scale because they use no subgrid-scale model, and inspect composition and vorticity fields to assess resolution. The simulations inform a reduced transport prescription for stellar calculations, rather than resolving an entire star.[ref]
Chemical Transport and Spontaneous Layer Formation in Fingering Convection in Astrophysics by Justin M. Brown and others. Section 2, equations 6–9 and numerical-method paragraphs, manuscript pages 9–10
An exact laminar check helps explain numerical verification. For unforced incompressible Navier-Stokes equations with constant kinematic viscosity , take constant pressure andin a periodic box containing whole wavelengths. The divergence vanishes and , so the equation reduces to . The mean kinetic energy per unit mass is thereforeA solver should recover this decay and energy budget under numerical refinement. Passing the check is useful but does not establish that a turbulent calculation resolves its smallest relevant scales. Direct numerical simulation also needs adequate box size, time resolution and statistical sampling.
An orientation predicate determines on which side of an oriented geometric object a point lies. For planar points , compute the determinantIn coordinates with rightward and upward, means a counterclockwise turn from through to , a clockwise turn, and collinearity. Its magnitude is twice the area of the triangle.
For and , gives , while gives . Convex hull and segment-intersection algorithms use these signs to make discrete decisions. A tiny round-off error can reverse a nearly zero sign and make those decisions inconsistent. Jonathan Richard Shewchuk's adaptive arithmetic computes extra precision only when needed to certify the sign for the supplied coordinates.[ref]
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates by Jonathan Richard Shewchuk. orientation tests, determinant signs and adaptive exact arithmetic
A computational model of cognition is an explicit set of mathematical or algorithmic rules connecting inputs and previous experience to predictions about behaviour. Its variables can represent internal quantities, while its predictions concern observable choices, reaction times or other measurements. This makes a proposed cognitive mechanism precise enough to simulate and test.[ref]
Ten simple rules for the computational modeling of behavioral data by Robert C. Wilson and Anne G. E. Collins. What is computational modeling of behavioral data?
A simple reinforcement learning example updates a predicted value after a reward :The learning rate controls the contribution of the reward prediction error . With , constant reward and , successive values are , and . Equivalently, . These are model predictions for constructed inputs, not measured human responses.[ref]
Predicting choices additionally requires a rule linking values to actions. Parameter estimation can fit such a model, but a good fit alone does not establish that its internal variables are uniquely recoverable. Parameter recovery tests this by simulating data from known parameters and checking whether the fitting procedure retrieves them.[ref]
Ten simple rules for the computational modeling of behavioral data by Robert C. Wilson and Anne G. E. Collins. Check that you can recover your parameters; Box 4
This distinguishes a useful formal account from a merely suggestive verbal description.The total chromatographic retention time is the elapsed time from sample injection to the maximum of a specified component's chromatographic peak. It includes the time spent moving through the system as well as the additional delay associated with retention. It is a property of the analyte under specified conditions, not a universal identifying number attached to the molecule.[ref]
IUPAC Compendium of Chemical Terminology, fifth edition (Gold Book) by International Union of Pure and Applied Chemistry. Total retention time, entry10039: injection-to-peak-maximum definition and inclusion of hold-up time
Let denote the hold-up time measured with a suitably unretained marker. The adjusted retention time is . For example, a peak at minutes with minutes has minutes. Its total passage time and its delay relative to an unretained marker answer different questions. At constant measured volumetric flow , the corresponding total retention volume is ; milliliters per minute and minutes give milliliters.[ref]
IUPAC Compendium of Chemical Terminology, fifth edition (Gold Book) by International Union of Pure and Applied Chemistry. Total retention time, entry10039, time-volume relation; retention factor, entryR05359, adjusted and hold-up quantities
A sample peak matching a reference peak's chromatographic retention time under the same conditions supports an identity assignment, but another compound may coelute. Changing solvent composition or column conditions can change without changing molecular identity. A detector's peak area and chromatographic resolution supply different information from the time at which the maximum occurs.
Chromatographic resolution measures the separation of two peaks relative to their widths. With chromatographic retention times and baseline widths , its conventional definition isThe numerator and denominator have the same units, so is dimensionless. A large time difference does not by itself imply good separation if both peaks are correspondingly broad.[ref]
IUPAC Compendium of Chemical Terminology, fifth edition (Gold Book) by International Union of Pure and Applied Chemistry. Peak resolution, entryP04465: average baseline-width definition
For an original example, peaks at and minutes, each minutes wide at the base, have . If their widths increase to minutes while their peak times stay fixed, . Measuring only the peak centers would miss the deterioration.
Simply rescaling the time axis cannot change chromatographic resolution. If all times and widths in the first example double, then again. This is a statement about a rescaled trace, not a claim that changing the flow of a real column leaves its separation physics unchanged.
The peak-width convention must be stated. Half-height widths are smaller than baseline widths and cannot be substituted into the same formula without the corresponding conversion. Peak asymmetry, overlapping components and unequal signal strengths can also make a single reported an incomplete account of whether a particular quantitative measurement is reliable.
Affinity chromatography separates a target through its reversible, selective binding to a ligand immobilized on a chromatographic stationary phase. The chromatographic mobile phase carries a mixture through the material; components with little binding tend to pass through, while the target is retained. Washing removes unbound material, and changing suitable solution conditions or adding a competitor can release the target. Strong binding and recoverable binding are different design requirements.[ref]
Agarose Derivatives for Purification of Protein by Affinity Chromatography by Pedro Cuatrecasas. Opening description: immobilized ligands and reversible macromolecular binding
For a concrete experimental comparison, prepare two otherwise similar columns: one bearing the intended ligand, the other lacking it. Load the same protein mixture, collect the flow-through, wash, and then collect the released material. Target enrichment specifically on the ligand-bearing material supports the intended binding mechanism. Retention on both columns instead suggests an additional interaction with the support; disappearance from the flow-through alone does not prove successful purification.
An original numerical example separates recovery from purity. Start with milligrams of target in milligrams of total protein. If the collected fraction contains milligrams of target in milligrams total, its target purity rises from to , while target recovery is . An activity assay may answer a further question: whether the recovered target remains functional.
In his 1970 report, Pedro Cuatrecasas described agarose derivatives for presenting binding partners on an insoluble support. The arrangement makes molecular recognition usable as a preparative tool: retain a chosen partner in one place, pass a complex mixture over it, and recover material selected by that interaction.[ref]
Agarose Derivatives for Purification of Protein by Affinity Chromatography by Pedro Cuatrecasas. Opening discussion of agarose support and ligand attachment
Primary source: www.brynmawr.edu/sites/default/files/directory/cv/klukacs.pdf
Verified locator: Institutionally hosted author CV, April 2009. Page 1 prints Krynn DeArman Lukacs; p. 3 lists the joint Jorgenson/Lukacs capillary-electrophoresis publications and connects the expanded name to K. D. Lukacs. Its Clinical Chemistry pagination is erroneous; use the primary publisher record 27(9), 1551–1553 for that paper.
Zone electrophoresis in open-tubular glass capillaries by James W. Jorgenson and Krynn DeArman Lukacs by
Codex 0 2026-11-05
Primary source: pubs.acs.org/doi/abs/10.1021/ac00231a037
Verified locator: ACS primary author-information page: James W. Jorgenson and Krynn DeArman. Lukacs, Analytical Chemistry 53(8), 1298–1302; issue publication 1 July 1981; DOI 10.1021/ac00231a037. Publisher punctuation after DeArman is normalized using the institutional CV spelling Krynn DeArman Lukacs. The 2002 online date is not the original publication date. Full article PDF not inspected.
Free-zone electrophoresis in glass capillaries by J. W. Jorgenson and K. D. Lukacs by
Codex 0 2026-11-05
By J. W. Jorgenson and K. D. Lukacs, retaining the exact initial-only primary byline. Clinical Chemistry 27(9), 1551–1553, 1 September 1981. Publisher abstract: academic.oup.com/clinchem/article-abstract/27/9/1551/5666551 . The experiment used 75 micrometre internal-diameter, 100 cm glass capillaries, a fluorescence detector and 30 kV. It separated fluorescent derivatives of amino acids, peptides and urinary amines; the detector requirement is part of the reported result. Full PDF not inspected.
Official first-party Empower technical documentation, article 261397, Tip of the Week 327. Procedure Step 1 defines migration-time reporting; Step 5, items 4–6 define time-corrected peak area as area divided by migration time, its percentage of total corrected area, and apparent mobility calculated from capillary lengths, migration time and applied potential difference. Used for stated software measurement conventions, not as an absolute concentration calibration or a clinical assay protocol. No publication date inferred from the page copyright.
Copolymerization. I. A Basis for Comparing the Behavior of Monomers in Copolymerization; The Copolymerization of Styrene and Methyl Methacrylate by Frank R. Mayo and Frederick M. Lewis by
Codex 0 2026-11-05
Primary publisher title, exact author bylines Frank R. Mayo and Frederick M. Lewis, Journal of the American Chemical Society 66(9), 1594–1601, 1 September 1944. DOI 10.1021/ja01237a052. Publisher article metadata and first-page preview verified; full access not claimed. Used for the historical paper and authorship, not as proof of uninspected experimental details.
Official IUPAC recommendation announcement; Recommendations published in Pure and Applied Chemistry, advance online 26 September 2025, DOI 10.1515/pac-2024-0235. Indexed primary announcement: determine terminal-model reactivity ratios from conversion and copolymer composition in three or more reactions with different initial monomer compositions; integrated composition modelling, joint confidence regions and measurement errors. Full technical record: www.degruyterbrill.com/document/doi/10.1515/pac-2024-0235/html . The announcement reader returned 403; the indexed institutional text and published technical introduction were readable. No individual recommendation byline is inferred from the institutional announcement.
Verified locator: Official two-page product datasheet, revision string 06/11/2020. Page 1 identifies an ethylene vinyl acetate copolymer and lists typical vinyl acetate content 18.2 wt% in Resin Properties. Notes distinguish typical values from specifications. Used as a composition-reporting example, not as the identity of the film in the 1996 laser-capture paper.
Standard Guide to Fluorescence - Instrument Calibration and Validation by Paul C. DeRose by
Codex 0 2026-11-05
NISTIR 7458, Paul C. DeRose, October 2007; primary cover title/byline, not the web index title ending Correction. Sections 5–6 describe emission-response and excitation-beam correction. Section 11.2, printed p. 20, Eq. (2), relative methods: absorbance, corrected emission, excitation intensity and refractive index enter the comparison. Section 11.1.1 discusses optically dilute samples; no standard numerical quantum yield adopted without conditions.
Official named directory profile: degrees in chemical engineering and analytical chemistry; research in conversion chemistry, catalysis and reaction engineering. Named portrait link: apps.ualberta.ca/profile/photo/deklerk . The exact image association is verified on the institutional profile, but the approved image reader returned a cache miss; no guessed replacement or repository copy.
IUPAC Gold Book fifth edition, entry 08030, measurement procedure with standard addition, DOI 10.1351/goldbook.08030. Definition and Note: compare sample indications with indications after measurement-standard additions; unbiased under a multiplicative matrix effect. Origin: Metrological and quality concepts in analytical chemistry, IUPAC Recommendations 2021, printed p. 1012. Official indexed definition verified; direct page reader returned access denial.
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





