Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Extra propagation time of a light or gravitational-wave signal through a gravitational field compared with an appropriate flat-space reference. In a weak static field with Newtonian potential of a point mass , the leading delay along an approximately straight ray is . The local speed of light remains ; the integrated geometry changes the relation between emission and reception times.
The human gene encoding a transcription factor implicated in speech and language development through rare pathogenic variants. Related genes in other vertebrates provide mechanistic models, but the human phenotype is not equivalent to any single animal motor task. A gene-to-phenotype relationship does not by itself isolate one affected brain structure.[ref]
A forkhead-domain gene is mutated in a severe speech and language disorder by Cecilia S. L. Lai and others. Nature 413, 519–523; KE-family cosegregation and independent chromosome-translocation case
A garbage collection root is an initially accessible reference from which the collector traces reachable software objects. Depending on the runtime, roots include active stack or register references and static references. Software objects reached transitively through reference fields must remain live. Exact root sets and collection timing are implementation details.
A tracing garbage collection implementation starts from garbage collection roots and follows software object references. Software objects outside that reachable set can be reclaimed, including cycles that have no path from a root. A decorator or adapter holding a component reference keeps that component reachable while the wrapper remains reachable. The number of allocated software objects alone does not establish how much storage can be reclaimed.
A function is strict in an argument if replacing that argument by the bottom value makes the result bottom. This semantic property does not prescribe evaluation order: a function that always diverges is strict without inspecting its argument. Strictness of a structured argument also does not mean evaluation of every component.[ref]
The structural recursion that replaces an empty list by a chosen value and a cons constructor by a combining function applied to the head and folded tail. A direct list fold is strict in the list spine at its outermost constructor, even when the combining function does not demand the folded tail. Its algebraic recognition rule is the fold factorisation criterion.
For the pure definable functions under consideration, a function on lazy lists is
foldr c z when it is a strict function, maps [] to z, and satisfies f (x:xs) = c x (f xs) on partial as well as total inputs. Necessity follows from the fold equations. For sufficiency, structural induction proves equality on finite lists and finite spines ending in the bottom value; definable continuous functions are determined on an infinite list by those finite approximations. The important information constraint is that a step receives the tail only through its folded result. Equal folded tails must yield equal extended results when the new head is the same.Mutually dependent streams evaluated by lazy evaluation. A useful sufficient condition for productivity is that one participant emits its first constructor independently of any reply, while its -st output depends only on the first replies. A scorer mapping each guess to a terminating response then lets each finite interaction prefix be constructed inductively. Inspecting the reply stream before emitting the first guess instead creates a circular demand.
A structural recursion replacing the empty binary tree by a value and a nonempty node by a combining function on its two folded children and root label. The result type may itself be a function type, allowing a fold to construct a membership predicate or a difference list rather than traversing all branches for every subsequent query.
More generally, choose one operation for each data constructor. For a leaf-labelled binary tree represented by
One a | Two (Tree a) (Tree a), the tree fold instead has type signature (a -> b) -> (b -> b -> b) -> Tree a -> b: one operation handles the leaf label, and the other combines the two folded children. Replacing the operations by the original data constructors reconstructs the input, as structural induction proves.A list reduction carrying an accumulator from left to right:
foldl s z [] = z and foldl s z (x:xs) = foldl s (s z x) xs. In a lazy language this does not by itself force each intermediate accumulator; its association and evaluation strictness are separate issues. An infinite input spine prevents this operation from returning a result.[ref]Generate a list from a state: a step returning
Nothing terminates; Just (x,s') emits x and continues from s'. Thus unfoldr step s = case step s of Nothing -> []; Just (x,s') -> x : unfoldr step s'. A list unfold decomposes the evolving state, whereas a list fold consumes existing constructors. Productivity depends on each demanded constructor becoming available, not merely on using lazy evaluation.Split a list into the subsequence satisfying a predicate and the subsequence failing it, preserving relative order in both. One recursive traversal computes the pair for the tail once, evaluates the head's predicate once and prepends the head to the appropriate component. A shared irrefutable pair binding preserves lazy access to either component. Fully consuming both finite outputs takes linear time in addition to predicate evaluation costs.
The pulse repetition frequency counts the number of pulses emitted per unit time in a regular pulse train. If successive pulses are separated by , then . It describes the spacing of pulses, rather than the rapid oscillation of a carrier inside each pulse or the inverse of the individual pulse duration.
For example, pulses sent every have pulse repetition frequency even if their carrier is in the radio frequency range. With identical pulses of energy , the average emitted power is . In an elementary pulsed radar model, an echo must return before the next transmission to avoid pulse-order ambiguity, giving an unambiguous range . The factor two comes from outward and return travel. More elaborate pulse coding can change how the instrument resolves that ambiguity.
GFP is a fluorescent protein used to report cellular location or gene expression. Fluorophore maturation and protein turnover introduce delays and filtering, so measured intensity does not in general reproduce an instantaneous transcription rate.
An air pump transfers air into or out of a vessel by doing mechanical work on the gas. In a simple displacement design, a piston or flexible chamber changes its internal volume, while valves select the direction in which gas enters and leaves. Repeating the cycle moves gas against a pressure difference.
Evacuating a sealed vessel removes molecules and lowers its pressure, but the achievable pressure depends on the pump's operating principle, leakage and gas released by internal surfaces. Compressing air into a receiver instead increases its stored internal energy and can raise its temperature. A pressure-versus-time record therefore probes both pumping and the vessel's gas balance. The device supplies the mechanical means for changing the state; a gas law and an energy balance are needed to predict the resulting pressure and temperature.
An anelastic model filters acoustic density fluctuations while retaining a prescribed stratified reference mass density. For , continuity is . Momentum and buoyancy conventions must be consistent: with reduced pressure , a pressure acceleration contains a vertical density-gradient term that is absent from . The two expressions cannot be interchanged when deriving waves in a stratified atmosphere.
Bottom-quark jet tagging identifies jets compatible with containing a hadron carrying a bottom quark. A sufficiently long-lived bottom hadron travels away from the primary interaction before its particle decay, so displaced particle tracks and a secondary decay vertex provide evidence about its identity. A lepton within the jet can supply additional evidence. A top quark instead decays before hadronization.
A tag is a statistical classification, so both the efficiency for bottom jets and mistaken tags from charm quarks or light jets require calibration. That calibration concerns the flavor tagging response; it is not interchangeable with a calorimeter calibration of deposited energy. Control samples in collision data can measure the tagging efficiency for specified momentum and topology selections; those selections determine where the result applies.[ref]
https://cds.cern.ch/record/2816310. ATLAS, The boosted X to b bbar tagger calibration using Z to b bbar events collected with the ATLAS detector, ATL-PHYS-SLIDE-2022-305: in situ efficiency measurement in a specified boosted topology
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





