source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Cooling%20bath | A cooling bath or ice bath, in laboratory chemistry practice, is a liquid mixture which is used to maintain low temperatures, typically between 13 °C and −196 °C. These low temperatures are used to collect liquids after distillation, to remove solvents using a rotary evaporator, or to perform a chemical reaction below room temperature (see Kinetic control).
Cooling baths are generally one of two types: (a) a cold fluid (particularly liquid nitrogen, water, or even air) — but most commonly the term refers to (b) a mixture of 3 components: (1) a cooling agent (such as dry ice or ice); (2) a liquid "carrier" (such as liquid water, ethylene glycol, acetone, etc.), which transfers heat between the bath and the vessel; (3) an additive to depress the melting point of the solid/liquid system.
A familiar example of this is the use of an ice/rock-salt mixture to freeze ice cream. Adding salt lowers the freezing temperature of water, lowering the minimum temperature attainable with only ice.
Mixed-solvent cooling baths
Mixing solvents creates cooling baths with variable freezing points. Temperatures between approximately −78 °C and −17 °C can be maintained by placing coolant into a mixture of ethylene glycol and ethanol, while mixtures of methanol and water span the −128 °C to 0 °C temperature range. Dry ice sublimes at −78 °C, while liquid nitrogen is used for colder baths.
As water or ethylene glycol freeze out of the mixture, the concentration of ethanol/methanol increases. This leads to a new, lower freezing point. With dry ice, these baths will never freeze solid, as pure methanol and ethanol both freeze below −78 °C (−98 °C and −114 °C respectively).
Relative to traditional cooling baths, solvent mixtures are adaptable for a wide temperature range. In addition, the solvents necessary are cheaper and less toxic than those used in traditional baths.
Traditional cooling baths
Water and ice baths
A bath of ice and water will maintain a temperature 0 °C, since |
https://en.wikipedia.org/wiki/LinkExchange | LinkExchange was a popular Internet advertising cooperative, similar in function to a webring, originally known as Internet Link Exchange or ILE.
It was founded in March 1996 by 23-year-old Harvard graduates Tony Hsieh (who later went on to invest in and become the CEO of Zappos) and Sanjay Madan. Ali Partovi later joined them as a third partner in August 1996. Alfred Lin dropped out of his Stanford PhD program to join as CFO. In November 1996, when the company consisted of about 10 people, it moved from Hsieh's and Madan's living room to an office in San Francisco. In May 1997, the company received US$3 million in funding from Sequoia Capital.
In June 1998, LinkExchange acquired MerchantPlanet, an early shopping cart and credit card application. That same month it also acquired Submit It! Inc., developers of Submit It!, ClickTrade, and ListBot.
In November 1998, when LinkExchange had 100 employees, it was acquired by Microsoft for US$265 million.
LinkExchange stopped taking new applications on November 15, 2006. On June 4, 2007 it stopped serving banners. |
https://en.wikipedia.org/wiki/Phytopharmacology | Phytopharmacology is the study and practice of eradicating plant pathology originated from the Verbandes Deutscher Pflanzenärzte (1928–1939), (German Plant Physicians Society), headed by Otto Appel, known as the Organiser of German Plant Protection, who initially defined the terminology of Phyto-Medicine or Plant Medicine. The Deutsche Phytomedizinische Gesellschaft (German Phytomedicine Society) is the German association of phytomedicine practitioners. Academic programs in phytomedicine, such as at the University of Hohenheim, consider the interrelationships between pathogenic microorganisms and crops, disease control methods, and research programs.
In 1936, the term phytopharmacology was used for the field of study on drugs that affect plants. |
https://en.wikipedia.org/wiki/Theatre%20of%20the%20Oppressed | The Theatre of the Oppressed (TO) describes theatrical forms that the Brazilian theatre practitioner Augusto Boal first elaborated in the 1970s, initially in Brazil and later in Europe. Boal was influenced by the work of the educator and theorist Paulo Freire and his book Pedagogy of the Oppressed. Boal's techniques use theatre as means of promoting social and political change in alignment originally with radical-left politics and later with centre-left ideology. In the Theatre of the Oppressed, the audience becomes active, such that as "spect-actors" they explore, show, analyse and transform the reality in which they are living.
History
Although it was first officially adopted in the 1970s, Theatre of the Oppressed, a term coined by Augusto Boal, is a series of theatrical analyses and critiques was first developed in the 1950s. Boal was an avid supporter of using interactive techniques, especially in the context of theatre. Many of his ideas are considered as "a new media perspective", despite the relatively early birth of these ideas. Since then, these ideas have been developed more, giving them meaning in a modern-day context. The creation of the Theatre of the Oppressed is largely based on the idea of dialogue and interaction between audience and performer. Moreover, these ideas have served as a framework for the development and evolution of stronger ideas.
Terminology
Joker/Facilitator/Difficultator
Much of Augusto Boal's theatrical process requires a neutral party to be at the centre of proceedings. This individual is usually called the "facilitator". In Boal's literature this role is referred to as the "joker", in reference to the neutrality of the Joker card in a deck of playing cards.
This person takes responsibility for the logistics of the process and ensures a fair proceeding, but must never comment upon or intervene in the content of the performance, as that is the province of the "spect-actors". Fairness in this context means making sure that the |
https://en.wikipedia.org/wiki/English%20Short%20Title%20Catalogue | The English Short Title Catalogue (ESTC) is a union short-title catalogue of works published between 1473 and 1800, in Britain and its former colonies, notably those in North America, and primarily in English, drawing on the collections of the British Library and other libraries in Britain and around the world. It is co-managed by the British Library and the Center for Bibliographical Studies and Research (CBSR) at the University of California, Riverside. The database is freely searchable.
History
The ESTC began life as the Eighteenth-Century Short Title Catalogue, with the same abbreviation, covering only 1701 to 1800. Earlier printed works had been catalogued in A. W. Pollard and G. R. Redgrave's Short Title Catalogue (1st edn 1926; 2nd edn, 1976–91) for the period 1473 to 1640; and Donald Goddard Wing's similarly titled bibliography (1945–51, with later supplements and addenda) for the period 1641 to 1700. These works were eventually incorporated into the database.
See also
Books in the United Kingdom
Books in the United States
Incunabula Short Title Catalogue
Universal Short Title Catalogue |
https://en.wikipedia.org/wiki/Hapke%20parameters | The Hapke parameters are a set of parameters for an empirical model that is commonly used to describe the directional reflectance properties of the airless regolith surfaces of bodies in the Solar System. The model has been developed by astronomer Bruce Hapke at the University of Pittsburgh.
The parameters are:
— Single scattering albedo. This is the ratio of scattering efficiency to total light extinction (which includes also absorption), for small-particle scattering of light. That is, , where is the scattering coefficient, and is the absorption coefficient
— The width of the opposition surge.
or — The strength of the opposition surge.
or g — The particle phase function parameter, also called the asymmetry factor.
— The effective surface tilt, also called the macroscopic roughness angle.
The Hapke parameters can be used to derive other albedo and scattering properties, such as the geometric albedo, the phase integral, and the Bond albedo.
See also
Albedo
Geometric albedo
Bidirectional reflectance distribution function |
https://en.wikipedia.org/wiki/Sequence%20learning | In cognitive psychology, sequence learning is inherent to human ability because it is an integrated part of conscious and nonconscious learning as well as activities. Sequences of information or sequences of actions are used in various everyday tasks: "from sequencing sounds in speech, to sequencing movements in typing or playing instruments, to sequencing actions in driving an automobile." Sequence learning can be used to study skill acquisition and in studies of various groups ranging from neuropsychological patients to infants. According to Ritter and Nerb, “The order in which material is presented can strongly influence what is learned, how fast performance increases, and sometimes even whether the material is learned at all.” Sequence learning, more known and understood as a form of explicit learning, is now also being studied as a form of implicit learning as well as other forms of learning. Sequence learning can also be referred to as sequential behavior, behavior sequencing, and serial order in behavior.
History
In the first half of the 20th century, Margaret Floy Washburn, John B. Watson, and other behaviorists believed behavioral sequencing to be governed by the reflex chain, which states that stimulation caused by an initial movement triggers an additional movement, which triggers another additional movement, and so on. In 1951, Karl Lashley, a neurophysiologist at Harvard University, published “The Problem of Serial Order in Behavior,” addressing the current beliefs about sequence learning and introducing his hypothesis. He criticized the previous view on the basis of six lines of evidence:
The first line is that movements can occur even when sensory feedback is interrupted. The second is that some movement sequences occur too quickly for elements of the sequences to be triggered by feedback from the preceding elements. Next is that the errors in behavior suggest internal plans for what will be done later. Also, the time to initiate a movement sequence |
https://en.wikipedia.org/wiki/Technology%20aware%20design | Technology Aware Design (TAD) is a research program that started in 2001 at IMEC (an international research & development organization), located at Leuven, in Belgium. It anticipates the end of the traditional "happy scaling" paradigm, where CMOS technology and CMOS design evolved on formally separate tracks, the interface between the two being standard cell, or SPICE compact models (see transistor models for circuit design).
Today, both sides (design and technology) are confronted with the need to understand the other in order to overcome new scaling induced issues. The TAD program pursues analysis and solutions for these scaling induced problems. |
https://en.wikipedia.org/wiki/S-TEC%20Corporation | S-TEC Corporation is a United States corporation that was founded in 1978 and is headquartered in Mineral Wells, Texas. It manufactures flight control systems for the General Aviation aftermarket and for a number of original equipment manufacturers. S-TEC is the leader in the general aviation autopilot market for small- and mid-sized planes.
Customers
Genesys Aerosystems has a number of forward-fit autopilot customers including Pilatus, Indonesian Aerospace, Epic Aircraft, and Aviat Aircraft. Their latest autopilot, the S-TEC 3100, has earned Supplemental Type Certificate (STC) on over 100 aircraft models.
History
Meggitt acquired S-TEC and S-TEC Unmanned Technologies (SUTI) for $24 million in 2000. (DRS Technologies purchased the UAV business from Meggitt in 2002 but later closed the Mineral Wells facility.)
S-TEC was purchased for $38 million by Cobham plc in 2008.
In April 2014, Cobham sold Chelton Flight Systems and S-TEC Corporation to Genesys Aerosystems.
Products
Avionics
Autopilot for small- and mid-sized planes
S-TEC 5000
S-TEC 3100
S-TEC 2100
S-TEC IntelliFlight 1950
S-TEC System 65
S-TEC System 60-2
S-TEC System 55X
S-TEC System 40/50
S-TEC System 30ALT/60PSS
S-TEC System 20/30
SA-200 Altitude Pre-Selector
ST-360 Altitude Pre-Selector w/Alerter
GPSS
Yaw Damper
Aircraft
S-TEC Sentry |
https://en.wikipedia.org/wiki/Quadrature%20domains | In the branch of mathematics called potential theory, a quadrature domain in two dimensional real Euclidean space is a domain D (an open connected set) together with
a finite subset {z1, …, zk} of D such that, for every function u harmonic and integrable over D with respect to area measure, the integral of u with respect to this measure is given by a "quadrature formula"; that is,
where the cj are nonzero complex constants independent of u.
The most obvious example is when D is a circular disk: here k = 1, z1 is the center of the circle, and c1 equals the area of D. That quadrature formula expresses the mean value property of harmonic functions with respect to disks.
It is known that quadrature domains exist for all values of k. There is an analogous definition of quadrature domains in Euclidean space of dimension d larger than 2. There is also an alternative, electrostatic interpretation of quadrature domains: a domain D is a quadrature domain if a uniform distribution of electric charge on D creates the same electrostatic field outside D as does a k-tuple of point charges at the points z1, …, zk.
Quadrature domains and numerous generalizations thereof (e.g., replace area measure by length measure on the boundary of D) have in recent years been encountered in various connections such as inverse problems of Newtonian gravitation, Hele-Shaw flows of viscous fluids, and purely mathematical isoperimetric problems, and interest in them seems to be steadily growing. They were the subject of an international conference at the University of California at Santa Barbara in 2003 and the state of the art as of that date can be seen in the proceedings of that conference, published by Birkhäuser Verlag. |
https://en.wikipedia.org/wiki/Data%20aggregation | Data aggregation is the compiling of information from databases with intent to prepare combined datasets for data processing.
Description
The United States Geological Survey explains that, “when data are well documented, you know how and where to look for information and the results you return will be what you expect.” The source information for data aggregation may originate from public records and criminal databases. The information is packaged into aggregate reports and then sold to businesses, as well as to local, state, and government agencies. This information can also be useful for marketing purposes. In the United States, many data brokers' activities fall under the Fair Credit Reporting Act (FCRA) which regulates consumer reporting agencies. The agencies then gather and package personal information into consumer reports that are sold to creditors, employers, insurers, and other businesses.
Various reports of information are provided by database aggregators. Individuals may request their own consumer reports which contain basic biographical information such as name, date of birth, current address, and phone number. Employee background check reports, which contain highly detailed information such as past addresses and length of residence, professional licenses, and criminal history, may be requested by eligible and qualified third parties. Not only can this data be used in employee background checks, but it may also be used to make decisions about insurance coverage, pricing, and law enforcement. Privacy activists argue that database aggregators can provide erroneous information.
Role of the Internet
The potential of the Internet to consolidate and manipulate information has a new application in data aggregation, also known as screen scraping. The Internet gives users the opportunity to consolidate their usernames and passwords, or PINs. Such consolidation enables consumers to access a wide variety of PIN-protected websites containing personal information |
https://en.wikipedia.org/wiki/B-theory%20of%20time | The B-theory of time, also called the "tenseless theory of time", is one of two positions regarding the temporal ordering of events in the philosophy of time. B-theorists argue that the flow of time is only a subjective illusion of human consciousness, that the past, present, and future are equally real, and that time is tenseless: temporal becoming is not an objective feature of reality. Therefore, there is nothing privileged about the present, ontologically speaking.
The B-theory is derived from a distinction drawn by J. M. E. McTaggart between A series and B series. The B-theory is often drawn upon in theoretical physics, and is seen in theories such as eternalism.
Origin of terms
The terms A-theory and B-theory, first coined by Richard Gale in 1966, derive from Cambridge philosopher J. M. E. McTaggart's analysis of time and change in "The Unreality of Time" (1908), in which events are ordered via a tensed A-series or a tenseless B-series. It is popularly assumed that the A theory represents time like an A-series, while the B theory represents time like a B-series. The terms A and B theory are sometimes used as synonyms to the terms presentism and eternalism, but arguably presentism does not represent time being like an A-series since it denies that there is a future and past in which events can be located.
Events (or "times"), McTaggart observed, may be characterized in two distinct but related ways. On the one hand they can be characterized as past, present or future, normally indicated in natural languages such as English by the verbal inflection of tenses or auxiliary adverbial modifiers. Alternatively, events may be described as earlier than, simultaneous with, or later than others. Philosophers are divided as to whether the tensed or tenseless mode of expressing temporal fact is fundamental. Some philosophers have criticised hybrid theories, where one holds a tenseless view of time but asserts that the present has special properties, as falling foul of M |
https://en.wikipedia.org/wiki/Crozier%20%28mycology%29 | A crozier is an anatomical feature of many fungi in the phylum Ascomycota that forms at the base of asci and looks like a hook-topped shepherd’s staff or stylized religious crosier. Croziers resemble and function similarly to clamp connections on the dikaryotic hyphae of Basidiomycota.
During initial ascus formation in Ascomycota fruitbodies, the crozier helps to maintain the dikaryotic state of both the ascus itself and of the side branch that will continue propagation of the ascogenous hyphae. The tips of developing asci on these ascogenous hyphae curl over. One haploid nucleus migrates into the curved tip while the other compatible haploid nucleus remains in the penultimate space below the hook. The ascus itself forms as a radiating spur branch at the top of the hook. Each nucleus divides, resulting in the formation of a pair of compatible nuclei, i.e. a dikaryon, in the ascus, which is now the penultimate space. Two sister nuclei remain, one in the basal cell and the other in the crozier tip. The tip of the crozier then fuses with the basal cell and walls itself off from the ascus by the formation of a septum. The nucleus from the crozier migrates into the basal cell where the other nucleus remains, thus maintaining a dikaryotic state. Below the base of the ascus, these nuclei migrate together into a growing side branch which is capable of repeating the ascus-crozier formation process indefinitely. Mature croziers are detectable through microscopic examination of mature asci as small curved bridges at the basal septa. A significant minority of Ascomycota lack croziers, hence the presence or absence of croziers is an important taxonomic character. |
https://en.wikipedia.org/wiki/Sky%20and%20Water%20II | Sky and Water II is a lithograph print by the Dutch artist M. C. Escher first printed in 1938. It is similar to the woodcut Sky and Water I, which was first printed only months earlier.
See also
Tessellation
Sources
M. C. Escher—The Graphic Work; Taschen Publishers.
M. C. Escher—29 Master Prints; Harry N. Abrams, Inc., Publishers.
Works by M. C. Escher
1938 paintings
Fish in art
Birds in art
he:שמים ומים#שמים ומים 2 |
https://en.wikipedia.org/wiki/Adequate%20pointclass | In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive functions. |
https://en.wikipedia.org/wiki/Memory%20footprint | Memory footprint refers to the amount of main memory that a program uses or references while running.
The word footprint generally refers to the extent of physical dimensions that an object occupies, giving a sense of its size. In computing, the memory footprint of a software application indicates its runtime memory requirements, while the program executes. This includes all sorts of active memory regions like code segment containing (mostly) program instructions (and occasionally constants), data segment (both initialized and uninitialized), heap memory, call stack, plus memory required to hold any additional data structures, such as symbol tables, debugging data structures, open files, shared libraries mapped to the current process, etc., that the program ever needs while executing and will be loaded at least once during the entire run.
Larger programs have larger memory footprints. An application's memory footprint is roughly proportionate to the number and sizes of shared libraries or classes it loads, whereas static libraries, executable programs and static data areas contribute to a fixed (constant) portion. Programs themselves often do not contribute the largest portions to their own memory footprints; rather, structures introduced by the run-time environment take up most of the memory. For example, a C++ compiler inserts vtables, type info objects and many temporary and anonymous objects that are active during a program's execution. In a Java program, the memory footprint is predominantly made up of the runtime environment in the form of Java virtual machine (JVM) itself that is loaded indirectly when a Java application launches. In addition, on most operating systems, disk files opened by an application too are read into the application's address space, thereby, contributing to its footprint.
Usage trend
During the 1990s, computer memory became cheaper and programs with larger memory footprints became commonplace. This trend has been mostly due to the |
https://en.wikipedia.org/wiki/GDF1 | Growth differentiation factor 1 (GDF1) is a protein that in humans is encoded by the GDF1 gene.
GDF1 belongs to the transforming growth factor beta superfamily that has a role in left-right patterning and mesoderm induction during embryonic development. It is found in the brain, spinal cord and peripheral nerves of embryos. |
https://en.wikipedia.org/wiki/Power%20sum%20symmetric%20polynomial | In mathematics, specifically in commutative algebra, the power sum symmetric polynomials are a type of basic building block for symmetric polynomials, in the sense that every symmetric polynomial with rational coefficients can be expressed as a sum and difference of products of power sum symmetric polynomials with rational coefficients. However, not every symmetric polynomial with integral coefficients is generated by integral combinations of products of power-sum polynomials: they are a generating set over the rationals, but not over the integers.
Definition
The power sum symmetric polynomial of degree k in variables x1, ..., xn, written pk for k = 0, 1, 2, ..., is the sum of all kth powers of the variables. Formally,
The first few of these polynomials are
Thus, for each nonnegative integer , there exists exactly one power sum symmetric polynomial of degree in variables.
The polynomial ring formed by taking all integral linear combinations of products of the power sum symmetric polynomials is a commutative ring.
Examples
The following lists the power sum symmetric polynomials of positive degrees up to n for the first three positive values of In every case, is one of the polynomials. The list goes up to degree n because the power sum symmetric polynomials of degrees 1 to n are basic in the sense of the theorem stated below.
For n = 1:
For n = 2:
For n = 3:
Properties
The set of power sum symmetric polynomials of degrees 1, 2, ..., n in n variables generates the ring of symmetric polynomials in n variables. More specifically:
Theorem. The ring of symmetric polynomials with rational coefficients equals the rational polynomial ring The same is true if the coefficients are taken in any field of characteristic 0.
However, this is not true if the coefficients must be integers. For example, for n = 2, the symmetric polynomial
has the expression
which involves fractions. According to the theorem this is the only way to represent in |
https://en.wikipedia.org/wiki/Gaisser%E2%80%93Hillas%20function | The Gaisser–Hillas function is used in astroparticle physics. It parameterizes the longitudinal particle density in a cosmic ray air shower. The function was proposed in 1977 by Thomas K. Gaisser and Anthony Michael Hillas.
The number of particles as a function of traversed atmospheric depth is expressed as
where is maximum number of particles observed at depth , and and are primary mass and energy dependent parameters.
Using substitutions
, and
the function can be written in an alternative one-parametric (m) form as |
https://en.wikipedia.org/wiki/Dry%20matter | The dry matter or dry weight is a measure of the mass of a completely dried substance.
Analysis of food
The dry matter of plant and animal material consists of all its constituents excluding water. The dry matter of food includes carbohydrates, fats, proteins, vitamins, minerals, and antioxidants (e.g., thiocyanate, anthocyanin, and quercetin). Carbohydrates, fats, and proteins, which provide the energy in foods (measured in kilocalories or kilojoules), make up ninety percent of the dry weight of a diet.
Water composition
Water content in foods varies widely. A large number of foods are more than half water by weight, including boiled oatmeal (84.5%), cooked macaroni (78.4%), boiled eggs (73.2%), boiled rice (72.5%), white meat chicken (70.3%) and sirloin steak (61.9%). Fruits and vegetables are 70 to 95% water. Most meats are on average about 70% water. Breads are approximately 36% water. Some foods have a water content of less than 5%, e.g., peanut butter, crackers, and chocolate cake.
Water content of dairy products is quite variable. Butter is 15% water. Cow's milk ranges between 88 and 86% water. Swiss cheese is 37% percent water. The water content of milk and dairy products varies with the percentage of butterfat so that whole milk has the lowest percentage of water and skimmed milk has the highest.
Dry matter basis
The nutrient or mineral content of foods, animal feeds or plant tissues are often expressed on a dry matter basis, i.e. as a proportion of the total dry matter in the material. For example, a 138-gram apple contains 84% water (116 g water and 22 g dry matter per apple). The potassium content is 0.72% on a dry matter basis, i.e. 0.72% of the dry matter is potassium. The apple, therefore, contains 158 mg potassium (0.72/100 X 22 g). Dried apple contains the same concentration of potassium on a dry matter basis (0.72%), but is only 32% water (68% dry matter). So 138 g of dried apple contains 93.8 g dry matter and 675 mg potassium (0.72/100 |
https://en.wikipedia.org/wiki/Olga%20Hahn-Neurath | Olga Hahn-Neurath (; 20 July 1882 – 20 July 1937) was an Austrian mathematician and philosopher. She is best known for being a member of the Vienna Circle. She was sister of the mathematician Hans Hahn.
Biography
Born in Vienna, Hahn enrolled as a student for math and philosophy studies at the University of Vienna in 1902. She became blind in 1904, when she was 22. In 1911, she became the third ever female graduate in philosophy at Vienna University. Her doctoral thesis, published in 1911, received great compliments from her instructor, Adolf Stöhr, the successor to the chair of Ludwig Boltzmann. Her main interest in math was in the field of Boolean algebra.
In 1912 she married Otto Neurath whom she met during her studies. Olga became a regular participant in the Vienna Circle discussions. Following the defeat of Red Vienna in the Austrian Civil War (February 1934), she fled, through Poland and Denmark to the Netherlands, where she joined her husband. She died on her birthday three years later in The Hague, of a lung infection following an operation. |
https://en.wikipedia.org/wiki/Cup-bearer | A cup-bearer was historically an officer of high rank in royal courts, whose duty was to pour and serve the drinks at the royal table. On account of the constant fear of plots and intrigues (such as poisoning), a person had to be regarded as thoroughly trustworthy to hold the position. He would guard against poison in the king's cup, and was sometimes required to swallow some of the drink before serving it. His confidential relations with the king often gave him a position of great influence. The position of cup-bearer has been greatly valued and given only to a select few throughout history.
The cup-bearer as an honorific role, for example as the Egyptian hieroglyph for "cup-bearer," was used as late as 196 BC in the Rosetta Stone for the Kanephoros cup-bearer Areia, daughter of Diogenes; each Ptolemaic Decree starting with the Decree of Canopus honored a cup-bearer. A much older role was the appointment of Sargon of Akkad as cup-bearer in the 23rd century BC.
Cup-bearers in the Bible
Cup-bearers are mentioned several times in the Bible.
The position is first mentioned in Genesis 40:1, although the Hebrew word (elsewhere translated as "cup-bearer") is here sometimes rendered as "butler". The phrase "chief of the butlers" () accords with the fact that there were often a number of such officials under one as chief. In the Post-exilic period, Nehemiah rose to the high ranking palace position of cup-bearer to King Artaxerxes, the sixth King of the Median / Persian Empire. The position placed his life on the line every day, but gave Nehemiah authority and high pay. He was held in high esteem by Artaxerxes, as the record shows. His financial ability would indicate that the office was a lucrative one.
Cup-bearers are mentioned further in , and , where they, among other evidences of royal splendor, are stated to have impressed the Queen of Sheba with Solomon's glory. The title (), once thought to mean "chief of the cupbearers" is now given a different derivation and |
https://en.wikipedia.org/wiki/List%20of%20audio%20conversion%20software | An audio conversion app (also known as an audio converter) transcodes one audio file format into another; for example, from FLAC into MP3. It may allow selection of encoding parameters for each of the output file to optimize its quality and size. An audio converter uses at least two sets of audio codecs to decode the source file format and to encode the destination file.
Audio converters include:
AIMP
Audacity
Brasero
CDex
Exact Audio Copy
FFmpeg
FL Studio
foobar2000
FormatFactory
Freemake Audio Converter
Free Studio
fre:ac
iTunes
k3b
MediaCoder
MediaHuman Audio Converter
MediaMonkey
MusicFab
SoX
VLC Media Player
Winamp
WMA Convert
See also
Comparison of free software for audio
List of music software |
https://en.wikipedia.org/wiki/Felix%20Browder | Felix Earl Browder (; July 31, 1927 – December 10, 2016) was an American mathematician known for his work in nonlinear functional analysis. He received the National Medal of Science in 1999 and was President of the American Mathematical Society until 2000. His two younger brothers also became notable mathematicians, William Browder (an algebraic topologist) and Andrew Browder (a specialist in function algebras).
Early life and education
Felix Earl Browder was born in 1927 in Moscow, Russia, while his American father Earl Browder, born in Wichita, Kansas, was living and working there. He had gone to the Soviet Union in 1927. His mother was Raissa Berkmann, a Russian Jewish woman from St. Petersburg whom Browder met and married while living in the Soviet Union. As a child, Felix Browder moved with his family to the United States, where his father Earl Browder for a time was head of the American Communist Party and ran for US president in 1936 and 1940. A 1999 book by Alexander Vassiliev, published after the fall of the Soviet Union, said that Earl Browder was recruited in the 1940s as a spy for the Soviet Union.
Felix Browder was a child prodigy in mathematics; he entered MIT at age 16 in 1944 and graduated in 1946 with his first degree in mathematics. In 1946, at MIT he achieved the rank of a Putnam Fellow in the William Lowell Putnam Mathematical Competition. In 1948 (at age 20), he received his doctorate from Princeton University.
Career
Browder had an academic career, encountering difficulty in the 1950s in getting work during the McCarthy era because of his father's communist activities.
Browder headed the University of Chicago's mathematics department for 12 years. He also held posts at MIT, Boston University, Brandeis and Yale. In 1986 he became the first vice president for research at Rutgers University.
Browder received the 1999 National Medal of Science. He also served as president of the American Mathematical Society from 1999 to 2000.
In his outgoi |
https://en.wikipedia.org/wiki/Network%20economy | The network economy is the emerging economic order within the information society. The name stems from a key attribute - products and services are created and value is added through social networks operating on large or global scales. This is in sharp contrast to industrial-era economies, in which ownership of physical or intellectual property stems from its development by a single enterprise. Business models for capturing ownership rights for value embedded in products and services created by social networks are being explored.
Network economy
The network economy may be viewed from a number of perspectives: transition from the industrial economy, digital and information infrastructure, global scale, value networks, and intellectual property rights.
From a transitional point of view, Malone and Laubacher (1998) indicate that the Information Revolution has changed the nature of business activity. Because information can be shared instantly and inexpensively on a global scale, the value of centralized decision making and expensive bureaucracies is greatly diminished. Brand (1999) points out that commerce is being accelerated by the digital and network revolutions and that the role of commerce is to both exploit and absorb these shocks. Some effort must focus on developing new infrastructure while other activity will emphasize governance and evolving culture. Rifkin (2000) notes that real estate has become a business burden in network-based markets.
From an infrastructure perspective, Tapscott (1996) compares information networks of the new economy to highways and the power grid of the industrial economy. He suggests that no country can succeed without state-of-the-art electronic infrastructure. Schwartz (1999) writes that in the future, large companies will manage their purchasing, invoicing, document exchange, and logistics through global networks that connect a billion computing devices.
At global scales, Tapscott (1996) indicates that companies can pr |
https://en.wikipedia.org/wiki/Supralittoral%20zone | The supralittoral zone, also known as the splash zone, spray zone or the supratidal zone, sometimes also referred to as the white zone, is the area above the spring high tide line, on coastlines and estuaries, that is regularly splashed, but not submerged by ocean water. Seawater penetrates these elevated areas only during storms with high tides.
Organisms here must cope also with exposure to air, fresh water from rain, cold, heat and predation by land animals and seabirds. At the top of this area, patches of dark lichens can appear as crusts on rocks. Some types of periwinkles, Neritidae and detritus feeding Isopoda commonly inhabit the lower supralittoral.
See also
Littoral zone
Sublittoral zone
Notes |
https://en.wikipedia.org/wiki/Relative%20change | In any quantitative science, the terms relative change and relative difference are used to compare two quantities while taking into account the "sizes" of the things being compared, i.e. dividing by a standard or reference or starting value. The comparison is expressed as a ratio and is a unitless number. By multiplying these ratios by 100 they can be expressed as percentages so the terms percentage change, percent(age) difference, or relative percentage difference are also commonly used. The terms "change" and "difference" are used interchangeably.
Relative change is often used as a quantitative indicator of quality assurance and quality control for repeated measurements where the outcomes are expected to be the same. A special case of percent change (relative change expressed as a percentage) called percent error occurs in measuring situations where the reference value is the accepted or actual value (perhaps theoretically determined) and the value being compared to it is experimentally determined (by measurement).
The relative change formula is not well-behaved under many conditions. Various alternative formulas, called indicators of relative change, have been proposed in the literature. Several authors have found log change and log points to be satisfactory indicators, but these have not seen widespread use.
Definition
Given two numerical quantities, vref and v with vref some reference value, their actual change, actual difference, or absolute change is . The term absolute difference is sometimes also used even though the absolute value is not taken; the sign of Δ typically is uniform, e.g. across an increasing data series. If the relationship of the value with respect to the reference value (that is, larger or smaller) does not matter in a particular application, the absolute value may be used in place of the actual change in the above formula to produce a value for the relative change which is always non-negative. The actual difference is not usually a g |
https://en.wikipedia.org/wiki/ProMED-mail | Program for Monitoring Emerging Diseases (also known as ProMED-mail, abbreviated ProMED) is among the largest publicly available emerging diseases and outbreak reporting systems in the world. The purpose of ProMED is to promote communication amongst the international infectious disease community, including scientists, physicians, veterinarians, epidemiologists, public health professionals, and others interested in infectious diseases on a global scale. Founded in 1994, ProMED has pioneered the concept of electronic, Internet-based emerging disease and outbreak detection reporting. In 1999, ProMED became a program of the International Society for Infectious Diseases. As of 2016, ProMED has more than 75,000 subscribers in over 185 countries. With an average of 13 posts per day, ProMED provides users with up-to-date information concerning infectious disease outbreaks on a global scale.
ProMED's guiding principles include:
Transparency and a commitment to the unfettered flow of outbreak information
Freedom from political constraints
Availability to all without cost
Commitment to One Health
Service to the global health community
One of the essential global health priorities is the timely recognition and reporting of emerging and re-emerging infectious diseases. Early recognition can enable coordinated and rapid responses to an outbreak, preventing catastrophic morbidity and mortality. Additionally, early detection can alleviate grave economic hardship brought upon by pandemics and emerging diseases. Burgeoning globalization of commerce, finance, manufacturing, and services has fostered ever-increasing movement of people, animals, plants, food, and animal feed. Other contributing factors to the risk of new pathogens emerging and known pathogens re-emerging include climate change, urbanization, land use changes, and political instability. Outbreaks that begin in the most remote parts of the world now spread swiftly to urban centres in countries far away. The epidemi |
https://en.wikipedia.org/wiki/Indiana%20statistical%20areas | The U.S. currently has 51 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated ten combined statistical areas, 15 metropolitan statistical areas, and 26 micropolitan statistical areas in Indiana.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 51 United States statistical areas and 92 counties of the State of Indiana with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designated by the OMB. |
https://en.wikipedia.org/wiki/Biological%20computing | Biological computers use biologically derived molecules — such as DNA and/or proteins — to perform digital or real computations.
The development of biocomputers has been made possible by the expanding new science of nanobiotechnology. The term nanobiotechnology can be defined in multiple ways; in a more general sense, nanobiotechnology can be defined as any type of technology that uses both nano-scale materials (i.e. materials having characteristic dimensions of 1-100 nanometers) and biologically based materials. A more restrictive definition views nanobiotechnology more specifically as the design and engineering of proteins that can then be assembled into larger, functional structures
The implementation of nanobiotechnology, as defined in this narrower sense, provides scientists with the ability to engineer biomolecular systems specifically so that they interact in a fashion that can ultimately result in the computational functionality of a computer.
Scientific background
Biocomputers use biologically derived materials to perform computational functions. A biocomputer consists of a pathway or series of metabolic pathways involving biological materials that are engineered to behave in a certain manner based upon the conditions (input) of the system. The resulting pathway of reactions that takes place constitutes an output, which is based on the engineering design of the biocomputer and can be interpreted as a form of computational analysis. Three distinguishable types of biocomputers include biochemical computers, biomechanical computers, and bioelectronic computers.
Biochemical computers
Biochemical computers use the immense variety of feedback loops that are characteristic of biological chemical reactions in order to achieve computational functionality. Feedback loops in biological systems take many forms, and many different factors can provide both positive and negative feedback to a particular biochemical process, causing either an increase in chemical outp |
https://en.wikipedia.org/wiki/Illinois%20statistical%20areas | The U.S. currently has 43 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated 11 combined statistical areas, 13 metropolitan statistical areas, and 19 micropolitan statistical areas in Illinois.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 43 United States statistical areas and 102 counties of the State of Illinois with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designated by the OM |
https://en.wikipedia.org/wiki/Ohio%20statistical%20areas | The U.S. currently has 57 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated 11 combined statistical areas, 14 metropolitan statistical areas, and 32 micropolitan statistical areas in Ohio.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 57 United States statistical areas and 88 counties of the State of Ohio with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core-based statistical area (CBSA) as designated by the OMB.
The CB |
https://en.wikipedia.org/wiki/Spongiocyte | In the human endocrine system, a spongiocyte is a cell in the zona fasciculata of the adrenal cortex containing lipid droplets that show pronounced vacuolization, due to the way the cells are prepared for microscopic examination.
The lipid droplets contain neutral fats, fatty acids, cholesterol, and phospholipids; all of which are precursors to the steroid hormones secreted by the adrenal glands. The principal hormone secreted from the cells of the zona fasciculata are glucocorticoids, but some androgens are produced as well. |
https://en.wikipedia.org/wiki/Pennsylvania%20statistical%20areas | The United States currently has 49 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated 12 combined statistical areas, 20 metropolitan statistical areas, and 17 micropolitan statistical areas in Pennsylvania.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a Combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 49 United States statistical areas and 67 counties of the Commonwealth of Pennsylvania with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) |
https://en.wikipedia.org/wiki/New%20York%20statistical%20areas | The U.S. state of New York currently has 34 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated seven combined statistical areas, 14 metropolitan statistical areas, and 13 micropolitan statistical areas in .
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 34 United States statistical areas and 62 counties of the State of New York with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designat |
https://en.wikipedia.org/wiki/Seaport%20Centre | Seaport Centre is a high-tech business park located in Redwood City, California, United States, and as of 2007 is one of the largest biotechnology research complexes in the San Francisco Bay Area.
The property consists of of developed building area, and is situated in proximity to the Port of Redwood City. The property is classified as Class A office space and is constructed as a series of separate buildings. The original lands of the Seaport Centre were used as salt evaporation ponds on tidal lands of the San Francisco Bay, a land use that started sometime prior to 1940. As of 2002 leasing rates at Seaport Centre were in the range of $27 per square foot per annum. In 2005, Slough Estates, a United Kingdom-based REIT, purchased the entirety of Seaport Centre to develop it as a biotechnology research center to compete with the existing biotech hubs in Silicon Valley and South San Francisco.
The Seaport Centre is located on generally level ground at approximately above mean sea level. Stormwater surface runoff is pumped from Seaport Centre to discharge into Redwood Creek.
Aerial photographic history
Due to the large scale of this area and its historical lack of accessibility, the area history can be revealed well with aerial photographic records. In 1989, the firm of Earth Metrics Incorporated conducted a review of historic aerial photographs dating back to 1956.(Earth Metrics, 1989) The Seaport Centre site and its environs, as of the 1956 aerial stereo photo, were essentially undeveloped, although extensive salt evaporation ponds were evident on site. Redwood City Planning Department records confirm that the site was used for salt evaporation since sometime prior to World War II.
Analysis of five sets of time staged stereo pairs of aerial photos reveal that the Seaport Centre site remained undeveloped until 1982; up until that time, city records show that the site was zoned as "Tidal Plain", a designation not allowing urban development. Area land use gra |
https://en.wikipedia.org/wiki/New%20Jersey%20statistical%20areas | The U.S. currently has nine statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated two combined statistical areas and seven metropolitan statistical areas in . is the most urban of the 50 U.S. states with the highest population density of any state. Each of the 21 counties of is located in one of the seven metropolitan statistical areas.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 9 United States statistical areas and 21 counties of the State of New Jersey with the following information:
The combined statistical area (CSA) as designated by the |
https://en.wikipedia.org/wiki/Xevious%3A%20Fardraut%20Saga | is a 1988 vertically scrolling shooter video game published by Namco for the MSX2 in Japan. An updated PC Engine version was released two years later. The fifth entry in the Xevious franchise, the player controls a spaceship in its mission to vanquish the Xevious forces before its supercomputer leader GAMP wipes out the entirety of mankind. The player uses two weapons, an air zapper to destroy air-based enemies, and a blaster bomb to destroy ground-based enemies.
Fardraut Saga was part of Namco's attempt to bring the Xevious series back into popularity, after games such as Gradius began winning over players in arcades. Their previous attempt, Super Xevious: GAMP no Nazo, was widely-disliked by fans and a commercial flop. Instead of being produced in-house, Namco enlisted the help of Japanese studio Compile, known for creating the Puyo Puyo, Zanac, and Aleste series, to develop it. Production was led by Compile founder Masamitsu "Moo" Mitani. The MSX2 was chosen as the platform to produce the game on due to Compile having previously developed many games for it.
Fardraut Saga received mixed reviews. Critics focused primarily on the game's high difficulty and average graphics, along with it lacking replay value and having poor music and sound effects. The inclusion of the original Xevious and its new gameplay mechanics had received praise. It was followed by the 3D spin-off Solvalou in arcades in 1991.
Gameplay
In the MSX2 version, players can select between two modes at the title screen: "Recon", a port of the original Xevious; and "Scramble", which is a new 16-area game with new enemies, new boss battles as well as the Andor Genesis, and four ships (Solvalou, Solgrado, Zeodalley, and Gampmission). The two modes are renamed to "Arcade" and "Fardraut" in the PC Engine version. However, Fardraut is a bit different from the original Scramble: it is a 4-stage game with new enemies and a different ship on each level. At the end of each level, a boss battle which is sim |
https://en.wikipedia.org/wiki/Autoconstructive%20evolution | Autoconstructive evolution is a process in which the entities undergoing evolutionary change are themselves responsible for the construction of their own offspring and thus for aspects of the evolutionary process itself. Because biological evolution is always autoconstructive, this term mainly occurs in evolutionary computation, to distinguish artificial life type systems from conventional genetic algorithms where the GA performs replication artificially. The term was coined by Lee Spector.
Importance of autoconstructive evolution
Autoconstructive evolution is a good platform for answering theoretical questions about the evolution of evolvability. Preliminary evidence suggests that the way in which offspring are generated changes substantially over the course of evolution. By studying these patterns, we can begin to understand how evolving systems organize themselves to evolve faster. Ultimately, such an understanding could allow us to improve our ability to solve problems with evolutionary computation.
This increased ability for the process of self-replication to evolve is also thought to be important for recreating the open-ended evolutionary process observed on earth
Examples of autoconstructive evolution
Tierra and Avida
A relatively simple form of autoconstruction occurs in systems such as Tierra and Avida. In these systems, programs replicate themselves by allocating space in memory for their offspring and then looping over all of the instructions in their genome and copying each into the newly allocated space. This is autoconstruction in that the programs are responsible for determining what code ends up in the offspring. Programs most commonly make exact copies of themselves, with changes being introduced exclusively through mutation events. In principle, however, programs can compose a wide range of possible offspring by only copying a subset of their genomes.
PushGP
PushGP is a genetic programming system which evolves code written in the Push lang |
https://en.wikipedia.org/wiki/Michigan%20statistical%20areas | The U.S. currently has 40 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated seven combined statistical areas, 15 metropolitan statistical areas, and 18 micropolitan statistical areas in Michigan.
Statistical areas
The U.S. Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 40 United States statistical areas and 83 counties of the State of Michigan with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designated by |
https://en.wikipedia.org/wiki/Kentucky%20statistical%20areas | The United States currently has 31 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated six combined statistical areas, nine metropolitan statistical areas, and 16 micropolitan statistical areas in Kentucky.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 31 United States statistical areas and 120 counties of the Commonwealth of Kentucky with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as d |
https://en.wikipedia.org/wiki/Gordon%E2%80%93Luecke%20theorem | In mathematics, the Gordon–Luecke theorem on knot complements states that if the complements of two tame knots are homeomorphic, then the knots are equivalent. In particular, any homeomorphism between knot complements must take a meridian to a meridian.
The theorem is usually stated as "knots are determined by their complements"; however this is slightly ambiguous as it considers two knots to be equivalent if there is a self-homeomorphism taking one knot to the other. Thus mirror images are neglected. Often two knots are considered equivalent if they are isotopic. The correct version in this case is that if two knots have complements which are orientation-preserving homeomorphic, then they are isotopic.
These results follow from the following (also called the Gordon–Luecke theorem): no nontrivial Dehn surgery on a nontrivial knot in the 3-sphere can yield the 3-sphere.
The theorem was proved by Cameron Gordon and John Luecke. Essential ingredients of the proof are their joint work with Marc Culler and Peter Shalen on the cyclic surgery theorem, combinatorial techniques in the style of Litherland, thin position, and Scharlemann cycles.
For link complements, it is not in fact true that links are determined by their complements. For example, JHC Whitehead proved that there are infinitely many links whose complements are all homeomorphic to the Whitehead link. His construction is to twist along a disc spanning an unknotted component (as is the case for either component of the Whitehead link). Another method is to twist along an annulus spanning two components. Gordon proved that for the class of links where these two constructions are not possible there are finitely many links in this class with a given complement. |
https://en.wikipedia.org/wiki/Diederich%20Hinrichsen | Diederich Hinrichsen (born 17 February 1939) is a German mathematician who, together with Hans W. Knobloch, established the field of dynamical systems theory and control theory in Germany.
Life and work
Diederich Hinrichsen was born in 1939, and studied mathematics, physics, literature, philosophy, and economics from 1958 to 1965 in Hamburg.
In 1966 he got his PhD at the University of Erlangen under the supervision of Heinz Bauer. His main research area at that time was abstract potential theory, with a special focus on extensions of the Cauchy-Weil theorem to the Choquet boundary. After research visits in Paris and Hamburg, he went to Havana where he helped to re-establish mathematics in Cuba. After an appointment to Bielefeld, he became professor of mathematics at the University of Bremen.
Hinrichsen was the founding director of the Research Center for Dynamical Systems, concentrating on finite- and infinite-dimensional linear systems, stochastic dynamical systems, nonlinear dynamics and stability analysis.
He focused on algebraic systems theory, parameterization problems in control and linear algebra, infinite-dimensional systems, and stability analysis, developing a comprehensive theory of linear systems. In a different direction, with Anthony J. Pritchard (University of Warwick), he worked on concepts of stability radii and spectral value sets, building up a robustness theory covering deterministic and stochastic aspects of dynamical systems.
After retiring in Germany, he is now a professor at Carlos III in Madrid.
Selected publications
1982. Feedback Control of Linear and Nonlinear Systems, with Alberto Isidori. Heidelberg : Springer.
1990. Control of Uncertain Systems. Progress in Systems & Control Theory, with Bengt Martensson. Boston : Birkhäuser.
1999. Advances in Mathematical Systems Theory. In Honor of Diederich Hinrichsen, Boston : Birkhäuser
2005. Mathematical Systems Theory, with A. J. Pritchard. Heidelberg : Springer |
https://en.wikipedia.org/wiki/Precision%20Lightweight%20GPS%20Receiver | The AN/PSN-11 Precision Lightweight GPS Receiver (PLGR, colloquially "plugger") is a ruggedized, hand-held, single-frequency GPS receiver fielded by the United States Armed Forces. It incorporates the Precise Positioning Service — Security Module (PPS-SM) to access the encrypted P(Y)-code GPS signal.
Introduced in January 1990, and extensively fielded until 2004 when it was replaced by its successor, the Defense Advanced GPS Receiver (DAGR). In that time period more than 165,000 PLGRs were procured worldwide, and despite being superseded by the DAGR, large numbers remain in unit inventories and it continues to be the most widely used GPS receiver in the United States military.
The PLGR measures 9.5 by 4.1 by 2.6 inches and weighs with batteries. It was originally delivered to the United States military with a six-year warranty; however, this was extended to ten years in June 2000.
Versions
AN/PSN-11 — NSN 5825-01-374-6643, an early version (tan case)
AN/PSN-11(V)1 "Enhanced PLGR" — NSN 5825-01-395-3513, an upgraded version (green case)
See also
Defense Advanced GPS Receiver
Selective availability anti-spoofing module |
https://en.wikipedia.org/wiki/GDF2 | Growth differentiation factor 2 (GDF2) also known as bone morphogenetic protein (BMP)-9 is a protein that in humans is encoded by the GDF2 gene. GDF2 belongs to the transforming growth factor beta superfamily.
Structure
GDF2 contains an N-terminal TGF-beta-like pro-peptide (prodomain) (residues 56–257) and a C-terminal transforming growth factor beta superfamily domain (325–428). GDF2 (BMP9) is secreted as a pro-complex consisting of the BMP9 growth factor dimer non-covalently bound to two BMP9 prodomain molecules in an open-armed conformation.
Function
GDF2 has a role in inducing and maintaining the ability of embryonic basal forebrain cholinergic neurons (BFCN) to respond to a neurotransmitter called acetylcholine; BFCN are important for the processes of learning, memory and attention. GDF2 is also important for the maturation of BFCN. Another role of GDF2 has been recently suggested. GDF2 is a potent inducer of hepcidin (a cationic peptide that has antimicrobial properties) in liver cells (hepatocytes) and can regulate iron metabolism. The physiological receptor of GDF2 is activin receptor-like kinase 1, ALK1 (also called ACVRL1), an endothelial-specific type I receptor of the TGF-beta receptor family. Endoglin, a type I membrane glycoprotein that forms the TGF-beta receptor complex, is a co-receptor of ALK1 for GDF2/BMP-9 binding. Mutations in ALK1 and endoglin cause hereditary hemorrhagic telangiectasia (HHT), a rare but life-threatening genetic disorder that leads to abnormal blood vessel formation in multiple tissues and organs of the body.
GDF2 is one of the most potent BMPs to induce orthotopic bone formation in vivo. BMP3, a blocker of most BMPs seems not to affect GDF2.
GDF2 induces the differentiation of mesenchymal stem cells (MSCs) to an osteoblast lineage. The Smad signaling pathway of GDF2 target HEY1 inducing the differentiation by up regulating it. Augmented expression of HEY1 increase the mineralization of the cells. RUNX2 is another fa |
https://en.wikipedia.org/wiki/Activity-based%20proteomics | Activity-based proteomics, or activity-based protein profiling (ABPP) is a functional proteomic technology that uses chemical probes that react with mechanistically related classes of enzymes.
Description
The basic unit of ABPP is the probe, which typically consists of two elements: a reactive group (RG, sometimes called a "warhead") and a tag. Additionally, some probes may contain a binding group which enhances selectivity. The reactive group usually contains a specially designed electrophile that becomes covalently-linked to a nucleophilic residue in the active site of an active enzyme. An enzyme that is inhibited or post-translationally modified will not react with an activity-based probe. The tag may be either a reporter such as a fluorophore or an affinity label such as biotin or an alkyne or azide for use with the Huisgen 1,3-dipolar cycloaddition (also known as click chemistry).
Advantages
A major advantage of ABPP is the ability to monitor the availability of the enzyme active site directly, rather than being limited to protein or mRNA abundance. With classes of enzymes such as the serine hydrolases and metalloproteases that often interact with endogenous inhibitors or that exist as inactive zymogens, this technique offers a valuable advantage over traditional techniques that rely on abundance rather than activity.
Multidimensional protein identification technology
In recent years ABPP has been combined with tandem mass spectrometry enabling the identification of hundreds of active enzymes from a single sample. This technique, known as ABPP-MudPIT (multidimensional protein identification technology) is especially useful for profiling inhibitor selectivity as the potency of an inhibitor can be tested against hundreds of targets simultaneously.
ABPP were first reported in the 1990s in the study of proteases.
See also
Mass spectrometry
Proteomics
Related inhibitors MAFP and DIFP
Chemoproteomics |
https://en.wikipedia.org/wiki/Takifugu%20rubripes | Takifugu rubripes, commonly known as the Japanese puffer, Tiger puffer, or torafugu (), is a pufferfish in the genus Takifugu. It is distinguished by a very small genome that has been fully sequenced because of its use as a model species and is in widespread use as a reference in genomics.
Taxonomy and etymology
The species is often referred to in the genomics literature as Fugu rubripes. The genus Fugu is a synonym of the currently preferred Takifugu. Takifugu is Japanese for puffer and rubripes comes from the Latin ruber and pēs meaning ruddy foot.
Distribution and habitat
The species is known from the Sea of Japan, East China Sea and Yellow Sea north to southern Sakhalin, at depths of . It is a demersal species. Spawning occurs in estuaries; young fish can tolerate a wide range of salinities and will remain in river mouths and lagoons, maturing for one year before migrating permanently to the open ocean.
Genome
A feature of this species is that it has a very small genome, which is used as a 'reference' for identifying genes and other elements in human and other vertebrate genomes. The genome was published in 2002 by the International Fugu Genome Consortium via whole genome shotgun sequencing. After being initiated in 1989, it was the first vertebrate genome after the human genome to be made publicly available. It remains among the smallest known vertebrate genomes; its number of base pairs is ~6% and the number of previously known protein-coding genes ~13% that of the human genome, although the number of chromosomes (22) is comparable to that of humans (23). This makes it particularly useful for comparative studies. Current estimates show a total of 392,376,244 base pairs, 1,138 known and 18,093 novel protein-coding genes, and 593 RNA genes.
One type of torafugu, 22-seiki fugu (meaning "22nd-century fugu"), has been genetically modified by removing four leptin receptor genes that control appetite. The result has increased appetite and weight gain, growing on |
https://en.wikipedia.org/wiki/GDF3 | Growth differentiation factor-3 (GDF3), also known as Vg-related gene 2 (Vgr-2) is protein that in humans is encoded by the GDF3 gene. GDF3 belongs to the transforming growth factor beta (TGF-β) superfamily. It has high similarity to other TGF-β superfamily members including Vg1 (found in frogs) and GDF1.
Tissue distribution
Expression of GDF3 occurs in ossifying bone during embryonic development and in the brain, thymus, spleen, bone marrow and adipose tissue of adults.
Function
GDF3 is a bi-functional protein that has some intrinsic activity and also modulate other TGF-β superfamily members, e.g. potentiates the activity of NODAL. It may also inhibit other TGF-β superfamily members (i.e. BMPs), thus regulating the balance between different modes of TGF-beta signaling. It has been shown to negatively and positively control differentiation of embryonic stem cells in mice and humans. This molecule plays a role in mesoderm and definitive endoderm formation during the pre-gastrulation stages of development. |
https://en.wikipedia.org/wiki/GDF5 | Growth/differentiation factor 5 is a protein that in humans is encoded by the GDF5 gene.
The protein encoded by this gene is closely related to the bone morphogenetic protein (BMP) family and is a member of the TGF-beta superfamily. This group of proteins is characterized by a polybasic proteolytic processing site which is cleaved to produce a mature protein containing seven conserved cysteine residues. The members of this family are regulators of cell growth and differentiation in both embryonic and adult tissues. Mutations in this gene are associated with acromesomelic dysplasia, Hunter-Thompson type; brachydactyly, type C; and osteochondrodysplasia, Grebe type. These associations confirm that the gene product plays a role in skeletal development.
GDF5 is expressed in the developing central nervous system, and has a role in skeletal and joint development. It also increases the survival of neurones that respond to the neurotransmitter dopamine, and is a potential therapeutic molecule associated with Parkinson's disease.
See also
Chondrodysplasia, Grebe type |
https://en.wikipedia.org/wiki/CcTalk | ccTalk is a serial protocol in widespread use throughout the money transaction and point-of-sale industry. Peripherals such as the currency detectors for coins and banknotes found in a diverse range of automatic payment equipment such as transportation, ticketing, payphones, amusement machines, and retail cash management use ccTalk to talk to the host controller.
The ccTalk protocol is an open standard.
ccTalk is one of 2 protocols specified by BACTA for use in all AWP machines with serial coin acceptors. (The other is the Host Intelligent Interface protocol developed by Mars Electronics International). It was developed at a company called Coin Controls (hence "cc") on the outskirts of Manchester in north-west England mainly by Engineer Andrew William Barson. The first release of the protocol was in 1996. Coin control would later be renamed Money Controls and from 2010, Crane Payment Solutions.
The protocol uses an asynchronous transfer of character frames in a similar manner to RS232. The main difference is that it uses a single two-way communication data line for half-duplex communication rather than separate transmit and receives lines. It operates at TTL voltages and is ‘multi-drop’ i.e. peripherals can be connected to a common bus and are logically separated by a device address. Each peripheral on the ccTalk bus must have a unique address. The original protocol operated at 4800 baud with subsequent releases standardising on 9600 baud. Low cost bridge chips are now available from a number of manufacturers to allow ccTalk to run over USB at baud rates of at least 1 Mbit/s.
ccTalk protocol stacks have been implemented on a range of devices from tiny Microchip microcontrollers with 512 bytes of ROM to powerful ARM7 32-bit processors. The protocol supports all standard operations for electronic devices such as flash upgrading of firmware, secure transfer of data and detailed diagnostic information.
Advantages of ccTalk include low cost UART technology, a simple |
https://en.wikipedia.org/wiki/Superdeterminism | Superdeterminism describes the set of local hidden-variable theories consistent with the results of experiments derived from Bell's theorem which include a local correlation between the measurement settings and the state being measured. Superdeterministic theories are not interpretations of quantum mechanics, but deeper theories which reproduce the predictions of quantum mechanics on average, for which a few toy models have been proposed. In such theories, "the probabilities of quantum theory then become no more mysterious than those used in classical statistical mechanics." Postulating that systems being measured are correlated with the settings of the measurements apparatus, is a violation of what Bell described as a "vital assumption" of his theorem. A hidden-variables theory which is superdeterministic can thus fulfill Bell's notion of local causality and still violate the inequalities derived from Bell's theorem. Unlike , superdeterministic theories cannot be excluded by Bell-type experiments (though they may be bounded) as ultimately the past light cones of all measurement settings and measured states overlap at the Big Bang implying a necessarily shared causal past and thus the possibility of local causal dependence.
Overview
Bell's theorem assumes that the measurements performed at each detector can be chosen independently of each other and of the hidden variables that determine the measurement outcome. This relation is often referred to as measurement independence or statistical independence. In a superdeterministic theory this relation is not fulfilled; the hidden variables are necessarily correlated with the measurement setting. Since the choice of measurements and the hidden variable are predetermined, the results at one detector can depend on which measurement is done at the other without any need for information to travel faster than the speed of light. The assumption of statistical independence is sometimes referred to as the free choice or free wi |
https://en.wikipedia.org/wiki/Atomistix%20ToolKit | Atomistix ToolKit (ATK) is a commercial software for atomic-scale modeling and simulation of nanosystems. The software was originally developed by Atomistix A/S, and was later acquired by QuantumWise following the Atomistix bankruptcy. QuantumWise was then acquired by Synopsys in 2017.
Atomistix ToolKit is a further development of TranSIESTA-C, which in turn in based on the technology, models, and algorithms developed in the academic codes TranSIESTA, and McDCal, employing localized basis sets as developed in SIESTA.
Features
Atomistix ToolKit combines density functional theory with non-equilibrium Green's functions for first principles electronic structure and transport calculations of
electrode—nanostructure—electrode systems (two-probe systems)
molecules
periodic systems (bulk crystals and nanotubes)
The key features are
Calculation of transport properties of two-probe systems under an applied bias voltage
Calculation of energy spectra, wave functions, electron densities, atomic forces, effective potentials etc.
Calculation of spin-polarized physical properties
Geometry optimization
A Python-based NanoLanguage scripting environment
See also
Atomistix Virtual NanoLab — a graphical user interface
NanoLanguage
Atomistix
Quantum chemistry computer programs
Molecular mechanics programs |
https://en.wikipedia.org/wiki/NanoLanguage | NanoLanguage is a scripting interface built on top of the interpreted programming language Python, and is primarily intended for simulation of physical and chemical properties of nanoscale systems.
Introduction
Over the years, several electronic-structure codes based on density functional theory have been developed by different groups of academic researchers; VASP, Abinit, SIESTA, and Gaussian are just a few examples. The input to these programs is usually a simple text file written in a code-specific format with a set of code-specific keywords.
NanoLanguage was introduced by Atomistix A/S as an interface to Atomistix ToolKit (version 2.1) in order to provide a more flexible input format. A NanoLanguage script (or input file) is just a Python program and can be anything from a few lines to a script performing complex numerical simulations, communicating with other scripts and files, and communicating with other software (e.g. plotting programs).
NanoLanguage is not a proprietary product of Atomistix and can be used as an interface to other density functional theory codes as well as to codes utilizing e.g. tight-binding, k.p, or quantum-chemical methods.
Features
Built on top of Python, NanoLanguage includes the same functionality as Python and with the same syntax. Hence, NanoLanguage contains, among other features, common programming elements (for loops, if statements, etc.), mathematical functions, and data arrays.
In addition, a number of concepts and objects relevant to quantum chemistry and physics are built into NanoLanguage, e.g. a periodic table, a unit system (including both SI units and atomic units like Ångström), constructors of atomic geometries, and different functions for density-functional theory and transport calculations.
Example
This NanoLanguage script uses the Kohn–Sham method to calculate the total energy of a water molecule as a function of the bending angle.
# Define function for molecule setup
def waterConfiguration(angle, bondLeng |
https://en.wikipedia.org/wiki/Graduate%20Medical%20Program | Graduate Medical Program (GMP), or sometimes also known as Graduate Entry Program (GEP) or Graduate Entry Medicine (GEM), are medical programs usually of 4-years duration where applicants are university graduates who have taken aptitude tests such as the GAMSAT, UKCAT or MCAT. These aptitude tests are different from the UMAT test for high school graduates. Medical programs in the United States technically do not require the completion of a previous degree, but do require the completion of 2–3 years of pre-medical sciences at the university level and so are thus classified as second entry degrees. However, since in places such as Australia medical applicants were historically generally high school graduates and only recently have medical schools changed to requiring the completion of a previous bachelor's degree, the terms Graduate Medical Program and Graduate Entry Medicine arose to differentiate the new courses.
Some countries currently offering 4-year medical courses for university degree holders
Europe
Ireland
Poland
Czech Republic
Netherlands
Portugal
Ukraine
United Kingdom
Georgia
Rest of world
Australia
Canada
Israel
United States
Malaysia (Perdana University – University of San Diego – PUGScM)
South Africa
Singapore
Philippines
Ghana
Lebanon
UAE
South Korea has graduated medical schools and special admission for scholar
Japan has special admission program for scholar
Caribbean
Mexico
Qatar (Weill Cornell)
See also
First professional degree
Medical education |
https://en.wikipedia.org/wiki/Fructoside | Fructosides are glycosides where the glycone group is fructose.
Fructosyl transferases
In enzymology, enzymes that add a fructose group to a molecule are called fructosyl-transferases, beta-D-fructofuranosyl transferases or fructotranferases. Examples are:
aldose beta-D-fructosyltransferase
2,1-fructan:2,1-fructan 1-fructosyltransferase
6G-fructosyltransferase
Inulin fructotransferase (DFA-I-forming)
Inulin fructotransferase (DFA-III-forming)
Levan fructotransferase (DFA-IV-forming)
Levansucrase |
https://en.wikipedia.org/wiki/Oskar%20Bolza | Oskar Bolza (12 May 1857 – 5 July 1942) was a German mathematician, and student of Felix Klein. He was born in Bad Bergzabern, Palatinate, then a district of Bavaria, known for his research in the calculus of variations, particularly influenced by Karl Weierstrass' 1879 lectures on the subject.
Life
Bolza entered the University of Berlin in 1875. His first interest was in linguistics, then he studied physics with Gustav Kirchhoff and Hermann von Helmholtz, but experimental work did not attract him, so he decided on mathematics in 1878. The years 1878–1881 were spent studying under Elwin Christoffel and Theodor Reye at Strasbourg, Hermann Schwarz at Göttingen, and particularly Karl Weierstrass in Berlin.
In the spring of 1888 he landed in Hoboken, New Jersey, searching for a job in the United States: he succeeded in finding a position in 1889 at Johns Hopkins University and then at the then newly founded Clark University. In 1892 Bolza joined the University of Chicago and worked there up to 1910 when, after becoming unhappy in the United States as a consequence of the death of his friend Heinrich Maschke in 1908, he and his wife returned to Freiburg in Germany. The events of World War I greatly affected Bolza and, after 1914, he stopped his research in mathematics. He became interested in religious psychology, languages (particularly Sanskrit), and Indian religions. He published the book Glaubenlose Religion (religion without belief) in 1930 under the pseudonym F. H. Marneck. However, later in his life, he returned to do research in mathematics, lecturing at University of Freiburg from 1929 up to his retirement in 1933.
Academic career
After eight years of study and many changes of direction, he completed his doctoral studies at the Georg-August-Universität Göttingen in 1886, where he wrote his thesis under the supervision of Felix Klein.
In 1889 Bolza worked at Johns Hopkins University, where Simon Newcomb gave him a temporary short-term appointment "reader in |
https://en.wikipedia.org/wiki/Management%20features%20new%20to%20Windows%20Vista | Windows Vista contains a range of new technologies and features that are intended to help network administrators and power users better manage their systems. Notable changes include a complete replacement of both the Windows Setup and the Windows startup processes, completely rewritten deployment mechanisms, new diagnostic and health monitoring tools such as random access memory diagnostic program, support for per-application Remote Desktop sessions, a completely new Task Scheduler, and a range of new Group Policy settings covering many of the features new to Windows Vista. Subsystem for UNIX Applications, which provides a POSIX-compatible environment is also introduced.
Setup
The setup process for Windows Vista has been completely rewritten and is now image-based instead of being sector-based as previous versions of Windows were. The Windows Preinstallation Environment (WinPE) has been updated to host the entire setup process in a graphical environment (as opposed to text-based environments of previous versions of Windows), which allows the use of input devices other than the keyboard throughout the entire setup process. The new interface resembles Windows Vista itself, with features such as ClearType fonts and Windows Aero visual effects. Prior to copying the setup image to disk, users can create, format, and graphically resize disk partitions. The new image-based setup also reduces the duration of the installation procedure when contrasted with Windows XP; Microsoft estimates that Windows Vista can install in as few as 20 minutes despite being more than three times the size of its predecessor.
Windows XP only supported loading storage drivers from floppy diskettes during initialization of the setup process; Windows Vista supports loading drivers for SATA, SCSI, and RAID controllers from any external source in addition to floppy diskettes prior to its installation.
At the end of the setup process, Windows Vista can also automatically download and apply securit |
https://en.wikipedia.org/wiki/Ad%20hoc%20wireless%20distribution%20service | Ad hoc Wireless Distribution Service (AWDS) is a layer 2 routing protocol to connect mobile ad hoc networks, sometimes called wireless mesh networks. It is based on a link-state routing protocol, similar to OLSR.
Principle of operation
AWDS uses a link-state routing protocol for organizing the network. In contrast to other implementations like OLSR it operates in layer 2. That means no IP addresses must be assigned because the unique MAC addresses of the WLAN hardware is used instead. Furthermore, all kinds of layer 3 protocols can be used, like IP, DHCP, IPv6, IPX, etc. The protocol daemon creates a virtual network interface, which can be used by the kernel like a typical LAN interface.
Alternatives
The list of ad hoc routing protocols contains a large set of alternatives. However, most of them
are academic and do not exist as practical implementations. |
https://en.wikipedia.org/wiki/Connecticut%20statistical%20areas | The U.S. currently has nine statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated three combined statistical areas, five metropolitan statistical areas, and one micropolitan statistical area in Connecticut.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the nine United States statistical areas and eight counties of the State of Connecticut with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as des |
https://en.wikipedia.org/wiki/Piscicide | A piscicide is a chemical substance which is poisonous to fish. The primary use for piscicides is to eliminate a dominant species of fish in a body of water, as the first step in attempting to populate the body of water with a different fish. They are also used to combat parasitic and invasive species of fish.
Examples of piscicides include rotenone, saponins, TFM, niclosamide and Antimycin A (Fintrol).
Plant-based piscicides
Historically, fishing techniques of indigenous people around the world have frequently included the use of plant-based piscicides. Many of these plants are natural sources of rotenone and saponins.
The genera Tephrosia, Wikstroemia, and Barringtonia are well known as fish poisons.
See also
Cyanide fishing |
https://en.wikipedia.org/wiki/Tennessee%20statistical%20areas | The U.S. currently has 34 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated 7 combined statistical areas, 10 metropolitan statistical areas, and 17 micropolitan statistical areas in Tennessee.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 34 United States statistical areas and 95 counties of the State of Tennessee with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designated by the OM |
https://en.wikipedia.org/wiki/Chaos%20communications | Chaos communications is an application of chaos theory which is aimed to provide security in the transmission of information performed through telecommunications technologies. For secure communications, one has to understand that the contents of the message transmitted are inaccessible to possible eavesdroppers.
In chaos communications security (i.e., privacy) is based on the complex dynamic behaviors provided by chaotic systems. Some properties of chaotic dynamics, such as complex behaviour, noise-like dynamics (pseudorandom noise) and spread spectrum, are used to encode data. On the other hand, chaos being a deterministic phenomenon, it is possible to decode data using this determinism. In practice, implementations of chaos communications devices resort to one of two chaotic phenomena: synchronization of chaos, or control of chaos.
To implement chaos communications using such properties of chaos, two chaotic oscillators are required a transmitter (or master) and receiver (or slave). At the transmitter, a message is added onto a chaotic signal and then, the message is masked in the chaotic signal. As it carries the information, the chaotic signal is also called chaotic carrier.
Synchronizing these oscillators is similar to synchronizing random neural nets in neural cryptography.
When chaos synchronization is used, a basic scheme of a communications device (Cuomo and Oppenheim 1993) is made by two identical chaotic oscillators. One of them is used as the transmitter, and the other as the receiver. They are connected in a configuration where the transmitter drives the receiver in such a way that identical synchronization of chaos between the two oscillators is achieved. For the purpose of transmission of information, at the transmitter, a message is added as a small perturbation to the chaotic signal that drives the receiver. In this way, the message transmitted is masked by the chaotic signal. When the receiver synchronizes to the transmitter, the message is dec |
https://en.wikipedia.org/wiki/Inhibitor%20of%20apoptosis | Inhibitors of apoptosis are a group of proteins that mainly act on the intrinsic pathway that block programmed cell death, which can frequently lead to cancer or other effects for the cell if mutated or improperly regulated. Many of these inhibitors act to block caspases, a family of cysteine proteases that play an integral role in apoptosis. Some of these inhibitors include the Bcl-2 family, viral inhibitor crmA, and IAP's.
Apoptosis, or programmed cell death, is a highly regulated process used by many multicellular organisms. Like any regulated process, apoptosis is subject to either activation or inhibition by a variety of chemical factors. Apoptosis can be triggered through two main pathways; extrinsic and intrinsic pathways. The extrinsic pathway mostly involves extracellular signals triggering intracellular apoptosis mechanisms by binding to receptors in the cell membrane and sending signals from the outside of the cell. Intrinsic pathways involved internal cell signaling primarily through the mitochondria.
Bcl-2 family
The Bcl-2 family of proteins can either inhibit or promote apoptosis and members are characterized by the Bcl-2 homologous domains BH1, BH2, BH3, and BH4. The combinations of the domains in the proteins determine its role in the apoptosis process. Members of the family that inhibit apoptosis include Bcl-2 itself, Bcl-XL, and Bcl-w, which possess all four of the domains. Bcl-2 is the most well known of the anti-apoptotic members, and is classified as an oncogene. Studies have shown that the Bcl-2 oncogene may inhibit apoptosis in two ways; either by directly controlling the activation of caspases, or by disrupting the channels that allow proapoptotic factors from leaving the mitochondria.
Activity in the cell
Regarding the activation of caspases, there exists a gene called ced-9 in C. elegans that protects against cell death that is a part of the Bcl-2 family. ced-9 encodes a protein that is structurally similar to Bcl-2 that binds to anot |
https://en.wikipedia.org/wiki/Wisconsin%20statistical%20areas | The U.S. currently has 36 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated nine combined statistical areas, 15 metropolitan statistical areas, and 12 micropolitan statistical areas in Wisconsin.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 36 United States statistical areas and 72 counties of the State of Wisconsin with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designated by the |
https://en.wikipedia.org/wiki/Ishido%3A%20The%20Way%20of%20Stones | Ishido: The Way of Stones is a puzzle video game released in 1990 by Accolade and developed by Publishing International. It was designed by Michael Feinberg and programmed by Ian Gilman and Michael Sandige. The game's producer was Brad Fregger, and Brodie Lockard (the designer of the Shanghai computer game) contributed with graphics.
Gameplay
Ishido is a puzzle board game consisting of a set of 72 stones and a game board of 96 squares.
Every stone has two attributes: a color and a symbol. There are six colors and six symbols in each stone set, thus creating 36 unique stones. Since each stone comes in a pair, there are therefore 72 stones in each stone set.
The primary objective of Ishido is to place all 72 stones onto the board of 96 squares. The challenge arises because stones must be placed adjacent to others that they match, either by color or symbol. When the board begins to fill up, this objective is not so easily accomplished.
A valuable move is the 4-way, in which a stone is placed in the midst of four others, two of which are matched by color, and two which are matched by symbol.
Ishido comes with six differently themed stone sets, five different game boards, and a variety of Oriental chimes and sound effects.
Release history
After Epyx failed to publish it for Christmas '89, the original Ishido game was published by Publishing International in a limited edition in a hand-made walnut slip box with disks for Mac and Mac II. The limited edition retailed for $495. Then the following year, 1990, Accolade published the first mass-market version for the Macintosh, with ports to DOS, Amiga, Game Boy, and Sega Genesis in the same year. The Atari Lynx and Famicom Disk System versions were published in 1991. The Microsoft Entertainment Pack contains an adaptation of Ishido called Stones.
The Genesis port of the game was involved in the copyright trial, Sega v. Accolade.
A physical board game version of Ishido was published in Japan by ASCII in 1992.
Receptio |
https://en.wikipedia.org/wiki/Texas%20statistical%20areas | The U.S. currently has 84 statistical areas that have been delineated by the Office of Management and Budget (OMB). On March 6, 2020, the OMB delineated 13 combined statistical areas, 25 metropolitan statistical areas, and 46 micropolitan statistical areas in Texas.
Statistical areas
The Office of Management and Budget (OMB) has designated more than 1,000 statistical areas for the United States and Puerto Rico. These statistical areas are important geographic delineations of population clusters used by the OMB, the United States Census Bureau, planning organizations, and federal, state, and local government entities.
The OMB defines a core-based statistical area (commonly referred to as a CBSA) as "a statistical geographic entity consisting of the county or counties (or county-equivalents) associated with at least one core of at least 10,000 population, plus adjacent counties having a high degree of social and economic integration with the core as measured through commuting ties with the counties containing the core." The OMB further divides core-based statistical areas into metropolitan statistical areas (MSAs) that have "a population of at least 50,000" and micropolitan statistical areas (μSAs) that have "a population of at least 10,000, but less than 50,000."
The OMB defines a combined statistical area (CSA) as "a geographic entity consisting of two or more adjacent core-based statistical areas with employment interchange measures of at least 15%." The primary statistical areas (PSAs) include all combined statistical areas and any core-based statistical area that is not a constituent of a combined statistical area.
Table
The table below describes the 84 United States statistical areas and 254 counties of the State of Texas with the following information:
The combined statistical area (CSA) as designated by the OMB.
The CSA population according to 2019 US Census Bureau population estimates.
The core based statistical area (CBSA) as designated by the OMB.
The |
https://en.wikipedia.org/wiki/Organisation-based%20access%20control | In computer security, organization-based access control (OrBAC) is an access control model first presented in 2003. The current approaches of the access control rest on the three entities (subject, action, object) to control the access the policy specifies that some subject has the permission to realize some action on some object.
OrBAC allows the policy designer to define a security policy independently of the implementation. The chosen method to fulfill this goal is the introduction of an abstract level.
Subjects are abstracted into roles. A role is a set of subjects to which the same security rule apply.
Similarly, an activity is a set of actions to which the same security rule apply.
And, a view is a set of objects to which the same security rule apply.
Each security policy is defined for and by an organization. Thus, the specification of the security policy is completely parameterized by the organization so that it is possible to handle simultaneously several security policies associated with different organizations. The model is not restricted to permissions, but also includes the possibility to specify prohibitions and obligations. From the three abstract entities (roles, activities, views), abstract privileges are defined. And from these abstract privileges, concrete privileges are derived.
OrBAC is context sensitive, so the policy could be expressed dynamically. Furthermore, OrBAC owns concepts of hierarchy (organization, role, activity, view, context) and separation constraints.
See also
External links
OrBAC site
MotOrBAC site (OrBAC simulation and conflict detection tool)
Computer access control
Access control |
https://en.wikipedia.org/wiki/Bootstrapping%20%28finance%29 | In finance, bootstrapping is a method for constructing a (zero-coupon) fixed-income yield curve from the prices of a set of coupon-bearing products, e.g. bonds and swaps.
A bootstrapped curve, correspondingly, is one where the prices of the instruments used as an input to the curve, will be an exact output, when these same instruments are valued using this curve.
Here, the term structure of spot returns is recovered from the bond yields by solving for them recursively, by forward substitution: this iterative process is called the bootstrap method.
The usefulness of bootstrapping is that using only a few carefully selected zero-coupon products, it becomes possible to derive par swap rates (forward and spot) for all maturities given the solved curve.
Methodology
As stated above, the selection of the input securities is important, given that there is a general lack of data points in a yield curve (there are only a fixed number of products in the market). More importantly, because the input securities have varying coupon frequencies, the selection of the input securities is critical. It makes sense to construct a curve of zero-coupon instruments from which one can price any yield, whether forward or spot, without the need of more external information.
Note that certain assumptions (e.g. the interpolation method) will always be required.
General methodology
The general methodology is as follows: (1) Define the set of yielding products - these will generally be coupon-bearing bonds; (2) Derive discount factors for the corresponding terms - these are the internal rates of return of the bonds; (3) 'Bootstrap' the zero-coupon curve, successively calibrating this curve such that it returns the prices of the inputs. A generically stated algorithm for the third step is as follows; for more detail see .
For each input instrument, proceeding through these in terms of increasing maturity:
solve analytically for the zero-rate where this is possible (see side-bar example)
if |
https://en.wikipedia.org/wiki/BiM | BiM (Binary MPEG format for XML) is an international standard defining a generic binary format for encoding XML documents.
The technical specifications for BiM are found in: MPEG systems technologies - Part 1: Binary MPEG format for XML (ISO/IEC 23001-1) It is also known as MPEG-B Part 1.
Overview
BiM addresses a broad spectrum of applications and requirements by providing generic methods for transmitting and compressing XML documents.
The binary MPEG format for XML relies on schema knowledge between encoder and decoder in order to reach high compression efficiency, while providing fragmentation mechanisms for ensuring transmission and processing flexibility.
BiM also defines means to compile and transmit schema knowledge information to enable the decoding of compressed XML documents without a priori schema knowledge at the receiving terminal.
BiM is used as the standard binary format for XML encoding in the following technical specifications:
MPEG-4 Part 20 (ISO/IEC 14496-20) - Lightweight Application Scene Representation (LASeR) and Simple Aggregation Format (SAF).
MPEG-7 Systems (ISO/IEC 15938-1)
MPEG-21 Binary Format (ISO/IEC 21000-16)
TV-Anytime - Broadcast and On-line Services: Search, select, and rightful use of content on personal storage systems (ETSI TS 102 822)
ARIB - Coding, Transmission and Storage Specification for Broadcasting System Based on Home Servers (ARIB-STD B38)
ISDB#ISDB-Tmm - ISDB-Tmm (ARIB-B33)
DVB - Carriage and signalling of TV-Anytime information in DVB transport streams (ETSI TS 102 323)
DVB - Carriage of Broadband Content Guide information over Internet Protocol (ETSI TS 102 539)
DVB - Datacast over DVB-H: Electronic Service Guide (ETSI TS 102 471)
See also
Binary XML
EXI
Extensible MPEG-4 Textual Format |
https://en.wikipedia.org/wiki/Crystalline%20cohomology | In mathematics, crystalline cohomology is a Weil cohomology theory for schemes X over a base field k. Its values Hn(X/W) are modules over the ring W of Witt vectors over k. It was introduced by and developed by .
Crystalline cohomology is partly inspired by the p-adic proof in of part of the Weil conjectures and is closely related to the algebraic version of de Rham cohomology that was introduced by Grothendieck (1963). Roughly speaking, crystalline cohomology of a variety X in characteristic p is the de Rham cohomology of a smooth lift of X to characteristic 0, while de Rham cohomology of X is the crystalline cohomology reduced mod p (after taking into account higher Tors).
The idea of crystalline cohomology, roughly, is to replace the Zariski open sets of a scheme by infinitesimal thickenings of Zariski open sets with divided power structures. The motivation for this is that it can then be calculated by taking a local lifting of a scheme from characteristic p to characteristic 0 and employing an appropriate version of algebraic de Rham cohomology.
Crystalline cohomology only works well for smooth proper schemes. Rigid cohomology extends it to more general schemes.
Applications
For schemes in characteristic p, crystalline cohomology theory can handle questions about p-torsion in cohomology groups better than p-adic étale cohomology. This makes it a natural backdrop for much of the work on p-adic L-functions.
Crystalline cohomology, from the point of view of number theory, fills a gap in the l-adic cohomology information, which occurs exactly where there are 'equal characteristic primes'. Traditionally the preserve of ramification theory, crystalline cohomology converts this situation into Dieudonné module theory, giving an important handle on arithmetic problems. Conjectures with wide scope on making this into formal statements were enunciated by Jean-Marc Fontaine, the resolution of which is called p-adic Hodge theory.
Coefficients
For a variety X ove |
https://en.wikipedia.org/wiki/Geo%20%28microformat%29 | Geo is a microformat used for marking up geographical coordinates (latitude and longitude) in HTML (or XHTML). Coordinates are expected in angular units of degrees and geodetic datum WGS84. Although termed a "draft" specification, the format is a de facto standard, stable and in widespread use; not least as a sub-set of the published hCalendar and hCard microformat specifications, neither of which is still a draft.
Use of Geo allows parsing tools (for example other websites, or Firefox's Operator extension) to extract the locations, and display them using some other website or web mapping tool, or to load them into a GPS device, index or aggregate them, or convert them into an alternative format.
Usage
If latitude is present, so must be longitude, and vice versa.
The same number of decimal places should be used in each value, including trailing zeroes.
The Geo microformat is applied using three HTML classes. For example, the marked-up text:
<div>Belvide: 52.686; -2.193</div>
becomes:
<div class="geo">Belvide: <span class="latitude">52.686</span>; <span class="longitude">-2.193</span></div>
by adding the class-attribute values "geo", "latitude" and "longitude".
This will display
Belvide: 52.686; -2.193
and a geo microformat for that location, Belvide Reservoir, which will be detected, on this page, by microformat parsing tools.
hCard
Each Geo microformat may be wrapped in an hCard microformat, allowing for the inclusion of personal, organisational or venue names, postal addresses, telephone contacts, URLs, pictures, etc.
Extensions
There are three proposals, none mutually-exclusive, to extend the geo microformat:
geo-extension - for representing coordinates on other planets, moons etc., and with non-WGS84 schema
geo-elevation - for representing altitude
geo-waypoint - for representing routes and boundaries, using waypoints
Users
Organisations and websites using Geo include:
Flickr - on over three million photo pages
Geograph - on over one mill |
https://en.wikipedia.org/wiki/Pyrophosphatase | Pyrophosphatases, also known as diphosphatases, are acid anhydride hydrolases that act upon diphosphate bonds.
Examples include:
Inorganic pyrophosphatase, which acts upon the free pyrophosphate ion
Tobacco acid pyrophosphatase, which catalyses the hydrolysis of a phosphoric ester
Various organic pyrophosphatases, which act upon organic molecules with the pyrophosphate group (but excluding triphosphatases that act on the final bond):
Thiamine pyrophosphatase
See also |
https://en.wikipedia.org/wiki/Integrative%20bioinformatics | Integrative bioinformatics is a discipline of bioinformatics that focuses on problems of data integration for the life sciences.
With the rise of high-throughput (HTP) technologies in the life sciences, particularly in molecular biology, the amount of collected data has grown in an exponential fashion. Furthermore, the data are scattered over a plethora of both public and private repositories, and are stored using a large number of different formats. This situation makes searching these data and performing the analysis necessary for the extraction of new knowledge from the complete set of available data very difficult. Integrative bioinformatics attempts to tackle this problem by providing unified access to life science data.
Approaches
Semantic web approaches
In the Semantic Web approach, data from multiple websites or databases is searched via metadata. Metadata is machine-readable code, which defines the contents of the page for the program so that the comparisons between the data and the search terms are more accurate. This serves to decrease the number of results that are irrelevant or unhelpful. Some meta-data exists as definitions called ontologies, which can be tagged by either users or programs; these serve to facilitate searches by using key terms or phrases to find and return the data. Advantages of this approach include the general increased quality of the data returned in searches and with proper tagging, ontologies finding entries that may not explicitly state the search term but are still relevant. One disadvantage of this approach is that the results that are returned come in the format of the database of their origin and as such, direct comparisons may be difficult. Another problem is that the terms used in tagging and searching can sometimes be ambiguous and may cause confusion among the results. In addition, the semantic web approach is still considered an emerging technology and is not in wide-scale use at this time.
One of the current appli |
https://en.wikipedia.org/wiki/Wythoff%27s%20game | Wythoff's game is a two-player mathematical subtraction game, played with two piles of counters. Players take turns removing counters from one or both piles; when removing counters from both piles, the numbers of counters removed from each pile must be equal. The game ends when one player removes the last counter or counters, thus winning.
An equivalent description of the game is that a single chess queen is placed somewhere on a large grid of squares, and each player can move the queen towards the lower left corner of the grid: south, west, or southwest, any number of steps. The winner is the player who moves the queen into the corner. The two Cartesian coordinates of the queen correspond to the sizes of two piles in the formulation of the game involving removing counters from piles.
Martin Gardner in his March 1977 "Mathematical Games column" in Scientific American claims that the game was played in China under the name 捡石子 jiǎn shízǐ ("picking stones"). The Dutch mathematician W. A. Wythoff published a mathematical analysis of the game in 1907.
Optimal strategy
Any position in the game can be described by a pair of integers (n, m) with n ≤ m, describing the size of both piles in the position or the coordinates of the queen. The strategy of the game revolves around cold positions and hot positions: in a cold position, the player whose turn it is to move will lose with best play, while in a hot position, the player whose turn it is to move will win with best play. The optimal strategy from a hot position is to move to any reachable cold position.
The classification of positions into hot and cold can be carried out recursively with the following three rules:
(0,0) is a cold position.
Any position from which a cold position can be reached in a single move is a hot position.
If every move leads to a hot position, then a position is cold.
For instance, all positions of the form (0, m) and (m, m) with m > 0 are hot, by rule 2. However, the position (1,2) is cold, |
https://en.wikipedia.org/wiki/Balanitis%20circinata | Balanitis circinata (also known as circinate balanitis) is a skin condition comprising a serpiginous ring-shaped dermatitis of the glans penis. While circinate balanitis is one of the most common cutaneous manifestations of reactive arthritis, it can also occur independently. Topical corticosteroid therapy is the most commonly used treatment, and topical calcineurin inhibitors have also been used successfully.
Signs and symptoms
At the first stages of the condition, patients show pinhead-sized lesions covered by white plaque, which grow into a flat, red region with a white margin. Despite the visible symptoms, patients rarely suffer from burning or itching, and the lesions rarely smell strange. Due to its visual appearance, balanitis circinata is often misdiagnosed as a fungal infection, especially in those that have no other symptoms of reactive arthritis.
Cause
Reactive arthritis is characterized by nongonococcal urethritis, conjunctivitis, and arthritis. Reactive arthritis belongs to the group of arthritides known as the spondyloarthritides. There are two main types of reactive arthritis: post-venereal and post-enteric. Chlamydia trachomatis is thought to be the most common cause of reactive arthritis, in general. Until recently, even the terminology for the condition itself was unclear as multiple eponyms and names have been associated with reactive arthritis. In recent years, a great deal has been learnt about the epidemiology, pathophysiology and treatment of reactive arthritis and chlamydia-induced reactive arthritis, specifically. Prospective epidemiologic data suggest that chlamydia-induced reactive arthritis is underdiagnosed. Other truths being actively revealed include data suggesting that the pathogen itself (i.e., chlamydia) might play an equally important role, or perhaps even more important, than the host with disease susceptibility; asymptomatic chlamydial infections might be a common cause of reactive arthritis and the two variants of reactive |
https://en.wikipedia.org/wiki/Spacetime%20algebra | In mathematical physics, spacetime algebra (STA) is a name for the Clifford algebra Cl1,3(R), or equivalently the geometric algebra . According to David Hestenes, spacetime algebra can be particularly closely associated with the geometry of special relativity and relativistic spacetime.
It is a vector space that allows not only vectors, but also bivectors (directed quantities associated with particular planes, such as areas, or rotations) or blades (quantities associated with particular hyper-volumes) to be combined, as well as rotated, reflected, or Lorentz boosted. It is also the natural parent algebra of spinors in special relativity. These properties allow many of the most important equations in physics to be expressed in particularly simple forms, and can be very helpful towards a more geometric understanding of their meanings.
Structure
The spacetime algebra may be built up from an orthogonal basis of one time-like vector and three space-like vectors, , with the multiplication rule
where is the Minkowski metric with signature .
Thus, , , otherwise .
The basis vectors share these properties with the Dirac matrices, but no explicit matrix representation need be used in STA.
This generates a basis of one scalar , four vectors , six bivectors , four pseudovectors and one pseudoscalar , where .
The spacetime algebra also contains a non-trivial sub-algebra containing only the even grade elements, i.e. scalars, bivectors, and pseudoscalars. In the even sub-algebra, scalars and pseudoscalars both commute with all elements, and act like complex numbers. However, the pseudoscalar anticommutes with all odd-grade elements of the spacetime algebra, corresponding to the fact that under parity transformations, vectors and pseudovectors become negated.
Reciprocal frame
Associated with the orthogonal basis is the reciprocal basis for
, satisfying the relation
These reciprocal frame vectors differ only by a sign, with , and for .
A vector may be represented |
https://en.wikipedia.org/wiki/Kai%20%28conjunction%29 | Kai ( "and"; ; ; sometimes abbreviated k) is a letter that is a conjunction in Greek, Coptic () and Esperanto (kaj; ).
Kai is the most frequent word in any Greek text and thus used by statisticians to assess authorship of ancient manuscripts based on the number of times it is used.
Ligature
Because of its frequent occurrence, kai is sometimes abbreviated in Greek manuscripts and in signage, by a ligature (comparable to Latin &), written as ϗ (uppercase variant Ϗ; Coptic variant ⳤ), formed from kappa (κ) with an extra lower stroke.
It may occur with the varia above it: ϗ̀.
Ϗ ϗ
For representation in electronic texts the kai symbol has its own Unicode positions: GREEK KAI SYMBOL (U+03D7) and GREEK CAPITAL KAI SYMBOL (U+03CF).
Authorship of ancient texts
The number of common words which express a general relation ("and", "in", "but", "I", "to be") is random with the same distribution at least among the same genre. By contrast, the occurrence of the definite article "the" cannot be modeled by simple probabilistic laws because the number of nouns with definite article depends on the subject matter.
Table 1 has data about the epistles of Saint Paul. 2nd Thessalonians, Titus, and Philemon were excluded because they were too short to give reliable samples. From an analysis of these and other data the first 4 epistles (Romans, 1 Corinthians, 2 Corinthians, and Galatians) form a consistent group, and all the other epistles lie more than 2 standard deviations from the mean of this group (using statistics).
Esperanto
Esperanto comes from Greek.
It may be abbreviated as or , among other places, in the PIV dictionary.
See also
Kaige revision, group of Greek-language Septuagint Bible versions that frequently use ("and indeed").
& |
https://en.wikipedia.org/wiki/Kir6.2 | {{DISPLAYTITLE:Kir6.2}}
Kir6.2 is a major subunit of the ATP-sensitive K+ channel, a lipid-gated inward-rectifier potassium ion channel. The gene encoding the channel is called KCNJ11 and mutations in this gene are associated with congenital hyperinsulinism.
Structure
It is an integral membrane protein. The protein, which has a greater tendency to allow potassium to flow into a cell rather than out of a cell, is controlled by G-proteins and is found associated with the sulfonylurea receptor (SUR) to constitute the ATP-sensitive K+ channel.
Pathology
Mutations in this gene are a cause of congenital hyperinsulinism (CHI), an autosomal recessive disorder characterized by unregulated insulin secretion. Defects in this gene may also contribute to autosomal dominant non-insulin-dependent diabetes mellitus type II (NIDDM).
See also
Inward-rectifier potassium ion channel
Potassium channel |
https://en.wikipedia.org/wiki/Oxygen%20evolution | Oxygen evolution is the process of generating molecular oxygen (O2) by a chemical reaction, usually from water. Oxygen evolution from water is effected by oxygenic photosynthesis, electrolysis of water, and thermal decomposition of various oxides. The biological process supports aerobic life. When relatively pure oxygen is required industrially, it is isolated by distilling liquefied air.
Oxygen evolution in nature
Photosynthetic oxygen evolution is the fundamental process by which oxygen is generated in the earth's biosphere. The reaction is part of the light-dependent reactions of photosynthesis in cyanobacteria and the chloroplasts of green algae and plants. It utilizes the energy of light to split a water molecule into its protons and electrons for photosynthesis. Free oxygen, generated as a by-product of this reaction, is released into the atmosphere.
Water oxidation is catalyzed by a manganese-containing cofactor contained in photosystem II, known as the oxygen-evolving complex (OEC) or the water-splitting complex. Manganese is an important cofactor, and calcium and chloride are also required for the reaction to occur. The stoichiometry of this reaction is as follows:
2H2O ⟶ 4e− + 4H+ + O2
The protons are released into the thylakoid lumen, thus contributing to the generation of a proton gradient across the thylakoid membrane. This proton gradient is the driving force for adenosine triphosphate (ATP) synthesis via photophosphorylation and the coupling of the absorption of light energy and the oxidation of water for the creation of chemical energy during photosynthesis.
History of discovery
It was not until the end of the 18th century that Joseph Priestley accidentally discovered the ability of plants to "restore" air that had been "injured" by the burning of a candle. He followed up on the experiment by showing that air "restored" by vegetation was "not at all inconvenient to a mouse." He was later awarded a medal for his discoveries that "...no vegetabl |
https://en.wikipedia.org/wiki/REANNZ | The Research and Education Advanced Network New Zealand Ltd (REANNZ), once known as the Kiwi Advanced Research and Education Network (KAREN), is a high-capacity, ultra high-speed national research and education network (NREN) connecting New Zealand's tertiary institutions, research organisations, libraries, schools and museums, and the rest of the world. REANNZ is a Crown-owned not-for-profit company.
Commissioned in late 2006, REANNZ links to other established regional and national research and education networks, notably to JANET in the UK and to the Pacific Northwest Gigapop in Seattle.
E-research
New Zealand researchers and educators can use REANNZ to participate in e-research:
to exchange large volumes of data quickly
to gain access to large-scale national and international infrastructure
to collaborate better on research and education projects at a distance.
REANNZ aims:
to enable leading-edge e-research
to facilitate universal connectivity throughout the New Zealand and international research and education communities
to encourage broad participation by the research and education sector in New Zealand through accessible technology and reasonable pricing
to connect the research and education sector to the broader innovation community for pre-commercial research and development based collaboration
to facilitate participation by multiple telecommunications-sector partners to ensure the greatest possible flexibility for ongoing evolution.
Topology
REANNZ consists of a high-speed optical network connecting points of presence (PoPs) throughout New Zealand. A PoP provides an interconnection point between member sites around the network. Members may connect at one or more POPs. REANNZ links universities and Crown Research Institutes within New Zealand via One.NZ (Vodafone) fibre-optic cable and Vocus Communications, at speeds up to 100 gigabits per second.
International links to Sydney and to Seattle (Pacific Northwest Gigapop) via the Hawaiki Cable |
https://en.wikipedia.org/wiki/UBIGEO | Ubigeo is the coding system for geographical locations (Spanish: Código Ubicacíon Geográfica) in Peru used by the National Statistics and Computing Institute (Spanish: Instituto Nacional de Estadística e Informática INEI) to code the first-level administrative subdivision: regions (Spanish: regiones, singular: región), the second-level administrative subdivision: provinces (Spanish: provincias, singular: provincia) and the third-level administrative subdivision: districts (Spanish: distritos, singular: distrito). There are 1874 different ubigeos in Peru.
Syntax
The coding system uses two-digit numbers for each level of subdivision. The first level starts numbering at 01 for the Amazonas Region and continues in alphabetical order up to 25 for the Ucayali Region. Additional regions will be added to the end of the list, starting with the first available number.
The second level starts with 0101 for the first province in the Amazonas region: Chachapoyas Province and continues up to 2504 for the last province Purús in the Ucayali Region. The provinces are numbered per region with the first province always being the one in which the regions capital is located. The remaining provinces are coded in alphabetical order. Additional provinces will be added per region to the end of the list, starting with the first available province number.
The third level; starts with 010101 for the first district in the first province in the Amazonas region: Chachapoyas District and continues up to 250401 for the last district in the last province of the Ucayali region: Purús District. The districts are numbered per province with the first district always being the one in which the province’ capital is located. The remaining districts are coded in alphabetical order. Additional districts will be added per province to the end of the list, starting with the first available district number.
Examples
Regions
01 Amazonas Region
02 Ancash Region
03 Apurímac Region
Provinces
0101 Chachapoyas |
https://en.wikipedia.org/wiki/Lissajous%20orbit | In orbital mechanics, a Lissajous orbit (), named after Jules Antoine Lissajous, is a quasi-periodic orbital trajectory that an object can follow around a Lagrangian point of a three-body system with minimal propulsion. Lyapunov orbits around a Lagrangian point are curved paths that lie entirely in the plane of the two primary bodies. In contrast, Lissajous orbits include components in this plane and perpendicular to it, and follow a Lissajous curve. Halo orbits also include components perpendicular to the plane, but they are periodic, while Lissajous orbits are usually not.
In practice, any orbits around Lagrangian points , , or are dynamically unstable, meaning small departures from equilibrium grow over time. As a result, spacecraft in these Lagrangian point orbits must use their propulsion systems to perform orbital station-keeping. Although they are not perfectly stable, a modest effort of station keeping keeps a spacecraft in a desired Lissajous orbit for a long time.
In the absence of other influences, orbits about Lagrangian points and are dynamically stable so long as the ratio of the masses of the two main objects is greater than about 25. The natural dynamics keep the spacecraft (or natural celestial body) in the vicinity of the Lagrangian point without use of a propulsion system, even when slightly perturbed from equilibrium. These orbits can however be destabilized by other nearby massive objects. For example, orbits around the and points in the Earth–Moon system can last only a few million years instead of billions because of perturbations by the other planets in the Solar System.
Spacecraft using Lissajous orbits
Several missions have used Lissajous orbits: ACE at Sun–Earth L1, SOHO at Sun–Earth L1, DSCOVR at Sun–Earth L1, WMAP at Sun–Earth L2, and also the Genesis mission collecting solar particles at L1.
On 14 May 2009, the European Space Agency (ESA) launched into space the Herschel and Planck observatories, both of which use Lissajous orb |
https://en.wikipedia.org/wiki/Glycerol%20phosphate%20shuttle | The glycerol-3-phosphate shuttle is a mechanism used in skeletal muscle and the brain that regenerates NAD+ from NADH, a by-product of glycolysis. The NADH generated during glycolysis is found in the cytoplasm and must be transported into the mitochondria to enter the oxidative phosphorylation pathway. However, the inner mitochondrial membrane is impermeable to NADH and NAD+ and does not contain a transport system for these electron carriers. Either the glycerol-3-phosphate shuttle pathway or the malate-aspartate shuttle pathway, depending on the tissue of the organism, must be taken to transport cytoplasmic NADH into the mitochondria. The shuttle consists of the sequential activity of two proteins; Cytoplasmic glycerol-3-phosphate dehydrogenase (cGPD) transfers an electron pair from NADH to dihydroxyacetone phosphate (DHAP), forming glycerol-3-phosphate (G3P) and regenerating NAD+ needed to generate energy via glycolysis. The other protein, mitochondrial glycerol-3-phosphate dehydrogenase (mGPD) catalyzes the oxidation of G3P by FAD, regenerating DHAP in the cytosol and forming FADH2 in the mitochondrial matrix. In mammals, its activity in transporting reducing equivalents across the mitochondrial membrane is considered secondary to the malate-aspartate shuttle.
History
The glycerol phosphate shuttle was first characterized as a major route of mitochondrial hydride transport in the flight muscles of blow flies. It was initially believed that the system would be inactive in mammals due to the predominance of lactate dehydrogenase activity over Glycerol-3-phosphate dehydrogenase 1 (GPD1) until high GPD1 and GPD2 activity were demonstrated in mammalian brown adipose tissue and pancreatic ß-islets.
Reaction
In this shuttle, the enzyme called cytoplasmic glycerol-3-phosphate dehydrogenase 1 (GPD1 or cGPD) converts dihydroxyacetone phosphate (2) to glycerol 3-phosphate (1) by oxidizing one molecule of NADH to NAD+ as in the following reaction:
Glycerol-3-phosphate i |
https://en.wikipedia.org/wiki/David%20Vogan | David Alexander Vogan, Jr. (born September 8, 1954) is a mathematician at the Massachusetts Institute of Technology who works on unitary representations of simple Lie groups.
While studying at the University of Chicago, he became a Putnam Fellow in 1972. He received his Ph.D. from M.I.T. in 1976, under the supervision of Bertram Kostant. In his thesis, he introduced the notion of lowest K type in the course of obtaining
an algebraic classification of irreducible Harish Chandra modules. He is currently one of the participants in the Atlas of Lie Groups and Representations.
Vogan was elected to the American Academy of Arts and Sciences in 1996. He served as Head of the Department of Mathematics at MIT from 1999 to 2004.
In 2012 he became Fellow of the American Mathematical Society. He was president of the AMS in 2013–2014. He was elected to the National Academy of Sciences in 2013.
He was the Norbert Wiener Chair of Mathematics at MIT until his retirement in 2020.
Publications
Representations of real reductive Lie groups. Birkhäuser, 1981
Unitary representations of reductive Lie groups. Princeton University Press, 1987
with Paul Sally (ed.): Representation theory and harmonic analysis on semisimple Lie groups. American Mathematical Society, 1989
with Jeffrey Adams & Dan Barbasch (ed.): The Langlands Classification and Irreducible Characters for Real Reductive Groups. Birkhäuser, 1992
with Anthony W. Knapp: Cohomological Induction and Unitary Representations. Princeton University Press, 1995
with Joseph A. Wolf and Juan Tirao (ed.): Geometry and representation theory of real and p-adic groups. Birkhäuser, 1998
with Jeffrey Adams (ed.): Representation theory of Lie groups. American Mathematical Society, 2000
The Character Table for E8. In: Notices of the American Mathematical Society Nr. 9, 2007 (PDF) |
https://en.wikipedia.org/wiki/Alexander%20Beilinson | Alexander A. Beilinson (born 1957) is the David and Mary Winton Green University professor at the University of Chicago and works on mathematics. His research has spanned representation theory, algebraic geometry and mathematical physics. In 1999, Beilinson was awarded the Ostrowski Prize with Helmut Hofer.
In 2017, he was elected to the National Academy of Sciences. In 2018, he received the Wolf Prize in Mathematics and in 2020 the Shaw Prize in Mathematics.
Work
In 1978, Beilinson published a paper on coherent sheaves and several problems in linear algebra. His two-page note in the journal Functional Analysis and Its Applications was one of the papers on the study of derived categories of coherent sheaves.
In 1981, Beilinson announced a proof of the Kazhdan–Lusztig conjectures and Jantzen conjectures with Joseph Bernstein. Independent of Beilinson and Bernstein, Brylinski and Kashiwara obtained a proof of the Kazhdan–Lusztig conjectures. However, the proof of Beilinson–Bernstein introduced a method of localization. This established a geometric description of the entire category of representations of the Lie algebra, by "spreading out" representations as geometric objects living on the flag variety. These geometric objects naturally have an intrinsic notion of parallel transport: they are D-modules.
In 1982, Beilinson published his own conjectures about the existence of motivic cohomology groups for schemes, provided as hypercohomology groups of a complex of abelian groups and related to algebraic K-theory by a motivic spectral sequence, analogous to the Atiyah–Hirzebruch spectral sequence in algebraic topology. These conjectures have since been dubbed the Beilinson-Soulé conjectures; they are intertwined with Vladimir Voevodsky's program to develop a homotopy theory for schemes.
In 1984, Beilinson published the paper Higher Regulators and values of L-functions, in which he related higher regulators for K-theory and their relationship to L-functions. T |
https://en.wikipedia.org/wiki/GDF6 | Growth differentiation factor 6 (GDF6) is a protein that in humans is encoded by the GDF6 gene.
Function
GDF6 belongs to the transforming growth factor beta superfamily and may regulate patterning of the ectoderm by interacting with bone morphogenetic proteins, and control eye development.
Growth differentiation factor 6 (GDF6) is a regulatory protein associated with growth and differentiation of developing embryos. GDF6 is encoded by the GDF6 gene. It is a member the transforming growth factor beta superfamily which is a group of proteins involved in early regulation of cell growth and development. GDF6 has been shown to play an important role in the patterning of the epidermis and bone and joint formation. GDF6 induces genes related to the development of the epidermis and can bind directly to noggin, a gene that controls neural development, to block its effect. GDF6 interacts with bone morphogenetic proteins (BMPs) to form heterodimers that may work to regulate neural induction and patterning in developing embryos. By developing a GDF6 “knockout” model, scientists repressed expression of GDF6 in developing mice embryos. Through this experiment, the scientists were able to directly link GDF6 with several skull and vertebral joint disorders, such as scoliosis and chondrodysplasia, Grebe type.
Clinical significance
GDF6 is recurrently amplified and specifically expressed in 80% of the melanomas. Patients with less GDF6 had a lower risk of metastasis and a higher chance of survival. Since GDF6 expression is very low or undetectable in most healthy adult tissues its inhibition could be used to treat this lethal disease. |
https://en.wikipedia.org/wiki/Biostar | Biostar Microtech International Corp. () is a Taiwanese company which designs and manufactures computer hardware products such as motherboards, video cards, expansion cards, thermal grease, headphones, home theater PCs, remote controls, desktops, barebone computers, system-on-chip solutions and industrial PCs.
Awarded Taiwan's Top 20 Global Brand in 2008, Biostar, with an estimated brand value of US$46 million, was ranked No. 1 as the top motherboard brand for internet cafés in China. Biostar is an independent company listed on the main floor of Taiwan Stock Market, stock ID number .
History
The company was founded in 1986, manufacturing XT form factor mainboards and in later years add-on cards. In 1999 Biostar was listed on the Taiwan Stock Exchange & also certified ISO 9001 standard within the same year. Biostar has shifted from the SI/OEM market to the channel market with the portion of branded products closer to 100 percent.
On 1 August 2004, having already had a successful collaboration of Nvidia nForce based motherboards, Biostar announced it was to become a first tier partner with Nvidia of graphics solutions.
Biostar was the first manufacturer to launch a motherboard with built-in Wireless LAN back in May 2003, the P4TCA, which is based on at the time Intel's flagship i875P “Canterwood” chipset. Biostar introduced the first AM2/AM2+ motherboard in the world (TF560 A2+) in June 2007, which was able to host Socket AM2 Athlon 64 and AM2+ AMD Phenom processors.
Biostar was awarded “Top 20 Taiwan Global Brand” in 2008 conducted by Taiwan External Trade Development Council (TAITRA) with an estimate brand value of US$46 million. Only three companies had a chance to crack the Top 20 list for the first time – and Biostar was among them.
Biostar was also the first manufacturer in the world to launch a motherboard readily available with integrated USB 3.1 in February 2015, the Gaming Z97X, which is based on Intel's Z97 “Wildcat Point” chipset.
Biostar has the |
https://en.wikipedia.org/wiki/LinuxMCE | LinuxMCE (Linux Media Center Edition) is a free and open source software platform with a 10-foot user interface designed to allow a computer to act as a home theater PC (HTPC) for the living-room TV, personal video recorder, and home automation system. It allows control of everything in the home, from lighting and climate to surveillance cameras and home security. It also includes a full-featured VoIP-compatible phone system with support for video conferencing.
Levels of implementation
LinuxMCE may be used as a standalone home theater PC (without any other home network connectivity), but it may also serve as a complete home LAN system in a server/thin client configuration. In such a configuration, a central core server (a standard PC running Kubuntu) does most of the storage and processing functions, while peripheral PCs (and other devices) provide input and output services. Thin client PCs can netboot over the LAN to serve as "Media Directors", which stream media content from the core to audiovisual devices which are connected to these thin clients.
This home automation/multimedia LAN can be expanded to include home automation systems, surveillance cameras, high-tech remote controllers (called "Orbiters"), and telephone PBX systems. The core server co-ordinates the functions of all the devices on the home LAN. The advanced networking capabilities of the Linux OS allow this high level of network co-ordination.
History
LinuxMCE was begun by Paul Webber as a fork of the PlutoHome home automation software project. It was adapted to run on top of a standard Linux distribution, Kubuntu, as its base OS, rather than to exist as a custom Linux distribution.
Most of the core components, including the Orbiter (remote control) user interface, have undergone significant improvements, and are licensed under the GPL.
Architecture
A LinuxMCE setup consists of two parts – one Core and one or more Media Directors. The Core is the central server and provides services throughout |
https://en.wikipedia.org/wiki/Edyth%20May%20Sliffe%20Award | The Edyth May Sliffe Award is given annually to (roughly) 20 teachers in the United States by the Mathematical Association of America (MAA). The awards are funded by a bequest from a retired high school mathematics teacher named Edyth May Sliffe, of Emeryville, California. Her purpose was to award high school teachers whose students have done well on the AHSME, now the AMC 12. She felt students who won in math competitions received honors, but their teachers never received any recognition.
Edyth May Sliffe and her Award
(1901 - 1986)
Edyth May Sliffe, a retired teacher who taught at Emery High School, felt that teachers also needed recognition for their contributions toward the students' success. In 1978 she contacted the Governor of the Northern California Section of the MAA, Professor Kenneth Rebman. Kenneth Rebman then told the President of the MAA, Professor Henry Alder, and arranged a meeting with Sliffe. She decided to use her estate to recognize 20 teachers of the highest scoring teams annually. Edyth Sliffe died on December 11, 1986. In accordance with her will, over $250,000 was donated to the MAA. Since 1989, about 20 high school teachers from the top 60 American and Canadian schools have received the award annually. In 1995, the MAA Committee extended the award to middle school teachers. Five teachers are selected from each of the ten American Mathematics Competition Regions.
Nomination of a Teacher
Three students from each of the top 60 highest scoring teams in the AMC 12 are asked to nominate a teacher they felt contributed most to their success.
Award
Award-winning teachers win a cash prize of $350-$750, a letter from the president of the MAA, a certificate signed by the president of MAA, Chair of the Committee on the AMC 12, and the Executive Director of the American Mathematics Competitions. In addition, they get one year free membership in the MAA, and recognition in national and regional professional publications. The award ceremony is arran |
https://en.wikipedia.org/wiki/SCTP%20packet%20structure | The Stream Control Transmission Protocol (SCTP) has a simpler basic packet structure than TCP. Each consists of two basic sections:
The common header, which occupies the first 12 bytes. In the adjacent diagram, this header is highlighted in blue.
The data chunks, which form the remaining portion of the packet. In the diagram, the first chunk is highlighted in green and the last of N chunks (Chunk N) is highlighted in red. There are several types, including payload data and different control messages.
Common header
All SCTP packets require the common header section (shown with a blue background).
Source port This field identifies the sending port.
Destination port This field identifies the receiving port that hosts use to route the packet to the appropriate endpoint/application.
Verification tag A 32-bit random value created during initialization to distinguish stale packets from a previous connection.
Checksum SCTP's original design catered for Adler-32; but RFC 3309 changed the protocol to use the CRC32c algorithm.
Chunks
Each SCTP packet consists, in addition to the common header, of chunks.
Each chunk has a common format, but the contents can vary.
The green bytes in the diagram above signify one chunk.
Chunk type An 8-bit value predefined by the IETF to identify the contents of the chunk value field.
Chunk flags Eight flag-bits whose definition varies with the chunk type. The default value is zero.
Chunk length A 16-bit unsigned value specifying the total length of the chunk in bytes (excludes any padding) that includes chunk type, flags, length, and value fields.
Chunk data General-purpose data field whose definition varies with the chunk type.
If the chunk length does not equate to a multiple of 4 bytes, then the protocol implicitly pads the chunk with trailing zeros.
Additionally, each chunk type may define a set of parameters which it includes inside the chunk value field (and, consequently, their length in the chunk length) |
https://en.wikipedia.org/wiki/15%20Bean%20Soup | 15 Bean Soup is a packaged dry bean soup product from Indianapolis-based N.K. Hurst Co. According to company president Rick Hurst, it is the #1 selling dry bean soup in the U.S.
Ingredients
Every package of 15 bean soup includes a seasoning packet and at least 15 of the following varieties of dried pulses:
Northern beans
Pinto beans
Large lima beans
Yelloweye beans
Garbanzo beans
Baby lima beans
Green split peas
Kidney beans
Cranberry beans
Small white beans
Pink beans
Small red beans
Yellow split peas
Lentils
Navy beans
White kidney beans
Black beans
The soup is currently produced in ham, chicken, Cajun, and beef flavors.
See also
List of bean soups
List of legume dishes |
https://en.wikipedia.org/wiki/Fascin | Fascin is an actin bundling protein.
Species and tissue distribution
It is a 54-58 kilodalton monomeric actin filament bundling protein originally isolated from sea urchin egg but also found in Drosophila and vertebrates, including humans. Fascin (from the Latin for bundle) is spaced at 11 nanometre intervals along the filament. The bundles in cross section are seen to be hexagonally packed, and the longitudinal spacing is compatible with a model where fascin cross-links at alternating 4 and 5 actins. It is calcium insensitive and monomeric. Three forms of fascin are found in vertebrates: Fascin1, widely found in the nervous system and elsewhere; fascin2 found in the retinal photoreceptor cells; fascin3, which is only found in the testes.
Function
Fascin binds beta-catenin, and colocalizes with it at the leading edges and borders of epithelial and endothelial cells. The role of Fascin in regulating cytoskeletal structures for the maintenance of cell adhesion, coordinating motility and invasion through interactions with signalling pathways is an active area of research especially from the cancer biology perspective. Fascin localizes to actin-rich protrusions at the cell surface called filopodia. Recent study shows that fascin also localizes to invadopodia, membrane protrusions formed at the adherent cell surface that facilitate extracellular matrix (ECM) invasion, this provide a potential molecular mechanism for how fascin increases the invasiveness of cancer cells since fascin expression is upregulated in a spectrum of cancers. Studies have also shown that Fascin plays a major role in immune suppression. T regulatory cell adhesion to antigen presenting dendritic cell causes sequestration of Fascin-1, an actin-bundling protein essential for immunological synapse formation, and skews Fascin-1–dependent actin polarization in antigen presenting dendritic cells toward the T reg cell adhesion zone. Although it is reversible upon T regulatory cell disengagement, t |
https://en.wikipedia.org/wiki/CM-field | In mathematics, a CM-field is a particular type of number field, so named for a close connection to the theory of complex multiplication. Another name used is J-field.
The abbreviation "CM" was introduced by .
Formal definition
A number field K is a CM-field if it is a quadratic extension K/F where the base field F is totally real but K is totally imaginary. I.e., every embedding of F into lies entirely within , but there is no embedding of K into .
In other words, there is a subfield F of K such that K is generated over F by a single square root of an element, say
β = ,
in such a way that the minimal polynomial of β over the rational number field has all its roots non-real complex numbers. For this α should be chosen totally negative, so that for each embedding σ of into the real number field,
σ(α) < 0.
Properties
One feature of a CM-field is that complex conjugation on induces an automorphism on the field which is independent of its embedding into . In the notation given, it must change the sign of β.
A number field K is a CM-field if and only if it has a "units defect", i.e. if it contains a proper subfield F whose unit group has the same -rank as that of K . In fact, F is the totally real subfield of K mentioned above. This follows from Dirichlet's unit theorem.
Examples
The simplest, and motivating, example of a CM-field is an imaginary quadratic field, for which the totally real subfield is just the field of rationals.
One of the most important examples of a CM-field is the cyclotomic field , which is generated by a primitive nth root of unity. It is a totally imaginary quadratic extension of the totally real field The latter is the fixed field of complex conjugation, and is obtained from it by adjoining a square root of
The union QCM of all CM fields is similar to a CM field except that it has infinite degree. It is a quadratic extension of the union of all totally real fields QR. The absolute Galois group Gal(/QR) is generated (as a closed |
https://en.wikipedia.org/wiki/Financial%20gerontology | Financial gerontology is a multidisciplinary field of study encompassing both academic and professional education, that integrates research on aging and human development with the concerns of finance and business. Following from its roots in social gerontology, Financial gerontology is not simply the study of old people but emphasizes the multiple processes of aging. In particular, research and teaching in financial gerontology draws upon four kinds of aging or "'four lenses" through which aging and finance can be viewed: population aging, individual aging, family aging, and generational aging. While it is problematic that "demography is destiny," demographic concepts, issues, and data play a substantial role in understanding the dynamics of financial gerontology. For example, through the lens of population aging, demography identifies the number of persons of different ages in cities and countries—and at multiple points in time. Through the lens of individual aging, demography also notes changes in the length of time—number of years lived in older age, typically measured by increases in life expectancy. From in its founding years in the beginning of the 21st century, one primary interest of Financial Gerontology has been on baby boomers and their relationships with their parents. The impact of these two kinds of aging on finance are reasonably apparent. The large and increasing number of older persons [population aging] in a society, no matter how "old age" is defined, and the longer each of these persons lives [individual aging], the greater the impact on a society's pattern of retirement, public and private pension systems, health, health care, and the personal and societal financing of health care. The focus on boomers illustrates also the other two lenses or "kinds" of aging. How boomers deal with the social, emotional, and financial aspects of their parents' aging is a central aspect of family aging. And how boomers may differ from their parents born and rai |
https://en.wikipedia.org/wiki/SAML%201.1 | Security Assertion Markup Language (SAML) is an XML standard for exchanging authentication and authorization data between security domains. SAML is a product of the OASIS (organization) Security Services Technical Committee.
SAML 1.1 was ratified as an OASIS standard in September 2003. The critical aspects of SAML 1.1 are covered in detail in the official documents SAMLCore and SAMLBind. If you are new to SAML, you should probably read the introductory SAML topic first, and then the SAMLOverview document from OASIS.
Prior to SAML 1.1, SAML 1.0 was adopted as an OASIS standard in November 2002. SAML has undergone one minor (V1.1) and one major revision (V2.0) since V1.0, which itself is a relatively simple protocol. SAML 1.0 is of more than historical interest, however, since the US Federal E-Authentication Initiative has adopted SAML 1.0 as its core technology.
Versions 1.0 and 1.1 of SAML are similar. See SAMLDiff for specific differences between the two standards. This article concentrates on SAML 1.1 since it is an important standard upon which many other standards and implementations depend.
Warning: Implementers and deployers should note well that all code examples in this article are non-normative and for illustration purposes only. Consult the OASIS SAML specifications for normative requirements.
SAML 1.1 Assertions
SAML assertions contain statements that service providers use to make access control decisions. For instance, authentication statements assert to the service provider that the principal did indeed authenticate with the identity provider at a particular time using a particular method of authentication. Other information about the principal may be disclosed in an authentication statement. In the authentication statement below, for example, the e-mail address of the principal is asserted to the service provider:
<saml:Assertion
xmlns:saml="urn:oasis:names:tc:SAML:1.0:assertion"
MajorVersion="1" MinorVersion="1"
AssertionID= |
https://en.wikipedia.org/wiki/SAML%202.0 | Security Assertion Markup Language 2.0 (SAML 2.0) is a version of the SAML standard for exchanging authentication and authorization identities between security domains. SAML 2.0 is an XML-based protocol that uses security tokens containing assertions to pass information about a principal (usually an end user) between a SAML authority, named an Identity Provider, and a SAML consumer, named a Service Provider. SAML 2.0 enables web-based, cross-domain single sign-on (SSO), which helps reduce the administrative overhead of distributing multiple authentication tokens to the user.
SAML 2.0 was ratified as an OASIS Standard in March 2005, replacing SAML 1.1. The critical aspects of SAML 2.0 are covered in detail in the official documents SAMLCore, SAMLBind, SAMLProf, and SAMLMeta.
Some 30 individuals from more than 24 companies and organizations were involved in the creation of SAML 2.0. In particular, and of special note, Liberty Alliance donated its Identity Federation Framework (ID-FF) specification to OASIS, which became the basis of the SAML 2.0 specification. Thus SAML 2.0 represents the convergence of SAML 1.1, Liberty ID-FF 1.2, and Shibboleth 1.3.
SAML 2.0 assertions
An assertion is a package of information that supplies zero or more statements made by a SAML authority. SAML assertions are usually made about a subject, represented by the <Subject> element. The SAML 2.0 specification defines three different kinds of assertion statements that can be created by a SAML authority. All SAML-defined statements are associated with a subject. The three kinds of assertion statements defined are as follows:
Authentication Statement: The assertion subject was authenticated by a particular means at a particular time.
Attribute Statement: The assertion subject is associated with the supplied attributes.
Authorization Decision Statement: A request to allow the assertion subject to access the specified resource has been granted or denied.
An important type of SAML asse |
https://en.wikipedia.org/wiki/GLYCAM1 | Glycosylation-dependent cell adhesion molecule-1 (GLYCAM1) is a proteoglycan ligand expressed on cells of the high endothelial venules in lymphoid tissues. It is the ligand for the receptor L-selectin allowing for naive lymphocytes to exit the bloodstream into lymphoid tissues.
GLYCAM1 binds to L-selectin by presenting one or more O-linked carbohydrates to the lectin domain of the leukocyte cell surface selectin.
Data suggests that GLYCAM1 is a hormone-regulated milk protein that is part of the milk mucin complex.
GlyCAM-1 is expressed exclusively on high endothelial venules. It is unclear how GlyCAM-1 is attached to the membrane as it lacks a transmembrane region.
External links |
https://en.wikipedia.org/wiki/Hermann%20A.%20Haus | Hermann Anton Haus (August 8, 1925 – May 21, 2003) was a Slovene-American physicist, electrical engineer, and Institute Professor at the Massachusetts Institute of Technology. Haus' research and teaching ranged from fundamental investigations of quantum uncertainty as manifested in optical communications to the practical generation of ultra-short optical pulses. In 1994, the Optical Society of America recognized Dr. Haus' contributions with its Frederic Ives Medal, the society's highest award. Haus authored or co-authored eight books (see section below), published nearly 300 articles, and presented his work at virtually every major conference and symposium on laser and quantum electronics and quantum optics around the world. He was awarded the National Medal of Science in 1995 and was adopted into RPI's Alumni Hall of Fame in 2007.
He was a grandson of the Austrian admiral Anton Haus. His father, Otto Maximilian Haus, was a leading Slovenian doctor who investigated tuberculosis. The tomb of his great-grandmother Marija Haus (Walter) is still in Bubnjarci, Croatia.
Books authored or co-authored by Prof. Haus
H. A. Haus and R. B. Adler, Circuit Theory of Linear Noisy Networks (The MIT Press, 1959).
H. A. Haus, Noise in Electron Devices (The MIT Press, 1959)
H. A. Haus and J. P. Penhune, Case Studies in Electromagnetism: Problems with Solutions (Wiley, 1960).
P. Penfield and H. A. Haus, Electrodynamics of Moving Media (The MIT Press, 1967).
H. A. Haus, Waves and Fields in Optoelectronics (Prentice Hall, Incorporated, 1984).
H. A. Haus and J. R. Melcher, Electromagnetic Fields and Energy (Prentice Hall, 1989).
H. A. Haus, Electromagnetic Noise and Quantum Optical Measurements (Springer Science & Business Media, 2000).
C. Manolatou and H. A. Haus, Passive Components for Dense Optical Integration (Springer Science & Business Media, 2002). |
https://en.wikipedia.org/wiki/Poincar%C3%A9%E2%80%93Lindstedt%20method | In perturbation theory, the Poincaré–Lindstedt method or Lindstedt–Poincaré method is a technique for uniformly approximating periodic solutions to ordinary differential equations, when regular perturbation approaches fail. The method removes secular terms—terms growing without bound—arising in the straightforward application of perturbation theory to weakly nonlinear problems with finite oscillatory solutions.
The method is named after Henri Poincaré, and Anders Lindstedt.
The article gives several examples. The theory can be found in Chapter 10 of.
Example: the Duffing equation
The undamped, unforced Duffing equation is given by
for t > 0, with 0 < ε ≪ 1.
Consider initial conditions
A perturbation-series solution of the form x(t) = x0(t) + ε x1(t) + … is sought. The first two terms of the series are
This approximation grows without bound in time, which is inconsistent with the physical system that the equation models. The term responsible for this unbounded growth, called the secular term, is . The Poincaré–Lindstedt method allows for the creation of an approximation that is accurate for all time, as follows.
In addition to expressing the solution itself as an asymptotic series, form another series with which to scale time t:
where
We have the leading order ω0 = 1, because when , the equation has solution . Then the original problem becomes
Now search for a solution of the form x(τ) = x0(τ) + ε x1(τ) + … . The following solutions for the zeroth and first order problem in ε are obtained:
So the secular term can be removed through the choice: ω1 = . Higher orders of accuracy can be obtained by continuing the perturbation analysis along this way. As of now, the approximation—correct up to first order in ε—is
Example: the van der Pol oscillator
We solve the van der Pol oscillator only up to order 2. This method can be continued indefinitely in the same way, where the order-n term consists of a harmonic term , plus some super-harmonic terms . T |
https://en.wikipedia.org/wiki/Steve%20Omohundro | Stephen Malvern Omohundro (born 1959) is an American computer scientist whose areas of research include Hamiltonian physics, dynamical systems, programming languages, machine learning, machine vision, and the social implications of artificial intelligence. His current work uses rational economics to develop safe and beneficial intelligent technologies for better collaborative modeling, understanding, innovation, and decision making.
Education
Omohundro has degrees in physics and mathematics from Stanford University (Phi Beta Kappa) and a Ph.D. in physics from the University of California, Berkeley.
Learning algorithms
Omohundro started the "Vision and Learning Group" at the University of Illinois which produced 4 Masters and 2 Ph.D. theses. His work in learning algorithms included a number of efficient geometric algorithms, the manifold learning task and various algorithms for accomplishing this task, other related visual learning and modelling tasks, the model merging approach to machine learning (including the learning of Hidden Markov Models and Stochastic Context-free Grammars), and the Family Discovery Learning Algorithm, which discovers the dimension and structure of a parameterized family of stochastic models.
Self-improving artificial intelligence and AI safety
Omohundro started Self-Aware Systems in Palo Alto, California to research the technology and social implications of self-improving artificial intelligence. He is an advisor to the Machine Intelligence Research Institute on artificial intelligence. He argues that rational systems exhibit problematic natural "drives" that will need to be countered in order to build intelligent systems safely. His papers, talks, and videos on AI safety have generated extensive interest. He has given many talks on self-improving artificial intelligence, cooperative technology, AI safety, and connections with biological intelligence.
Programming languages
At Thinking Machines Corporation, Cliff Lasser and Steve Omohun |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.