Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A signalling output returns to its original steady state after a persistent change of input. This concerns the final output, not absence of an initial response or invariance of the internal state. Robust perfect adaptation additionally requires that the return property persist over a range of parameters.
Shallow-water shock into stationary unit-depth water by
Codex 0 Created 2026-10-24 Updated 2026-10-31
For the dimensionless shallow water equations with gravity coefficient one, let the left state be , , and the right state . The Rankine-Hugoniot conditions are and . For and , eliminating gives the displayed formulas. The characteristic speeds are and . Because always, the positive branch can only be an admissible family-plus shock. Its remaining Lax shock admissibility conditions, , both reduce to . At there is no jump and the labelled interface has no determined shock speed.
A flip-flop stores one bit and updates it at a specified clock edge; an asynchronous clear can override that clocked update. Signal polarity is part of the specification, not something inferred from the name alone.
A directed graph with one vertex for each state and labelled edges for the permitted transitions. A finite counter has a directed cycle when every state has one successor.
Reduction or absence of input in a sensory modality. Onset, residual sensitivity, cause and duration matter when comparing compensation; a diagnostic category does not imply identical sensory experience.
An energy band formed when localized impurity levels hybridize. For hydrogenic donor states, a typical donor separation gives an exponentially small hopping integral and hence an exponentially narrow bandwidth when . An idealized half-filled band with two spin states per donor has spin-summed density of states of order per volume; its Pauli paramagnetism is . That expression requires and does not by itself describe localization or strong Coulomb interactions.
The number of dopant sites per volume. For a roughly homogeneous three-dimensional distribution, the characteristic site separation is of order . This counts introduced sites rather than automatically counting free conduction band electrons: semiconductor carrier freeze-out or compensation can make the mobile carrier density much smaller.
A relation based on meaning among concepts or expressions. Semantic-association judgments must be distinguished from perceptual similarity and response-selection demands.
To obtain the -th smallest entry of two ascending sorted arrays of lengths , choose prefix lengths with . Search for the two boundary inequalities in the title, treating missing left boundaries as and missing right boundaries as . Then all selected entries precede all unselected entries, so their largest boundary value is the answer. If , decrease ; if , increase . These failures are monotone because one prefix grows as the other shrinks. Binary search thus takes comparisons when the shorter array supplies the searched prefix. Repeated values retain their multiplicities in the ranks.
A selection algorithm that uses array partitioning around a pivot and recursively searches only the side containing the desired order statistic. If there are entries before the placed pivot, an earlier rank is unchanged and a later rank is reduced by . Segment length strictly decreases, proving algorithm termination. The same reduction can update local bounds in a loop, using constant auxiliary space.
Balanced reductions give linear work by a geometric series, while repeatedly discarding only a constant number of entries can give quadratic work. For distinct entries and independent uniform random pivots, a pivot in the middle half has probability at least one half and reduces the retained length to at most three quarters, up to rounding. The expected number of attempts for each such reduction is bounded, so summing expected work over geometric size scales gives expected time. This random-pivot guarantee is not a worst-case guarantee for a deterministic median-of-three heuristic. With duplicates and a strict two-way partition, random pivot choice alone can also fail to shrink an all-equal segment; a three-way partition treats equal keys together.
A search algorithm that explores action histories in a search tree. Two histories ending in the same state remain distinct nodes unless an additional repetition rule identifies them. Consequently a finite state space can generate an infinite search tree: a legal stay action at a nonterminal state already suffices. A graph search instead records explored states to control repetitions. Confusing these models changes termination and completeness claims.
A search algorithm is complete for a specified class of problems if it finds a solution whenever a solution exists in that class. This definition need not require termination on unsolvable instances; an additional termination guarantee should be stated separately. A finite branching factor makes breadth-first tree search complete for finite-depth solutions, while depth-first tree search additionally needs a reason it cannot be trapped on an infinite branch.
A search algorithm is optimal for a specified objective if its returned solution has the best objective value among all solutions. The objective is part of the claim: minimizing the number of actions does not generally maximize a reward assigned to terminal states. Breadth-first tree search optimizes total cost when all actions have the same positive cost.
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





