Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Retention of behaviorally testable features of an event, often including integrated content, place and temporal information, without claiming to have established conscious reliving. The label separates evidence about a task from evidence about autonoetic consciousness.
Information about an event's position in an evolving sequence or internal state. Changes in neural activity over time can supply a temporal context, but time covaries with behavior, expectation and other variables that require experimental controls.
A persistent physical change or ensemble associated with retaining information from experience. Reactivation, necessity for natural recall and sufficiency under artificial stimulation are distinct criteria; no one of them alone establishes a complete account of subjective recollection.
An assembly language memory operand whose effective address is the sum of a base processor register and an offset processor register. A byte-load table lookup uses the index directly as a byte offset; wider entries require an appropriate scale. The effective address is formed from the old register values before the destination register is overwritten.
Return of a depolarized membrane potential toward a more negative value. During an action potential, reduced inward current and increased outward current commonly contribute. It is distinct from hyperpolarization, which takes the membrane beyond its reference resting value.
The study of physical evolution through dynamical equations, including how forces affect motion. A law relating force to acceleration must be combined with an interaction law and initial conditions to predict a history.
For a segment, store its total sum , maximum possibly-empty prefix sum , maximum possibly-empty suffix sum and maximum possibly-empty internal contiguous sum . Adjacent segment summaries combine byA prefix either stays on the left or includes the whole left segment and a right prefix. A suffix has the symmetric decomposition. An internal segment either stays in one child or crosses the boundary as a left suffix followed by a right prefix. These cases prove the formulas, including empty candidates. Store the corresponding endpoints to recover a winning segment. This constant-size summary gives a linear time divide-and-conquer algorithm for the empty-allowed maximum subarray problem.
A trust region restricts a local approximation to a neighborhood where it is expected to model the objective function accurately. A quadratic model is , where and is a symmetric matrix approximating the Hessian matrix. Minimizing this quadratic function over a Euclidean ball of radius is the trust-region subproblem. The trust-region acceptance ratio then checks the model against the actual objective function.
The metric k-center problem chooses at most centers from a finite metric space to minimize the largest distance from a point to its nearest center. For , exactly centers gives the same optimum: extra centers never increase the radius. The restriction that centers belong to matters; allowing centers anywhere in an ambient metric space is a different problem.
The basic packing argument is short. If a radius- solution uses centers, its closed balls cover . Two points assigned to the same center have distance at most by the triangle inequality. Thus points with pairwise distances greater than certify that no radius- solution exists. Greedily selecting a new center only outside all existing radius- closed balls therefore uses at most centers whenever a radius- solution exists, and its final covering radius is at most . The farthest-first traversal achieves the same approximation ratio without knowing .
For , these Lotka-Volterra equations describe two populations limited by their own density and depressed by the other population. The nonnegative quadrant is invariant. Positive equilibria are intersections of the non-axis nullclines and ; their existence and stability distinguish stable coexistence, competitive exclusion, and bistability. Positive solutions have no periodic orbits: multiplying the vector field by the Dulac function makes its divergence , so the Bendixson-Dulac theorem applies. Boundedness, boundary equilibria, and their stable manifolds must still be checked before concluding convergence to one particular equilibrium.
The mathematical description of elastic bodies whose stress-free material state changes through growth or remodelling. A multiplicative decomposition of the deformation gradient separates the growth tensor from the elastic accommodation . The relaxed grown configuration need not be globally compatible, so even an unloaded body can develop internal stress.
The mass mixing ratio used in a dilute radiative transfer model is absorber mass density divided by total atmospheric mass density. A hydrostatic pressure interval contributes absorber mass path . Some meteorological conventions divide by dry-air mass instead; the convention must be stated. A volume or mole mixing ratio instead contributes absorber moles , with background molar mass .
Magnetic resonance imaging with a prepared nuclear population imbalance exceeding ordinary thermal polarization under the imaging conditions. Dynamic nuclear polarization, optical spin transfer and spin-order transfer offer different preparation routes. Preparation and acquisition must account for spin-lattice relaxation, which erases the excess polarization.
An ideal resonant inversion pulse reverses the longitudinal magnetization. Subsequent spin-lattice relaxation gives the displayed recovery law. Observation at a chosen inversion time provides contrast or nulling for a specified relaxation time; an RF inversion alone does not amplify the initial polarization magnitude.
Imaging task-related or spontaneous changes in magnetic-resonance signals associated with physiology, commonly the BOLD signal. Hemodynamic timing and spatial averaging constrain inferences about neural firing and cell-level computations.
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





