Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A hybrid vehicle whose battery can be charged externally and which also carries another propulsion energy source, commonly liquid fuel. Its electric-distance fraction depends on charging and use patterns; possessing a plug does not ensure substantial electric operation.
Introduction of substances or other agents that cause harmful environmental change; the relevant effect depends on the agent, exposure and system.
Increase of a substance within an organism when uptake from its surroundings and food exceeds elimination. This is distinct from biomagnification across a food chain.
Increase in the concentration of some substances along feeding relationships between successive trophic levels. It depends on uptake, transfer and elimination and is not a universal property of all chemicals.
Primary production is formation of organic material from inorganic carbon, powered by light or chemical free energy. Photosynthetic plants, algae and cyanobacteria supply familiar examples. The product supports consumers directly or enters a detritus-based food web.
Gross primary production counts total carbon fixation, whereas net primary production subtracts the producers' own autotrophic respiration. A standing stock of biomass is therefore different from either rate: a small stock can turn over rapidly.
Cloud computing supplies configurable computation resources through a computer network, drawing on a shared pool that users can obtain and release with little provider intervention. The NIST definition distinguishes five characteristics: on-demand self-service, broad network access, resource pooling, rapid elasticity, and measured service. Together these describe how capacity is requested, shared, scaled and accounted for.[ref]
The NIST Definition of Cloud Computing by Peter Mell and Timothy Grance. Section 2, definition and five essential characteristics
For example, a group running a numerical simulation can request several virtual machines, execute independent runs, save the results and release the virtual machines. Rapid elasticity concerns changing allocated capacity as demand changes; measured service records usage such as processor time or storage. A physically distributed system can have a single operator: physical distribution and administrative control answer different questions.
Data replication maintains multiple copies of data. Its value for fault tolerance depends on failure independence, update behaviour and other service dependencies; several copies can still share one operator or a common point of failure.
Data portability permits moving useful application data between implementations or providers. An export format alone need not reproduce a provider's interfaces, credentials or service behaviour, so portability and service interoperability are distinct design questions.
In the client-server model, a network client requests a service supplied by a network server. It can be used within a federated deployment or a centralised one; it does not by itself determine whether an application respects the end-to-end principle.
Fix the operation being considered and the conditions under which it must complete. A mandatory service dependency means that completing the designated operation of requires to supply its designated service. Dependencies can be represented by a directed graph. The operation and conditions matter: an operation that can use an already retained result need not require a new response from its original source.
A directed path of mandatory dependencies propagates necessity. This follows by mathematical induction on the path length: one edge is the definition, and composing one further necessary condition gives the induction step. Consequently, if every replica requires the same component, losing that component can block the operation at every replica. Keeping copies of other components does not remove the shared requirement. Conversely, the availability of every dependency is not by itself a proof that an operation will complete.
A sequential circuit has stored state. Its future output can therefore depend on earlier inputs as well as the present inputs.
A recurring digital signal whose designated clock edge triggers a state update. A rising clock edge is the transition from the low level to the high level; a falling clock edge is the reverse.
Study of embryos and their formation. Historical embryology combined dissection, optical microscopy, comparison of developmental stages and, increasingly, experimental intervention.
Represent a sequence by a function mapping each value to its increasing list of occurrence positions. On finite inputs, querying a value produces every matching index and a terminating tail. On infinite inputs, absence of further occurrences may be uncomputable by a generic scan, as expressed by the absence-detection obstruction for infinite lists. Parity filtering and index rescaling represent alternate-element subsequences, but may fail to preserve productivity.
A stateful interface exposing a remaining sequence through an availability test and an operation returning and consuming its head. An iterator can represent an infinite sequence without materializing all elements, provided demanded steps terminate. Destructive iterators generally require exclusive ownership of their consumption state; sharing an iterator is not the same as creating a fresh independent traversal.
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





