Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A beta sheet closed into a barrel-like protein fold by joining its edge strands through backbone hydrogen bonds. A membrane-spanning barrel can present nonpolar side chains to lipid while lining a pore with polar groups; soluble barrels instead have a different solvent-facing pattern. The topology alone does not imply a membrane location.
The horizontal displacement between launch and landing in a projectile motion model. With equal launch and landing heights, uniform gravitational acceleration , no air resistance, launch speed and angle , it is . Different landing heights or forces change the result.
An object launched into motion whose subsequent trajectory is determined by external forces. The ideal elementary projectile motion model retains uniform gravity and neglects air resistance.
A motor-learning task in which a participant tries to keep a stylus on a moving target. Practice-related improvement and retention across sessions can assess skill learning separately from explicit recollection of the practice.
In decision theory, an action is evaluated by a loss that depends on the unknown state and chosen action . A statistical decision rule maps observed data to an action. Its frequentist risk isA Bayesian analysis averages this risk under a prior distribution. After observing data, a Bayes action minimizes posterior expected loss, , when a minimizer exists. For a finite classification problem with loss one for a wrong label and zero for a correct label, this chooses a label of maximum posterior probability. A different loss can rationally produce a different action from the same posterior distribution.
A minimax rule instead seeks to minimize , the worst-case risk. Specifying a loss and the information available to a rule makes the optimization problem explicit; probability calculations alone do not determine which consequences should be valued. Preference-based formulations can describe choices through expected utility under suitable consistency axioms.
In a quantum application, recovering Born rule weights from preferences requires specifying how physically equivalent games and irrelevant branch refinements affect value; it is not a consequence of decoherence alone.
A mathematical account of random outcomes using a probability space and specified random variables. It determines probabilities for events or observed data. A statistical model commonly supplies a family of such probability distributions with unknown parameters; choosing a model and estimating its parameters are distinct tasks.
Counts preserving how cases from a common population fall into nested classes and evidence subsets. Bayesian inference can then use a ratio of joint counts, . For uniform sampling from those cases, conditional probability is the number satisfying both class and evidence divided by the number satisfying the evidence, so the ratio follows directly without reconstructing separately normalized rates. Separately normalizing each class to the same artificial denominator does not preserve the original prevalence automatically.
Let a model have parameter prior density , observation probability and conditional binary-query probability after observation. Draw and an independent uniform random variable . Accept exactly when , then output whether . At fixed , the accepted true and false intervals have lengths and . Integrating against and dividing by the positive evidence proves equality of the joint posterior law of parameters and answer. This can replace many latent choices by one auxiliary coordinate. It preserves that joint law, not unreported latent traces. More generally the bounded factor must be a probability or first be divided by a valid common rejection envelope.
In John Locke's terminology, a body's exclusion of another body from the space it occupies. This is not the material-science notion of hardness: John Locke treats water as solid in this sense while distinguishing its yielding response from a diamond's resistance.[ref]
An Essay Concerning Human Understanding by John Locke. Book II, chapter IV, especially section 4: barryfvaughan.org/text/philtext/locke/bk2/4.html
Organizing pupils partly by assessed achievement. The commonly used label ability grouping should not imply that a placement measures a fixed innate capacity; grouping format, movement and instruction must be specified.
Prevention offered to a whole specified population regardless of individually assessed risk. Universal delivery can produce different effects across subgroups and does not imply that every participant has equal risk.
An initial segment of a string, including the empty string or the whole string. Two strings share a prefix exactly when their initial characters agree up to its length. The longest common prefix is the longest such shared initial segment.
Start with required facts . If , the empty prefix suffices. Otherwise choose an action adding a member of and deleting none of , record it as a final action, and remove its add effects from . Repeat and reverse the recorded actions when the residual requirements hold initially. Reject if no permitted action exists.
Soundness follows because each recorded last action supplies its removed requirements without deleting the remaining ones. If a plan satisfies a residual not contained in , its last action affecting cannot delete an -fact and must add one; therefore a candidate exists. Any selected candidate leaves a smaller required set, which is no harder to achieve than . This proves completeness by mathematical induction. Every selection removes a required fact, so there are at most selections and a scan of all effect lists at each step gives polynomial time.
A cross-spectrum relates the Fourier transforms of two random fields or two stochastic processes. The cross-spectrum of two stationary time series gives the discrete-time case.
For statistically homogeneous random fields, the three-dimensional cross-power spectrum is defined byunder the Fourier transform convention . For isotropic fields it depends only on . A deterministic relation implies . An angular cross-power spectrum is defined analogously from spherical harmonic coefficients.
For a differentiable neural network and initialization law , the expected neural tangent kernel is , assuming finite diagonal expectations. At a fixed parameter value the corresponding inner product defines the empirical neural tangent kernel. Both are positive-semidefinite kernels, since a finite quadratic form is respectively an expected squared norm or a squared norm. In suitable infinite-width scalings, the empirical kernel matrix converges to a deterministic limit and remains constant during training. Squared-error gradient flow then has the same training-prediction dynamics as kernel regression with this limit, provided the initial predictions match.
Let be a symmetric positive-definite matrix, , and . Thenis the unique solution of minimizing the quadratic form under the affine optimization constraint . The minimum value is .
The denominator is positive because is a positive-definite matrix. The Lagrange multiplier equations give the displayed candidate and verify the constraint. For a global proof, any feasible perturbation satisfies . HenceThis is positive for every nonzero . The result also handles several independent quadratic blocks by taking to be their block diagonal matrix and concatenating their variables.
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





