Library

A source map of Christoph Kehle's 76-page 2025 MIT functional-analysis course, used to verify theorem hypotheses, modern duality boundaries, weak topologies, Hilbert geometry, spectral theory, compact operators, and the Fredholm alternative.

The protocol specification defines the exchange–binding–queue model, delivery acknowledgements, channels, transactions, framing, ordering, and error boundaries that underpin RabbitMQ's AMQP 0-9-1 interface, while predating important RabbitMQ extensions and modern replicated queue types.

The canonical 65-pattern vocabulary organizes messaging design into message construction, channels, routing, transformation, endpoints, and system management; its continuing value is precise problem/solution language rather than allegiance to an ESB or broker product.

A complete source map of the KPI lecture notes and practicum for limits, continuity, differentiation, integration, Taylor approximation, and series. The two volumes provide a useful curricular spine, while independently verified definitions, hypotheses, derivations, and examples carry the GTK chapters.

A complete map of a 104-page KPI prerequisite practicum covering arithmetic, algebra, elementary functions, equations, inequalities, graphs, and trigonometry. It supplies curricular diagnostics; GTK independently reconstructs the domain-aware methods and corrects the source's damaged formulas and answers.

A complete source map of 333 pages of KPI lecture notes and practicum on multivariable differentiation, multiple, line, and surface integrals, vector fields and integral theorems, and ordinary differential equations. GTK keeps the curricular spine while supplying independently verified hypotheses, orientation rules, and solution methods.

A complete source map of 266 pages of KPI lecture notes and practicum spanning numerical and functional series, Fourier expansions, holomorphic functions, contour integration, Laurent series, residues, and Laplace-transform methods. The map seeds five GTK chapters whose conventions and formulas are independently checked.

A current, freely published 573-page systems-and-control textbook that integrates nonlinear dynamics, state-space methods, transfer functions, frequency-domain analysis and design, PID, robust performance, fundamental limits, and control architecture. It is the principal modern reference used to reconcile the supplied TAU courses.

A compact primary account of prediction-error identification: predictors, black-box model parameterizations, optimization, open- and closed-loop convergence, asymptotic covariance, and the experiment-dependent meaning of the estimated model.

A 319-page classical automatic-control course covering continuous-time modeling, standard dynamic elements, block-diagram reduction, stability and performance criteria, frequency-domain synthesis, and nonlinear phase-plane and describing-function methods. The course is a strong map of the classical territory, but its advertised state-space chapters are absent and its MATLAB material is dated.

An 87-page, 17-lecture course that develops sampled-data control from quantization and the z-transform through pulse transfer functions, unit-circle stability, direct digital synthesis, deadbeat response, digital PID, and controller realizations. Its mathematical sequence is useful; authorship is not stated and implementation claims require modern verification.

A user-supplied compilation of six papers on corporate IT-infrastructure management, service-resource models, feedback and disturbance compensation, and the integration of service-management processes with operational control. Its enduring contribution is the service-to-resource reasoning model; its product surveys, forecasts, protocol emphasis, and centralized automation architecture are historical.

A 237-page KPI lecture course spanning system boundaries, structure, information, control, modeling, choice, decomposition, and early-2010s engineering software. Its conceptual spine remains useful, but its technology examples and several definitions need replacement by current systems-engineering, information-theory, and decision-model standards.

A 63-page industrial note explaining open- and closed-loop regulation, dynamic response, two- and three-position controllers, pulse outputs, P/PI/PD/PID structures, and empirical tuning. Its block diagrams are useful, but controller-selection tables and tuning constants are heuristics rather than portable design guarantees.

A 309-page KPI lecture course assembled from 14 surviving lecture files. It develops data preparation, measurement uncertainty, experimental design, clustering, discriminant and regression analysis, goodness-of-fit tests, ANOVA, recognition rules, voting classifiers, and biometric feature extraction; its mechanisms are useful, but present-day practice is supplied by current primary sources.

A 308-page lecture text covering semiconductor device physics, discrete analog stages, operational amplifiers, filters, oscillators, rectifiers, and regulators. Its circuit mechanisms remain useful, while device selection and performance limits require current manufacturer documentation.

A 208-page lecture text on pulse metrics, RC waveform shaping, semiconductor switches, bistable and monostable circuits, comparators, ramp generators, and resistor-network DACs. It supplies analyzable timing mechanisms rather than current component guidance.

