Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Changing the current value of an outcome after instrumental training, then testing the associated action. Testing without delivering that outcome helps distinguish immediate use of changed outcome value from new direct action reinforcement. Sensitivity and insensitivity provide operational tests for goal-directed and habitual control under stated conditions.[ref]
Lesions of dorsolateral striatum preserve outcome expectancy but disrupt habit formation in instrumental learning by Henry H. Yin and others. Abstract, experiments 1–2; pp. 181–189: interval training, devaluation, extinction test and lesion controls
A chemical tracer is a constituent whose measured concentration reveals transport or other processes. An ocean box model can follow a chemical tracer through ocean circulation, with additional source and sink terms if the constituent is produced or removed internally. A passive, conservative chemical tracer changes only by transport and mixing.
Multiplying a carrier by produces a carrier and components at , each with amplitude . For a nondispersive travelling signal all three depend on retarded time , so their wavenumbers also differ: . A time-only amplitude multiplied into a spatial carrier is the same boundary signal at , but is not generally a solution of the free wave equation throughout space.
To score a guess against a fixed-length secret, first reserve every equal-position match. For the remaining positions, consume at most one unused secret occurrence for each cow. This two-stage rule prevents an earlier wrong-position token from using the occurrence needed for a later positional match. The sum of bull and cow counts is the multiset overlap of the two sequences. With only equality tests, deletion from a list gives a quadratic-time implementation; token-count maps can improve the allocation step when a suitable key representation is available.
Suppose a finite candidate set of size contains the truth, every query chooses a current candidate, and each wrong reply eliminates that candidate while retaining the truth. Then at most wrong queries occur. If a correct reply uniquely identifies the truth, an infinite strategy of this kind eventually repeats the true candidate; stopping when only one candidate remains takes at most replies. The proof is the strictly decreasing positive cardinality of the surviving candidate set after every nonidentifying round.
Deciding whether open real intervals are pairwise disjoint has comparison complexity . Sort by left endpoint and scan the maximum previous right endpoint for the upper bound. For the lower bound, map integer keys to . Such intervals intersect exactly when the original integers agree. Each comparison between endpoints and , with , is determined by a comparison of and their fixed offsets, so the reduction preserves the comparison model. Apply the element distinctness problem lower bound.
Find one specified order statistic without sorting every element. Partitioning about a pivot retains only the side containing the requested rank. Median of medians guarantees a balanced enough pivot to give worst-case linear time complexity.
For deterministic linear-time selection, group keys into fives, compute the median of each group, and recursively select the median of those medians as a pivot. Apart from bounded end effects, at least keys lie on either side. Thus the selection cost satisfies , since the fractions sum to . A strong induction with sufficiently large linear coefficient absorbs the lower-order terms.
To find the order statistics at ranks when is a power of two, partition into equal lower and upper rank halves and recurse, stopping at blocks of size . Return each leaf block's maximum. Half boundaries are multiples of , so these leaf maxima are exactly the requested ranks. Linear-time selection gives total partition work per internal level and leaf work, hence overall. The shorter displayed bound applies when .
A fair enumeration emits every required occurrence after finitely many computation steps. The inputs can be infinite; completeness does not mean waiting until they have all been exhausted. If two proper lazy lists alternate their next available entries, every occurrence reaches the output after finitely many swaps. In contrast, a nested list comprehension can remain forever in its first infinite inner list. Fairness concerns input occurrences, even when different occurrences happen to have equal values.
Rearrange an array segment into a low segment containing values below a pivot and a high segment containing values at least , preserving the segment's multiset and leaving the rest of the array unchanged. The pivot need not itself occur, and either resulting segment may be empty.
An in-place scan maintains indices with and . A low value at is swapped into position and advances both indices; a high value advances only . The unexamined length is a loop variant. At exit , establishing the separation in time complexity and auxiliary space complexity. Equal values consistently belong to the high side.
A scientist who studies crop production in relation to plants, soils, climate and management. An agronomist uses field comparisons to connect a proposed intervention with yield or other outcomes under stated growing conditions.
A proposed transport system using a cable extending from a planetary surface beyond a synchronous orbit. In a co-rotating model, the outward effective force on the outer portion supports the inner portion. The endpoint loads, distribution of mass, and material strength determine a feasible tension profile; the uniform unloaded space-elevator cable is an ideal limit.
A vehicle designed to operate in space; idealized motion models use conservation of momentum, gravitational potential energy, and thrust or environmental interaction as appropriate.
A disciplined record or judgment made through sensory or instrumental interaction with an object or event. An observation has conditions of production and interpretation; it is distinct from a deliberate experimental intervention.
Practices making research plans, materials, analyses and outputs inspectable and reusable where ethically appropriate. Preregistration, transparent reporting and executable analysis support distinct aspects of openness. Protecting confidentiality can require restricted data access rather than unrestricted publication.
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





