source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Scratch%20hardness | Scratch hardness refers to the hardness of a material in terms of resistance to scratches and abrasion by a harder material forcefully drawn over its surface. Scratch hardness test or scratch test refers to any of a number of methods of measuring scratch hardness. Resistance to abrasion is less affected by surface variations than indentation methods. Scratch hardness is measured with a sclerometer.
Attempting to scratch a surface to test a material is a very old technique. The first scientific attempt to quantify materials by scratch tests was by mineralogist Friedrich Mohs in 1812 (see Mohs scale). The Mohs scale is based on relative scratch hardness of different materials; with talc assigned a value of 1 and diamond assigned a value of 10. Mohs's scale had two limitations: it was not linear, and most modern abrasives fall between 9 and 10.; so, later scientists attempted to increase resolution at the harder end of the scale.
Raymond R. Ridgway, a research engineer at the Norton Company, modified the Mohs scale by giving garnet a hardness of 10 and diamond a hardness of 15. Charles E. Wooddell, working at the Carborundum Company, extended the scale further by using resistance to abrasion, and extrapolating the scale based on 7 for quartz and 9 for corundum, resulting in a value of 42.4 for South American brown diamond bort.
There is a linear relationship between cohesive energy density (lattice energy per volume) and Wooddell wear resistance, occurring between corundum (H=9) and diamond (H=42.5).
See also
Scratch test (disambiguation) |
https://en.wikipedia.org/wiki/Alexander%20Pines | Alexander Pines (born June 22, 1945) is an American chemist. He is the Glenn T. Seaborg Professor Emeritus, University of California, Berkeley, Chancellor's Professor Emeritus and Professor of the Graduate School, University of California, Berkeley, and a member of the California Institute for Quantitative Biosciences (QB3) and the Department of Bioengineering. He was born in 1945, grew up in Bulawayo in Southern Rhodesia (now Zimbabwe) and studied undergraduate mathematics and chemistry in Israel at Hebrew University of Jerusalem. Coming to the United States in 1968, Pines obtained his Ph.D. in chemical physics at M.I.T. in 1972 and joined the UC Berkeley faculty later that year.
Research
Pines is a pioneer in the development and applications of nuclear magnetic resonance (NMR) spectroscopy of non-liquid samples. In his early work, he demonstrated time-reversal of dipole-dipole couplings in many-body spin systems, and introduced high sensitivity, cross polarization NMR of dilute spins such as carbon-13 in solids (Proton Enhanced Nuclear Induction Spectroscopy), thereby helping to launch the era of modern solid-state NMR in chemistry. He also developed the areas of multiple-quantum spectroscopy, adiabatic sech/tanh inversion pulses, zero-field NMR, double rotation and dynamic-angle spinning, iterative maps for pulse sequences and quantum control, and the quantum geometric phase. His combination of optical pumping and cross-polarization made it possible to observe enhanced NMR of surfaces and the selective "lighting up" of solution NMR and magnetic resonance imaging (MRI) by means of laser-polarized xenon.
Until he retired to emeritus status, his program was composed of two complementary components. The first is the establishment of new concepts and techniques in NMR and MRI, in order to extend their applicability and enhance their capability to investigate molecular structure, organization and function from materials to organisms. Examples of methodologies emana |
https://en.wikipedia.org/wiki/R%20%28complexity%29 | In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages (also called decidable languages).
Equivalent formulations
R is equivalent to the set of all total computable functions in the sense that:
a decision problem is in R if and only if its indicator function is computable,
a total function is computable if and only if its graph is in R.
Relationship with other classes
Since we can decide any problem for which there exists a recogniser and also a co-recogniser by simply interleaving them until one obtains a result, the class is equal to RE ∩ co-RE. |
https://en.wikipedia.org/wiki/Microcosm%20%28experimental%20ecosystem%29 | Microcosms are artificial, simplified ecosystems that are used to simulate and predict the behaviour of natural ecosystems under controlled conditions. Open or closed microcosms provide an experimental area for ecologists to study natural ecological processes. Microcosm studies can be very useful to study the effects of disturbance or to determine the ecological role of key species. A Winogradsky column is an example of a microbial microcosm.
See also
Closed ecological system
Ecologist Howard T. Odum was a pioneer in his use of small closed and open ecosystems in classroom teaching.
Biosphere 2 - Controversial project with a 1.27 ha artificial closed ecological system in Oracle, Arizona (USA). |
https://en.wikipedia.org/wiki/Wald%27s%20maximin%20model | In decision theory and game theory, Wald's maximin model is a non-probabilistic decision-making model according to which decisions are ranked on the basis of their worst-case outcomes – the optimal decision is one with the least bad worst outcome. It is one of the most important models in robust decision making in general and robust optimization in particular.
It is also known by a variety of other titles, such as Wald's maximin rule, Wald's maximin principle, Wald's maximin paradigm, and Wald's maximin criterion. Often 'minimax' is used instead of 'maximin'.
Definition
This model represents a 2-person game in which the player plays first. In response, the second player selects the worst state in , namely a state in that minimizes the payoff over in . In many applications the second player represents uncertainty. However, there are maximin models that are completely deterministic.
The above model is the classic format of Wald's maximin model. There is an equivalent mathematical programming (MP) format:
where denotes the real line.
As in game theory, the worst payoff associated with decision , namely
is called the security level of decision .
The minimax version of the model is obtained by exchanging the positions of the and operations in the classic format:
The equivalent MP format is as follows:
History
Inspired by game theory, Abraham Wald developed this model as an approach to scenarios in which there is only one player (the decision maker). Player 2 showcases a gloomy approach to uncertainty. In Wald's maximin model, player 1 (the player) plays first and player 2 (the player) knows player 1's decision when he selects his decision. This is a major simplification of the classic 2-person zero-sum game in which the two players choose their strategies without knowing the other player's choice. The game of Wald's maximin model is also a 2-person zero-sum game, but the players choose sequentially.
With the establishment of modern decision theo |
https://en.wikipedia.org/wiki/Search%20domain | A search domain is a domain used as part of a domain search list. The search list, as well as the local domain name, is used by a resolver to create a fully qualified domain name (FQDN) from a relative name. For this purpose, the local domain name functions as a single-item search list.
IPv4
In an IPv4 environment, search domains are often set via DHCPv4, along with the local domain name. The domain search list is configured by the Domain Search Option (DHCPv4 option number 119), while the local domain name is configured by Domain Name (DHCPv4 option number 15).
The Windows operating system, however, does not understand the Domain Search Option; as a workaround, many network administrators use Group Policy Objects to set the domain search list for Windows machines.
IPv6
In an IPv6 environment, the domain search list is called a DNS Search List (DNSSL) and can be configured by Router Advertisement and DHCP.
Manually configuring domain search lists
In CentOS Linux search domain can be defined by editing the ifcfg file corresponding to the network. In Mac OS X the setting is located under the DNS tab, next to DNS server settings. A similar setting in Microsoft Windows is the Connection-specific DNS Suffix.
Functionality
When looking up a bare name in DNS, the network stack will add the search domains to it to form fully qualified domain names, and look up those as well. For example, if the domain search list contains "wikipedia.org", typing "en" in the browser will direct the user to "en.wikipedia.org". Some ISPs add their own search domains via DHCP settings, similar to how they add DNS servers and other networking information; if this is undesired, the user can change this setting to ".local". |
https://en.wikipedia.org/wiki/Oculomotor%20nerve | The oculomotor nerve, also known as the third cranial nerve, cranial nerve III, or simply CN III, is a cranial nerve that enters the orbit through the superior orbital fissure and innervates extraocular muscles that enable most movements of the eye and that raise the eyelid. The nerve also contains fibers that innervate the intrinsic eye muscles that enable pupillary constriction and accommodation (ability to focus on near objects as in reading). The oculomotor nerve is derived from the basal plate of the embryonic midbrain. Cranial nerves IV and VI also participate in control of eye movement.
Structure
The oculomotor nerve originates from the third nerve nucleus at the level of the superior colliculus in the midbrain. The third nerve nucleus is located ventral to the cerebral aqueduct, on the pre-aqueductal grey matter. The fibers from the two third nerve nuclei located laterally on either side of the cerebral aqueduct then pass through the red nucleus. From the red nucleus fibers then pass via the substantia nigra to emerge from the substance of the brainstem at the oculomotor sulcus (a groove on the lateral wall of the interpeduncular fossa).
On emerging from the brainstem, the nerve is invested with a sheath of pia mater, and enclosed in a prolongation from the arachnoid. It passes between the superior cerebellar (below) and posterior cerebral arteries (above), and then pierces the dura mater anterior and lateral to the posterior clinoid process, passing between the free and attached borders of the tentorium cerebelli.
It traverses the cavernous sinus, above the other orbital nerves receiving in its course one or two filaments from the cavernous plexus of the sympathetic nervous system, and a communicating branch from the ophthalmic division of the trigeminal nerve. As the oculomotor nerve enters the orbit via the superior orbital fissure it then divides into a superior and an inferior branch.
Superior branch
The superior branch of the oculomotor nerve or |
https://en.wikipedia.org/wiki/Timothy%20Beatley | Dr Timothy Beatley is an internationally recognized sustainable city researcher and author. His writings have focused on creative strategies cities can use to reduce their ecological footprints and become more livable and equitable places in the process. Beatley coined the term green urbanism and uses it frequently in his writings to describe the planning process used to create a sustainable city.
Academic Background
Beatley received a PhD in City and Regional Planning from the University of North Carolina at Chapel Hill in 1986. He is currently "Teresa Heinz Professor of Sustainable Communities" in the Department of Urban and Environmental Planning, the University of Virginia School of Architecture.
His primary teaching and research interests are in environmental planning and policy, with special emphasis on coastal and natural hazards planning, environmental values and ethics, and biodiversity conservation. He has been a prolific author since the mid-1980s on the subjects of coastal hazard mitigation, hurricane recovery, habitat and ecosystem conservation, environmental ethics, and sustainable urban planning.
His 2010 book Biophilic Cities: Integrating Nature Into Urban Design and Planning advocates putting the biophilia hypothesis into practice with an outline of the essential elements of a biophilic city and examples and stories about cities that have successfully integrated biophilic elements.
Green Urbanism
In his recent works surveying sustainable cities in Europe and Australia, Beatley argues that although cities typically consume large quantities of fossil fuels and generate enormous amounts of waste and pollution, they are the most important centers for positive environmental change. Beatley notes that the high population density that characterizes most cities (especially European cities) also means that land is used efficiently, that automobiles are not the primary mode of transportation, and that per capita consumption of resources is low. Beatle |
https://en.wikipedia.org/wiki/Cytoarchitecture | Cytoarchitecture (Greek κύτος= "cell" + ἀρχιτεκτονική= "architecture"), also known as cytoarchitectonics, is the study of the cellular composition of the central nervous system's tissues under the microscope. Cytoarchitectonics is one of the ways to parse the brain, by obtaining sections of the brain using a microtome and staining them with chemical agents which reveal where different neurons are located.
The study of the parcellation of nerve fibers (primarily axons) into layers forms the subject of myeloarchitectonics (<Gk. μυελός=marrow + ἀρχιτεκτονική=architecture), an approach complementary to cytoarchitectonics.
History of the cerebral cytoarchitecture
Defining cerebral cytoarchitecture began with the advent of histology—the science of slicing and staining brain slices for examination. It is credited to the Viennese psychiatrist Theodor Meynert (1833–1892), who in 1867 noticed regional variations in the histological structure of different parts of the gray matter in the cerebral hemispheres.
Paul Flechsig was the first to present the cytoarchitecture of the human brain into 40 areas. Alfred Walter Campbell then divided it into 14 areas.
Sir Grafton Elliot Smith (1871–1937), a New South Wales native working in Cairo, identified 50 areas. Korbinian Brodmann worked on the brains of diverse mammalian species and developed a division of the cerebral cortex into 52 discrete areas (of which 44 in the human, and the remaining 8 in non-human primate brain). Brodmann used numbers to categorize the different architectural areas, now referred to as a Brodmann Area, and he believed that each of these regions served a unique functional purpose.
Constantin von Economo and Georg N. Koskinas, two neurologists in Vienna, produced a landmark work in brain research by defining 107 cortical areas on the basis of cytoarchitectonic criteria. They used letters to categorize the architecture, e.g., "F" for areas of the frontal lobe.
The Nissl staining technique
The Nissl stain |
https://en.wikipedia.org/wiki/Rennes-le-Ch%C3%A2teau | Rennes-le-Château (; ) is a commune approximately 5 km (3 miles) south of Couiza, in the Aude department in the Occitanie region in Southern France. In 2018, it had a population of 91.
This hilltop village is known internationally; it receives tens of thousands of visitors per year, drawn by conspiracy theories surrounding a putative buried treasure discovered by its 19th-century priest Bérenger Saunière, the precise nature of which is disputed among those who credit its existence.
History
Mountains frame both ends of the region—the Cévennes to the northeast and the Pyrenees to the south. The area is known for its scenery, with jagged ridges, deep river canyons and rocky limestone plateaus, with large caves underneath. Rennes-le-Château was the site of a prehistoric encampment, and later a Roman colony, or at least Roman villa or temple, such as is confirmed to have been built at Fa, west of Couiza, part of the Roman province of Gallia Narbonensis, the wealthiest part of Roman Gaul.
Rennes-le-Château was part of Septimania in the 6th and 7th centuries. It has been suggested that it was once an important Visigothic town, with some 30,000 people living in the city around 500–600 AD. Until 1659–1745 the area was not considered French territory, being part of the Catalan Country since 988. However, British archaeologist Bill Putnam and British physicist John Edwin Wood argued that while there may have been a Visigothic town on the site of the present village, it would have had "a population closer to 300 than 30,000".
By 1050 the Counts of Toulouse held control over the area, building a castle in Rennes-le-Château around 1002, though nothing remains above ground of this medieval structure—the present ruin is from the 17th or 18th century.
Several castles in the surrounding Languedoc region were central to the battle between the Catholic Church and the Cathars at the beginning of the 13th century. Other castles guarded the volatile border with Spain. Whole communi |
https://en.wikipedia.org/wiki/Kadomtsev%E2%80%93Petviashvili%20equation | In mathematics and physics, the Kadomtsev–Petviashvili equation (often abbreviated as KP equation) is a partial differential equation to describe nonlinear wave motion. Named after Boris Borisovich Kadomtsev and Vladimir Iosifovich Petviashvili, the KP equation is usually written as
where . The above form shows that the KP equation is a generalization to two spatial dimensions, x and y, of the one-dimensional Korteweg–de Vries (KdV) equation. To be physically meaningful, the wave propagation direction has to be not-too-far from the x direction, i.e. with only slow variations of solutions in the y direction.
Like the KdV equation, the KP equation is completely integrable. It can also be solved using the inverse scattering transform much like the nonlinear Schrödinger equation.
In 2002, the regularized version of the KP equation, naturally referred to as the Benjamin–Bona–Mahony–Kadomtsev–Petviashvili equation (or simply the BBM-KP equation), was introduced as an alternative model for small amplitude long waves in shallow water moving mainly in the x direction in 2+1 space.
where . The BBM-KP equation provides an alternative to the usual KP equation, in a similar way that the Benjamin–Bona–Mahony equation is related to the classical Korteweg–de Vries equation, as the linearized dispersion relation of the BBM-KP is a good approximation to that of the KP but does not exhibit the unwanted limiting behavior as the Fourier variable dual to x approaches .
History
The KP equation was first written in 1970 by Soviet physicists Boris B. Kadomtsev (1928–1998) and Vladimir I. Petviashvili (1936–1993); it came as a natural generalization of the KdV equation (derived by Korteweg and De Vries in 1895). Whereas in the KdV equation waves are strictly one-dimensional, in the KP equation this restriction is relaxed. Still, both in the KdV and the KP equation, waves have to travel in the positive x-direction.
Connections to physics
The KP equation can be used to model wate |
https://en.wikipedia.org/wiki/Strategic%20fair%20division | Strategic fair division is the branch of fair division in which the participants are assumed to hide their preferences and act strategically in order to maximize their own utility, rather than playing sincerely according to their true preferences.
To illustrate the difference between strategic fair division and classic fair division, consider the divide and choose procedure for dividing a cake among two agents. In classic fair division, it is assumed that the cutter cuts the cake into two pieces that are equal in his eyes, and thus he always gets a piece that he values at exactly 1/2 of the total cake value. However, if the cutter knows the chooser's preferences, he can get much more than 1/2 by acting strategically. For example, suppose the cutter values a piece by its size while the chooser values a piece by the amount of chocolate in it. So the cutter can cut the cake into two pieces with almost the same amount of chocolate, such that the smaller piece has slightly more chocolate. Then, the chooser will take the smaller piece and the cutter will win the larger piece, which may be worth much more than 1/2 (depending on how the chocolate is distributed).
The research in strategic fair division has two main branches.
One branch is related to game theory and studies the equilibria in games created by fair division algorithms:
The Nash equilibrium of the Dubins-Spanier moving-knife protocol;
The Nash equilibrium and subgame-perfect equilibrium of generalized-cut-and-choose protocols;
The equilibria of envy-free protocols for allocating an indivisible good with monetary compensations.
The price of anarchy of Nash equilibria of two mechanisms for homogeneous-resource allocation: the Fisher market game and the Trading Post game.
The other branch is related to mechanism design and aims to find truthful mechanisms for fair division, in particular:
Truthful cake-cutting;
Truthful resource allocation;
Truthful fair division of rooms and rent. |
https://en.wikipedia.org/wiki/Connector%20%28mathematics%29 | In mathematics, a connector is a map which can be defined for a linear connection and used to define the covariant derivative on a vector bundle from the linear connection.
Definition
Let ∇ be a connection on the tangent space TN of a smooth manifold N. For smooth mappings h:M→TN from any smooth manifold M, the connector K:TTN→TN satisfies : ∇ h = K○Th:TM→TN where Th:TM→TTN is the differential of h.
Connection (mathematics) |
https://en.wikipedia.org/wiki/Delegated%20administration | In computing, delegated administration or delegation of control describes the decentralization of role-based-access-control systems. Many enterprises use a centralized model of access control. For large organizations, this model scales poorly and IT teams become burdened with menial role-change requests. These requests — often used when hire, fire, and role-change events occur in an organization — can incur high latency times or suffer from weak security practices.
Such delegation involves assigning a person or group specific administrative permissions for an Organizational Unit. In information management, this is used to create teams that can perform specific (limited) tasks for changing information within a user directory or database. The goal of delegation is to create groups with minimum permissions that grant the ability to carry out authorized tasks. Granting extraneous/superfluous permissions would create abilities beyond the authorized scope of work.
One best practice for enterprise role management entails the use of LDAP groups. Delegated administration refers to a decentralized model of role or group management. In this model, the application or process owner creates, manages and delegates the management of roles. A centralized IT team simply operates the service of directory, metadirectory, web interface for administration, and related components.
Allowing the application or business process owner to create, manage and delegate groups supports a much more scalable approach to the administration of access rights.
In a metadirectory environment, these roles or groups could also be "pushed" or synchronized with other platforms. For example, groups can be synchronized with native operating systems such as Microsoft Windows for use on an access control list that protects a folder or file. With the metadirectory distributing groups, the central directory is the central repository of groups.
Some enterprise applications (e.g., PeopleSoft) support |
https://en.wikipedia.org/wiki/ATPIF1 | ATPase inhibitor, mitochondrial is an enzyme that in humans is encoded by the ATPIF1 gene.
This gene encodes a mitochondrial ATPase inhibitor. Alternative splicing occurs at this locus and three transcript variants encoding distinct isoforms have been identified.
It prevents ATPase from switching to ATP hydrolysis during collapse of the electrochemical gradient, for example during oxygen deprivation ATP synthase inhibitor forms a one-to-one complex with the F1 ATPase, possibly by binding at the alpha-beta interface. It is thought to inhibit ATP synthesis by preventing the release of ATP. The inhibitor has two oligomeric states, dimer (the active state) and tetramer. At low pH, the inhibitor forms a dimer via antiparallel coiled coil interactions between the C-terminal regions of two monomers. At high pH, the inhibitor forms tetramers and higher oligomers by coiled coil interactions involving the N terminus and inhibitory region, thus preventing the inhibitory activity.
Model organisms
Model organisms have been used in the study of ATPIF1 function. A conditional knockout mouse line, called Atpif1tm1a(EUCOMM)Wtsi was generated as part of the International Knockout Mouse Consortium program — a high-throughput mutagenesis project to generate and distribute animal models of disease to interested scientists.
Male and female animals underwent a standardized phenotypic screen to determine the effects of deletion. Twenty three tests were carried out on mutant mice and three significant abnormalities were observed. Homozygous mutant animals displayed hyperactivity and brain dysmorphology, while males also had decreased circulating alkaline phosphatase levels. |
https://en.wikipedia.org/wiki/Kenkichi%20Iwasawa | Kenkichi Iwasawa ( Iwasawa Kenkichi, September 11, 1917 – October 26, 1998) was a Japanese mathematician who is known for his influence on algebraic number theory.
Biography
Iwasawa was born in Shinshuku-mura, a town near Kiryū, in Gunma Prefecture. He attended elementary school there, but later moved to Tokyo to attend Musashi High School.
From 1937 to 1940 Iwasawa studied as an undergraduate at Tokyo Imperial University, after which he entered graduate school at University of Tokyo and became an assistant in the Department of Mathematics. In 1945 he was awarded a Doctor of Science degree. However, this same year Iwasawa became sick with pleurisy, and was unable to return to his position at the university until April 1947. From 1949 to 1955 he worked as assistant professor at Tokyo University.
In 1950, Iwasawa was invited to Cambridge, Massachusetts to give a lecture at the International Congress of Mathematicians on his method to study Dedekind zeta functions using integration over ideles and duality of adeles; this method was also independently obtained by John Tate and is sometimes called Iwasawa–Tate theory. Iwasawa spent the next two years at the Institute for Advanced Study in Princeton, and in Spring of 1952 was offered a job at the Massachusetts Institute of Technology, where he worked until 1967.
From 1967 until his retirement in 1986, Iwasawa served as Professor of Mathematics at Princeton. He returned to Tokyo with his wife in 1987.
Among Iwasawa's most famous students are Robert F. Coleman, Bruce Ferrero, Ralph Greenberg, Gustave Solomon, Larry Washington, and Eugene M. Luks.
Research
Iwasawa is known for introducing what is now called Iwasawa theory, which developed from researches on cyclotomic fields from the later 1950s. Before that he worked on Lie groups and Lie algebras, introducing the general Iwasawa decomposition.
List of books available in English
Lectures on p-adic L-functions / by Kenkichi Iwasawa (1972)
Local class field theory / K |
https://en.wikipedia.org/wiki/Floyd%E2%80%93Steinberg%20dithering | Floyd–Steinberg dithering is an image dithering algorithm first published in 1976 by Robert W. Floyd and Louis Steinberg. It is commonly used by image manipulation software, for example when an image is converted into GIF format that is restricted to a maximum of 256 colors.
Implementation
The algorithm achieves dithering using error diffusion, meaning it pushes (adds) the residual quantization error of a pixel onto its neighboring pixels, to be dealt with later. It spreads the debt out according to the distribution (shown as a map of the neighboring pixels):
The pixel indicated with a star (*) indicates the pixel currently being scanned, and the blank pixels are the previously-scanned pixels.
The algorithm scans the image from left to right, top to bottom, quantizing pixel values one by one. Each time, the quantization error is transferred to the neighboring pixels, while not affecting the pixels that already have been quantized. Hence, if a number of pixels have been rounded downwards, it becomes more likely that the next pixel is rounded upwards, such that on average, the quantization error is close to zero.
The diffusion coefficients have the property that if the original pixel values are exactly halfway in between the nearest available colors, the dithered result is a checkerboard pattern. For example, 50% grey data could be dithered as a black-and-white checkerboard pattern. For optimal dithering, the counting of quantization errors should be in sufficient accuracy to prevent rounding errors from affecting the result.
In some implementations, the horizontal direction of scan alternates between lines; this is called "serpentine scanning" or boustrophedon transform dithering.
The algorithm described above is in the following pseudocode. This works for any approximately linear encoding of pixel values, such as 8-bit integers, 16-bit integers or real numbers in the range [0, 1].
for each y from top to bottom do
for each x from left to right do
|
https://en.wikipedia.org/wiki/London%20Burkers | The London Burkers were a group of body snatchers operating in London, England, who apparently modeled their activities on the notorious Burke and Hare murders. They came to prominence in 1831 for murdering victims to sell to anatomists, by luring and drugging them at their dwelling in the northern end of Bethnal Green, near St Leonard's, Shoreditch in London. They were also known as the Bethnal Green Gang.
Background
Nova Scotia Gardens
Nova Scotia Gardens was the area of a brick field, north-east of St Leonard's, Shoreditch. The brick clay had been exhausted and the area begun to be filled in with waste ("leystall", literally excrement). Cottages (probably evolving from sheds serving the gardens) came to be built here, but were undesirable as they remained below ground level, and so were prone to flooding.
Anatomy
During the early 19th century, the demand for legally obtained cadavers for the study and teaching of anatomy in British medical schools greatly exceeded the supply. In the 18th century, hundreds had been executed each year, often for quite trivial crimes, but by the 19th century only 55 people were being hanged each year, while as many as 500 were needed. As medical science began to flourish, demand rose sharply and attracted criminal elements willing to obtain specimens by any means. The activities of body-snatchers, or resurrectionists, gave rise to a particular public fear and revulsion. Relatives, or people paid by them, often guarded new graves for a period after burial.
Murders
Gang of Burkers
John Bishop, together with Thomas Williams, Michael Shields, a Covent Garden porter, and James May, an unemployed butcher, also known as Jack Stirabout and Black Eyed Jack, formed a notorious gang of resurrection men, stealing freshly buried bodies for sale to anatomists. In his subsequent confession, Bishop admitted to stealing (and selling) between 500 and 1,000 bodies, over a period of twelve years. The corpses were sold to anatomists, including su |
https://en.wikipedia.org/wiki/Exceptional%20divisor | In mathematics, specifically algebraic geometry, an exceptional divisor for a regular map
of varieties is a kind of 'large' subvariety of which is 'crushed' by , in a certain definite sense. More strictly, f has an associated exceptional locus which describes how it identifies nearby points in codimension one, and the exceptional divisor is an appropriate algebraic construction whose support is the exceptional locus. The same ideas can be found in the theory of holomorphic mappings of complex manifolds.
More precisely, suppose that
is a regular map of varieties which is birational (that is, it is an isomorphism between open subsets of and ). A codimension-1 subvariety is said to be exceptional if has codimension at least 2 as a subvariety of . One may then define the exceptional divisor of to be
where the sum is over all exceptional subvarieties of , and is an element of the group of Weil divisors on .
Consideration of exceptional divisors is crucial in birational geometry: an elementary result (see for instance Shafarevich, II.4.4) shows (under suitable assumptions) that any birational regular map that is not an isomorphism has an exceptional divisor. A particularly important example is the blowup
of a subvariety
:
in this case the exceptional divisor is exactly the preimage of . |
https://en.wikipedia.org/wiki/Zakai%20equation | In filtering theory the Zakai equation is a linear stochastic partial differential equation for the un-normalized density of a hidden state. In contrast, the Kushner equation gives a non-linear stochastic partial differential equation for the normalized density of the hidden state. In principle either approach allows one to estimate a quantity function (the state of a dynamical system) from noisy measurements, even when the system is non-linear (thus generalizing the earlier results of Wiener and Kalman for linear systems and solving a central problem in estimation theory). The application of this approach to a specific engineering situation may be problematic however, as these equations are quite complex. The Zakai equation is a bilinear stochastic partial differential equation. It was named after Moshe Zakai.
Overview
Assume the state of the system evolves according to
and a noisy measurement of the system state is available:
where are independent Wiener processes. Then the unnormalized conditional probability density of the state at time t is given by the Zakai equation:
where the operator
As previously mentioned, is an unnormalized density and thus does not necessarily integrate to 1. After solving for , integration and normalization can be done if desired (an extra step not required in the Kushner approach).
Note that if the last term on the right hand side is omitted (by choosing h identically zero), the result is a nonstochastic PDE: the familiar Fokker–Planck equation, which describes the evolution of the state when no measurement information is available.
See also
Kushner equation
Kalman filter
Wiener filter |
https://en.wikipedia.org/wiki/Clymenia%20%28plant%29 | Clymenia is a small genus of flowering plants in the family Rutaceae with two species. The genus is often included in Citrus.
Description
Clymenia forms a shrub or small tree, free of spines. Leaves feature a short, narrow petiole, which sets them apart from most other citrus, especially the papedas native to the same general area. Clymenia fruits are a small hesperidium, very similar to a citrus fruit. Sweet and lemony in flavor, the tangerine-sized fruits are highly segmented, with yellow pulp, and a leathery rind, similar to a true citrus fruit. They contain a large number of polyembryonic seeds. The fruit are eaten by the Bismarck islanders, who call it a-mulis (Namatanai).
Native to a handful of locations on Papua New Guinea and nearby islets, including New Ireland, New Britain and the Admiralty Islands, Clymenia is far more tropical than other citrus, and even in subtropical parts of the United States, it can only be grown in a greenhouse. Specimens thrived in greenhouses in Riverside, California, but perished when planted out in the arid climate. They are locally cultivated in indigenous villages, but have never been commercially cultivated.
Taxonomy
Cultivated locally for its sweet fruits on a handful of southwestern Pacific islands, Clymenia was originally considered an obscure citrus hybrid. Botanist Tyôzaburô Tanaka noted that Clymenia would hybridize with a few other citrus plants (notably kumquats), but otherwise was generally different from other citrus in many aspects of its appearance. Botanist Walter Tennyson Swingle proposed moving Clymenia out of Citrus, circumscribing the genus in 1939, naming it after a figure from Greek mythology, Clymene, an Orchomenian princess who was the mother of Atalanta. Swingle assumed that Clymenia and citrus evolved from a single common ancestor. In 2000, Berhow suggested that a close relationship existed between Clymenia and kumquats and that it might be a Citrofortunella, a kumquat hybrid with another cit |
https://en.wikipedia.org/wiki/Pregeometry%20%28model%20theory%29 | Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for "matroid". They were introduced by Gian-Carlo Rota with the intention of providing a less "ineffably cacophonous" alternative term. Also, the term combinatorial geometry, sometimes abbreviated to geometry, was intended to replace "simple matroid". These terms are now infrequently used in the study of matroids.
It turns out that many fundamental concepts of linear algebra – closure, independence, subspace, basis, dimension – are available in the general framework of pregeometries.
In the branch of mathematical logic called model theory, infinite finitary matroids, there called "pregeometries" (and "geometries" if they are simple matroids), are used in the discussion of independence phenomena. The study of how pregeometries, geometries, and abstract closure operators influence the structure of first-order models is called geometric stability theory.
Motivation
If is a vector space over some field and , we define to be the set of all linear combinations of vectors from , also known as the span of . Then we have and and . The Steinitz exchange lemma is equivalent to the statement: if , then
The linear algebra concepts of independent set, generating set, basis and dimension can all be expressed using the -operator alone. A pregeometry is an abstraction of this situation: we start with an arbitrary set and an arbitrary operator which assigns to each subset of a subset of , satisfying the properties above. Then we can define the "linear algebra" concepts also in this more general setting.
This generalized notion of dimension is very useful in model theory, where in certain situation one can argue as follows: two models with the same cardinality must have the same dimension and two models with the same dimension must be isomorphic.
Definitions
Pregeometries and geometries
A combinatorial pregeometry (also known as a finitary matroid) is a pair , where is a set and (calle |
https://en.wikipedia.org/wiki/Methyl%20butyrate | Methyl butyrate, also known under the systematic name methyl butanoate, is the methyl ester of butyric acid. Like most esters, it has a fruity odor, in this case resembling apples or pineapples. At room temperature, it is a colorless liquid with low solubility in water, upon which it floats to form an oily layer. Although it is flammable, it has a relatively low vapor pressure (40 mmHg at ), so it can be safely handled at room temperature without special safety precautions.
Methyl butyrate is present in small amounts in several plant products, especially pineapple oil. It can be produced by distillation from essential oils of vegetable origin, but is also manufactured on a small scale for use in perfumes and as a food flavoring.
Methyl butyrate has been used in combustion studies as a surrogate fuel for the larger fatty acid methyl esters found in biodiesel. However, studies have shown that, due to its short-chain length, methyl butyrate does not reproduce well the negative temperature coefficient (NTC) behaviour and early CO2 formation characteristics of real biodiesel fuels. Therefore, methyl butyrate is not a suitable surrogate fuel for biodiesel combustion studies. |
https://en.wikipedia.org/wiki/Little%20q-Jacobi%20polynomials | In mathematics, the little q-Jacobi polynomials pn(x;a,b;q) are a family of basic hypergeometric orthogonal polynomials in the basic Askey scheme, introduced by . give a detailed list of their properties.
Definition
The little q-Jacobi polynomials are given in terms of basic hypergeometric functions by
Gallery
The following are a set of animation plots for Little q-Jacobi polynomials, with varying q;
three density plots of imaginary, real and modulus in complex space; three set of complex 3D plots
of imaginary, real and modulus of the said polynomials. |
https://en.wikipedia.org/wiki/Videoton%20%28company%29 | Videoton, officially VIDEOTON HOLDING Ltd. is a privately-owned company group based out of Székesfehérvár, Hungary and specializing in contract manufacturing (mainly EMS). The company was founded in 1938 and it became well known among the Warsaw Pact/Comecon countries for supplying stadium-sized electronic scoreboards. In 1991 the company was privatized and since then Videoton has provided contract manufacturing services for its partners.
It ranks 33rd globally and 3rd in EU according to the 2021 EMS-ranking of Manufacturing Market Insider magazine. The estimated value of the group (consisting of 21 member companies) is 640 million Euro according to the 2022 survey of Forbes. The company has 11 locations, 9 in Hungary, 1 in Bulgaria and 1 in Serbia.
History
1938-1991: The early years and the state era of VIDEOTON
The legal predecessor of VIDEOTON was founded in 1938. After World War II, the company was rebuilt, and owned by the state between 1955-1991. It developed, produced and sold Videoton branded consumer, computer and defense electronics. The company's named officially became VIDEOTON Electronics in 1981. After the political changes in the early 90s – especially due to the cancelled orders of the East-European market – the company got into difficult situation, causing its liquidation to begin in 1991. The current shareholders and Hungarian Credit Bank and Euroinvest Ltd. acquired the company's assets in a public tender.
1991-1995: Consolidation and building out the contract manufacturing structure
The re-organized company continued its contract manufacturing activity mainly with legacy projects (RCD2 precision mechanical assembly for Philips, speakers for Opel and oil pumps for SHW). After the crisis management the intense market and contact building work started, and the first outsourcing projects took place mainly for entertainment-, automation- and automotive industry customers (Mars Electronics, AFL).
In connection with the IBM Slider project, the pr |
https://en.wikipedia.org/wiki/AyosDito.ph | AyosDito.ph was an online classified-ads website for Filipinos to buy and sell online, regardless of their location in the Philippines. It was owned and operated by 701Search Pte. Ltd., which is a joint venture between media giants Singapore Press Holdings and Schibsted. Launched in March 2009, AyosDito offered free posting of ads for items such as properties, cars, electronics, food, and even jobs. The phrase "Ayos Dito" is Tagalog for "Ok here". By 2013, it became the second largest online classified ads website in the Philippines.
In 2015 AyosDito formed a merger with OLX Philippines, itself acquiring former classifieds site Sulit in December 2013. Classifieds from the old site were not automatically merged with OLX, with users being sent emails asking if they want to migrate their listings to the new platform. |
https://en.wikipedia.org/wiki/Sedentary%20lifestyle | Sedentary lifestyle is a lifestyle type, in which one is physically inactive and does little or no physical movement and or exercise. A person living a sedentary lifestyle is often sitting or lying down while engaged in an activity like socializing, watching TV, playing video games, reading or using a mobile phone or computer for much of the day. A sedentary lifestyle contributes to poor health quality, diseases as well as many preventable causes of death.
Sitting time is a common measure of a sedentary lifestyle. A global review representing 47% of the global adult population found that the average person sits down for 4.7 to 6.5 hours a day with the average going up every year. The CDC found that 25.3% of all American adults are physically inactive.
Screen time is a term for the amount of time a person spends looking at a screen such as a television, computer monitor, or mobile device. Excessive screen time is linked to negative health consequences.
Definition
Sedentary behavior is not the same as physical inactivity: sedentary behavior is defined as "any waking behavior characterized by an energy expenditure less than or equal to 1.5 metabolic equivalents (METs), while in a sitting, reclining or lying posture". Spending most waking hours sitting does not necessarily mean that an individual is sedentary, though sitting and lying down most frequently are sedentary behaviors. Esmonde-White defines a sedentary lifestyle as a lifestyle that involves "longer than six hours a day" of sedentary behavior.
Health effects
Effects of a sedentary work life or lifestyle can be either direct or indirect. One of the most prominent direct effect of a sedentary lifestyle is an increased BMI leading to obesity. A lack of physical activity is one of the leading causes of preventable death worldwide.
At least 300,000 premature deaths, and $90 billion in direct healthcare costs are caused by obesity and sedentary lifestyle per year in the US alone. The risk is higher among those |
https://en.wikipedia.org/wiki/Monotropism | Monotropism is a person's tendency to focus their attention on a small number of interests at any time, tending to miss things outside of this attention tunnel. This cognitive strategy is posited to be the central underlying feature of autism. The theory of monotropism was developed by Dinah Murray, Wenn Lawson and Mike Lesser starting in the 1990s, and first published in 2005. Lawson's further work on the theory formed the basis of his PhD, Single Attention and Associated Cognition in Autism, and book The Passionate Mind published in 2011.
A tendency to focus attention tightly has a number of psychological implications. While monotropism tends to cause people to miss things outside their attention tunnel, within it their focused attention can lend itself to intense experiences, deep thinking and flow states. However, this hyperfocus makes it harder to redirect attention, including starting and stopping tasks, leading to what is often described as executive dysfunction in autism, and stereotypies or perseveration where a person's attention is repeatedly pulled back to the same thing.
Monotropism has of 2018 been historically neglected, but has been seeing increased interest, despite a lack of competitor theories that explain all the features rather than just some features of autism and the fact it is relatively popular among autistic people themselves. This may be due in part to the field's historical tendency to ignore autistic narratives and experiences (which being internal are not readily outside accessible) and focus on experimental results done by non-autistic researchers, a tendency that is only recently been started to be corrected for as researchers pay more attention to autistic people's own accounts of themselves. As late as 2021, there was a protest by autistic people against bad autism research, and no research on melt-down related suicides which is a commonly accepted concept in autistic circles yet completely untouched in research studies on autisti |
https://en.wikipedia.org/wiki/Kalman%20decomposition | In control theory, a Kalman decomposition provides a mathematical means to convert a representation of any linear time-invariant (LTI) control system to a form in which the system can be decomposed into a standard form which makes clear the observable and controllable components of the system. This decomposition results in the system being presented with a more illuminating structure, making it easier to draw conclusions on the system's reachable and observable subspaces.
Definition
Consider the continuous-time LTI control system
,
,
or the discrete-time LTI control system
,
.
The Kalman decomposition is defined as the realization of this system obtained by transforming the original matrices as follows:
,
,
,
,
where is the coordinate transformation matrix defined as
,
and whose submatrices are
: a matrix whose columns span the subspace of states which are both reachable and unobservable.
: chosen so that the columns of are a basis for the reachable subspace.
: chosen so that the columns of are a basis for the unobservable subspace.
: chosen so that is invertible.
It can be observed that some of these matrices may have dimension zero. For example, if the system is both observable and controllable, then , making the other matrices zero dimension.
Consequences
By using results from controllability and observability, it can be shown that the transformed system has matrices in the following form:
This leads to the conclusion that
The subsystem is both reachable and observable.
The subsystem is reachable.
The subsystem is observable.
Variants
A Kalman decomposition also exists for linear dynamical quantum systems. Unlike classical dynamical systems, the coordinate transformation used in this variant requires to be in a specific class of transformations due to the physical laws of quantum mechanics.
See also
Realization (systems)
Observability
Controllability |
https://en.wikipedia.org/wiki/Nuclear%20run-on | A nuclear run-on assay is conducted to identify the genes that are being transcribed at a certain time point. Approximately one million cell nuclei are isolated and incubated with labeled nucleotides, and genes in the process of being transcribed are detected by hybridization of extracted RNA to gene specific probes on a blot. Garcia-Martinez et al. (2004) developed a protocol for the yeast S. cerevisiae (Genomic run-on, GRO) that allows for the calculation of transcription rates (TRs) for all yeast genes to estimate mRNA stabilities for all yeast mRNAs.
Alternative microarray methods have recently been developed, mainly PolII RIP-chip: RNA immunoprecipitation of RNA polymerase II with phosphorylated C-terminal domain directed antibodies and hybridization on a microarray slide or chip (the word chip in the name stems from "ChIP-chip" where a special Affymetrix GeneChip was required). A comparison of methods based on run-on and ChIP-chip has been made in yeast (Pelechano et al., 2009). A general correspondence of both methods has been detected but GRO is more sensitive and quantitative. It has to be considered that run-on only detects elongating RNA polymerases whereas ChIP-chip detects all present RNA polymerases, including backtracked ones.
Attachment of new RNA polymerase to genes is prevented by inclusion of sarkosyl. Therefore only genes that already have an RNA polymerase will produce labeled transcripts. RNA transcripts that were synthesized before the addition of the label will not be detected as they will lack the label. These run on transcripts can also be detected by purifying labeled transcripts by using antibodies that detect the label and hybridizing these isolated transcripts with gene expression arrays or by next generation sequencing (GRO-Seq).
Run on assays have been largely supplanted with Global Run on assays that use next generation DNA sequencing as a readout platform. These assays are known as GRO-Seq and provide an incredibly detailed view |
https://en.wikipedia.org/wiki/Food%20contact%20materials | Food contact materials are materials that are intended to be in contact with food. These can be things that are quite obvious like a glass or a can for soft drinks as well as machinery in a food factory or a coffee machine.
Food contact materials can be constructed from a variety of materials, including plastics, rubber, paper, coatings, metal, etc. In many cases, a combination is used; for example, a carton box for juices can include (from the inside to the outside) a plastic layer, aluminum, paper, printing, and top coating.
During contact with the food, molecules can migrate from the food contact material to the food, for example, via blooming. Because of this, in many countries, regulations are made to ensure food safety.
Food safe symbol
The international symbol for "food safe" material is a wine glass and a fork symbol. The symbol indicates that the material used in the product is considered safe for food contact. This includes food and water containers, packaging materials, cutlery etc. The regulation is applicable to any product intended for food contact whether it be made of metals, ceramics, paper and board, and plastics or the coating. Use of the symbol is more significant in products which should be explicitly identified whether food safe or not, i.e. wherever there is an ambiguity whether the container could be used to hold foodstuffs. The symbol is used in North America, Europe and parts of Asia. It is mandatory for products sold in Europe after the Framework Regulation EC 1935/2004.
In plastic containers, over and above the prescribed resin identification codes (viz; , , , ), the food safe assurance is required because the resin identification codes do not explicitly communicate the food safe property (or more significantly, the lack of it).
Even though the legal requirement in various nations would be different, the food safe symbol generally assures that:
The container surface is free of any toxic contaminants which could be contacted from th |
https://en.wikipedia.org/wiki/SLC22A12 | Solute carrier family 22 (organic anion/cation transporter), member 12, also known as SLC22A12 and URAT1, is a protein which in humans is encoded by the SLC22A12 gene.
Function
The protein encoded by this gene is a urate transporter and urate-anion exchanger which regulates the level of urate in the blood. This protein is an integral membrane protein primarily found in kidney. Two transcript variants encoding different isoforms have been found for this gene.
Clinical significance
Numerous single nucleotide polymorphisms of this gene are significantly associated with altered (increased or decreased) reabsorption of uric acid by the kidneys. Respectively, these altered rates of reabsorption contribute to hyperuricemia and hypouricemia.
Interactions
SLC22A12 has been shown to interact with PDZK1.
Inhibition
Lesinurad and dotinurad are urate transporter inhibitors that have been approved to treat gout. Lesinurad enhances urate excretion by inhibition the tubular re-absorption. Probenecid also facilitates uric acid secretion.
See also
Solute carrier family |
https://en.wikipedia.org/wiki/SCAA%20Family | SCAA Family is a group of mascots for the Hong Kong First Division League football team South China ("SCAA"). They were officially created and released to the public on 20 September 2007. There are in total 10 members, of which 8 are named. Ballman and Greenman are the main characters.
Characters
Ballman
Name in Chinese: 波南
D.O.B.: 1 November
Jersey Number: 10 (Home Jersey)
Favourite food: Banana
Ballman's head is a burning football whose hair is on fire. He represents the fans' unstoppable love on football and the joy from watching football matches. He also symbolizes the SCAA players' attitude on the field and the spirit of fighting until the end.
Ballman has many real-life interactions with SCAA Fans. He has his own online blog, which was opened on 11 October 2007.
TVB artist Wong Cho Lam dubs the voice for Ballman in Ballman Blog's videos.
Greenman
Name in Chinese: 草南
D.O.B.: 11 January
Jersey Number: 9 (Away Jersey)
Favourite food: Juice
Greenman is a good friend of Ballman and they are buddies in football field. Greenball was born from the grass and he is fresh, pure, young, energetic and full of vitality. He symbolizes the youth players of SCAA, who are full of energy and aim at becoming the next football stars of the future.
Greenman's debut show-up was during the "Ballman & Greenman Show-up Party" held in Times Square on 26 November 2007.
Greenman made his voice debut in Ballman Blog's video on 31 December 2007, featuring in the New Year song of Ballman. However, the voice might only be made by Wong Cho Lam, the voice maker of Ballman.
Whistle Sir
Name in Chinese: 哨子sir
Whistle Sir is a just and fair referee. He loves running.
Yellow & Red Card Brothers
Name in Chinese: 紅黃牌兄弟
Yellow & Red Card Brothers a followers of Whistle Sir and they never reject Whistle Sir's decisions.
Mr. Scoreboard
Name in Chinese: 顯示牌先生
Mr. Scoreboard is very sensitive to numbers and he is good at resources allocation.
Dr. First-Aid-Kid
Name in Chinese: Dr |
https://en.wikipedia.org/wiki/Rhyniella | Rhyniella is a genus of fossil springtails (Collembola) from the Rhynie chert, which formed during the Pragian stage of the Early Devonian. One species has been described, Rhyniella praecursor. For some time it was believed to be the only hexapod from the Early Devonian ( )
History
Its remains were discovered in 1919. Reconstructed from the scattered bits and pieces of its exoskeleton, R. praecursor was described in 1926, and at first believed to be a larval insect. This study also described euthycarcinoid Heterocrania, and supposed larval insect mouthparts, later redescribed as Rhyniognatha hirsti in 1928 and considered as an insect or myriapod.
Description
Rhyniella grew to a length of about 1–2 mm and would have been a scavenger, feeding on rotting matter. |
https://en.wikipedia.org/wiki/Topology%20%28chemistry%29 | In chemistry, topology provides a way of describing and predicting the molecular structure within the constraints of three-dimensional (3-D) space. Given the determinants of chemical bonding and the chemical properties of the atoms, topology provides a model for explaining how the atoms ethereal wave functions must fit together. Molecular topology is a part of mathematical chemistry dealing with the algebraic description of chemical compounds so allowing a unique and easy characterization of them.
Topology is insensitive to the details of a scalar field, and can often be determined using simplified calculations. Scalar fields such as electron density, Madelung field, covalent field and the electrostatic potential can be used to model topology.
Each scalar field has its own distinctive topology and each provides different information about the nature of chemical bonding and structure. The analysis of these topologies, when combined with simple electrostatic theory and a few empirical observations, leads to a quantitative model of localized chemical bonding. In the process, the analysis provides insights into the nature of chemical bonding.
Applied topology explains how large molecules reach their final shapes and how biological molecules achieve their activity.
Circuit topology is a topological property of folded linear polymers. It describes the arrangement of intra-chain contacts. Contacts can be established by intra-chain interactions, the so called hard contacts (h-contacts), or via chain entanglement or soft contacts (s-contacts). This notion has been applied to structural analysis of biomolecules such as proteins, RNAs, and genome.
Topological indices
It is possible to set up equations correlating direct quantitative structure activity relationships with experimental properties, usually referred to as topological indices (TIs). Topological indices are used in the development of quantitative structure-activity relationships (QSARs) in which the biolog |
https://en.wikipedia.org/wiki/Scott%20Kriens | Scott Kriens is an American businessman. He is chairman and former CEO of Juniper Networks.
Early life and education
Kriens received his Bachelor of Arts in Economics from California State University, East Bay, in Hayward, California, in 1979. A collector of European sports cars, Kriens, as an undergraduate, had repaired cars to meet expenses.
Career
Kriens began his marketing career with Burroughs Corporation, which merged with Sperry in 1986 to form Unisys, and then worked for Tandem Computers, before becoming a co-founder of telecommunications equipment company StrataCom, Inc. in 1986. From 1986 to 1996 Kriens was vice president of sales and operations, until Stratacom was acquired for $4.5 billion by Cisco.
Crosspoint Venture Partners subsequently recruited Kriens to lead Juniper Networks, naming him CEO in October 1996, where he remained until September 2008. Juniper's market success is largely credited to Kriens. Juniper's stock rose from $57 per share, at the start of 2000, to an all-time high of $243 per share, in mid-October 2000. In 2008, Kevin Johnson became CEO of Juniper, while Kriens remained as chairman.
Kriens was ranked 463rd on the Forbes Executive Pay in 2006, 478th in 2007 and 454th in 2008
He was the U.S. Winner of the EY Entrepreneur of The Year Award in 2000 with Juniper Networks
1440 Foundation and 1440 Multiversity
In 2010, Kriens, with his wife, Joanie, established the 1440 Foundation and the 1440 Multiversity retreat center in the redwoods of Scotts Valley, California. |
https://en.wikipedia.org/wiki/Popcat | Popcat is an Internet meme originating in October 2020, in a series of videos which showcase two images of a domestic short-haired cat named 'Oatmeal', where one image has its mouth closed and the other has its mouth open, with the second image being edited to give its mouth an 'O' shape. The meme was later created into a popular game.
Oatmeal is a cat owned by a Twitter user named Xavier BFB, who first started the meme by posting to a private Discord server a video of Oatmeal chirping at a bug in mid-October 2020. It was then turned into a gif and posted on the reddit subreddit Meow IRL on October 9 by a friend of Xavier BFB. On 10 October, it was reposted onto Twitter where it gained over a million views. This sudden popularity then led to Xavier BFB uploading to Twitter the original video of Oatmeal chirping at a bug on 11 October. However, it would be until it was utilized in music videos on Instragam where the gif was synced to the music to give the belief that Oatmeal was singing, that it would become popular. Its popularity in music videos would also lead the meme to become known as 'wide-mouth singing cat'.
Game
A game around the meme, called Popcat.click, would be later be launced on 11 December 2020, by three students from the University of Sheffield in the United Kingdom: Freddy Heppell, Joshua O’Sullivan, and Edward Hails. The game revolved around the user clicking on an image of Oatmeal, in which the cat opens its mouth the same way it did in the viral memes. Each click contributes to their user's nation rank on a leaderboard. As of 20 August 2023, the leaderboard consists of 229 nations; with Hong Kong, Taiwan and Thailand being in the top 3; whilst Guinea-Bissau, São Tomé and Príncipe and North Korea are ranked as the bottom three.
Spread
In a similar way to the online meme, the effects of the COVID-19 pandemic increased its popularity as many people gained more free time due to lockdowns. On 9 February 2021, the game launced an official Twitter |
https://en.wikipedia.org/wiki/Supervised%20injection%20site | Supervised injection sites (SIS) are medically supervised facilities designed to provide a hygienic environment in which people are able to consume illicit recreational drugs intravenously and prevent deaths due to drug overdoses. Proponents say they saves lives and connect users to services while opponents believe they promote drug use and attract crime to the community around the site. The legality of such a facility is dependent by location and political jurisdiction. Supervised injection sites are part of a harm reduction approach towards drug problems. The facilities provide sterile injection equipment, information about drugs and basic health care, treatment referrals, access to medical staff, and, at some facilities, counseling. Most programs prohibit the sale or purchase of recreational drugs at the facility.
Terminology
Supervised injection sites are also known as overdose prevention centers (OPC), supervised injection facilities, safe consumption rooms, safe injection sites, safe injection rooms, fix rooms, fixing rooms, safer injection facilities (SIF), drug consumption facilities (DCF), drug consumption rooms (DCRs), and harm reduction centers.
Facilities
Australia
"Shooting galleries" (the term "shooting" is slang for injecting drugs) have existed for a long time; there were illicit for-profit facilities in Sydney, Australia during the 1990s. Authors differentiated the legally sanctioned sites in Australia from those examples in the care they provide. While the operators of the shooting galleries exemplified in Sydney had little regard for the health of their clients, modern supervised injection facilities are a professionally staffed health and welfare service. The same journal describes the same facility in Australian context as "in general" may be defined as "legally sanctioned and supervised facilities designed to reduce the health and public order problems associated with illegal injection drug use"
The legality of supervised injection is h |
https://en.wikipedia.org/wiki/MySQL%20Enterprise | MySQL Enterprise is a subscription-based service produced by Oracle Corporation and targeted toward the commercial market. Oracle's official support, training and certification focus on MySQL Enterprise.
MySQL Enterprise contains
MySQL Enterprise Server software, a distribution of the MySQL Server
MySQL Enterprise Monitor
MySQL Enterprise Backup
MySQL Enterprise Audit
MySQL Enterprise Firewall
MySQL Workbench Standard Edition
Production Support
New versions of MySQL Enterprise Server are released monthly as Rapid Updates (MRUs), and quarterly as Service Packs (QSPs).
Relationship to free or community versions
MySQL Enterprise Edition was created by MySQL AB as a commercial product, available for purchase as a subscription. It has been continued by Sun, and Oracle.
External links
MySQL Enterprise Server
MySQL |
https://en.wikipedia.org/wiki/Tharra | Tharra (Hindi: ठर्रा, Urdu: ٹھرا) is a type of Desi daru which is locally, and often illegally, brewed alcoholic drink in the Indian subcontinent, mainly India and Pakistan. It is made from yeast fermentation of sugarcane, or wheat husk, especially in Bihar, Uttar Pradesh, Punjab and Haryana. Since it is usually made from sugarcane, it is often viewed as a crude rum.
Preparation
Due to the pungent smell of the distilling process, Tharra is often prepared in remote fields, away from human settlements. It recycles some of the waste products of the agricultural economy of the region.
Health concerns
According to a study done in Pakistan, homemade liquor Tharra contain many impurities and is often injurious to health.
Local economy
It is often consumed by poor or landless tillers, typically distilled with the connivance of officials and police officers, generating large profits.
See also
Desi daru
Kilju |
https://en.wikipedia.org/wiki/Volumetric%20haptic%20display | A volumetric haptic display (VHD) is similar to a (visual) volumetric display, but informs touch instead of vision. A VHD projects a touch-based representation of a surface onto a 3D volumetric space. Users can feel the projected surface(s), usually with their hands. The display is otherwise not detectable, and offers no visual feedback. There are no known instances of a fully operational VHD at this time.
Technological implementation
The University of Bristol has developed a method for haptic feedback that could be integrated into a volumetric display. The system uses focused ultrasound to create a haptic object in mid air.
Feedback
The following feedback can be provided to the user:
Surface contact
Surface texture
Vibration
Motion-based/topological changes of surface
See also
Optacon (two-dimensional)
Refreshable Braille Display (two-dimensional).
Wired glove (partial 3D representation). |
https://en.wikipedia.org/wiki/Anna%20Ridler | Anna Ridler (born 1985) is an artist and researcher who lives and works in London. She works with collections of information or data, particularly self-generated data sets, to create new and unusual narratives in a variety of mediums.
Her work has been exhibited widely at cultural institutions including the Victoria and Albert Museum, Tate Modern, Barbican Centre, Centre Pompidou, The Photographers' Gallery, ZKM Center for Art and Media Karlsruhe, and Ars Electronica.
Biography
Born in London in 1985, Ridler spent her childhood raised between Atlanta, Georgia and the United Kingdom. She obtained a Bachelor of Arts in English Literature and Language from Oxford University in 2007 and a Master of Arts in Information Experience Design from the Royal College of Art in 2017.
Art
A core element of Ridler's work lies in the creation of handmade data sets through a laborious process of selecting and classifying images and text. By creating her own data sets, Ridler is able to uncover and expose underlying themes and concepts while also inverting the usual process of scraping pre-classified images found in large databases on the internet. Her interests are in drawing, machine learning, data collection, storytelling, and technology.
Selected works
Some of Anna Ridler's most notable works to date fall within her ‘tulip series’ which explores the hysteria around tulip mania and compares it to the speculation and bubbles surrounding cryptocurrencies. The series is expressed in three forms: a photographic dataset in Myriad (Tulips), 2018; two iterations of machine generated videos in Mosaic Virus (2018) and Mosaic Virus (2019); and a website with an accompanied functioning decentralized application in Bloemenveiling (2019).
Myriad (Tulips) (2018)
Myriad (Tulips) (2018) is an installation of ten thousand hand-labeled photographs forming a dataset of unique tulips. The ten thousand, or myriad of, photographs were taken by Ridler over the course of three months, roughly the |
https://en.wikipedia.org/wiki/Meme%20coin | A meme coin (also spelled memecoin) is a cryptocurrency that originated from an Internet meme or has some other humorous characteristic. It may be used in the broadest sense as a critique of the cryptocurrency market in its entirety—those based on particular memes such as "doge coins", celebrities like Coinye, and pump-and-dump schemes such as BitConnect—or it may be used to make cryptocurrency more accessible. The term is often dismissive, comparing the value or performances of those cryptocurrencies to that of mainstream ones. Supporters, on the other hand, observe that some memecoins have acquired social currency and high market capitalizations.
In late 2013, Dogecoin was released after being created as a joke on the Doge meme by software engineers. This sparked the creation of several subsequent meme coins. In October 2021, there were about 124 meme coins circulating in the market. Notable examples include Dogecoin and Shiba Inu.
In late 2021, advertisements promoting the meme coin Floki Inu in London led to subsequent investigations around promoting the meme coin, considered to be an unregulated financial product by the ASA (The Advertising Standards Authority).
Some countries have taken steps to regulate meme coins. In early 2021, Thailand's Securities and Exchange Commission banned meme coins as part of a crackdown on digital goods with "no clear objective or substance".
Popularity
Meme coins have surged in popularity since Elon Musk endorsed the use of Dogecoin, one of the first meme coins. He continues to post tweets about Dogecoin in 2022, including one in January where he stated he would eat a Happy Meal from McDonald's on live TV if they started accepting Dogecoin as payment. The risk of losing money is significant. However, some projects seem to be successful and sustainable over time. |
https://en.wikipedia.org/wiki/Cachexia | Cachexia () is a complex syndrome associated with an underlying illness, causing ongoing muscle loss that is not entirely reversed with nutritional supplementation. A range of diseases can cause cachexia, most commonly cancer, congestive heart failure, chronic obstructive pulmonary disease, chronic kidney disease, and AIDS. Systemic inflammation from these conditions can cause detrimental changes to metabolism and body composition. In contrast to weight loss from inadequate caloric intake, cachexia causes mostly muscle loss instead of fat loss. Diagnosis of cachexia can be difficult due to the lack of well-established diagnostic criteria. Cachexia can improve with treatment of the underlying illness but other treatment approaches have limited benefit. Cachexia is associated with increased mortality and poor quality of life.
The term is from Greek κακός kakos 'bad' and ἕξις hexis 'condition'.
Causes
Cachexia can be caused by diverse medical conditions, but is most often associated with end-stage cancer, known as cancer cachexia. About 50% of all cancer patients develop cachexia. Those with upper gastrointestinal and pancreatic cancers have the highest frequency of developing a cachexic symptom. Prevalence of cachexia rises in more advanced stages and is estimated to affect 80% of terminal cancer patients.
Congestive heart failure, AIDS, chronic obstructive pulmonary disease, and chronic kidney disease are other conditions that often cause cachexia. Cachexia can also be the result of advanced stages of cystic fibrosis, multiple sclerosis, motor neuron disease, Parkinson's disease, dementia, tuberculosis, multiple system atrophy, mercury poisoning, Crohn's disease, trypanosomiasis, rheumatoid arthritis, and celiac disease as well as other systemic diseases.
Mechanism
The exact mechanism in which these diseases cause cachexia is poorly understood, and likely is multifactorial with multiple disease pathways involved. Inflammatory cytokines appear to play a central ro |
https://en.wikipedia.org/wiki/Monooxygenase | Monooxygenases are enzymes that incorporate one hydroxyl group (−OH) into substrates in many metabolic pathways. In this reaction, the two atoms of dioxygen are reduced to one hydroxyl group and one H2O molecule by the concomitant oxidation of NAD(P)H. One important subset of the monooxygenases, the cytochrome P450 omega hydroxylases, is used by cells to metabolize arachidonic acid (i.e. eicosatetraenoic acid) to the cell signaling molecules, 20-hydroxyeicosatetraenoic acid or to reduce or totally inactivate the activate signaling molecules for example by hydroxylating leukotriene B4 to 20-hydroxy-leukotriene B5, 5-hydroxyeicosatetraenoic acid to 5,20-dihydroxyeicosatetraenoic acid, 5-oxo-eicosatetraenoic acid to 5-oxo-20-hydroxyeicosatetraenoic acid, 12-hydroxyeicosatetraenoic acid to 12,20-dihydroxyeicosatetraenoic acid, and epoxyeicosatrienoic acids to 20-hydroxy-epoxyeicosatrienoic acids.
Classification
They are classified as oxidoreductase enzymes that catalyze an electron transfer.
Related structures
2XDO
2XYO
2Y6R
Human proteins containing this domain
COQ6; CYP450; MICAL1; MICAL2; MICAL2PV1; MICAL2PV2; MICAL3;
See also
ABM domain |
https://en.wikipedia.org/wiki/NonStop%20SQL | NonStop SQL is a commercial relational database management system that is designed for fault tolerance and scalability, currently offered by Hewlett Packard Enterprise. The latest version is SQL/MX 3.4.
The product was originally developed by Tandem Computers. Tandem was acquired by Compaq in 1997. Compaq was later acquired by Hewlett-Packard in 2002. When Hewlett-Packard split in 2015 into HP Inc. and Hewlett Packard Enterprise, NonStop SQL and the rest of the NonStop product line went to Hewlett Packard Enterprise.
The product primarily is used for online transaction processing and is tailored for organizations that need high availability and scalability for their database system. Typical users of the product are stock exchanges, telecommunications, POS, and bank ATM networks.
History
NonStop SQL is designed to run effectively on parallel computers, adding functionality for distributed data, distributed execution, and distributed transactions.
First released in 1987, a second version in 1989 added the ability to run queries in parallel, and the product became fairly famous for being one of the few systems that scales almost linearly with the number of processors in the machine: adding a second CPU to an existing NonStop SQL server almost exactly doubled its performance.
The second version added /MP to its name, for Massively Parallel. A third version, NonStop SQL/MX, created a product that was more ANSI SQL compliant than its predecessor. NonStop SQL/MX has shipped on the NonStop platform since 2002, and can access tables created by NonStop SQL/MP, although only "Native SQL/MX tables" offer the ANSI compliance and many "Oracle-like" enhancements. The HP Neoview business intelligence platform was built using NonStop SQL as its origins. NonStop SQL/MX is HP's only OLTP database product.
Parts of the Neoview code base were open-sourced in 2014 under the name Trafodion, which is now a top-level Apache project.
See also
List of relational database management |
https://en.wikipedia.org/wiki/Dinoseb | Dinoseb is a common industry name for 6-sec-butyl-2,4-dinitrophenol, a herbicide in the dinitrophenol family. It is a crystalline orange solid which does not readily dissolve in water. Dinoseb is banned as an herbicide in the European Union (EU) and the United States because of its toxicity.
It also finds use as a polymerisation inhibitor, where it is often referred to as DNBP. It is used to prevent the thermally induced polymerisation of styrene and other unsaturated monomers when they are being purified by distillation.
History
In 1892, dinitro-ortho-cresol (2,4-dinitro-6-methylphenol), a chemical compound closely related to dinoseb, was discovered in Germany and first used as an insecticide. It was later also used as an herbicide and also fungicide after those characteristics were discovered. In 1945 the ortho-methyl group was replaced by a sec-butyl group, producing dinoseb. This compound had a superior contact and stomach activity on insects and mites. Dinoseb became commercially available in 1945 and was approved for use in the United States based on safety data from Industrial Bio-Test Laboratories. On January 13, 1984 the Danish ship Dana Optima lost 80 drums of Dinoseb during their trip from North Shields, England to Esbjerg, Denmark. After four months 72 drums were found and recovered. Dinoseb was withdrawn from the market in 1986 due to an increased threat of birth defects after female field workers were exposed to the chemical. It could also cause sterility in men who were exposed to the chemical.
Uses
Dinoseb is an herbicide that was once widely used for weed-control when producing crops like soybeans, vegetables, fruits and nuts, or citrus. In the present, dinoseb is banned in the EU, and the United States due to its high toxicity. However, dinoseb is still used in China for example; evidenced by the fact that it is found in rain- and drinking water. Nowadays there are other, safer herbicides that can be used. Dinoseb was also used as an insecticid |
https://en.wikipedia.org/wiki/Gregory%20Garibian | Gregory Markari (Markarovich) Garibian (December 13, 1924 – June 8, 1991) was a Soviet Armenian physicist, academician-secretary of the Department of Physics and Mathematics of the Armenian Academy of Sciences (AS)(1973–1991). He is known for developing the Theory of Transition Radiation and showing the feasibility of functional transition radiation detectors (TRDs). [8] [9]
Biography
G.M.Garibian was born in 1924 in Tiflis (now - Tbilisi, Georgia) in a family of a Medical Doctor and a homemaker. Eventually the family moved to Baku (Azerbaijan) where Garibian got his general education. In 1943 he graduated from school in Baku and went to Moscow. Physical science was Garibian's passion in life. Even at a very young age he followed news in the world of physics and was very excited when in 1942 he learned about the Alikhanian brothers’ expedition to Mount Aragats (Armenia) in order to search for protons in cosmic rays. Garibian was accepted into the Department of Physics and Mathematics of Moscow State University which he graduated from in 1948 immediately to leave for Yerevan and join the Yerevan Physics Institute, which was founded by Artyom Alikhanian in 1943. After that time Garibian dedicated himself to scientific research in Theoretical physics, in the fields of Quantum electrodynamics, Cosmic rays, and High energy particles. All his life he worked at the Yerevan Physics Institute consecutively as researcher, scientific secretary of the institute, deputy director and head of laboratory. He actively participated in the creation of the Yerevan Synchrotron and also in the establishment of high-altitude cosmic ray stations on Mount Aragats.
Garibian's main scientific achievement was the discovery of X-Ray Transition Radiation and the development of the Theory of Transition Radiation. He also showed the feasibility of a functional Transition Raditation Detector (TRD) - a tool for identification of high energy ultrarelativistic particles.
In the end of the 1940s a |
https://en.wikipedia.org/wiki/Brownian%20tree | In probability theory, the Brownian tree, or Aldous tree, or Continuum Random Tree (CRT) is a random real tree that can be defined from a Brownian excursion. The Brownian tree was defined and studied by David Aldous in three articles published in 1991 and 1993. This tree has since then been generalized.
This random tree has several equivalent definitions and constructions: using sub-trees generated by finitely many leaves, using a Brownian excursion, Poisson separating a straight line or as a limit of Galton-Watson trees.
Intuitively, the Brownian tree is a binary tree whose nodes (or branching points) are dense in the tree; which is to say that for any distinct two points of the tree, there will always exist a node between them. It is a fractal object which can be approximated with computers or by physical processes with dendritic structures.
Definitions
The following definitions are different characterisations of a Brownian tree, they are taken from Aldous's three articles. The notions of leaf, node, branch, root are the intuitive notions on a tree (for details, see real trees).
Finite-dimensional laws
This definition gives the finite-dimensional laws of the subtrees generated by finitely many leaves.
Let us consider the space of all binary trees with leaves numbered from to . These trees have edges with lengths . A tree is then defined by its shape (which is to say the order of the nodes) and the edge lengths. We define a probability law of a random variable on this space by:
where .
In other words, depends not on the shape of the tree but rather on the total sum of all the edge lengths.
In other words, the Brownian tree is defined from the laws of all the finite sub-trees one can generate from it.
Continuous tree
The Brownian tree is a real tree defined from a Brownian excursion (see characterisation 4 in Real tree).
Let be a Brownian excursion. Define a pseudometric on with
for any
We then define an equivalence relation, noted on |
https://en.wikipedia.org/wiki/Sheperd%20Paine | Howard Sheperd "Shep" Paine was a military historian and a collector of militaria best known for the more than three decades he spent as a modeler, sculptor, miniature figure painter, and champion of the diorama. Paine arguably did more than anyone else to forward the unique hobby/art form of military miniatures around the world, through his own pieces, numerous "how-to" hobby books, and championing of the "open system" of judging in use at many of the most prestigious modeling shows and exhibitions today.
Biography
Sheperd Paine was the first child born to American parents in Berlin after the end of World War II. After leaving Berlin, his family moved to London for a year, during which period he attended Eaton House School. Paine's family then moved again to New England, where he attended St. Paul's School. After service as a sergeant in the U.S. Army, he received a BA from the University of Chicago, and lived in the Windy City for most of his life.
For many years, Paine worked in the military history field as a free-lance artist, sculptor, and writer. His commissions included dioramas for private collections (notably those of Andrew Wyeth and Forbes Magazine), museum projects, and several large commemorative sculptures for the Franklin Mint.
Special displays of his work have been seen at the Brandywine River Museum, the Campbell Museum, and the St. Louis Museum of Science and Natural History. He was the author of four books; his work has been featured in articles in Sports Illustrated and Fortune (along with many hobby magazines), and he is the subject of a hardcover biography/career overview entitled Sheperd Paine: The Life and Work of a Master Modeler and Military Historian written by Chicago rock critic and fellow miniaturist Jim DeRogatis.
Paine had a broad knowledge of military history (particularly uniforms and equipment) with proficiency in the American Civil War, Napoleonic Wars, and the two World Wars. For thirty years he was an active collector o |
https://en.wikipedia.org/wiki/Learning%20rule | An artificial neural network's learning rule or learning process is a method, mathematical logic or algorithm which improves the network's performance and/or training time. Usually, this rule is applied repeatedly over the network. It is done by updating the weights and bias levels of a network when a network is simulated in a specific data environment. A learning rule may accept existing conditions (weights and biases) of the network and will compare the expected result and actual result of the network to give new and improved values for weights and bias. Depending on the complexity of actual model being simulated, the learning rule of the network can be as simple as an XOR gate or mean squared error, or as complex as the result of a system of differential equations.
The learning rule is one of the factors which decides how fast or how accurately the artificial network can be developed. Depending upon the process to develop the network there are three main models of machine learning:
Unsupervised learning
Supervised learning
Reinforcement learning
Background
A lot of the learning methods in machine learning work similar to each other, and are based on each other, which makes it difficult to classify them in clear categories. But they can be broadly understood in 4 categories of learning methods, though these categories don't have clear boundaries and they tend to belong to multiple categories of learning methods -
Hebbian - Neocognitron, Brain-state-in-a-box
Gradient Descent - ADALINE, Hopfield Network, Recurrent Neural Network
Competitive - Learning Vector Quantisation, Self-Organising Feature Map, Adaptive Resonance Theory
Stochastic - Boltzmann Machine, Cauchy Machine
It is to be noted that though these learning rules might appear to be based on similar ideas, they do have subtle differences, as they are a generalisation or application over the previous rule, and hence it makes sense to study them separately based on their origins and intents.
Hebbi |
https://en.wikipedia.org/wiki/Date-plum | Diospyros lotus, with common names date-plum, Caucasian persimmon, or lilac persimmon, is a widely cultivated species of the genus Diospyros, native to subtropical southwest Asia and southeast Europe. Its English name derives from the small fruit, which have a taste reminiscent of both plums and dates. It is among the oldest plants in cultivation.
Distribution and ecology
The species area extends from East Asia to the west of the Mediterranean, down to Spain. The date-plum is native to southwest Asia and southeast Europe. It was known to the ancient Greeks as "God's fruit" (, Diós pŷrós), hence the scientific name of the genus. Its English name probably derives from Persian Khormaloo خرمالو literally "date-plum", referring to the taste of this fruit which is reminiscent of both plums and dates. The fruit is called Amlok املوک in Pakistan and consumed dried. This species is one candidate for the "lotus tree" mentioned in The Odyssey: it was so delicious that those who ate it forgot about returning home and wanted to stay and eat lotus with the lotus-eaters.
The tree grows in the lower and middle mountain zones in the Caucasus. They usually grow up to 600 m above sea level. In Central Asia, it rises higher—up to 2000 m. They rarely grow in stands but often grow with hackberry, ash, maple and other deciduous species. It is not demanding on the soil and can grow on rocky slopes but requires a well lit environment.
It is cultivated at the limits of its range, as well as in the U.S. and North Africa.
Biological description
This is a tree height of 15–30 m with sloughing of aging bark.
The leaves are shiny, leathery, oval-shaped with pointed ends, 5–15 cm long and 3–6 cm in width.
The flowers are small, greenish, appearing in June to July.
Fruits are berries with juicy flesh, yellow when ripe, 1–2 cm in diameter. Seeds with thin skin and a very hard endosperm.
Usage
Caucasian persimmon fruits are edible and contain much sugar, malic acid, and vitamins. They a |
https://en.wikipedia.org/wiki/Subcallosal%20gyrus | The subcallosal gyrus (paraterminal gyrus, peduncle of the corpus callosum) is a narrow lamina on the medial surface of the hemisphere in front of the lamina terminalis, behind the parolfactory area, and below the rostrum of the corpus callosum. It is continuous around the genu of the corpus callosum with the indusium griseum. It's also considered a part of limbic system of the brain. |
https://en.wikipedia.org/wiki/Impulse%20%28physics%29 | In classical mechanics, impulse (symbolized by or Imp) is the change in momentum of an object. If the initial momentum of an object is , and a subsequent momentum is , the object has received an impulse :
Momentum is a vector quantity, so impulse is also a vector quantity.
Newton’s second law of motion states that the rate of change of momentum of an object is equal to the resultant force acting on the object:
so the impulse delivered by a steady force acting for time Δt is:
The impulse delivered by a varying force is the integral of the force with respect to time:
The SI unit of impulse is the newton second (N⋅s), and the dimensionally equivalent unit of momentum is the kilogram metre per second (kg⋅m/s). The corresponding English engineering unit is the pound-second (lbf⋅s), and in the British Gravitational System, the unit is the slug-foot per second (slug⋅ft/s).
Mathematical derivation in the case of an object of constant mass
Impulse produced from time to is defined to be
where is the resultant force applied from to .
From Newton's second law, force is related to momentum by
Therefore,
where is the change in linear momentum from time to . This is often called the impulse-momentum theorem (analogous to the work-energy theorem).
As a result, an impulse may also be regarded as the change in momentum of an object to which a resultant force is applied. The impulse may be expressed in a simpler form when the mass is constant:
where
is the resultant force applied,
and are times when the impulse begins and ends, respectively,
is the mass of the object,
is the final velocity of the object at the end of the time interval, and
is the initial velocity of the object when the time interval begins.
Impulse has the same units and dimensions as momentum. In the International System of Units, these are . In English engineering units, they are .
The term "impulse" is also used to refer to a fast-acting force or impact. This type of impulse is o |
https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead%20method | The Nelder–Mead method (also downhill simplex method, amoeba method, or polytope method) is a numerical method used to find the minimum or maximum of an objective function in a multidimensional space. It is a direct search method (based on function comparison) and is often applied to nonlinear optimization problems for which derivatives may not be known. However, the Nelder–Mead technique is a heuristic search method that can converge to non-stationary points on problems that can be solved by alternative methods.
The Nelder–Mead technique was proposed by John Nelder and Roger Mead in 1965, as a development of the method of Spendley et al.
Overview
The method uses the concept of a simplex, which is a special polytope of n + 1 vertices in n dimensions. Examples of simplices include a line segment on a line, a triangle on a plane, a tetrahedron in three-dimensional space and so forth.
The method approximates a local optimum of a problem with n variables when the objective function varies smoothly and is unimodal. Typical implementations minimize functions, and we maximize by minimizing .
For example, a suspension bridge engineer has to choose how thick each strut, cable, and pier must be. These elements are interdependent, but it is not easy to visualize the impact of changing any specific element. Simulation of such complicated structures is often extremely computationally expensive to run, possibly taking upwards of hours per execution. The Nelder–Mead method requires, in the original variant, no more than two evaluations per iteration, except for the shrink operation described later, which is attractive compared to some other direct-search optimization methods. However, the overall number of iterations to proposed optimum may be high.
Nelder–Mead in n dimensions maintains a set of n + 1 test points arranged as a simplex. It then extrapolates the behavior of the objective function measured at each test point in order to find a new test point and to replace on |
https://en.wikipedia.org/wiki/Deployment%20environment | In software deployment, an environment or tier is a computer system or set of systems in which a computer program or software component is deployed and executed. In simple cases, such as developing and immediately executing a program on the same machine, there may be a single environment, but in industrial use, the development environment (where changes are originally made) and production environment (what end users use) are separated, often with several stages in between. This structured release management process allows phased deployment (rollout), testing, and rollback in case of problems.
Environments may vary significantly in size: the development environment is typically an individual developer's workstation, while the production environment may be a network of many geographically distributed machines in data centers, or virtual machines in cloud computing. Code, data, and configuration may be deployed in parallel, and need not connect to the corresponding tier—for example, pre-production code might connect to a production database.
Architectures
Deployment architectures vary significantly, but, broadly, the tiers are bookended by starting at development (DEV) and ending at production (PROD). A common 4-tier architecture is development, testing, model, production (DEV, TEST, MODL, PROD), with software being deployed to each in order. Other common environments include Quality Control (QC), for acceptance testing; sandbox or experimental (EXP), for experiments that are not intended to proceed to production; and Disaster Recovery, to provide an immediate fallback in case of problems with production. Another common architecture is development, testing, acceptance and production (DTAP).
This language is particularly suited for server programs, where servers run in a remote data center; for code that runs on an end user's device, such as applications (apps) or clients, one can refer to the user environment (USER) or local environment (LOCAL) instead.
Exact de |
https://en.wikipedia.org/wiki/United%20Kingdom%20Mathematics%20Trust | The United Kingdom Mathematics Trust (UKMT) is a charity founded in 1996 to help with the education of children in mathematics within the UK.
History
The national mathematics competitions existed prior to the formation of the UKMT, but the foundation of the UKMT in the summer of 1996 enabled them to be run collectively. The Senior Mathematical Challenge was formerly the National Mathematics Contest. Founded in 1961, it was run by the Mathematical Association from 1975 until its adoption by the UKMT in 1996. The Junior and Intermediate Mathematical Challenges were the initiative of Dr Tony Gardiner in 1987 and were run by him under the name of the United Kingdom Mathematics Foundation until 1996. The popularity of the UK national mathematics competitions is largely due to the publicising efforts of Dr Gardiner in the years 1987-1995. Hence, in 1995, he advertised for the formation of a committee and for a host institution that would lead to the establishment of the UKMT, enabling the challenges to be run effectively together under one organisation.
Mathematical Challenges
The UKMT runs a series of mathematics challenges to encourage childs interest in mathematics and develop their skills in secondary schools. The three main challenges are:
Junior Mathematical Challenge (UK year 8/S2 and below)
Intermediate Mathematical Challenge (UK year 11/S4 and below)
Senior Mathematical Challenge (UK year 13/S6 and below)
Certificates
In the Junior and Intermediate Challenges the top scoring 50% of the entrants receive bronze, silver or gold certificates based on their mark in the paper. In the Senior Mathematical Challenge these certificates are awarded to top scoring 66% of the entries. In each case bronze, silver and gold certificates are awarded in the ratio 3 : 2 : 1.
So in the Junior and Intermediate Challenges
The Gold award is achieved by the top 8-9% of the entrants.
The Silver award is achieved by 16-17% of the entrants.
The Bronze award is achieved by 25% of t |
https://en.wikipedia.org/wiki/Pujol%20%28restaurant%29 | Pujol is a Mexican restaurant named by Wall Street Journal as the best in Mexico City.
The restaurant is run by chef Enrique Olvera, who trained at the Culinary Institute of America and who oversees the onboard menu in business class of airline Aeromexico.
Pujol serves Mexican cuisine as refined and elegant plates built from indigenous ingredients that pay tribute to Mexico’s rich culinary history.
Awards
World's 50 Best Restaurants
Pujol was named the 17th best restaurant in the world by Restaurant magazine in 2013.
In 2014, Pujol was ranked 20th among the World’s 50 Best Restaurants.
In 2015, Pujol was ranked 16th among the World’s 50 Best Restaurants.
In 2016, Pujol was ranked 25th among the World’s 50 Best Restaurants, and was listed as the 5th best restaurant in Latin America.
In 2017, Pujol was ranked 20th among the World’s 50 Best Restaurants.
In 2018, Pujol was ranked 13th among the World’s 50 Best Restaurants.
In 2019, Pujol was ranked 12th among the World’s 50 Best Restaurants. Two Peruvian restaurants, Maido and Central, occupied the first two positions on the list, respectively.
See also
List of Mexican restaurants
Local food |
https://en.wikipedia.org/wiki/Oyster%20bar | An oyster bar, also known as an oyster saloon, oyster house or a raw bar service, is a restaurant specializing in serving oysters, or a section of a restaurant which serves oysters buffet-style. Oysters have been consumed since ancient times and were common tavern food in Europe, but the oyster bar as a distinct restaurant began making an appearance in the 18th century.
History
Oyster consumption in Europe was confined to the wealthy until the mid-17th century but, by the 18th century, the poor were also consuming them. Sources vary as to when the first oyster bar was created. One source claims that Sinclair's, a pub in Manchester, England, is the United Kingdom's oldest oyster bar. It opened in 1738. London's oldest restaurant, Rules, also began business as an oyster bar. It opened in 1798.
In North America, Native Americans on both coasts ate oysters in large quantities, as did colonists from Europe. Unlike in Europe, oyster consumption in North America after colonization by Europeans was never confined to class, and oysters were commonly served in taverns. During the early 19th century, express wagons filled with oysters crossed the Allegheny Mountains to reach the American Midwest. The oldest oyster bar in the United States is Union Oyster House in Boston, which opened in 1826. It features oyster shucking in front of the customer, and patrons may make their own oyster sauces from condiments on the tables. It has served as a model for many oyster bars in the United States.
During the same period, oysters were an integral part of some African-American communities. One example is Sandy Ground, which was located in modern-day Rossville, Staten Island. African-Americans were drawn to the oyster industry because it promised autonomy, as they were involved throughout the process of harvesting and selling. In addition, oyster farmers were relatively less impoverished than slaves and did not work under white owners. A recipe for an oyster pie in Abby Fisher's 1881 co |
https://en.wikipedia.org/wiki/Avionics | Avionics (a blend of aviation and electronics) are the electronic systems used on aircraft. Avionic systems include communications, navigation, the display and management of multiple systems, and the hundreds of systems that are fitted to aircraft to perform individual functions. These can be as simple as a searchlight for a police helicopter or as complicated as the tactical system for an airborne early warning platform.
History
The term "avionics" was coined in 1949 by Philip J. Klass, senior editor at Aviation Week & Space Technology magazine as a portmanteau of "aviation electronics".
Radio communication was first used in aircraft just prior to World War I. The first airborne radios were in zeppelins, but the military sparked development of light radio sets that could be carried by heavier-than-air craft, so that aerial reconnaissance biplanes could report their observations immediately in case they were shot down. The first experimental radio transmission from an airplane was conducted by the U.S. Navy in August 1910. The first aircraft radios transmitted by radiotelegraphy, so they required two-seat aircraft with a second crewman to tap on a telegraph key to spell out messages by Morse code. During World War I, AM voice two way radio sets were made possible in 1917 by the development of the triode vacuum tube, which were simple enough that the pilot in a single seat aircraft could use it while flying.
Radar, the central technology used today in aircraft navigation and air traffic control, was developed by several nations, mainly in secret, as an air defense system in the 1930s during the runup to World War II. Many modern avionics have their origins in World War II wartime developments. For example, autopilot systems that are commonplace today began as specialized systems to help bomber planes fly steadily enough to hit precision targets from high altitudes. Britain's 1940 decision to share its radar technology with its U.S. ally, particularly the magnet |
https://en.wikipedia.org/wiki/Hardware-based%20full%20disk%20encryption | Hardware-based full disk encryption (FDE) is available from many hard disk drive (HDD/SSD) vendors, including: ClevX, Hitachi, Integral Memory, iStorage Limited, Micron, Seagate Technology, Samsung, Toshiba, Viasat UK, Western Digital. The symmetric encryption key is maintained independently from the computer's CPU, thus allowing the complete data store to be encrypted and removing computer memory as a potential attack vector.
Hardware-FDE has two major components: the hardware encryptor and the data store.
There are currently four varieties of hardware-FDE in common use:
Hard disk drive (HDD) FDE (self-encrypting drive)
Enclosed hard disk drive FDE
Removable hard disk drive FDE
Bridge and Chipset (BC) FDE
Hardware designed for a particular purpose can often achieve better performance than disk encryption software, and disk encryption hardware can be made more transparent to software than encryption done in software. As soon as the key has been initialised, the hardware should in principle be completely transparent to the OS and thus work with any OS. If the disk encryption hardware is integrated with the media itself the media may be designed for better integration. One example of such design would be through the use of physical sectors slightly larger than the logical sectors.
Hardware-based full disk encryption types
Hard disk drive FDE
Usually referred to as self-encrypting drive (SED).
HDD FDE is made by HDD vendors using the OPAL and Enterprise standards developed by the Trusted Computing Group. Key management takes place within the hard disk controller and encryption keys are 128 or 256 bit Advanced Encryption Standard (AES) keys. Authentication on power up of the drive must still take place within the CPU via either a software pre-boot authentication environment (i.e., with a software-based full disk encryption component - hybrid full disk encryption) or with a BIOS password.
Hitachi, Micron, Seagate, Samsung, and Toshiba are the disk drive manufact |
https://en.wikipedia.org/wiki/Glycosylamine | Glycosylamines are a class of biochemical compounds consisting of a glycosyl group attached to an amino group, -NR2. They are also known as N-glycosides, as they are a type of glycoside. Glycosyl groups can be derived from carbohydrates. The glycosyl group and amino group are connected with a β-N-glycosidic bond, forming a cyclic hemiaminal ether bond (α-aminoether).
Examples include nucleosides such as adenosine. |
https://en.wikipedia.org/wiki/TringMe | TringMe is an Indian internet telephony company based in Bangalore. It focuses on a Flash-based browser client and the related API.
History
It was founded by Yusuf Motiwala & Apul Nahata in 2007, after Yusuf's father complained of downloads required to use VoIP programs. The firm focused on a browser-based app. The duo invested of their own money initially in the venture. In October 2009, TringMe released a Facebook app. It won the NASSCOM's Most Innovative Startup award in 2009.
See also
Skype
Gizmo5 |
https://en.wikipedia.org/wiki/Adversary%20model | In computer science, an online algorithm measures its competitiveness against different adversary models. For deterministic algorithms, the adversary is the same as the adaptive offline adversary. For randomized online algorithms competitiveness can depend upon the adversary model used.
Common adversaries
The three common adversaries are the oblivious adversary, the adaptive online adversary, and the adaptive offline adversary.
The oblivious adversary is sometimes referred to as the weak adversary. This adversary knows the algorithm's code, but does not get to know the randomized results of the algorithm.
The adaptive online adversary is sometimes called the medium adversary. This adversary must make its own decision before it is allowed to know the decision of the algorithm.
The adaptive offline adversary is sometimes called the strong adversary. This adversary knows everything, even the random number generator. This adversary is so strong that randomization does not help against it.
Important results
From S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson we have:
If there is a randomized algorithm that is α-competitive against any adaptive offline adversary then there also exists an α-competitive deterministic algorithm.
If G is a c-competitive randomized algorithm against any adaptive online adversary, and there is a randomized d-competitive algorithm against any oblivious adversary, then G is a randomized (c * d)-competitive algorithm against any adaptive offline adversary.
See also
Competitive analysis (online algorithm)
K-server problem
Online algorithm |
https://en.wikipedia.org/wiki/Squamous%20part%20of%20occipital%20bone | The squamous part of occipital bone is situated above and behind the foramen magnum, and is curved from above downward and from side to side.
External surface
The external surface is convex and presents midway between the summit of the bone and the foramen magnum a prominence, the external occipital protuberance and inion.
Extending lateralward from this on either side are two curved lines, one a little above the other. The upper, often faintly marked, is named the highest nuchal line, and to it the epicranial aponeurosis is attached.
The lower is termed the superior nuchal line. That area of the squamous part, which lies above the highest nuchal lines is named the occipital plane (planum occipitale) and is covered by the occipitalis muscle. That below, termed the nuchal plane, is rough and irregular for the attachment of several muscles.
From the external occipital protuberance, an often faintly marked ridge or crest, the median nuchal line, descends to the foramen magnum and affords attachment to the nuchal ligament. Running from the middle of this line across either half of the nuchal plane is the inferior nuchal line.
Several muscles are attached to the outer surface of the squamous part, thus the superior nuchal line gives origin to the occipitalis and trapezius muscles, and insertion to the sternocleidomastoid and splenius capitis muscles. Into the surface between the superior and inferior nuchal lines the semispinalis capitis and the obliquus capitis superior are inserted, while the inferior nuchal line and the area below it receive the insertions of the rectus capitis posterior major and minor.
The posterior atlantooccipital membrane is attached around the postero-lateral part of the foramen magnum, just outside the margin of the foramen.
Internal surface
The internal surface is deeply concave and divided into four fossae by the cruciform eminence.
The upper two fossae are triangular and lodge the occipital lobes of the cerebrum; the lower two are |
https://en.wikipedia.org/wiki/Roboforge | Roboforge is a strategy game developed by Liquid Edge and released in 2001.
Brief history
RoboForge is a video game released in 2001 by Liquid Edge, a small company mainly created to develop and sell this game.
The company's founder, Darren Green, was inspired by the well known Robot Wars (TV series). He noticed that Robot Wars was an interesting game, but the cost of a real bot and the know-how required drastically restricted its spread, so he decided to virtualize Robot Wars concepts into a new PC game, calling it RoboForge.
RoboForge introduced an innovative concept: build your own robot (also called "bot" or "bots") on a limited virtual cost budget, then enter it into an arena with one other robot and run a full 3D robot battle until a robot's CPU or chassis is destroyed or time is called. Liquid Edge announced the game in July, 2000 and then released the first version on May 23, 2001.
From July 2008 RoboForge became an open-source project with the Java-based source code available under a non-commercial license. The game's community continues development and it is now possible to download the game, build bots and enter them into amateur tournaments for free.
Reception
Since 2001 RoboForge attracted the interest of many gaming review websites as well as gaming magazines, The general consensus was that RoboForge wasn't an "easy" game and that it required a lot of time and effort to build competitive robots. |
https://en.wikipedia.org/wiki/Workshop%20on%20Numerical%20Ranges%20and%20Numerical%20Radii | Workshop on Numerical Ranges and Numerical Radii (WONRA) is a biennial workshop series on numerical ranges and numerical radii which began in 1992.
About
Numerical ranges and numerical radii are useful in the study of matrix and operator theory.
These topics have applications in many subjects in pure and applied mathematics, such as
quadratic forms, Banach spaces, dilation theory, control theory, numerical analysis, quantum information science.
History
In the early 1970s, numerical range workshops were organized by Frank Bonsall and John Duncan. More activities were started in early 1990s, including the biennial workshop series, which began in 1992,
and special issues devoted to this workshop were published.
Workshops
Symposium in conferences |
https://en.wikipedia.org/wiki/Collection%20%28abstract%20data%20type%29 | In computer programming, a collection is a grouping of some variable number of data items (possibly zero) that have some shared significance to the problem being solved and need to be operated upon together in some controlled fashion. Generally, the data items will be of the same type or, in languages supporting inheritance, derived from some common ancestor type. A collection is a concept applicable to abstract data types, and does not prescribe a specific implementation as a concrete data structure, though often there is a conventional choice (see Container for type theory discussion).
Examples of collections include lists, sets, multisets, trees and graphs.
Fixed-size arrays (or tables) are usually not considered a collection because they hold a fixed number of data items, although they commonly play a role in the implementation of collections. Variable-size arrays are generally considered collections.
Linear collections
Many collections define a particular linear ordering, with access to one or both ends. The actual data structure implementing such a collection need not be linear—for example, a priority queue is often implemented as a heap, which is a kind of tree. Important linear collections include:
lists;
stacks;
queues;
priority queues;
double-ended queues;
double-ended priority queues.
Lists
In a list, the order of data items is significant. Duplicate data items are permitted. Examples of operations on lists are searching for a data item in the list and determining its location (if it is present), removing a data item from the list, adding a data item to the list at a specific location, etc. If the principal operations on the list are to be the addition of data items at one end and the removal of data items at the other, it will generally be called a queue or FIFO. If the principal operations are the addition and removal of data items at just one end, it will be called a stack or LIFO. In both cases, data items are maintained within the collec |
https://en.wikipedia.org/wiki/Algebrator | Algebrator (also called Softmath) is a computer algebra system (CAS), which was developed in the late 1990s by Neven Jurkovic of Softmath, San Antonio, Texas. This is a CAS specifically geared towards algebra education. Beside the computation results, it shows step by step the solution process and context sensitive explanations.
See also
List of computer algebra systems |
https://en.wikipedia.org/wiki/Holyland%20Model%20of%20Jerusalem | The Holyland Model of Jerusalem, also known as Model of Jerusalem at the end of the Second Temple period () is a 1:50 scale model of the city of Jerusalem in the late Second Temple period. The model, designed by Michael Avi-Yonah, was moved from its original location at the Holyland Hotel in Bayit VeGan, Jerusalem, to a new site at the Israel Museum in June 2006.
History
According to Yael Padan, the model was built in 1962–1966, a time when almost the entire area it depicts was under Jordanian rule and therefore off-limits for Israeli archaeologists and visitors alike. This endowed the model with a multi-layered purpose, of replacing the original site, educating the Israeli public, and creating a sense of national belonging and continuity.
According to Annabel J. Wharton, the model, measuring , was commissioned in 1966 by the banker , the owner of the Holyland Hotel, in memory of his son, Yaakov, an IDF soldier who was killed in Israel's 1948 War of Independence. The model was designed by Israeli historian and geographer Michael Avi-Yonah based on the writings of Flavius Josephus and other historical sources. The model includes a replica of the Herodian Temple. From 1974, Yoram Tsafrir (1938–2015) superintended the Holyland Model of Jerusalem.
In 2006, the model was relocated to the southern edge of the Billy Rose Sculpture Garden at the Israel Museum. In preparation for the move, the model was sawn into 100 pieces and later reassembled. The Holyland Hotel spent $3.5 million on the move.
Notable depictions
The Jerusalem model features a number of notable and important structures, as the model was based on the writings of Josephus at the time of its construction. Since then some modifications have been made to the model, such as the removal of the Hippodrome.
Districts
The city was divided into a number of districts. On the eastern range, from north to south, stood the Temple complex on the Temple Mount; the Ophel; and the City of David. On the western range |
https://en.wikipedia.org/wiki/Ventral%20ramus%20of%20spinal%20nerve | The ventral ramus (: rami) (Latin for 'branch') is the anterior division of a spinal nerve. The ventral rami supply the antero-lateral parts of the trunk and the limbs. They are mainly larger than the dorsal rami.
Shortly after a spinal nerve exits the intervertebral foramen, it branches into the dorsal ramus, the ventral ramus, and the ramus communicans. Each of these three structures carries both sensory and motor information. Each spinal nerve carries both sensory and motor information, via efferent and afferent nerve fibers—ultimately via the motor cortex in the frontal lobe and to somatosensory cortex in the parietal lobe—but also through the phenomenon of reflex. Spinal nerves are referred to as "mixed nerves".
In the thoracic region they remain distinct from each other and each innervates a narrow
strip of muscle and skin along the sides, chest, ribs, and abdominal wall. These rami are called the intercostal nerves. In regions other than the thoracic, ventral rami converge with each other to form networks of nerves
called nerve plexuses. Within each plexus, fibers from the various ventral rami branch and
become redistributed so that each nerve exiting the plexus has fibers from several different spinal nerves. One advantage to having plexes is that damage to a single spinal nerve will not completely paralyze a limb.
There are four main plexuses formed by the ventral rami:
the cervical plexus contains ventral rami from spinal nerves C1–C4. Branches of the
cervical plexus, which include the phrenic nerve, innervate muscles of the neck, the diaphragm, and the skin of the neck and upper chest.
The brachial plexus contains ventral rami from spinal nerves C5–T1. This plexus innervates
the pectoral girdle and upper limb.
The lumbar plexus contains ventral rami from spinal nerves L1–L4. The sacral plexus contains ventral
rami from spinal nerves L4–S4. The lumbar and sacral plexuses innervate the pelvic girdle and lower limbs.
Ventral rami, including the sinuvert |
https://en.wikipedia.org/wiki/Trophic%20level | The trophic level of an organism is the position it occupies in a food web. A food chain is a succession of organisms that eat other organisms and may, in turn, be eaten themselves. The trophic level of an organism is the number of steps it is from the start of the chain. A food web starts at trophic level 1 with primary producers such as plants, can move to herbivores at level 2, carnivores at level 3 or higher, and typically finish with apex predators at level 4 or 5. The path along the chain can form either a one-way flow or a food "web". Ecological communities with higher biodiversity form more complex trophic paths.
The word trophic derives from the Greek τροφή (trophē) referring to food or nourishment.
History
The concept of trophic level was developed by Raymond Lindeman (1942), based on the terminology of August Thienemann (1926): "producers", "consumers", and "reducers" (modified to "decomposers" by Lindeman).
Overview
The three basic ways in which organisms get food are as producers, consumers, and decomposers.
Producers (autotrophs) are typically plants or algae. Plants and algae do not usually eat other organisms, but pull nutrients from the soil or the ocean and manufacture their own food using photosynthesis. For this reason, they are called primary producers. In this way, it is energy from the sun that usually powers the base of the food chain. An exception occurs in deep-sea hydrothermal ecosystems, where there is no sunlight. Here primary producers manufacture food through a process called chemosynthesis.
Consumers (heterotrophs) are species that cannot manufacture their own food and need to consume other organisms. Animals that eat primary producers (like plants) are called herbivores. Animals that eat other animals are called carnivores, and animals that eat both plants and other animals are called omnivores.
Decomposers (detritivores) break down dead plant and animal material and wastes and release it again as energy and nutrients into |
https://en.wikipedia.org/wiki/Permitted%20attached%20private%20lines | Permitted attached private lines, abbreviated PAPL, are voice-grade telephone wires that run point-to-point (rather than point-to-exchange) between locations in the telephone company's copper network. Data can travel across the PAPL link (at a distance of up to 3.5 km) at speeds of around 2Mb per second. Originally, PAPLs were intended to act as basic alarm circuits for fire or security systems, though in recent years have been utilised to carry DSL data signals. |
https://en.wikipedia.org/wiki/Stability%20theory | In mathematics, stability theory addresses the stability of solutions of differential equations and of trajectories of dynamical systems under small perturbations of initial conditions. The heat equation, for example, is a stable partial differential equation because small perturbations of initial data lead to small variations in temperature at a later time as a result of the maximum principle. In partial differential equations one may measure the distances between functions using Lp norms or the sup norm, while in differential geometry one may measure the distance between spaces using the Gromov–Hausdorff distance.
In dynamical systems, an orbit is called Lyapunov stable if the forward orbit of any point is in a small enough neighborhood or it stays in a small (but perhaps, larger) neighborhood. Various criteria have been developed to prove stability or instability of an orbit. Under favorable circumstances, the question may be reduced to a well-studied problem involving eigenvalues of matrices. A more general method involves Lyapunov functions. In practice, any one of a number of different stability criteria are applied.
Overview in dynamical systems
Many parts of the qualitative theory of differential equations and dynamical systems deal with asymptotic properties of solutions and the trajectories—what happens with the system after a long period of time. The simplest kind of behavior is exhibited by equilibrium points, or fixed points, and by periodic orbits. If a particular orbit is well understood, it is natural to ask next whether a small change in the initial condition will lead to similar behavior. Stability theory addresses the following questions: Will a nearby orbit indefinitely stay close to a given orbit? Will it converge to the given orbit? In the former case, the orbit is called stable; in the latter case, it is called asymptotically stable and the given orbit is said to be attracting.
An equilibrium solution to an autonomous system of first ord |
https://en.wikipedia.org/wiki/The%20Unimaginable%20Mathematics%20of%20Borges%27%20Library%20of%20Babel | The Unimaginable Mathematics of Borges' Library of Babel is a popular mathematics book on Jorge Luis Borges and mathematics. It describes several mathematical concepts related to the short story "The Library of Babel", by Jorge Luis Borges. Written by mathematics professor William Goldbloom Bloch, and published in 2008 by the Oxford University Press, it received an honorable mention in the 2008 PROSE Awards.
Topics
"The Library of Babel" was originally written by Borges in 1941,
based on an earlier essay he had published in 1939 while working as a librarian. It concerns a fictional library containing every possible book of a certain fixed length, over a 25-symbol alphabet (which, including spacing and punctuation, is sufficient for the Spanish language). These assumptions, based on the dimensions of his own library and spelled out in more detail in the story, imply that the total number of books in the library is 251312000, an enormous number. The story also describes, with an attitude of some horror, the physical layout of the library that holds all of these books, and some of the behavior of its inhabitants.
After a copy of "The Library of Babel" itself, as translated into English by Andrew Hurley, The Unimaginable Mathematics of Borges' Library of Babel has seven chapters on its mathematics. The first chapter, on combinatorics, repeats the calculation above, of the number of books in the library, putting it in context with the size of the known universe and with other huge numbers, and uses this material as an excuse to branch off into a discussion of logarithms and their use in estimation. The second chapter concerns a line in the story about the existence of a library catalog for the library, using information theory to prove that such a catalog would necessarily equal in size the library itself, and touching on topics including the prime number theorem. The third chapter considers the mathematics of the infinite, and the possibility of books with infinitely |
https://en.wikipedia.org/wiki/Fatiha%20Alabau | Fatiha Alabau-Boussouira (born 1961) is a French applied mathematician specializing in the control theory of partial differential equations. She is affiliated with the Laboratoire Jacques-Louis Lions of Sorbonne University as an external member, a professor at the University of Lorraine in the mathematics department of its Metz campus, and a former president of the Société de Mathématiques Appliquées et Industrielles, a French society for applied mathematics.
Education and career
Alabau was born 27 August 1961 in Montmorency, Val-d'Oise. She earned a diplôme d'études approfondies in numerical analysis in 1984 at Pierre and Marie Curie University, where she defended her doctoral thesis in 1987 under the supervision of Roland Glowinski.
After postdoctoral research as a visiting assistant professor at Arizona State University, she became maître de conferences at the University of Bordeaux 1 in 1988, and earned a habilitation there in 1996. She became a professor at Louis Pasteur University in 1997, and moved to Paul Verlaine University – Metz (which later became part of the University of Lorraine) in 1999.
Service and recognition
Alabau was president of the Société de Mathématiques Appliquées et Industrielles from 2014 to 2017. |
https://en.wikipedia.org/wiki/Garlic%20oil | Garlic oil is the volatile oil derived from garlic. It is usually prepared using steam distillation and can also be produced via distillation using ether. It is used in cooking and as a seasoning, a nutritional supplement, and also as an insecticide.
Preparation
Garlic oil is typically prepared using steam distillation, where crushed garlic is steamed with the resultant condensation containing the oil. Garlic oil contains volatile sulfur compounds such as diallyl disulfide, a 60% constituent of the oil. Steam-distilled garlic oil typically has a pungent and disagreeable odor and a brownish-yellow color. Its odor has been attributed to the presence of diallyl disulfide. To produce around 1 gram of pure steam-distilled garlic oil, around 500 grams of garlic is required. Undiluted garlic oil has 900 times the strength of fresh garlic, and 200 times the strength of dehydrated garlic.
Ether can also be used to extract garlic oil. A type of garlic oil involves soaking diced or crushed garlic in vegetable oil, but this is not pure garlic oil; rather it is a garlic-infused oil.
Uses
Garlic oil is used as a nutritional supplement, and is sometimes marketed in the form of capsules, which may be diluted with other ingredients. Some commercial preparations are produced with various levels of dilution, such as a preparation that contains 10% garlic oil. Herbal folklore holds that garlic oil has antifungal and antibiotic properties, but there is insufficient clinical research confirming such effects. It is also sold in health food stores as a digestive aid.
It can be used as an insecticide, diluted with water and sprayed on plants.
Stabilized garlic flavor blend is a proprietary mixture of dehydrated garlic powder infused with garlic oil, which increases the flavor of the garlic powder.
Potential adverse effects
Common adverse effects of consuming garlic, garlic oil, and garlic supplements are breath and body odor, abdominal pain, nausea, vomiting, and other symptoms of ga |
https://en.wikipedia.org/wiki/Vflo | Vflo is a commercially available, physics-based distributed hydrologic model generated by Vieux & Associates, Inc. Vflo uses radar rainfall data for hydrologic input to simulate distributed runoff. Vflo employs GIS maps for parameterization via a desktop interface. The model is suited for distributed hydrologic forecasting in post-analysis and in continuous operations. Vflo output is in the form of hydrographs at selected drainage network grids, as well as distributed runoff maps covering the watershed. Model applications include civil infrastructure operations and maintenance, stormwater prediction and emergency management, continuous and short-term surface water runoff, recharge estimation, soil moisture monitoring, land use planning, water quality monitoring, and water resources management.
History
Vflo considers the spatial character of the parameters and precipitation controlling hydrologic processes, and thus improves upon lumped representations previously used in hydrologic modeling. Historical practice has been to use lumped representations because of computational limitations or because sufficient data was not available to populate a distributed model database. Advances in computational speed; development of high-resolution precipitation data from radar and satellites; and availability of worldwide digital data sets and GIS technology makes distributed, physics-based modeling possible. Vflo is designed to take advantage of the spatial variability of high resolution radar rainfall input, GIS datasets, and hydraulic channel characteristics. Because it is physics-based, it produces hydrographs based on conservation equations and the hydraulics of the drainage network, and can be employed in locations where there are no rain gauges or previous modeling studies. In addition, Vflo’s network approach makes models scalable from upland watersheds to river basins using the same drainage network.
Formulation
Vflo is suited for distributed hydrologic foreca |
https://en.wikipedia.org/wiki/Combination | In mathematics, a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter (unlike permutations). For example, given three fruits, say an apple, an orange and a pear, there are three combinations of two that can be drawn from this set: an apple and a pear; an apple and an orange; or a pear and an orange. More formally, a k-combination of a set S is a subset of k distinct elements of S. So, two combinations are identical if and only if each combination has the same members. (The arrangement of the members in each set does not matter.) If the set has n elements, the number of k-combinations, denoted by or , is equal to the binomial coefficient
which can be written using factorials as whenever , and which is zero when . This formula can be derived from the fact that each k-combination of a set S of n members has permutations so or . The set of all k-combinations of a set S is often denoted by .
A combination is a combination of n things taken k at a time without repetition. To refer to combinations in which repetition is allowed, the terms k-combination with repetition, k-multiset, or k-selection, are often used. If, in the above example, it were possible to have two of any one kind of fruit there would be 3 more 2-selections: one with two apples, one with two oranges, and one with two pears.
Although the set of three fruits was small enough to write a complete list of combinations, this becomes impractical as the size of the set increases. For example, a poker hand can be described as a 5-combination (k = 5) of cards from a 52 card deck (n = 52). The 5 cards of the hand are all distinct, and the order of cards in the hand does not matter. There are 2,598,960 such combinations, and the chance of drawing any one hand at random is 1 / 2,598,960.
Number of k-combinations
The number of k-combinations from a given set S of n elements is often denoted in elementary combinatorics texts by , or by a va |
https://en.wikipedia.org/wiki/Particle%20chauvinism | Particle chauvinism is the term used by British astrophysicist Martin Rees to describe the (allegedly erroneous) assumption that what we think of as normal matter – atoms, quarks, electrons, etc. (excluding dark matter or other matter) – is the basis of matter in the universe, rather than a rare phenomenon.
Dominance of dark matter
With the growing recognition in the late 20th century of the presence of dark matter in the universe, ordinary baryonic matter has come to be seen as something of a cosmic afterthought. As John D. Barrow put it, "This would be the final Copernican twist in our status in the material universe. Not only are we not at the center of the universe: we are not even made of the predominant form of matter."
The 21st century saw the share of baryonic matter in the total energy of the universe downgraded further, to perhaps as low as 1%, further extending what has been called the demise of particle chauvinism, before being revised up to some 5% of the contents of the universe.
See also
Anthropic principle
Carbon chauvinism
Mediocrity principle |
https://en.wikipedia.org/wiki/COST%20Hata%20model | The COST Hata model is a radio propagation model (i.e. path loss) that extends the urban Hata model (which in turn is based on the Okumura model) to cover a more elaborated range of frequencies (up to 2 GHz). It is the most often cited of the COST 231 models (EU funded research project ca. April 1986 – April 1996), also called the Hata Model PCS Extension. This model is the combination of empirical and deterministic models for estimating path loss in an urban area over frequency range of 800 MHz to 2000 MHz.
COST (COopération européenne dans le domaine de la recherche Scientifique et Technique) is a European Union Forum for cooperative scientific research which has developed this model based on experimental measurements in multiple cities across Europe.
Applicable to / under conditions
This model is applicable to macro cells in urban areas. To further evaluate Path Loss in suburban or rural (quasi-)open areas, this path loss has to be substituted into Urban to Rural / Urban to Suburban Conversions. (Ray GAO, 09 Sep 2007)
Coverage
Frequency: 1500–2000 MHz
Mobile station antenna height: 1–10 m
Base station antenna height: 30–200 m
Link distance: 1–20 km
Mathematical formulation
The COST Hata model is formulated as,
where,
Limitations
This model requires that the base station antenna is higher than all adjacent rooftops.
See also
Hata model
Radio propagation model |
https://en.wikipedia.org/wiki/Quartet%20distance | The quartet distance is a way of measuring the distance between two phylogenetic trees. It is defined as the number of subsets of four leaves that are not related by the same topology in both trees.
Computing the quartet distance
The most straightforward computation of the quartet distance would require time, where is the number of leaves in the trees.
For binary trees, better algorithms have been found to compute the distance in
time
time
and
time
Gerth Stølting Brodal et al. found an algorithm that takes time to compute the quartet distance between two multifurcating trees when is the maximum degree of the trees, which is accessible in C, perl, and the R package Quartet. |
https://en.wikipedia.org/wiki/Quantum%20ergodicity | In quantum chaos, a branch of mathematical physics, quantum ergodicity is a property of the quantization of classical mechanical systems that are chaotic in the sense of exponential sensitivity to initial conditions. Quantum ergodicity states, roughly, that in the high-energy limit, the probability distributions associated to energy eigenstates of a quantized ergodic Hamiltonian tend to a uniform distribution in the classical phase space. This is consistent with the intuition that the flows of ergodic systems are equidistributed in phase space. By contrast, classical completely integrable systems generally have periodic orbits in phase space, and this is exhibited in a variety of ways in the high-energy limit of the eigenstates: typically, some form of concentration occurs in the semiclassical limit .
The model case of a Hamiltonian is the geodesic Hamiltonian on the cotangent bundle of a compact Riemannian manifold. The quantization of the geodesic flow is given by the fundamental solution of the Schrödinger equation
where is the square root of the Laplace–Beltrami operator. The quantum ergodicity theorem of Shnirelman 1974, Zelditch, and Yves Colin de Verdière states that a compact Riemannian manifold whose unit tangent bundle is ergodic under the geodesic flow is also ergodic in the sense that the probability density associated to the nth eigenfunction of the Laplacian tends weakly to the uniform distribution on the unit cotangent bundle as n → ∞ in a subset of the natural numbers of natural density equal to one. Quantum ergodicity can be formulated as a non-commutative analogue of the classical ergodicity (T. Sunada).
Since a classically chaotic system is also ergodic, almost all of its trajectories eventually explore uniformly the entire accessible phase space. Thus, when translating the concept of ergodicity to the quantum realm, it is natural to assume that the eigenstates of the quantum chaotic system would fill the quantum phase space evenly (up to r |
https://en.wikipedia.org/wiki/Crop%20diversity | Crop diversity or crop biodiversity is the variety and variability of crops, plants used in agriculture, including their genetic and phenotypic characteristics. It is a subset of and a specific element of agricultural biodiversity. Over the past 50 years, there has been a major decline in two components of crop diversity; genetic diversity within each crop and the number of species commonly grown.
Crop diversity loss threatens global food security, as the world's human population depends on a diminishing number of varieties of a diminishing number of crop species. Crops are increasingly grown in monoculture, meaning that if, as in the historic Great Famine of Ireland, a single disease overcomes a variety's resistance, it may destroy an entire harvest, or as in the case of the 'Gros Michel' banana, may cause the commercial extinction of an entire variety. With the help of seed banks, international organizations are working to preserve crop diversity.
Biodiversity loss
The loss of biodiversity is considered one of today’s most serious environmental concerns by the Food and Agriculture Organization. If current trends persist, as many as half of all plant species could face extinction. Some 6% of wild relatives of cereal crops such as wheat, maize, rice, and sorghum are under threat, as are 18% of legumes (Fabaceae), the wild relatives of beans, peas and lentils, and 13% of species within the botanical family (Solanaceae) that includes potato, tomato, eggplant (aubergine), and peppers (Capsicum).
Within-crop diversity
Within-crop diversity, a specific crop can result from various growing conditions, for example a crop growing in nutrient-poor soil is likely to have stunted growth than a crop growing in more fertile soil. The availability of water, soil pH level, and temperature similarly influence crop growth.
In addition, diversity of a harvested plant can be the result of genetic differences: a crop may have genes conferring early maturity or disease resistance. |
https://en.wikipedia.org/wiki/Acetyltributylcitrate | Acetyltributylcitrate is an organic compound that is used as a plasticizer. As such, it is a potential replacement of DEHP and DINP. It is a colorless liquid that is soluble in organic solvents. It is found in nail polish and other cosmetics. It is prepared by acetylation of tributylcitrate. |
https://en.wikipedia.org/wiki/List%20of%20Institute%20of%20Food%20Technologists%20presidents | This a list of the people who have served as president of the Institute of Food Technologists since its establishment in 1939.
1939–41: Samuel C. Prescott
1941–42: Laurence V. Burton
1942–43: Roy C. Newton
1943–44: William V. Cruess
1944–45: Fred C. Blanck
1945–46: Fred W. Tanner
1946–47: Ellery R. Harvey
1947–48: George J. Hucker
1948–49: Helmut C. Diehl
1949–50: Carl R. Fellers
1950–51: Paul F. Sharp
1951–52: Charles N. Frey
1952–53: Bernard E. Proctor
1953–54: Berton S. Clark
1954–55: Philip K. Bates
1955–56: LaVerne E. Clifcorn
1956–57: George F. Garantz
1957–58: Emil M. Mrak
1958–59: Askel G. Olsen
1959–60: Ray B. Wakefield
1960–61: Irmi J. Hutchings
1961–62: Harold W. Schultz
1962–63: John M. Jackson
1963–64: C. Olin Ball
1964–65: Charles T. Townsend
1965–66: Maynard A. Joslyn
1966–67: John H. Nair
1967–68: George F. Stewart
1968–69: Bernard L. Oser
1969–70: Herbert E. Robinson
1970–71: Hans Lineweaver
1971–72: Richard L. Hall
1972–73: Ben F. Buchanan
1973–74: Reid T. Milner
1974–75: Charles F. Niven, Jr.
1975–76: Ernest J. Briskey
1976–77: John C. Ayres
1977–78: Howard E. Bauman
1978–79: Bernard S. Schweigert
1979–80: Walter L. Clark
1980–81: Frederick Jack Francis
1981–82: Arthur T. Schramm
1982–83: Owen R. Fennema
1983–84: Gilbert A. Leveille
1984–85: Bernard J. Liska
1985–86: Charles J. Bates
1986–87: John J. Powers
1987–88: Roy E. Morse
1988–89: Theodore P. Labuza
1989–90: Paul F. Hopper
1990–91: Daryl B. Lund
1991–92: John H. Litchfield
1992–93: David R. Lineback
1993–94: Adolph (Al) S. Clausi
1994–95: Roy G. Arnold
1995–96: Francis F. Busta
1996–97: Robert E. Smith
1997–98: Mary K. Wagner
1998–99: Bruce R. Stillings
1999–2000: Charles E. Manley
2000–01: Mary K. Schmidl
2001–02: Philip E. Nelson
2002–03: Mark R. McLellan
2003–04: C. Ann Hollingsworth
2004–05: Herbert F. Stone
2005–06: Margaret A. Lawson
2006–07: Dennis R. Heldman
2007–08: John D. Floros
2008–09: Sheri Schellhaass
2009–10: Marianne Gillette
2010-11: Robert B. Gravani
2011–12: Roger A. Cl |
https://en.wikipedia.org/wiki/Monoammonium%20glutamate | Monoammonium glutamate is a compound with formula NH4C5H8NO4. It is an ammonium acid salt of glutamic acid.
It has the E number E624 and is used as a flavor enhancer.
See also
Monopotassium glutamate
Glutamates
Ammonium compounds
E-number additives |
https://en.wikipedia.org/wiki/Legoland | Legoland (, trademark in uppercase as LEGOLAND) is a chain of family theme parks focusing on the Lego building toy brand. They are owned and operated by the British theme park company Merlin Entertainments, which shares a common owner (Kirkbi A/S) with The Lego Group.
The Legoland Billund Resort opened in Billund, Denmark in 1968, followed by the Legoland Windsor Resort in Windsor, England in 1996. Further parks opened in Germany, Japan, South Korea, Malaysia, the United Arab Emirates (Dubai), the United States (California, Florida, and New York), and a Legoland Water Park at Gardaland in Castelnuovo del Garda, Italy in 2021. Parks in Beijing, Shanghai, Sichuan and Shenzhen are currently under construction.
Attractions
The parks are marketed to families with children ages 2 - 12 and most attractions are geared towards younger children. Attractions consist primarily of outdoor flat rides, dark rides, interactive play structures, and splash pads, as well as designated stations for playing with lego bricks.
Parks
There are 11 Legoland parks currently in operation and 5 planned parks.
Europe
North America
Asia
Future parks
Europe
Asia
Former parks
Europe
See also
Legoland Discovery Centre |
https://en.wikipedia.org/wiki/Canon%20T90 | The Canon T90, introduced in 1986, was the top of the line in Canon's T series of 35 mm Single-lens reflex (SLR) cameras. It is the last professional-level manual-focus camera from Canon, and the last professional camera to use the Canon FD lens mount. Although it was overtaken by the autofocus revolution and Canon's new, incompatible EOS (Electro-Optical System) after only a year in production, the T90 pioneered many concepts seen in high-end Canon cameras up to the present day, particularly the user interface, industrial design, and the high level of automation.
Due to its ruggedness, the T90 was nicknamed "the tank" by Japanese photojournalists. Many have still rated it highly even 30+ years after its introduction.
Design
Previous Canon cameras had been wholly in-house design projects. For the T90, Canon brought in German industrial designer Luigi Colani in a collaboration with Canon's own designers. The final design was composed of Colani's ideas by Kunihisa Ito of ODS Co. Ltd., incorporating Colani's distinctive "bio-form" curvaceous shapes. Canon considered Colani's contribution important enough to present him with the first production T90 body, engraved with his name. Computer-aided design techniques were introduced to Canon for the T90, as well as the use of computer controlled (CNC) milling machines to make the molding dies for the shell.
Much work went into human factors engineering to create an ergonomic user interface for the camera. The form of previous cameras was largely dictated by the required locations of mechanical controls on the body, such as the film advance lever, rewind crank, shutter speed dial, shutter release, etc. On the T90, the film transport control is no longer required, while the others are no longer mechanically linked. This gave the designers more freedom to shape the camera to make it easier to control and hold, and to place controls in a way that suited the user rather than a mechanical design.
The T90 introduced features s |
https://en.wikipedia.org/wiki/Nuclear%20localization%20sequence | A nuclear localization signal or sequence (NLS) is an amino acid sequence that 'tags' a protein for import into the cell nucleus by nuclear transport. Typically, this signal consists of one or more short sequences of positively charged lysines or arginines exposed on the protein surface. Different nuclear localized proteins may share the same NLS. An NLS has the opposite function of a nuclear export signal (NES), which targets proteins out of the nucleus.
Types
Classical
These types of NLSs can be further classified as either monopartite or bipartite. The major structural differences between the two are that the two basic amino acid clusters in bipartite NLSs are separated by a relatively short spacer sequence (hence bipartite - 2 parts), while monopartite NLSs are not. The first NLS to be discovered was the sequence PKKKRKV in the SV40 Large T-antigen (a monopartite NLS). The NLS of nucleoplasmin, KR[PAATKKAGQA]KKKK, is the prototype of the ubiquitous bipartite signal: two clusters of basic amino acids, separated by a spacer of about 10 amino acids. Both signals are recognized by importin α. Importin α contains a bipartite NLS itself, which is specifically recognized by importin β. The latter can be considered the actual import mediator.
Chelsky et al. proposed the consensus sequence K-K/R-X-K/R for monopartite NLSs. A Chelsky sequence may, therefore, be part of the downstream basic cluster of a bipartite NLS. Makkah et al. carried out comparative mutagenesis on the nuclear localization signals of SV40 T-Antigen (monopartite), C-myc (monopartite), and nucleoplasmin (bipartite), and showed amino acid features common to all three. The role of neutral and acidic amino acids was shown for the first time in contributing to the efficiency of the NLS.
Rotello et al. compared the nuclear localization efficiencies of eGFP fused NLSs of SV40 Large T-Antigen, nucleoplasmin (AVKRPAATKKAGQAKKKKLD), EGL-13 (MSRRRKANPTKLSENAKKLAKEVEN), c-Myc (PAAKRVKLD) and TUS-protein (KLKIK |
https://en.wikipedia.org/wiki/Mealy%20machine | In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This is in contrast to a Moore machine, whose output values are determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible.
History
The Mealy machine is named after George H. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".
Formal definition
A Mealy machine is a 6-tuple consisting of the following:
a finite set of states
a start state (also called initial state) which is an element of
a finite set called the input alphabet
a finite set called the output alphabet
a transition function mapping pairs of a state and an input symbol to the corresponding next state.
an output function mapping pairs of a state and an input symbol to the corresponding output symbol.
In some formulations, the transition and output functions are coalesced into a single function .
Comparison of Mealy machines and Moore machines
Mealy machines tend to have fewer states:
Different outputs on arcs (n2) rather than states (n).
Moore machines are safer to use:
Outputs change at the clock edge (always one cycle later).
In Mealy machines, input change can cause output change as soon as logic is done—a big problem when two machines are interconnected – asynchronous feedback may occur if one isn't careful.
Mealy machines react faster to inputs:
React in the same cycle—they don't need to wait for the clock.
In Moore machines, more logic may be necessary to decode state into outputs—more gate delays after clock edge.
Diagram
The state diagram for a Mealy machine associates an output value with each transition edge, in contrast to the state diagram for a Moore machine, which associates an output value with each state.
When the input and output alphabet are both , one can als |
https://en.wikipedia.org/wiki/Commandino%27s%20theorem | Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio. In a tetrahedron a median is a line segment that connects a vertex with the centroid of the opposite face – that is, the centroid of the opposite triangle. The point S is also the centroid of the tetrahedron.
History
The theorem is attributed to Commandino, who stated, in his work De Centro Gravitatis Solidorum (The Center of Gravity of Solids, 1565), that the four medians of the tetrahedron are concurrent. However, according to the 19th century scholar Guillaume Libri, Francesco Maurolico (1494–1575) claimed to have found the result earlier. Libri nevertheless thought that it had been known even earlier to Leonardo da Vinci, who seemed to have used it in his work. Julian Coolidge shared that assessment but pointed out that he couldn't find any explicit description or mathematical treatment of the theorem in da Vinci's works. Other scholars have speculated that the result may have already been known to Greek mathematicians during antiquity.
Generalizations
Commandino's theorem has a direct analog for simplexes of any dimension:
Let be a -simplex of some dimension in and let be its vertices. Furthermore, let , be the medians of , the lines joining each vertex with the centroid of the opposite -dimensional facet . Then, these lines intersect each other in a point , in a ratio of .
Full generality
The former analog is easy to prove via the following, more general result, which is analogous to the way levers in physics work:
Let and be natural numbers, so that in an -vector space , pairwise different points are given.
Let be the centroid of the points , let be the centroid of the points , and let be the centroid of all of these points.
Then, one has
In particular, the centroid lies on the line and divides it in a ratio of .
Reusch's theorem
The previous theorem has f |
https://en.wikipedia.org/wiki/Sun%20RPC |
Open Network Computing (ONC) Remote Procedure Call (RPC), commonly known as Sun RPC is a remote procedure call system. ONC was originally developed by Sun Microsystems in the 1980s as part of their Network File System project.
ONC is based on calling conventions used in Unix and the C programming language. It serializes data using the External Data Representation (XDR), which has also found some use to encode and decode data in files that are to be accessed on more than one platform. ONC then delivers the XDR payload using either UDP or TCP. Access to RPC services on a machine are provided via a port mapper that listens for queries on a well-known port (number 111) over UDP and TCP.
ONC RPC was described in RFC 1831, published in 1995. RFC 5531, published in 2009, is the current version. Authentication mechanisms used by ONC RPC are described in RFC 2695, RFC 2203, and RFC 2623.
Implementations of ONC RPC exist in most Unix-like systems. Microsoft supplies an implementation for Windows in their Microsoft Windows Services for UNIX product; in addition, a number of third-party implementation of ONC RPC for Windows exist, including versions for C/C++, Java, and .NET (see external links).
In 2009, Sun relicensed the ONC RPC code under the standard 3-clause BSD license and then reconfirmed by Oracle Corporation in 2010 following confusion about the scope of the relicensing.
ONC is considered "lean and mean", but has limited appeal as a generalized RPC system for WANs or heterogeneous environments. Systems such as DCE, CORBA and SOAP are generally used in this wider role.
See also
XDR - The grammar defined in RFC 1831 is a small extension of the XDR grammar defined in RFC 4506
DCE
XML-RPC |
https://en.wikipedia.org/wiki/Spinal%20stenosis | Spinal stenosis is an abnormal narrowing of the spinal canal or neural foramen that results in pressure on the spinal cord or nerve roots. Symptoms may include pain, numbness, or weakness in the arms or legs. Symptoms are typically gradual in onset and improve with leaning forward. Severe symptoms may include loss of bladder control, loss of bowel control, or sexual dysfunction.
Causes may include osteoarthritis, rheumatoid arthritis, spinal tumors, trauma, Paget's disease of the bone, scoliosis, spondylolisthesis, and the genetic condition achondroplasia. It can be classified by the part of the spine affected into cervical, thoracic, and lumbar stenosis. Lumbar stenosis is the most common, followed by cervical stenosis. Diagnosis is generally based on symptoms and medical imaging.
Treatment may involve medications, bracing, or surgery. Medications may include NSAIDs, acetaminophen, anticonvulsants (gabapentinoids) or steroid injections. Stretching and strengthening exercises may also be useful. Limiting certain activities may be recommended. Surgery is typically only done if other treatments are not effective, with the usual procedure being a decompressive laminectomy.
Spinal stenosis occurs in as many as 8% of people. It occurs most commonly in people over the age of 50. Males and females are affected equally often. The first modern description of the condition is from 1803 by Antoine Portal, and there is evidence of the condition dating back to Ancient Egypt.
Types
The most common forms are lumbar spinal stenosis, at the level of the lower back, and cervical spinal stenosis, which are at the level of the neck. Thoracic spinal stenosis, at the level of the mid-back, is much less common.
In lumbar stenosis, the spinal nerve roots in the lower back are compressed which can lead to symptoms of sciatica (tingling, weakness, or numbness that radiates from the low back and into the buttocks and legs).
Cervical spinal stenosis can be far more dangerous by compress |
https://en.wikipedia.org/wiki/Thionin | Thionins are a family of small proteins found solely in higher plants. Typically, a thionin consists of 45–48 amino acid residues. 6–8 of these are cysteine forming 3–4 disulfide bonds. They include phoratoxins and viscotoxins.
Alpha- and beta- thionins are related to each other. The gamma thionins have a superficially similar structure but are an unrelated class of protein, now called plant defensins.
Activity
The proteins are toxic to animal cells, presumably attacking the cell membrane and rendering it permeable: this results in the inhibition of sugar uptake and allows potassium and phosphate ions, proteins, and nucleotides to leak from cells. Thionins are mainly found in seeds where they may act as a defence against consumption by animals. A barley (Hordeum vulgare) leaf thionin that is highly toxic to plant pathogens and is involved in the mechanism of plant defence against microbial infections has also been identified. The hydrophobic protein crambin from the Abyssinian kale (Crambe abyssinica) is also a member of the thionin family. Some thionins have cytotoxic activity and they are therefore interesting in the development of new drugs against cancer with novel action mechanisms. No thionin has yet been developed into an anti-cancer drug. Thionin is also a minor protein found in mustard (Brassica napus L.) seeds.
Databases
A database for antimicrobial peptides, including thionins is available: PhytAMP.
See also
Crambins
Gamma thionins
Antimicrobial peptides |
https://en.wikipedia.org/wiki/Operating%20margin | In business, operating margin—also known as operating income margin, operating profit margin, EBIT margin and return on sales (ROS)—is the ratio of operating income ("operating profit" in the UK) to net sales, usually expressed in percent.
Net profit measures the profitability of ventures after accounting for all costs.
Return on sales (ROS) is net profit as a percentage of sales revenue. ROS is an indicator of profitability and is often used to compare the profitability of companies and industries of differing sizes. Significantly, ROS does not account for the capital (investment) used to generate the profit. In a survey of nearly 200 senior marketing managers, 69 percent responded that they found the "return on sales" metric very useful.
Unlike Earnings before interest, taxes, depreciation, and amortization (EBITDA) margin, operating margin takes into account depreciation and amortization expenses. {NNP = GNP- depreciation /GNP = GDP- depreciation
Purpose
These financial metrics measure levels and rates of profitability. Probably the most common way to determine the successfulness of a company is to look at the net profits of the business. Companies are collections of projects and markets, individual areas can be judged on how successful they are at adding to the corporate net profit. Not all projects are of equal size, however, and one way to adjust for size is to divide the profit by sales revenue. The resulting ratio is return on sales (ROS), the percentage of sales revenue that gets 'returned' to the company as net profits after all the related costs of the activity are deducted.
Construction
Net profit measures the fundamental profitability of the business. It is the revenues of the activity less the costs of the activity. The main complication is in more complex businesses when overhead needs to be allocated across divisions of the company. Almost by definition, overheads are costs that cannot be directly tied to any specific product or division. The |
https://en.wikipedia.org/wiki/Reflection%20attack | In computer security, a reflection attack is a method of attacking a challenge–response authentication system that uses the same protocol in both directions. That is, the same challenge–response protocol is used by each side to authenticate the other side. The essential idea of the attack is to trick the target into providing the answer to its own challenge.
Attack
The general attack outline is as follows:
The attacker initiates a connection to a target.
The target attempts to authenticate the attacker by sending it a challenge.
The attacker opens another connection to the target, and sends the target this challenge as its own.
The target responds to the challenge.
The attacker sends that response back to the target on the original connection.
If the authentication protocol is not carefully designed, the target will accept that response as valid, thereby leaving the attacker with one fully authenticated channel connection (the other one is simply abandoned).
In simple terms, in this type of attack, the attacker spoofs the IP address of its target, sends a query to the server exploiting the vulnerability that arises from the open nature of the misconfigured server, and the server has no way of distinguishing the spoofed IP address from the real one, and thus believes it to be an authentic request, and in turn provides a response to the query.
Solution
Some of the most common solutions to this attack are described below:
The responder sends its identifier within the response so, if it receives a response that has its identifier in it, it can reject it.
Alice initiates a connection to Bob.
Bob challenges Alice by sending a nonce N.
Alice responds by sending back the MAC calculated on her identifier and the nonce using the shared key Kab.
Bob checks the message and verifies the MAC, making sure it is from Alice and not a message he had sent in the past by making sure that it verifies with A and not B, and on the nonce which is the same as the one h |
https://en.wikipedia.org/wiki/Descending%20limb%20of%20loop%20of%20Henle | Within the nephron of the kidney, the descending limb of loop of Henle is the portion of the renal tubule constituting the first part of the loop of Henle.
Physiology
The permeability is as follows:
Also, the medullary interstitium is highly concentrated (because of the activity of the ascending limb), leading to a strong osmotic gradient from the descending limb to the medulla.
Because of these factors, the concentration of the urine increases dramatically in the descending limb. Osmolality can reach up to 1400 mOsmol/kg by the end of the descending limb.
Histology
The epithelium of the Thick segment is low simple cuboidal epithelium. The epithelium of the Thin segment is simple squamous.
They can be distinguished from the vasa recta by the absence of blood, and they can be distinguished from the thick ascending limb by the thickness of the epithelium.
Nomenclature
Like the ascending limb, the descending limb has thick and thin portions. However, this distinction is not as important physiologically as in the ascending limb, so often the two are treated as one structure. The thick descending limb is less important than the thin descending limb, so often the terms "descending limb" and "thin descending limb" are used interchangeably.
Some sources simply refer to a "thin limb". In this context, the thin ascending limb of loop of Henle would be included.
Additional images |
https://en.wikipedia.org/wiki/Total%20human%20ecosystem | Total human ecosystem (THE) is an eco-centric concept initially proposed by ecology professors Zeev Naveh and Arthur S. Lieberman in 1994.
History of the concept
Naveh and Lieberman (1994) proposed the holistic, eco-centric concept of the Total Human Ecosystem in order to study the anthropocene ecology and improve land use planning and environmental management, within an integrated and interdisciplinary approach. In Naveh's own words, the Total Human Ecosystem is "the highest co-evolutionary ecological entity on earth with landscapes as its concrete three-dimensional ‘Gestalt’ systems, forming the spatial and functional matrix for all organisms". This concept (or meta-concept) integrates human systems (the technosphere, but also in the conceptual space of human noosphere) and natural systems (the geophysical eco-space of the Earth biosphere).
Zev Naveh (1919-2011), the major contributor to this concept, was Professor in landscape ecology at the Technion, Israel Institute of Technology, Haifa. Until 1965 he worked as a range and pasture specialist in Israel and Tanzania. His research at the Technion was devoted to human impacts on Mediterranean landscapes, fire ecology and dynamic conservation management, and the introduction of drought resistant plants for multi-beneficial landscape restoration and beautification.
Almo Farina, who also developed the concept from 2000 onwards, is also a professor of ecology at the Urbino University, Faculty of Environmental Sciences, in Italy.
Concepts and epistemology
The interaction and co-evolution of the human and natural ecosystem interactions are the driving forces for the current Earth system. The Total Human Ecosystem meta-conceptional approach aims to integrate the bio-and geo-centric approaches, derived from the natural sciences, and the approaches derived from the social sciences and the humanities in order to prevent further environmental degradation and drive natural and human systems towards a sustainable future.
|
https://en.wikipedia.org/wiki/Halo%20%28religious%20iconography%29 | A halo (; also called a nimbus, aureole, glory, or gloriole) is a crown of light rays, circle or disk of light that surrounds a person in art. It has been used in the iconography of many religions to indicate holy or sacred figures, and has at various periods also been used in images of rulers and heroes. In the religious art of Ancient Greece, Ancient Rome, Christianity, Hinduism, and Buddhism among other religions, sacred persons may be depicted with a halo in the form of a circular glow, or flames in Asian art, around the head or around the whole body—this last one is often called a mandorla. Halos may be shown as almost any colour or combination of colours, but are most often depicted as golden, yellow or white when representing light or red when representing flames.
Ancient Mesopotamia
Sumerian religious literature frequently speaks of ( in Akkadian), a "brilliant, visible glamour which is exuded by gods, heroes, sometimes by kings, and also by temples of great holiness and by gods' symbols and emblems."
Ancient Greek world
Homer describes a more-than-natural light around the heads of heroes in battle. Depictions of Perseus in the act of slaying Medusa, with lines radiating from his head, appear on a white-ground toiletry box and on a slightly later red-figured vase in the style of Polygnotos, . On painted wares from south Italy, radiant lines or simple haloes appear on a range of mythic figures: Lyssa, a personification of madness; a sphinx; a sea demon; and Thetis, the sea-nymph who was mother to Achilles. The Colossus of Rhodes was a statue of the sun-god Helios and had his usual radiate crown (copied for the Statue of Liberty). Hellenistic rulers are often shown wearing radiate crowns that seem clearly to imitate this effect.
Asian art
In India, use of the halo might date back to the second half of the second millennium BC. Two figures appliqued on a pottery vase fragment from Daimabad's Malwa phase (1600–1400 BC) have been interpreted as a holy f |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.