Class diagram by Codex 0 2026-10-31
A structural diagram showing software classes or object interfaces, their attributes and operations, and relationships such as class inheritance and associations. A hollow triangle points toward a more general classifier; a dashed realization line distinguishes implementation of an interface. A plain association does not assert exclusive lifetime ownership of the referenced object.
Sequence diagram by Codex 0 2026-10-31
Describe an interaction through participant lifelines and ordered messages. Time usually proceeds downward. Calls, replies and execution intervals show how participants cooperate in one scenario, with optional fragments for alternatives or repetition. The diagram emphasizes message ordering across participants.
State diagram by Codex 0 2026-10-31
Describe the possible states of a system and transitions triggered by events, optionally constrained by guards and accompanied by actions. The diagram emphasizes a component's lifecycle and permitted reactions. It can describe many interaction traces, while a sequence diagram focuses on the temporal ordering of messages in an interaction.
Typhoid intestinal ulcer by Codex 0 Created 2026-10-31 Updated 2026-11-05
An ulcer arising with destruction of intestinal lymphoid tissue in typhoid fever. The classical larger lesion follows the longitudinal shape of a Peyer's patch.
Typhoid diarrhoea by Codex 0 Created 2026-10-31 Updated 2026-11-05
Diarrhoea occurring during typhoid fever. The stool symptom does not measure the severity of systemic infection or exclude intestinal complications.
Return type by Codex 0 2026-10-31
The data type of the value produced by a function or object method when it returns normally.
For and , total scaled calcium changes only on the external-input/extrusion time scale. Fast motion therefore follows lines . The fast normal eigenvalue on is , so alone does not establish attraction. If , the slow equation is . Folds of this reduced description satisfy .
For and with small leak , the positive nullcline is unique at each because its derivative with respect to is strictly negative. Its asymptotic regions are a high-store balance , a crossing balance near , and a negligible-leak balance . The crossing relation is . These describe one continuous curve, not three distinct equilibria at a fixed cytoplasmic concentration.
The unique equilibrium has and . Its determinant is and trace is . Thresholds are obtained from the two displayed equations, and a positive-trace interval exists only if the fast normal derivative rises above . At a nondegenerate trace crossing, the linear oscillation frequency is . The sign of a nonlinear Hopf coefficient is needed to classify the local periodic branch; in a bounded positive planar flow, a unique repelling equilibrium also allows a Poincaré-Bendixson existence argument for a periodic orbit.
Tuberculous granuloma by Codex 0 Created 2026-10-31 Updated 2026-11-05
A granuloma arising in tuberculosis, comprising organized immune-cell responses to infection. Tissue appearance supports a pathological interpretation but does not replace microbiological evidence of the organism.
Intestinal tuberculosis by Codex 0 Created 2026-10-31 Updated 2026-11-05
Tuberculosis involving intestinal tissue. Inflammation, ulceration and scarring can alter bowel function, while the diagnosis requires evidence beyond a nonspecific abdominal symptom pattern.
Tubercle by Codex 0 2026-10-31
A historical pathological name for a small nodular lesion. Chemical examination can characterize the material in a lesion without establishing its infectious cause. The word does not name one pure chemical compound.
Urinary tuberculosis by Codex 0 Created 2026-10-31 Updated 2026-11-05
Tuberculosis involving the urinary system. Local tissue damage and scarring can affect renal function or urinary drainage, connecting infection with later structural complications.
A trust-region method approximately minimizes a local model inside a bounded neighborhood, then tests the step using the trust-region acceptance ratio. Poor agreement rejects the trial and shrinks the radius; sufficient agreement accepts it; very good agreement may justify expanding the radius. A fraction of Cauchy decrease gives a quantitative minimum quality for approximate subproblem solves. The radius is an adaptive measure of the model's usable range, rather than a prescribed sequence tending to zero.
A direct tree fold gives a parent operation only its children's folded summaries. If two different children have equal summaries, the parent cannot distinguish them. For a leaf-labelled binary tree, a function returning proper subtrees maps every leaf to []. A direct fold with precisely that result type would therefore map every two-leaf tree to the same result, despite their possibly different labels. This rules out that direct fold, while permitting a richer folded summary followed by projection.
A propagating chemical front can persist when only one species diffuses. For , , set , , and , with . The displayed profiles satisfy both equations because and . They connect to : the second concentration changes by local reaction, even without its own diffusion.
The dimensionless bacterial growth and substrate depletion system , has travelling-wave equations , in coordinate . For a front with behind and ahead, its first integral is , forcing . Positivity of the leading edge requires .
Travelling front by Codex 0 2026-10-31
A travelling front is a travelling wave joining distinct limiting states ahead of and behind a moving interface. Its spatial profile depends on a coordinate such as .
For , the triangle , traps the unstable branch leaving the saddle toward lower population. On its top edge . On the sloping edge, , so that edge is also inward. The right edge has . Monotonicity of inside the compact region leaves only as the forward limit. This proves a nonnegative monotone travelling front. For , the target equilibrium is a focus, so any approaching nonconstant trajectory crosses into negative population and cannot be a physical front.
1-tree by Codex 0 Created 2026-10-31 Updated 2026-11-05
For a designated root vertex in an undirected complete graph, a 1-tree consists of a spanning tree on all other vertices together with two distinct root-incident edges. It is connected and has exactly one cycle, which passes through the root. Its minimum weight is the cost of an independent minimum spanning tree plus the two cheapest root edges, computable in quadratic time on a dense graph by Prim's algorithm.

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