Primary CMSIS-Core register-access documentation. The PRIMASK accessors and interrupt-mask operations define the architectural effect of saving, disabling and restoring maskable interrupts on Cortex-M. Compiler ordering is an additional requirement when protecting shared C objects.
Official course-hosted technical exposition: 2.3 Filtering.
Relevant locator: §2.3, initial forward-checking definition and subsequent directed support-revision procedure. These describe forward checking, arc consistency and iterative filtering.
Official course-hosted technical exposition: 2.4 Ordering.
Relevant locators: §2.4, Minimum Remaining Values; §2.4.1, Structure, the upward support pass, downward assignment and cutset conditioning. The residual tree computation is linear in the number of variables for fixed maximum constraint domain size.
Official course-hosted technical exposition: 3.2 Minimax.
Relevant locator: §3.2.1, Alpha-Beta Pruning, ancestral alternatives and dependence on child order. The solution's alpha-beta pruning code and mathematical comparisons are given explicitly.
Official course-hosted technical expositions: 3.3 Expectimax and 3.4 General Games.
Relevant locators: §3.3, weighted chance node backups; §3.3.1, Mixed Layer Types; §3.4, moving players maximize their own coordinate and propagate whole utility tuples. The nearly-zero-sum cutoff is proved independently.
Official documentation for stats::t.test. It specifies the unequal-variance default, the two-sided alternative and the returned confidence interval and estimates.
Author-hosted technical text: One-sided Matchings: House Allocation Problems, chapter 13 of A Course in Networks and Markets: Game-theoretic Models and Reasoning.
Relevant locator: §13.2, Definition 13.1 and Theorem 13.2, Pareto efficiency of serial dictatorship with strict preferences. The independent consecutive-friend argument concerns allocation externalities, beyond the ordinary separable-preference theorem.
Informational architectural guidance; sections 2–3 distinguish the common internetwork interface and end-to-end functions.
The historical TCP specification used for the pre-2020 transport contract, particularly sections 1.5 and 2.6.
Informational architectural discussion of trust, service requirements and intermediaries.
Informational framework defining content-provider and delivery-network roles, redirection and content acquisition.
Standards-track TLS 1.3 specification; section 1 defines channel security between peers.
Additional verified locators: RFC 8446 §§3.3–3.4 specify network-byte-order numbers and variable-length vectors, whose lengths count bytes rather than elements. §4.4.1 defines the transcript hash over ordered handshake messages including handshake type/length headers, excluding record-layer headers, with a synthetic message_hash replacement for ClientHello1 on HelloRetryRequest. §4.4.4 authenticates the prescribed transcript context with Finished.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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