Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A flower bud is an undeveloped flower in which the floral organs are forming or remain enclosed before anthesis. It differs from a vegetative bud, which will extend a shoot with leaves. A flower bud is already reproductive even while its external coverings hide the future stamens and carpels.[ref]
Molecular Biology of the Cell, 4th edition by Bruce Alberts and others. Chapter 21, Plant Development: floral meristems and successive floral organ primordia
Dissecting a series of flower buds of increasing size can reveal the order in which floral structures appear. Opening the largest bud is not equivalent to observing the original switch to flowering: that developmental decision occurred earlier. This makes flower bud size a useful staging observation, provided the relation between size and internal development is checked for the particular plant.
Robust linear constraints for bounded covariance models require a linear inequality to hold for every error state admitted by the selected bounded model. A covariance matrix fixes second moments; the robust guarantee additionally depends on the support of a probability distribution or other specified uncertainty set. This distinction matters when a physical limit must never be crossed within the model.
Let as in finite-support realization of a covariance matrix, where all coordinates of are independent fair signs. Then . For nominal input , require for every sign state. Writing , direct minimization givesEach sign can independently oppose its coefficient, including when some coefficients vanish. Thus the exact necessary and sufficient condition is , using the L1 norm. The same extremum holds over the full box because a linear function attains an extreme at a vertex. This is a support function calculation in robust optimization; the general worst-case formulation and its dependence on the uncertainty set are illustrated in the primary optimization text.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §4.4.2, printed p. 157, robust linear programming, equation (4.37); the text's illustrated uncertainty set is an ellipsoid
For an original two-input example in volts, let and , with independent fair signs . The covariance matrix is . To keep the actual first input at least as large as the second, let the nominal difference be . ThenA nominal difference of fails in the state , despite being positive nominally. A difference of leaves a guaranteed margin under this model. Using only the separate bounds , would demand , because that larger box admits joint states the sign model forbids.
The standard deviation of is instead . It is not the hard bound . A different bounded law with the same covariance matrix can change the hard bound, as nonuniqueness of bounded uncertainty laws with a fixed covariance explains. For several linear inequalities, apply the support calculation to each row. This verifies an assumed model's feasible states; it does not establish that the chosen support contains every error of an actual instrument.
Nonuniqueness of bounded uncertainty laws with a fixed covariance means that specifying finite bounds, expected values and a covariance matrix can still leave several different joint probability distributions. They agree on the variance of every linear combination of the errors, but can disagree on threshold probabilities and nonlinear outputs. A particular construction in bounded errors with prescribed correlation therefore requires a distributional assumption beyond its second moments.
Here is an original example with a common allowed box . In model A, and are independent fair signs: the four points each have probability . In model B, the four points each have probability . Both are bounded, have zero expected value, and satisfyFor model B, each squared coordinate is two at two of the four points and zero otherwise, proving its unit variance directly. Its zero covariance does not make the coordinates independent random variables: when is nonzero, must vanish. The common box is an allowed deterministic bound; its boundary need not be attained by every model.
The linear output has expected value zero and variance two under either model. Yet under model A it takes with probabilities , while model B gives only with equal probabilities. Consequently,Even a linear output's threshold risk is not fixed by its variance. For the nonlinear output , model A gives always and model B gives always. Thus the complete output law, and even a nonlinear output's expected value, can differ.
The law of propagation of uncertainty computes first-order output variance from sensitivity coefficients and input covariance; it does not identify all probabilities. NIST correspondingly requires distributional justification to assign a confidence level to an uncertainty interval.[ref]
Guidelines for Evaluating and Expressing the Uncertainty of NIST Measurement Results by Barry N. Taylor and Chris E. Kuyatt. Appendix A.3 and §§6.2–6.3
The finite counterexample above is an original exact calculation. For guaranteed linear limits, robust linear constraints for bounded covariance models must use the chosen support of a probability distribution, rather than treating a covariance matrix as a support description.Boundary-layer transition is the development of turbulent flow from an initially laminar flow within a boundary layer. A laminar boundary layer can contain small, organized disturbances before the fluctuations become turbulent. Thus detecting an oscillation is evidence of a disturbance, not by itself proof that transition is complete.
A motivating experiment by G. B. Schubauer and H. K. Skramstad studied a flat plate while reducing the surrounding stream's turbulence intensity with damping screens. At unusually low stream disturbances, they observed oscillations in the laminar boundary layer. Controlling the external disturbances made internal disturbance development experimentally distinguishable.[ref]
Laminar-Boundary-Layer Oscillations and Transition on a Flat Plate by G. B. Schubauer and H. K. Skramstad. NACA-TR-909, repository abstract: damping screens, low stream turbulence and observed laminar-layer oscillations
The local Reynolds numbercompares inertia with viscosity using external speed , distance from the leading edge and kinematic viscosity . For stipulated , and , it is approximately . This calculation specifies a flow scale; it is not a universal transition criterion. Surface condition, surrounding disturbances and the pressure gradient also matter.
A simple model of boundary-layer disturbance amplification makes this sensitivity explicit. Suppose a small disturbance amplitude obeysIf a stipulated breakdown amplitude is 100 times the initial amplitude, the integrated growth needed is . Increasing the initial amplitude tenfold reduces that requirement to . This is an illustrative linear growth model, not a calibrated predictor of turbulent breakdown. It explains why specifying Reynolds number without specifying the disturbance environment can leave the observed transition location undetermined.
A bosonic string is a relativistic one-dimensional object whose embedding coordinates are bosonic fields on a two-dimensional worldsheet. Its classical motion can be described by the Nambu–Goto action, proportional to the worldsheet area, or by the equivalent Polyakov action with an auxiliary worldsheet metric.
An open string has endpoints; a closed string forms a loop and has independent left- and right-moving oscillations. Quantization produces a tower of particle states. In the ordinary flat critical bosonic string theory, anomaly cancellation selects 26 spacetime dimensions, and the closed-string spectrum includes a massless graviton. The tachyonic ground state indicates instability of the chosen vacuum.[ref]
A borehole televiewer produces an oriented image of a borehole wall, often by scanning with acoustic pulses. Recorded echo amplitude and travel time reveal changes in wall reflectivity and radius as a function of depth and azimuth.
An enlarged cross-section can indicate borehole breakout, while fractures produce other characteristic traces. Inferring the surrounding stress requires a mechanical interpretation of those features; the image alone does not directly measure every stress component. Borehole conditions and tool orientation affect the result.
A proper border of a string is a string prefix that is also a string suffix and is shorter than the complete string. With zero-based lengths, its length satisfies for a length- string, if the empty string is allowed. Specify that convention when counting borders.
For
ababa, the nonempty proper borders are a and aba; the complete ababa is a border of a string but not a proper one. A proper border of length allows two copies of the string to overlap with displacement . The border aba therefore explains the shift of two between overlapping occurrences of ababa in abababa.The prefix function stores the longest proper-border length of each prefix. For
ababa, following these lengths gives , listing successively shorter candidate overlaps. The Knuth-Morris-Pratt algorithm uses this chain after a mismatch, retaining a suffix already known to match rather than comparing the whole pattern again.Diborane, , is an electron-deficient borane with four terminal B–H connections and two bridging hydrogen atoms. The bridges are described by three-centre two-electron bonds, with one bonding electron pair shared over each B–H–B unit.
The valence-electron count explains why the multicentre model is useful: valence electrons. Four ordinary terminal bonds use eight, leaving four for the two bridges. Assigning a separate ordinary two-electron bond to every boron–hydrogen contact would demand more electrons than the neutral molecule has. Diborane therefore provides a concrete counterexample to treating every drawn connection as an independent localized electron-pair bond.
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