A 195-page lecture text connecting quantization and Boolean algebra to logic families, combinational blocks, latches, registers, counters, and ADC architectures. Its structural logic is durable; electrical limits and implementation technology require current documentation.

Proposes a logit jump–diffusion with risk-neutral drift as the shared stochastic kernel prediction markets lack, plus a tick-to-surface calibration pipeline and a concrete market-maker playbook. Kept as the most complete single blueprint for quoting and hedging belief risk on venues like Polymarket.

Gneiting and Raftery unify proper scoring rules, calibration, sharpness, and forecast evaluation; the paper explains why probability forecasts need probability-sensitive scores rather than classification accuracy alone.

Kelly connects information quality to the maximum long-run logarithmic growth of capital and shows why maximizing expected terminal wealth can imply ruinous all-in betting.

A 236-page KPI lecture course on signals and physical transmission: Fourier spectra, distortion, modulation and detection, interference countermeasures, filter synthesis, transmission lines and media, multiplexing, facsimile, television, optical links, and information-network applications. Kept as a complete source map and historical bridge into the current standalone entries.

The 226-page second half of the KPI course: propagation and link budgets, electroacoustics and hearing, speech processing, receiver architectures, sonar, antennas, television, RF metrology and monitoring, and 2G-era cellular, satellite and trunked systems. Physics and measurement mechanisms remain useful; deployed-system descriptions are a 2012 snapshot.

The original operational-design checklist for portable software-as-a-service applications, preserved as a historical primary source and evaluated against modern artifact, orchestration, security, and observability practice.

A 370-page Soviet-era engineering treatment of binary transmission, optimal reception, synchronization, line codes, and error-control systems. Its signal-space reasoning remains useful; its hardware assumptions and system examples are historical.

The 2023 CCSDS telemetry recommendation specifying convolutional, Reed–Solomon, turbo, and LDPC coding together with frame synchronization and pseudo-randomization. Archived as a concrete standards-grade example; the CCSDS catalogue now lists a newer issue.

A six-page paper that derives parallel R-L and R-C one-port equivalents directly from measured terminal voltage and current, then applies the method to DS3 and 2ES5K AC locomotives. Its useful lesson is also its warning: waveform-fitting can produce numerically consistent but nonphysical time-varying and negative element values.

A short systems-level introduction to the purpose, energy path, information path, and principal families of power-electronic converters. It is useful for architecture and vocabulary; present-day devices, gate drives, protection, and compliance require current primary sources.

A compact design-oriented account of converter specification, switch selection, control, protection, magnetics, cooling, and verification. Its value is the coupled design workflow rather than any historical component recommendation.

A 24-page course treatment of phase-controlled rectifiers, current continuity, grid and forced commutation, autonomous inverters, and AC-drive frequency-converter structures. It supplies historical derivations that must be reframed around present-day switch and drive practice.

A 17-page survey of pulse-width control, DC choppers, AC regulation, rectifier control, and isolated/non-isolated switching supplies. It provides topology relationships and energy-transfer intuition, not current component-selection rules.

A seven-page historical introduction to transistorized flyback, forward, and push-pull DC conversion. Its strongest contribution is showing how magnetizing and load energy paths differ between topologies.

Intel's primary description of the original 8086 family: the processor and bus partition, programmer-visible registers, segmented addressing, instruction encoding, interrupts, and the support components used to assemble a microprocessor system. It is authoritative for the historical 8086, not for current x86 operating modes or tooling.

NIST's 2023 guide is a current, public reference for OT scope, typical SCADA, DCS, and PLC-based topologies, and the operational constraints that make control systems different from ordinary IT. Its architecture figures are explanatory examples rather than prescriptive plant designs.

The current Modbus Organization application-protocol specification defines the transport-independent PDU, four logical data tables, zero-based PDU addressing, public function codes, limits, and exception responses. It deliberately leaves device meaning, scaling, multi-register types, and transport framing to other contracts.

Fisher's 2023 handbook connects valve-body and trim geometry to actuator and positioner behavior, installed flow characteristic, dead band, response time, sizing, cavitation, noise, and failure action. It is a strong mechanism and selection reference, but product examples and rules of thumb remain manufacturer guidance rather than universal requirements.

A user-supplied KPI lecture course covering OSI layering, shared-medium access, Ethernet generations, transparent bridging, VLANs, spanning tree, centralized command-response networks, and systematic troubleshooting. Its mechanism-level explanations remain useful, while its deployment guidance and technology catalog require current IEEE and IETF specifications.

