Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The all-activating feed-forward loop combines direct activation of an output with indirect activation through an intermediate. Under AND logic the intermediate's accumulation delays production and can reject brief inputs. Removal of direct activation stops production immediately, while the output concentration still has its own decay time.
For a two-particle collision conserving total momentum, the outgoing speeds in the centre-of-momentum frame are multiplied by the same . The relative kinetic energy is multiplied by . For a smooth oblique collision with normal coefficient of restitution and incident relative velocity inclined by to the contact normal, unchanged tangential relative motion gives . Thus is not a general oblique-impact identity: and give . Sticking requires all relative motion to vanish, not merely its normal component.
An isolated conducting sphere of radius initially at potential has charge . Inserting it without contact into the hollow inner conductor of a long coaxial cylindrical capacitor conserves that charge. The neutral inner conductor acquires on its cavity wall and outside. With the outer conductor grounded, the annular electric field is and the inner potential is the displayed result. The original electric potential is not conserved. End effects are neglected; exact cavity fields are geometry-dependent.
A pull-up network connects a logic output to the high supply rail when its conducting condition holds. In static complementary CMOS, it is built from PMOS transistors and paired with a complementary pull-down network.
A pull-down network connects a logic output to the low supply rail when its conducting condition holds. In static complementary CMOS, it is built from NMOS transistors; its conducting condition is the negation of the desired output Boolean function.
For an NMOS transistor network described by a series-parallel expression in conducting inputs, replace series by parallel, parallel by series, and each device by a PMOS transistor driven by the same input. De Morgan's laws show recursively that the resulting pull-up network conducts exactly when the original pull-down network does not. This proves complementary rail connections for stable binary inputs in the ideal static model. Factoring a Boolean function before constructing its dual can remove duplicated devices: needs three lower and three upper devices, instead of four of each. Physical switching transients, device sizing and delays are additional engineering questions.
The number of cloud droplets per volume in each radius interval, often represented by . Its width controls differential terminal speeds and collection opportunities; condensational growth with a common narrows relative radius differences.
For droplet number density and radius distribution , let and . The effective radius is . With liquid-water content , . The shape factor gives ; these are distribution moments, not a monodisperse assumption.
Global mean surface warming near the time of carbon-dioxide doubling in an idealized experiment increasing concentration by one per cent per year. Ocean heat uptake generally keeps it below the equilibrium response.
The approximately proportional increase in global temperature per cumulative carbon-dioxide emission over a stated regime. Units must distinguish tonnes of carbon from tonnes of carbon dioxide.
A symmetric positive uncertainty interval for a stabilizing feedback coefficient produces asymmetric uncertainty in its reciprocal. With both cooling magnitude and forcing magnitude uncertain, constant-sensitivity lines are rays ; tangents from the origin to a Gaussian covariance ellipse give a one-parameter profile interval for the ratio. A unit-radius two-variable covariance ellipse is not itself a 68 percent joint confidence region.
The group of unitary Clifford gates, defined by normalization of the Pauli group. For a single qubit, and generate its usual finite gate group, and modulo global phase its action permutes the six Pauli eigenstates. On multiple qubits, one adds an entangling controlled-NOT gate. This quantum-computing use of the name is distinct from groups attached to a general Clifford algebra.
Every closed combinatorial surface has geometric realization homeomorphic to exactly one member of the following list: the sphere ; the connected sum of surfaces of tori; or the connected sum of surfaces of real projective planes. Every member admits a finite triangulation. The orientable family has Euler characteristic , including for the sphere; the nonorientable surface family has Euler characteristic . Thus orientability and Euler characteristic determine the homeomorphism type. The first two nonorientable cases are the real projective plane and the Klein bottle. For a finite disconnected simplicial complex satisfying the same local conditions, the unordered list of its connected components' types determines its type.
Assume and temporarily assume . A further assumption yields a contradiction and hence by the logical falsity elimination rule; discharge it to obtain . Applying gives , contradicting . Discharge the latter assumption to obtain , apply double-negation elimination, and finally discharge . This is a derivation from the primitive classical natural deduction rules. The principle is named for Charles Sanders Peirce.
An orbit passing near both geographic poles of its central body. Planetary rotation brings different longitudes beneath successive passes, useful for global remote sensing; one satellite still samples each location intermittently.
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





