Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A restriction requiring exactly one member of a set of Boolean variables to be true. A direct conjunctive normal form encoding combines one at-least-one Boolean clause, , with at-most-one Boolean clauses, for . The first supplies existence and the second supplies uniqueness. For , the empty at-least-one Boolean clause correctly makes the condition unsatisfiable.
An algorithm or software system that decides whether a Boolean formula has a satisfying assignment, usually returning one when it exists. Unit propagation and clause learning are important mechanisms in modern SAT solvers. A reduction must be correct and its representation costs counted before the performance of the downstream SAT solver is relevant.
Dependence of a deep-inelastic structure function on at fixed Bjorken scaling variable. In QCD, radiation and gluon splitting evolve the parton distribution functions with the resolution scale, producing logarithmic departures from the simplest parton model scaling limit.
Quantum chromodynamics makes parton distribution functions depend on resolution scale through gluon radiation and parton splitting. Thus Bjorken scaling and the linear-energy neutrino cross section are approximate leading-order patterns rather than exact laws.
For a real auxiliary field with quadratic Lagrangian density , , the Feynman propagator is the inverse quadratic kernel multiplied by : . It is independent of momentum; in position space it is the contact distribution . Two interaction vertices joined by this auxiliary-field propagator give . Completing the square in produces , proving the equivalence to a local interaction by a Gaussian integral.
A learned map retrieves an associated output pattern that need not equal its input cue. With normalized cue vectors and targets , Hebbian learning gives . For orthonormal cues, ; taking the matrix product proves exact retrieval. Nonorthogonal cues add interference . Additional context is required if one identical cue should select different outputs on different occasions.
A memory retrieves a stored pattern from a partial or corrupted version of that pattern. A recurrent Hopfield network supplies a precise idealization through stored attractors and their basins of attraction. Retrieval can fail through interference, ambiguous cues or spurious stable states.
A transformation that makes representations of similar inputs less overlapping, helping reduce interference between stored events. It must retain enough information for useful downstream learning and retrieval. The dentate gyrus is a proposed substrate, with quantitative input–output evidence from spatial cue-conflict experiments.[ref]
CA3 retrieves coherent representations from degraded input: direct evidence for CA3 pattern completion and dentate gyrus pattern separation by Joshua P. Neunuebel and others. Abstract; simultaneous DG/CA3 recordings during local/global cue conflict
Reinstatement of a stored representation from an incomplete or degraded cue. Recurrent autoassociative memory provides one mechanism; its success depends on the cue entering the correct basin of attraction. Partial-cue deficits after CA3-targeted NMDA receptor deletion support a hippocampal role without identifying a unique weight-update rule.[ref]
Requirement for hippocampal CA3 NMDA receptors in associative memory recall by Kazu Nakazawa and others. Abstract; pp. 211–218, adult CA3-restricted deletion and full-cue versus partial-cue recall
The factorization produced by the Arnoldi iteration, with orthonormal and an upper Hessenberg matrix . Multiplying by identifies its leading square block as .
For a real symmetric matrix , the leading block of the Arnoldi decomposition is both symmetric and an upper Hessenberg matrix, hence a tridiagonal matrix. The resulting three-term recurrence is the Lanczos algorithm. If is a symmetric positive-definite matrix, its compression is too, since for nonzero .
The full double braiding of two anyons. The anyon balancing identity gives in a permitted anyon fusion channel. Unlike a single anyon R-matrix entry, this scalar is invariant under an anyon vertex gauge transformation.
The unitary matrix relating the anyon fusion trees and . Fix the convention . An inverse change of parentheses uses the adjoint matrix, so its entries are complex conjugates with exchanged indices.
A change of the chosen orthonormal basis of every anyon fusion space. In a multiplicity-free theory each basis change is an independent wave phase . Splitting vertices acquire and adjoint fusion vertices acquire its inverse. A scalar diagram is invariant under these choices when its splitting and fusion vertex factors cancel. A closed diagram with independently specified unmatched vertex tensors need not be invariant.
The convention in which the anyon fusion trees form an orthonormal basis and a splitting vertex followed by its adjoint fusion vertex gives the identity on the total-charge strand. A closed normalized state has norm one. It differs from the isotopy normalization of anyon diagrams, in which an unknotted closed charge- strand evaluates to .
The convention in which the value of an unknotted, untwisted charge- loop is its quantum dimension . For multiplicity-free anyon fusion, a split-fuse bubble with input charges and total charge gives times the identity strand; the corresponding completeness resolution has coefficient .
For a cohesionless, optimally oriented normal fault with vertical maximum compression and horizontal minimum compression,where is fault dip and the internal friction angle. This is a geometric inference under the model, not a measurement of friction from dip alone.
For a compression-positive Mohr circle, put and . Tangency to the cohesionless Mohr-Coulomb failure criterion gives . The contact point is . The physical plane-normal angle to is half the corresponding central angle, giving the stated dip. Equivalently the plane itself makes with .
An analysis of variance for a design containing repeated observations on the same experimental units, with an appropriate within-unit error structure. It differs from treating every recorded response as independent. The allocation and covariance assumptions, not just the factor count, determine the applicable tests.
An analysis of variance comparing a quantitative response variable across levels of one factor. The ordinary independent-groups F-test evaluates equality of group population means under the one-way normal linear model. Rejection says that not all means are equal, rather than identifying every differing pair.
A put with a prescribed exercise rule: exercise at the first touch of , or at expiry if no touch occurs. Its value is bounded above by the American put option, which optimizes over exercise times. With zero interest rate, its value equals the down-and-out put value plus times a cash-at-expiry one-touch option value. At positive interest rate the rebate is paid at touch, so replacing it by an expiry payment would generally be incorrect.
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