A KPI-authored course text that gives a coherent route through the original MCS-51 programmer's model, memory spaces, addressing modes, instruction groups, assembler notation, and small assembly programs. It is useful as a teaching sequence but not as authority for current devices, tools, or vendor status.

The supplied 331-page primary device manual for the original ATmega8 and low-voltage ATmega8L. It remains authoritative for those historical parts, while current ATmega8A design work must use Microchip's ATmega8A data sheet and current errata.

The supplied 386-page primary manual for the original ATmega128 and ATmega128L. It is valuable for historical-device firmware and for exposing larger-AVR mechanisms such as extended addressing and external memory, but current ATmega128A claims are checked against Microchip's ATmega128A manual.

Intel's original 524-page primary manual defines the 8051 architectural contract, instruction set, base-family peripherals, and historical support ecosystem. Its core chapters remain the reference point for MCS-51 compatibility; component catalogues, electrical data, and tool descriptions are historical.

The current archived device manual used to verify ATmega8A architecture, peripheral lifecycles, programming behavior, and electrical boundaries. It is a device contract, not a generic template for every AVR.

The current archived ATmega128A device contract, used to verify large-AVR addressing, external memory, peripheral multiplicity, JTAG, boot flash, and programming behavior without projecting the older ATmega128(L) manual onto a different device revision.

The current primary ISA reference for AVR instruction syntax, operands, status flags, encodings, cycles, and device-availability qualifiers. GTK uses it to explain instruction families and architectural effects rather than reproducing an opcode catalogue.

A current MCS-51-compatible implementation manual showing how the stable 8051 ISA coexists with a pipelined core, paged SFRs, configurable pin routing, modern clocks and reset, flash, debug, ADC, comparators, timers, and serial peripherals.

A 2011 KPI course text that supplies a useful end-to-end map of printed-board realization, but whose prescriptive dimensions and standards must be replaced by current IPC documents and fabricator capabilities.

A broad course text connecting material structure and properties to conductors, contacts, dielectrics, cables, PCB laminates, solders, and fluxes, retained for mechanisms rather than dated grade tables.

The normative description of the current Gerber layer format, including geometry, metadata attributes, drill and rout data, CAD netlist semantics, component data, errors, and deprecated constructs.

A 2024 Siemens catalog chapter used as a current technology map for continuous and point level measurement, installation constraints, and application-dependent failure modes.

A five-lecture course sequence on the maximum principle, time-optimal phase-plane synthesis, minimum-fuel bang-off-bang control, nonattainment, and quadratic controller design. Its strongest contribution is the worked geometric chain from an optimality criterion to a switching law; its formulas require several explicit convention and weighting corrections.

A unified graduate-level route from variational first-order conditions through the Pontryagin maximum principle, dynamic programming, viscosity solutions, and finite- and infinite-horizon LQR. It is GTK's main explanatory source for keeping conventions and logical dependencies consistent across the optimal-control branch.

The original 40-page primary paper giving the maximum principle for optimal processes, including the adjoint system, pointwise Hamiltonian maximization, endpoint conditions, and linear time-optimal consequences.

Kalman's primary paper formulates the continuous-time quadratic regulator rigorously and connects controllability, observability, Hamilton-Jacobi reasoning, stability, and the matrix Riccati equation.

A 180-page NASA-sponsored Stanford report applying state-variable optimal control to engine-failure sink-rate transients. GTK uses its candid engineering discussion of quadratic-weight selection and fixed feedback paths, not its aircraft-specific numerical design.

A complete source map of a 72-page lecture course spanning sets, relations, functions, orders, elementary counting, relational data modelling, and trees. It is valuable as a curricular map but contains enough mathematical and database errors that every retained mechanism is independently re-derived and verified.

A complete source map of the Open Logic Project's 79-page current part build on sets, relations, functions, cardinal comparison, quotient number constructions, closure, induction, and Schröder–Bernstein, with proof-strength and edge-case corrections recorded before reuse.

A complete two-page source map of free-for substitution in first-order terms and formulas, including the capture condition, quantifier clauses, and the boundary between a guarded partial definition and a total renaming algorithm.

A complete two-page source map of single-sorted first-order structures, with explicit contracts for domains, constants, predicates, functions, and identity and clear boundaries around free logic and partial functions.

A complete five-page source map of assignment-relative first-order satisfaction, with the term and quantifier recursion reconstructed and the source's faulty final witness corrected by exhaustive model evaluation.

