Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Learning actions that prevent or escape an anticipated aversive outcome. In anxiety, immediate relief and the absence of disconfirming experience can maintain avoidance even when the feared prediction is inaccurate.
Arranging consequences contingent on clearly specified behaviour to change its future occurrence. The target, measurement, timing and alternative responses determine what is reinforced; reinforcement is not identical to punishment.
A consequence that decreases the future occurrence of a response. It is distinguished from negative reinforcement, which increases a response by removing or preventing an aversive event.
Olfaction involving odorants entering the nasal cavity through the nostrils. It commonly samples external sources; its relation to external object attribution is an empirical question rather than a definition of every possible experience.
Olfaction involving food volatiles reaching the nasal cavity from the mouth through the nasopharynx. It contributes to flavor and often to oral attribution. Changing this route can alter transport and peripheral stimulation as well as object context.
The changing illuminated fraction of Venus seen from the Earth. A full sequence including gibbous phases excludes the classical near-side Ptolemaic arrangement but is compatible with both a heliocentric model and a Tychonic system.
A broad term for intuitions and skills concerning numbers and quantities. Studies use the term for different tasks and representations, so a number-sense score or training effect should not be assumed to identify one process or general mathematical ability.
Rapid exact recognition of a small quantity without serial counting. Subitizing small collections does not imply direct exact representation of arbitrarily large numbers or knowledge of the symbolic counting system.
A numerical algorithm is backward stable when its computed output is the exact output for input data perturbed by an amount comparable to the arithmetic's round-off error. The allowed input perturbations and their norm must be specified. A bound on backward error gives a forward error bound only after accounting for the problem's condition number. For example, a singular value decomposition with orthonormal computed outer factors is backward stable in the spectral norm if , with machine precision and a modest dimension-dependent constant .
Vectorized numerical computation applies numerical operations to entire arrays of values instead of explicitly iterating over scalar entries. For a power series, constructing a vector of term indices, evaluating all corresponding terms and summing that vector is a vectorized evaluation. A loop over bounded blocks can control memory while preserving vectorized computation within each block.
An error norm measures a numerical error vector or error function in a specified norm. For nodal errors on a one-dimensional uniform grid of spacing , common choices areThe first controls the largest nodal error. The second approximates a continuum L2 norm on a fixed domain. For nonuniform grids, quadrature or finite-element mass weights replace the common factor .
Mesh weighting matters in a refinement study. If on cells of a unit interval with , then , whereas the unweighted Euclidean norm is . The latter grows solely because the number of entries grows. Compare the same norm on the same physical domain and, for an evolution problem, at the same physical time.
A manufactured solution is a deliberately chosen smooth function used to construct a differential equation problem with a known exact answer. Substituting it into the differential equation determines the forcing, while its boundary and initial values determine matching data. The resulting computation tests a numerical implementation against that answer.
For example, on , choose and consider the forced heat equationUse zero Dirichlet boundary conditions and initial data . Direct differentiation verifies that solves this problem. At a fixed final time, compute an error norm against on successively refined grids. A second-order spatial scheme should show a factor near four when the spatial step is halved, once time, solver and roundoff errors are smaller than the spatial error. This checks the implemented equations and their order of a numerical method; it does not establish that those equations model a particular physical system correctly.
For a computed state and an exact state , an energy error is for a specified energy function . If the exact dynamics conserve , the reference is simply . This is a scalar diagnostic; it does not by itself bound position or phase errors.
For the unit-frequency harmonic oscillator , , the exact energy is . The Forward Euler method givesThus a fixed positive step produces systematic energy growth even though the exact oscillator has constant energy. A bounded oscillatory energy error has a different long-time meaning from such cumulative drift. Comparing methods also requires the same step size, reference trajectory and observation interval.
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





