Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The common multiplicity of two multisets, summing the smaller multiplicity of each value. To return an order-preserving overlap of two finite lists, scan the first list and consume one equal item from the second whenever available. Each token can be consumed at most once, so the resulting subsequence has maximum possible length among those that occur in a permutation of the second list.
A finitely supported function , allowing negative as well as positive multiplicities. Missing keys denote zero. Addition, exact subtraction, pointwise maximum/minimum and pointwise order can be implemented over the union of operand supports. A nonnegative multiset is a refinement, but exact subtraction can leave that refinement while still producing a signed multiset. Fixed-width count implementations must also specify overflow behavior.
The set of keys with positive multiplicity. Its cardinality counts distinct keys, whereas summing the multiplicities counts all occurrences. A count-array implementation can maintain the support cardinality by tracking only zero-to-positive and positive-to-zero transitions.
A multiset of keys in a fixed finite integer range represented by one nonnegative count per key. The abstraction function extends the stored array counts by zero outside the range. Single-key additions, removals and queries use constant array work, provided overflow and operation preconditions are handled. Encapsulation of the count array is necessary to preserve its representation invariant.
Combining estimates or evidence from several sensory channels. Tests measure both the combined judgment and the uncertainty of the individual cues. A common-cause assumption should be tested rather than inferred merely from concurrent presentation.
Inference about whether sensory signals have a common source or separate sources. Bayes' theorem compares hypotheses through . A common-source hypothesis can permit cue combination; separate-source hypotheses can preserve distinct estimates. Reliability weighting conditional on a common source is therefore not the entire causal-inference problem.
A task-defined range of intersensory delays compatible with grouping or reported simultaneity. Its estimate depends on stimulus content, sensory uncertainty and decision criteria. It is not automatically the duration of one anatomical neural integrator.
Multilinearity is the property of being a multilinear map: each argument enters linearly while every other argument is fixed.
The predominantly silicate shell beneath the lunar crust and above the lunar core, whose deep thermal and mechanical structure is constrained by seismic and tidal measurements.
The old, commonly bright and heavily cratered lunar terrains whose crust is rich in feldspathic material, including anorthosite. They occur on both lunar hemispheres, although the far side of the Moon has more extensive highlands and generally thicker crust. Their ancient crustal formation must be distinguished from later impact modification.
The hemispheric contrast involving thicker, generally higher feldspathic crust on the far side of the Moon, compared with generally thinner crust, more extensive lunar maria and the concentration of KREEP-rich material on the near side of the Moon. Crustal mass, topography, chemistry and later volcanic deposits are different observables. A proposed mechanism must explain their relationship rather than identify the contrast solely with visible dark maria.
Lunar material enriched in potassium, rare-earth elements and phosphorus, together with other incompatible elements. It is associated with evolved residual liquids from lunar differentiation; accompanying uranium and thorium provide radiogenic heating. KREEP is a geochemical designation, not itself a synonym for all mare basalt or for a unique physical crustal layer.
Allow individual vertices to switch in either direction according to a fixed neighbour threshold, while the objective is to maximize the number in one designated state. Let be the monotone threshold activation closure of the initially designated vertices. At every time in any legal switching sequence, the designated set remains a subset of : a loss preserves inclusion, while a gain outside is impossible because all currently designated neighbours lie in and the outside vertex has too few neighbours there. This induction proves an upper bound of on every attainable designated population. The monotone sequence attains itself and is therefore globally optimal. Temporary losses cannot improve this objective.
The energy component of a transferred four-momentum in a specified frame. In fixed-target deep inelastic scattering the target rest frame gives , where are incoming and scattered electron energies. It is frame dependent even though is Lorentz invariant.
For a uniform solid cylinder of length , radius and mass , a thin circular slice at axial coordinate has transverse moment of inertia about a diametral axis through the cylinder's midpoint. Integrating from to gives . The parallel axis theorem gives about a parallel axis through an end-face centre. The transverse and symmetry-axis moments of inertia coincide exactly when .
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