Pascanu, Mikolov, and Bengio connect vanishing and exploding RNN gradients to products of transition Jacobians, dynamical-system boundaries, and high-curvature walls, then motivate global gradient-norm clipping as a cheap containment mechanism.

The 2014 sequence-to-sequence paper demonstrated an end-to-end LSTM encoder–decoder for variable-length translation, exposing the fixed-vector conditioning contract, autoregressive factorization, beam search, and the optimization effect of shortening dependency paths by reversing source order.

This paper separates deterministic recurrent history from a high-dimensional conditional output distribution, comparing RNN–RBM, RTRBM, and RNN–NADE models on binary piano rolls and using the learned symbolic prior in transcription.

Huang's k-prototypes paper extends the k-means alternating-assignment pattern to mixed records by combining squared numerical distance with weighted categorical mismatches and updating prototypes with means and modes.

Vaswani et al. replace recurrent sequence transduction with stacked attention and feed-forward blocks, introducing the encoder–decoder Transformer, scaled dot-product multi-head attention, causal decoder masking, and positional encodings.

The GPT-2 report demonstrates that a large decoder-only Transformer trained only for autoregressive next-token prediction can express many tasks through a single token stream and perform some of them without gradient updates.

Ouyang et al. document a 2022 instruction-tuning pipeline—supervised demonstrations, a preference-trained reward model, and PPO fine-tuning—and show both substantial preference gains and the limits of treating a small labeler group's judgments as universal alignment.

The paper adapts RBMs to sparse movie-rating tables by representing each observed rating with a categorical softmax group, sharing parameters across user-specific visible subsets, and using contrastive divergence for training.

The paper identifies the linear-in-vocabulary cost of Gibbs updates for K-way RBM visible units and replaces exact softmax block sampling with Metropolis–Hastings transitions whose proposal can be sampled in constant time.

Nguyen and Caruana add same-class and different-class pair supervision to a multiclass margin formulation, showing how partial relation labels can supplement a small absolutely labelled set.

Xing and colleagues formulate learning a positive-semidefinite Mahalanobis matrix from similar and dissimilar pairs as a convex optimization problem and demonstrate its use before clustering.

Dwork, Lynch, and Stockmeyer formalize the middle ground between synchronous and asynchronous systems and derive consensus bounds for crash, omission, and Byzantine faults.

Castro and Liskov present a practical state-machine-replication protocol tolerating f Byzantine replicas among 3f+1, with normal-case ordering, checkpoints, view changes, and recovery.

Maymounkov and Mazières derive a DHT from the symmetric XOR distance, k-bucket routing tables, parallel iterative lookup, and replication under churn.

Ethan Buchman's thesis connects replicated state machines, partial synchrony, BFT consensus, gossip, application separation, validator governance, light proofs, and early Tendermint evaluation.

Buchman, Kwon, and Milosevic specify Tendermint as gossip-based BFT atomic broadcast with proposer, prevote, precommit, locking, and eventual-synchrony arguments.

Nakamoto combines signed UTXO-like payments, a proof-of-work timestamp chain, a most-work fork choice, incentives, Merkle proofs, and probabilistic catch-up analysis.

Ken Shirriff manually constructs, signs, serializes, broadcasts, and observes a legacy P2PKH Bitcoin transaction, exposing the byte-level machinery that wallet software normally hides.

A formal account of Ethereum's state transition, transactions, gas, EVM execution, blocks, and networking-era assumptions at an EIP-150 proof-of-work snapshot.

The early Cosmos whitepaper proposes Tendermint-based zones and hubs, validator economics, light-client interoperability, and the initial IBC vision.

SECG's 2000 catalogue defines named prime-field and binary-field curve parameter sextuples, including secp256k1 and secp256r1, plus identifiers and then-current strength mappings.

NIST specifies finite-field and elliptic-curve Diffie–Hellman/MQV key-establishment schemes, key assurances, validation, derivation, context binding, and key confirmation.

Georgios Konstantopoulos introduces the Two Generals and Byzantine Generals problems, the 3f+1 threshold, BFT terminology, and the contrast with Bitcoin proof of work.

A complete source map of Turing's 1936 paper, covering finite machine descriptions, configurations, a universal interpreter, diagonal undecidability, the analysis of effective calculation, and the Entscheidungsproblem application.

Evin Sellin's long-form explainer is a useful map of the questions software engineers ask about Turing completeness, but several historical, formal, and resource-boundary claims require correction before reuse.

