Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Sensory information about bodily position, movement and force, contributing to coordination and relations between seen and felt movement.
Detection and processing of acoustic stimulation. Signal detectability depends on the receiver and background noise.
For a nondegenerate semiconductor with donor density , no acceptors, and donor energy , an occupied donor has two electron spin states while an empty donor has one. Its ionized fraction is therefore . The conduction-band relation gives . Combining charge neutrality, , with the semiconductor mass-action law, , proves the displayed equation.
Its left side increases strictly for and its right side decreases, so there is one physical solution, with . In the freeze-out regime, holes are negligible and solving the quadratic gives . Strong dopant freeze-out reduces this to . An extrinsic plateau requires and , not simply .
An amphoteric dopant can act as a donor impurity or an acceptor impurity according to its incorporated lattice site or defect configuration. Silicon in gallium arsenide is the standard example: substitution on the gallium sublattice gives a shallow donor, while substitution on the arsenic sublattice gives a shallow acceptor. Its electrical effect therefore depends on growth conditions as well as total silicon concentration.[ref]
Thermal equilibrium concentrations of the amphoteric dopant Si and the associated carrier concentrations in GaAs by Chang-Ho Chen and others. Abstract: neutral and ionized donor species occupy Ga sites; neutral and ionized acceptor species occupy As sites
A compensated semiconductor contains both donor impurities and acceptor impurities. In a nondegenerate equilibrium model with both species fully ionized, charge neutrality gives , while the semiconductor semiconductor mass-action law gives . Solving yieldsFor and , and . Numerically the minority concentration is better obtained as than by subtracting nearly equal numbers. If dopants are only partly ionized, replace in charge neutrality by their ionized concentrations and determine the chemical potential self-consistently.
Modulation doping places ionized dopants away from the region in which their supplied charge carriers move. In a semiconductor heterostructure, band alignment can transfer electrons from a doped layer into a nearby lower-energy channel.
This separation reduces scattering from nearby charged impurities while maintaining a substantial mobile-carrier population. It supports a two-dimensional electron gas and the channel of a high-electron-mobility transistor. Separation is not complete decoupling: the donors still set electrostatics, and remote impurities, interfaces and other scattering mechanisms can still limit charge carrier mobility.
Introduction of dopants by accelerating ions into a solid. Their depth distribution, lattice damage and electrical activation depend on implantation and subsequent annealing.
At sufficiently low temperature, thermal ionization of shallow dopants becomes inefficient, reducing the mobile carrier density. An acceptor-doped sample may then have many neutral acceptors and few mobile electron holes. Extracting an activation energy requires a model of dopant ionization and compensation; the mobile density need not have the same simple activation exponent in every compensation regime.
A heterostructure transistor with a high-mobility channel spatially separated from ionized dopants; the gate modulates channel population.
Preferential assembly of components with matching handedness into an individual assembly. A racemic sample can contain equal populations of homochiral enantiomeric cages.
Preferential reaction of one functional group or bond type in a molecule containing alternatives. It depends on reagents, conditions and reaction time rather than being an absolute property of a functional group.
Lazy propagation delays updating a segment tree node's descendants while keeping the node's own aggregate current. Before inspecting only part of its interval, apply its pending tag to both children, compose that tag with each child's pending work, and clear the parent's tag. Whole-interval queries can use the current aggregate without this descent.
Composition order matters. For affine maps , represent a tag by . Applying first and later givesOn an interval aggregate it acts as . These formulas prove that the same combined tag works for a parent and its children. For example, doubling then adding three gives , whereas adding three then doubling gives .
The lazy segment tree contract therefore needs both a correct aggregate action and correct ordered function composition. A pending tag is deferred descendant work, not permission for the parent's aggregate to be stale.[ref]
Lazy Segtree in the AtCoder Library documentation. mapping, composition and id requirements
A lazy segment tree stores interval aggregates in a segment tree while representing compatible deferred updates by tags. The aggregate combination must be a monoid operation, and each tag must act on aggregates consistently with combining intervals. Tags include an identity operation and are closed under function composition.[ref]
Lazy Segtree in the AtCoder Library documentation. opening algebraic requirements and constant-time oracle convention
For range addition and range sums, store , the sum and length of the interval. Combining children adds both components. Adding transforms it into , so a covered node can update its stored sum immediately without visiting every descendant. Its pending tag accumulates the addition for later lazy propagation.
For example, adding three to all four entries of changes the root sum from seven to nineteen. A query for the whole interval returns nineteen immediately. A query for just the first entry must first propagate the pending update along that entry's path. Constant-time aggregate and tag operations give interval updates and queries; an arbitrary update rule need not admit such a representation.
Computational reproducibility means obtaining consistent results from the same input data, computational procedure and stated conditions. A reproducible analysis identifies the actual inputs and their data provenance, the software versions, parameters and relevant environment. Exact bitwise agreement is stronger than agreement within a justified numerical tolerance.[ref]
For example, changing the order of a floating point sum can change its last few digits through rounding error. A useful check states the acceptable absolute error or relative error before comparing results. Successfully rerunning the same code also reruns any undetected mistake in it, so consistency is evidence about the computational process rather than a proof that the physical model is correct.
Testing a scientific finding with newly collected data or an independently conducted study. Terminology varies, so the operational meaning should be stated.
For a spherically symmetric potential energy , separation of variables with reduces the Schrödinger equation to the displayed radial equation. Writing instead removes the first derivative:The angular contribution acts as a centrifugal barrier. Boundary behavior and wavefunction normalization must still be imposed; an arbitrary radial function is not an energy eigenfunction.
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





