Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Silencing of much of one X chromosome in a cell lineage. In a heterozygous retina it can create a mosaic of cells expressing different X-linked opsin variants. That mosaic provides potential spectral diversity but does not by itself establish tetrachromacy.
Allocation of resources among agents according to a specified fairness requirement. For indivisible items, each bundle is a set of whole items, and a complete allocation assigns every item exactly once. An envy-free allocation is one fairness criterion. Existence depends on the permitted allocations: indivisibility can prevent fairness that would be possible after splitting resources or permitting unallocated items.
A bundle-value function for which an agent's value for a set of items is the sum of its item values. Different agents may assign different values to the same item. With nonnegative item values, a bundle containing no positively valued item has value zero. The formula excludes interactions such as a pair of items being valuable only when held together.
An allocation of bundles is envy-free if each agent weakly prefers its own bundle to every other agent's bundle, evaluating both through its own value function. With an additive valuation,The reverse comparison uses , so both directions are independent requirements. Ties are permitted. Empty bundles and unallocated items are separate modelling choices, not consequences of envy-freeness.
For nonnegative additive valuations, the requirement that each allocated item be assigned to an agent who values it strictly positively. This condition alone does not require allocating every item.
Let and restrict agent 's constraint domain to subsets of , or to nonempty subsets when required. If , the two bundles are automatically disjoint and each agent values the other's bundle at zero. Both directional envy-free allocation binary constraints are then automatic. Thus positive-support overlaps determine which pairs can still matter in the residual constraint graph.
A finite game represented succinctly by propositional logic. Each player controls a disjoint collection of Boolean variables and chooses their truth values. Together those choices determine a Boolean valuation. A player's goal is a propositional formula, with payoff one if satisfied and zero otherwise. The control sets normally form a set partition of all variables.
A pure strategy strategy profile is a Nash equilibrium if every unsatisfied player remains unsatisfied after every change to that player's controlled variables. Checking a candidate can therefore require solving a Boolean satisfiability problem, even though evaluating its current payoffs is easy.
A game described by a game tree, with the acting player and available actions specified at each decision node, payoffs at terminal nodes, and information sets indicating which decision nodes a player can distinguish. A pure strategy specifies an action at every information set belonging to that player, including ones not reached during realized play.
A collection of decision nodes that the acting player cannot distinguish when choosing an action in an extensive-form game. All nodes in an information set have the same acting player and available actions. A behavioural strategy assigns the same action probabilities throughout that set.
An extensive-form game in which each information set contains a single decision node. Each acting player knows the entire preceding sequence of moves. Finite games with this property can be solved for a subgame perfect equilibrium by backward induction.
A player has perfect recall when the information sets never erase that player's previously available information or earlier chosen actions. With perfect recall, randomizing once over complete pure strategies and using suitable independent randomizations at information sets can induce the same outcome distributions.
Without perfect recall, one information set may be encountered twice on the same play path. A behavioural strategy then uses the same probabilities with fresh draws at both encounters; its outcome distribution need not be attainable by any mixed strategy over deterministic plans.
An assignment of an action probability distribution to every information set of a player in an extensive-form game. Randomization is fresh at each encounter. It differs from a mixed strategy, which chooses a complete deterministic plan once before play. Perfect recall is central to equivalence of their induced outcome distributions.
A decision problem in which the same information set can be reached more than once along a single path, so the decision-maker does not know which visit is occurring. It violates perfect recall. A behavioural strategy uses a common probability at each visit and independent random draws, making terminal probabilities nonlinear in that probability.
For instance, let stopping at the first visit pay zero, continuing and then stopping pay eight, and continuing twice pay one. With continuation probability , expected payoff is . Its maximum exceeds the best deterministic-plan payoff of one. Randomizing once between the deterministic plans cannot reproduce the two fresh decisions.
A turn-based game on a directed graph in which a player tries to force a designated target set. Its winning region is a least fixed point: add that player's vertices with some winning successor and the opponent's vertices with all successors winning. The finite-graph version uses the same construction as a winning-position attractor in an infinite game.
With disjoint terminal wins for two players and infinite plays valued as draws, compute both reachability attractors while keeping terminals fixed. Entry ranks give terminating winning strategies; positions outside both regions admit defence avoiding a forced loss. A cycle alone is not a certificate of a draw if it also offers a forceable winning exit.
A game whose players' utility are specified separately, without assuming a fixed sum. Improving one player's utility need not worsen another's. A finite perfect-information game can be solved by backward induction using entire utility tuples and each moving player's own coordinate, as in max-n search.
With parallel inertial axes and absolute time, differentiating a Galilean transformation adds relative velocities as ordinary vectors. This is the low-speed limit of relativistic velocity addition. At speeds comparable with the speed of light, absolute time is no longer the appropriate frame transformation, and the relativistic denominator cannot be neglected.
For a resting uniform continuum gas with pair interactions depending on relative positions, shifting every particle momentum by leaves interaction energy unchanged and changes the microscopic kinetic energy by . The resting ground state has total momentum . The resulting boost energy uses the bare mass even in an interacting Fermi liquid; matching this with the Landau quasiparticle energy functional constrains its interaction kernel.
A morphological grouping of elliptical galaxies and lenticular galaxies. “Early” is a historical classification name, not a direct statement that a galaxy is young. Dynamical comparisons use a stated structural family and stellar population.
The projected radius enclosing half an object's total luminosity in a specified photometric passband. For circular apertures, the mean linear surface brightness inside it is . Elliptical apertures require an axis-ratio factor or a circularized radius; that convention must be stated when comparing calibrations.
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





