source
stringlengths 31
227
| text
stringlengths 9
2k
|
|---|---|
https://en.wikipedia.org/wiki/SwisTrack
|
SwisTrack is a tool for tracking robots, humans, animals and objects using a camera or a recorded video as input source. It uses Intel's OpenCV library for fast image processing and contains interfaces for USB, FireWire and GigE cameras, as well as AVI files.
The architecture of SwisTrack is flexible to allow the user to track (marked and marker-less) objects in many situations. So-called components are stuck together within the component pipeline (like Lego bricks) and configured. Each component then performs one processing step, which can be visualized in real-time. SwisTrack already comes with a series of components, but for specialized tasks, programmers are free to implement their own components. Position and trajectory information can be retrieved via TCP/IP in NMEA 0183 format. Such data can easily be recorded for post-processing, or used in a real-time fashion.
SwisTrack has mainly been developed by the Distributed Intelligent Systems and Algorithms Laboratory (DISAL) and the LPM Vision Group at EPFL in Lausanne, Switzerland.
|
https://en.wikipedia.org/wiki/Yuri%20Prokhorov
|
Yuri Vasilyevich Prokhorov (; 15 December 1929 – 16 July 2013) was a Russian mathematician, active in the field of probability theory. He was a PhD student of Andrey Kolmogorov at the Moscow State University, where he obtained his PhD in 1956.
Prokhorov became a corresponding member of the Russian Academy of Sciences in 1966, a full member in 1972. He was a vice-president of the IMU. He received Lenin Prize in 1970, Order of the Red Banner of Labour in 1975 and 1979. He was also an editor of the Great Soviet Encyclopedia.
See also
Lévy–Prokhorov metric
Prokhorov's theorem
|
https://en.wikipedia.org/wiki/Sliding%20T%20bevel
|
A sliding T bevel, also known as a bevel gauge or false square is an adjustable gauge for setting and transferring angles. Different from the square, which is fixed and can only set a 90° angle, the sliding T bevel can set any angle and transfer it on another piece.
The bevel gauge is composed of two elements connected with a thumbscrew or wing nut, which allows the blade to pivot and be locked at any angle. The handle is usually made of wood or plastic and the blade of metal. The bevel can be used to duplicate an existing angle, or set to a desired angle by using it with any number of other measuring tools (such as a protractor, or framing square).
See also
Bevel
Miter square
|
https://en.wikipedia.org/wiki/SMPTE%20259M
|
SMPTE 259M is a standard published by SMPTE which "describes a 10-bit serial digital interface operating at 143/270/360 Mb/s."
The goal of SMPTE 259M is to define a serial digital interface (based on a coaxial cable), called SDI or SD-SDI.
There are 4 bit rates defined, which are normally used to transfer the following standard video formats:
|
https://en.wikipedia.org/wiki/L%C3%A9vy%E2%80%93Prokhorov%20metric
|
In mathematics, the Lévy–Prokhorov metric (sometimes known just as the Prokhorov metric) is a metric (i.e., a definition of distance) on the collection of probability measures on a given metric space. It is named after the French mathematician Paul Lévy and the Soviet mathematician Yuri Vasilyevich Prokhorov; Prokhorov introduced it in 1956 as a generalization of the earlier Lévy metric.
Definition
Let be a metric space with its Borel sigma algebra . Let denote the collection of all probability measures on the measurable space .
For a subset , define the ε-neighborhood of by
where is the open ball of radius centered at .
The Lévy–Prokhorov metric is defined by setting the distance between two probability measures and to be
For probability measures clearly .
Some authors omit one of the two inequalities or choose only open or closed ; either inequality implies the other, and , but restricting to open sets may change the metric so defined (if is not Polish).
Properties
If is separable, convergence of measures in the Lévy–Prokhorov metric is equivalent to weak convergence of measures. Thus, is a metrization of the topology of weak convergence on .
The metric space is separable if and only if is separable.
If is complete then is complete. If all the measures in have separable support, then the converse implication also holds: if is complete then is complete. In particular, this is the case if is separable.
If is separable and complete, a subset is relatively compact if and only if its -closure is -compact.
If is separable, then , where is the Ky Fan metric.
Relation to other distances
Let be separable. Then
, where is the total variation distance of probability measures
, where is the Wasserstein metric with and have finite th moment.
See also
Lévy metric
Prokhorov's theorem
Tightness of measures
Weak convergence of measures
Wasserstein metric
Radon distance
Total variation distance of probability measures
Notes
|
https://en.wikipedia.org/wiki/L%C3%A9vy%20metric
|
In mathematics, the Lévy metric is a metric on the space of cumulative distribution functions of one-dimensional random variables. It is a special case of the Lévy–Prokhorov metric, and is named after the French mathematician Paul Lévy.
Definition
Let be two cumulative distribution functions. Define the Lévy distance between them to be
Intuitively, if between the graphs of F and G one inscribes squares with sides parallel to the coordinate axes (at points of discontinuity of a graph vertical segments are added), then the side-length of the largest such square is equal to L(F, G).
A sequence of cumulative distribution functions weakly converges to another cumulative distribution function if and only if .
See also
Càdlàg
Lévy–Prokhorov metric
Wasserstein metric
|
https://en.wikipedia.org/wiki/Karplus%20equation
|
The Karplus equation, named after Martin Karplus, describes the correlation between 3J-coupling constants and dihedral torsion angles in nuclear magnetic resonance spectroscopy:
where J is the 3J coupling constant, is the dihedral angle, and A, B, and C are empirically derived parameters whose values depend on the atoms and substituents involved. The relationship may be expressed in a variety of equivalent ways e.g. involving cos 2φ rather than cos2 φ —these lead to different numerical values of A, B, and C but do not change the nature of the relationship.
The relationship is used for 3JH,H coupling constants. The superscript "3" indicates that a 1H atom is coupled to another 1H atom three bonds away, via H-C-C-H bonds. (Such hydrogens bonded to neighbouring carbon atoms are termed vicinal). The magnitude of these couplings are generally smallest when the torsion angle is close to 90° and largest at angles of 0 and 180°.
This relationship between local geometry and coupling constant is of great value throughout nuclear magnetic resonance spectroscopy and is particularly valuable for determining backbone torsion angles in protein NMR studies.
|
https://en.wikipedia.org/wiki/Sergeyev%20Collection
|
The Sergeyev Collection (officially Nikolai Sergeev Dance Notations and Music Scores for Ballets) is a collection of choreographic notation, musical materials, designs for décor and costumes, theatre programs, photos and other items that document the repertory of the Imperial Ballet (precursor of the Kirov/Mariinsky Ballet) of St. Petersburg, Russia at the turn of the 20th century. The majority of the choreographic notations document the original works and revivals of the choreographer Marius Petipa, who served as Premier Maître de ballet of the St. Petersburg Imperial Theatres. The collection also documents a few ballets by Lev Ivanov, who served as second Maître de ballet. Also included in the collection are choreographic notations documenting the choreography for the dances of various operas by both Petipa and Ivanov, respectively.
The collection is named for Nicholas Sergeyev, former dancer and of the St. Petersburg Imperial Theatres, who brought the collection out of Russia after the Russian Revolution of 1917. Since 1969 these materials have been held in the Harvard Theatre Collection at Houghton Library.
History of the collection
At the end of the nineteenth century, the dancer Vladimir Stepanov developed his own method of choreographic notation, which he detailed in his book L'Alphabet des Mouvements du Corps Humain. In 1893 Stepanov proposed a project to the head committee of the Imperial Ballet of St. Petersburg and its school, the Imperial Ballet School, that would record the company's repertory for posterity. The committee, which made decisions on the appointment of dancers, repertory, etc., consisted of Marius Petipa (Premier Maître de ballet of the St. Petersburg Imperial Theatres); Lev Ivanov (second Maître de Ballet); Ekaterina Vazem (former Prima ballerina of the Imperial Theatres and teacher of the classe de perfection); Pavel Gerdt (Premier danseur of the Imperial Theatres); and Christian Johansson (former Premier danseur of the Imperial Thea
|
https://en.wikipedia.org/wiki/Guard%20digit
|
In numerical analysis, one or more guard digits can be used to reduce the amount of roundoff error.
For example, suppose that the final result of a long, multi-step calculation can be safely rounded off to N decimal places. That is to say, the roundoff error introduced by this final roundoff makes a negligible contribution to the overall uncertainty.
However, it is quite likely that it is not safe to round off the intermediate steps in the calculation to the same number of digits. Be aware that roundoff errors can accumulate. If M decimal places are used in the intermediate calculation, we say there are M−N guard digits.
Guard digits are also used in floating point operations in most computer systems. Given we have to line up the binary points. This means we must add an extra digit to the first operand—a guard digit. This gives us . Performing this operation gives us or . Without using a guard digit we have , yielding or . This gives us a relative error of 1. Therefore, we can see how important guard digits can be.
An example of the error caused by floating point roundoff is illustrated in the following C code.
int main(){
double a;
int i;
a = 0.2;
a += 0.1;
a -= 0.3;
for (i = 0; a < 1.0; i++)
a += a;
printf("i=%d, a=%f\n", i, a);
return 0;
}
It appears that the program should not terminate. Yet the output is: i=54, a=1.000000
Another example is:
Take two numbers:
and
We bring the first number to the same power of as the second one:
The addition of the two numbers is:
0.0256*10^2
2.3400*10^2 +
2.3656*10^2
After padding the second number (i.e., ) with two s, the bit after is the guard digit, and the bit after is the round digit. The result after rounding is as opposed to , without the extra bits (guard and round bits), i.e., by considering only . The error therefore is .
See also
Significant figures
|
https://en.wikipedia.org/wiki/Manipulative%20%28mathematics%20education%29
|
In mathematics education, a manipulative is an object which is designed so that a learner can perceive some mathematical concept by manipulating it, hence its name. The use of manipulatives provides a way for children to learn concepts through developmentally appropriate hands-on experience.
The use of manipulatives in mathematics classrooms throughout the world grew considerably in popularity throughout the second half of the 20th century. Mathematical manipulatives are frequently used in the first step of teaching mathematical concepts, that of concrete representation. The second and third steps are representational and abstract, respectively.
Mathematical manipulatives can be purchased or constructed by the teacher. Examples of common manipulatives include number lines, Cuisenaire rods; fraction strips, blocks, or stacks; base ten blocks (also known as Dienes or multibase blocks); interlocking linking cubes (such as Unifix); construction sets (such as Polydron and Zometool); colored tiles or tangrams; pattern blocks; colored counting chips; numicon tiles; chainable links; abaci such as "rekenreks", and geoboards. Improvised teacher-made manipulatives used in teaching place value include beans and bean sticks, or single popsicle sticks and bundles of ten popsicle sticks.
Virtual manipulatives for mathematics are computer models of these objects. Notable collections of virtual manipulatives include The National Library of Virtual Manipulatives and the Ubersketch.
Multiple experiences with manipulatives provide children with the conceptual foundation to understand mathematics at a conceptual level and are recommended by the NCTM.
Some of the manipulatives are now used in other subjects in addition to mathematics. For example, Cuisenaire rods are now used in language arts and grammar, and pattern blocks are used in fine arts.
In teaching and learning
Mathematical manipulatives play a key role in young children's mathematics understanding and development. Thes
|
https://en.wikipedia.org/wiki/Rotation%20of%20axes%20in%20two%20dimensions
|
In mathematics, a rotation of axes in two dimensions is a mapping from an xy-Cartesian coordinate system to an x′y′-Cartesian coordinate system in which the origin is kept fixed and the x′ and y′ axes are obtained by rotating the x and y axes counterclockwise through an angle . A point P has coordinates (x, y) with respect to the original system and coordinates (x′, y′) with respect to the new system. In the new coordinate system, the point P will appear to have been rotated in the opposite direction, that is, clockwise through the angle . A rotation of axes in more than two dimensions is defined similarly. A rotation of axes is a linear map and a rigid transformation.
Motivation
Coordinate systems are essential for studying the equations of curves using the methods of analytic geometry. To use the method of coordinate geometry, the axes are placed at a convenient position with respect to the curve under consideration. For example, to study the equations of ellipses and hyperbolas, the foci are usually located on one of the axes and are situated symmetrically with respect to the origin. If the curve (hyperbola, parabola, ellipse, etc.) is not situated conveniently with respect to the axes, the coordinate system should be changed to place the curve at a convenient and familiar location and orientation. The process of making this change is called a transformation of coordinates.
The solutions to many problems can be simplified by rotating the coordinate axes to obtain new axes through the same origin.
Derivation
The equations defining the transformation in two dimensions, which rotates the xy axes counterclockwise through an angle into the x′y′ axes, are derived as follows.
In the xy system, let the point P have polar coordinates . Then, in the x′y′ system, P will have polar coordinates .
Using trigonometric functions, we have
and using the standard trigonometric formulae for differences, we have
Substituting equations () and () into equations () a
|
https://en.wikipedia.org/wiki/Mercedes-Benz%20Bionic
|
The Mercedes-Benz Bionic is a concept car created by DaimlerChrysler AG under the Mercedes Group. It was first introduced in 2005 at the DaimlerChrysler Innovation Symposium in Washington, D. C. The Bionic is modeled after a type of fish, the yellow boxfish, Ostracion cubicus, and also has 80% lower nitrogen oxide emissions with its selective catalytic reduction technology.
Engine and performance
The Bionic is powered by a 103 kW direct-injection diesel engine with an average fuel economy of 54.7 MPG (US) (~4.3 L/100 km). This engine also outputs around and a little over of torque at around 1,600 rpm. The Bionic can go from in about eight seconds and has a top speed of a little over .
Design
The exterior design was modeled after the yellow boxfish (Ostracion cubicus), a marine fish that lives in coral reefs. Mercedes-Benz decided to model the Bionic after this fish due to the supposed low coefficient of drag of its body shape and the rigidity of its exoskeleton; this influenced the car's unusual looks. It was believed that the shape of the boxfish would improve aerodynamics and stability. However, in 2015, a paper in Journal of the Royal Society Interface claimed that "The drag-reduction performance of the two boxfish species studied was relatively low compared with more generalized body shapes of fish". Other parts of the design include the fact that the rear wheels are partially fitted with plastic and that it's considered as a lightweight vehicle. Mercedes-Benz reported a drag coefficient of 0.19; for comparison, the production vehicle with the lowest ever Cd value was the GM EV1, at 0.195. While the Bionic had a much larger internal volume than the EV1, the Bionic's larger frontal area made the EV1 more aerodynamic overall, as drag is a product of the area and the drag coefficient.
The vehicle was capable of seating four people.
|
https://en.wikipedia.org/wiki/Anecdotal%20cognitivism
|
Anecdotal cognitivism is a method of research using anecdotal, and anthropomorphic evidence through the observation of animal behaviour. A psychological methodology that attributes mental states to animals on the basis of anecdotes and on the observation of particular cases, other than those observations made during controlled experiments. The purpose is to understand by what means animals interpret external stimuli from the world around them, and subsequently how and why they act on that information. Charles Darwin devised this method in the late nineteenth century, naming it anecdotal cognitivism. This method proved controversial within the academy for the first half of the twentieth century, as Behaviourist methods were favoured at this time. Behaviourists maintain that controlled experiments are necessary to measure stimuli and record observable behaviour. From the middle of the twentieth century ethology and later, cognitive ethology became increasingly important within the scientific and academic milieu.
After the introduction of natural history documentary film production in the 1960s animal behaviour became popular in the general population. Presenters, such as David Attenborough on BBC England and George Page on PBS America, used anecdotes and anthropomorphic rhetoric thus providing access to a wider audience, increasing awareness and interest in animal behaviour and their relationship with humans and nature.
History
Contemporary scientific interest in animal minds, cognition and behaviour stem from Charles Darwin's nineteenth century seminal text, Theory of Evolution. Rather than showing the reader a series of tables, statistics and diagrams Darwin informed the reader with examples of animal behaviour he collected from both his observations, and the observations of others from all over the world. Anecdotal cognitivism was also practiced in his 1872 publication, The Expression of the Emotions in Man and Animals, with theories relating to the universality
|
https://en.wikipedia.org/wiki/Align-m
|
Align-m is a multiple sequence alignment program written by Ivo Van Walle.
Align-m has the ability to accomplish the following tasks:
multiple sequence alignment,
include extra information to guide the sequence alignment,
multiple structural alignment,
homology modeling by (iteratively) combining sequence and structure alignment data,
'filtering' of BLAST or other pairwise alignments,
combining many alignments into one consensus sequence,
multiple genome alignment (can cope with rearrangements).
See also
Sequence alignment software
Clustal
External links
Official website
Bioinformatics
Computational_phylogenetics
|
https://en.wikipedia.org/wiki/Pointwise%20mutual%20information
|
In statistics, probability theory and information theory, pointwise mutual information (PMI), or point mutual information, is a measure of association. It compares the probability of two events occurring together to what this probability would be if the events were independent.
PMI (especially in its positive pointwise mutual information variant) has been described as "one of the most important concepts in NLP", where it "draws on the intuition that the best way to weigh the association between two words is to ask how much more the two words co-occur in [a] corpus than we would have a priori expected them to appear by chance."
The concept was introduced in 1961 by Robert Fano under the name of "mutual information", but today that term is instead used for a related measure of dependence between random variables: The mutual information (MI) of two discrete random variables refers to the average PMI of all possible events.
Definition
The PMI of a pair of outcomes x and y belonging to discrete random variables X and Y quantifies the discrepancy between the probability of their coincidence given their joint distribution and their individual distributions, assuming independence. Mathematically:
(with the latter two expressions being equal to the first by Bayes' theorem). The mutual information (MI) of the random variables X and Y is the expected value of the PMI (over all possible outcomes).
The measure is symmetric (). It can take positive or negative values, but is zero if X and Y are independent. Note that even though PMI may be negative or positive, its expected outcome over all joint events (MI) is non-negative. PMI maximizes when X and Y are perfectly associated (i.e. or ), yielding the following bounds:
Finally, will increase if is fixed but decreases.
Here is an example to illustrate:
Using this table we can marginalize to get the following additional table for the individual distributions:
With this example, we can compute four values for .
|
https://en.wikipedia.org/wiki/Thought%20suppression
|
Thought suppression is a psychological defence mechanism. It is a type of motivated forgetting in which an individual consciously attempts to stop thinking about a particular thought. It is often associated with obsessive–compulsive disorder (OCD). OCD is when a person will repeatedly (usually unsuccessfully) attempt to prevent or "neutralize" intrusive distressing thoughts centered on one or more obsessions. It is also thought to be a cause of memory inhibition, as shown by research using the think/no think paradigm. Thought suppression is relevant to both mental and behavioral levels, possibly leading to ironic effects that are contrary to intention. Ironic process theory is one cognitive model that can explain the paradoxical effect.
When an individual tries to suppress thoughts under a high cognitive load, the frequency of those thoughts increases and becomes more accessible than before. Evidence shows that people can prevent their thoughts from being translated into behavior when self-monitoring is high; this does not apply to automatic behaviors though, and may result in latent, unconscious actions. This phenomenon is made paradoxically worse by increasing the amount of distractions a person has, although the experiments in this area can be criticized for using impersonal concurrent tasks, which may or may not properly reflect natural processes or individual differences.
Empirical work, 1980s
In order for thought suppression and its effectiveness to be studied, researchers have had to find methods of recording the processes going on in the mind. One experiment designed with this purpose was performed by Wegner, Schneider, Carter & White. They asked participants to avoid thinking of a specific target (e.g. a white bear) for five minutes, but if they did, they were told then to ring a bell. After this, participants were told that for the next five minutes they were to think about the target. There was evidence that unwanted thoughts occurred more frequently in
|
https://en.wikipedia.org/wiki/End-user%20development
|
End-user development (EUD) or end-user programming (EUP) refers to activities and tools that allow end-users – people who are not professional software developers – to program computers. People who are not professional developers can use EUD tools to create or modify software artifacts (descriptions of automated behavior) and complex data objects without significant knowledge of a programming language. In 2005 it was estimated (using statistics from the U.S. Bureau of Labor Statistics) that by 2012 there would be more than 55 million end-user developers in the United States, compared with fewer than 3 million professional programmers. Various EUD approaches exist, and it is an active research topic within the field of computer science and human-computer interaction. Examples include natural language programming, spreadsheets, scripting languages (particularly in an office suite or art application), visual programming, trigger-action programming and programming by example.
The most popular EUD tool is the spreadsheet. Due to their unrestricted nature, spreadsheets allow relatively un-sophisticated computer users to write programs that represent complex data models, while shielding them from the need to learn lower-level programming languages. Because of their common use in business, spreadsheet skills are among the most beneficial skills for a graduate employee to have, and are therefore the most commonly sought after In the United States of America alone, there are an estimated 13 million end-user developers programming with spreadsheets
The programming by example (PbE) approach reduces the need for the user to learn the abstractions of a classic programming language. The user instead introduces some examples of the desired results or operations that should be performed on the data, and the PbE system infers some abstractions corresponding to a program that produces this output, which the user can refine. New data may then be introduced to the automatically creat
|
https://en.wikipedia.org/wiki/Sulfotransferase
|
In biochemistry, sulfotransferases (SULTs) are transferase enzymes that catalyze the transfer of a sulfo group () from a donor molecule to an acceptor alcohol () or amine (). The most common sulfo group donor is 3'-phosphoadenosine-5'-phosphosulfate (PAPS). In the case of alcohol as acceptor, the product is a sulfate ():
whereas an amine leads to a sulfamate ():
Both reactive groups for a sulfonation via sulfotransferases may be part of a protein, lipid, carbohydrate or steroid.
Examples
The following are examples of sulfotransferases:
carbohydrate sulfotransferase: CHST1, CHST2, CHST3, CHST4, CHST5, CHST6, CHST7, CHST8, CHST9, CHST10, CHST11, CHST12, CHST13, CHST14
galactose-3-O-sulfotransferase: GAL3ST1, GAL3ST2, GAL3ST3, GAL3ST4
heparan sulfate 2-O-sulfotransferase: HS2ST1
heparan sulfate 3-O-sulfotransferase: HS3ST1, HS3ST2, HS3ST3A1, HS3ST3B1, HS3ST4, HS3ST5, HS3ST6
heparan sulfate 6-O-sulfotransferase: HS6ST1, HS6ST2, HS6ST3
N-deacetylase/N-sulfotransferase: NDST1, NDST2, NDST3, NDST4
tyrosylprotein sulfotransferase: TPST1, TPST2
uronyl-2-sulfotransferase
Estrone sulfotransferase
Chondroitin 4-sulfotransferase
other: SULT1A1, SULT1A2, SULT1A3, SULT1A4, SULT1B1, SULT1C2, SULT1C3, SULT1C4, SULT1D1P, SULT1E1, SULT2A1, SULT2B1, SULT4A1, SULT6B1
See also
List of EC numbers (EC 2)#EC 2.8.2: Sulfotransferases
Wikipedia:MeSH D08#MeSH D08.811.913.817 --- sulfur group transferases .28EC 2.8.29
|
https://en.wikipedia.org/wiki/Annonin
|
Annonins are a group of chemical compounds classified as acetogenins. They are found in the extracts of Annona seeds (A. squamosa and A. muricata). Annonin-based bioinsecticides are used to control Coleoptera (beetle) pests commonly found in stored organic cereal and beans in the country of Brazil. Other different types of annonin-based insecticides, derived from A. mucosa, fight off lepidopteran (moth) pests that infest cabbage leaves, also found in the tropical climates of Brazil. The benefit of using these bioinsecticides is their relatively low cost and no phytotoxicity. These annonin molecules act as overpowering inhibitors of complex I (NADH: ubiquinone oxidoreductase) in the electron-transport chain in the mitochondria of quarry pests. In cell membranes of these same pests, annonins also inhibit coenzyme NADH, causing these arthropods to die.
|
https://en.wikipedia.org/wiki/Gleason%27s%20theorem
|
In mathematical physics, Gleason's theorem shows that the rule one uses to calculate probabilities in quantum physics, the Born rule, can be derived from the usual mathematical representation of measurements in quantum physics together with the assumption of non-contextuality. Andrew M. Gleason first proved the theorem in 1957, answering a question posed by George W. Mackey, an accomplishment that was historically significant for the role it played in showing that wide classes of hidden-variable theories are inconsistent with quantum physics. Multiple variations have been proven in the years since. Gleason's theorem is of particular importance for the field of quantum logic and its attempt to find a minimal set of mathematical axioms for quantum theory.
Statement of the theorem
Conceptual background
In quantum mechanics, each physical system is associated with a Hilbert space. For the purposes of this overview, the Hilbert space is assumed to be finite-dimensional. In the approach codified by John von Neumann, a measurement upon a physical system is represented by a self-adjoint operator on that Hilbert space sometimes termed an "observable". The eigenvectors of such an operator form an orthonormal basis for the Hilbert space, and each possible outcome of that measurement corresponds to one of the vectors comprising the basis. A density operator is a positive-semidefinite operator on the Hilbert space whose trace is equal to 1. In the language of von Weizsäcker, a density operator is a "catalogue of probabilities": for each measurement that can be defined, the probability distribution over the outcomes of that measurement can be computed from the density operator. The procedure for doing so is the Born rule, which states that
where is the density operator, and is the projection operator onto the basis vector corresponding to the measurement outcome .
The Born rule associates a probability with each unit vector in the Hilbert space, in such a way that these pro
|
https://en.wikipedia.org/wiki/Regular%20semigroup
|
In mathematics, a regular semigroup is a semigroup S in which every element is regular, i.e., for each element a in S there exists an element x in S such that . Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations.
History
Regular semigroups were introduced by J. A. Green in his influential 1951 paper "On the structure of semigroups"; this was also the paper in which Green's relations were introduced. The concept of regularity in a semigroup was adapted from an analogous condition for rings, already considered by John von Neumann. It was Green's study of regular semigroups which led him to define his celebrated relations. According to a footnote in Green 1951, the suggestion that the notion of regularity be applied to semigroups was first made by David Rees.
The term inversive semigroup (French: demi-groupe inversif) was historically used as synonym in the papers of Gabriel Thierrin (a student of Paul Dubreil) in the 1950s, and it is still used occasionally.
The basics
There are two equivalent ways in which to define a regular semigroup S:
(1) for each a in S, there is an x in S, which is called a pseudoinverse, with axa = a;
(2) every element a has at least one inverse b, in the sense that aba = a and bab = b.
To see the equivalence of these definitions, first suppose that S is defined by (2). Then b serves as the required x in (1). Conversely, if S is defined by (1), then xax is an inverse for a, since a(xax)a = axa(xa) = axa = a and (xax)a(xax) = x(axa)(xax) = xa(xax) = x(axa)x = xax.
The set of inverses (in the above sense) of an element a in an arbitrary semigroup S is denoted by V(a). Thus, another way of expressing definition (2) above is to say that in a regular semigroup, V(a) is nonempty, for every a in S. The product of any element a with any b in V(a) is always idempotent: abab = ab, since aba = a.
Examples of regular semigroups
Every group is a r
|
https://en.wikipedia.org/wiki/Extracellular%20signal-regulated%20kinases
|
In molecular biology, extracellular signal-regulated kinases (ERKs) or classical MAP kinases are widely expressed protein kinase intracellular signalling molecules that are involved in functions including the regulation of meiosis, mitosis, and postmitotic functions in differentiated cells. Many different stimuli, including growth factors, cytokines, virus infection, ligands for heterotrimeric G protein-coupled receptors, transforming agents, and carcinogens, activate the ERK pathway.
The term, "extracellular signal-regulated kinases", is sometimes used as a synonym for mitogen-activated protein kinase (MAPK), but has more recently been adopted for a specific subset of the mammalian MAPK family.
In the MAPK/ERK pathway, Ras activates c-Raf, followed by mitogen-activated protein kinase kinase (abbreviated as MKK, MEK, or MAP2K) and then MAPK1/2 (below). Ras is typically activated by growth hormones through receptor tyrosine kinases and GRB2/SOS, but may also receive other signals. ERKs are known to activate many transcription factors, such as ELK1, and some downstream protein kinases.
Disruption of the ERK pathway is common in cancers, especially Ras, c-Raf, and receptors such as HER2.
Mitogen-activated protein kinase 1
Mitogen-activated protein kinase 1 (MAPK1) is also known as extracellular signal-regulated kinase 2 (ERK2). Two similar protein kinases with 85% sequence identity were originally called ERK1 and ERK2. They were found during a search for protein kinases that are rapidly phosphorylated after activation of cell surface tyrosine kinases such as the epidermal growth factor receptor. Phosphorylation of ERKs leads to the activation of their kinase activity.
The molecular events linking cell surface receptors to activation of ERKs are complex. It was found that Ras GTP-binding proteins are involved in the activation of ERKs. Another protein kinase, Raf-1, was shown to phosphorylate a "MAP kinase-kinase", thus qualifying as a "MAP kinase kinase kina
|
https://en.wikipedia.org/wiki/Acid%20guanidinium%20thiocyanate-phenol-chloroform%20extraction
|
Acid guanidinium thiocyanate-phenol-chloroform extraction (abbreviated AGPC) is a liquid–liquid extraction technique in biochemistry. It is widely used in molecular biology for isolating RNA (as well as DNA and protein in some cases). This method may take longer than a column-based system such as the silica-based purification, but has higher purity and the advantage of high recovery of RNA: an RNA column is typically unsuitable for purification of short (<200 nucleotides) RNA species, such as siRNA, miRNA, gRNA and tRNA.
It was originally devised by Piotr Chomczynski and Nicoletta Sacchi, who published their protocol in 1987. The reagent is sold by Sigma-Aldrich by the name TRI Reagent; by Invitrogen under the name TRIzol; by Bioline as Trisure; and by Tel-Test as STAT-60.
How it works
This method relies on phase separation by centrifugation of a mixture of the aqueous sample and a solution containing water-saturated phenol and chloroform, resulting in an upper aqueous phase and a lower organic phase (mainly phenol). Guanidinium thiocyanate, a chaotropic agent, is added to the organic phase to aid in the denaturation of proteins (such as those that strongly bind nucleic acids or those that degrade RNA). The nucleic acids (RNA and/or DNA) partition into the aqueous phase, while protein partitions into the organic phase. The pH of the mixture determines which nucleic acids get purified. Under acidic conditions (pH 4-6), DNA partitions into the organic phase while RNA remains in the aqueous phase. Under neutral conditions (pH 7-8), both DNA and RNA partition into the aqueous phase. In a last step, the nucleic acids are recovered from the aqueous phase by precipitation with 2-propanol. The 2-propanol is then washed with ethanol and the pellet briefly air-dried and dissolved in TE buffer or RNAse free water.
Guanidinium thiocyanate denatures proteins, including RNases, and separates rRNA from ribosomal proteins, while phenol, isopropanol and water are solvents with po
|
https://en.wikipedia.org/wiki/Flicker%20noise
|
Flicker noise is a type of electronic noise with a 1/f power spectral density. It is therefore often referred to as 1/f noise or pink noise, though these terms have wider definitions. It occurs in almost all electronic devices and can show up with a variety of other effects, such as impurities in a conductive channel, generation and recombination noise in a transistor due to base current, and so on.
Properties
1/f noise in current or voltage is usually related to a direct current, as resistance fluctuations are transformed to voltage or current fluctuations by Ohm's law. There is also a 1/f component in resistors with no direct current through them, likely due to temperature fluctuations modulating the resistance. This effect is not present in manganin, as it has negligible temperature coefficient of resistance.
In electronic devices, it shows up as a low-frequency phenomenon, as the higher frequencies are overshadowed by white noise from other sources. In oscillators, however, the low-frequency noise can be mixed up to frequencies close to the carrier, which results in oscillator phase noise.
Its contribution to total noise is characterized by the corner frequency fc between the low-frequency region dominated by flicker noise and the higher-frequency region dominated by the flat spectrum of white noise. MOSFETs have a high fc (can be in the GHz range). JFETs and BJTs have a lower fc around 1 kHz, but JFETs usually exhibit more flicker noise at low frequencies than BJTs, and can have fc as high as several kHz in JFETs not selected for flicker noise.
It typically has a Gaussian distribution and is time-reversible. It is generated by a linear mechanism in resistors and FETs, but by a non-linear mechanism in BJTs and diodes.
The spectral density of flicker-noise voltage in MOSFETs as a function of frequency f is often modeled as , where K is the process-dependent constant, is the oxide capacitance, W and L are channel width and length respectively. This is a
|
https://en.wikipedia.org/wiki/Food%20plot
|
A food plot is a planted area set aside to act as a supplementary food source for wildlife. The term was coined by the U.S. hunting and outdoor industries and food plots are most commonly planted for game species.
Food plot crops generally consist of but are not limited to legumes (clovers, alfalfa, beans, etc.), grains, or certain wildflowers. The plants may be annual or perennial and specific recommendations for local varieties that perform best in your area for specific wildlife species are often available. In agricultural areas, food plots may be planted in fields after the crop has been harvested, and left standing through the fall, winter, and early spring for the use of wildlife.
In some cases farmers and landowners may be reimbursed by the government for providing food plots that meet government specifications. Among other considerations, a food plot should be located close to a source of cover for the animals, and it should be only one part of a comprehensive habitat management program. Ideally a food plot should be small (2 to 4 acres), irregularly shaped, and located away from roads. A variety of cool-season grasses and forbs can be used to attract and enhance nutrition of multiple game species simultaneously when mixed according to recommendations.
Food plots differ from revegetation, which is intended to stabilize and rebuild the soil of disturbed land using naturally growing grasses, legumes, shrubs, and trees. Food plots are intended to feed wildlife rather than rebuild the soil, and generally use agricultural forages rather than native or naturally occurring plants. The oldest company to start developing products for food plots is the Whitetail Institute of North America in 1988.
Food plots can greatly increase the wildlife carrying capacity of a particular ecosystem, enhancing opportunities for hunting or wildlife viewing. Target animals include Whitetail deer, Bear, Moose, Rabbit, Woodchuck, Deer, Wild turkey, Grouse, and songbirds.
In
|
https://en.wikipedia.org/wiki/Direct%20Push
|
Direct Push is Microsoft's technology for receiving e-mail instantly on Windows Mobile 5.0, 6.0 and 6.1 enabled devices, from Microsoft Exchange Servers, Kerio Connect and Zarafa. This service was launched primarily for business users and was supported around 2006 by about 100 operators.
It provides response times similar to the push technology of RIM's BlackBerry service, but needs no special server upgrades other than having Exchange Server 2003 Service Pack 2. It works by initiating an HTTPS connection to the server through any connectivity that can carry an IP traffic such as GPRS or EDGE technologies, through the firewall, then a front-end server that connects to the Exchange server that hosts the user mailbox. It also eliminates the need for devices to have a dedicated IP address, but requires "Always on" GPRS or 3G connection. The Direct Push technology served as a feature for the Exchange Server ActiveSync service, which allowed Windows Mobile 5.0 and later versions of Windows Mobile software to keep their data up-to-date.
|
https://en.wikipedia.org/wiki/Games%20Computers%20Play
|
In the 1980s, Games Computers Play (GCP) was an online service written by Gardner Pomper and Greg Hogg and one of the first multiplayer online games (MOGs) to offer a graphical user interface (GUI). The service launched sometime in early 1985, beaten only by a few months by PlayNET on the Commodore 64, which ultimately became America Online.
The system was primarily accessible with Atari 8-bit computers, with a minimum of 48k of memory. A version for the Atari ST was also available late in the service's life. The service only garnered about 1,000 subscribers at its peak.
See also
GEnie, General Electric's online service (1985–1999)
|
https://en.wikipedia.org/wiki/Security%20domain
|
A security domain is the determining factor in the classification of an enclave of servers/computers. A network with a different security domain is kept separate from other networks. For example, NIPRNet, SIPRNet, JWICS, and NSANet are all kept separate.
A security domain is considered to be an application or collection of applications that all trust a common security token for authentication, authorization or session management. Generally speaking, a security token is issued to a user after the user has actively authenticated with a user ID and password to the security domain.
Examples of a security domain include:
All the web applications that trust a session cookie issued by a Web Access Management product
All the Windows applications and services that trust a Kerberos ticket issued by Active Directory
In an identity federation that spans two different organizations that share a business partner, customer or business process outsourcing relation – a partner domain would be another security domain with which users and applications (from the local security domain) interact.
Computer networking
|
https://en.wikipedia.org/wiki/Algal%20nutrient%20solution
|
Algal nutrient solutions are made up of a mixture of chemical salts and water. Sometimes referred to as "Growth Media", nutrient solutions (along with carbon dioxide and light), provide the materials needed for algae to grow. Nutrient solutions (e.g., Hoagland solution), as opposed to fertilizers, are designed specifically for use in aquatic environments and their composition is much more precise.
See also
List of algal culture collections
Algaculture
Algal fuel
Aquatic Species Program
Hydroponics
Seri microalgae culture collection
Chu 13, an algal growth medium
|
https://en.wikipedia.org/wiki/Service%20scan
|
On computer networks, a service scan identifies the available network services by attempting to initiate many sessions to different applications with each device in a target group of devices. This is done by sending session initiation packets for many different applications to open ports on all of the devices specified in the target group of devices. This scan is done across a wide range of TCP, UDP (and other transport layer protocols if desired such as SCTP). A service scanner will identify each device it finds along with the services that it finds on the ports that it scans.
Most user-based network services are intended to be found by users. As an example, a web service may be made available on TCP port 80 on a device. TCP/80 is the standard port for HTTP and users would be able to access the content of that web server, the website, by directing their web browsers to that device where the user would be able to view the home page of the website. However, a web service may be opened on a different port, where different content may be shared. This may be in an attempt to hide some content from ordinary users and only to provide it to users who know how to access the web service on the nonstandard port. A port scan will be able to identify that a port is open on the device, but may not be able to determine what service is being offered on that port. A service scan of that device will be able to determine that the port is open and that it is a web service.
Service scanners can be set to target a single device, but they are more often set to target a large number of devices. For example, a service scanner may be configured to scan a subnet. A service scanner may also be configured to scan standardized, well-known, and otherwise unused ports and will attempt to initiate sessions to many known services for each port. This is different from a port sweep that will only identify open ports, which are assumed to be associated with the default service for that port. The
|
https://en.wikipedia.org/wiki/National%20Pest%20Plant%20Accord
|
The National Pest Plant Accord (NPPA) is a New Zealand agreement that identifies pest plants that are prohibited from sale and commercial propagation and distribution.
The Accord initially came into effect on 1 October 2001 between regional councils and government departments with biosecurity responsibilities, but in 2006 was revised to include the Nursery and Garden Industry Association as a member of the decision-making body. Under the Accord, regional councils undertake surveillance to ensure the pest plants are not being sold, propagated or distributed.
The Department of Conservation also lists 328 vascular plant species as environmental weeds – species that infest, are controlled on, or are damaging to land under its control.
List of species
The National Pest Plant Accord is periodically updated, which was last done in 2012:
See also
Invasive species in New Zealand
|
https://en.wikipedia.org/wiki/Apicius%20%282nd%20century%20AD%29
|
According to the Deipnosophistae of Athenaeus, Apicius is the name of a cook who found a way of packing fresh oysters to send to the emperor Trajan while he was on campaign in Mesopotamia around 115 AD. The information comes by way of the Epitome or summary of the Deipnosophists, since the full text of this part of Athenaeus's work does not survive. If the information is correct, this is the third known Roman food specialist who was named Apicius, the earliest being the luxury-loving Apicius of the 1st century BC.
The late Roman cookbook Apicius gives a recipe for preserving oysters, among other foods. This is possibly the only detail in which the cookbook has a relationship with historical information about any of the people named Apicius.
Notes
Sources
Epitome of Athenaeus 1.7d
Apicius 1.12
Bibliography
, p. 17
Ancient Roman chefs
2nd-century deaths
Year of birth unknown
Food preservation
|
https://en.wikipedia.org/wiki/Project%20Diana
|
Project Diana, named for the Roman moon goddess Diana, was an experimental project of the US Army Signal Corps in 1946 to bounce radar signals off the Moon and receive the reflected signals. This was the first experiment in radar astronomy and the first active attempt to probe another celestial body. It was the inspiration for later Earth–Moon–Earth communication (EME) techniques.
History
Following the end of World War II, Col. John H. DeWitt Jr., Director of the Evans Signal Laboratory at Camp Evans (part of Fort Monmouth), in Wall Township, New Jersey, was directed by the Pentagon to determine whether the ionosphere could be penetrated by radar, in order to detect and track enemy ballistic missiles that might enter the ionosphere. He decided to address this charge by attempting to bounce radar waves off the Moon. For this task he assembled a team of engineers that included Chief Scientist E. King Stodola, Herbert Kauffman, Jacob Mofenson, and Harold Webb. Input from other Camp Evans units was sought on various issues, including most notably the mathematician Walter McAfee, who made the required mathematical calculations.
On the Laboratory site, a large transmitter, receiver and antenna array were constructed for this purpose. The transmitter, a highly modified SCR-271 radar set from World War II, provided 3 kilowatts (later upgraded to 50 kilowatts) at 111.5 MHz in -second pulses, applied to the antenna, a "bedspring" reflective array antenna composed of an 8x8 array of half wave dipoles and reflectors that provided 24 dB of gain. Return signals were received about 2.5 seconds later, the time required for the radio waves to make the round-trip journey from the Earth to the Moon and back. The receiver had to compensate for the Doppler shift in frequency of the reflected signal due to the Moon's orbital motion relative to the Earth's surface, which was different each day, so this motion had to be carefully calculated for each trial. The antenna could be rotated
|
https://en.wikipedia.org/wiki/Olduvai%20domain
|
The Olduvai domain, known until 2018 as DUF1220 (domain of unknown function 1220) and the NBPF repeat, is a protein domain that shows a striking human lineage-specific (HLS) increase in copy number and appears to be involved in human brain evolution. The protein domain has also been linked to several neurogenetic disorders such as schizophrenia (in reduced copies) and increased severity of autism (in increased copies). In 2018, it was named by its discoverers after Olduvai Gorge in Tanzania, one of the most important archaeological sites for early humans, to reflect data indicating its role in human brain size and evolution.
Olduvai domains form the core of NBPF genes, which first appeared in placental mammals and experienced a rapid expansion in monkeys (simians) through duplication to reach over 20 genes in humans. In humans, Olduvai domains are repeated often dozens of times within these genes. The only other gene an Olduvai domain has been found in is mammalian myomegalin, believed to be the origin of the NBPF genes via duplication. Myomegalin itself arose from a duplication of CDK5RAP2, and all of these genes have been implicated in the development of neurons.
Olduvai copy number is the highest in humans (~289, with person-to-person variations), reduced in African great apes (~125 copies in chimpanzees, ~99 in gorillas, ~92 in orangutans), further reduced in Old World monkeys (~35), single- or low-copy in non-primate mammals and absent in non-mammals. Consequently, the Olduvai domain demonstrates the largest HLS increase in copy number of any protein-coding region over any other living species, an additional ~160 copies compared with chimpanzees. The increase in the number of copies that are present in connection with Olduvai seems to have a direct correlation with several phenotypes of the brain including the increase in brain size as seen through evolution.
In the human genome, DUF1220 sequences are located primarily on chromosome 1 in region 1q21.1-q21.2,
|
https://en.wikipedia.org/wiki/Panton%E2%80%93Valentine%20leukocidin
|
Panton–Valentine leukocidin (PVL) is a cytotoxin—one of the β-pore-forming toxins. The presence of PVL is associated with increased virulence of certain strains (isolates) of Staphylococcus aureus. It is present in the majority
of community-associated methicillin-resistant Staphylococcus aureus (CA-MRSA) isolates studied
and is the cause of necrotic lesions involving the skin or mucosa, including necrotic hemorrhagic pneumonia.
PVL creates pores in the membranes of infected cells. PVL is produced from the genetic material of a bacteriophage that infects Staphylococcus aureus, making it
more virulent.
History
It was initially discovered by Van deVelde in 1894 due to its ability to lyse leukocytes. It was named after Sir Philip Noel Panton and Francis Valentine when they associated it with soft tissue infections in 1932.
Mechanism of action
Exotoxins such as PVL constitute essential components of the virulence mechanisms of S. aureus.
Nearly all strains secrete lethal factors that convert host tissues into nutrients required for bacterial growth.
PVL is a member of the synergohymenotropic toxin family that induces pores in the membranes of cells.
The PVL factor is encoded in a prophage—designated as Φ-PVL—which is a virus integrated into the S. aureus bacterial chromosome.
Its genes secrete two proteins—toxins designated LukS-PV and LukF-PV, 33 and 34 kDa in size. The structures of both proteins have been solved in the soluble forms, and are present in the PDB as ID codes and respectively.
LukS-PV and LukF-PV act together as subunits, assembling in the membrane of host defense cells, in particular, white blood cells, monocytes, and macrophages.
The subunits fit together and form a ring with a central pore through which cell contents leak and which acts as a superantigen. Other authors contribute the differential response of MRSA subtypes to phenol-soluble modulin (PSM) peptides and not to PVL.
Clinical effects
PVL causes leukocyte destruction and necro
|
https://en.wikipedia.org/wiki/Telephone%20call%20recording%20laws
|
Telephone call recording laws are legislation enacted in many jurisdictions, such as countries, states, provinces, that regulate the practice of telephone call recording. Call recording or monitoring is permitted or restricted with various levels of privacy protection, law enforcement requirements, anti-fraud measures, or individual party consent.
Australia
The federal Telecommunications (Interception and Access) Act 1979 and State and Territory listening devices laws may both apply to monitoring or recording of telephone conversations. The general rule is that the call may not be recorded. Section 7 of the Telecommunications (Interception and Access) Act 1979 prohibits intercepting a telephone call. "Interception" is defined in section 6, of which one element is that it is made "without the knowledge of the person making the communication". There are exceptions to these rules in very limited circumstances, including where a warrant applies.
If a call is to be recorded or monitored, an organization must tell the other party at the beginning of the conversation so that it has the chance either to end the call, or to ask to be transferred to another line where monitoring or recording does not take place.
Reasons organizations may monitor or record conversations may include:
to protect a person's intent in dealings with the organization
to provide a record in the event of a dispute about a transaction
to improve customer service.
In the state of Queensland it is not illegal to record a telephone conversation by a party to the conversation.
Canada
Organizations
In Canada, organizations subject to the Personal Information Protection and Electronic Documents Act (PIPEDA) must comply with PIPEDA when recording calls.
In order to comply with the PIPEDA, organizations should take the following steps when recording conversations:
The individual must be informed that the conversation is being recorded at the beginning of the call. This can be done by an automated reco
|
https://en.wikipedia.org/wiki/Miltefosine
|
Miltefosine, sold under the trade name Impavido among others, is a medication mainly used to treat leishmaniasis and free-living amoeba infections such as Naegleria fowleri and Balamuthia mandrillaris. This includes the three forms of leishmaniasis: cutaneous, visceral and mucosal. It may be used with liposomal amphotericin B or paromomycin. It is taken by mouth.
Common side effects include vomiting, abdominal pain, fever, headaches, and decreased kidney function. More severe side effects may include Stevens–Johnson syndrome or low blood platelets. Use during pregnancy appears to cause harm to the baby and use during breastfeeding is not recommended. How it works is not entirely clear.
Miltefosine was first made in the early 1980s and studied as a treatment for cancer. A few years later it was found to be useful for leishmaniasis and was approved for this use in 2002 in India. It is on the World Health Organization's List of Essential Medicines.
Medical uses
Leishmaniasis
Miltefosine is primarily used for the treatment of visceral and New World cutaneous leishmaniasis, and is undergoing clinical trials for this use in several countries. This drug is now listed as a core medication for the treatment of leishmaniasis under the WHO Model List of Essential Medicines. Several medical agents have some efficacy against visceral or cutaneous leishmaniasis, however, a 2005 survey concluded that miltefosine is the only effective oral treatment for both forms of leishmaniasis.
Amoeba infections
Miltefosine has been used successfully in some cases of the very rare, but highly lethal, brain infection by the amoeba, Naegleria fowleri, acquired through water entering the nose during a plunge in contaminated water. It has orphan drug status in the United States for acanthamoeba keratitis and primary amebic meningoencephalitis (PAM).
Pregnancy and breastfeeding
Miltefosine is listed as pregnancy category D by the FDA. This means there is evidence-based adverse reaction data f
|
https://en.wikipedia.org/wiki/Swedish%20bitters
|
Swedish bitters, also called Swedish tincture, is a bitter and a traditional herbal tonic, the use of which dates back to the 15th century.
Origins
Swedish bitters is said to have been formulated in a similar way to ancient bitters by Paracelsus and rediscovered by 18th century Swedish medics Dr. Klaus Samst and Dr. Urban Hjärne, though this appears to be mistaking the latter for his son, Kristian Henrik Hjärne, who himself invented a bitter.
In modern times, Swedish bitters have been popularized by Maria Treben, an Austrian herbalist. The tonic is claimed to cure a large number of ailments, and to aid digestion. These claims are presented with little in the way of scientific evidence to support them, though empirical evidence provides for a very large database of positive results.
Components
The alcoholic Swedish bitters is purported to have a similar flavor to Angostura bitters, though perhaps drier. Nowadays, it is more common to prepare Swedish bitters from a dry herbs mixture
Ingredients
The following herbs are added to alcohol to make Swedish bitters:
aloe as active ingredient
water extract of the following herbs:
angelica root (Angelica archangelica)
camphor (Cinnamomum camphora)
carline thistle root (Carlina acaulis)
manna (Fraxinus ornus)
myrrh
rhubarb root (Rheum palmatum)
saffron
senna (Senna alexandrina)
theriac venetian (theriac) (a mixture of many herbs and other substances)
zedoary root (Curcuma zedoaria)
There are variations on this recipe and herbal shops supply alcoholic and non-alcoholic versions of the drink.
Maria Treben's book contains nine pages on this bitter, with a description of many ailments and their cures.
|
https://en.wikipedia.org/wiki/Kanpy%C5%8D%20%28food%29
|
, sometimes romanized and pronounced , are dried shavings of Lagenaria siceraria var. hispida, a variety of calabash gourd. The gourd is known as (夕顔) or (フクベ) in Japanese. Kanpyō is an ingredient in traditional Edo style Japanese cuisine. Cooked and flavored kanpyō is commonly used in futomaki sushi roll.
Kanpyō was originally grown in the Osaka region. Now it is a specialty product of Tochigi Prefecture, where it is a cottage industry. The region is so tied to the food product that it hosts the "Kanpyō Highway with History and Romance". The yuru-chara for Oyama, Tochigi is (), an anthropomorphized calabash.
The gourd is harvested between late July and September. The white flesh of the gourd is cut into strips 3 cm wide and 3 mm thick, then either dried in the sun or dehydrated. Over 200 tons a year of dried kanpyō are produced per year. Kanpyō available in the United States is sometimes chemically bleach-dried to a very white color, as opposed to the creamy color of the naturally-dried kind. Sulfur dioxide is sometimes used as a fumigant but must not be used in concentrations exceeding 5.0 g per 1 kg of dry matter.
Dishes featuring kanpyō
In addition to being the focus of many dishes, kanpyō strips are frequently used as an edible twist tie in dishes such as fukusa-zushi and chakin-zushi. Typically the dried strips are boiled to soften, and then boiled a second time with soy sauce, sugar, and other ingredients added for flavor.
Futomaki
Kanpyō-maki, also called teppo maki ("gun barrel maki") as it looks like the end of a rifle
Matsukasa sushi ("pinecone sushi"), a roll using squid filet (instead of nori) wrapped around sushi rice, kanpyō, shiitake, snow peas, and whitefish
Shojin dashijiru, a vegan soup stock
See also
Oden
|
https://en.wikipedia.org/wiki/Predispositioning%20theory
|
Predispositioning theory, in the field of decision theory and systems theory, is a theory focusing on the stages between a complete order and a complete disorder.
Predispositioning theory was founded by Aron Katsenelinboigen (1927–2005), a professor in the Wharton School who dealt with indeterministic systems such as chess, business, economics, and other fields of knowledge and also made an essential step forward in elaboration of styles and methods of decision-making.
Predispositioning theory
Predispositioning theory is focused on the intermediate stage between a complete order and a complete disorder. According to Katsenelinboigen, the system develops gradually, going through several stages, starting with incomplete and inconsistent linkages between its elements and ending with complete and consistent ones.
"Mess. The zero phase can be called a mess because it contains no linkages between the system's elements. Such a definition of mess as ‘a disorderly, un-tidy, or dirty state of things’ we find in Webster's New World Dictionary. (...)
Chaos. Mess should not be confused with the next phase, chaos, as this term is understood today. Arguably, chaos is the first phase of indeterminism that displays sufficient order to talk of the general problem of system development.
The chaos phase is characterized by some ordering of accumulated statistical data and the emergence of the basic rules of interactions of inputs and outputs (not counting boundary conditions). Even such a seemingly limited ordering makes it possible to fix systemic regularities of the sort shown by Feigenbaum numbers and strange attractors.
(...) Different types of orderings in the chaos phase may be brought together under the notion of directing, for they point to a possible general direction of system development and even its extreme states.
But even if a general path is known, enormous difficulties remain in linking algorithmically the present state with the final one and in operationalizing t
|
https://en.wikipedia.org/wiki/F%C3%A1ry%27s%20theorem
|
In the mathematical field of graph theory, Fáry's theorem states that any simple, planar graph can be drawn without crossings so that its edges are straight line segments. That is, the ability to draw graph edges as curves instead of as straight line segments does not allow a larger class of graphs to be drawn. The theorem is named after István Fáry, although it was proved independently by , , and .
Proof
One way of proving Fáry's theorem is to use mathematical induction. Let be a simple plane graph with vertices; we may add edges if necessary so that is a maximally plane graph. If < 3, the result is trivial. If ≥ 3, then all faces of must be triangles, as we could add an edge into any face with more sides while preserving planarity, contradicting the assumption of maximal planarity. Choose some three vertices forming a triangular face of . We prove by induction on that there exists a straight-line combinatorially isomorphic re-embedding of in which triangle is the outer face of the embedding. (Combinatorially isomorphic means that the vertices, edges, and faces in the new drawing can be made to correspond to those in the old drawing, such that all incidences between edges, vertices, and faces—not just between vertices and edges—are preserved.) As a base case, the result is trivial when and , and are the only vertices in . Thus, we may assume that ≥ 4.
By Euler's formula for planar graphs, has edges; equivalently, if one defines the deficiency of a vertex in to be , the sum of the deficiencies is . Since has at least four vertices and all faces of are triangles, it follows that every vertex in has degree at least three. Therefore each vertex in has deficiency at most three, so there are at least four vertices with positive deficiency. In particular we can choose a vertex with at most five neighbors that is different from , and . Let be formed by removing from and retriangulating the face formed by removing . By induction, has a
|
https://en.wikipedia.org/wiki/Minimum-cost%20flow%20problem
|
The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated. The minimum cost flow problem is one of the most fundamental among all flow and circulation problems because most other such problems can be cast as a minimum cost flow problem and also that it can be solved efficiently using the network simplex algorithm.
Definition
A flow network is a directed graph with a source vertex and a sink vertex , where each edge has capacity , flow and cost , with most minimum-cost flow algorithms supporting edges with negative costs. The cost of sending this flow along an edge is . The problem requires an amount of flow to be sent from source to sink .
The definition of the problem is to minimize the total cost of the flow over all edges:
with the constraints
{|
|-
| Capacity constraints: ||
|-
| Skew symmetry: ||
|-
| Flow conservation: ||
|-
| Required flow: ||
|}
Relation to other problems
A variation of this problem is to find a flow which is maximum, but has the lowest cost among the maximum flow solutions. This could be called a minimum-cost maximum-flow problem and is useful for finding minimum cost maximum matchings.
With some solutions, finding the minimum cost maximum flow instead is straightforward. If not, one can find the maximum flow by performing a binary search on .
A related problem is the minimum cost circulation problem, which can be used for solving minimum cost flow. This is achieved by setting the lower bound on all edges to zero, and then making an extra edge from the sink to the source , with capacity and lower bound , forcing the total flow from to to also be .
The following problems are special cases of the minimum cost flow problem (we provide brief
|
https://en.wikipedia.org/wiki/Circulation%20problem
|
The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special nodes). In variants of the problem, there are multiple commodities flowing through the network, and a cost on the flow.
Definition
Given flow network with:
, lower bound on flow from node to node ,
, upper bound on flow from node to node ,
, cost of a unit of flow on
and the constraints:
,
(flow cannot appear or disappear in nodes).
Finding a flow assignment satisfying the constraints gives a solution to the given circulation problem.
In the minimum cost variant of the problem, minimize
Multi-commodity circulation
In a multi-commodity circulation problem, you also need to keep track of the flow of the individual commodities:
{|
| || The flow of commodity from to .
|-
| || The total flow.
|}
There is also a lower bound on each flow of commodity.
{|
|
|}
The conservation constraint must be upheld individually for the commodities:
Solution
For the circulation problem, many polynomial algorithms have been developed (e.g., Edmonds–Karp algorithm, 1972; Tarjan 1987-1988). Tardos found the first strongly polynomial algorithm.
For the case of multiple commodities, the problem is NP-complete for integer flows. For fractional flows, it is solvable in polynomial time, as one can formulate the problem as a linear program.
Related problems
Below are given some problems, and how to solve them with the general circulation setup given above.
Minimum cost multi-commodity circulation problem - Using all constraints given above.
Minimum cost circulation problem - Use a single commodity
Multi-commodity circulation - Solve without optimising cost.
Simple circulation - Just use one commodity, and no cost.
Multi-commodity flow - If denotes a demand of for commodity from to , create an edge with for all com
|
https://en.wikipedia.org/wiki/Ntop
|
ntop is computer software that probes a computer network to show network use in a way similar to what the program top does for processes.
Software
In interactive mode, it displays the network status on the user's terminal. In Web mode, it acts as a web server, creating a HTML dump of the network status. It supports a NetFlow-sFlow emitter-collector, a Hypertext Transfer Protocol (HTTP) based client interface for creating ntop-centric monitoring applications, and RRDtool (RRD) for persistently storing traffic statistics.
ntop is available for both Unix and Win32-based platforms. It has been developed by Luca Deri, an Italian research scientist and network manager at University of Pisa.
Common usage on a Linux system is to start the ntop daemon (), then one can use the web interface to ntop via visiting provided the loopback device has been started () and the listening port for ntop is 3000 (look out for the option in ).
See also
Netsniff-ng
iftop
ntopng
|
https://en.wikipedia.org/wiki/Club%203D
|
Club 3D, founded in 1997 as Colour Power (Club 3D since 2005), is a Dutch brand of video cards and digital multimedia products such as TV tuner cards and digital sound cards for PCs, featuring AMD graphics chipsets and technologies.
History
Pioneers in the introduction of the first graphics cards from S3 Graphics, 3dfx, ATI Technologies and NVIDIA.
Previously the only privately owned company in the world that officially sold AMD/ATI and NVIDIA under one brand.
2001 – Pioneers at being the first AIB (Add-in-Board) for ATI/AMD. Launched ATI AIB solutions at Computex, 2001.
2001 – Branch office in Germany for the DACH market
2003 – Official partnership with S3 Graphics
2003 – Official partnership with XGI Technologies
2004 – Generated an excess of 900,000 retail unit sales of ATI Technologies video card graphics adapters
2006 – Official partnership with NVIDIA Corporation
2006 – Launched Theatron products, range of sound cards
2007 – Launched VAX Barcelona bag accessories range
2010 – Official launch of the accessories division
2011 – Official launch of high end 80 plus switching power supplies division
2011 – Official launch of SenseVision division, USB powered video graphics adapters
2013 - Drops NVIDIA support and commits to AMD only.
2016 - First to market worldwide with the Displayport 1.2 to HDMI 2.0 Active Adapters
|
https://en.wikipedia.org/wiki/Chemokinesis
|
Chemokinesis is chemically prompted kinesis, a motile response of unicellular prokaryotic or eukaryotic organisms to chemicals that cause the cell to make some kind of change in their migratory/swimming behaviour. Changes involve an increase or decrease of speed, alterations of amplitude or frequency of motile character, or direction of migration. However, in contrast to chemotaxis, chemokinesis has a random, non-vectorial moiety, in general.
Due to the random character, techniques dedicated to evaluate chemokinesis are partly different from methods used in chemotaxis research. One of the most valuable ways to measure chemokinesis is computer-assisted (see, e.g., Image J) checker-board analysis, which provides data about migration of identical cells, whereas, in Protozoa (e.g., Tetrahymena), techniques based on measurement of opalescence were also developed.
|
https://en.wikipedia.org/wiki/Multi-commodity%20flow%20problem
|
The multi-commodity flow problem is a network flow problem with multiple commodities (flow demands) between different source and sink nodes.
Definition
Given a flow network , where edge has capacity . There are commodities , defined by , where and is the source and sink of commodity , and is its demand. The variable defines the fraction of flow along edge , where in case the flow can be split among multiple paths, and otherwise (i.e. "single path routing"). Find an assignment of all flow variables which satisfies the following four constraints:
(1) Link capacity: The sum of all flows routed over a link does not exceed its capacity.
(2) Flow conservation on transit nodes: The amount of a flow entering an intermediate node is the same that exits the node.
(3) Flow conservation at the source: A flow must exit its source node completely.
(4) Flow conservation at the destination: A flow must enter its sink node completely.
Corresponding optimization problems
Load balancing is the attempt to route flows such that the utilization of all links is even, where
The problem can be solved e.g. by minimizing . A common linearization of this problem is the minimization of the maximum utilization , where
In the minimum cost multi-commodity flow problem, there is a cost for sending a flow on . You then need to minimize
In the maximum multi-commodity flow problem, the demand of each commodity is not fixed, and the total throughput is maximized by maximizing the sum of all demands
Relation to other problems
The minimum cost variant of the multi-commodity flow problem is a generalization of the minimum cost flow problem (in which there is merely one source and one sink ). Variants of the circulation problem are generalizations of all flow problems. That is, any flow problem can be viewed as a particular circulation problem.
Usage
Routing and wavelength assignment (RWA) in optical burst switching of Optical Network would be approached via multi-commodity fl
|
https://en.wikipedia.org/wiki/Classical%20Wiener%20space
|
In mathematics, classical Wiener space is the collection of all continuous functions on a given domain (usually a subinterval of the real line), taking values in a metric space (usually n-dimensional Euclidean space). Classical Wiener space is useful in the study of stochastic processes whose sample paths are continuous functions. It is named after the American mathematician Norbert Wiener.
Definition
Consider E ⊆ Rn and a metric space (M, d). The classical Wiener space C(E; M) is the space of all continuous functions f : E → M. I.e. for every fixed t in E,
as
In almost all applications, one takes E = [0, T ] or [0, +∞) and M = Rn for some n in N. For brevity, write C for C([0, T ]; Rn); this is a vector space. Write C0 for the linear subspace consisting only of those functions that take the value zero at the infimum of the set E. Many authors refer to C0 as "classical Wiener space".
For a stochastic process and the space of all functions from to , one looks at the map . One can then define the coordinate maps or canonical versions defined by . The form another process. The Wiener measure is then the unique measure on such that the coordinate process is a Brownian motion.
Properties of classical Wiener space
Uniform topology
The vector space C can be equipped with the uniform norm
turning it into a normed vector space (in fact a Banach space). This norm induces a metric on C in the usual way: . The topology generated by the open sets in this metric is the topology of uniform convergence on [0, T ], or the uniform topology.
Thinking of the domain [0, T ] as "time" and the range Rn as "space", an intuitive view of the uniform topology is that two functions are "close" if we can "wiggle space slightly" and get the graph of f to lie on top of the graph of g, while leaving time fixed. Contrast this with the Skorokhod topology, which allows us to "wiggle" both space and time.
Separability and completeness
With respect to the uniform metric, C is both a
|
https://en.wikipedia.org/wiki/NextGenTel
|
NextGenTel is a Norwegian telecommunications company located in Bergen (HQ), Trondheim, Oslo, Stavanger, and Kristiansand. They offer ADSL, SHDSL, ADSL2+, VDSL2, IPTV, IP Telephony, mobilephone subscriptions, and WiMax solutions. They are, with 140,000 customers, Norway's third-largest Internet service provider (the largest being Telenor and Altibox).
The company was established on March 1, 2000, and delivers Internet and TV solutions (triple play) over fiber and wireless broadband to private households and housing associations.
NextGenTel was wholly owned by the Swedish-Finnish telecommunications company TeliaSonera until December 2012, when the company was acquired by Telio. Since 2019, NextGenTel has been a fully owned subsidiary of Telecom 3 Holding AS.
|
https://en.wikipedia.org/wiki/Aorticopulmonary%20septum
|
The aorticopulmonary septum is developmentally formed from neural crest, specifically the cardiac neural crest, and actively separates the aorta and pulmonary arteries and fuses with the interventricular septum within the heart during heart development.
Structure
In the developing heart, the truncus arteriosus and bulbus cordis are divided by the aortic septum. This makes its appearance in three portions.
Two distal ridge-like thickenings project into the lumen of the tube; these increase in size, and ultimately meet and fuse to form a septum, which takes a spiral course toward the proximal end of the truncus arteriosus. It divides the distal part of the truncus into two vessels, the aorta and pulmonary artery, which lie side by side above, but near the heart the pulmonary artery is in front of the aorta.
Four endocardial cushions appear in the proximal part of the truncus arteriosus in the region of the future semilunar valves; the manner in which these are related to the aortic septum is described below.
Two endocardial thickenings—anterior and posterior—develop in the bulbus cordis and unite to form a short septum; this joins above with the aortic septum and below with the ventricular septum. The septum grows down into the ventricle as an oblique partition, which ultimately blends with the ventricular septum in such a way as to bring the bulbus cordis into communication with the pulmonary artery, and through the latter with the sixth pair of aortic arches; while the left ventricle is brought into continuity with the aorta, which communicates with the remaining aortic arches.
Clinical significance
The actual mechanism of septation of the outflow tract is poorly understood, but is recognized as a dynamic process with contributions from contractile, hemodynamic, and extracellular matrix interactions. Misalignment of the septum can cause the congenital heart conditions tetralogy of Fallot, persistent truncus arteriosus, dextro-Transposition of the great arteries
|
https://en.wikipedia.org/wiki/Truncus%20arteriosus
|
The truncus arteriosus is a structure that is present during embryonic development. It is an arterial trunk that originates from both ventricles of the heart that later divides into the aorta and the pulmonary trunk.
Structure
The truncus arteriosus and bulbus cordis are divided by the aorticopulmonary septum. The truncus arteriosus gives rise to the ascending aorta and the pulmonary trunk. The caudal end of the bulbus cordis gives rise to the smooth parts (outflow tract) of the left and right ventricles (aortic vestibule & conus arteriosus respectively). The cranial end of the bulbus cordis (also known as the conus cordis) gives rise to the aorta and pulmonary trunk with the truncus arteriosus.
This makes its appearance in three portions.
Two distal ridge-like thickenings project into the lumen of the tube: the truncal and bulbar ridges. These increase in size, and ultimately meet and fuse to form a septum (aorticopulmonary septum), which takes a spiral course toward the proximal end of the truncus arteriosus. It divides the distal part of the truncus into two vessels, the aorta and pulmonary artery, which lie side by side above, but near the heart the pulmonary artery is in front of the aorta.
Four endocardial cushions appear in the proximal part of the truncus arteriosus in the region of the future semilunar valves; the manner in which these are related to the aortic septum is described below.
Two endocardial thickenings—anterior and posterior—develop in the bulbus cordis and unite to form a short septum; this joins above with the aortic septum and below with the ventricular septum. The septum grows down into the ventricle as an oblique partition, which ultimately blends with the ventricular septum in such a way as to bring the bulbus cordis into communication with the pulmonary artery, and through the latter with the sixth pair of aortic arches; while the left ventricle is brought into continuity with the aorta, which communicates with the remaining aor
|
https://en.wikipedia.org/wiki/Equivalence%20of%20metrics
|
In mathematics, two metrics on the same underlying set are said to be equivalent if the resulting metric spaces share certain properties. Equivalence is a weaker notion than isometry; equivalent metrics do not have to be literally the same. Instead, it is one of several ways of generalizing equivalence of norms to general metric spaces.
Throughout the article, will denote a non-empty set and and will denote two metrics on .
Topological equivalence
The two metrics and are said to be topologically equivalent if they generate the same topology on . The adverb topologically is often dropped. There are multiple ways of expressing this condition:
a subset is -open if and only if it is -open;
the open balls "nest": for any point and any radius , there exist radii such that
the identity function is continuous with continuous inverse; that is, it is a homeomorphism.
The following are sufficient but not necessary conditions for topological equivalence:
there exists a strictly increasing, continuous, and subadditive such that .
for each , there exist positive constants and such that, for every point ,
Strong equivalence
Two metrics and on are strongly or bilipschitz equivalent or uniformly equivalent if and only if there exist positive constants and such that, for every ,
In contrast to the sufficient condition for topological equivalence listed above, strong equivalence requires that there is a single set of constants that holds for every pair of points in , rather than potentially different constants associated with each point of .
Strong equivalence of two metrics implies topological equivalence, but not vice versa. For example, the metrics and on the interval are topologically equivalent, but not strongly equivalent. In fact, this interval is bounded under one of these metrics but not the other. On the other hand, strong equivalences always take bounded sets to bounded sets.
Relation with equivalence of norms
When is a vector space
|
https://en.wikipedia.org/wiki/Poncelet%20point
|
In geometry, the Poncelet point of four given points is defined as follows:
Let be four points in the plane that do not form an orthocentric system and such that no three of them are collinear. The nine-point circles of triangles meet at one point, the Poncelet point of the points . (If do form an orthocentric system, then triangles all share the same nine-point circle, and the Poncelet point is undefined.)
Properties
If do not lie on a circle, the Poncelet point of lies on the circumcircle of the pedal triangle of with respect to triangle and lies on the other analogous circles. (If they do lie on a circle, then those pedal triangles will be lines; namely, the Simson line of with respect to triangle , and the other analogous Simson lines. In that case, those lines still concur at the Poncelet point, which will also be the anticenter of the cyclic quadrilateral whose vertices are .)
The Poncelet point of lies on the circle through the intersection of lines and , the intersection of lines and , and the intersection of lines and (assuming all these intersections exist).
The Poncelet point of is the center of the unique rectangular hyperbola through .
|
https://en.wikipedia.org/wiki/Convergence%20of%20measures
|
In mathematics, more specifically measure theory, there are various notions of the convergence of measures. For an intuitive general sense of what is meant by convergence of measures, consider a sequence of measures μn on a space, sharing a common collection of measurable sets. Such a sequence might represent an attempt to construct 'better and better' approximations to a desired measure μ that is difficult to obtain directly. The meaning of 'better and better' is subject to all the usual caveats for taking limits; for any error tolerance ε > 0 we require there be N sufficiently large for n ≥ N to ensure the 'difference' between μn and μ is smaller than ε. Various notions of convergence specify precisely what the word 'difference' should mean in that description; these notions are not equivalent to one another, and vary in strength.
Three of the most common notions of convergence are described below.
Informal descriptions
This section attempts to provide a rough intuitive description of three notions of convergence, using terminology developed in calculus courses; this section is necessarily imprecise as well as inexact, and the reader should refer to the formal clarifications in subsequent sections. In particular, the descriptions here do not address the possibility that the measure of some sets could be infinite, or that the underlying space could exhibit pathological behavior, and additional technical assumptions are needed for some of the statements. The statements in this section are however all correct if is a sequence of probability measures on a Polish space.
The various notions of convergence formalize the assertion that the 'average value' of each 'sufficiently nice' function should converge:
To formalize this requires a careful specification of the set of functions under consideration and how uniform the convergence should be.
The notion of weak convergence requires this convergence to take place for every continuous bounded function .
This notion
|
https://en.wikipedia.org/wiki/Product%20metric
|
In mathematics, a product metric is a metric on the Cartesian product of finitely many metric spaces which metrizes the product topology. The most prominent product metrics are the p product metrics for a fixed :
It is defined as the p norm of the n-vector of the distances measured in n subspaces:
For this metric is also called the sup metric:
Choice of norm
For Euclidean spaces, using the L2 norm gives rise to the Euclidean metric in the product space; however, any other choice of p will lead to a topologically equivalent metric space. In the category of metric spaces (with Lipschitz maps having Lipschitz constant 1), the product (in the category theory sense) uses the sup metric.
The case of Riemannian manifolds
For Riemannian manifolds and , the product metric on is defined by
for under the natural identification .
|
https://en.wikipedia.org/wiki/Chemotactic%20selection
|
Chemotaxis receptors are expressed in the surface membrane with diverse dynamics, some of them have long-term characteristics as they are determined genetically, others have short-term moiety as their assembly is induced ad hoc in the presence of the ligand. The diverse feature of the chemotaxis receptors and ligands provides the possibility to select chemotactic responder cells with a simple chemotaxis assay. By chemotactic selection we can determine whether a still not characterized molecule acts via the long- or the short-term receptor pathway. Recent results proved that chemokines (e.g. IL-8, RANTES) are working on long-term chemotaxis receptors, while vasoactive peptides (e.g. endothelin) act more on the short-term ones. Term chemotactic selection is also used to design a technique which separates eukaryotic or prokaryotic cells upon their chemotactic responsiveness to selector ligands.
|
https://en.wikipedia.org/wiki/Apparent%20horizon
|
In general relativity, an apparent horizon is a surface that is the boundary between light rays that are directed outwards and moving outwards and those directed outward but moving inward.
Apparent horizons are not invariant properties of spacetime, and in particular, they are distinct from event horizons. Within an apparent horizon, light does not move outward; this is in contrast with the event horizon. In a dynamical spacetime, there can be outgoing light rays exterior to an apparent horizon (but still interior to the event horizon). An apparent horizon is a local notion of the boundary of a black hole, whereas an event horizon is a global notion.
The notion of a horizon in general relativity is subtle and depends on fine distinctions.
Definition
The notion of an "apparent horizon" begins with the notion of a trapped null surface. A (compact, orientable, spacelike) surface always has two independent forward-in-time pointing, lightlike, normal directions. For example, a (spacelike) sphere in Minkowski space has lightlike vectors pointing inward and outward along the radial direction. In Euclidean space (i.e. flat and unaffected by gravitational effects), the inward-pointing, lightlike normal vectors converge, while the outward-pointing, lightlike normal vectors diverge. It can, however, happen that both inward-pointing and outward-pointing lightlike normal vectors converge. In such a case, the surface is called trapped. The apparent horizon is the outermost of all trapped surfaces, also called the "marginally outer trapped surface" (MOTS).
Differences from the (absolute) event horizon
In the context of black holes, the term event horizon refers almost exclusively to the notion of the "absolute horizon". Much confusion seems to arise concerning the differences between an apparent horizon (AH) and an event horizon (EH). In general, the two need not be the same. For example, in the case of a perturbed black hole, the EH and the AH generally do not coincide as
|
https://en.wikipedia.org/wiki/Java%20memory%20model
|
The Java memory model describes how threads in the Java programming language interact through memory. Together with the description of single-threaded execution of code, the memory model provides the semantics of the Java programming language.
The original Java memory model developed in 1995, was widely perceived as broken, preventing many runtime optimizations and not providing strong enough guarantees for code safety. It was updated through the Java Community Process, as Java Specification Request 133 (JSR-133), which took effect back in 2004, for Tiger (Java 5.0).
Context
The Java programming language and platform provide thread capabilities. Synchronization between threads is notoriously difficult for developers; this difficulty is compounded because Java applications can run on a wide range of processors and operating systems. To be able to draw conclusions about a program's behavior, Java's designers decided they had to clearly define possible behaviors of all Java programs.
On modern platforms, code is frequently not executed in the order it was written. It is reordered by the compiler, the processor and the memory subsystem to achieve maximum performance. On multiprocessor architectures, individual processors may have their own local caches that are out of sync with main memory. It is generally undesirable to require threads to remain perfectly in sync with one another because this would be too costly from a performance point of view. This means that at any given time, different threads may see different values for the same shared data.
In a single-threaded environment, it is easy to reason about code execution. The typical approach requires the system to implement as-if-serial semantics for individual threads in isolation. When an individual thread executes, it will appear as if all of the actions taken by that thread occur in the order they appear in the program, even if the actions themselves occur out of order.
If one thread executes its
|
https://en.wikipedia.org/wiki/David%20Elliott%20Bell
|
David Elliott Bell (born in 1945) is an American mathematician and computer security pioneer. While working at MITRE Corporation, he and Leonard J. LaPadula co-developed the highly influential Bell–LaPadula model. In 2012, Bell was interviewed as part of an effort by the National Science Foundation to document the “Building an Infrastructure for Computer Security History.” In recognition of his contributions to the computer security field, Bell was inducted into the Cyber Security Hall of Fame in 2013.
The first step in the Bell-LaPadual model development provided tools for guiding and analyzing computer systems under development. The last step in the model development was the application of the general model to the Multics operating system. When the Computer Security Center at the Department of Defense published its Trusted Computer System Evaluation Criteria in 1983, the Bell-La Padula model was the only security model included to illustrate the "security model" required at the B2 level and above.
At the 21st Annual Computer Security Applications Conference in Tucson, Arizona in 2005, Bell presented a look back at the Bell-LaPadula model. In 2006, Bell published an addendum to his 'Looking Back at the Bell-LaPadula Model.
For NSA, he was Deputy Chief of the Research Office of the Computer Security Center, Acting Chief of the Research Office, and COR for a major acquisition. At Trusted Information Systems, he was the Senior Vice President and Corporate Secretary. He ran his own consulting company (BBND, Incorporated) before returning to the technical path at Mitretek Systems and EDS.
While working at Trusted Information Systems, Bell presented two papers, "Lattices, Policies and Implementations", and "Trusted Xenix Interpretation: Phase 1". At the 13th National Computer Security Conference.
The two papers Bell published in 1991 and 1992, "Lattices, Policies and Implementations" and "Putting Policy Commonalities to Work", together showed that all the
|
https://en.wikipedia.org/wiki/Army%20Mules
|
The Army Mules are a group of mules which serve as the mascots for the United States Military Academy in West Point, New York.
The tradition of mules as mascots for Army dates back to 1899, when an officer at the Philadelphia Quartermaster Depot decided that the team needed a mascot to counter the Navy goat. Mules were an obvious choice, as they were used as haulers for Army gear for generations. Not much is known about the "official" mules until 1936, when Mr. Jackson (named for Thomas J. "Stonewall" Jackson), a former Army pack mule, arrived from Front Royal, Virginia. He served for twelve years, presiding over two national championship teams. Starting with Mr. Jackson, there have been seventeen "official" Army mules, only one, Buckshot, being female. The current Mule Corps are:
Ranger III (formerly known as Jack): Ranger III, one of the Army Mules, has been on campus since 2011. He was trained by MAJ Anne Hessinger, an Army veterinarian who served at West Point in 2003–2006. Named, like his predecessor, for the 75th Ranger Regiment and all Rangers past and present, Ranger III came to the academy in 2011 as a gift of Steve Townes, class of 1975. He stands at and is the son of a Percheron mare.
Stryker (formerly known as Abe): Stryker is the half-brother of Ranger III. He was also trained by MAJ Anne Hessinger and gifted by Steve Townes. Stryker stands at a height slightly shorter than his brother.
Paladin (formerly known as Apache and Rocky): The newest member of the group, joined in February 2016, and is also a gift of Steve Townes. Paladin stands about two hands shorter than the half-brothers, and is half thoroughbred rather than Percheron.
The Army Mules are trained by cadet Mule Riders, a part of the Spirit Support Activity of the U.S. Corps of Cadets. The current Army Mule Riders are: Cadet Garrett Dolan, 2021, Cadet Sarah Traynor, 2022, Cadet Kyle Kass, 2023, and Cadet Benjamin Bennett, 2024. Together they are present at many of West Point's athletic eve
|
https://en.wikipedia.org/wiki/Belweder%20%28TV%20set%29
|
Belweder was the brand name of the OT1471 television set, manufactured in People's Republic of Poland (PRL) from 1957 to 1960 at the Warszawskie Zakłady Telewizyjne (WZT). It was the second (after the Wisła) TV set made in Poland and the first one designed entirely domestically.
The communist authorities of the PRL saw TV set manufacturing not only as satisfying the consumption needs of the citizens, but also a way of popularizing a potentially powerful propaganda medium, which is why the development of television in general and the TV sets in particular enjoyed strong support within the reality of a centrally planned economy.
The first plans for the new device, along with laboratory model, were created at the WZT in 1955. Contrary to WZT's first product, the Wisła, which was to a large extent based on solutions licensed from the Soviet Union with many components imported from there, the new TV was to be a modern design using domestic technology only, even though many of the components of the Belweder have not been manufactured in Poland before, and the manufacturing of plastics had to be set up virtually from scratch.
The resulting TV set had a 14" screen, external dimensions of 51x41x34 cm and weighed 23 kg. It could receive up to eight TV channels and FM radio. The channel switch could only be set to receive a signal from the transmitters in the part of Poland where a given example was sold - there were two distinct versions, one for the southern and northern part of Poland. A Belweder cost 7000 złoty at the time when the average monthly salary was between one and two thousand, yet, like many consumption goods in the communist economies, it proved very sought after and hard to buy. This seems strange to Westerners used to free market economies; the explanation is that although the TV set cost a few monthly salaries, communist economies produced so little in the way of consumer goods that people normally had vast amounts of money saved, simply because there w
|
https://en.wikipedia.org/wiki/Oscillistor
|
An oscillistor is a semiconductor device, consisting of a semiconductor specimen placed in magnetic field, and a resistor after a power supply. The device produces high-frequency oscillations, which are very close to sinusoidal.
The basic principle of operation is the effect of spiral unsteadiness of electron-hole (p-n) plasmas.
See also
Electronic oscillator
|
https://en.wikipedia.org/wiki/Undertone%20series
|
In music, the undertone series or subharmonic series is a sequence of notes that results from inverting the intervals of the overtone series. While overtones naturally occur with the physical production of music on instruments, undertones must be produced in unusual ways. While the overtone series is based upon arithmetic multiplication of frequencies, resulting in a harmonic series, the undertone series is based on arithmetic division.
Terminology
The hybrid term subharmonic is used in music in a few different ways. In its pure sense, the term subharmonic refers strictly to any member of the subharmonic series (, , , , etc.). When the subharmonic series is used to refer to frequency relationships, it is written with f representing some highest known reference frequency (, , , , etc.). As such, one way to define subharmonics is that they are "... integral submultiples of the fundamental (driving) frequency". The complex tones of acoustic instruments do not produce partials that resemble the subharmonic series, unless they are played or designed to induce non-linearity. However, such tones can be produced artificially with audio software and electronics. Subharmonics can be contrasted with harmonics. While harmonics can "... occur in any linear system", there are "... only fairly restricted conditions" that will lead to the "nonlinear phenomenon known as subharmonic generation".
In a second sense, subharmonic does not relate to the subharmonic series, but instead describes an instrumental technique for lowering the pitch of an acoustic instrument below what would be expected for the resonant frequency of that instrument, such as a violin string that is driven and damped by increased bow pressure to produce a fundamental frequency lower than the normal pitch of the same open string. The human voice can also be forced into a similar driven resonance, also called “undertone singing” (which similarly has nothing to do with the undertone series), to extend the range of
|
https://en.wikipedia.org/wiki/Burgundy%20mixture
|
Burgundy mixture, named after the French district where it was first used to treat grapes and vines, is a mixture of copper sulfate and sodium carbonate. This mixture, which can have an overall copper concentration within the range of 1% through 20%, is used as a fungicidal spray for trees and small fruits.
History
Similar to the Bordeaux mixture, one of the earliest fungicides in use, Burgundy mixture, also known as “sal soda Bordeaux”, is used as a fungus preventative applicant on plants before fungi have appeared. Bordeaux mixture contains copper(II) sulfate, CuSO4, and hydrated lime, Ca(OH)2, while Burgundy mixture contains copper sulphate, CuSO4, and sodium carbonate, Na2CO3. First used around 1885, Burgundy mixture has since been replaced by synthetic organic compounds, or by compounds that contain copper in a non-reactive, chelated form. This helps to prevent the accumulation of high levels of copper in sediments surrounding the plants.
Synthesis and composition
Burgundy mixture is made by combining dissolved copper sulphate and dissolved sodium carbonate. Dissolved copper sulphate ratios generally range from 1:1 to 1:18. Sodium carbonate is generally added in higher quantities and at a dissolved ratio of 1:1.5. Over time, the sodium carbonate will crystallize out of solution, and the closer the copper sulphate to carbonate mixture is to 1:1 ratios, the faster this process occurs. This property is one key factor in the general discontinued usage of Burgundy mixture, as the mixture must be mixed shortly before intended utilization.
Uses and mode of action
Burgundy mixture is used as a preemptive fungicide prevention for trees and small fruits. This occurs because the Cu(II) ions are capable of interfering with enzymes found within the spores of many fungi, preventing germination from occurring. Unfortunately, the mechanism for copper antifungal properties is not well understood, though it is thought that interactions between the copper and negatively charge
|
https://en.wikipedia.org/wiki/Defence%20Nuclear%20Material
|
Defence Nuclear Material within the UK is defined as:
Nuclear weapons (warheads)
Special Nuclear Materials (SNM)
New and used reactor fuel from Royal Navy submarines.
Nuclear materials
|
https://en.wikipedia.org/wiki/Ethernet%20over%20USB
|
Ethernet over USB is the use of a USB link as a part of an Ethernet network, resulting in an Ethernet connection over USB (instead of e.g. PCI or PCIe).
USB over Ethernet (also called USB over Network or USB over IP) is a system to share USB-based devices over Ethernet, Wi-Fi, or the Internet, allowing access to devices over a network. It can be done across multiple network devices by using USB over Ethernet Hubs.
Protocols
There are numerous protocols for Ethernet-style networking over USB. The use of these protocols is to allow application-independent exchange of data with USB devices, instead of specialized protocols such as video or MTP (Media Transfer Protocol). Even though the USB is not a physical Ethernet, the networking stacks of all major operating systems are set up to transport IEEE 802.3 frames, without needing a particular underlying transport.
The main industry protocols are (in chronological order): Remote NDIS (RNDIS, a Microsoft vendor protocol), Ethernet Control Model (ECM), Ethernet Emulation Model (EEM), and Network Control Model (NCM). The latter three are part of the larger Communications Device Class (CDC) group of protocols of the USB Implementers Forum (USB-IF). They are available for download from the USB-IF (see below). The RNDIS specification is available from Microsoft's web site. Regarding de facto standards, some standards, such as ECM, specify use of USB resources that early systems did not have. However, minor modifications of the standard subsets make practical implementations possible on such platforms. Remarkably, even some of the most modern platforms need minor accommodations and therefore support for these subsets is still needed.
Of these protocols, ECM could be classified the simplest—frames are simply sent and received without modification one at a time. This was a satisfactory strategy for USB 1.1 systems (current when the protocol was issued) with 64 byte packets but not for USB 2.0 systems which use 512 byte packet
|
https://en.wikipedia.org/wiki/Absolute%20horizon
|
In general relativity, an absolute horizon is a boundary in spacetime, defined with respect to the external universe, inside which events cannot affect an external observer. Light emitted inside the horizon can never reach the observer, and anything that passes through the horizon from the observer's side is never seen again by the observer. An absolute horizon is thought of as the boundary of a black hole.
In the context of black holes, the absolute horizon is generally referred to as an event horizon, though this is often used as a more general term for all types of horizons. The absolute horizon is just one type of horizon. For example, important distinctions must be made between absolute horizons and apparent horizons; the notion of a horizon in general relativity is subtle, and depends on fine distinctions.
Definition
An absolute horizon is only defined in an asymptotically flat spacetime – a spacetime which approaches flat space as one moves far away from any massive bodies. Examples of asymptotically flat spacetimes include Schwarzschild and Kerr black holes. The FRW universe – which is believed to be a good model for our universe – is generally not asymptotically flat. Nonetheless, we can think of an isolated object in an FRW universe as being nearly an isolated object in an asymptotically flat universe.
The particular feature of asymptotic flatness which is needed is a notion of "future null infinity". This is the set of points which are approached asymptotically by null rays (light rays, for example) which can escape to infinity. This is the technical meaning of "external universe". These points are only defined in an asymptotically flat universe. An absolute horizon is defined as the past null cone of future null infinity.
Nature of the absolute horizon
The definition of an absolute horizon is sometimes referred to as teleological, meaning that it cannot be known where the absolute horizon is without knowing the entire evolution of the universe, incl
|
https://en.wikipedia.org/wiki/X86%20calling%20conventions
|
This article describes the calling conventions used when programming x86 architecture microprocessors.
Calling conventions describe the interface of called code:
The order in which atomic (scalar) parameters, or individual parts of a complex parameter, are allocated
How parameters are passed (pushed on the stack, placed in registers, or a mix of both)
Which registers the called function must preserve for the caller (also known as: callee-saved registers or non-volatile registers)
How the task of preparing the stack for, and restoring after, a function call is divided between the caller and the callee
This is intimately related with the assignment of sizes and formats to programming-language types.
Another closely related topic is name mangling, which determines how symbol names in the code are mapped to symbol names used by the linker. Calling conventions, type representations, and name mangling are all part of what is known as an application binary interface (ABI).
There are subtle differences in how various compilers implement these conventions, so it is often difficult to interface code which is compiled by different compilers. On the other hand, conventions which are used as an API standard (such as stdcall) are very uniformly implemented.
Historical background
Prior to microcomputers, the machine manufacturer generally provided an operating system and compilers for several programming languages. The calling convention(s) for each platform were those defined by the manufacturer's programming tools.
Early microcomputers before the Commodore Pet and Apple II generally came without an OS or compilers. The IBM PC came with Microsoft's fore-runner to Windows, the Disk Operating System (DOS), but it did not come with a compiler. The only hardware standard for IBM PC-compatible machines was defined by the Intel processors (8086, 80386) and the literal hardware IBM shipped. Hardware extensions and all software standards (save for a BIOS calling convention) were th
|
https://en.wikipedia.org/wiki/Sustained%20Spheromak%20Physics%20Experiment
|
The Sustained Spheromak Physics Experiment (SSPX) is a program at Lawrence Livermore National Laboratory in the United States established to investigate spheromak plasma.
A spheromak device produces a plasma in magnetohydrodynamic equilibrium mainly through self-induced plasma currents, as opposed to a tokamak device which depends on large externally generated magnetic fields. The series of experiments examines the potential for a spheromak device to contain fusion fuel. According to a 1999 abstract,
The Sustained Spheromak Physics Experiment, SSPX , will study spheromak physics with particular attention to energy confinement and magnetic fluctuations in a spheromak sustained by electrostatic helicity injection.
See also
Magnetohydrodynamics
Magnetic helicity
Magnetic reconnection
Turbulence
|
https://en.wikipedia.org/wiki/Alvarion
|
Alvarion Technologies is a global provider of autonomous Wi-Fi networks designed with self-organizing capabilities for carrier-grade Wi-Fi, enterprise connectivity, smart city planning, smart hospitality, connected campuses, and connected events.
History
Alvarion was originally incorporated as BreezeCOM Ltd. in September 1992. In March 2000, BreezeCOM had an initial public offering, selling 5 million shares of its common stock at a price of $20 per share. BreezeCOM's shares were listed on the NASDAQ under the symbol BRZE.
In August 2001, BreezeCOM merged with another Israeli company, Floware Wireless Systems Ltd. (NASDAQ: FLRE), which was founded in 1993, changing its name to Alvarion.
In April 2003, Alvarion acquired InnoWave ECI Wireless Systems Ltd, from ECI Telecom.
In July 2003, Alvarion signed a strategic partnership agreement with Intel to co-develop WiMAX based Broadband wireless access systems, using Intel's WiMAX chips.
In December 2004, Alvarion acquired interWAVE Communications International (NASDAQ: IWAV) of Mountain View, California, which expanded the company's product range into the mobile GSM equipment market and provided new expertise in mobile systems. Most of the interWAVE operations became Alvarion's Cellular Mobile business unit, which was sold to LGC Wireless, Inc. in November 2006.
In February 2009, Alvarion announced that it was hired by Orange Botswana for WiMAX deployment, initially to cover Botswana’s two largest cities Gaborone and Francistown.
In November 2009, Alvarion started deploying a WiMAX wireless broadband network for the Australian ISP Adam Internet across metropolitan Adelaide, as a part of Australian government's Broadband Guarantee Program.
In November 2011, Alvarion acquired Wavion, a provider of outdoor Wi-Fi applications for metro and rural areas with deployments in more than 75 countries. This acquisition is part of Alvarion's strategic plan for shifting its primary focus from WiMAX-based radio access network to
|
https://en.wikipedia.org/wiki/Chenopodium%20nuttalliae
|
Chenopodium nuttalliae is a species of edible plant native to Mexico. It is known by the common names huauzontle (literally "hairy amaranth", from the Nahuatl huauhtli 'amaranth' and tzontli 'hair') and Aztec broccoli. Other variations of the name include huauhzontle, huazontle, huanzontle, and guausoncle. It is related to other commonly-consumed plants such as quinoa, amaranth, and epazote, as well as the common American weeds goosefoot and lambsquarters. The plant grows upright branches with red tinted green leafy stems. Huauzontle stems superficially resemble baby broccoli, although the stems are much thinner, and support fewer of the leaves.
Like amaranth, huauzontle is very resistant to cold and dry climates, and grows even in poor soil. In addition, it has a high nutritional level, which makes it an excellent grain alternative in regions with difficulties sowing other types of cereals.
During the rule of Moctezuma, huauzontle and amaranth were the fourth most important crops, after maize, beans, and chia. Many towns paid tribute to the Aztec empire in huauzontle.
Culinary use
As with other members of the goosefoot family, the leaves, branches, flowers (inflorescence), and seeds of huauzontle are all edible. The plant is used both as a herb and as a vegetable in Mexican cuisine. While it is eaten throughout Mexico, it is most commonly consumed in the center of the country, especially in the states of Tlaxcala, Mexico, Guerrero, Morelos, and in the south of Mexico City.
The most popular dish is huauzontle pancakes stuffed with cheese and topped with tomato sauce. Alternatively, huauzontles can be encased in an egg batter and deep-fried with a stick of salty Mexican cheese. Huauzontle is used to season salads, ahuautles in pasilla sauce, and beef fillets. The mature seeds can also be ground into flour to make tortillas.
Like quinoa, another plant in the genus Chenopodium, huauzontle contains saponins, albeit in lesser quantities. While saponins are toxic to
|
https://en.wikipedia.org/wiki/Computational%20semantics
|
Computational semantics is the study of how to automate the process of constructing and reasoning with meaning representations of natural language expressions. It consequently plays an important role in natural-language processing and computational linguistics.
Some traditional topics of interest are: construction of meaning representations, semantic underspecification, anaphora resolution, presupposition projection, and quantifier scope resolution. Methods employed usually draw from formal semantics or statistical semantics. Computational semantics has points of contact with the areas of lexical semantics (word-sense disambiguation and semantic role labeling), discourse semantics, knowledge representation and automated reasoning (in particular, automated theorem proving). Since 1999 there has been an ACL special interest group on computational semantics, SIGSEM.
See also
Discourse representation theory
Formal semantics (natural language)
Minimal recursion semantics
Natural-language understanding
Semantic compression
Semantic parsing
Semantic Web
SemEval
WordNet
Further reading
Blackburn, P., and Bos, J. (2005), Representation and Inference for Natural Language: A First Course in Computational Semantics, CSLI Publications. .
Bunt, H., and Muskens, R. (1999), Computing Meaning, Volume 1, Kluwer Publishing, Dordrecht. .
Bunt, H., Muskens, R., and Thijsse, E. (2001), Computing Meaning, Volume 2, Kluwer Publishing, Dordrecht. .
Copestake, A., Flickinger, D. P., Sag, I. A., & Pollard, C. (2005). Minimal Recursion Semantics. An introduction. In Research on Language and Computation. 3:281–332.
Eijck, J. van, and C. Unger (2010): Computational Semantics with Functional Programming. Cambridge University Press.
Wilks, Y., and Charniak, E. (1976), Computational Semantics: An Introduction to Artificial Intelligence and Natural Language Understanding, North-Holland, Amsterdam. .
|
https://en.wikipedia.org/wiki/MIL-STD-1760
|
MIL-STD-1760 Aircraft/Store Electrical Interconnection System defines a standardized electrical interface between a military aircraft and its carriage stores. Carriage stores range from weapons, such as GBU-31 JDAM, to pods, such as AN/AAQ-14 LANTIRN, to drop tanks. Prior to adoption and widespread use of MIL-STD-1760, new store types were added to aircraft using dissimilar, proprietary interfaces. This greatly complicated the aircraft equipment used to control and monitor the store while it was attached to the aircraft: the stores management system, or SMS.
MIL-STD-1760 defines the electrical characteristics of the signals at the interface, as well as the connector and pin assignments of all of the signals used in the interface. The connectors are designed for quick and reliable release of the store from the aircraft. Weapon stores are typically released only when the aircraft is attacking a target, under command of signals generated by the SMS. All types of stores may be released during jettison, which is a non-offensive release that can be used, for example, to lighten the weight of the aircraft during an emergency.
Signal description
There are five main groups of MIL-STD-1760 signals:
MIL-STD-704 power connections
MIL-STD-1553 data communications interface
High and low bandwidth analog signals
Discrete signals
Fiber optics
Note that the standard describes three groups: A) the signal lines (consisting of the high & low bandwidth, MIL-STD-1553 communications, and fiber optic signals); B) the discrete lines (consisting of the MIL-STD-1553 discretes and other discrete signals); and C) the power lines (which are the same as those described here).
In common practice, an aircraft will support most of the MIL-STD-1760 signals, whereas the store needs to accommodate only those signals it needs to perform its mission. As a result, stores typically use only a subset of the MIL-STD-1760 signals. MIL-STD-1760 was intended to support both current needs as well
|
https://en.wikipedia.org/wiki/Aspartame%20controversy
|
The artificial sweetener aspartame has been the subject of several controversies since its initial approval by the U.S. Food and Drug Administration (FDA) in 1974. The FDA approval of aspartame was highly contested, beginning with suspicions of its involvement in brain cancer, alleging that the quality of the initial research supporting its safety was inadequate and flawed, and that conflicts of interest marred the 1981 approval of aspartame, previously evaluated by two FDA panels that concluded to keep the approval on hold before further investigation. In 1987, the U.S. Government Accountability Office concluded that the food additive approval process had been followed properly for aspartame. The irregularities fueled a conspiracy theory, which the "Nancy Markle" email hoax circulated, along with claims—counter to the weight of medical evidence—that numerous health conditions (such as multiple sclerosis, systemic lupus, methanol toxicity, blindness, spasms, shooting pains, seizures, headaches, depression, anxiety, memory loss, birth defects, and death) are caused by the consumption of aspartame in normal doses.
Aspartame is a methyl ester of the aspartic acid/phenylalanine dipeptide. Potential health risks have been examined and dismissed by numerous scientific research projects. With the exception of the risk to those with phenylketonuria, aspartame is considered to be a safe food additive by governments worldwide and major health and food safety organizations. FDA officials describe aspartame as "one of the most thoroughly tested and studied food additives the agency has ever approved" and its safety as "clear cut." The weight of existing scientific evidence indicates that aspartame is safe as a non-nutritive sweetener.
Origins
The controversy over aspartame safety originated in perceived irregularities in the aspartame approval process during the 1970s and early 1980s, including allegations of a revolving door relationship between regulators and industry and
|
https://en.wikipedia.org/wiki/SSE4
|
SSE4 (Streaming SIMD Extensions 4) is a SIMD CPU instruction set used in the Intel Core microarchitecture and AMD K10 (K8L). It was announced on September 27, 2006, at the Fall 2006 Intel Developer Forum, with vague details in a white paper; more precise details of 47 instructions became available at the Spring 2007 Intel Developer Forum in Beijing, in the presentation. SSE4 is fully compatible with software written for previous generations of Intel 64 and IA-32 architecture microprocessors. All existing software continues to run correctly without modification on microprocessors that incorporate SSE4, as well as in the presence of existing and new applications that incorporate SSE4.
SSE4 subsets
Intel SSE4 consists of 54 instructions. A subset consisting of 47 instructions, referred to as SSE4.1 in some Intel documentation, is available in Penryn. Additionally, SSE4.2, a second subset consisting of the 7 remaining instructions, is first available in Nehalem-based Core i7. Intel credits feedback from developers as playing an important role in the development of the instruction set.
Starting with Barcelona-based processors, AMD introduced the SSE4a instruction set, which has 4 SSE4 instructions and 4 new SSE instructions. These instructions are not found in Intel's processors supporting SSE4.1 and AMD processors only started supporting Intel's SSE4.1 and SSE4.2 (the full SSE4 instruction set) in the Bulldozer-based FX processors. With SSE4a the misaligned SSE feature was also introduced which meant unaligned load instructions were as fast as aligned versions on aligned addresses. It also allowed disabling the alignment check on non-load SSE operations accessing memory. Intel later introduced similar speed improvements to unaligned SSE in their Nehalem processors, but did not introduce misaligned access by non-load SSE instructions until AVX.
Name confusion
What is now known as SSSE3 (Supplemental Streaming SIMD Extensions 3), introduced in the Intel Core 2 process
|
https://en.wikipedia.org/wiki/Surface%20engineering
|
Surface engineering is the sub-discipline of materials science which deals with the surface of solid matter. It has applications to chemistry, mechanical engineering, and electrical engineering (particularly in relation to semiconductor manufacturing).
Solids are composed of a bulk material covered by a surface. The surface which bounds the bulk material is called the surface phase. It acts as an interface to the surrounding environment. The bulk material in a solid is called the bulk phase.
The surface phase of a solid interacts with the surrounding environment. This interaction can degrade the surface phase over time. Environmental degradation of the surface phase over time can be caused by wear, corrosion, fatigue and creep.
Surface engineering involves altering the properties of the surface phase in order to reduce the degradation over time. This is accomplished by making the surface robust to the environment in which it will be used. It provides a cost-effective material for robust design. A spectrum of topics that represent the diverse nature of the field of surface engineering includes plating technologies, nano and emerging technologies and surface engineering, characterization and testing.
Applications
Surface engineering techniques are being used in the automotive, aerospace, missile, power, electronic, biomedical, textile, petroleum, petrochemical, chemical, steel, cement, machine tools and construction industries including road surfacing. Surface engineering techniques can be used to develop a wide range of functional properties, including physical, chemical, electrical, electronic, magnetic, mechanical, wear-resistant and corrosion-resistant properties at the required substrate surfaces. Almost all types of materials, including metals, ceramics, polymers, and composites can be coated on similar or dissimilar materials. It is also possible to form coatings of newer materials (e.g., met glass. beta-C3N4), graded deposits, multi-component deposits etc
|
https://en.wikipedia.org/wiki/List%20of%20fictional%20actuaries
|
Fictional actuaries and the appearance of actuaries in works of fiction have been the subject of a number of articles in actuarial journals.
Film
The Ice Road (2021) - Varnay (played by Benjamin Walker (actor); He introduced himself as an insurance actuary
About Schmidt (2002) - Warren Schmidt is portrayed by Jack Nicholson; the movie mostly covers Schmidt's retirement from an insurance company, and his adventures after retirement
Along Came Polly (2004) - Reuben Feffer (played by Ben Stiller) is a risk assessment expert, and though not explicitly stated, performs the job of an underwriter
Are You With It? (1948) - a musical comedy featuring Donald O'Connor as an actuary who is forced to join a carnival after misplacing a decimal point on a statistical table
The Billion Dollar Bubble (1976) - the Equity Funding scandal retold in the form of a movie, starring James Woods
Boyhood (2014) - Mason Evans, Sr. (played by Ethan Hawke) mentions at a baseball game that he recently passed his second actuarial exam, and later discusses his job at an insurance firm
Class Action (1991) - featured Gene Hackman and Mary Elizabeth Mastrantonio as father and daughter lawyers on opposite sides of a massive class action lawsuit; actuarial analysis plays a key role in the outcome
Double Indemnity (1944) - a Billy Wilder film, with Fred MacMurray and Barbara Stanwyck; possibly the first to feature an actuary; the plot revolves around a murder that seeks to gain advantage from a particular aspect of an insurance policy; an insurance investigator (played by Edward G. Robinson) knows the actuarial statistics and becomes suspicious
Escape Clause (1996) - Andrew McCarthy plays Richard Ramsay in an actuarial thriller; to quote TVguide.com, "The makers of this direct-to-video release thought the world was ready for a thriller about an insurance actuary. They thought wrong."
Fight Club (1999) - Edward Norton plays the protagonist, who briefly describes that his job entails the assessm
|
https://en.wikipedia.org/wiki/Computer%20liquidator
|
A computer liquidator buys computer technology and related equipment that is no longer required by one company, and resells ("flips") it to another company. Computer liquidators are agents that act in the computer recycling, or electronic recycling, business.
There are several reasons why companies will sell, or liquidate, used Information Technology (I.T.) equipment: bankruptcy, downsizing and expanding, or technological advancement. Technological advancement is the most common reason, as the equipment is no longer performing the tasks required of it, usually because it has been rendered obsolete by more advanced technology coming on to the market. This used or obsolete technology is often referred to as electronic waste. Equipment designated as outdated for one company is still viable for another company, whose operations may not require advanced solutions. Often, an information technology audit will be performed to help a company decide if their equipment needs updating, and if so, what the requirements are.
Reasons for Liquidation
Computer liquidation is a sustainable solution and is environmentally friendly. Rapid technology change, low initial cost, and planned obsolescence have resulted in a fast-growing surplus of computers and other electronic components around the globe. The purpose of computer liquidators is to keep as many computers and electronic parts out of landfills. As newer and better technology replaces hardware at an ever-increasing speed, the amount of technical trash increases as the technology is being replaced. The speed at which hardware changes and innovates in the last few years follows, to some degree, Moore's Law. Predictions were made that every landfill would soon be overflowing with discarded computer screens and computers, along with associated equipment such as keyboards and mouses and all the other hardware associated with use of the Internet. Most electronic waste is sent to landfills or incinerated, which releases toxic mater
|
https://en.wikipedia.org/wiki/European%20Digital%20Rights
|
European Digital Rights (EDRi) is an international advocacy group headquartered in Brussels, Belgium. EDRi is a network collective of non-profit organizations (NGO), experts, advocates and academics working to defend and advance digital rights across the continent. As of October 2022, EDRi is made of more than 40 NGOs, as well as experts, advocates and academics from all across Europe.
History
European Digital Rights (EDRi) is a not-for-profit association registered in Belgium.
EDRi was founded in June 2002 in Berlin by ten non-profits from seven countries, as a result of a growing awareness of the importance of European policymaking in the digital environment. The group was created in response to some of the earliest challenges in this policy area. Its founding board members were Maurice Wessling from Bits of Freedom, Andy Müller-Maguhn from the Chaos Computer Club and Meryem Marzouki from Imaginons un Réseau Internet Solidaire. Since inception, EDRi has grown significantly.
In October 2014, 34 privacy and civil rights organisations from 19 different countries in Europe had EDRi membership, and the organisation continued to grow. The need for cooperation among digital rights organisations active in Europe was increasing as more regulation regarding the Internet, copyright and privacy is proposed by European institutions, or by international institutions with strong effect in Europe.
In March 2021, EDRi is made of 44 NGOs, as well as experts, advocates and academics from all across Europe.
The current President of the Board of EDRi is Anna Fielder, Vice President is Thomas Lohninger.
Activities
EDRi's objective is to promote, protect, and uphold civil rights in the field of information and communication technology. This includes many issues relating to privacy and digital rights, from data retention to copyright and software patents, from the right to data protection and privacy to freedom of speech online, from privatised enforcement to cybersecurity.
EDR
|
https://en.wikipedia.org/wiki/Bulbil
|
A bulbil (also referred to as a bulbel, bulblet, and/or pup) is a small, young plant that is reproduced vegetatively from axillary buds on the parent plant's stem or in place of a flower on an inflorescence. These young plants are clones of the parent plant that produced them—they have identical genetic material. The formation of bulbils is a form of asexual reproduction, as they can eventually go on to form new stand-alone plants.
Although some bulbils meet the botanical criterion to be considered a true bulb, there are a variety of different morphological forms of bulbils, some of which are not considered to be bulbs. Hence the reason for distinction between bulbs and bulbils. For example, some bulbous plant groups, like onions and lilies, produce bulbils in the form of a secondary, small bulb. Onion and lily bulbils meet the botanical criterion to be labeled a true bulb. All bulbils produced by bulbous plants are to be considered bulbs, but not all bulbils are to be considered bulbs. For example, other non-bulbous plant groups, like various genera within the subfamily Agavoideae, are well known to produce bulbils that do not actually meet the botanical criterion to be considered a bulb.
Bulbils in Agavoideae
Within Agavoideae, bulbils develop on the inflorescence of a blooming plant. The development of bulbils in this group is common in approximately 17 Agave species, all Furcraea species, and has been somewhat documented in Yucca (particularly Yucca elata), and Hesperaloe. Bulbils can develop quite quickly, many do so after the flowers die, and can persist on the inflorescence for around one to two years before falling to root in the ground. While still on the parent plant, many species develop adventitious roots and can grow to sizes ranging from 5 to 15 centimeters, if left to mature.
Examples
Aconitum columbianum ssp. viviparum
Agave
Allium vineale
Allium paradoxum
Allium sativum (garlic)
Amorphophallus bulbifer
Tree onion (Allium × proliferum
|
https://en.wikipedia.org/wiki/Comparison%20of%20statistical%20packages
|
The following tables compare general and technical information for a number of statistical analysis packages.
General information
Operating system support
ANOVA
Support for various ANOVA methods
Regression
Support for various regression methods.
Time series analysis
Support for various time series analysis methods.
Charts and diagrams
Support for various statistical charts and diagrams.
Other abilities
See also
Comparison of computer algebra systems
Comparison of deep learning software
Comparison of numerical-analysis software
Comparison of survey software
Comparison of Gaussian process software
List of scientific journals in statistics
List of statistical packages
Footnotes
|
https://en.wikipedia.org/wiki/Hafnium%20controversy
|
The hafnium controversy is a debate over the possibility of 'triggering' rapid energy releases, via gamma ray emission, from a nuclear isomer of hafnium, 178m2Hf. The energy release is potentially 5 orders of magnitude (100,000 times) more energetic than a chemical reaction, but 2 orders of magnitude less than a nuclear fission reaction. In 1998, a group led by Carl Collins of the University of Texas at Dallas reported having successfully initiated such a trigger. Signal-to-noise ratios were small in those first experiments, and to date no other group has been able to duplicate these results. Peter Zimmerman described claims of weaponization potential as having been based on "very bad science".
Background
178m2Hf is a particularly attractive candidate for induced gamma emission (IGE) experiments, because of its high density of stored energy, 2.5 MeV per nucleus, and long 31-year half life for storing that energy. If radiation from some agent could "trigger" a release of that stored energy, the resulting cascade of gamma photons would have the best chance of finding a pair of excited states with the inverted lifetimes needed for stimulated emission. While induced emission adds only power to a radiation field, stimulated emission adds coherence.
This process can help create extremely efficient nuclear reaction engines, along with more precise radiometric devices.
A proposal to show the efficacy for "triggering" 178m2Hf was approved by a NATO-Advanced Research Workshop (NATO-ARW) held in Predeal in 1995. Although the proposal was to use incident protons to bombard the target, α-particles were available when the first experiment was scheduled. It was done by a French, Russian, Romanian and American team. Results were said to be extraordinary, but the results were not published. Nevertheless, 178m2Hf was implied to be of special importance to potential applications of IGE. A controversy quickly erupted.
Importance
178m2Hf has the highest excitation energy of any co
|
https://en.wikipedia.org/wiki/Adhesion%20%28medicine%29
|
Adhesions are fibrous bands that form between tissues and organs, often as a result of injury during surgery. They may be thought of as internal scar tissue that connects tissues not normally connected.
Pathophysiology
Adhesions form as a natural part of the body's healing process after surgery in a similar way that a scar forms. The term "adhesion" is applied when the scar extends from within one tissue across to another, usually across a virtual space such as the peritoneal cavity. Adhesion formation post-surgery typically occurs when two injured surfaces are close to one another. According to the "classical paradigm" of adhesion formation, the pathogenesis starts with inflammation and activation of the coagulation system which causes fibrin deposits onto the damaged tissues. The fibrin then connects the two adjacent structures where damage of the tissues occurred. The fibrin acts like a glue to seal the injury and builds the fledgling adhesion, said at this point to be "fibrinous." In body cavities such as the peritoneal, pericardial, and synovial cavities, a family of fibrinolytic enzymes may act to limit the extent of the initial fibrinous adhesion, and may even dissolve it. In many cases, the production or activity of these enzymes are compromised because of inflammation following injury or infection, however, and the fibrinous adhesion persists. A more recent study suggested that the formation of "fibrinous" adhesions is preceded by the aggregation of cavity macrophages, that can act like extravascular platelets in the abdominal cavity.
If this is allowed to happen, tissue repair cells such as macrophages, fibroblasts, and blood vessel cells penetrate into the fibrinous adhesion and lay down collagen and other matrix substances to form a permanent fibrous adhesion. In 2002, Giuseppe Martucciello's research group showed a possible role could be played by microscopic foreign bodies (FB) inadvertently contaminating the operative field during surgery. These dat
|
https://en.wikipedia.org/wiki/Comparison%20of%20streaming%20media%20software
|
This is a comparison of streaming media systems. A more complete list of streaming media systems is also available.
General
The following tables compare general and technical information for a number of streaming media systems both audio and video. Please see the individual systems' linked articles for further information.
Operating system support
Container format support
Information about what digital container formats are supported.
Protocol support
Information about which internet protocols are supported for broadcasting streaming media content.
Features
See also
Community radio
Comparison of video services
Content delivery network
Digital television
Electronic commerce
Internet radio
Internet radio device
Internet television
IPTV
List of Internet radio stations
List of music streaming services
Multicast
P2PTV
Protection of Broadcasts and Broadcasting Organizations Treaty
Push technology
Streaming media
Ustream
Webcast
Web television
|
https://en.wikipedia.org/wiki/Molecular%20computational%20identification
|
Molecular computational identification (MCID) is a technique in which molecules are used as means for identifying individual cells or nanodevices.
See also
RFID
|
https://en.wikipedia.org/wiki/Tideline
|
A tideline refers to where two currents in the ocean converge. Driftwood, floating seaweed, foam, and other floating debris may accumulate, forming sinuous lines called tidelines (although they generally have nothing to do with the tide).
There are four mechanisms that can cause tidelines to form:
Where one body of water is sinking beneath or riding over top of the surface layer of another body of water (somewhat similar in mechanics to subduction and/or uprisal of the earth plates at continental margins). These types of tidelines are often found where rivers enter the ocean.
Along the margins of back-eddies.
Convergence zones associated with internal gravity waves.
Along adjacent cells formed by wind currents.
See also
Langmuir circulation
Ocean circulation
Flotsam and jetsam
|
https://en.wikipedia.org/wiki/Psychiatric%20genetics
|
Psychiatric genetics is a subfield of behavioral neurogenetics and behavioral genetics which studies the role of genetics in the development of mental disorders (such as alcoholism, schizophrenia, bipolar disorder, and autism). The basic principle behind psychiatric genetics is that genetic polymorphisms (as indicated by linkage to e.g. a single nucleotide polymorphism) are part of the causation of psychiatric disorders.
Psychiatric genetics is a somewhat new name for the old question, "Are behavioral and psychological conditions and deviations inherited?". The goal of psychiatric genetics is to better understand the causes of psychiatric disorders, to use that knowledge to improve treatment methods, and possibly also to develop personalized treatments based on genetic profiles (see pharmacogenomics). In other words, the goal is to transform parts of psychiatry into a neuroscience-based discipline.
Recent advances in molecular biology allowed for the identification of hundreds of common and rare genetic variations that contribute to psychiatric disorders.
History
Research on psychiatric genetics began in the late nineteenth century with Francis Galton (a founder of psychiatric genetics) who was motivated by the work of Charles Darwin and his concept of desegregation. These methods of study later improved due to the development of more advanced clinical, epidemiological, and biometrical research tools. Better research tools were the precursor to the ability to perform valid family, twin, and adoption studies. Researchers learned that genes influence how these disorders manifest and that they tend to aggregate in families.
Heritability and genetics
Most psychiatric disorders are highly heritable; the estimated heritability for bipolar disorder, schizophrenia, and autism (80% or higher) is much higher than that of diseases like breast cancer and Parkinson disease. Having a close family member affected by a mental illness is the largest known risk factor, to date. H
|
https://en.wikipedia.org/wiki/Lee%E2%80%93Boot%20effect
|
The Lee–Boot effect is a phenomenon concerning the suppression or prolongation of oestrous cycles of mature female mice (and other rodents), when females are housed in groups and isolated from males. It is caused by the effects of an estrogen-dependent pheromone, possibly 2,5-dimethylpyrazine, which is released via the urine and acts on the vomeronasal organ of recipients. This pheromone lowers the concentration of luteinizing hormone and elevates prolactin levels, synchronising or stopping the recipient's cycle. This effect goes some way to explain why spontaneous pseudopregnancy can occur in mice. The same response is invoked from isolated females when brought into contact with urine-soaked bedding from other females' cages. The adrenal glands are required for production of the urine pheromone which is responsible for this effect.
See also
Menstrual synchrony
Whitten effect
|
https://en.wikipedia.org/wiki/SmartWater
|
SmartWater is a traceable liquid and forensic asset marking system (taggant) that is applied to items of value to identify thieves and deter theft. The liquid leaves a long-lasting and unique identifier, whose presence is invisible except under an ultraviolet black light.
History
SmartWater, the forensic technology company, was started in the early 1990s by Phil Cleary, a British police officer who served for approximately ten years working in various specialist departments before leaving the force in his 30s to start his own security company. His brother, Mike Cleary, a Chartered Chemist and a Fellow of the Royal Society of Chemistry, created SmartWater. Mike was responsible for the development of the technology, whereas Phil created the deterrence and business strategies.
In 1996, SmartWater gained a national profile when the Clearys won the Prince of Wales Award for Innovation of the product with most commercial potential' on BBC's Tomorrow's World.
Composition
SmartWater consists of a liquid containing a code, the presence of which can be seen under ultraviolet light. It is intended to be applied to valuable items, so that if they are stolen and later recovered by police, their original owner can be determined after laboratory testing of a sample. Another application is a sprinkler system that sprays a burglar with the liquid to generate evidence that connects a suspect to a specific location.
SmartWater comes in three variants, "Index Solutions", "Indsol Tracer" and "SmartWater Instant", which use different techniques to embed such a code. According to Phil Cleary, this allows "millions of chemical signatures" and, in terms of its use as an asset protection system, is an identifier superior to DNA fingerprinting.
The "Index Solutions" variant is a water based solution containing low level additives, which are blended using a binary sequence to ensure uniqueness. The Index Solution is contained within a spray system that is activated by an intruder detect
|
https://en.wikipedia.org/wiki/Tree%20topping
|
Tree topping is the practice of removing whole tops of trees or large branches and/or trunks from the tops of trees, leaving stubs or lateral branches that are too small to assume the role of a terminal leader. Other common names for the practice include hat-racking, heading, rounding over, and tipping. Some species of trees are more likely to recover from topping than others. There are alternatives to topping that can help to achieve the same goals without damaging trees.
Purpose
Hundreds of large trees are topped each year, which causes significant stress and future safety issues. It has been shown through survey that the average person's knowledge on tree care is limited.
Another popular misconception is that a topped tree will benefit from increased light penetration. The removal of a large portion of a tree's canopy can have detrimental effects. When a tree is topped, newly formed bark may be susceptible to sun scald. Prolonged exposure can severely damage the bark, thus creating an attractive home for decay-causing organisms. Evidence of decay may be the presence of conks (fungal fruiting structures) on the outer tree bark. The loss of leaves reduces a tree's ability to photosynthesize and produce food. If a large tree is unable to produce enough sugars to feed the roots, it will slowly die from starvation.
Some people have been known to top trees in order to stimulate new growth. When a tree is topped, many adventitious shoots, known as suckers begin to grow from the wound. This is the tree's response to the sudden loss of leaves. Although the tree is able to produce an abundance of suckers, they are susceptible to numerous problems. Firstly, this adventitious growth is succulent and susceptible to attacks by insects such as aphids and caterpillars, and pathogens like fire blight (Rosaceae). Secondly, the branch-stubs that the suckers emerge from are rarely able to form a complete callus. This means that any pathogen that attacks a sucker may enter the tr
|
https://en.wikipedia.org/wiki/The%20Panda%27s%20Thumb%20%28blog%29
|
The Panda's Thumb is a blog on issues of creationism and evolution from a mainstream scientific perspective. In 2006, Nature listed it as one of the top five science blogs, and Mark Pallen has called it "the definitive blog on the evolution versus creationism debate".
It is written by multiple contributors, including Wesley R. Elsberry, Joe Felsenstein, Paul R. Gross, Nick Matzke, and Mark Perakh, many of whom used to have complementary blogs at ScienceBlogs before it went defunct. The blog takes its name from The Panda's Thumb, the pub of the virtual University of Ediacara, which is named after the book of the same name by Stephen Jay Gould, which in turn takes its title from the essay "The Panda's Peculiar Thumb", which discusses the Panda's sesamoid bone, an example of convergent evolution.
See also
Rejection of evolution by religious groups
|
https://en.wikipedia.org/wiki/CUTEr
|
CUTEr (Constrained and Unconstrained Testing Environment, revisited) is an open source testing environment for optimization and linear algebra solvers. CUTEr provides a collection of test problems along with a set of tools to help developers design, compare, and improve new and existing test problem solvers.
CUTEr is the successor of the original Constrained and Unconstrained Testing Environment (CUTE) of Bongartz, Conn, Gould and Toint. It provides support for a larger number of platforms and operating systems as well as a more convenient optimization toolbox.
The test problems provided in CUTEr are written in Standard Input Format (SIF). A decoder to convert from this format into well-defined subroutines and data files is available as a separate package. Once translated, these files may be manipulated to provide tools suitable for testing optimization packages. Ready-to-use interfaces to existing packages, such as IPOPT, MINOS, SNOPT, filterSQP, Knitro and more are provided. The problems in the CUTE subset are also available in the AMPL format.
More than 1000 problems are available in the collection, including problems in:
linear programming,
convex and nonconvex quadratic programming,
linear and nonlinear least squares, and
more general convex and nonconvex large-scale and sparse equality and inequality-constrained nonlinear programming.
Over time, the CUTEr test set has become the de facto standard benchmark for research and production-level optimization solvers, and is used and cited in numerous published research articles.
The SIF is a superset of the original MPS format for linear programming and of its extension QPS for quadratic programming. Therefore, access to problem collections such as the Netlib linear programs and the Maros and Meszaros convex quadratic programs is possible. Moreover, the collection covers the Argonne test set, the Hock and Schittkowski collection, the Dembo network problems, the Gould QPs, and others.
CUTEr is available on a v
|
https://en.wikipedia.org/wiki/Azoospermia%20factor
|
Azoospermia factor (AZF) is one of several proteins or their genes, which are coded from the AZF region on the human male Y chromosome. Deletions in this region are associated with inability to produce sperm. Subregions within the AZF region are AZFa (sometimes AZF1), AZFb and AZFc (together referred to as AZF2). AZF microdeletions are one of the major causes of male infertility for azoospermia (complete absence of sperm in the ejaculate) and severe oligozoospermia (less than 5 million spermatozoa in the ejaculate) males. AZF is the term used by the HUGO Gene Nomenclature Committee.
Of the 15% of couples who are affected by infertility, 50% of those cases are due to the male partner. 15-30% of male factor infertility cases can be correlated with genetic abnormalities. One of the most commonly identified genetic abnormalities in male factor infertility are microdeletions on the long arm of the Y chromosome (Yq), specifically at a region known as the azoospermic factor (AZF) region.
In certain circumstances, men with AZF mutations can turn to assisted reproductive technologies (ART), such as intracytoplasmic sperm injection (ICSI), to help them overcome their suboptimal sperm quality. However, it may be more important for clinicians to screen for Yq microdeletions, due to a growing body of evidence that AZF microdeletions have the capability to be vertically transmitted to male offspring. Minor et al. demonstrated that an AZFc mutation was vertically transmitted over three generations via fathers receiving reproductive assistance through ICSI.
/
The AZF1 (Azoospermia Factor 1) gene is likely located in the euchromatic part of the long arm in Yq11.23. AZF1 is 792kb long and just distal to the centromere of the Y chromosome. AZF1 genes are involved in spermatogenesis in the testes.
Common phenotypic manifestations of deletions in this region are azoospermia and Sertoli cell-only syndrome. Men with a complete deletion in the AZFa region are unable to produce testic
|
https://en.wikipedia.org/wiki/Bioorganometallic%20chemistry
|
Bioorganometallic chemistry is the study of biologically active molecules that contain carbon directly bonded to metals or metalloids. The importance of main-group and transition-metal centers has long been recognized as important to the function of enzymes and other biomolecules. However, only a small subset of naturally-occurring metal complexes and synthetically prepared pharmaceuticals are organometallic; that is, they feature a direct covalent bond between the metal(loid) and a carbon atom. The first, and for a long time, the only examples of naturally occurring bioorganometallic compounds were the cobalamin cofactors (vitamin B12) in its various forms. In the 21st century, as a result of the discovery of new systems containing carbon–metal bonds in biology, bioorganometallic chemistry is rapidly emerging as a distinct subdiscipline of bioinorganic chemistry that straddles organometallic chemistry and biochemistry. Naturally occurring bioorganometallics include enzymes and sensor proteins. Also within this realm are synthetically prepared organometallic compounds that serve as new drugs and imaging agents (technetium-99m sestamibi) as well as the principles relevant to the toxicology of organometallic compounds (e.g., methylmercury). Consequently, bioorganometallic chemistry is increasingly relevant to medicine and pharmacology.
In cofactors and prosthetic groups
Vitamin B12 is the preeminent bioorganometallic species. Vitamin B12 is actually a collection of related enzyme cofactors, several of which contain cobalt–alkyl bonds, and is involved in biological methylation and 1,2-carbon rearrangement reactions. For a long time since its structure was elucidated by Hodgkin in 1955, it was believed to be the only example of a naturally occurring bioorganometallic system.
Several bioorganometallic enzymes carry out reactions involving carbon monoxide. Carbon monoxide dehydrogenase (CODH) catalyzes the water–gas shift reaction, which provides CO (through a
|
https://en.wikipedia.org/wiki/Swinging%20Atwood%27s%20machine
|
The swinging Atwood's machine (SAM) is a mechanism that resembles a simple Atwood's machine except that one of the masses is allowed to swing in a two-dimensional plane, producing a dynamical system that is chaotic for some system parameters and initial conditions.
Specifically, it comprises two masses (the pendulum, mass and counterweight, mass ) connected by an inextensible, massless string suspended on two frictionless pulleys of zero radius such that the pendulum can swing freely around its pulley without colliding with the counterweight.
The conventional Atwood's machine allows only "runaway" solutions (i.e. either the pendulum or counterweight eventually collides with its pulley), except for . However, the swinging Atwood's machine with has a large parameter space of conditions that lead to a variety of motions that can be classified as terminating or non-terminating, periodic, quasiperiodic or chaotic, bounded or unbounded, singular or non-singular due to the pendulum's reactive centrifugal force counteracting the counterweight's weight. Research on the SAM started as part of a 1982 senior thesis entitled Smiles and Teardrops (referring to the shape of some trajectories of the system) by Nicholas Tufillaro at Reed College, directed by David J. Griffiths.
Equations of motion
The swinging Atwood's machine is a system with two degrees of freedom. We may derive its equations of motion using either Hamiltonian mechanics or Lagrangian mechanics. Let the swinging mass be and the non-swinging mass be . The kinetic energy of the system, , is:
where is the distance of the swinging mass to its pivot, and is the angle of the swinging mass relative to pointing straight downwards. The potential energy is solely due to the acceleration due to gravity:
We may then write down the Lagrangian, , and the Hamiltonian, of the system:
We can then express the Hamiltonian in terms of the canonical momenta, , :
Lagrange analysis can be applied to obtain two second-orde
|
https://en.wikipedia.org/wiki/Single%20source%20of%20truth
|
In information science and information technology, single source of truth (SSOT) architecture, or single point of truth (SPOT) architecture, for information systems is the practice of structuring information models and associated data schemas such that every data element is mastered (or edited) in only one place, providing data normalization to a canonical form (for example, in database normalization or content transclusion).
There are several scenarios with respect to copies and updates:
The master data is never copied and instead only references to it are stored; this means that all reads and updates go directly to the SSOT
The master data is copied but the copies are only read and only the master data is updated; if requests to read data are only made on copies, this is an instance of CQRS
The master data is copied and the copies are updated; this needs a reconciliation mechanism when there are concurrent updates
Updates on copies can be thrown out whenever a concurrent update is made on the master, so they are not considered fully committed until propagated to the master (many blockchains work that way)
Concurrent updates are merged (if an automatic merge fails, it could fall back on another strategy, which could be the previous strategy or something else like manual intervention, which most source version control systems do)
The advantages of SSOT architectures include easier prevention of mistaken inconsistencies (such as a duplicate value/copy somewhere being forgotten), and greatly simplified version control. Without a SSOT, dealing with inconsistencies
Deployment of an SSOT architecture is becoming increasingly important in enterprise settings where incorrectly linked duplicate or de-normalized data elements (a direct consequence of intentional or unintentional denormalization of any explicit data model) pose a risk for retrieval of outdated, and therefore incorrect, information. Common examples (i.e., example classes of implementation) are as follows
|
https://en.wikipedia.org/wiki/HDOS
|
HDOS is an early microcomputer operating system, originally written for the Heathkit H8 computer system and later also available for the Heathkit H89 and Zenith Z-89 computers. The author was Heath Company employee Gordon Letwin, who later was an early employee of Microsoft and lead architect of OS/2.
HDOS originally came with a limited set of system software tools, including an assembler, but many commercial and large set of freeware programs from HUG (Heath User Group) became available for it eventually.
HDOS 2.0 is notable because it was one of the first microcomputer operating systems to use loadable device drivers to achieve a degree of device independence and extensibility. Device names followed the RSX-11-style convention of DKn: where the first two letters were the device driver file name and n was a number (DK0:, DK1:, and so on would all be handled by DK.SYS). Other similarities to RSX included the use of PIP for file transfer, and the use of EOT for file termination.
Similar to how Heath/Zenith published complete schematics and part lists for its computers, the company sold to users the source code for HDOS. The full source paper listing is held at yesterpc.org, old computer museum. Item references (Heathkit part number) are HOS-1-SL part number 595–2466.
Commands
The following list of commands are supported by HDOS.
BOOT
BYE
CAT
COPY
DATE
DELETE
DISMOUNT
FLAGS
HELP
MOUNT
ONECOPY
PIP
RENAME
RUN
SET
STAT
STATUS
TYPE
VER
Versions
HDOS 1.0 – written in 1978 by J. Gordon Letwin
HDOS 1.5 – Gregg Chandler
HDOS 1.6 – Gregg Chandler
HDOS 2.0 – released in 1980, written by Gregg Chandler, released into the public domain in April 1988
HDOS 3.0 – released into the public domain in August 1986
HDOS 3.02 – enhanced version by Richard Musgrave
See also
Heathkit
Zenith Data Systems
List of operating systems
|
https://en.wikipedia.org/wiki/Wieferich%20pair
|
In mathematics, a Wieferich pair is a pair of prime numbers p and q that satisfy
pq − 1 ≡ 1 (mod q2) and qp − 1 ≡ 1 (mod p2)
Wieferich pairs are named after German mathematician Arthur Wieferich.
Wieferich pairs play an important role in Preda Mihăilescu's 2002 proof of Mihăilescu's theorem (formerly known as Catalan's conjecture).
Known Wieferich pairs
There are only 7 Wieferich pairs known:
(2, 1093), (3, 1006003), (5, 1645333507), (5, 188748146801), (83, 4871), (911, 318917), and (2903, 18787). (sequence and in OEIS)
Wieferich triple
A Wieferich triple is a triple of prime numbers p, q and r that satisfy
pq − 1 ≡ 1 (mod q2), qr − 1 ≡ 1 (mod r2), and rp − 1 ≡ 1 (mod p2).
There are 17 known Wieferich triples:
(2, 1093, 5), (2, 3511, 73), (3, 11, 71), (3, 1006003, 3188089), (5, 20771, 18043), (5, 20771, 950507), (5, 53471161, 193), (5, 6692367337, 1601), (5, 6692367337, 1699), (5, 188748146801, 8807), (13, 863, 23), (17, 478225523351, 2311), (41, 138200401, 2953), (83, 13691, 821), (199, 1843757, 2251), (431, 2393, 54787), and (1657, 2281, 1667). (sequences , and in OEIS)
Barker sequence
Barker sequence or Wieferich n-tuple is a generalization of Wieferich pair and Wieferich triple. It is primes (p1, p2, p3, ..., pn) such that
p1p2 − 1 ≡ 1 (mod p22), p2p3 − 1 ≡ 1 (mod p32), p3p4 − 1 ≡ 1 (mod p42), ..., pn−1pn − 1 ≡ 1 (mod pn2), pnp1 − 1 ≡ 1 (mod p12).
For example, (3, 11, 71, 331, 359) is a Barker sequence, or a Wieferich 5-tuple; (5, 188748146801, 453029, 53, 97, 76704103313, 4794006457, 12197, 3049, 41) is a Barker sequence, or a Wieferich 10-tuple.
For the smallest Wieferich n-tuple, see , for the ordered set of all Wieferich tuples, see .
Wieferich sequence
Wieferich sequence is a special type of Barker sequence. Every integer k>1 has its own Wieferich sequence. To make a Wieferich sequence of an integer k>1, start with a(1)=k, a(n) = the smallest prime p such that a(n-1)p-1 = 1 (mod p) but a(n-1) ≠ 1 or -1 (mod p). It is a conjecture that e
|
https://en.wikipedia.org/wiki/Non-integer%20base%20of%20numeration
|
A non-integer representation uses non-integer numbers as the radix, or base, of a positional numeral system. For a non-integer radix β > 1, the value of
is
The numbers di are non-negative integers less than β. This is also known as a β-expansion, a notion introduced by and first studied in detail by . Every real number has at least one (possibly infinite) β-expansion. The set of all β-expansions that have a finite representation is a subset of the ring Z[β, β−1].
There are applications of β-expansions in coding theory and models of quasicrystals (; ).
Construction
β-expansions are a generalization of decimal expansions. While infinite decimal expansions are not unique (for example, 1.000... = 0.999...), all finite decimal expansions are unique. However, even finite β-expansions are not necessarily unique, for example φ + 1 = φ2 for β = φ, the golden ratio. A canonical choice for the β-expansion of a given real number can be determined by the following greedy algorithm, essentially due to and formulated as given here by .
Let be the base and x a non-negative real number. Denote by the floor function of x (that is, the greatest integer less than or equal to x) and let be the fractional part of x. There exists an integer k such that . Set
and
For , put
In other words, the canonical β-expansion of x is defined by choosing the largest dk such that , then choosing the largest dk−1 such that , and so on. Thus it chooses the lexicographically largest string representing x.
With an integer base, this defines the usual radix expansion for the number x. This construction extends the usual algorithm to possibly non-integer values of β.
Conversion
Following the steps above, we can create a β-expansion for a real number (the steps are identical for an , although must first be multiplied by to make it positive, then the result must be multiplied by to make it negative again).
First, we must define our value (the exponent of the nearest power of greater
|
https://en.wikipedia.org/wiki/The%20Jerry%20Lewis%20MDA%20Labor%20Day%20Telethon
|
The MDA Labor Day Telethon was an annual telethon held on (starting the night before and throughout) Labor Day in the United States to raise money for the Muscular Dystrophy Association (MDA). The Muscular Dystrophy Association was founded in 1950 with hopes of gaining the American public's interest. The show was hosted by comedian, actor, singer and filmmaker Jerry Lewis from its 1966 inception until 2010. The history of MDA's telethon dates back to the 1950s, when the Jerry Lewis Thanksgiving Party for MDA raised funds for the organization's New York City area operations. The telethon was held annually on Labor Day weekend beginning in 1966, and raised $2.45 billion for MDA from its inception through 2009.
The telethon broadcast up to 21 hours, starting on the Sunday evening preceding Labor Day and continuing until late Monday afternoon on the holiday itself. MDA called its network of participating stations the "Love Network". The show originated from Las Vegas for 28 of the years it was broadcast. Beginning in 2011 (and coinciding with Lewis' departure) MDA radically reformatted and shortened the telethon's format into that of a benefit concert, shortening the length of the special each successive year. The 2011 edition was seen on the Sunday evening before Labor Day for six hours. This edition was syndicated to approximately 160 television stations throughout the United States on September 4, 2011.
Nigel Lythgoe, Jann Carl, Alison Sweeney and Nancy O'Dell were brought on as co-hosts and shared hosting duties for the 2011 edition. Successive telethons from 2012 to 2014 ran under the new title MDA Show of Strength and further reduced the show's airtime. The 2012 edition aired on Sunday, September 2, 2012; the job of renaming the new show was given to MDA's advertising agency E.B. Lane (now LaneTerralever). Executive creative director Mark Itkowitz came up with the name MDA Show of Strength, and it quickly gained internal approval. The 2012 edition was reduced to
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.