source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Crank%20of%20a%20partition | In number theory, the crank of a partition of an integer is a certain integer associated with the partition. The term was first introduced without a definition by Freeman Dyson in a 1944 paper published in Eureka, a journal published by the Mathematics Society of Cambridge University. Dyson then gave a list of properties this yet-to-be-defined quantity should have. In 1988, George E. Andrews and Frank Garvan discovered a definition for the crank satisfying the properties hypothesized for it by Dyson.
Dyson's crank
Let n be a non-negative integer and let p(n) denote the number of partitions of n (p(0) is defined to be 1). Srinivasa Ramanujan in a paper published in 1918 stated and proved the following congruences for the partition function p(n), since known as Ramanujan congruences.
p(5n + 4) ≡ 0 (mod 5)
p(7n + 5) ≡ 0 (mod 7)
p(11n + 6) ≡ 0 (mod 11)
These congruences imply that partitions of numbers of the form 5n + 4 (respectively, of the forms 7n + 5 and 11n + 6 ) can be divided into 5 (respectively, 7 and 11) subclasses of equal size. The then known proofs of these congruences were based on the ideas of generating functions and they did not specify a method for the division of the partitions into subclasses of equal size.
In his Eureka paper Dyson proposed the concept of the rank of a partition. The rank of a partition is the integer obtained by subtracting the number of parts in the partition from the largest part in the partition. For example, the rank of the partition λ = { 4, 2, 1, 1, 1 } of 9 is 4 − 5 = −1. Denoting by N(m, q, n), the number of partitions of n whose ranks are congruent to m modulo q, Dyson considered N(m, 5, 5 n + 4) and N(m, 7, 7n + 5) for various values of n and m. Based on empirical evidences Dyson formulated the following conjectures known as rank conjectures.
For all non-negative integers n we have:
N(0, 5, 5n + 4) = N(1, 5, 5n + 4) = N(2, 5, 5n + 4) = N(3, 5, 5n + 4) = N(4, 5, 5n + 4).
N(0, 7, 7n + 5) = N(1, 7, 7n + 5) |
https://en.wikipedia.org/wiki/Seifert%E2%80%93Van%20Kampen%20theorem | In mathematics, the Seifert–Van Kampen theorem of algebraic topology (named after Herbert Seifert and Egbert van Kampen), sometimes just called Van Kampen's theorem, expresses the structure of the fundamental group of a topological space in terms of the fundamental groups of two open, path-connected subspaces that cover . It can therefore be used for computations of the fundamental group of spaces that are constructed out of simpler ones.
Van Kampen's theorem for fundamental groups
Let X be a topological space which is the union of two open and path connected subspaces U1, U2. Suppose U1 ∩ U2 is path connected and nonempty, and let x0 be a point in U1 ∩ U2 that will be used as the base of all fundamental groups. The inclusion maps of U1 and U2 into X induce group homomorphisms and . Then X is path connected and and form a commutative pushout diagram:
The natural morphism k is an isomorphism. That is, the fundamental group of X is the free product of the fundamental groups of U1 and U2 with amalgamation of .
Usually the morphisms induced by inclusion in this theorem are not themselves injective, and the more precise version of the statement is in terms of pushouts of groups.
Van Kampen's theorem for fundamental groupoids
Unfortunately, the theorem as given above does not compute the fundamental group of the circle – which is the most important basic example in algebraic topology – because the circle cannot be realised as the union of two open sets with connected intersection. This problem can be resolved by working with the fundamental groupoid on a set A of base points, chosen according to the geometry of the situation. Thus for the circle, one uses two base points.
This groupoid consists of homotopy classes relative to the end points of paths in X joining points of A ∩ X. In particular, if X is a contractible space, and A consists of two distinct points of X, then is easily seen to be isomorphic to the groupoid often written with two vertices and ex |
https://en.wikipedia.org/wiki/Bargmann%E2%80%93Wigner%20equations | In relativistic quantum mechanics and quantum field theory, the Bargmann–Wigner equations describe free particles with non-zero mass and arbitrary spin , an integer for bosons () or half-integer for fermions (). The solutions to the equations are wavefunctions, mathematically in the form of multi-component spinor fields.
They are named after Valentine Bargmann and Eugene Wigner.
History
Paul Dirac first published the Dirac equation in 1928, and later (1936) extended it to particles of any half-integer spin before Fierz and Pauli subsequently found the same equations in 1939, and about a decade before Bargman, and Wigner. Eugene Wigner wrote a paper in 1937 about unitary representations of the inhomogeneous Lorentz group, or the Poincaré group. Wigner notes Ettore Majorana and Dirac used infinitesimal operators applied to functions. Wigner classifies representations as irreducible, factorial, and unitary.
In 1948 Valentine Bargmann and Wigner published the equations now named after them in a paper on a group theoretical discussion of relativistic wave equations.
Statement of the equations
For a free particle of spin without electric charge, the BW equations are a set of coupled linear partial differential equations, each with a similar mathematical form to the Dirac equation. The full set of equations are:
which follow the pattern;
for . (Some authors e.g. Loide and Saar use to remove factors of 2. Also the spin quantum number is usually denoted by in quantum mechanics, however in this context is more typical in the literature). The entire wavefunction has components
and is a rank-2j 4-component spinor field. Each index takes the values 1, 2, 3, or 4, so there are components of the entire spinor field , although a completely symmetric wavefunction reduces the number of independent components to . Further, are the gamma matrices, and
is the 4-momentum operator.
The operator constituting each equation, , is a matrix, because of the matrices, and th |
https://en.wikipedia.org/wiki/Electrojet | An electrojet is an electric current which travels around the E region of the Earth's ionosphere. There are three electrojets: one above the magnetic equator (the equatorial electrojet), and one each near the Northern and Southern Polar Circles (the Auroral Electrojets). Electrojets are Hall currents carried primarily by electrons at altitudes from 100 to 150 km. In this region the electron gyro frequency (Larmor frequency) is much greater than the electron-neutral collision frequency. In contrast, the principal E region ions (O2+ and NO+) have gyrofrequencies much lower than the ion-neutral collision frequency.
Kristian Birkeland was the first to suggest that polar electric currents (or auroral electrojets) are connected to a system of filaments (now called "Birkeland currents") that flow along geomagnetic field lines into and away from the polar region.
Equatorial Electrojet
The worldwide solar-driven wind results in the so-called Sq (solar quiet) current system in the E region of the Earth's ionosphere (100–130 km altitude). Resulting from this current is an electrostatic field directed E-W (dawn-dusk) in the equatorial day side of the ionosphere. At the magnetic dip equator, where the geomagnetic field is horizontal, this electric field results in an enhanced eastward current within ± 3 degrees of the magnetic equator, known as the equatorial electrojet.
Auroral Electrojet
The term 'auroral electrojet' is the name given to the large horizontal currents that flow in the D and E regions of the auroral ionosphere. Although horizontal ionospheric currents can be expected to flow at any latitude where horizontal ionospheric electric fields are present, the auroral electrojet currents are remarkable for their strength and persistence. There are two main factors in the production of the electrojet. First of all, the conductivity of the auroral ionosphere is generally larger than that at lower latitudes. Secondly, the horizontal electric field in the auroral iono |
https://en.wikipedia.org/wiki/Pseudomonas%20aeruginosa%20hol%20holin%20family | The Pseudomonas aeruginosa Hol Holin (Hol Holin) Family (TC# 1.E.20) is a group of transporters belonging to the Holin Superfamily III.
The hol gene (PRF9) product (117 aas) of Pseudomonas aeruginosa PAO1 exhibits a hydrophobicity profile similar to holins of P2 and φCTX phages with two peaks of hydrophobicity that might correspond to either one or two transmembrane segments (TMSs). Hol functions in conjunction with the lytic enzyme, Lys (PRF24; 209 amino acyl residues (aas)). Hol by itself, when expressed in a broad host-range expression vector under IPTG control exhibited strong lytic activity in both P. aeruginosa and E. coli. Expression of the lys gene plus chloroform (but not minus chloramphenicol) yielded cell lysis. In another expression vector, coexpression of hol and lys induced lysis under conditions where neither gene alone induced lysis. The hol-lys gene system therefore is believed to constitute a chromosomally-encoded autolysis system.
The reaction probably catalyzed by Hol is:Autolysin (Lys)in → Autolysin (Lys)out.
See also
Holin
Lysin
Holin Superfamily III
Transporter Classification Database |
https://en.wikipedia.org/wiki/Astrology%20and%20the%20classical%20elements | Astrology has used the concept of classical elements from antiquity up until the present. In Western astrology and Sidereal astrology four elements are used: Fire, Earth, Air, and Water.
Western astrology
In Western tropical astrology, there are 12 astrological signs. Each of the four elements is associated with three signs of the Zodiac, which are always located exactly 120 degrees away from each other along the ecliptic and said to be in trine with one another. Most modern astrologers use the four classical elements extensively, (also known as triplicities), and indeed it is still viewed as a critical part of interpreting the astrological chart.
Beginning with the first sign Aries which is a Fire sign, the next in line Taurus is Earth, then to Gemini which is Air, and finally to Cancer which is Water. This cycle continues on twice more and ends with the twelfth and final astrological sign, Pisces. The elemental rulerships for the twelve astrological signs of the zodiac (according to Marcus Manilius) are summarised as follows:
Fire — 1 – Aries; 5 – Leo; 9 – Sagittarius – hot, dry, ardent
Earth — 2 – Taurus; 6 – Virgo; 10 – Capricorn – heavy, cold, dry
Air — 3 – Gemini; 7 – Libra; 11 – Aquarius – light, hot, wet
Water — 4 – Cancer; 8 – Scorpio; 12 – Pisces – cold, wet, soft
Elements of the zodiac
Triplicity rulerships
In traditional astrology, each triplicity has several planetary rulers, which change with conditions of sect – that is, whether the chart is a day chart or a night chart. Triplicity rulerships are an important essential dignity – one of the several factors used by traditional astrologers to weigh strength, effectiveness, and integrity of each planet in a chart.
Triplicity rulerships (using the "Dorothean system") are as follows:
"Participating" rulers were not used by Ptolemy, as well as some subsequent astrologers in later traditions who followed his approach.
Triplicities by season
In ancient astrology, triplicities were more of a sea |
https://en.wikipedia.org/wiki/Lightface%20analytic%20game | In descriptive set theory, a lightface analytic game is a game whose payoff set A is a subset of Baire space; that is, there is a tree T on which is a computable subset of , such that A is the projection of the set of all branches of T.
The determinacy of all lightface analytic games is equivalent to the existence of 0#.
Effective descriptive set theory
Determinacy |
https://en.wikipedia.org/wiki/Dead%20store | In computer programming, a local variable that is assigned a value but is not read by any subsequent instruction is referred to as a dead store. Dead stores waste processor time and memory, and may be detected through the use of static program analysis, and removed by an optimizing compiler.
If the purpose of a store is intentionally to overwrite data, for example when a password is being removed from memory, dead store optimizations can cause the write not to happen, leading to a security issue. Some system libraries have specific functions designed to avoid such dangerous optimizations, e.g. explicit_bzero on OpenBSD.
Examples
Java example of a dead store:
// DeadStoreExample.java
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class DeadStoreExample {
public static void main(String[] args) {
List<String> list = new ArrayList<String>(); // This is a Dead Store, as the ArrayList is never read.
list = getList();
System.out.println(list);
}
private static List<String> getList() {
return new ArrayList<String>(Arrays.asList("Hello"));
}
}
In the above code an ArrayList<String> object was instantiated but never used. Instead, in the next line the variable which references it is set to point to a different object. The ArrayList which was created when list was declared will now need to be de-allocated, for instance by a garbage collector.
JavaScript example of a dead store:
function func(a, b) {
var x;
var i = 300;
while (i--) {
x = a + b; // dead store
}
}
The code in the loop repeatedly overwrites the same variable, so it can be reduced to only one call.
See also
Dead code
Unreachable code |
https://en.wikipedia.org/wiki/Relation%20construction | In logic and mathematics, relation construction and relational constructibility have to do with the ways that one relation is determined by an indexed family or a sequence of other relations, called the relation dataset. The relation in the focus of consideration is called the faciendum. The relation dataset typically consists of a specified relation over sets of relations, called the constructor, the factor, or the method of construction, plus a specified set of other relations, called the faciens, the ingredients, or the makings.
Relation composition and relation reduction are special cases of relation constructions.
See also
Projection
Relation
Relation composition
Mathematical relations |
https://en.wikipedia.org/wiki/Wayfinder | Wayfinder was a wholly owned subsidiary of Vodafone specializing in creating mobile navigation systems for a number of platforms such as Symbian 2nd and 3rd edition, UIQ, Windows Mobile and some other smartphones. An external Bluetooth GPS receiver is required for non GPS enabled phones. On March 12, 2010, it was announced that Vodafone was closing the company and all employees would be let go.
On July 13, 2010, Wayfinder announced that they would open source their software under the BSD 3-clause license. Source code for both the server (with import tools for map data from OpenStreetMap) and client software for various phone operating systems (including Android, iPhone and Symbian S60) is available at GitHub.
Wayfinder Navigator
Wayfinder Navigator is a mobile GPS application that provides turn-by-turn directions through a mobile phone. By downloading pre-loaded maps, Navigator can provide directions and different points of interest without Internet connection.
In May 2008, Wayfinder Navigator was updated to include pre-loaded maps, social networking and map coverage of 150 countries world-wide.
Wayfinder Earth
Wayfinder Earth is a mobile application that displays a 3D globe. The application contains over three million Points of Interest (POIs) including restaurants, train stations, bars, museums, gas stations and hospitals. Another international application, map coverage includes Europe and North America. Wayfinder Earth can set favorites, save address searches and show GPS information such as speed, position and heading as well.
As the maps are downloaded from the internet on the fly so the phone requires a GPRS/UMTS connection. Maps are cached on the phone memory or memorycard. According to the site, maps can even be downloaded from the site and stored on the phone, once you have registered.
A half an hour of navigating uses approximately 200 kb of data or only 8 kb in the so-called Guide view.
Wayfinder Active
Wayfinder Active was a mobile phone GPS a |
https://en.wikipedia.org/wiki/Zettascale%20computing | Zettascale computing refers to computing systems capable of calculating at least "1021 IEEE 754 Double Precision (64-bit) operations (multiplications and/or additions) per second (zettaFLOPS)". It is a measure of supercomputer performance, and is a hypothetical performance barrier. A zettascale computer system could generate more single floating point data in one second than was stored by the total digital means on Earth in the first quarter of 2011.
Definitions
Floating point operations per second (FLOPS) are one measure of computer performance. FLOPS can be recorded in different measures of precision, however the standard measure (used by the TOP500 supercomputer list) uses 64 bit (double-precision floating-point format) operations per second using the High Performance LINPACK (HPLinpack) benchmark.
Forecasts
In 2018, Chinese scientists predicted that the first zettascale system will be assembled in 2035. This forecast looks plausible from the historical point of view as it took some 12 years to progress from the terascale machines (1012) to petascale systems (1015) and then 14 more years to move to exascale computers (1018).
Scientists forecast that the zettascale systems are likely to be data-centric; this proposition means that the system components will move to the data, not vice versa, as the data volumes in the future are anticipated to be so large that moving data will be too expensive. It is also forecasted that the zettascale systems are expected to be decentralized—because such a model can be the shortest route to achieving zettascale performance, with millions of less powerful components linked and working together to form a collective hypercomputer that is more powerful than any single machine. Such decentralized systems may be designed to mimick complex biologic systems, and the next cybernetic paradigm may be based on liquid cybernetic systems with embodied intelligence solutions.
Potential configuration
China’s National University of Defense |
https://en.wikipedia.org/wiki/Vicar%20of%20Bray%20%28scientific%20hypothesis%29 | The "Vicar of Bray" hypothesis (or Fisher-Muller Model) attempts to explain why sexual reproduction might have advantages over asexual reproduction. Reproduction is the process by which organisms give rise to offspring. Asexual reproduction involves a single parent and results in offspring that are genetically identical to each other and to the parent.
In contrast to asexual reproduction, sexual reproduction involves two parents. Both the parents produce gametes through meiosis, a special type of cell division that reduces the chromosome number by half. During an early stage of meiosis, before the chromosomes are separated in the two daughter cells, the chromosomes undergo genetic recombination. This allows them to exchange some of their genetic information. Therefore, the gametes from a single organism are all genetically different from each other. The process in which the two gametes from the two parents unite is called fertilization. Half of the genetic information from both parents is combined. This results in offspring that are genetically different from each other and from the parents.
In short, sexual reproduction allows a continuous rearrangement of genes. Therefore, the offspring of a population of sexually reproducing individuals will show a more varied selection of phenotypes. Due to faster attainment of favorable genetic combinations, sexually reproducing populations evolve more rapidly in response to environmental changes. Under the Vicar of Bray hypothesis, sex benefits a population as a whole, but not individuals within it, making it a case of group selection.
Disadvantage of sexual reproduction
Sexual reproduction often takes a lot of effort. Finding a mate can sometimes be an expensive, risky and time consuming process. Courtship, copulation and taking care of the new born offspring may also take up a lot of time and energy. From this point of view, asexual reproduction may seem a lot easier and more efficient. But another important thing to co |
https://en.wikipedia.org/wiki/Symplectite | A symplectite (or symplektite) is a material texture: a micrometre-scale or submicrometre-scale intergrowth of two or more crystals. Symplectites form from the breakdown of unstable phases, and may be composed of minerals, ceramics, or metals. Fundamentally, their formation is the result of slow grain-boundary diffusion relative to interface propagation rate.
If a material undergoes a change in temperature, pressure or other physical conditions (e.g., fluid composition or activity), one or more phases may be rendered unstable and recrystallize to more stable constituents. If the recrystallized minerals are fine grained and intergrown, this may be termed a symplectite. A cellular precipitation reaction, in which a reactant phase decomposes to a product phase with the same structure as the parent phase and a second phase with a different structure, can form a symplectite. Eutectoid reactions, involving the breakdown of a single phase to two or more phases, neither of which is structurally or compositionally identical to the parent phase, can also form symplectites.
Symplectites may be formed by reaction between adjacent phases or to decomposition of a single phase. The intergrown phases may be planar or rodlike, depending on the volume proportions of the phases, their interfacial free energies, the rate of reaction, the Gibbs free energy change, and the degree of recrystallization. Lamellar symplectites are common in retrogressed eclogite. Kelyphite is a symplectite formed from the decomposition of garnet. Myrmekite is a globular or bulbous symplectite of quartz in plagioclase.
Examples of symplectites formed in Earth materials include
dolomite + calcite, aragonite + calcite, and magnetite + clinopyroxene.
Symplectite formation is important in metallurgy: bainite or pearlite formation from the decomposition of austenite, for example.
See also
Granophyre
Micrographic texture |
https://en.wikipedia.org/wiki/Carry%20operator | The carry operator, symbolized by the ¢ sign, is an abstraction of the operation of determining whether a portion of an adder network generates or propagates a carry. It is defined as follows:
¢
External links
http://www.aoki.ecei.tohoku.ac.jp/arith/mg/algorithm.html
Computer arithmetic |
https://en.wikipedia.org/wiki/Garlic%20routing | Garlic routing is a variant of onion routing that encrypts multiple messages together to make it more difficult for attackers to perform traffic analysis and to increase the speed of data transfer.
Michael J. Freedman defined "garlic routing" as an extension of onion routing, in which multiple messages are bundled together. He called each message a "bulb", whereas I2P calls them "garlic cloves". All messages, each with their own delivery instructions, are exposed at the endpoint. This allows the efficient bundling of an onion routing "reply block" with the original message.
Garlic routing is one of the key factors that distinguishes I2P from Tor and other privacy or encryption networks. The name alludes to the garlic plant, whose structure this protocol resembles. "Garlic routing" was first coined by Michael J. Freedman in Roger Dingledine's Free Haven Master's thesis Section 8.1.1 (June 2000), as derived from Onion Routing. However, the garlic routing implementation in I2P differs from the design proposed by Freedman. The key difference is that garlic routing has unidirectional tunnels, whereas mainstream alternatives like Tor and Mixmaster use bidirectional tunnels.
Garlic Cast: Lightweight and Decentralized Content Sharing
One potential implementation of the Garlic Routing protocol is shown in the paper, Garlic Cast: Lightweight and Decentralized Anonymous Content Sharing. The idea is to provide a resilient and low latency anonymous content sharing network based on garlic routing. The distinguishing benefit that makes the system different from traditional Tor networks is that it is designed around secure, fast communication. This is made possible by allowing the garlic cast system to use random walks to find proxies in the overlay network and then use the security-enhanced Information Dispersal Algorithm to deliver content in a secure and fast manner. Lastly, the garlic cast network is designed to be highly resistant to a wide range of attacks while still |
https://en.wikipedia.org/wiki/Chu%C3%B1o | () is a freeze-dried potato product traditionally made by Quechua and Aymara communities of Bolivia and Peru, and is known in various countries of South America, including Bolivia, Peru, Chile and Northwest Argentina. It is a five-day process, obtained by exposing a bitter, frost-resistant variety of potatoes to the very low night temperatures of the Andean Altiplano, freezing them, and subsequently exposing them to the intense sunlight of the day (this being the traditional process). The word comes from Quechua , meaning 'frozen potato' ('wrinkled' in the dialects of the Junín Region).
Origins
The existence of dates back to before the time of the Inca Empire in the 13th century, based on findings that have been made of the product at various archaeological sites. Specifically, they have been found at Tiwanaku, site of a culture which developed in the Collao Plateau, a geographic zone which includes territories of Bolivia and Peru.
It had been described in 1590 by Spanish chronicler José de Acosta. Due to its portability, long shelf life, and nutritional value, was eaten by Inca soldiers on marches. Indeed Carl Troll argued that the nighttime sub-freezing temperatures of southern Peruvian highlands that allowed for production favoured the rise of the Inca Empire.
A form of ( or ) is made from the starchy storage roots of Alstroemeria ligtu.
Production
is made at the beginning of winter during June and July, during which time the temperatures reach around at elevations of over . After fall harvest (April–May), potatoes are selected for the production of , typically small ones for ease of processing. These small potatoes are spread closely on flat ground, and allowed to freeze with the low night temperatures and dehydrate in the daytime, for about three nights. This process results in natural freeze-drying.
By the end of this process, the potatoes are taken to – flat areas where the potatoes can be laid out. The term is Aymara in origin and translates |
https://en.wikipedia.org/wiki/Arctic%E2%80%93alpine | An Arctic–alpine taxon is one whose natural distribution includes the Arctic and more southerly mountain ranges, particularly the Alps. The presence of identical or similar taxa in both the tundra of the far north, and high mountain ranges much further south is testament to the similar environmental conditions found in the two locations. Arctic–alpine plants, for instance, must be adapted to the low temperatures, extremes of temperature, strong winds and short growing season; they are therefore typically low-growing and often form mats or cushions to reduce water loss through evapotranspiration.
It is often assumed that an organism which currently has an Arctic–alpine distribution was, during colder periods of the Earth's history (such as during the Pleistocene glaciations), widespread across the area between the Arctic and the Alps. This is known from pollen records to be true for Dryas octopetala, for instance. In other cases, the disjunct distribution may be the result of long-distance dispersal.
Examples of Arctic–alpine plants include:
Arabis alpina
Betula nana
Draba incana
Dryas octopetala
Gagea serotina (syn. Lloydia serotina)
Loiseleuria procumbens
Micranthes stellaris
Oxyria digyna
Ranunculus glacialis
Salix herbacea
Saussurea alpina
Saxifraga oppositifolia
Silene acaulis
Thalictrum alpinum
Veronica alpina |
https://en.wikipedia.org/wiki/Ordbogen.com | Ordbogen A/S is an online education and language technology company located in Odense, Denmark. It is Denmark's largest web-based dictionary company, with more than 100 digital dictionaries and 1+ million article searches per day. The name Ordbogen means the dictionary in Danish.
Ordbogen A/S itself comprises several products: Two dictionary sites, Ordbogen.com and the forthcoming international site Lemma.com, and two online teaching resources Grammatip.com (grammar and spelling) and Educas.com, (all subjects of the Danish school system, 1st-10th grade). Ordbogen.com, Grammatip.com and Educas.com are all aimed at the Danish market, whereas Lemma.com targets the international market with dictionaries written in 45 languages. As of May 2016, the company has grown to more than 100 employees (with the goal of recruiting 30 more by 2017). Ordbogen has employees spanning 15 nationalities, who speak 20 different languages. The company was awarded six consecutive Børsen Gazelle Awards (2008-2013), which are awarded to the fastest growing companies in Denmark.
History and Evolution
Origins
In 2001, Michael Walther, Bjarni Norddahl, Thomas Thomsen, and Jacob Hatt founded the company Cool Systems ApS. Their associated website, coolsms.dk became one of the biggest websites in Denmark at that point in time, with 266,000 visits a day. The website allowed people to send text messages online at a lower price than the telephone companies’ usual price. Shortly after the release of coolsms.dk, Thomas Thomsen and Jacob Hatt left the company. In 2003, the remaining founders, Michael Walther and Bjarni Norddahl, went on to change Cool Systems ApS to Ordbogen ApS, and later, converted to a public limited liability company - Ordbogen A/S. 2003 was also the year when Ordbogen A/S released Ordbogen.com - the first subscription-based dictionary website in Denmark, offering easy access to a high-quality Danish-English/English-Danish dictionary, edited by Jørgen Rohde, translator and editor |
https://en.wikipedia.org/wiki/Jacob%20Eichenbaum | Jacob Moiseyovych Eichenbaum (, ; 12 October 1796 – 27 December 1861), born Jacob Gelber, was a Galician Jewish maskil, educator, poet and mathematician.
Biography
Jacob Gelber was born in the Galician city of Krystynopil, on 12 October 1796, in the year following the Third Partition of Poland by the Russian Empire.
By the age of eleven, he was already in his first marriage, but it didn't last long until the divorce, as his father-in-law suspected that he was a secularist. In 1815, when he was eighteen, he remarried, adopted the name "Eichenbaum" and settled in Zamość. There he encountered a progressive Jewish youth circle, and began studying Hebrew, German, philosophy, and (in particular) mathematics. In 1819, he translated Euclid's Elements from German into Hebrew.
He worked as a travelling private tutor, teaching Hebrew subjects and mathematics in wealthy households throughout Ukraine. In 1835, Eichenbaum opened a private school for Jewish children in Odesa, which had become an important educational centre for Ukrainian Jews. In 1836, he published Kol Zimrah, one of the first books of Modern Hebrew poetry published in the Haskalah period. In 1840, he published Ha-Kerav, a poetry book describing a variety of chess moves in verse.
Eichenbaum's educational and literary work attracted the attention of the Russian government, which advanced his position in the Jewish education system of the Russian Empire. In 1844, Eichenbaum was appointed as director of the Bessarabian Jewish school in Chișinău, and in 1850, he was appointed as chief inspector of a Yeshiva in Zhytomyr, a position which he maintained until his death.
During his final years, he continued to publish works of mathematics and poetry. In 1857, he published a Hebrew arithmetic textbook, Ḥokhmat ha-Shi'urim, which he had adapted from a work in the French language. In 1861, he wrote an allegorical poem, Ha-Kosem, which he published in the Hebrew newspaper Ha-Melitz.
On 27 December 1861, Jacob Eichenbau |
https://en.wikipedia.org/wiki/Large%20deviations%20theory | In probability theory, the theory of large deviations concerns the asymptotic behaviour of remote tails of sequences of probability distributions. While some basic ideas of the theory can be traced to Laplace, the formalization started with insurance mathematics, namely ruin theory with Cramér and Lundberg. A unified formalization of large deviation theory was developed in 1966, in a paper by Varadhan. Large deviations theory formalizes the heuristic ideas of concentration of measures and widely generalizes the notion of convergence of probability measures.
Roughly speaking, large deviations theory concerns itself with the exponential decline of the probability measures of certain kinds of extreme or tail events.
Introductory examples
An elementary example
Consider a sequence of independent tosses of a fair coin. The possible outcomes could be heads or tails. Let us denote the possible outcome of the i-th trial by where we encode head as 1 and tail as 0. Now let denote the mean value after trials, namely
Then lies between 0 and 1. From the law of large numbers it follows that as N grows, the distribution of converges to (the expected value of a single coin toss).
Moreover, by the central limit theorem, it follows that is approximately normally distributed for large The central limit theorem can provide more detailed information about the behavior of than the law of large numbers. For example, we can approximately find a tail probability of that is greater than for a fixed value of However, the approximation by the central limit theorem may not be accurate if is far from unless is sufficiently large. Also, it does not provide information about the convergence of the tail probabilities as However, the large deviation theory can provide answers for such problems.
Let us make this statement more precise. For a given value let us compute the tail probability Define
Note that the function is a convex, nonnegative function that is zero at and |
https://en.wikipedia.org/wiki/Oology | Oology (or oölogy), (), is a branch of ornithology studying bird eggs, nests and breeding behaviour. The word is derived from the Greek oion, meaning egg. Oology can also refer to the hobby of collecting wild birds' eggs, sometimes called egg collecting, birdnesting or egging, which is now illegal in many jurisdictions.
History
As a science
Oology became increasingly popular in Britain and the United States during the 1800s. Observing birds from afar was difficult because high-quality binoculars were not readily available. Thus it was often more practical to shoot the birds or collect their eggs. While the collection of the eggs of wild birds by amateurs was considered a respectable scientific pursuit in the 19th century and early 20th century, from the mid 20th century onwards it was increasingly regarded as being a hobby rather than a scientific discipline.
In the 1960s, the naturalist Derek Ratcliffe compared peregrine falcon eggs from historical collections with more recent egg-shell samples, and was able to demonstrate a decline in shell thickness. This was found to cause the link between the use by farmers of pesticides such as DDT and dieldrin, and the decline of British populations of birds of prey.
As a hobby
Egg collecting was still popular in the early 20th century, even as its scientific value became less prominent. Egg collectors built large collections and traded with one another. Frequently, collectors would go to extreme lengths to obtain eggs of rare birds. For example, Charles Bendire was willing to have his teeth broken to remove a rare egg that became stuck in his mouth. He had placed the egg in his mouth while climbing down a tree.
In 1922, the British Oological Association was founded by Baron Rothschild, a prominent naturalist, and the Reverend Francis Jourdain; the group was renamed the Jourdain Society after Jourdain's death in 1940. Rothschild and Jourdain founded it as a breakaway group after egg collecting by members of the Britis |
https://en.wikipedia.org/wiki/Edit%20distance | In computational linguistics and computer science, edit distance is a string metric, i.e. a way of quantifying how dissimilar two strings (e.g., words) are to one another, that is measured by counting the minimum number of operations required to transform one string into the other. Edit distances find applications in natural language processing, where automatic spelling correction can determine candidate corrections for a misspelled word by selecting words from a dictionary that have a low distance to the word in question. In bioinformatics, it can be used to quantify the similarity of DNA sequences, which can be viewed as strings of the letters A, C, G and T.
Different definitions of an edit distance use different sets of string operations. Levenshtein distance operations are the removal, insertion, or substitution of a character in the string. Being the most common metric, the term Levenshtein distance is often used interchangeably with edit distance.
Types of edit distance
Different types of edit distance allow different sets of string operations. For instance:
The Levenshtein distance allows deletion, insertion and substitution.
The longest common subsequence (LCS) distance allows only insertion and deletion, not substitution.
The Hamming distance allows only substitution, hence, it only applies to strings of the same length.
The Damerau–Levenshtein distance allows insertion, deletion, substitution, and the transposition (swapping) of two adjacent characters.
The Jaro distance allows only transposition.
Some edit distances are defined as a parameterizable metric calculated with a specific set of allowed edit operations, and each operation is assigned a cost (possibly infinite). This is further generalized by DNA sequence alignment algorithms such as the Smith–Waterman algorithm, which make an operation's cost depend on where it is applied.
Formal definition and properties
Given two strings and on an alphabet (e.g. the set of ASCII characters, the |
https://en.wikipedia.org/wiki/Peter%20Gacs | Péter Gács (Hungarian pronunciation: ['pe:ter 'ga:tʃ]; born May 9, 1947), professionally also known as Peter Gacs, is a Hungarian-American mathematician and computer scientist, professor, and an external member of the Hungarian Academy of Sciences. He is well known for his work in reliable computation, randomness in computing, algorithmic complexity, algorithmic probability, and information theory.
Career
Peter Gacs attended high school in his hometown, then obtained a diploma (M.S.) at Loránd Eötvös University in Budapest in 1970. Gacs started his career as a researcher at the Applied Mathematics Institute of the Hungarian Academy of Science. He obtained his doctoral degree from the Goethe University Frankfurt in 1978. Throughout his studies he had the opportunity to visit Moscow State University and work with Andrey Kolmogorov and his student Leonid A Levin. Through 1979 he was a visiting research associate at Stanford University. He was an assistant professor at University of Rochester from 1980 until 1984 when he moved to Boston University where he received tenure in 1985. He has been full professor since 1992.
Work
Gacs has made contributions in many fields of computer science. It was Gács and László Lovász who first brought ellipsoid method to the attention of the international community in August 1979 by publishing the proofs and some improvements of it. Gacs also gave contribution in the Sipser–Lautemann theorem. His main contribution and research focus were centered on cellular automata and Kolmogorov complexity.
Work on cellular automata
His most important contribution in the domain of cellular automata besides the GKL rule (Gacs–Kurdyumov–Levin rule) is the construction of a reliable one-dimensional cellular automaton presenting thus a counterexample to the positive rates conjecture. The construction that he offered is multi-scale and complex. Later, the same technique was used for the construction of aperiodic tiling sets.
Work on algorithmi |
https://en.wikipedia.org/wiki/Thermoneutral%20voltage | In electrochemistry, a thermoneutral voltage is a voltage drop across an electrochemical cell which is sufficient not only to drive the cell reaction, but to also provide the heat necessary to maintain a constant temperature. For a reaction of the form
The thermoneutral voltage is given by
where is the change in enthalpy and F is the Faraday constant.
Explanation
For a cell reaction characterized by the chemical equation:
at constant temperature and pressure, the thermodynamic voltage (minimum voltage required to drive the reaction) is given by the Nernst equation:
where is the Gibbs energy and F is the Faraday constant. The standard thermodynamic voltage (i.e. at standard temperature and pressure) is given by:
and the Nernst equation can be used to calculate the standard potential at other conditions.
The cell reaction is generally endothermic: i.e. it will extract heat from its environment. The Gibbs energy calculation generally assumes an infinite thermal reservoir to maintain a constant temperature, but in a practical case, the reaction will cool the electrode interface and slow the reaction occurring there.
If the cell voltage is increased above the thermodynamic voltage, the product of that voltage and the current will generate heat, and if the voltage is such that the heat generated matches the heat required by the reaction to maintain a constant temperature, that voltage is called the "thermoneutral voltage". The rate of delivery of heat is equal to where T is the temperature (the standard temperature, in this case) and dS/dt is the rate of entropy production in the cell. At the thermoneutral voltage, this rate will be zero, which indicates that the thermoneutral voltage may be calculated from the enthalpy.
An example
For water at standard temperature (25 C) the net cell reaction may be written:
Using Gibbs potentials ( kJ/mol), the thermodynamic voltage at standard conditions is
1.229 Volt (2 electrons needed to form H2(g))
Just as the co |
https://en.wikipedia.org/wiki/National%20Prize%20for%20Medicine | The National Prize for Medicine () was created in 2001 by the , the Association of Medical Faculties, the Association of Medical Scientific Societies, and the Medical College of Chile.
It is given to recognize the work of those doctors who have excelled among their peers in the area of clinical or public health and, in addition, have had a prominent role in teaching, academic administration, or research.
The prize consists of a diploma, a commemorative medal, and an amount of money that is contributed by the medical community.
It is awarded every two years.
Winners
2002: Julio Meneghello, surgeon of the University of Chile, pediatrician
2004: , surgeon of the University of Chile, pediatric heart surgeon
2006: , surgeon of the University of Chile, internist and gastroenterologist
2008: , surgeon of the University of Chile, internist
2010: , surgeon of the University of Chile, internist and gastroenterologist
2012: Fernando Mönckeberg Barros, medical surgeon of the University of Chile
2014: , surgeon of the University of Chile, ophthalmologist
2016: Manuel García de los Ríos Álvarez, surgeon of the University of Concepción, internist and diabetologist
2018: Otto Dörr Zegers, psychiatrist of the University of Chile
Notes
See also
List of medicine awards |
https://en.wikipedia.org/wiki/Fleur%20de%20Lys%20%28superhero%29 | Fleur de Lys is a superheroine from Quebec and an ally of Northguard, created in 1984 by Mark Shainblum and Gabriel Morrissette in the comic New Triumph featuring Northguard. The name of the character is inspired by the heraldic symbol of the fleur de lys, which is the official emblem of Quebec and a prominent part of the Flag of Quebec. The character was honored with a Canadian postage stamp in 1995, with fellow superheroes Superman, Nelvana of the Northern Lights, Johnny Canuck and Captain Canuck.
Fleur de Lys uses a fleur-de-lys-shaped, non-lethal light saber to vanquish her foes. The character's civilian identity is martial-arts expert Manon Deschamps, from Quebec.
In 2010, Fleur de Lys was featured in an animated web series, Heroes of the North, where it was revealed that the Quebecois heroine has brothers who are separatist terrorists. |
https://en.wikipedia.org/wiki/Language%20technology | Language technology, often called human language technology (HLT), studies methods of how computer programs or electronic devices can analyze, produce, modify or respond to human texts and speech. Working with language technology often requires broad knowledge not only about linguistics but also about computer science. It consists of natural language processing (NLP) and computational linguistics (CL) on the one hand, many application oriented aspects of these, and more low-level aspects such as encoding and speech technology on the other hand.
Note that these elementary aspects are normally not considered to be within the scope of related terms such as natural language processing and (applied) computational linguistics, which are otherwise near-synonyms. As an example, for many of the world's lesser known languages, the foundation of language technology is providing communities with fonts and keyboard setups so their languages can be written on computers or mobile devices. |
https://en.wikipedia.org/wiki/Definite%20quadratic%20form | In mathematics, a definite quadratic form is a quadratic form over some real vector space that has the same sign (always positive or always negative) for every non-zero vector of . According to that sign, the quadratic form is called positive-definite or negative-definite.
A semidefinite (or semi-definite) quadratic form is defined in much the same way, except that "always positive" and "always negative" are replaced by "never negative" and "never positive", respectively. In other words, it may take on zero values for some non-zero vectors of .
An indefinite quadratic form takes on both positive and negative values and is called an isotropic quadratic form.
More generally, these definitions apply to any vector space over an ordered field.
Associated symmetric bilinear form
Quadratic forms correspond one-to-one to symmetric bilinear forms over the same space. A symmetric bilinear form is also described as definite, semidefinite, etc. according to its associated quadratic form. A quadratic form and its associated symmetric bilinear form are related by the following equations:
The latter formula arises from expanding
Examples
As an example, let , and consider the quadratic form
where and and are constants. If and the quadratic form is positive-definite, so Q evaluates to a positive number whenever If one of the constants is positive and the other is 0, then is positive semidefinite and always evaluates to either 0 or a positive number. If and or vice versa, then is indefinite and sometimes evaluates to a positive number and sometimes to a negative number. If and the quadratic form is negative-definite and always evaluates to a negative number whenever And if one of the constants is negative and the other is 0, then is negative semidefinite and always evaluates to either 0 or a negative number.
In general a quadratic form in two variables will also involve a cross-product term in ·:
This quadratic form is positive-definite if and negative-d |
https://en.wikipedia.org/wiki/ACOX1 | Peroxisomal acyl-coenzyme A oxidase 1 is an enzyme that in humans is encoded by the ACOX1 gene.
The protein encoded by this gene is the first enzyme of the fatty acid beta-oxidation pathway, which catalyzes the desaturation of acyl-CoAs to 2-trans-enoyl-CoAs. It donates electrons directly to molecular oxygen, thereby producing hydrogen peroxide. Defects in this gene result in pseudoneonatal adrenoleukodystrophy, a disease that is characterized by accumulation of very long chain fatty acids. Alternatively spliced transcript variants encoding different isoforms have been identified.
See also
ACOX3
Acyl-CoA oxidase |
https://en.wikipedia.org/wiki/Carbon%E2%80%93fluorine%20bond | The carbon–fluorine bond is a polar covalent bond between carbon and fluorine that is a component of all organofluorine compounds. It is one of the strongest single bonds in chemistry (after the B–F single bond, Si–F single bond, and H–F single bond), and relatively short, due to its partial ionic character. The bond also strengthens and shortens as more fluorines are added to the same carbon on a chemical compound. As such, fluoroalkanes like tetrafluoromethane (carbon tetrafluoride) are some of the most unreactive organic compounds.
Electronegativity and bond strength
The high electronegativity of fluorine (4.0 for fluorine vs. 2.5 for carbon) gives the carbon–fluorine bond a significant polarity or dipole moment. The electron density is concentrated around the fluorine, leaving the carbon relatively electron poor. This introduces ionic character to the bond through partial charges (Cδ+—Fδ−). The partial charges on the fluorine and carbon are attractive, contributing to the unusual bond strength of the carbon–fluorine bond. The bond is labeled as "the strongest in organic chemistry," because fluorine forms the strongest single bond to carbon. Carbon–fluorine bonds can have a bond dissociation energy (BDE) of up to 130 kcal/mol. The BDE (strength of the bond) of C–F is higher than other carbon–halogen and carbon–hydrogen bonds. For example, the BDEs of the C–X bond within a CH3–X molecule is 115, 104.9, 83.7, 72.1, and 57.6 kcal/mol for X = fluorine, hydrogen, chlorine, bromine, and iodine, respectively.
Bond length
The carbon–fluorine bond length is typically about 1.35 ångström (1.39 Å in fluoromethane). It is shorter than any other carbon–halogen bond, and shorter than single carbon–nitrogen and carbon–oxygen bonds. The short length of the bond can also be attributed to the ionic character of the bond (the electrostatic attractions between the partial charges on the carbon and the fluorine). The carbon–fluorine bond length varies by several hundredths of an ån |
https://en.wikipedia.org/wiki/Infrapatellar%20branch%20of%20saphenous%20nerve | The infrapatellar branch of saphenous nerve is a nerve of the lower limb.
The saphenous nerve, located about the middle of the thigh, gives off a branch which joins the subsartorial plexus.
It pierces the sartorius and fascia lata, and is distributed to the skin in front of the patella.
This nerve communicates above the knee with the anterior cutaneous branches of the femoral nerve; below the knee, with other branches of the saphenous; and, on the lateral side of the joint, with branches of the lateral femoral cutaneous nerve, forming a plexiform net-work, the plexus patellae.
The infrapatellar branch is occasionally small, and ends by joining the anterior cutaneous branches of the femoral, which supply its place in front of the knee. |
https://en.wikipedia.org/wiki/Burnside%20problem | The Burnside problem asks whether a finitely generated group in which every element has finite order must necessarily be a finite group. It was posed by William Burnside in 1902, making it one of the oldest questions in group theory and was influential in the development of combinatorial group theory. It is known to have a negative answer in general, as Evgeny Golod and Igor Shafarevich provided a counter-example in 1964. The problem has many refinements and variants (see bounded and restricted below) that differ in the additional conditions imposed on the orders of the group elements, some of which are still open questions.
Brief history
Initial work pointed towards the affirmative answer. For example, if a group G is finitely generated and the order of each element of G is a divisor of 4, then G is finite. Moreover, A. I. Kostrikin was able to prove in 1958 that among the finite groups with a given number of generators and a given prime exponent, there exists a largest one. This provides a solution for the restricted Burnside problem for the case of prime exponent. (Later, in 1989, Efim Zelmanov was able to solve the restricted Burnside problem for an arbitrary exponent.) Issai Schur had shown in 1911 that any finitely generated periodic group that was a subgroup of the group of invertible n × n complex matrices was finite; he used this theorem to prove the Jordan–Schur theorem.
Nevertheless, the general answer to the Burnside problem turned out to be negative. In 1964, Golod and Shafarevich constructed an infinite group of Burnside type without assuming that all elements have uniformly bounded order. In 1968, Pyotr Novikov and Sergei Adian supplied a negative solution to the bounded exponent problem for all odd exponents larger than 4381. In 1982, A. Yu. Ol'shanskii found some striking counterexamples for sufficiently large odd exponents (greater than 1010), and supplied a considerably simpler proof based on geometric ideas.
The case of even exponents turned |
https://en.wikipedia.org/wiki/Grand%20rounds | Grand rounds are a methodology of medical education and inpatient care, consisting of presenting the medical problems and treatment of a particular patient to an audience consisting of doctors, pharmacists, residents, and medical students. It was first conceived by clinicians as a way for junior colleagues to round on patients. The patient was traditionally present for the round and would answer questions; grand rounds have evolved with most sessions rarely having a patient present and being more like lectures. An actor portrays the patient in some instances.
Grand rounds help doctors and other healthcare professionals keep up to date in important evolving areas which may be outside of their core practice. Most departments at major teaching hospitals will have their own specialized, often weekly, grand rounds. Attending grand rounds is also an important supplement to medical school and on-the-job resident training. Grand rounds can also be distinguished from rounds which is the (typically) daily visit by the attending physician and team to all that physician's patients on the ward. Rounding with an attending physician is an important part of medical on-the-job training and education, but its primary focus is immediate care for the patients on the ward. Grand rounds tends to present the bigger picture, including experience with patients over many years, and the newest research and treatments in an area. Grand rounds tend to be open to the entire medical professional community, whereas rounds are specific to individual attending physicians and their teams.
A 1966 report in the Australian journal Clinical Pediatrics called into question the sometimes inconsiderate behavior of practitioners who treated patients who were featured cases of grand rounds.
Video archives
Many teaching and research hospitals have started providing streaming video of their grand rounds presentations for free over the Internet. This is an opportunity for medical professionals and students t |
https://en.wikipedia.org/wiki/Inverse%20semigroup | In group theory, an inverse semigroup (occasionally called an inversion semigroup) S is a semigroup in which every element x in S has a unique inverse y in S in the sense that and , i.e. a regular semigroup in which every element has a unique inverse. Inverse semigroups appear in a range of contexts; for example, they can be employed in the study of partial symmetries.
(The convention followed in this article will be that of writing a function on the right of its argument, e.g. x f rather than f(x), and
composing functions from left to right—a convention often observed in semigroup theory.)
Origins
Inverse semigroups were introduced independently by Viktor Vladimirovich Wagner in the Soviet Union in 1952, and by Gordon Preston in the United Kingdom in 1954. Both authors arrived at inverse semigroups via the study of partial bijections of a set: a partial transformation α of a set X is a function from A to B, where A and B are subsets of X. Let α and β be partial transformations of a set X; α and β can be composed (from left to right) on the largest domain upon which it "makes sense" to compose them:
where α−1 denotes the preimage under α. Partial transformations had already been studied in the context of pseudogroups. It was Wagner, however, who was the first to observe that the composition of partial transformations is a special case of the composition of binary relations. He recognised also that the domain of composition of two partial transformations may be the empty set, so he introduced an empty transformation to take account of this. With the addition of this empty transformation, the composition of partial transformations of a set becomes an everywhere-defined associative binary operation. Under this composition, the collection of all partial one-one transformations of a set X forms an inverse semigroup, called the symmetric inverse semigroup (or monoid) on X, with inverse the functional inverse defined from image to domain (equivalently, the convers |
https://en.wikipedia.org/wiki/System%20573 | The System 573 is an arcade system board made by Konami based on the original PlayStation. The hardware was used primarily for Konami's Bemani series of music video game arcades, including the popular Dance Dance Revolution series introduced in 1998. The System 573 is available is configurable with various expansion IO boards to add extra input or output, such as the analog and digital I/O boards for Dance Dance Revolution and other Bemani games. Systems with these IO boards are often called System 573 Analog and System 573 Digital respectively. There is another variant called the System 573 Satellite Terminal which allows for up to eight cabinets to be networked to a central one.
The name of the board is rooted in Japanese wordplay; each number in Japanese can be read with a number of different names, with Konami's name being one of many possible readings for "five-seven-three."
Technical specifications
Central processor: 33.8688 MHz MIPS R3000A RISC processor, 4KB cache.
Memory: 4MB of EDO work RAM, 2MB VRAM, 512KB sound RAM.
Storage: ATAPI CD-ROM drive, 16MB flash storage, 16MB PC-CARD flash storage.
Sound processor: PlayStation SPU, MAS 3507-D MPEG 1/2 decoder chip for decoding 573 Digital game audio.
I/O processor: Hitachi H8/3644 MCU for JVS functions.
Screen resolution: 256x224p or 640x480i.
The System 573 uses the same system design as the original Sony PlayStation but with a few upgrades. Notably the 573 uses double the work RAM and video RAM and is missing the CD controller from the PlayStation. Also added was an IDE port, RTC with battery backed SRAM, dedicated JAMMA and JVS interfaces, a security cart which could be used to easily add basic expansion I/O hardware and dual PCMCIA slots, although these are only wired up as memory devices and cannot be used for I/O cards.
The System 573 exists in several configurations, sharing the same base motherboard but being packaged into various cases and with addon IO expansions for different games. Such configu |
https://en.wikipedia.org/wiki/Systems%20Biology%20in%20Reproductive%20Medicine | Systems Biology in Reproductive Medicine is a peer-reviewed medical journal that covers the use of systems approaches including genomic, cellular, proteomic, metabolomic, bioinformatic, molecular, and biochemical, to address fundamental questions in reproductive biology, reproductive medicine, and translational research. The journal publishes research involving human and animal gametes, stem cells, developmental biology, toxicology, and clinical care in reproductive medicine.
Editor
The editor-in-chief of Systems Biology in Reproductive Medicine is S. A. Krawetz (Wayne State University). |
https://en.wikipedia.org/wiki/Noshi | are a kind of ceremonial origami fold entirely distinct from "origami-tsuki". They serve as gifts that express "good wishes". Noshi consists of white paper folded with a strip of dried abalone or meat, considered a token of good fortune.
See also
Shūgi-bukuro |
https://en.wikipedia.org/wiki/Ureaplasma%20canigenitalium | Ureaplasma canigenitalium is a species of Ureaplasma, a genus of bacteria belonging to the family Mycoplasmataceae. It has been isolated from dogs. It possesses the sequence accession no. (16S rRNA gene) for the type strain: D78648. |
https://en.wikipedia.org/wiki/Affine%20Grassmannian | In mathematics, the affine Grassmannian of an algebraic group G over a field k is an ind-scheme—a colimit of finite-dimensional schemes—which can be thought of as a flag variety for the loop group G(k((t))) and which describes the representation theory of the Langlands dual group LG through what is known as the geometric Satake correspondence.
Definition of Gr via functor of points
Let k be a field, and denote by and the category of commutative k-algebras and the category of sets respectively. Through the Yoneda lemma, a scheme X over a field k is determined by its functor of points, which is the functor which takes A to the set X(A) of A-points of X. We then say that this functor is representable by the scheme X. The affine Grassmannian is a functor from k-algebras to sets which is not itself representable, but which has a filtration by representable functors. As such, although it is not a scheme, it may be thought of as a union of schemes, and this is enough to profitably apply geometric methods to study it.
Let G be an algebraic group over k. The affine Grassmannian GrG is the functor that associates to a k-algebra A the set of isomorphism classes of pairs (E, φ), where E is a principal homogeneous space for G over Spec A and φ is an isomorphism, defined over Spec A((t)), of E with the trivial G-bundle G × Spec A((t)). By the Beauville–Laszlo theorem, it is also possible to specify this data by fixing an algebraic curve X over k, a k-point x on X, and taking E to be a G-bundle on XA and φ a trivialization on (X − x)A. When G is a reductive group, GrG is in fact ind-projective, i.e., an inductive limit of projective schemes.
Definition as a coset space
Let us denote by the field of formal Laurent series over k, and by the ring of formal power series over k. By choosing a trivialization of E over all of , the set of k-points of GrG is identified with the coset space . |
https://en.wikipedia.org/wiki/Square%20root%20of%20a%202%20by%202%20matrix | A square root of a 2×2 matrix M is another 2×2 matrix R such that M = R2, where R2 stands for the matrix product of R with itself. In general, there can be zero, two, four, or even an infinitude of square-root matrices. In many cases, such a matrix R can be obtained by an explicit formula.
Square roots that are not the all-zeros matrix come in pairs: if R is a square root of M, then −R is also a square root of M, since (−R)(−R) = (−1)(−1)(RR) = R2 = M.A 2×2 matrix with two distinct nonzero eigenvalues has four square roots. A positive-definite matrix has precisely one positive-definite square root.
A general formula
The following is a general formula that applies to almost any 2 × 2 matrix. Let the given matrix be
where A, B, C, and D may be real or complex numbers. Furthermore, let τ = A + D be the trace of M, and δ = AD − BC be its determinant. Let s be such that s2 = δ, and t be such that t2 = τ + 2s. That is,
Then, if t ≠ 0, a square root of M is
Indeed, the square of R is
Note that R may have complex entries even if M is a real matrix; this will be the case, in particular, if the determinant δ is negative.
The general case of this formula is when δ is nonzero, and τ2 ≠ 4δ, in which case s is nonzero, and t is nonzero for each choice of sign of s. Then the formula above will provide four distinct square roots R, one for each choice of signs for s and t.
Special cases of the formula
If the determinant δ is zero, but the trace τ is nonzero, the general formula above will give only two distinct solutions, corresponding to the two signs of t. Namely,
where t is any square root of the trace τ.
The formula also gives only two distinct solutions if δ is nonzero, and τ2 = 4δ (the case of duplicate eigenvalues), in which case one of the choices for s will make the denominator t be zero. In that case, the two roots are
where s is the square root of δ that makes τ − 2s nonzero, and t is any square root of τ − 2s.
The formula above fails completely if δ |
https://en.wikipedia.org/wiki/8th%20meridian%20west | The meridian 8° west of Greenwich is a line of longitude that extends from the North Pole across the Arctic Ocean, the Atlantic Ocean, Europe, Africa, the Southern Ocean, and Antarctica to the South Pole.
The 8th meridian west forms a great circle with the 172nd meridian east.
From Pole to Pole
Starting at the North Pole and heading south to the South Pole, the 8th meridian west passes through:
{| class="wikitable plainrowheaders"
! scope="col" width="125" | Co-ordinates
! scope="col" | Country, territory or sea
! scope="col" | Notes
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Arctic Ocean
| style="background:#b0e0e6;" |
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" |
|-
|
! scope="row" |
| Island of Jan Mayen
|-valign="top"
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" | Passing just west of the island of Mykines, (at ) Passing just west of the Monach Islands, Scotland, (at ) Passing just west of the island of Mingulay, Scotland, (at )
|-
|
! scope="row" |
|
|-
|
! scope="row" |
| Northern Ireland
|-
|
! scope="row" |
| Passing just west of Athlone (at )
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" |
|-
|
! scope="row" |
| Cedeira (province of A Coruña)
|-
|
! scope="row" |
| Montalegre (Vila Real District)
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" |
|-
|
! scope="row" |
| Passing through Marrakesh (at )
|-
|
! scope="row" |
|
|-
|
! scope="row" |
|
|-
|
! scope="row" |
| Passing through Bamako (at )
|-
|
! scope="row" |
|
|-
|
! scope="row" |
|
|-
|
! scope="row" |
|
|-
|
! scope="row" |
|
|-
|
! scope="row" |
| For about 3 km
|-
|
! scope="row" |
| For about 9 km
|-
|
! scope=" |
https://en.wikipedia.org/wiki/Mehrotra%20predictor%E2%80%93corrector%20method | Mehrotra's predictor–corrector method in optimization is a specific interior point method for linear programming. It was proposed in 1989 by Sanjay Mehrotra.
The method is based on the fact that at each iteration of an interior point algorithm it is necessary to compute the Cholesky decomposition (factorization) of a large matrix to find the search direction. The factorization step is the most computationally expensive step in the algorithm. Therefore, it makes sense to use the same decomposition more than once before recomputing it.
At each iteration of the algorithm, Mehrotra's predictor–corrector method uses the same Cholesky decomposition to find two different directions: a predictor and a corrector.
The idea is to first compute an optimizing search direction based on a first order term (predictor). The step size that can be taken in this direction is used to evaluate how much centrality correction is needed. Then, a corrector term is computed: this contains both a centrality term and a second order term.
The complete search direction is the sum of the predictor direction and the corrector direction.
Although there is no theoretical complexity bound on it yet, Mehrotra's predictor–corrector method is widely used in practice. Its corrector step uses the same Cholesky decomposition found during the predictor step in an effective way, and thus it is only marginally more expensive than a standard interior point algorithm. However, the additional overhead per iteration is usually paid off by a reduction in the number of iterations needed to reach an optimal solution. It also appears to converge very fast when close to the optimum.
Derivation
The derivation of this section follows the outline by Nocedal and Wright.
Predictor step - Affine scaling direction
A linear program can always be formulated in the standard form
where and define the problem with constraints and equations while is a vector of variables.
The Karush-Kuhn-Tucker (KKT) conditions for |
https://en.wikipedia.org/wiki/Microbial%20phylogenetics | Microbial phylogenetics is the study of the manner in which various groups of microorganisms are genetically related. This helps to trace their evolution. To study these relationships biologists rely on comparative genomics, as physiology and comparative anatomy are not possible methods.
History
1960s–1970s
Microbial phylogenetics emerged as a field of study in the 1960s, scientists started to create genealogical trees based on differences in the order of amino acids of proteins and nucleotides of genes instead of using comparative anatomy and physiology.
One of the most important figures in the early stage of this field is Carl Woese, who in his researches, focused on Bacteria, looking at RNA instead of proteins. More specifically, he decided to compare the small subunit ribosomal RNA (16rRNA) oligonucleotides. Matching oligonucleotides in different bacteria could be compared to one another to determine how closely the organisms were related. In 1977, after collecting and comparing 16s rRNA fragments for almost 200 species of bacteria, Woese and his team in 1977 concluded that Archaebacteria were not part of Bacteria but completely independent organisms.
1980s–1990s
In the 1980s microbial phylogenetics went into its golden age, as the techniques for sequencing RNA and DNA improved greatly. For example, comparison of the nucleotide sequences of whole genes was facilitated by the development of the means to clone DNA, making possible to create many copies of sequences from minute samples. Of incredible impact for the microbial phylogenetics was the invention of the polymerase chain reaction (PCR). All these new techniques led to the formal proposal of the three domains of life: Bacteria, Archaea (Woese himself proposed this name to replace the old nomination of Archaebacteria), and Eukarya, arguably one of the key passage in the history of taxonomy.
One of the intrinsic problems of studying microbial organisms was the dependence of the studies from pure cultur |
https://en.wikipedia.org/wiki/CII%20Iris%2080 | The CII Iris 80 computer is the most powerful computer made by the French company CII as part of Plan Calcul. It was released in 1970 and had roughly the same capabilities and performance than its main rivals in Europe: the IBM 360/75 and 360/85.
The Iris 80 is the backward-compatible successor to the CII 10070, a licensed SDS Sigma-7, and to the Iris 50, an in-house development from the Sigma-9 architecture. It essentially upgraded the Iris 50 with modern integrated circuits, as well as multiprocessor capabilities. Its operating system, Siris 8, was also upgraded from Siris 7 to leverage the new capabilities of the Iris 80.
Because of a policy of national preference that the Plan Calcul imposed on the public sector, this computer was installed at four of the approximately twenty French university computing centers in the mid-1970s, as well as INRIA and other research organizations.
About a hundred Iris 80s were delivered, including 27 dual processors.
The CS 40, used for telephone switching, was derived from it.
The original successors to the Iris 80 was supposed to be the CII / Unidata X4 and X5 set to be released in 1976. However, after the eventual merger of CII with Honeywell-Bull, the Iris 80 was instead succeeded by the DPS-7, which included an Iris 80 and Siris 8 emulation mode to ensure compatibility.
Hardware
CPU
The CPU is a modification of the CII 10070 (32-bit words, largely identical instruction set), with addressing revised for multi-processor operation. Paging uses associative memory. Main memory can be expanded to 4 megabytes. Calculation precision is 64 bits, ensuring the convergence of calculations that may diverge on other machines.
Peripherals
Magnetic disk capacity increased from the MD 25 (25 megabytes) to MD 200 (200 megabytes) by 1974. Mitra 15 minicomputers are used as controllers.
Software
Operating systems
The Iris 80's operating system is a multitasking operating system known as Siris 8, a rewrite of Siris 7, intended to take a |
https://en.wikipedia.org/wiki/Load%20management | Load management, also known as demand-side management (DSM), is the process of balancing the supply of electricity on the network with the electrical load by adjusting or controlling the load rather than the power station output. This can be achieved by direct intervention of the utility in real time, by the use of frequency sensitive relays triggering the circuit breakers (ripple control), by time clocks, or by using special tariffs to influence consumer behavior. Load management allows utilities to reduce demand for electricity during peak usage times (peak shaving), which can, in turn, reduce costs by eliminating the need for peaking power plants. In addition, some peaking power plants can take more than an hour to bring on-line which makes load management even more critical should a plant go off-line unexpectedly for example. Load management can also help reduce harmful emissions, since peaking plants or backup generators are often dirtier and less efficient than base load power plants. New load-management technologies are constantly under development — both by private industry and public entities.
Brief history
Modern utility load management began about 1938, using ripple control. By 1948 ripple control was a practical system in wide use.
The Czechs first used ripple control in the 1950s. Early transmitters were low power, compared to modern systems, only 50 kilovolt-amps. They were rotating generators that fed a 1050 Hz signal into transformers attached to power distribution networks. Early receivers were electromechanical relays. Later, in the 1970s, transmitters with high-power semiconductors were used. These are more reliable because they have no moving parts. Modern Czech systems send a digital "telegram." Each telegram takes about thirty seconds to send. It has pulses about one second long. There are several formats, used in different districts.
In 1972, Theodore George “Ted” Paraskevakos, while working for Boeing in Huntsville, Alabama, developed a se |
https://en.wikipedia.org/wiki/Adiabatic%20quantum%20motor | An adiabatic quantum motor is a mechanical device, typically nanometric, driven by a flux of quantum particles and able to perform cyclic motions.
The adjective “adiabatic” in this context refers to the limit when the dynamics of the mechanical degrees of freedom is slow compared with the dwell time of the particles passing through the device. In this regime, it is commonly assumed that the mechanical degrees of freedom behave classically.
This class of devices works essentially as quantum pumps operated in reverse. While in a quantum pump, the periodic movement of some parameters pumps quantum particles from one reservoir to another, in a quantum motor a DC current of particles induces the cyclic motion of the device. One key feature of these motors is that quantum interferences can be used to increase their efficiency by enhancing the reflection coefficient of the scattered particles. Although there are several proposals for the realization of adiabatic quantum motors, none of them have been verified experimentally.
Adiabatic quantum motors
Anderson's adiabatic quantum motor
Thouless motor
Adiabatic quantum motors based on quantum dots
Nanomagnet coupled to a quantum spin Hall edge (formally equivalent to a Thouless motor)
Adiabatic quantum motors driven by temperature gradients |
https://en.wikipedia.org/wiki/Syncword | In computer networks, a syncword, sync character, sync sequence or preamble is used to synchronize a data transmission by indicating the end of header information and the start of data. The syncword is a known sequence of data used to identify the start of a frame, and is also called reference signal or midamble in wireless communications.
Prefix codes allow unambiguous identification of synchronization sequences and may serve as self-synchronizing code.
Examples
In an audio receiver receiving a bit stream of data, an example of a syncword is 0x0B77 for an AC-3 encoded stream.
An Ethernet packet with the Ethernet preamble, 56 bits of alternating 1 and 0 bits, allowing the receiver to synchronize its clock to the transmitter, followed by a one-octet start frame delimiter byte and then the header.
All USB packets begin with a sync field (8 bits long at low speed, 32 bits long at high speed) used to synchronize the receiver's clock to the transmitter's clock.
A receiver uses a physical layer preamble, also called a physical layer training sequence, to synchronize on the signal by estimating frequency and clock offsets.
Some documentation uses "preamble" to refer to a signal used to announce a transmission, to wake-up receivers in a low-power mode.
While some systems use exactly the same signal for both physical-layer training and wake-up functions, others use 2 different signals at 2 different times for these 2 functions, or have only one or the other of these signals.
The Bisync protocol of the 1960s used a minimum of two ASCII "SYN" characters (0x16…0x16) to achieve character synchronization in an undifferentiated bit stream, then other special characters to synchronize to the beginning of a frame of characters.
The syncwords can be seen as a kind of delimiter. Various techniques are used to avoid delimiter collision, orin other wordsto "disguise" bytes of data at the data link layer that might otherwise be incorrectly recognized as the syncword. For exam |
https://en.wikipedia.org/wiki/L%20ring | The L-ring of the bacterial flagellum is the ring in the lipid outer cell membrane through which the axial filament (rod, hook, and flagellum) passes. that l ring stands for lipopolysaccharide. |
https://en.wikipedia.org/wiki/List%20of%20PET%20radiotracers | This is a list of positron emission tomography (PET) radiotracers. These are chemical compounds in which one or more atoms have been replaced by a short-lived, positron emitting radioisotope.
Cardiology
[15O] water
[13N] ammonia
[82Rb] Rubidium-82 chloride
[11C] Acetate (Also used in oncology)
Neurology
[11C] 25B-NBOMe (Cimbi-36)
[18F] Altanserin
[11C] Carfentanil
[11C] DASB
[11C] DTBZ or [18F]Fluoropropyl-DTBZ
[11C] [11C] ME@HAPTHI
[18F] Fallypride
[18F] Florbetaben
[18F] Flubatine
[18F] Fluspidine
[18F] Florbetapir
[18F] or [11C] Flumazenil
[18F] Flutemetamol
[18F] Fluorodopa
[18F] Desmethoxyfallypride
[18F] Mefway
[18F] MPPF
[18F] Nifene
[11C] Pittsburgh compound B
[11C] Raclopride
[18F] Setoperone
[18F] or [11C] N-Methylspiperone
[11C] Verapamil
NIMH maintains a list of CNS radiotracers that may be useful for additional information.
Neuroepigenetics
[11C] Martinostat
Oncology
[18F] Fludeoxyglucose (18F) (FDG)-glucose analogue
[11C] Acetate
[11C] Methionine
[11C] choline
[18F] EF5
[18F] Fluciclovine
[18F] Fluorocholine
[18F] FET
[18F] FMISO
[18F] Fluorothymidine F-18
[64Cu] Cu-ETS2
[64Cu] Copper-64 DOTA-TATE
[68Ga] DOTA-pseudopeptides
[68Ga] DOTA-TATE
[68Ga] PSMA
[68Ga] CXCR4; solid and hematologic cancers
Infectious diseases
[18F] Fluorodeoxysorbitol (FDS)
Further reading
CNS Radiotracers that have been advanced for use in Human Studies |
https://en.wikipedia.org/wiki/Quadratic%20residue | In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that:
Otherwise, q is called a quadratic nonresidue modulo n.
Originally an abstract mathematical concept from the branch of number theory known as modular arithmetic, quadratic residues are now used in applications ranging from acoustical engineering to cryptography and the factoring of large numbers.
History, conventions, and elementary facts
Fermat, Euler, Lagrange, Legendre, and other number theorists of the 17th and 18th centuries established theorems and formed conjectures about quadratic residues, but the first systematic treatment is § IV of Gauss's Disquisitiones Arithmeticae (1801). Article 95 introduces the terminology "quadratic residue" and "quadratic nonresidue", and states that if the context makes it clear, the adjective "quadratic" may be dropped.
For a given n a list of the quadratic residues modulo n may be obtained by simply squaring the numbers 0, 1, ..., . Because a2 ≡ (n − a)2 (mod n), the list of squares modulo n is symmetric around n/2, and the list only needs to go that high. This can be seen in the table below.
Thus, the number of quadratic residues modulo n cannot exceed n/2 + 1 (n even) or (n + 1)/2 (n odd).
The product of two residues is always a residue.
Prime modulus
Modulo 2, every integer is a quadratic residue.
Modulo an odd prime number p there are (p + 1)/2 residues (including 0) and (p − 1)/2 nonresidues, by Euler's criterion. In this case, it is customary to consider 0 as a special case and work within the multiplicative group of nonzero elements of the field Z/pZ. (In other words, every congruence class except zero modulo p has a multiplicative inverse. This is not true for composite moduli.)
Following this convention, the multiplicative inverse of a residue is a residue, and the inverse of a nonresidue is a nonresidue.
Following this convention, modulo an od |
https://en.wikipedia.org/wiki/NAT%20traversal | Network address translation traversal is a computer networking technique of establishing and maintaining Internet Protocol connections across gateways that implement network address translation (NAT).
NAT traversal techniques are required for many network applications, such as peer-to-peer file sharing and voice over IP.
Network address translation
Network address translation typically uses private IP addresses on private networks with a single public IP address for the router facing the Internet. The network address translator changes the source address in network protocols for outgoing requests from that of an internal device to its external address, so that internal devices can communicate with hosts on the external network, while relaying replies back to the originating device.
This leaves the internal network ill-suited for hosting services, as the NAT device has no automatic method for determining the internal host for which incoming packets from the external network are destined. This is not a problem for general web access and email. However, applications such as peer-to-peer file sharing, VoIP services, and video game consoles require clients to be servers as well. Incoming requests cannot be easily correlated to the proper internal host. Furthermore, many of these types of services carry IP address and port number information in the application data, potentially requiring substitution with deep packet inspection.
Network address translation technologies are not standardized. As a result, the methods used for NAT traversal are often proprietary and poorly documented. Many traversal techniques require assistance from servers outside of the masqueraded network. Some methods use the server only when establishing the connection, while others are based on relaying all data through it, which increases the bandwidth requirements and latency, detrimental to real-time voice and video communications.
NAT traversal techniques usually bypass enterprise security po |
https://en.wikipedia.org/wiki/Biological%20immortality | Biological immortality (sometimes referred to as bio-indefinite mortality) is a state in which the rate of mortality from senescence is stable or decreasing, thus decoupling it from chronological age. Various unicellular and multicellular species, including some vertebrates, achieve this state either throughout their existence or after living long enough. A biologically immortal living being can still die from means other than senescence, such as through injury, poison, disease, predation, lack of available resources, or changes to environment.
This definition of immortality has been challenged in the Handbook of the Biology of Aging, because the increase in rate of mortality as a function of chronological age may be negligible at extremely old ages, an idea referred to as the late-life mortality plateau. The rate of mortality may cease to increase in old age, but in most cases that rate is typically very high.
The term is also used by biologists to describe cells that are not subject to the Hayflick limit on how many times they can divide.
Cell lines
Biologists chose the word "immortal" to designate cells that are not subject to the Hayflick limit, the point at which cells can no longer divide due to DNA damage or shortened telomeres. Prior to Leonard Hayflick's theory, Alexis Carrel hypothesized that all normal somatic cells were immortal.
The term "immortalization" was first applied to cancer cells that expressed the telomere-lengthening enzyme telomerase, and thereby avoided apoptosis—i.e. cell death caused by intracellular mechanisms. Among the most commonly used cell lines are HeLa and Jurkat, both of which are immortalized cancer cell lines. These cells have been and still are widely used in biological research such as creation of the polio vaccine, sex hormone steroid research, and cell metabolism. Embryonic stem cells and germ cells have also been described as immortal.
Immortal cell lines of cancer cells can be created by induction of oncogenes or l |
https://en.wikipedia.org/wiki/Simutrans | Simutrans is a cross-platform simulation game in which the player strives to run a successful transport system by constructing and managing transportation systems for passengers, mail and goods by land (rail, road, tram, monorail, maglev), air (airplanes) and water (ship) between places. Like OpenTTD, Simutrans is an open-source transportation game based on the Transport Tycoon idea.
Development history
Simutrans was originally written by Hansjörg Malthaner in 1997. Around 2004 he retired from development, and an international community of volunteers took over the development. Simutrans was developed internally as a closed source game until 2007, when the software was relicensed under the Artistic License.
Simutrans has been ported to Microsoft Windows, Linux, BeOS/Haiku, Mac OS X, and AmigaOS 4.x, which make use of several graphics libraries such as GDI (Windows only), SDL (all versions) or Allegro (BeOS only). It is portable to any architecture using GCC and one of the aforementioned libraries. Simutrans has also multilingual support.
The current stable release of Simutrans is version 123.0.1 as of January 30, 2022. There is a popular branch of the code called Simutrans-Extended, which aims to extend the basic game. Simutrans-Extended was formerly called Simutrans-Experimental, but changed its name to Simutrans-Extended on February 13, 2017 to make clear that it is a distinct fork of Simutrans and not a testing branch. Nightly builds for Simutrans and the main PakSets are also released for both standard and Extended versions.
Overview and features
The main goal in Simutrans is to provide an efficient transport system for passengers, mail and goods to be transported to their desired destinations fast and with minimal transfers and at the same time making the company grow avoiding bankruptcy or excess administration.
Simutrans has a number of factory chains that are interconnected with other chains, for example, a coal mine produces coal for a coal power plan |
https://en.wikipedia.org/wiki/Constantin%20Corduneanu | Constantin Corduneanu (July 26, 1928 – December 26, 2018) was a Romanian-American mathematician and professor of mathematics at the University of Texas at Arlington. In 2015, he was elected a titular member of the Romanian Academy. He was a corresponding member of the Academy since 1974. A Festschrift in his honor, titled Mathematical Analysis With Applications, was published in 2018.
Corduneanu was born in Potângeni, Iași County. He received his Ph.D. in 1956 from the University of Iași with thesis Probleme globale pentru ecuațiile diferențiale de ordin I și II written under the supervision of Ilie Popa.
Books
Almost Periodic Functions (1968)
Integral Equations and Stability of Feedback Systems (1973)
Integral Equations and Applications (1991)
Functional Equations with Causal Operators (2001)
Almost Periodic Oscillations and Waves (2009)
Functional Differential Equations: Advances and Applications (2016) |
https://en.wikipedia.org/wiki/Light-harvesting%20complexes%20of%20green%20plants | The light-harvesting complex (or antenna complex; LH or LHC) is an array of protein and chlorophyll molecules embedded in the thylakoid membrane of plants and cyanobacteria, which transfer light energy to one chlorophyll a molecule at the reaction center of a photosystem.
The antenna pigments are predominantly chlorophyll b, xanthophylls, and carotenes. Chlorophyll a is known as the core pigment. Their absorption spectra are non-overlapping and broaden the range of light that can be absorbed in photosynthesis. The carotenoids have another role as an antioxidant to prevent photo-oxidative damage of chlorophyll molecules. Each antenna complex has between 250 and 400 pigment molecules and the energy they absorb is shuttled by resonance energy transfer to a specialized chlorophyll-protein complex known as the reaction center of each photosystem. The reaction center initiates a complex series of chemical reactions that capture energy in the form of chemical bonds.
For photosystem II, when either of the two chlorophyll a molecules at the reaction center absorb energy, an electron is excited and transferred to an electron acceptor molecule, pheophytin, leaving the chlorophyll a in an oxidized state. The oxidised chlorophyll a replaces the electrons by photolysis that involves the oxidation of water molecules to oxygen, protons and electrons.
The N-terminus of the chlorophyll a-b binding protein extends into the stroma where it is involved with adhesion of granal membranes and photo-regulated by reversible phosphorylation of its threonine residues. Both these processes are believed to mediate the distribution of excitation energy between photosystems I and II.
This family also includes the photosystem II protein PsbS, which plays a role in energy-dependent quenching that increases thermal dissipation of excess absorbed light energy in the photosystem.
LH 1
Light-harvesting complex I is permanently bound to photosystem I via the plant-specific subunit PsaG. It is made u |
https://en.wikipedia.org/wiki/Dorsal%20carpal%20arch | The dorsal carpal arch (dorsal carpal network, posterior carpal arch) is an anatomical term for the combination (anastomosis) of dorsal carpal branch of the radial artery and the dorsal carpal branch of the ulnar artery near the back of the wrist.
It is made up of the dorsal carpal branches of both the ulnar and radial arteries. It also anastomoses with the anterior interosseous artery and the posterior interosseous artery. The arch gives off three dorsal metacarpal arteries.
See also
Palmar carpal arch
Deep palmar arch
Superficial palmar arch |
https://en.wikipedia.org/wiki/Diederich%20Franz%20Leonhard%20von%20Schlechtendal | Diederich Franz Leonhard von Schlechtendal (27 November 1794, Xanten – 12 October 1866, Halle) was a German botanist.
He studied in Berlin, in 1819 becoming curator of the Royal Herbarium. He was a professor of botany and director of the Botanical Gardens at the Martin Luther University of Halle-Wittenberg from 1833 until his death in 1866.
The genus Schlechtendalia (Asteraceae), from Brazil, Uruguay and Argentina, was named in his honor.
He was editor of the botanical journal Linnaea (from 1826), and with Hugo von Mohl (1805-1872), was publisher of the Botanischen Zeitung (from 1843).
He conducted important investigations of the then largely unknown flora of Mexico, carried out in conjunction with Adelbert von Chamisso (1781-1838), and based on specimens collected by Christian Julius Wilhelm Schiede (1798-1836), and Ferdinand Deppe (1794-1861).
Schlechtendal was a critic of Darwinism but accepted a limited form of evolution. He advocated a form common descent of "some groups of very similar species, which also inhabit a limited area".
Written works
Animadversiones botanicae in Ranunculaceas, Berlin 1819–1820.
Flora berolinensis, Berlin 1823–1824.
Adumbrationes plantarum, 1825–1832.
Flora von Deutschland, Jena 1840–1873 (with Christian Eduard Langethal and Ernst Schenk; fifth edition by Ernst Hallier 1880–1887).
Hortus halensis, Halle 1841–1853. |
https://en.wikipedia.org/wiki/Syringodermataceae | Syringodermataceae is a family of brown algae. It includes two genera, Microzonia and Syringoderma. |
https://en.wikipedia.org/wiki/Modern%20Physics%20Letters%20B | Modern Physics Letters B is a peer-reviewed scientific journal on physics, especially the areas of condensed matter, statistical and applied physics, and high-Tc superconductivity. It was established in 1987 and is published by World Scientific.
Related journals
Modern Physics Letters A
Abstracting and indexing
The journal is abstracted and indexed in:
Science Citation Index
Materials Science Citation Index
Current Contents/Physical, Chemical & Earth Sciences
Astrophysics Data System
Mathematical Reviews
Inspec
CSA Meteorological & Geoastrophysical Abstracts
Scopus
According to the Journal Citation Reports, the journal has a 2020 impact factor of 1.668. |
https://en.wikipedia.org/wiki/International%20Conference%20on%20Technology%20in%20Collegiate%20Mathematics | The International Conference on Technology in Collegiate Mathematics (ICTCM) is an annual conference sponsored by Pearson Addison-Wesley & Pearson Prentice Hall publishers. Electronic proceedings have been available for many years and are included in the List of free electronic journals in mathematics.
Since ICTCM 10, the conference has awarded an annual ICTCM Award to recognize an individual or group for excellence and innovation in using technology to enhance the teaching and learning of mathematics. |
https://en.wikipedia.org/wiki/MENTAL%20domain | The MENTAL or MLN64 NH2-terminal domain is a membrane-spanning domain that is conserved in two late endosomal proteins in vertebrates, MLN64 and MENTHO. The domain is 170 amino acids long.
Current data indicates that this domain allows for dimerization between MLN64 and MENTHO molecules and with themselves. The domain may also direct cholesterol transport. |
https://en.wikipedia.org/wiki/Partial%20allocation%20mechanism | The Partial Allocation Mechanism (PAM) is a mechanism for truthful resource allocation. It is based on the max-product allocation - the allocation maximizing the product of agents' utilities (also known as the Nash-optimal allocation or the Proportionally-Fair solution; in many cases it is equivalent to the competitive equilibrium from equal incomes). It guarantees to each agent at least 0.368 of his/her utility in the max-product allocation. It was designed by Cole, Gkatzelis and Goel.
Setting
There are m resources that are assumed to be homogeneous and divisible.
There are n agents, each of whom has a personal function that attributes a numeric value to each "bundle" (combination of resources). The valuations are assumed to be homogeneous functions.
The goal is to decide what "bundle" to give to each agent, where a bundle may contain a fractional amount of each resource.
Crucially, some resources may have to be discarded, i.e., free disposal is assumed.
Monetary payments are not allowed.
Algorithm
PAM works in the following way.
Calculate the max-product allocation; denote it by z.
For each agent i:
Calculate the max-product allocation when i is not present.
Let fi = (the product of the other agents in z) / (the max-product of the other agents when i is not present).
Give to agent i a fraction fi of each resource he gets in z.
Properties
PAM has the following properties.
It is a truthful mechanism - each agent's utility is maximized by revealing his/her true valuations.
For each agent i, the utility of i is at least 1/e ≈ 0.368 of his/her utility in the max-product allocation.
When the agents have additive linear valuations, the allocation is envy-free.
PA vs VCG
The PA mechanism, which does not use payments, is analogous to the VCG mechanism, which uses monetary payments. VCG starts by selecting the max-sum allocation, and then for each agent i it calculates the max-sum allocation when i is not present, and pays i the difference (max-sum wh |
https://en.wikipedia.org/wiki/Okta%2C%20Inc. | Okta, Inc. (formerly Saasure Inc.) is an American identity and access management company based in San Francisco. It provides cloud software that helps companies manage and secure user authentication into applications, and for developers to build identity controls into applications, website web services and devices. It was founded in 2009 and had its initial public offering in 2017, being valued at over $6 billion.
Products and services
Okta sells 10 products, including Single Sign-On, Universal Directory, Advanced Server Access (formerly ScaleFT), API Access Management, Authentication, User Management, B2B Integration, Multi-factor Authentication, Lifecycle Management, and Access Gateway.
Okta sells six services, including a single sign-on service that allows users to log into a variety of systems using one centralized process. For example, the company claims the ability to log into Gmail, Workday, Salesforce and Slack with one login. It also offers API authentication services.
Okta's services are built on top of the Amazon Web Services cloud.
Okta primarily targets enterprise businesses. Claimed customers as of 2020 include Zoominfo, JetBlue, Nordstrom, MGM Resorts International, and the U.S. Department of Justice.
Okta runs an annual “Oktane” user conference, which in 2018 featured former US President Barack Obama as a keynote speaker.
Operations
Okta is headquartered in San Francisco. It also has offices in San Jose, Bellevue, Toronto, Washington D.C., Chicago, Bengaluru, London, Amsterdam, Sydney, Paris, and Stockholm.
History
Okta was co-founded in 2009 by Todd McKinnon and Frederic Kerrest, who previously worked together at Salesforce.
In 2015, the company raised US$75 million in venture capital from Andreessen Horowitz, Greylock Partners, and Sequoia Capital, at a total initial valuation of US$1.2 billion.
In 2017, Okta's initial public offering priced at $17.00 per share, trading up on its first day, to raise an additional US$187 million. At |
https://en.wikipedia.org/wiki/Bar%20ditch | A bar or borrow ditch is a roadside channel dug for drainage purposes. Typically, the dirt is "borrowed" from the ditch, and used to crown the road. It is a variation of a bar or borrow pit, in construction, when dirt is removed and used for construction purposes, and later left to fill with water, forming ponds or lakes. Also, adjacent to pasturage, the ditch confines livestock, keeping them from straying onto road. The term is most often used in the Southwestern United States.
Notes
Drainage |
https://en.wikipedia.org/wiki/Comparison%20of%20business%20integration%20software | This article is a comparison of notable business integration and business process automation software.
General
Scope
Scope of this comparison:
Service-oriented architecture implementations;
Message-oriented middleware and message brokers;
Enterprise service bus implementations;
BPEL implementations;
Enterprise application integration software.
General information
Compatibility and interoperability
Operating system support
Hardware support
Supported hardware depends on supported operating systems.
Database support
Web servers support
See also
List of application servers
List of BPEL engines
List of BPMN 2.0 engines
Notes
Footnotes |
https://en.wikipedia.org/wiki/7th%20meridian%20west | The meridian 7° west of Greenwich is a line of longitude that extends from the North Pole across the Arctic Ocean, the Atlantic Ocean, Europe, Africa, the Southern Ocean, and Antarctica to the South Pole.
The 7th meridian west forms a great circle with the 173rd meridian east.
From Pole to Pole
Starting at the North Pole and heading south to the South Pole, the 7th meridian west passes through:
{| class="wikitable plainrowheaders"
! scope="col" width="125" | Co-ordinates
! scope="col" | Country, territory or sea
! scope="col" | Notes
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Arctic Ocean
| style="background:#b0e0e6;" |
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" |
|-
|
! scope="row" |
| Islands of Eysturoy, Streymoy and Koltur
|-valign="top"
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" | Passing just west of the island of Sandoy, (at ) Passing just west of the island of Suðuroy, (at )
|-valign="top"
|
! scope="row" |
| Scotland - Islands of Lewis, Taransay and Harris
|-valign="top"
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" | Little Minch Sea of the Hebrides — from about passing just west of the island of Tiree, Scotland, (at ) and into an unnamed part of the ocean — from
|-
|
! scope="row" |
| Inishowen peninsula
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Lough Foyle
| style="background:#b0e0e6;" |
|-
|
! scope="row" |
| Northern Ireland
|-
|
! scope="row" |
|
|-valign="top"
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Atlantic Ocean
| style="background:#b0e0e6;" | Celtic Sea an unnamed part of the ocean — from Bay of Biscay — from
|-
|
! scope="row" |
|
|-
|
! scope="row" |
|
|-
|
! scope="row" |
| Fo |
https://en.wikipedia.org/wiki/L%C3%B6fgren%20syndrome | Löfgren syndrome is a type of acute sarcoidosis, an inflammatory disorder characterized by swollen lymph nodes in the chest, tender red nodules on the shins, fever and arthritis. It is more common in women than men, and is more frequent in those of Scandinavian, Irish, African and Puerto Rican heritage. It was described in 1953 by Sven Halvar Löfgren, a Swedish clinician. Some have considered the condition to be imprecisely defined.
Signs and symptoms
It is characterized by enlargement of the lymph nodes near the inner border of the lungs (called "hilar lymphadenopathy") as seen on x-ray, and tender red nodules (erythema nodosum) are classically present on the shins, predominantly in women. It may also be accompanied by arthritis (more prominent in men) and fever. The arthritis is often acute and involves the lower extremities, particularly the ankles.
Löfgren syndrome consists of the triad of erythema nodosum, bilateral hilar lymphadenopathy on chest radiograph, and joint pain.
Genetics
Recent studies have demonstrated that the HLA-DRB1*03 is strongly associated with Löfgren syndrome.
Diagnosis
The triad of erythema nodosum, acute arthritis, and bilateral hilar lymphadenopathy is highly specific (>95%) for the diagnosis of Löfgren syndrome. When the triad is present, further testing with additional imaging and laboratory testing is unnecessary.
Treatment
NSAIDs (nonsteroidal anti-inflammatory drugs) are the usual recommended treatment for Löfgren syndrome. Colchicine or low-dose prednisone may also be used.
Prognosis
Löfgren syndrome is associated with a good prognosis, with > 90% of patients experiencing disease resolution within 2 years. In contrast, patients with the disfiguring skin condition lupus pernio or cardiac or neurologic involvement rarely experience disease remission.
See also
List of cutaneous conditions
Sarcoidosis |
https://en.wikipedia.org/wiki/Chalciporus%20piperatoides | Chalciporus (formerly Boletus) piperatoides is a small pored mushroom of the family Boletaceae found in woodland in North America. It closely resembles Chalciporus piperatus but can be distinguished by its flesh and pores staining blue after cutting or bruising. It has a less peppery taste.
See also
List of North American boletes |
https://en.wikipedia.org/wiki/Chromosome%2021%20open%20reading%20frame%2091 | Chromosome 21 open reading frame 91 is a protein that in humans is encoded by the C21orf91 gene.
EURL is a structural protein gene that is encoded within the human chromosome 21. It stands for gene Expressed in Undifferentiated Retina and Lens and was first found in chick embryos. It is also known as C21orf 91 (Chromosome 21 open reading frame 91). This gene produces many molecules; among them is a protein that influences neural development. This protein-coding region helps to code for neural development in humans and is strongly associated with neural progenitor cells as well as neurons associated with the cerebral cortex of the brain.
Thus, being on chromosome 21, defects linked to this gene are heavily correlated to Down Syndrome. There are some knockout models regarding other genes involved in Down Syndrome, but there seems to be primary interest in a knockdown model for this specific gene. It is believed that because there is three codes of this gene rather than two, that the higher concentration of this molecule has the implications leading to Down Syndrome. Scientists are currently working on a hypothesis that the dosage of the EURL protein is directly correlated to neural development in the embryo and how an altered dosage leads to the neural deficits seen in Down Syndrome. |
https://en.wikipedia.org/wiki/Vladimir%20Kanovei | Vladimir G. Kanovei (born 1951) is a Russian mathematician working at the Institute for Information Transmission Problems in Moscow, Russia. His interests include mathematical logic and foundations, as well as mathematical history.
Selected publications
.
Kanovei, Vladimir; Reeken, Michael; Nonstandard analysis, axiomatically. Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2004. xvi+408 pp.
Kanovei, Vladimir; Borel equivalence relations. Structure and classification. University Lecture Series, 44. American Mathematical Society, Providence, RI, 2008. x+240 pp.
Kanoveĭ, V.; Reeken, M.; On Ulam's problem concerning the stability of approximate homomorphisms. (Russian) Tr. Mat. Inst. Steklova 231 (2000), Din. Sist., Avtom. i Beskon. Gruppy, 249–283; translation in Proc. Steklov Inst. Math. 2000, no. 4 (231), 238–270
Kanoveĭ, V. G.; Lyubetskiĭ, V. A.; On some classical problems in descriptive set theory. (Russian) Uspekhi Mat. Nauk 58 (2003), no. 5(353), 3--88; translation in Russian Math. Surveys 58 (2003), no. 5, 839–927
Kanoveĭ, V. G.; Reeken, M.; Some new results on the Borel irreducibility of equivalence relations. (Russian) Izv. Ross. Akad. Nauk Ser. Mat. 67 (2003), no. 1, 59–82; translation in Izv. Math. 67 (2003), no. 1, 55–76 03E15 (54H05)
Kanovei, Vladimir; Reeken, Michael; Mathematics in a nonstandard world. II. Math. Japon. 45 (1997), no. 3, 555–571.
Kanovei, Vladimir; On non-wellfounded iterations of the perfect set forcing. Journal of Symbolic Logic 64 (1999), no. 2, 551–574.
Kanovei, Vladimir; Shelah, Saharon; A definable nonstandard model of the reals. Journal of Symbolic Logic 69 (2004), no. 1, 159–164.
Kanovei, Vladimir; Reeken, Michael. Internal approach to external sets and universes. I. Bounded set theory. Studia Logica 55 (1995), no. 2, 229–257.
Kanovei, Vladimir; Reeken, Michael. Internal approach to external sets and universes. II. External universes over the universe of bounded set theory. Studia Logica 55 (1995), no. 3, |
https://en.wikipedia.org/wiki/Dulong%E2%80%93Petit%20law | The Dulong–Petit law, a thermodynamic law proposed by French physicists Pierre Louis Dulong and Alexis Thérèse Petit, states that the classical expression for the molar specific heat capacity of certain chemical elements is constant for temperatures far from the absolute zero.
In modern terms, Dulong and Petit found that the heat capacity of a mole of many solid elements is about 3R, where R is the universal gas constant. The modern theory of the heat capacity of solids states that it is due to lattice vibrations in the solid.
History
Experimentally Pierre Louis Dulong and Alexis Thérèse Petit had found in 1819 that the heat capacity per weight (the mass-specific heat capacity) for 13 measured elements was close to a constant value, after it had been multiplied by a number representing the presumed relative atomic weight of the element. These atomic weights had shortly before been suggested by John Dalton and modified by Jacob Berzelius.
Dulong and Petit were unaware of the relationship with R, since this constant had not yet been defined from the later kinetic theory of gases. The value of 3R is about 25 joules per kelvin, and Dulong and Petit essentially found that this was the heat capacity of certain solid elements per mole of atoms they contained.
The Kopp's law developed in 1865 by Hermann Franz Moritz Kopp extended the Dulong–Petit law to chemical compounds from further experimental data.
Amedeo Avogadro remarked in 1833 that the law did not fit the experimental data of carbon samples. In 1876, Heinrich Friedrich Weber, noticed that the specific heat of diamond was sensible to temperature.
In 1877, Ludwig Boltzmann showed that the constant value of Dulong–Petit law could be explained in terms of independent classical harmonic oscillators. With the advent of quantum mechanics, this assumption was refined by Weber's student, Albert Einstein in 1907, employing quantum harmonic oscillators to explain the experimentally observed decrease of the heat capa |
https://en.wikipedia.org/wiki/Central%20Indo-Pacific | The Central Indo-Pacific is a biogeographic region of Earth's seas, comprising the tropical waters of the western Pacific Ocean, the eastern Indian Ocean, and the connecting seas.
The Central Indo-Pacific is a part of the larger Indo-Pacific, which includes the tropical Indian Ocean, the western and central tropical Pacific Ocean, and the seas connecting the two in the general area of Indonesia. The Central Indo-Pacific may be classified as a marine realm, one of the great biogeographic divisions of the world's ocean basins, or as a subrealm of the Indo-Pacific.
The Central Indo-Pacific realm covers eastern shores of the tropical Indian Ocean, including most of the Indian Ocean coast of the Indonesian archipelago, the northern Australian coast, and the Cocos and Christmas islands. It extends through the tropical seas connecting the Pacific and Indian oceans, including the Java Sea in central Indonesia, the South China Sea between the Asian mainland and the Philippine and Malay archipelagos, and the Arafura Sea separating Australia and New Guinea. It includes the seas surrounding island groups of the western Pacific, including the Ryukyu Islands, Caroline Islands, Marianas Islands, New Guinea and the Bismarck Archipelago, Solomon Islands, Vanuatu, New Caledonia, Fiji, Tonga, and Lord Howe Island.
It is bounded on the west by the Western Indo-Pacific, with the transition at the Strait of Malacca and in southern Sumatra. The Central Indo-Pacific includes the seas surrounding the northern half of Australia, while the Temperate Australasia marine realm includes the seas surrounding the southern half of Australia. The boundaries between those two marine realms lie in Western Australia and southern Queensland. The Eastern Indo-Pacific lies to the east, extending across most of tropical Polynesia. To the north, the Taiwan Strait forms the boundary with the Temperate Northern Pacific, which also includes the larger Japanese islands.
The Central Indo-Pacific includes the |
https://en.wikipedia.org/wiki/Ruben%20A.%20Stirton | Ruben Arthur Stirton (1901-1966), known to his friends as "Stirt", was an American paleontologist, specializing in mammals, who was active in South America, the United States and Australia. Stirton was closely associated with the University of California Museum of Paleontology, receiving an appointment as curator in 1930 and as its fourth director from 1949 to 1966. His career also saw engaged as a lecturer, associate professorship and then as a professor in 1951, from which time he was director of the University's Department of Paleontology.
Stirton was born in Kansas on 20 August 1901, and graduated from the state's university in the field of zoology. He served as the mammalogist on expeditions led by Donald R. Dickey to El Salvador in the 1920s. His expeditions included a return to El Salvador in the 1940s, as well as another collecting fossils in Colombia. In 1953, he directed his studies to the marsupials of Australia, with the intent of discovering primitive species of marsupials.
His publications mainly dealt with fossilized mammals from the Great Plains, particularly beavers and horses. Other contributions he made included careful and systematic descriptions of fossil specimens including an accurate determination of their geological origin, the use of animal groups to perform stratigraphic correlation, and various studies on evolutionary changes in several families of mammals. Stirton was the leading author of papers that described new taxa, including the Vombatiformes genera Rhizophascolonus and Litokoala, which were published posthumously in 1967.
He died on June 14, 1966, of a heart attack, while attending a meeting of the American Society of Mammalogists in southern California. Stirton's students recall him as a popular lively lecturer, noting his rendition of the call of the Australian dingo as an example of his enthusiasm. In 1979, fellow paleontologist Patricia Vickers-Rich named the prehistoric species Dromornis stirtoni (colloquially known as Sti |
https://en.wikipedia.org/wiki/All-in-Wonder | The All-in-Wonder (also abbreviated to AIW) was a combination graphics card/TV tuner card designed by ATI Technologies. It was introduced on November 11, 1996. ATI had previously used the Wonder trademark on other graphics cards (ATI Wonder series), however, they were not full TV/graphics combo cards (EGA Wonder, VGA Wonder, Graphics Wonder). ATI also made other TV oriented cards that use the word Wonder (TV Wonder, HDTV Wonder, DV Wonder), and remote control (Remote Wonder). The All-in-Wonder line debuted with the Rage chipset series. The cards were available in two forms, built by third-party manufacturers (marked as "Powered by ATI") as well as by ATI itself ("Built by ATI").
Each of the All-in-Wonder Radeon cards is based on a Radeon chipset with extra features incorporated onto the board. AIW cards run at lower clock speeds (two exceptions are the AIW 9600XT/AIW X800XT faster/same speed) than their conventional counterparts to reduce heat and power consumption. In June 2008, AMD revived the product line with an HD model.
Accessories
The cards use a variety of specialised ports along the side to provide output to televisions, with the retail version equipped with composite ports and the ability to output to component. Later products also comes with a Remote Wonder remote control and a USB RF receiver to receive radio frequency signals from the remote. Some variants of the All-in-Wonder included FM radio tuning as well. Some analog tuners were bundled with Gemstar's Guide Plus+ electronic program guide for TV listings, while digital tuners used TitanTV instead.
Drivers
The AIW card drivers are based on ATI's Catalyst drivers with additional T200 unified stream drivers. Currently, the only operating systems fully supporting TV capture with these cards are Microsoft Windows XP, 2000, 98, and 95. Display drivers work on Linux, and TV capture is supported on some cards with the GATOS project.
Lineup
See also
ATI Wonder series
Comparison of ATI Graphics Proce |
https://en.wikipedia.org/wiki/Cybernetical%20physics | Cybernetical physics is a scientific area on the border of cybernetics and physics which studies physical systems with cybernetical methods. Cybernetical methods are understood as methods developed within control theory, information theory, systems theory and related areas: control design, estimation, identification, optimization, pattern recognition, signal processing, image processing, etc. Physical systems are also understood in a broad sense; they may be either lifeless, living nature or of artificial (engineering) origin, and must have reasonably understood dynamics and models suitable for posing cybernetical problems. Research objectives in cybernetical physics are frequently formulated as analyses of a class of possible system state changes under external (controlling) actions of a certain class. An auxiliary goal is designing the controlling actions required to achieve a prespecified property change. Among typical control action classes are functions which are constant in time (bifurcation analysis, optimization), functions which depend only on time (vibration mechanics, spectroscopic studies, program control), and functions whose value depends on measurement made at the same time or on previous instances. The last class is of special interest since these functions correspond to system analysis by means of external feedback (feedback control).
Roots of cybernetical physics
Until recently no creative interaction of physics and control theory (cybernetics) had been seen and no control theory methods were directly used for discovering new physical effects and phenomena. The situation dramatically changed in the 1990s when two new areas emerged: control of chaos and quantum control.
Control of chaos
In 1990 a paper was published in Physical Review Letters by Edward Ott, Celso Grebogi and James Yorke from the University of Maryland reporting that even small feedback action can dramatically change the behavior of a nonlinear system, e.g., turn chaotic motio |
https://en.wikipedia.org/wiki/Experimental%20Gerontology | Experimental Gerontology is a monthly peer-reviewed medical journal covering biogerontology. It was established in 1964 and is published by Elsevier. The editor-in-chief is Christiaan Leeuwenburgh (University of Florida College of Medicine). According to the Journal Citation Reports, the journal has a 2019 impact factor of 3.376. |
https://en.wikipedia.org/wiki/Ecoinformatics | Ecoinformatics, or ecological informatics, is the science of information in ecology and environmental science. It integrates environmental and information sciences to define entities and natural processes with language common to both humans and computers. However, this is a rapidly developing area in ecology and there are alternative perspectives on what constitutes ecoinformatics.
A few definitions have been circulating, mostly centered on the creation of tools to access and analyze natural system data. However, the scope and aims of ecoinformatics are certainly broader than the development of metadata standards to be used in documenting datasets. Ecoinformatics aims to facilitate environmental research and management by developing ways to access, integrate databases of environmental information, and develop new algorithms enabling different environmental datasets to be combined to test ecological hypotheses. Ecoinformatics is related to the concept of ecosystem services.
Ecoinformatics characterize the semantics of natural system knowledge. For this reason, much of today's ecoinformatics research relates to the branch of computer science known as knowledge representation, and active ecoinformatics projects are developing links to activities such as the Semantic Web.
Current initiatives to effectively manage, share, and reuse ecological data are indicative of the increasing importance of fields like ecoinformatics to develop the foundations for effectively managing ecological information. Examples of these initiatives are National Science Foundation Datanet projects, DataONE, Data Conservancy, and Artificial Intelligence for Environment & Sustainability. |
https://en.wikipedia.org/wiki/Doublecortin%20like%20kinase%203 | Doublecortin like kinase 3 is a protein that in humans is encoded by the DCLK3 gene. |
https://en.wikipedia.org/wiki/Systems%20development%20life%20cycle | In systems engineering, information systems and software engineering, the systems development life cycle (SDLC), also referred to as the application development life cycle, is a process for planning, creating, testing, and deploying an information system. The SDLC concept applies to a range of hardware and software configurations, as a system can be composed of hardware only, software only, or a combination of both. There are usually six stages in this cycle: requirement analysis, design, development and testing, implementation, documentation, and evaluation.
Overview
A systems development life cycle is composed of distinct work phases that are used by systems engineers and systems developers to deliver information systems. Like anything that is manufactured on an assembly line, an SDLC aims to produce high-quality systems that meet or exceed expectations, based on requirements, by delivering systems within scheduled time frames and cost estimates. Computer systems are complex and often link components with varying origins. Various SDLC methodologies have been created, such as waterfall, spiral, agile, rapid prototyping, incremental, and synchronize and stabilize.
SDLC methodologies fit within a flexibility spectrum ranging from agile to iterative to sequential. Agile methodologies, such as XP and Scrum, focus on lightweight processes that allow for rapid changes. Iterative methodologies, such as Rational Unified Process and dynamic systems development method, focus on stabilizing project scope and iteratively expanding or improving products. Sequential or big-design-up-front (BDUF) models, such as waterfall, focus on complete and correct planning to guide larger projects and limit risks to successful and predictable results. Anamorphic development is guided by project scope and adaptive iterations.
In project management a project can include both a project life cycle (PLC) and an SDLC, during which somewhat different activities occur. According to Taylor (2004 |
https://en.wikipedia.org/wiki/Cyclopropane | Cyclopropane is the cycloalkane with the molecular formula (CH2)3, consisting of three methylene groups (CH2) linked to each other to form a ring. The small size of the ring creates substantial ring strain in the structure. Cyclopropane itself is mainly of theoretical interest but many of its derivatives - cyclopropanes - are of commercial or biological significance.
Cyclopropane was used as a clinical anesthetic from the 1930s through the 1980s.
History
Cyclopropane was discovered in 1881 by August Freund, who also proposed the correct structure for the substance in his first paper. Freund treated 1,3-dibromopropane with sodium, causing an intramolecular Wurtz reaction leading directly to cyclopropane. The yield of the reaction was improved by Gustavson in 1887 with the use of zinc instead of sodium. Cyclopropane had no commercial application until Henderson and Lucas discovered its anaesthetic properties in 1929; industrial production had begun by 1936. In modern anaesthetic practice, it has been superseded by other agents.
Anaesthesia
Cyclopropane was introduced into clinical use by the American anaesthetist Ralph Waters who used a closed system with carbon dioxide absorption to conserve this then-costly agent.
Cyclopropane is a relatively potent, non-irritating and sweet smelling agent with a minimum alveolar concentration of 17.5% and a blood/gas partition coefficient of 0.55. This meant induction of anaesthesia by inhalation of cyclopropane and oxygen was rapid and not unpleasant. However at the conclusion of prolonged anaesthesia patients could suffer a sudden decrease in blood pressure, potentially leading to cardiac dysrhythmia: a reaction known as "cyclopropane shock". For this reason, as well as its high cost and its explosive nature, it was latterly used only for the induction of anaesthesia, and has not been available for clinical use since the mid-1980s.
Cylinders and flow meters were coloured orange.
Pharmacology
Cyclopropane is inactive at the G |
https://en.wikipedia.org/wiki/SEAC%20%28computer%29 | SEAC (Standards Eastern Automatic Computer or Standards Electronic Automatic Computer) was a first-generation electronic computer, built in 1950 by the U.S. National Bureau of Standards (NBS) and was initially called the National Bureau of Standards Interim Computer, because it was a small-scale computer designed to be built quickly and put into operation while the NBS waited for more powerful computers to be completed (the DYSEAC). The team that developed SEAC was organized by Samuel N. Alexander. SEAC was demonstrated in April 1950 and was dedicated in June 1950; it is claimed to be the first fully operational stored-program electronic computer in the US.
Description
Based on EDVAC, SEAC used only 747 vacuum tubes (a small number for the time) eventually expanded to 1,500 tubes. It had 10,500 germanium diodes which performed all of the logic functions (see the article diode–transistor logic for the working principles of diode logic), later expanded to 16,000 diodes. It was the first computer to do most of its logic with solid-state devices. The tubes were used for amplification, inversion and storing information in dynamic flip-flops.
The machine used 64 acoustic delay lines to store 512 words of memory, with each word being 45 bits in size. The clock rate was kept low (1 MHz).
The computer's instruction set consisted of only 11 types of instructions: fixed-point addition, subtraction, multiplication, and division; comparison, and input & output. It eventually expanded to 16 instructions.
The addition time was 864 microseconds and the multiplication time was 2,980 microseconds (i.e. close to 3 milliseconds).
Weight: (central machine).
Applications
On some occasions SEAC was used by a remote teletype. This makes it one of the first computers to be used remotely. With many modifications, it was used until 1964. Some of the problems run on it dealt with:
digital imaging, led by Russell A. Kirsch
computer animation of the city traffic simulation
meteorol |
https://en.wikipedia.org/wiki/Modelur | Modelur is a 3D parametric urban design software, implemented as a SketchUp plugin.
In contrast to common CAD applications, where the user designs buildings with usual dimensions such as width, depth, and height, Modelur offers the design of built environment through key urban parameters such as the number of storeys and gross floor area of a building. In addition, urban control values (i.e. Floor Space Index, Built-up Area, etc. ) and requirements (i.e. number of parking lots or green areas) based on land use normatives are calculated in real-time.
Sources
Trimble SketchUp
Modelur on SketchUp Extension Warehouse
Modelur on YouTube
External links
Modelur Homepage
Modelur Userguide
SketchUp Extension Warehouse
Urban design
Urban planning
Computer-aided design software
Computer-aided design
3D computer graphics |
https://en.wikipedia.org/wiki/Woody%20plant | A woody plant is a plant that produces wood as its structural tissue and thus has a hard stem. In cold climates, woody plants further survive winter or dry season above ground, as opposed to herbaceous plants that die back to the ground until spring.
Characteristics
Woody plants are usually trees, shrubs, or lianas. These are usually perennial plants whose stems and larger roots are reinforced with wood produced from secondary xylem. The main stem, larger branches, and roots of these plants are usually covered by a layer of bark. Wood is a structural tissue that allows woody plants to grow from above ground stems year after year, thus making some woody plants the largest and tallest terrestrial plants.
Woody plants, like herbaceous perennials, typically have a dormant period of the year when growth does not take place, in colder climates due to freezing temperatures and lack of daylight during the winter months, in subtropical and tropical climates due to the dry season when precipitation becomes minimal. The dormant period will be accompanied by shedding of leaves if the plant is deciduous. Evergreen plants do not lose all their leaves at once (they instead shed them gradually over the growing season), however growth virtually halts during the dormant season. Many woody plants native to subtropical regions and nearly all native to the tropics are evergreen due to year-round warm temperatures.
During the fall months, each stem in a deciduous plant cuts off the flow of nutrients and water to the leaves. This causes them to change colors as the chlorophyll in the leaves breaks down. Special cells are formed that sever the connection between the leaf and stem, so that it will easily detach. Evergreen plants do not shed their leaves and merely go into a state of low activity during the dormant season. During spring, the roots begin sending nutrients back up to the canopy.
When the growing season resumes, either with warm weather or the wet season, the plant will |
https://en.wikipedia.org/wiki/Risorius | The risorius muscle is a highly variable muscle of facial expression. It has numerous and very variable origins, and inserts into the angle of the mouth. It receives motor innervation from branches of facial nerve (CN VII). It may be absent or asymmetrical in some people. It pulls the angle of the mouth sidewise, such as during smiling.
Structure
The risorius muscle is highly variable.
Attachments
Its peripheral attachments may include (some or all of): the parotid fascia, masseteric fascia, the fascia enveloping the pars modiolaris of the platysma muscle, fascia overlying the mastoid part of temporal bone, and/or the zygomatic arch.
Its apical and subapical (i.e. convergent) attachment is at the modiolus.
Innervation
The risorius receives motor innervation from the buccal branch of the facial nerve (CN VII).
Vasculature
The risorius receives arterial supply mostly from the superior labial artery.
Variation
The risorius muscle is highly variable. It ranges in form from one or more slender bundles to a wide (yet thin) fan. It may be absent in a significant minority of people, and may be asymmetrical.
Relations
It is superficial to the masseter muscle, partially overlying it.
Function
The risorius muscle draws the angle of the mouth lateral-ward. It participates in producing facial expressions like a smile, grin, or laugh.
Clinical significance
Because it partially overlies the masseter muscle, it may be unintentionally affected during botox injections, resulting in unnatural facial expressions.
Other animals
It has been suggested that the risorius muscle is only found in Homininae (African great apes and humans).
Additional images |
https://en.wikipedia.org/wiki/142857 | The number 142,857 is a Kaprekar number.
142857, the six repeating digits of (0.), is the best-known cyclic number in base 10. If it is multiplied by 2, 3, 4, 5, or 6, the answer will be a cyclic permutation of itself, and will correspond to the repeating digits of , , , , or respectively.
Calculation
1 × 142,857 = 142,857
2 × 142,857 = 285,714
3 × 142,857 = 428,571
4 × 142,857 = 571,428
5 × 142,857 = 714,285
6 × 142,857 = 857,142
7 × 142,857 = 999,999
If multiplying by an integer greater than 7, there is a simple process to get to a cyclic permutation of 142857. By adding the rightmost six digits (ones through hundred thousands) to the remaining digits and repeating this process until only six digits are left, it will result in a cyclic permutation of 142857:
142857 × 8 = 1142856
1 + 142856 = 142857
142857 × 815 = 116428455
116 + 428455 = 428571
1428572 = 142857 × 142857 = 20408122449
20408 + 122449 = 142857
Multiplying by a multiple of 7 will result in 999999 through this process:
142857 × 74 = 342999657
342 + 999657 = 999999
If you square the last three digits and subtract the square of the first three digits, you also get back a cyclic permutation of the number.
8572 = 734449
1422 = 20164
734449 − 20164 = 714285
It is the repeating part in the decimal expansion of the rational number = 0.. Thus, multiples of are simply repeated copies of the corresponding multiples of 142857:
Connection to the enneagram
The 142857 number sequence is used in the enneagram figure, a symbol of the Gurdjieff Work used to explain and visualize the dynamics of the interaction between the two great laws of the Universe (according to G. I. Gurdjieff), the Law of Three and the Law of Seven. The movement of the numbers of 142857 divided by , . etc., and the subsequent movement of the enneagram, are portrayed in Gurdjieff's sacred dances known as the movements.
Other properties
The 142857 number sequence is also found in several decimals in which the d |
https://en.wikipedia.org/wiki/Legendre%27s%20three-square%20theorem | In mathematics, Legendre's three-square theorem states that a natural number can be represented as the sum of three squares of integers
if and only if is not of the form for nonnegative integers and .
The first numbers that cannot be expressed as the sum of three squares (i.e. numbers that can be expressed as ) are
7, 15, 23, 28, 31, 39, 47, 55, 60, 63, 71 ... .
History
Pierre de Fermat gave a criterion for numbers of the form 8a + 1 and 8a + 3 to be sums of a square plus twice another square, but did not provide a proof. N. Beguelin noticed in 1774 that every positive integer which is neither of the form 8n + 7, nor of the form 4n, is the sum of three squares, but did not provide a satisfactory proof. In 1796 Gauss proved his Eureka theorem that every positive integer n is the sum of 3 triangular numbers; this is equivalent to the fact that 8n + 3 is a sum of three squares. In 1797 or 1798 A.-M. Legendre obtained the first proof of his 3 square theorem. In 1813, A. L. Cauchy noted that Legendre's theorem is equivalent to the statement in the introduction above. Previously, in 1801, C. F. Gauss had obtained a more general result, containing Legendre's theorem of 1797–8 as a corollary. In particular, Gauss counted the number of solutions of the expression of an integer as a sum of three squares, and this is a generalisation of yet another result of Legendre, whose proof is incomplete. This last fact appears to be the reason for later incorrect claims according to which Legendre's proof of the three-square theorem was defective and had to be completed by Gauss.
With Lagrange's four-square theorem and the two-square theorem of Girard, Fermat and Euler, the Waring's problem for k = 2 is entirely solved.
Proofs
The "only if" of the theorem is simply because modulo 8, every square is congruent to 0, 1 or 4. There are several proofs of the converse (besides Legendre's proof). One of them is due to J. P. G. L. Dirichlet in 1850, and has become classical. It |
https://en.wikipedia.org/wiki/John%20G.%20Azzopardi | John G. Azzopardi (2 January, 1929, Malta 2 January, 2013, London) was a prominent pathologist, recognized for his contributions to diagnostic surgical pathology, particularly in breast pathology. His name is also eponymously connected with his elucidation of the Azzopardi phenomenon.
He started his medical training at the Royal University of Malta in 1942 “at the tender age of 13”. After he qualified as MD in 1949, he moved to England. His entire career, with the exception of sabbaticals at the Armed Forces Institute of Pathology, Washington DC (19601961) and two months at the University of Bologna in 1972, was in pathology at the Royal Postgraduate Medical School, Hammersmith Hospital, London, where he held a series of positions, including Professor of Oncology.
In 2006, an international symposium was held in his honor, where he was presented with a lifetime achievement award by the International Society of Breast Pathology. |
https://en.wikipedia.org/wiki/Combinatorics%20and%20physics | Combinatorial physics or physical combinatorics is the area of interaction between physics and combinatorics.
Overview
"Combinatorial Physics is an emerging area which unites combinatorial and discrete mathematical techniques applied to theoretical physics, especially Quantum Theory."
"Physical combinatorics might be defined naively as combinatorics guided by ideas or insights from physics"
Combinatorics has always played an important role in quantum field theory and statistical physics. However, combinatorial physics only emerged as a specific field after a seminal work by Alain Connes and Dirk Kreimer, showing that the renormalization of Feynman diagrams can be described by a Hopf algebra.
Combinatorial physics can be characterized by the use of algebraic concepts to interpret and solve physical problems involving combinatorics. It gives rise to a particularly harmonious collaboration between mathematicians and physicists.
Among the significant physical results of combinatorial physics, we may mention the reinterpretation of renormalization as a Riemann–Hilbert problem, the fact that the Slavnov–Taylor identities of gauge theories generate a Hopf ideal, the quantization of fields and strings, and a completely algebraic description of the combinatorics of quantum field theory. An important example of applying combinatorics to physics is the enumeration of alternating sign matrix in the solution of ice-type models. The corresponding ice-type model is the six vertex model with domain wall boundary conditions.
See also
Mathematical physics
Statistical physics
Ising model
Percolation theory
Tutte polynomial
Partition function
Hopf algebra
Combinatorics and dynamical systems
Quantum mechanics |
https://en.wikipedia.org/wiki/Non-maskable%20interrupt | In computing, a non-maskable interrupt (NMI) is a hardware interrupt that standard interrupt-masking techniques in the system cannot ignore. It typically occurs to signal attention for non-recoverable hardware errors. Some NMIs may be masked, but only by using proprietary methods specific to the particular NMI.
An NMI is often used when response time is critical or when an interrupt should never be disabled during normal system operation. Such uses include reporting non-recoverable hardware errors, system debugging and profiling, and handling of special cases like system resets.
Modern computer architectures typically use NMIs to handle non-recoverable errors which need immediate attention. Therefore, such interrupts should not be masked in the normal operation of the system. These errors include non-recoverable internal system chipset errors, corruption in system memory such as parity and ECC errors, and data corruption detected on system and peripheral buses.
On some systems, a computer user can trigger an NMI through hardware and software debugging interfaces and system reset buttons.
Programmers typically use debugging NMIs to diagnose and fix faulty code. In such cases, an NMI can execute an interrupt handler that transfers control to a special monitor program. From this program, a developer can inspect the machine's memory and examine the internal state of the program at the instant of its interruption. This also allows the debugging or diagnosing of computers which appear hung.
History
In older architectures, NMIs were used for interrupts which were typically never disabled because of the required response time. They were hidden signals. Examples include the floppy disk controller on the Amstrad PCW, the 8087 coprocessor on the x86 when used in the IBM PC or its compatibles (even though Intel recommended connecting it to a normal interrupt), and the Low Battery signal on the HP 95LX.
In the original IBM PC, an NMI was triggered if a parity error was de |
https://en.wikipedia.org/wiki/Pharyngeal%20slit | Pharyngeal slits are filter-feeding organs found among deuterostomes. Pharyngeal slits are repeated openings that appear along the pharynx caudal to the mouth. With this position, they allow for the movement of water in the mouth and out the pharyngeal slits. It is postulated that this is how pharyngeal slits first assisted in filter-feeding, and later, with the addition of gills along their walls, aided in respiration of aquatic chordates. These repeated segments are controlled by similar developmental mechanisms. Some hemichordate species can have as many as 200 gill slits. Pharyngeal clefts resembling gill slits are transiently present during the embryonic stages of tetrapod development. The presence of pharyngeal arches and clefts in the neck of the developing human embryo famously led Ernst Haeckel to postulate that "ontogeny recapitulates phylogeny"; this hypothesis, while false, contains elements of truth, as explored by Stephen Jay Gould in Ontogeny and Phylogeny. However, it is now accepted that it is the vertebrate pharyngeal pouches and not the neck slits that are homologous to the pharyngeal slits of invertebrate chordates. Pharyngeal arches, pouches, and clefts are, at some stage of life, found in all chordates. One theory of their origin is the fusion of nephridia which opened both on the outside and the gut, creating openings between the gut and the environment.
Pharyngeal arches in Vertebrates
In vertebrates, the pharyngeal arches are derived from all three germ layers. Neural crest cells enter these arches where they contribute to craniofacial features such as bone and cartilage. However, the existence of pharyngeal structures before neural crest cells evolved is indicated by the existence of neural crest-independent mechanisms of pharyngeal arch development. The first, most anterior pharyngeal arch gives rise to the oral jaw. The second arch becomes the hyoid and jaw support. In fish, the other posterior arches contribute to the brachial ske |
https://en.wikipedia.org/wiki/Cooperative%20luminescence%20and%20cooperative%20absorption | Cooperative luminescence is the radiative process in which two excited ions simultaneously make downward transition to emit one photon with the sum of their excitation energies. The inverse process is cooperative absorption, in which a photon can be absorbed by a coupled pair of two ions, making them excited simultaneously. |
https://en.wikipedia.org/wiki/AKTIP%20%28therapeutic%20institute%29 | AKTIP – Konzultační a terapeutický institut Praha (The Consultation and Therapeutic Institute Prague) was a private institute run by the public business company Progressive consulting, offering services in the field of psychosomatic care. The head of the institute is psychiatrist Jarmila Klímová.
Controversy about the methods of the institute emerges when the documentary Infiltrace: Obchod se zdravím (Infiltration: Health Business) was broadcast by Czech television on May 21, 2018.
The documentary revealed that the company uses unethical techniques to the detriment of its patients for its financial gain, including pseudoscience, manipulation, and incitement of fear of cancer and anxiety. AKTIP offers examinations and healing by instrumentation and homeopathic preparations of doubtful effectiveness for various somatic diseases, including thyroid disease.
Although it has physicians on staff, this institution is not a legitimate provider of health services. It is not a medical facility.
Erratic Boulder award in the category of teams 2016
AKTIP is the holder of the Silver Erratic Boulder award in the category of teams for 2016.
"An eventual client meets here imaginary care in a wide range of disciplines. His complex problems will be treated by a graphologist, an expert in oriental diagnostics and bioresonance therapy will also supply its part of information. If it fails, a miraculous ANESA device, known as the non-invasive AMP blood analyzer (Golden Erratic Boulder award for 2011), will come to the scene", said Sisyfos.
In the awards report its representatives also cite the statement of the head of AKTIP Jarmila Klímová that the human body is set for 400 years of life. "If we really lived only by biological hours, we could be at rest between 380 and 460 years, because this age is set up for our body ... And why do we live only 60 or 80 years? No, because the most important influence outside of ourselves, which fundamentally affects the length and quality of life, we |
https://en.wikipedia.org/wiki/Digital%20Cleanup%20Day | The Digital Cleanup Day, also known as the "International Day of Digital Cleanup", is an annual event launched in 2019 by Kevin Guerin to raise global awareness about the environmental impact of the digital industry. This initiative encourages people to take concrete action by cleaning up their digital data and/or giving a second life to their unused computer equipment that is lying around in drawers. The Digital Cleanup Day, formerly known as the Cyber World Cleanup Day., was launched in France in 2020. Co-hosted by the French Institute of Sustainable IT (ISIT) and the World Cleanup Day France (WCD), it quickly spread to other countries, including Italy and Switzerland. The first Swiss edition was a great success with the participation of many citizens and the collection of tons of digital data and electronic equipment for recycling.
The main objective of this initiative is to limit the environmental impacts caused by the increasing use of digital technologies. Although digital pollution may be invisible, it is very real. The impact of the digital industry on greenhouse gases exceeds that of civil aviation under normal circumstances. Therefore, it is important for each individual to take concrete measures to reduce their carbon footprint.
Digital technologies have a significant environmental impact, both during their manufacturing, which emits high levels of CO2, and during their use. Their energy consumption, as well as the weight of online activities, also add to their carbon footprint. Being aware of digital usage can therefore help reduce the environmental impacts of this industry. According to the Institute of Sustainable IT (ISIT), the digital economy and usage are responsible for 6% of global greenhouse gas emissions, which is as much as that of civil aviation.
The Cyber World Cleanup Day encourages all actors in the area to delete unnecessary computer files and emails stored on their computers and to give a second life to digital equipment by opting for |
https://en.wikipedia.org/wiki/Haruka%20%28citrus%29 | Haruka (Citrus tamurana × natsudaidai) is a Citrus cultivar grown in Japan and the Korean Peninsula.
Genetics and origin
Haruka was first discovered in Ehime Prefecture, Japan. Once thought to be a natural mutation of the hyuganatsu (Citrus tamurana), it is now inferred that it is a hybrid between the hyuganatsu and natsudaidai (Citrus natsudaidai), with the hyuganatsu being the seed parent and the natsudaidai being the pollen parent.
Description
The fruit is small to medium in size (around the size of an orange) and can be round, oblate, or pyriform in shape. The rind is moderately thick (around the thickness of an orange) and is yellow in color; it is smooth but porous and is fragrant. The flesh is bright yellow in color and is separated into 10–11 segments by thin membranes. It is moderately seedy. There is a circular protrusion on the non-stem end and there is sometimes a nipple at the stem end. The flavor is said to be very sweet but rather mild. Like the hyuganatsu, the spongy, white pith is sweet and edible. It is most commonly eaten raw and is usually eaten with the pith intact. It ripens from late winter to spring and keeps for 1–3 weeks in a refrigerator.
Nutrition
Haruka is rich in vitamin A and C, and contains smaller amounts of vitamin B1 and beta-carotene.
Distribution
It is cultivated in southern Japan, mainly in Ehime and Hiroshima prefectures. It is sold in markets in Japan and is exported to Singapore, Taiwan, and Hong Kong.
Confectionery products
A flavor of the Japanese candy is based on the haruka citrus fruit.
See also
Japanese citrus
List of citrus fruits |
https://en.wikipedia.org/wiki/End-of-life%20care | End-of-life care refers to health care provided in the time leading up to a person's death. End-of-life care can be provided in the hours, days, or months before a person dies and encompasses care and support for a person's mental and emotional needs, physical comfort, spiritual needs, and practical tasks.
EoLC is most commonly provided at home, in the hospital, or in a long-term care facility with care being provided by family members, nurses, social workers, physicians, and other support staff. Facilities may also have palliative or hospice care teams that will provide end-of-life care services. Decisions about end-of-life care are often informed by medical, financial and ethical considerations.
In most advanced countries, medical spending on people in the last twelve months of life makes up roughly 10% of total aggregate medical spending, while those in the last three years of life can cost up to 25%.
Medical
Advanced care planning
Advances in medicine in the last few decades have provided an increasing number of options to extend a person's life and highlighted the importance of ensuring that an individual's preferences and values for end-of-life care are honored. Advanced care planning is the process by which a person of any age is able to provide their preferences and ensure that their future medical treatment aligns with their personal values and life goals. It is typically a continual process, with ongoing discussions about a patient's current prognosis and conditions as well as conversations about medical dilemmas and options. A person will typically have these conversations with their doctor and ultimately record their preferences in an advance healthcare directive. An advance healthcare directive is a legal document that either documents a person's decisions about desired treatment or indicates who a person has entrusted to make their care decisions for them. The two main types of advanced directives are a living will and durable power of attorney f |
https://en.wikipedia.org/wiki/Pr%3AYLF%20laser | A Pr:YLF laser (or Pr3+:LiYF4 laser) is a solid state laser that uses a praseodymium doped yttrium-lithium-fluoride crystal as its gain medium. The first Pr:YLF laser was built in 1977 and emitted pulses at 479 nm. Pr:YLF lasers can emit in many different wavelengths in the visible spectrum of light, making them potentially interesting for RGB applications and materials processing. Notable emission wavelengths are 479 nm, 523 nm, 607 nm and 640 nm.
Technology
Pr:YLF lasers are optically pumped using flashlamps, pulsed dye lasers or diode lasers. The strongest emission line of Pr:YLF is 640 nm, which stems from the transition of the Pr3+- ion. However, by suppressing this line (and other lines stronger than the desired one), other transitions can be used for obtaining different wavelengths. This can be done using dichroic mirrors. Pr:YLF lasers are pumped by using the transitions from to , or (corresponding wavelengths: 444 nm, 469 nm, 479 nm). The Pr3+- ion then undergoes a quick, radiationless transition (fast relaxation), followed by the light-emitting transition. Finally, the ground level () is reached via another radiationless transfer, making the Pr:YLF laser a 4-level system. Pr:YLF supports lasing at the following wavelengths: 479 nm, 523 nm, 546 nm, 607 nm, 640 nm, 698 nm, 721 nm, 907 nm and 915 nm.
The transition is of special interest, since its wavelength (444 nm) can be covered by InGaN laser diodes, which are commercially available at high output powers. Because the absorption peak at 444 nm only has a bandwidth of a few nanometers, pumpdiodes have to be selected and stabilized for efficient laser action. Diode pumped solid state (DPSS) lasers using these diodes have reached multiple watts of output powers in continuous wave operation. Typical DPSS setups using Pr:YLF crystals consist of a hemispheric resonator in which the crystal is pumped longitudinally by the pump diode. Depending on the resonator length, this resonator type can tolerate |
https://en.wikipedia.org/wiki/CAP%20computer | The Cambridge CAP computer was the first successful experimental computer that demonstrated the use of security capabilities, both in hardware and software. It was developed at the University of Cambridge Computer Laboratory in the 1970s. Unlike most research machines of the time, it was also a useful service machine.
The sign currently on the front of the machine reads:
The CAP project on memory protection ran from 1970 to 1977. It was based on capabilities implemented in hardware, under M. Wilkes and R. Needham with D. Wheeler responsible for the implementation. R. Needham was awarded a BCS Technical Award in 1978 for the CAP (Capability Protection) Project.
Design
The CAP was designed such that any access to a memory segment or hardware required that the current process held the necessary capabilities.
The 32-bit processor featured microprogramming control, two 256-entry caches, a 32-entry write buffer and the capability unit itself, which had 64 registers for holding evaluated capabilities. Floating point operations were available using a single 72-bit accumulator. The instruction set featured over 200 instructions, including basic ALU and memory operations, to capability- and process-control instructions.
Instead of the programmer-visible registers used in Chicago and Plessey System 250 designs, the CAP would load internal registers silently when a program defined a capability. The memory was divided into segments of up to 64K 32-bit words. Each segment could contain data or capabilities, but not both. Hardware was accessed via an associated minicomputer.
All procedures constituting the operating system were written in ALGOL 68C, although a number of other closely associated protected procedures - such as a paginator - are written in BCPL.
Operation
The CAP first became operational in 1976. A fully functional computer, it featured a complete operating system, file system, compilers, and so on. The OS used a process tree structure, with an initial process |
https://en.wikipedia.org/wiki/Comparison%20of%20free%20and%20open-source%20software%20licenses | This comparison only covers software licenses which have a linked Wikipedia article for details and which are approved by at least one of the following expert groups: the Free Software Foundation, the Open Source Initiative, the Debian Project and the Fedora Project. For a list of licenses not specifically intended for software, see List of free-content licences.
FOSS licenses
FOSS stands for "Free and Open Source Software". There is no one universally agreed-upon definition of FOSS software and various groups maintain approved lists of licenses. The Open Source Initiative (OSI) is one such organization keeping a list of open-source licenses. The Free Software Foundation (FSF) maintains a list of what it considers free. FSF's free software and OSI's open-source licenses together are called FOSS licenses. There are licenses accepted by the OSI which are not free as per the Free Software Definition. The Open Source Definition allows for further restrictions like price, type of contribution and origin of the contribution, e.g. the case of the NASA Open Source Agreement, which requires the code to be "original" work. The OSI does not endorse FSF license analysis (interpretation) as per their disclaimer.
The FSF's Free Software Definition focuses on the user's unrestricted rights to use a program, to study and modify it, to copy it, and redistribute it for any purpose, which are considered by the FSF the four essential freedoms. The OSI's open-source criteria focuses on the availability of the source code and the advantages of an unrestricted and community driven development model. Yet, many FOSS licenses, like the Apache License, and all Free Software licenses allow commercial use of FOSS components.
General comparison
For a simpler comparison across the most common licenses see free-software license comparison.
The following table compares various features of each license and is a general guide to the terms and conditions of each license, based on seven subjects o |
https://en.wikipedia.org/wiki/Hatsune%20Miku | , officially code-named CV01, is a Vocaloid software voicebank developed by Crypton Future Media and its official anthropomorphic mascot character, a 16-year-old girl with long, turquoise twintails. Miku's personification has been marketed as a virtual idol, and has performed at live virtual concerts onstage as an animated projection (rear-cast projection on a specially coated glass screen).
Miku uses Yamaha Corporation's Vocaloid 2, Vocaloid 3, and Vocaloid 4 singing synthesizing technologies. She also uses Crypton Future Media's Piapro Studio, a standalone singing synthesizer editor. She was the second Vocaloid sold using the Vocaloid 2 engine and the first Japanese Vocaloid to use the Japanese version of the 2 engine. The voice is modeled from Japanese voice actress Saki Fujita.
The name of the character comes from merging the Japanese words for , , and , thus meaning "the first sound of the future", which, along with her code name, refers to her position as the first of Crypton's "Character Vocal Series" (abbreviated "CV Series"), preceding Kagamine Rin/Len (code-named CV02) and Megurine Luka (code-named CV03). The number 01 can also be seen on her left shoulder in official artwork.
Development
Hatsune Miku was the first Vocaloid developed by Crypton Future Media after they handled the release of the Yamaha vocal Meiko and Kaito. Miku was intended to be the first of a series of Vocaloids called the "Character Vocal Series" (abbreviated "CV Series"), which included Kagamine Rin/Len and Megurine Luka. Each had a particular concept and vocal direction.
She was built using Yamaha's Vocaloid 2 technology, and later updated to newer engine versions. She was created by taking vocal samples from voice actress Saki Fujita at a controlled pitch and tone. Those samples all contain a single Japanese phonic that, when strung together, creates full lyrics and phrases. The pitch of the samples was to be altered by the synthesizer engine and constructed into a keyboard-s |
https://en.wikipedia.org/wiki/Food%2C%20Beverages%20and%20Catering%20Union | The Food, Beverages and Catering Union (, NGG) is a trade union in Germany. It has a membership of 205,900 and is one of eight industrial affiliates of the German Confederation of Trade Unions.
Membership
Today, NGG mainly represents employees at major companies such as McDonald's, Nestlé and Unilever in Germany.
Presidents
1949: Gustav Pufal
1950: Ferdinand Warnecke
1951: Hans Nätscher
1962: Alfred Schattanik
1966: Herbert Stadelmaier
1978: Günter Döding
1989: Erich Herrmann
1990: Heinz-Günter Niebrügge
1992: Franz-Josef Möllenberg
2013: Michaela Rosenberger
2018: Guido Zeitler
Notable members
Olaf Scholz – First Mayor of Hamburg |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.