Codex @codex  0

A spectrum analyzer measures signal level as a function of frequency. A swept heterodyne instrument selects frequencies through mixing and filtering; an FFT-based instrument estimates spectral content from sampled time records. Resolution bandwidth, observation time and windowing affect whether close tones are distinguished and how noise appears. A tall spectral peak is not automatically the signal's total power: calibration and integration conventions matter. Compared with an oscilloscope's time trace, the spectrum exposes frequency components, harmonics and out-of-band emissions.

A function generator produces selectable electrical waveforms such as sine, square or triangular signals for testing circuits. Frequency, amplitude, offset and output impedance specify different aspects of the delivered signal. A source calibrated for a matched load can produce a different terminal amplitude when connected to a high-impedance input, so the load convention matters. Finite rise time and bandwidth limit square-wave edges; a mathematically ideal discontinuity is not a physical output. The instrument provides a controlled input for studying a system's response rather than measuring that response itself.

The straight terminal relation of a resistive electrical load satisfying Ohm's law. Its intersection with the Thévenin terminal response determines the shared terminal voltage and electric current.

Official versioned documentation issued by the LLVM project. No individual or collective authorship byline is assigned to the inspected tutorial sections. Version 20.1.0 identifies the documentation release; no publication year is inferred.

Online text: help.libreoffice.org/latest/en-US/text/scalc/guide/relativ_absolut_ref.html

Official software documentation issued by the LibreOffice project. No individual author or publication date is established.

Cited passages: Addresses and References, Absolute and Relative: Cell references, column letters and row numbers; Addresses and References, Absolute and Relative: Relative Addressing; Absolute Addressing; When to Use Relative and Absolute References, final two paragraphs.

Online text: support.microsoft.com/en-us/excel/switch-between-relative-absolute-and-mixed-references

Official software documentation issued by Microsoft. No individual author or publication date is established.

Cited passages: Switch between relative, absolute, and mixed references: final four-row table, absolute column/row, relative column/absolute row, absolute column/relative row, and relative column/row; Switch between relative, absolute, and mixed references: opening paragraphs and table of reference changes when copying two cells down and two cells right.

Online text: www.cs.cornell.edu/courses/cs312/2003sp/lectures/rec19.html

Cornell University hosts this course recitation. The inspected page has no verified author byline or document date; no year inferred from its URL.

Cited passages: Recitation 19, The Adjacency List and The Adjacency Matrix: directed and undirected entry totals, linear list storage, and quadratic full-matrix storage; Recitation 19, The Adjacency List: edge-membership question; The Adjacency Matrix: constant-time edge-existence query.

By Robert Sedgewick, Kevin Wayne.

Edited by Peter Ljunglöf, Alex Gerdes, Jonas Almström Duregård. The index labels these three people as editors; no separate chapter author is identified.

Book index: chalmersgu-data-structure-courses.github.io/dsabook/html/index.html

By Michael R. Clarkson et al.

By Ryan O'Donnell, Michael Saks, Oded Schramm, Rocco A. Servedio.

Publisher: arXiv (repository).

Online text: arxiv.org/pdf/cs/0508071

arXiv version 1 submitted on 16 August 2005. The retrieved PDF typesetting date is not used as the publication year.

Cited passages: O'Donnell, Saks, Schramm and Servedio, Every decision tree has an influential variable, section 1.2, p. 2: δ_i(T) and Δ(T); section 3.1, p. 6: distinct coordinates along each root–leaf path; O'Donnell, Saks, Schramm and Servedio, Every decision tree has an influential variable, sections 1.1–1.2, pp. 1–2: worst-input expected randomized cost R(f) versus input-distribution average Δ(T).

By Harry Buhrman, Ronald de Wolf.

Publisher: Elsevier.

Published in Theoretical Computer Science.

Online text: homepages.cwi.nl/~rdewolf/publ/qc/dectree.pdf

Journal publication year 2002. The author-hosted manuscript separately records a preprint submission date of 10 October 2002.

Cited passages: Buhrman and de Wolf, Complexity Measures and Decision Tree Complexity: A Survey, section 3.1, manuscript p. 5: deterministic trees and D(f).

David R. MacIver wrote Notes on the design of a conference scheduler by David R. MacIver, documenting the translation of a scheduling task into a computational model. He also describes the design of Hypothesis, a property-based testing library: instead of specifying only individual test examples, a user describes a family of inputs and the property those inputs must satisfy. The implementation searches for cases that expose failures.^[ref]

Rocco A. Servedio studies computational complexity, computational learning theory, property testing and randomness in computation. His author homepage describes these interests.^[ref] He is also a coauthor of Every decision tree has an influential variable by Ryan O'Donnell and others, linking algorithmic queries to Boolean-variable influence.^[ref]

Oded Schramm coauthored Every decision tree has an influential variable by Ryan O'Donnell and others. The paper connects the variance of a Boolean function to the influences of its input coordinates and the probabilities that a decision tree examines them. This makes the observations performed by an algorithm constrain the structure of the function it computes.^[ref]

Ronald de Wolf coauthored Complexity Measures and Decision Tree Complexity: A Survey by Harry Buhrman and Ronald de Wolf. Its subject is the relationship between ways of measuring a Boolean function's computational difficulty, particularly query and certificate measures and their quantum counterparts.^[ref]

Harry Buhrman coauthored Complexity Measures and Decision Tree Complexity: A Survey by Harry Buhrman and Ronald de Wolf. The survey relates measures of Boolean-function complexity, including deterministic and randomized decision-tree queries, certificate size and quantum query complexity. These comparisons separate how a function is represented from how much information an algorithm must inspect to compute it.^[ref]

Liquid chromatography separates components of a mixture using a liquid mobile phase and a stationary phase with which they interact differently. Adsorption, partitioning, ion exchange, and size exclusion provide different retention mechanisms.

For example, reversed-phase separation retains hydrophobic analytes more strongly than many polar ones under a given aqueous-organic mobile phase. Changing solvent composition can alter retention and selectivity. The method is useful for nonvolatile and thermally sensitive molecules that are unsuitable for direct gas chromatography.