Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For counts per electron momentum interval, the allowed spectrum is proportional to when recoil and neutrino mass are neglected. Thus the displayed ordinate is linear in kinetic energy under a constant-shape assumption. Counts per kinetic-energy interval instead have the factor in natural units; the Jacobian accounts for the difference. Mixing those two binning conventions changes the inferred ordinate.
If a beta spectrum has nonconstant shape factor , divide by it as well as by the Coulomb and phase-space factors before taking a square root. A leading unique first-forbidden shape contains in natural units, with Coulomb and nuclear corrections. Dividing only by a Coulomb Fermi function does not remove that shape. A straight uncorrected line must therefore be treated as an approximation, not an exact consequence of forbidden-transition selection rules.
A periodic array of local moments coupled to conduction electrons. Competition between screening, coherent hybridization and intersite magnetic interactions can produce a heavy fermion material, magnetic order or a correlated insulating state.
The maximum equilibrium supersaturation along a solution-droplet growth curve. Above this threshold, an aerosol particle can grow into an activated cloud droplet under the conditions of the parcel. In Köhler theory, larger dry diameter or greater hygroscopicity generally lowers the threshold; aerosol number alone does not specify it.
The bounded knapsack problem adds per-type upper limits to the integer knapsack problem. It interpolates between 0-1 knapsack problem () and the unbounded knapsack problem.
Processing types one at a time gives . The previous-type index prevents the recurrence from exceeding the allowed count. For large , splitting counts into power-of-two bundles and a final remainder reduces the bounded type to logarithmically many 0-1 knapsack problem items while preserving every allowable count.
In the unbounded knapsack problem, each item type may be used any nonnegative integer number of times. With positive integer weights , values and capacity , maximize subject to and .
A dynamic programming recurrence for capacity-at-most value is . Evaluate capacities in increasing order so repeated uses are available. With weights three and five, values four and seven, and capacity ten, two weight-five items give value fourteen. A zero-weight positive-value item would make the objective unbounded, explaining the positive-weight hypothesis.
For a complex Klein-Gordon field, is conserved. A mode has , so unrestricted positive- and negative-frequency solutions do not have a positive probability norm under this current. In the quantized complex field, the associated conserved quantity is charge: particles and antiparticles contribute with opposite signs while both have positive excitation energy and positive Fock space norm.
For unidirectional flow through area with mean speed , the outgoing kinetic-energy flux is , where . Cubing the mean speed generally differs from averaging the cube. A uniform profile has ; circular laminar Hagen-Poiseuille flow has .
Viscous transfer of tangential momentum smooths gradients of velocity. For unidirectional incompressible flow without a pressure gradient, the Navier-Stokes equation reduces to the displayed diffusion equation, whose diffusion coefficient is the kinematic viscosity .
An intensity-dependent refractive index produced by the optical field itself. In a simple instantaneous isotropic model, . A transversely nonuniform intensity produces self-focusing for positive and self-defocusing for negative . Temporal intensity variation produces self-phase modulation. These are consequences of a third-order nonlinear optical susceptibility, distinct from a static applied-field electro-optic Kerr effect.
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