Khan Academy's short article gives a useful intuition for eventual upper bounds and loose versus tight descriptions, but it does not fully separate case functions from asymptotic relations or state the formal quantifiers.

The Wikipedia article is a broad map of asymptotic notation, history, examples, and neighboring conventions, but it mixes mathematical domains and computational models and is not used as formal authority.

Donald Knuth's 1976 note formalizes the O, Omega, and Theta vocabulary adopted in computer science, argues for one-way set semantics, and records notation history, while its proposed little-omega wording needs modern qualification.

MIT's 2020 recitation notes connect formal asymptotic bounds to input encoding, a stated Word-RAM model, and code-level operation counts, while several local claims require tighter qualification.

MIT's 2024 Mathematics for Computer Science notes give modern definitions and equivalences for the full Landau-notation family, while carefully audited local defects show why their limit tests and sign conventions need qualification.

A complete source map of a 128-page KPI lecture course covering Boolean functions, propositional calculi, finite automata, and Petri nets. It is a useful curricular spine, but recurring formal and worked-example defects require every load-bearing claim and diagram to be reconstructed from independent sources.

A complete source map of Tadao Murata's 1989 survey of classical weighted place/transition nets, covering firing semantics, concurrency and conflict, reachability and coverability, behavioral properties, structural subclasses, invariants, and extension boundaries.

A complete source map of Robinson's 1965 resolution paper, including clause semantics, ground and first-order refutation completeness, standardization apart, most-general unification, the occurs check, generalized resolution, and nonterminating proof search.

Post's early paper develops a truth-table account of elementary propositions, counts truth functions of positive arity, and studies complete function systems. It supplies historical foundations, but not the later five-class criterion of the 1941 monograph.

A deliberately narrow note on the publicly visible openings of Post's 1941 monograph. The opening of Section 26 states the five-system completeness criterion, but the book body was not obtained or read in full.

McCluskey separates prime-implicant generation from cover selection, defines a precise lexicographic minimum-sum objective, handles don't-cares correctly, and distinguishes an approximate selection procedure from a later exact one.

Karnaugh's map turns Boolean-cube adjacency into geometry, including wrapped edges and don't-cares, while explicitly separating minimum two-stage forms from broader relay and circuit costs.

The archived official excerpt defines composition, generated clones, maximal clones, and several relation-preservation classes. It ends immediately before the promised Boolean completeness criterion and must not be mistaken for the full chapter.

Hack gives a primary formal account of weighted Petri nets, enabling and firing, reachability, coverability, boundedness, strong liveness, and persistence, then develops a finite effective complete coverability tree. The report predates Mayr's reachability-decidability result and omits modern invariant and step semantics.

Gonda gives modern definitions of the zero- and one-preserving, self-dual, monotone, and affine classes, states their maximality, and uses escaping all five as the functional-completeness test. The paper also makes its nullary-constant convention explicit.

The paper formalizes multiset steps, marking-dependent commutation, and semantic conflict in P/T nets, including the higher-arity conflict that pairwise checks miss.

A rigorous design-oriented treatment of switching converters that connects switch-state circuits to averaged models, transfer functions, feedback design, input-filter interaction, magnetics, rectifiers, resonant conversion, and soft switching.

A broad Ukrainian-language textbook spanning semiconductor devices, analog amplification, pulse shaping, switching circuits, logic, sequential circuits, DACs, and ADCs; useful as a curricular map but too component-specific and dated to displace GTK's independently verified topic chapters.

The original MapReduce paper turns a restricted map/group/reduce contract into a distributed runtime that owns partitioning, shuffle, locality, retry, output commit, load balance, and straggler mitigation.

The Bigtable paper defines the sparse sorted row/column/timestamp model and shows how tablets, logs, memtables, immutable SSTables, compaction, locality groups, and coordination turn schema choices into distributed storage behavior.

The TensorFlow systems paper unifies tensor computation, shared mutable state, communication, placement, differentiation, checkpointing, and replica coordination in one extensible dataflow representation.

The original Addison-Wesley edition separates abstract operations from representations and develops linked structures, linear containers, trees, heaps, ordered symbol tables, balanced trees, skip lists, and radix string indexes. GTK pairs that durable organization with original data-structure papers and current language standards.

A compact catalog of layered, event-driven, microkernel, microservices, and space-based styles. Its topology sketches remain useful, while its universal scorecard and several distributed-system recommendations need current qualification.