source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Megalithic%20graffiti%20symbols | Megalithic markings, megalithic graffiti marks, megalithic symbols or non-Brahmi symbols are markings found on mostly potsherds found in Central India, South India and Sri Lanka during the Megalithic Iron Age in India. A number of scholars have tried to decipher the symbols since 1878, and currently there is no consensus as to whether they constitute undeciphered writing or graffiti or symbols without any syllabic or alphabetic meaning.
History
Megalithic markings are usually found in burial sites but are also found in habitation sites as well. They are tentatively dated from 1000 BCE to 300 CE marking the transition of the proto-historic period into the historic period of the subcontinent. From archaeological stratigraphy, potsherds with and without symbols are usually found at the lowest level, followed by potsherds with mixed symbols and Brahmi or Tamil-Brahmi and eventually at the highest level potsherds are only found with Brahmi or Tamil-Brahmi etchings. From around 300 CE, they disappear from grave sites.
Relationship to Indus script
In 1960, archaeologist B. B. Lal found that 89% of the surveyed megalithic symbols had their counterparts amongst the Indus script. He concluded that there was a commonness of culture between the Indus Valley civilisation and the later megalithic period. In 2019, archaeologists in Tamil Nadu excavated further potsherds at Keeladi with graffiti closely resembling symbols of the Indus script.
Archaeological findings
In 1935 a dish dating to the 1st century BCE and bearing megalithic graffiti symbols was discovered in Sulur, near Coimbatore in Tamil Nadu. In a 2001 publication, Mahadevan argued that the inscription on the dish contained symbols similar to those of the Indus script and also that the symbols are in same order as those of a comparable inscription on a tablet from Harappa. Mahadevan suggested that was evidence that the languages of the inscriptions were related.
In February 2006, a stone celt was discovered in S |
https://en.wikipedia.org/wiki/Continuous%20q-Hahn%20polynomials | In mathematics, the continuous q-Hahn polynomials are a family of basic hypergeometric orthogonal polynomials in the basic Askey scheme. give a detailed list of their properties.
Definition
The polynomials are given in terms of basic hypergeometric functions and the q-Pochhammer symbol by
Gallery |
https://en.wikipedia.org/wiki/List%20of%20Cambridge%20mathematicians | A list of mathematicians, past and present, with associations with the University of Cambridge.
A - F
Rediet Abebe, graduate student at Pembroke College, Cambridge
Frank Adams, fellow of Trinity College, Cambridge, Lowndean Professor of Astronomy and Geometry 1970-1989
John Couch Adams, fellow of St. John's College, Cambridge 1843–1852; fellow of Pembroke College, Cambridge 1853–1892; Lowndean Professor of Astronomy and Geometry 1859-1891
Michael Atiyah, fellow of Trinity College, Cambridge 1954–1957; fellow of Pembroke College, Cambridge 1958–1961; Master of Trinity College, Cambridge 1990-1997
Charles Babbage, Lucasian Professor of Mathematics 1828-1839
Christopher Budd, Gresham Professor of Geometry, student at St John's College 1979-1983
Alan Baker, fellow of Trinity College, Cambridge 1964-
H. F. Baker, fellow of St. John's College, Cambridge
Dennis Barden, fellow of Pembroke College, Cambridge
Isaac Barrow, fellow of Trinity College, Cambridge 1649–1655, Lucasian Professor of Mathematics
Bryan John Birch, undergraduate and research student at Trinity College, Cambridge, fellow of Churchill College, Cambridge
Béla Bollobás, fellow of Trinity College, Cambridge
Richard Ewen Borcherds
Henry Briggs, Fellow of St. John's College, Cambridge
Dame Mary Cartwright, fellow and Mistress of Girton College, Cambridge
J. W. S. Cassels, fellow of Trinity College, Cambridge 1949–1984; Sadleirian Professor of Pure Mathematics 1967-1986
Arthur Cayley, student at Trinity College, Cambridge
D. G. Champernowne
Sydney Chapman, student at and later lecturer and fellow (1914–1919) of Trinity College, Cambridge
William Kingdon Clifford
John Coates, fellow of Emmanuel College, Cambridge 1975–1977; Sadleirian Professor of Pure Mathematics 1986–2012
John Horton Conway, fellow of Sidney Sussex College, Cambridge 1964–1970; fellow of Gonville and Caius College, Cambridge 1970-1986
Roger Cotes
Percy John Daniell
Philip Dawid
Harold Davenport
James Davenport, undergraduate and research stud |
https://en.wikipedia.org/wiki/Power%20series | In mathematics, a power series (in one variable) is an infinite series of the form
where an represents the coefficient of the nth term and c is a constant. Power series are useful in mathematical analysis, where they arise as Taylor series of infinitely differentiable functions. In fact, Borel's theorem implies that every power series is the Taylor series of some smooth function.
In many situations, c (the center of the series) is equal to zero, for instance when considering a Maclaurin series. In such cases, the power series takes the simpler form
Beyond their role in mathematical analysis, power series also occur in combinatorics as generating functions (a kind of formal power series) and in electronic engineering (under the name of the Z-transform). The familiar decimal notation for real numbers can also be viewed as an example of a power series, with integer coefficients, but with the argument x fixed at . In number theory, the concept of p-adic numbers is also closely related to that of a power series.
Examples
Polynomial
Any polynomial can be easily expressed as a power series around any center c, although all but finitely many of the coefficients will be zero since a power series has infinitely many terms by definition. For instance, the polynomial can be written as a power series around the center as
or around the center as
This is because of the Taylor series expansion of f(x) around is
as and the non-zero derivatives are , so and , a constant.
Or indeed the expansion is possible around any other center c. One can view power series as being like "polynomials of infinite degree," although power series are not polynomials.
Geometric series, exponential function and sine
The geometric series formula
which is valid for , is one of the most important examples of a power series, as are the exponential function formula
and the sine formula
valid for all real x.
These power series are also examples of Taylor series.
On the set of exponents |
https://en.wikipedia.org/wiki/HVDC%20converter%20station | An HVDC converter station (or simply converter station) is a specialised type of substation which forms the terminal equipment for a high-voltage direct current (HVDC) transmission line. It converts direct current to alternating current or the reverse. In addition to the converter, the station usually contains:
three-phase alternating current switch gear
transformers
capacitors or synchronous condensers for reactive power
filters for harmonic suppression, and
direct current switch gear.
Components
Converter
The converter is usually installed in a building called the valve hall. Early HVDC systems used mercury-arc valves, but since the mid-1970s, solid state devices such as thyristors have been used. Converters using thyristors or mercury-arc valves are known as line commutated converters. In thyristor-based converters, many thyristors are connected in series to form a thyristor valve, and each converter normally consists of six or twelve thyristor valves. The thyristor valves are usually grouped in pairs or groups of four and can stand on insulators on the floor or hang from insulators from the ceiling.
Line commutated converters require voltage from the AC network for commutation, but since the late 1990s, voltage sourced converters have started to be used for HVDC. Voltage sourced converters use insulated-gate bipolar transistors instead of thyristors, and these can provide power to a deenergized AC system.
Almost all converters used for HVDC are intrinsically able to operate with power conversion in either direction. Power conversion from AC to DC is called rectification and conversion from DC to AC is called inversion.
DC equipment
The direct current equipment often includes a coil (called a reactor) that adds inductance in series with the DC line to help smooth the direct current. The inductance typically amounts to between 0.1 H and 1 H. The smoothing reactor can have either an air-core or an iron-core. Iron-core coils look like oil-filled high |
https://en.wikipedia.org/wiki/Monopotassium%20phosphate | Monopotassium phosphate (MKP) (also, potassium dihydrogenphosphate, KDP, or monobasic potassium phosphate) is the inorganic compound with the formula KH2PO4. Together with dipotassium phosphate (K2HPO4.(H2O)x) it is often used as a fertilizer, food additive, and buffering agent. The salt often cocrystallizes with the dipotassium salt as well as with phosphoric acid.
Single crystals are paraelectric at room temperature. At temperatures below , they become ferroelectric.
Structure
Monopotassium phosphate can exist in several polymorphs. At room temperature it forms paraelectric crystals with tetragonal symmetry. Upon cooling to it transforms to a ferroelectric phase of orthorhombic symmetry, and the transition temperature shifts up to when hydrogen is replaced by deuterium. Heating to changes its structure to monoclinic. When heated further, MKP decomposes, by loss of water, to potassium metaphosphate, , at .
Manufacturing
Monopotassium phosphate is produced by the action of phosphoric acid on potassium carbonate.
Applications
Fertilizer-grade MKP powder contains the equivalent of 52% and 34% , and is labeled NPK0-52-34. MKP powder is often used as a nutrient source in the greenhouse trade and in hydroponics.
As a crystal, MKP is noted for its non-linear optical properties. It is used in optical modulators and for non-linear optics such as second-harmonic generation (SHG).
Also, to be noted is KD*P, potassium dideuterium phosphate, with slightly different properties. Highly deuterated KDP is used in nonlinear frequency conversion of laser light instead of protonated (regular) KDP due to the fact that the replacement of protons with deuterons in the crystal shifts the third overtone of the strong OH molecular stretch to longer wavelengths, moving it mostly out of the range of the fundamental line at approximately 1064 nm of neodymium-based lasers. Regular KDP has absorbances at this wavelength of approximately 4.7–6.3% per cm of thickness while highly deuter |
https://en.wikipedia.org/wiki/Cell%20potency | Cell potency is a cell's ability to differentiate into other cell types.
The more cell types a cell can differentiate into, the greater its potency. Potency is also described as the gene activation potential within a cell, which like a continuum, begins with totipotency to designate a cell with the most differentiation potential, pluripotency, multipotency, oligopotency, and finally unipotency.
Totipotency
Totipotency (Lat. totipotentia, "ability for all [things]") is the ability of a single cell to divide and produce all of the differentiated cells in an organism. Spores and zygotes are examples of totipotent cells.
In the spectrum of cell potency, totipotency represents the cell with the greatest differentiation potential, being able to differentiate into any embryonic cell, as well as any extraembryonic cell. In contrast, pluripotent cells can only differentiate into embryonic cells.
A fully differentiated cell can return to a state of totipotency. The conversion to totipotency is complex and not fully understood. In 2011, research revealed that cells may differentiate not into a fully totipotent cell, but instead into a "complex cellular variation" of totipotency. Stem cells resembling totipotent blastomeres from 2-cell stage embryos can arise spontaneously in mouse embryonic stem cell cultures and also can be induced to arise more frequently in vitro through down-regulation of the chromatin assembly activity of CAF-1.
The human development model can be used to describe how totipotent cells arise. Human development begins when a sperm fertilizes an egg and the resulting fertilized egg creates a single totipotent cell, a zygote. In the first hours after fertilization, this zygote divides into identical totipotent cells, which can later develop into any of the three germ layers of a human (endoderm, mesoderm, or ectoderm), or into cells of the placenta (cytotrophoblast or syncytiotrophoblast). After reaching a 16-cell stage, the totipotent cells of the morula d |
https://en.wikipedia.org/wiki/Sequence%20clustering | In bioinformatics, sequence clustering algorithms attempt to group biological sequences that are somehow related. The sequences can be either of genomic, "transcriptomic" (ESTs) or protein origin.
For proteins, homologous sequences are typically grouped into families. For EST data, clustering is important to group sequences originating from the same gene before the ESTs are assembled to reconstruct the original mRNA.
Some clustering algorithms use single-linkage clustering, constructing a transitive closure of sequences with a similarity over a particular threshold. UCLUST and CD-HIT use a greedy algorithm that identifies a representative sequence for each cluster and assigns a new sequence to that cluster if it is sufficiently similar to the representative; if a sequence is not matched then it becomes the representative sequence for a new cluster. The similarity score is often based on sequence alignment. Sequence clustering is often used to make a non-redundant set of representative sequences.
Sequence clusters are often synonymous with (but not identical to) protein families. Determining a representative tertiary structure for each sequence cluster is the aim of many structural genomics initiatives.
Sequence clustering algorithms and packages
CD-HIT
UCLUST in USEARCH
Starcode: a fast sequence clustering algorithm based on exact all-pairs search.
OrthoFinder: a fast, scalable and accurate method for clustering proteins into gene families (orthogroups)
Linclust: first algorithm whose runtime scales linearly with input set size, very fast, part of MMseqs2 software suite for fast, sensitive sequence searching and clustering of large sequence sets
TribeMCL: a method for clustering proteins into related groups
BAG: a graph theoretic sequence clustering algorithm
JESAM: Open source parallel scalable DNA alignment engine with optional clustering software component
UICluster: Parallel Clustering of EST (Gene) Sequences
BLASTClust single-linkage clustering |
https://en.wikipedia.org/wiki/0/1-polytope | A 0/1-polytope is a convex polytope generated by the convex hull of a subset of d coordinates value 0 or 1, {0,1}d. The full domain is the unit hypercube with cut planes passing through these coordinates. A d-polytope requires at least d+1 vertices, and can't be all in the same hyperplanes.
n-simplex polytopes for example can be generated (n+1) vertices, using the origin, and one vertex along each primary axis, (1,0....), etc. |
https://en.wikipedia.org/wiki/Treasure%20MathStorm%21 | Treasure MathStorm! is an educational computer game intended to teach children ages five to nine mathematical problem solving. This sequel to Treasure Mountain! is the sixth installment of The Learning Company's Super Seekers games and the second in its "Treasure" series.
The objective of Treasure MathStorm! is to return all of the treasures hidden across the mountain to the treasure chest in the castle at the top of the mountain. Although it runs smoother and has better graphics, basic gameplay is very similar to that of its predecessor. In 1994, an enhanced and more Windows-friendly version was released on CD-ROM.
Gameplay
The game takes place in a magical realm called Treasure Mountain. As the game opens, the Master of Mischief, the common antagonist to the Super Seekers games, uses a weather machine to freeze the mountain in snow and ice and scatters the castle's treasures all over the mountain. The player takes on the role of the Super Seeker, whose job is to find the scattered treasures and return them to the castle's treasure chest in order to thaw out the mountain.
The mountain itself consists of three levels. The player cannot climb higher until he has gathered the supplies, like ice axes, ladders, or catapult parts, useful for scaling the mountain. To obtain these items, the players must help out the local inhabitants complete math-related tasks such as adjusting clocks to a given time, balancing scales, and counting crystals.
In order to find treasures, the player must place a specific amount of snowballs at a certain location. To find out how many snowballs are needed, the player must catch an elf carrying a scroll. If he answers the riddle correctly, he will be told how to find treasures on that particular level.
Once the player reaches the top of the castle on the highest level of the mountain, he deposits all treasures found into the castle's treasure chest and is given a prize as a reward for completing the three stages. This prize is kept on di |
https://en.wikipedia.org/wiki/79th%20meridian%20east | The meridian 79° east of Greenwich is a line of longitude that extends from the North Pole across the Arctic Ocean, Asia, the Indian Ocean, the Southern Ocean, and Antarctica to the South Pole.
The 79th meridian east forms a great circle with the 101st meridian west.
From Pole to Pole
Starting at the North Pole and heading south to the South Pole, the 79th meridian east passes through:
{| class="wikitable plainrowheaders"
! scope="col" width="120" | Co-ordinates
! scope="col" | Country, territory or sea
! scope="col" | Notes
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Arctic Ocean
| style="background:#b0e0e6;" |
|-valign="top"
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Kara Sea
| style="background:#b0e0e6;" | Passing just west of Ushakov Island, Krasnoyarsk Krai, Passing just west of Uyedineniya Island, Krasnoyarsk Krai,
|-
|
! scope="row" |
| Krasnoyarsk Krai — Nosok Island
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Kara Sea
| style="background:#b0e0e6;" |
|-
|
! scope="row" |
| Krasnoyarsk Krai — Sibiryakov Island
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Kara Sea
| style="background:#b0e0e6;" | Yenisei Gulf
|-valign="top"
|
! scope="row" |
| Yamalo-Nenets Autonomous Okrug Krasnoyarsk Krai — from Yamalo-Nenets Autonomous Okrug — from Khanty-Mansi Autonomous Okrug — from Tomsk Oblast — from Novosibirsk Oblast — from Altai Krai — from
|-
|
! scope="row" |
| Passing through Lake Balkhash
|-
|
! scope="row" |
|
|-valign="top"
|
! scope="row" |
| Xinjiang
|-
|
! scope="row" | Aksai Chin
| Disputed between and
|-valign="top"
|
! scope="row" |
| Tibet
|-
|
! scope="row" | Aksai Chin
| Disputed between and
|-valign="top"
|
! scope="row" |
| Tibet
|-
|
! scope="row" |
| Ladakh
|-valign="top"
|
! scope="row" |
| Tibet
|-
|
! scope="row" | Aksai Chin
| Disputed between and
|-valign="top"
|
! s |
https://en.wikipedia.org/wiki/Hypercomplex%20number | In mathematics, hypercomplex number is a traditional term for an element of a finite-dimensional unital algebra over the field of real numbers.
The study of hypercomplex numbers in the late 19th century forms the basis of modern group representation theory.
History
In the nineteenth century number systems called quaternions, tessarines, coquaternions, biquaternions, and octonions became established concepts in mathematical literature, added to the real and complex numbers. The concept of a hypercomplex number covered them all, and called for a discipline to explain and classify them.
The cataloguing project began in 1872 when Benjamin Peirce first published his Linear Associative Algebra, and was carried forward by his son Charles Sanders Peirce. Most significantly, they identified the nilpotent and the idempotent elements as useful hypercomplex numbers for classifications. The Cayley–Dickson construction used involutions to generate complex numbers, quaternions, and octonions out of the real number system. Hurwitz and Frobenius proved theorems that put limits on hypercomplexity: Hurwitz's theorem says finite-dimensional real composition algebras are the reals , the complexes , the quaternions , and the octonions , and the Frobenius theorem says the only real associative division algebras are , , and . In 1958 J. Frank Adams published a further generalization in terms of Hopf invariants on H-spaces which still limits the dimension to 1, 2, 4, or 8.
It was matrix algebra that harnessed the hypercomplex systems. First, matrices contributed new hypercomplex numbers like 2 × 2 real matrices (see Split-quaternion). Soon the matrix paradigm began to explain the others as they became represented by matrices and their operations. In 1907 Joseph Wedderburn showed that associative hypercomplex systems could be represented by square matrices, or direct product of algebras of square matrices. From that date the preferred term for a hypercomplex system became associative a |
https://en.wikipedia.org/wiki/Intel%208255 | The Intel 8255 (or i8255) Programmable Peripheral Interface (PPI) chip was developed and manufactured by Intel in the first half of the 1970s for the Intel 8080 microprocessor. The 8255 provides 24 parallel input/output lines with a variety of programmable operating modes.
The 8255 is a member of the MCS-85 family of chips, designed by Intel for use with their 8085 and 8086 microprocessors and their descendants. It was first available in a 40-pin DIP and later a 44-pin PLCC packages. It found wide applicability in digital processing systems and was later cloned by other manufacturers. The 82C55 is a CMOS version for higher speed and lower current consumption.
The functionality of the 8255 is now mostly embedded in larger VLSI processing chips as a sub-function. A CMOS version of the 8255 is still being made by Renesas but mostly used to expand the I/O of microcontrollers.
Similar chips
The 8255 has a similar function to the Motorola 6820 PIA (Peripheral Interface Adapter) from the Motorola 6800 family, also originally packaged as 40-pin DIL. The 8255 provides 24 I/O pins with four programmable direction bits: one for Port A(7:0) (i.e., all pins in the port), one for Port B(7:0), one for Port C(3:0) and one for Port C(7:4). By contrast, the Motorola and MOS chips provide only 16 I/O pins plus 4 control pins, but the Motorola/MOS chips allow the direction (input or output) of all I/O pins to be individually programmed. Both have configurations that will do a certain amount of automatic handshaking and interrupt generation.
Other comparable microprocessor I/O chips are the 2655 Programmable Peripheral Interface from the Signetics 2650 family, the Z80 PIO, the Western Design Center WDC 65C21 (equivalent to the Motorola 6820/6821), and the MOS Technology 6522 VIA and 6526 CIA which had considerable additional functionality such as timers and shift registers.
Variants
The industrial grade version of Intel ID8255A was available for US$17.55 in quantities of 100 and |
https://en.wikipedia.org/wiki/Zoho%20Corporation | Zoho Corporation, is an Indian multinational technology company that makes computer software and web-based business tools. It is best known for the online office suite offering Zoho Office Suite. The company was founded in 1996 by Sridhar Vembu and Tony Thomas and has a presence in seven locations with global headquarters in Chennai, Tamil Nadu, India, and corporate headquarters outside of Austin in Del Valle, Texas. Radha Vembu, Sridhar Vembu's sister, owns a majority stake in the company.
History
From 1996 to 2009, the company was known as AdventNet, Inc. and initially provided network management software.
AdventNet expanded operations into Japan in 2001 and shifted focus to small and medium businesses (SMBs).
Zoho CRM was released in 2005, along with Zoho Writer, the company's first Office suite product. Zoho Projects, Creator, Sheet, and Show were released in 2006. Zoho expanded into the collaboration space with the release of Zoho Docs and Zoho Meeting in 2007. In 2008, the company added invoicing and mail applications, reaching one million users by August of that year.
In 2009, the company was renamed Zoho Corporation after its online office suite. The company remains privately owned.
In 2017, Zoho launched Zoho One, a comprehensive suite of over forty applications. As of October 2021, Zoho One has been expanded to 50 applications. The following year, in November 2022, Zoho worked with more than 50,000 organizations in more than 160 countries.
Zoho reached more than 50 million customers in January 2020. In July 2022, the company announced it had more than 80 million users.
Zoholics India is the name of the company's annual user conference.
Other products include Zoho Books, an accounting software, Zoho Workplace, an enterprise collaboration platform, Zoho Survey, a customer experience management tool, and Zoho People, an HR management platform.
In March of 2023, Zoho collaborated with Payoneer, a financial technology company that assists with busines |
https://en.wikipedia.org/wiki/William%20E.%20Schevill | William Edward "Bill" Schevill (July 2, 1906 – July 25, 1994) was an American paleontologist famous for his part in dynamiting out the nodules of the most complete skeleton of the short-necked pliosaur Kronosaurus queenslandicus discovered in Hughenden in Queensland, Australia, in 1932. He later became known as an authority on the sounds of whales. Schevill had the title of scientist emeritus at the Woods Hole Oceanographic Institution, where he had begun working in 1943, technically retiring in 1985.
Early Education
Born July 2, 1906 in Brooklyn, New York, William E. Schevill grew up in Manhattan, New York, and St Louis, Missouri. Prior to going to college he spent nearly a year in Silver City, New Mexico where, working a ranch, he earned the rank of wrangler. Graduating from Harvard College in 1927, he saw the rejuvenation of the Harvard Museum of Comparative Zoology (MCZ) as initiated by the new director Thomas Barbour and, in 1929 Bill Schevill earned an A.M. with and was made the assistant of Percy Raymond, MCZ Professor and Curator of Invertebrate Palaeontology. Soon promoted to Associate Curator, Schevill traveled with Professor Raymond on "significant fossil-collecting expeditions to the Burgess Shale, British Columbia (1930) and to Estonia, Norway and Sweden (1934)."
Kronosaurus discovery
In 1931 the (MCZ) sent an expedition to Australia for the dual purpose of procuring specimens - the museum being "weak in Australian animals and...desires[ing] to complete its series" - and to engage in "the study of the animals of the region when alive." The Harvard Australian Expedition (1931–1932), as it became known, was a six-man venture led by Harvard Professor William Morton Wheeler, with the others being P. Jackson Darlington, Jr. (a renowned coleopterist), Glover Morrill Allen and his student Ralph Nicholson Ellis, medical officer Ira M. Dixon, and William E. Schevill. MCZ director Thomas Barbour said at the time "We shall hope for specimens' of the kanga |
https://en.wikipedia.org/wiki/Barrier%20function | In constrained optimization, a field of mathematics, a barrier function is a continuous function whose value on a point increases to infinity as the point approaches the boundary of the feasible region of an optimization problem. Such functions are used to replace inequality constraints by a penalizing term in the objective function that is easier to handle.
The two most common types of barrier functions are inverse barrier functions and logarithmic barrier functions. Resumption of interest in logarithmic barrier functions was motivated by their connection with primal-dual interior point methods.
Motivation
Consider the following constrained optimization problem:
minimize
subject to
where is some constant. If one wishes to remove the inequality constraint, the problem can be re-formulated as
minimize ,
where if , and zero otherwise.
This problem is equivalent to the first. It gets rid of the inequality, but introduces the issue that the penalty function , and therefore the objective function , is discontinuous, preventing the use of calculus to solve it.
A barrier function, now, is a continuous approximation to that tends to infinity as approaches from above. Using such a function, a new optimization problem is formulated, viz.
minimize
where is a free parameter. This problem is not equivalent to the original, but as approaches zero, it becomes an ever-better approximation.
Logarithmic barrier function
For logarithmic barrier functions, is defined as when and otherwise (in 1 dimension. See below for a definition in higher dimensions). This essentially relies on the fact that tends to negative infinity as tends to 0.
This introduces a gradient to the function being optimized which favors less extreme values of (in this case values lower than ), while having relatively low impact on the function away from these extremes.
Logarithmic barrier functions may be favored over less computationally expensive inverse barrier functions depending |
https://en.wikipedia.org/wiki/U.S.%20critical%20infrastructure%20protection | In the U.S., critical infrastructure protection (CIP) is a concept that relates to the preparedness and response to serious incidents that involve the critical infrastructure of a region or the nation.
The American Presidential directive PDD-63 of May 1998 set up a national program of "Critical Infrastructure Protection". In 2014 the NIST Cybersecurity Framework was published after further presidential directives.
History
The U.S. CIP is a national program to ensure the security of vulnerable and interconnected infrastructures of the United States. In May 1998, President Bill Clinton issued presidential directive PDD-63 on the subject of critical infrastructure protection. This recognized certain parts of the national infrastructure as critical to the national and economic security of the United States and the well-being of its citizenry, and required steps to be taken to protect it.
This was updated on December 17, 2003, by President Bush through Homeland Security Presidential Directive HSPD-7 for Critical Infrastructure Identification, Prioritization, and Protection. The directive describes the United States as having some critical infrastructure that is "so vital to the United States that the incapacity or destruction of such systems and assets would have a debilitating impact on security, national economic security, national public health or safety."
Overview
The systems and networks that make up the infrastructure of society are often taken for granted, yet a disruption to just one of those systems can have dire consequences across other sectors.
Take, for example, a computer virus that disrupts the distribution of natural gas across a region. This could lead to a consequential reduction in electrical power generation, which in turn leads to the forced shutdown of computerized controls and communications. Road traffic, air traffic, and rail transportation might then become affected. Emergency services might also be hampered.
An entire region can become |
https://en.wikipedia.org/wiki/Test%20CD | A test CD is a compact disc containing tracks of musical and technical tests and demonstrations. Most of the tracks are made of electronic signals and pure frequencies. The purpose of these specialized compact discs is to make accurate tests and calibrate audio equipment.
Releases
A wide variety of CD-DA test discs have been produced in the past, and a few are still in production:
Stereophile Test CD 2
CD-CHECK Test Disc
NAB Broadcast & Audio Test CD, Vol 1 (still in production)
NAB Broadcast & Audio Test CD, Vol 2 (still in production)
Precision Test Signals
The Ultimate Test CD
CBS Records CD-1 Standard Test Disc (with EIA standard signals)
EIAJ CD-1 Standard Test Disc (YGDS 13) (EIAJ Standard CP-308)
Denon Audio Technical CD 38C39-7147
Japan Audio Society Audio Test CD-1 (YDDS-2)
Philips Test Sample 4a
Sony Test CD Type 3 YEDS-7
Technics CD Test Disc SH-CD001
See also
Audio equipment testing
Super Audio CD |
https://en.wikipedia.org/wiki/Multiple%20single-level | Multiple single-level or multi-security level (MSL) is a means to separate different levels of data by using separate computers or virtual machines for each level. It aims to give some of the benefits of multilevel security without needing special changes to the OS or applications, but at the cost of needing extra hardware.
The drive to develop MLS operating systems was severely hampered by the dramatic fall in data processing costs in the early 1990s. Before the advent of desktop computing, users with classified processing requirements had to either spend a lot of money for a dedicated computer or use one that hosted an MLS operating system. Throughout the 1990s, however, many offices in the defense and intelligence communities took advantage of falling computing costs to deploy desktop systems classified to operate only at the highest classification level used in their organization. These desktop computers operated in system high mode and were connected with LANs that carried traffic at the same level as the computers.
MSL implementations such as these neatly avoided the complexities of MLS but traded off technical simplicity for inefficient use of space. Because most users in classified environments also needed unclassified systems, users often had at least two computers and sometimes more (one for unclassified processing and one for each classification level processed). In addition, each computer was connected to its own LAN at the appropriate classification level, meaning that multiple dedicated cabling plants were incorporated (at considerable cost in terms of both installation and maintenance).
Limits of MSL versus MLS
The obvious shortcoming of MSL (as compared to MLS) is that it does not support immixture of various classification levels in any manner. For example, the notion of concatenating a SECRET data stream (taken from a SECRET file) with a TOP SECRET data stream (read from a TOP SECRET file) and directing the resultant TOP SECRET data stream into |
https://en.wikipedia.org/wiki/Malliavin%27s%20absolute%20continuity%20lemma | In mathematics — specifically, in measure theory — Malliavin's absolute continuity lemma is a result due to the French mathematician Paul Malliavin that plays a foundational rôle in the regularity (smoothness) theorems of the Malliavin calculus. Malliavin's lemma gives a sufficient condition for a finite Borel measure to be absolutely continuous with respect to Lebesgue measure.
Statement of the lemma
Let μ be a finite Borel measure on n-dimensional Euclidean space Rn. Suppose that, for every x ∈ Rn, there exists a constant C = C(x) such that
for every C∞ function φ : Rn → R with compact support. Then μ is absolutely continuous with respect to n-dimensional Lebesgue measure λn on Rn. In the above, Dφ(y) denotes the Fréchet derivative of φ at y and ||φ||∞ denotes the supremum norm of φ. |
https://en.wikipedia.org/wiki/Chelsio%20Communications | Chelsio Communications is a privately held technology company headquartered in Sunnyvale, California with a design center in Bangalore, India. Early venture capital funding came from Horizons Ventures, Invesco, Investor Growth Capital, NTT Finance, Vendanta Capital, Abacus Capital Group, Pacesetter Capital Group, and New Enterprise Associates.
A third round of funding raised $25 million in late 2004.
LSI Corporation was added as investor in 2006 in the series D round.
By January 2008, a $25M financing round was announced as series E.
In 2009, an additional $17M was raised from previous investors plus Mobile Internet Capital.
Chelsio sells hardware and software solutions including protocol acceleration technology, Unified Wire Ethernet network adapter cards, unified storage software, high performance storage gateways, unified management software, bypass cards, and other solutions.
Chelsio was an early vendor of 10 Gigabit Ethernet technology, announcing a product in 2004, an alliance with Foundry Networks, and measurements in 2005.
Chelsio products were used to build the Coates supercomputer at Purdue University in 2009.
In August 2009 Chelsio announced the Unified Storage Software product to provide storage area network and network-attached storage functions.
The company holds several patents, dating from one for reduced overhead direct memory access (DMA) initially filed in 2002.
A fourth generation was announced in 2011.
In January 2013 Chelsio announced the Terminator 5 application specific integrated circuit, which brings all of the company's protocol acceleration technology to 40 Gbit/s speeds, with the roadmap to 100 Gbit/s scheduled for 2015.
Its products such as network interface controller cards are sold by distributors.
The Chelsio Unified Storage Router product is also marketed by Dell,
and was certified to work with tape drives from Quantum Corporation in 2011.
Chelsio is involved with the OpenFabrics Alliance. |
https://en.wikipedia.org/wiki/Suppressor%20variable | A suppressor variable is a variable that increases the predictive validity of another variable when included in a regression equation.
Suppression can occur when a single causal variable is related to an outcome variable through two separate mediator variables, and when one of those mediated effects is positive and one is negative. In such a case, each mediator variable suppresses or conceals the effect that is carried through the other mediator variable. For example, higher intelligence scores (a causal variable, A) may cause an increase in error detection (a mediator variable, B) which in turn may cause a decrease in errors made at work on an assembly line (an outcome variable, X); at the same time, intelligence could also cause an increase in boredom (C), which in turn may cause an increase in errors (X). Thus, in one causal path intelligence decreases errors, and in the other it increases them. When neither mediator is included in the analysis, intelligence appears to have no effect or a weak effect on errors. However, when boredom is controlled intelligence will appear to decrease errors, and when error detection is controlled intelligence will appear to increase errors. If intelligence could be increased while only boredom was held constant, errors would decrease; if intelligence could be increased while holding only error detection constant, errors would increase.
See also
Confounding variable |
https://en.wikipedia.org/wiki/Edwin%20Chapin%20Starks | Edwin Chapin Starks (born in Baraboo, Wisconsin on January 25, 1867; died December 29, 1932) was an ichthyologist most associated with Stanford University. He was known as an authority on the osteology of fish. He also did studies of fish of the Puget Sound. His wife and daughter were also both involved in either science or natural history.
See also
:Category:Taxa named by Edwin Chapin Starks |
https://en.wikipedia.org/wiki/Saint-Venant%27s%20theorem | In solid mechanics, it is common to analyze the properties of beams with constant cross section. Saint-Venant's theorem states that the simply connected cross section with maximal torsional rigidity is a circle. It is named after the French mathematician Adhémar Jean Claude Barré de Saint-Venant.
Given a simply connected domain D in the plane with area A, the radius and the area of its greatest inscribed circle, the torsional rigidity P
of D is defined by
Here the supremum is taken over all the continuously differentiable functions vanishing on the boundary of D. The existence of this supremum is a consequence of Poincaré inequality.
Saint-Venant conjectured in 1856 that
of all domains D of equal area A the circular one has the greatest torsional rigidity, that is
A rigorous proof of this inequality was not given until 1948 by Pólya. Another proof was given by Davenport and reported in. A more general proof and an estimate
is given by Makai.
Notes
Elasticity (physics)
Eponymous theorems of physics
Calculus of variations
Inequalities |
https://en.wikipedia.org/wiki/NBEAL1 | NBEAL1 is a protein that in humans is encoded by the NBEAL1 gene. It is found on chromosome 2q33.2 of Homo sapiens.
Through the different domains of this protein, the function of NBEAL1 is predicted to be involved in the following cellular mechanisms: vesicle trafficking, membrane dynamics, receptor signaling, pre-mRNA processing, signal transduction and cytoskeleton assembly. NBEAL1 is also known as Amytorophic Lateral Sclerosis 2 Chromosomal Region, ALS2CR16 and ALS2CR17.
Protein Properties
Transcript
The mRNA for this protein consists of 9058 base pairs in a linear sequence with the coding sequence begins at base pair number 334 and extends until base pair number 8418. The translated protein is a total 56 exons that constitute a final length of 2694 amino acids. There are currently 9 known isoforms within humans.
Domains
Neurobeachin-like1 contains five domains: DUF4704, DUF4800, PH_BEACH, Beach, and WD40 repeats.
DUF4704
DUF4704 is a domain of unknown function. While the function of this domain is unknown, it is conserved within neurobeachin proteins in eukaryotes. It begins at amino acid 859 and spans until number 1115.
DUF4800
DUF4800 is a domain of unknown function. It begins at amino acid 1580, spanning until 1833. While it is uncharacterized in function, it is found within eukaryotes.
PH_BEACH
Spanning from amino acid 1886 until amino acid 1983, this domain is referred to as a Pleckstrin Homology domain in the BEACH domain. It has a PH because the fold of this domain is similar to the PH domain, but is not identical in the sequence of the canonical PH domains. The PH_BEACH domain is not able to bind phospholipids.
Beach
The Beige and Chediak-Higashi (BEACH) domain is one of the most significant domains within this protein. This domain is highly conserved roughly 280 amino acid domain, present in nine different human BEACH domains. It located after the PH_BEACH domain in the sequence. While not much is understood on the exact function of BDCP |
https://en.wikipedia.org/wiki/Born%20rule | The Born rule (also called Born's rule) is a postulate of quantum mechanics which gives the probability that a measurement of a quantum system will yield a given result. In its simplest form, it states that the probability density of finding a system in a given state, when measured, is proportional to the square of the amplitude of the system's wavefunction at that state. It was formulated and published by German physicist Max Born in July, 1926.
Details
The Born rule states that if an observable corresponding to a self-adjoint operator with discrete spectrum is measured in a system with normalized wave function (see Bra–ket notation), then:
the measured result will be one of the eigenvalues of , and
the probability of measuring a given eigenvalue will equal , where is the projection onto the eigenspace of corresponding to .
(In the case where the eigenspace of corresponding to is one-dimensional and spanned by the normalized eigenvector , is equal to , so the probability is equal to . Since the complex number is known as the probability amplitude that the state vector assigns to the eigenvector , it is common to describe the Born rule as saying that probability is equal to the amplitude-squared (really the amplitude times its own complex conjugate). Equivalently, the probability can be written as .)
In the case where the spectrum of is not wholly discrete, the spectral theorem proves the existence of a certain projection-valued measure , the spectral measure of . In this case:
the probability that the result of the measurement lies in a measurable set is given by .
A wave function for a single structureless particle in space position implies that the probability density function for a measurement of the particles's position at time is:
In some applications, this treatment of the Born rule is generalized using positive-operator-valued measures. A POVM is a measure whose values are positive semi-definite operators on a Hilbert space. POV |
https://en.wikipedia.org/wiki/Kaliuresis | Kaliuresis () or kaluresis () is the condition of excreting potassium in the urine.
Thiazide diuretics are used to treat patients with heart failure. Their goal is to decrease the amount of salt (sodium chloride) in the body by decreasing the amount that the kidney reabsorbs. This excess sodium in the kidneys that is destined for excretion via urination can cause hyponatremia (low sodium level) and can lead to kaliuresis by increasing sodium-potassium exchange.
See also
Natriuresis
Notes
External links
Merriam-Webster entry
Renal physiology |
https://en.wikipedia.org/wiki/Trust%20region | In mathematical optimization, a trust region is the subset of the region of the objective function that is approximated using a model function (often a quadratic). If an adequate model of the objective function is found within the trust region, then the region is expanded; conversely, if the approximation is poor, then the region is contracted.
The fit is evaluated by comparing the ratio of expected improvement from the model approximation with the actual improvement observed in the objective function. Simple thresholding of the ratio is used as the criterion for expansion and contraction—a model function is "trusted" only in the region where it provides a reasonable approximation.
Trust-region methods are in some sense dual to line-search methods: trust-region methods first choose a step size (the size of the trust region) and then a step direction, while line-search methods first choose a step direction and then a step size.
The general idea behind trust region methods is known by many names; the earliest use of the term seems to be by Sorensen (1982). A popular textbook by Fletcher (1980) calls these algorithms restricted-step methods. Additionally, in an early foundational work on the method, Goldfeld, Quandt, and Trotter (1966) refer to it as quadratic hill-climbing.
Example
Conceptually, in the Levenberg–Marquardt algorithm, the objective function is iteratively approximated by a quadratic surface, then using a linear solver, the estimate is updated. This alone may not converge nicely if the initial guess is too far from the optimum. For this reason, the algorithm instead restricts each step, preventing it from stepping "too far". It operationalizes "too far" as follows. Rather than solving for , it solves , where is the diagonal matrix with the same diagonal as A, and λ is a parameter that controls the trust-region size. Geometrically, this adds a paraboloid centered at to the quadratic form, resulting in a smaller step.
The trick is to change the t |
https://en.wikipedia.org/wiki/Tanja%20Lange | Tanja Lange is a German cryptographer and number theorist at the Eindhoven University of Technology.
She is known for her research on post-quantum cryptography.
Education and career
Lange earned a diploma in mathematics in 1998 from the Technical University of Braunschweig. She completed her Ph.D. in 2001 at the Universität Duisburg-Essen. Her dissertation, jointly supervised by Gerhard Frey and YoungJu Choie, concerned Efficient Arithmetic on Hyperelliptic Curves.
After postdoctoral studies at Ruhr University Bochum, she became an associate professor at the Technical University of Denmark in 2005.
She moved to the Eindhoven University of Technology as a full professor in 2007.
At Eindhoven, she chairs the coding theory and cryptology group and is scientific director of the Eindhoven Institute for the Protection of Systems and Information.
She is also the coordinator of PQCRYPTO, a European multi-university consortium to make electronic communications future-proof against threats such as quantum factorization.
She is one of the main authors of The Handbook of Elliptic and Hyperelliptic Curve Cryptography, published in 2005.
See also
NaCl, a cryptography software library developed by Lange and others |
https://en.wikipedia.org/wiki/Cerebral%20vasculitis | Cerebral vasculitis (sometimes the word angiitis is used instead of "vasculitis") is vasculitis (inflammation of the blood vessel wall) involving the brain and occasionally the spinal cord. It affects all of the vessels: very small blood vessels (capillaries), medium-size blood vessels (arterioles and venules), or large blood vessels (arteries and veins). If blood flow in a vessel with vasculitis is reduced or stopped, the parts of the body that receive blood from that vessel begins to die. It may produce a wide range of neurological symptoms, such as headache, skin rashes, feeling very tired, joint pains, difficulty moving or coordinating part of the body, changes in sensation, and alterations in perception, thought or behavior, as well as the phenomena of a mass lesion in the brain leading to coma and herniation. Some of its signs and symptoms may resemble multiple sclerosis. 10% have associated bleeding in the brain.
Causes
"Primary" angiitis/vasculitis of the central nervous system (PACNS) is said to be present if there is no underlying cause. The exact mechanism of the primary disease is unknown, but the fundamental mechanism of all vasculitides is autoimmunity. Other possible secondary causes of cerebral vasculitis are infections, systemic auto-immune diseases such as systemic lupus erythematosus (SLE) and rheumatoid arthritis, medications and drugs (amphetamine, cocaine and heroin), some forms of cancer (lymphomas, leukemia and lung cancer) and other forms of systemic vasculitis such as granulomatosis with polyangiitis, polyarteritis nodosa or Behçet's disease. It may imitate, and is in turn imitated by, a number of other diseases that affect the blood vessels of the brain diffusely such as fibromuscular dysplasia and thrombotic thrombocytopenic purpura.
Diagnosis
Cerebral angiography and magnetic resonance imaging, family medical history, symptoms, a complete physical examination, and ultimately biopsy of the brain, are often required for the diagnosis. Al |
https://en.wikipedia.org/wiki/Mia%27s%20Math%20Adventure%3A%20Just%20in%20Time%21 | Mia's Math Adventure: Just in Time! is the third title of the Mia's Big Adventure Collection software series created by Kutoka Interactive. Released in 2001 in Canada and the United States, the game teaches mathematics to children between 6 and 10 years old.
Adventure
Mia must travel back in time to prevent a terrible fire that has consumed her house. After helping Marty gather the parts to build a time-travelling machine, she returns in the past in order to discover the cause of the fire and prevent it from ever happening.
Activities
The game's 12 educational activities teach arithmetic (addition, subtraction, multiplication and division) geometry (circle, square, rectangle, triangle, closed and broken lines) logic, place value, fractions, measures, etc.
Critical reception
Mia's Math Adventure received positive reviews from the National Parenting Center, USA Today, MacAddict, ReviewCorner.com, Maccentral.com, Houston Chronicle, Chicago Parent, and Los Angeles Times.
Reception
The game received several awards from various organizations such as Parents' Choice, National Parenting Center, Coalition for Quality Children's Media and iParenting Media Award.
Notes
External links
Mia's Math Adventure at Kutoka.com
2001 video games
Mia series
Classic Mac OS games
Video games developed in Canada
Windows games
Children's educational video games
Mathematical education video games
Video games about mice and rats |
https://en.wikipedia.org/wiki/Genome%20Research%20Foundation | Genome Research Foundation(게놈연구재단) also known as Genome Foundation is a non-profit research foundation and institute in Korea under the approval of the ministry of Education, Science, and Technology of Korea. It is a public research foundation with over 30 researchers and staff in 2011. It is a government accredited public charity organization.
GRF was established on 19 April 2010 and since then it has taken research in genomics and bioinformatics. Its main research institute is PGI (Personal Genomics Institute) which performs research in genomics area for the general public and by the general public. In 2017, GRF has established a Cardiovasculomics Institute (CVI) to research on the omics of cardiovascular diseases as a sister institute of PGI.
Research in GRF
KoVariome: The Korean Reference Database of Variome. 2018
Projects of GRF
The Korean Genome Project: KGP KGP home page
KoVariome: The Korean Reference Variome KoVariome Homepage
Organization of GRF
Personal Genomics Institute
Geromics Institute
Cardiovascularomics Institute
External links
Genome Research Foundation home page
Genomics |
https://en.wikipedia.org/wiki/Inflammatory%20demyelinating%20diseases%20of%20the%20central%20nervous%20system | Inflammatory demyelinating diseases (IDDs), sometimes called Idiopathic (IIDDs) due to the unknown etiology of some of them, are a heterogenous group of demyelinating diseases - conditions that cause damage to myelin, the protective sheath of nerve fibers - that occur against the background of an acute or chronic inflammatory process. IDDs share characteristics with and are often grouped together under Multiple Sclerosis. They are sometimes considered different diseases from Multiple Sclerosis, but considered by others to form a spectrum differing only in terms of chronicity, severity, and clinical course.
Multiple sclerosis for some people is a syndrome more than a single disease. As of 2019, three auto-antibodies have been found in atypical MS giving birth to separate diseases: Anti-AQP4 diseases, Anti-MOG and Anti-NF spectrums. A LHON-associated MS has also been reported, and in addition there have been inconclusive reports of TNF-α blockers inducing demyelinating disorders.
The subject is under intense research and the list of MS autoantibodies is expected to grow in the near future.
Separated variants
Several previous MS variants have been recently separated from MS after the discovery of a specific auto-antibody. Those autoantibodies are currently anti-AQP4, anti-MOG and some anti-Neurofascins.
The pathogenic mechanism is usually not related to the clinical course. Therefore, one given pathogenic underlying condition can yield several clinical diseases, and one disease can be produced by several pathogenic conditions.
These conditions can appear as Neuromyelitis optica (NMO), and its associated "spectrum of disorders" (NMOSD), currently considered a common syndrome for several separated diseases but with some still idiopathic subtypes. Some researchers think that there could exist an overlapping between Anti-NMDA receptor encephalitis cases and neuromyelitis optica or acute disseminated encephalomyelitis.
Anti-AQP4 spectrum
See Anti-AQP4 diseases
Origin |
https://en.wikipedia.org/wiki/Egg%20incubation | Egg incubation is the process by which an egg, of oviparous (egg-laying) animals, develops an embryo within the egg, after the egg's formation and ovipositional release. Egg incubation is done under favorable environmental conditions, possibly by brooding and hatching the egg.
Multiple and various factors are vital to the incubation of various species of animal. In many species of reptile for example, no fixed temperature is necessary, but the actual temperature determines the sex ratio of the offspring. In birds in contrast, the sex of offspring is genetically determined, but in many species a constant and particular temperature is necessary for successful incubation. Especially in poultry, the act of sitting on eggs to incubate them is called brooding. The action or behavioral tendency to sit on a clutch of eggs is also called broodiness, and most egg-laying breeds of poultry have had this behavior selectively bred out of them to increase production.
Avian incubation
A wide range of incubation habits is displayed among birds. In warm-blooded species such as bird species generally, body heat from the brooding patch of the brooding parent provides the constant temperature. Several groups, notably the megapodes, instead use heat generated from rotting vegetable material, effectively creating a giant compost heap while crab plovers make partial use of heat from the sun. The Namaqua sandgrouse of the deserts of southern Africa, needing to keep its eggs cool during the heat of the day, stands over them drooping its wings to shade them. The humidity is also critical, because if the air is too dry the egg will lose too much water to the atmosphere, which can make hatching difficult or impossible. As incubation proceeds, an egg will normally become lighter, and the air space within the egg will normally become larger, owing to evaporation from the egg.
Experiments with great tits show that females compensate for the potential effects of differential heating by moving th |
https://en.wikipedia.org/wiki/138th%20meridian%20west | The meridian 138° west of Greenwich is a line of longitude that extends from the North Pole across the Arctic Ocean, North America, the Pacific Ocean, the Southern Ocean, and Antarctica to the South Pole.
The 138th meridian west forms a great circle with the 42nd meridian east.
From Pole to Pole
Starting at the North Pole and heading south to the South Pole, the 138th meridian west passes through:
{| class="wikitable plainrowheaders"
! scope="col" width="130" | 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;" | Beaufort Sea
| style="background:#b0e0e6;" |
|-valign="top"
|
! scope="row" |
| Yukon British Columbia — from
|-
|
! scope="row" |
| Alaska
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Pacific Ocean
| style="background:#b0e0e6;" |
|-
| style="background:#b0e0e6;" |
! scope="row" style="background:#b0e0e6;" | Southern Ocean
| style="background:#b0e0e6;" |
|-
|
! scope="row" | Antarctica
| Unclaimed territory
|-
|}
See also
137th meridian west
139th meridian west
w138 meridian west |
https://en.wikipedia.org/wiki/Quantum%20tunnelling%20composite | Quantum tunnelling composites (QTCs) are composite materials of metals and non-conducting elastomeric binder, used as pressure sensors. They use quantum tunnelling: without pressure, the conductive elements are too far apart to conduct electricity; when pressure is applied, they move closer and electrons can tunnel through the insulator. The effect is far more pronounced than would be expected from classical (non-quantum) effects alone, as classical electrical resistance is linear (proportional to distance), while quantum tunnelling is exponential with decreasing distance, allowing the resistance to change by a factor of up to 1012 between pressured and unpressured states.
Quantum tunneling composites hold multiple designations in specialized literature, such as: conductive/semi-conductive polymer composite, piezo-resistive sensor and force-sensing resistor (FSR). However, in some cases Force-sensing resistors may operate predominantly under percolation regime; this implies that the composite resistance grows for an incremental applied stress or force.
Introduction
QTCs were discovered in 1996 by technician David Lussey while he was searching for a way to develop an electrically conductive adhesive. Lussey founded Peratech Ltd, a company devoted to research work and usage of QTCs. Peratech Ltd. and other companies are working on developing quantum tunneling composite to improve touch technology. Currently, there is restricted use of QTC due to its high cost, but eventually this technology is expected to become available to the general user. Quantum tunneling composites are combinations of polymer composites with elastic, rubber-like properties elastomer, and metal particles (nickel). Due to a no-air gap in the sensor contamination or interference between the contact points is impossible. There is also little to no chance of arcing, electrical sparks between contact points. In the QTC's inactive state, the conductive elements are too far from one another to pass |
https://en.wikipedia.org/wiki/Gray%20molasses | Gray molasses is a method of sub-Doppler laser cooling of atoms. It employs principles from Sisyphus cooling in conjunction with a so-called "dark" state whose transition to the excited state is not addressed by the resonant lasers. Ultracold atomic physics experiments on atomic species with poorly-resolved hyperfine structure, like isotopes of lithium
and potassium,
often utilize gray molasses instead of Sisyphus cooling as a secondary cooling stage after the ubiquitous magneto-optical trap (MOT) to achieve temperatures below the Doppler limit. Unlike a MOT, which combines a molasses force with a confining force, a gray molasses can only slow but not trap atoms; hence, its efficacy as a cooling mechanism lasts only milliseconds before further cooling and trapping stages must be employed.
Overview
Like Sisyphus cooling, the cooling mechanism of gray molasses relies on a two-photon Raman-type transition between two hyperfine-split ground states mediated by an excited state. Orthogonal superpositions of these ground states constitute "bright" and "dark" states, so called since the former couples to the excited state via dipole transitions driven by the laser, and the latter is only accessible via spontaneous emission from the excited state. As neither are eigenstates of the kinetic energy operator, the dark state also evolves into the bright state with frequency proportional to the atom's external momentum. Gradients in the polarization of the molasses beam create a sinusoidal potential energy landscape for the bright state in which atoms lose kinetic energy by traveling "uphill" to potential energy maxima that coincide with circular polarizations capable of executing electric dipole transitions to the excited state. Atoms in the excited state are then optically pumped to the dark state and subsequently evolve back to the bright state to restart the cycle. Alternately, the pair of bright and dark ground states can be generated by electromagnetically-induced transpar |
https://en.wikipedia.org/wiki/Pro-simplicial%20set | In mathematics, a pro-simplicial set is an inverse system of simplicial sets.
A pro-simplicial set is called pro-finite if each term of the inverse system of simplicial sets has finite homotopy groups.
Pro-simplicial sets show up in shape theory, in the study of localization and completion in homotopy theory, and in the study of homotopy properties of schemes (e.g. étale homotopy theory). |
https://en.wikipedia.org/wiki/Entropy%20in%20thermodynamics%20and%20information%20theory | The mathematical expressions for thermodynamic entropy in the statistical thermodynamics formulation established by Ludwig Boltzmann and J. Willard Gibbs in the 1870s are similar to the information entropy by Claude Shannon and Ralph Hartley, developed in the 1940s.
Equivalence of form of the defining expressions
The defining expression for entropy in the theory of statistical mechanics established by Ludwig Boltzmann and J. Willard Gibbs in the 1870s, is of the form:
where is the probability of the microstate i taken from an equilibrium ensemble, and is the Boltzmann's constant.
The defining expression for entropy in the theory of information established by Claude E. Shannon in 1948 is of the form:
where is the probability of the message taken from the message space M, and b is the base of the logarithm used. Common values of b are 2, Euler's number , and 10, and the unit of entropy is shannon (or bit) for b = 2, nat for b = , and hartley for b = 10.
Mathematically H may also be seen as an average information, taken over the message space, because when a certain message occurs with probability pi, the information quantity −log(pi) (called information content or self-information) will be obtained.
If all the microstates are equiprobable (a microcanonical ensemble), the statistical thermodynamic entropy reduces to the form, as given by Boltzmann,
where W is the number of microstates that corresponds to the macroscopic thermodynamic state. Therefore S depends on temperature.
If all the messages are equiprobable, the information entropy reduces to the Hartley entropy
where is the cardinality of the message space M.
The logarithm in the thermodynamic definition is the natural logarithm. It can be shown that the Gibbs entropy formula, with the natural logarithm, reproduces all of the properties of the macroscopic classical thermodynamics of Rudolf Clausius. (See article: Entropy (statistical views)).
The logarithm can also be taken to the natural base |
https://en.wikipedia.org/wiki/Transepidermal%20water%20loss | Transepidermal water loss (TEWL or TWL) is the loss of water that passes from inside a body (animal or plant) through the epidermis (that is, either the epidermal layer of animal skin or the epidermal layer of plants) to the surrounding atmosphere via diffusion and evaporation processes. TEWL in mammals is also known as insensible water loss (IWL), as it is a process over which organisms have little physiologic control and of which they are usually mostly unaware. Insensible loss of body water can threaten fluid balance; in humans, substantial dehydration sometimes occurs before a person realizes what is happening.
Measurements of TEWL may be useful for identifying skin damage caused by certain chemicals, physical insult (such as "tape stripping") or pathological conditions such as eczema, as rates of TEWL increase in proportion to the level of damage. However, TEWL is also affected by environmental factors such as humidity, temperature, the time of year (season variation) and the moisture content of the skin (hydration level). Therefore, care must be taken when interpreting the meaning of TEWL rates.
Implications
Human health
From a clinical standpoint, TEWL measurements are of great importance in evaluating skin barrier functionality. Often normal rates of TEWL – from 2.3 g/(m2h) to 44 g/(m2h) – are compromised due to injury, infection and/or severe damage as in the case of burns causing rates over 50 or even over 100 g/m2/h. Damage to the stratum corneum and superficial skin layers not only results in physical vulnerability, but also results in an excess rate of water loss. Therefore, dehydration, metabolic acidosis, and conditions such as anhydremia or concentration of the blood are often critical issues for healthcare providers to consider in the treatment of burn patients.
TEWL is of major concern in public health, considering the relatively high rate of burn incidence among communities in the developing world due to poor quality cooking stoves. Resourc |
https://en.wikipedia.org/wiki/70%20%28number%29 | 70 (seventy) is the natural number following 69 and preceding 71.
In mathematics
70 is:
a sphenic number because its factors are 3 distinct primes.
a Pell number.
the seventh pentagonal number.
the fourth tridecagonal number.
the fifth pentatope number.
the number of ways to choose 4 objects out of 8 if order does not matter. This makes it a central binomial coefficient.
the smallest weird number, a natural number that is abundant but not semiperfect.
a palindromic number in bases 9 (779), 13 (5513) and 34 (2234).
a Harshad number in bases 6, 8, 9, 10, 11, 13, 14, 15 and 16.
an Erdős–Woods number, since it is possible to find sequences of 70 consecutive integers such that each inner member shares a factor with either the first or the last member.
The sum of the first 24 squares starting from 1 is 70 = 4900, i.e. a square pyramidal number. This is the only non trivial solution to the cannonball problem and relates 70 to the Leech lattice and thus string theory.
In science
70 is the atomic number of ytterbium, a lanthanide
Astronomy
Messier object M70, a magnitude 9.0 globular cluster in the constellation Sagittarius
The New General Catalogue object NGC 70, a magnitude 13.4 spiral galaxy in the constellation Andromeda
In religion
In Jewish tradition:
Seventy souls went down to Egypt to begin the Hebrews' Egyptian exile ().
There is a core of 70 nations and 70 world languages, paralleling the 70 names in the Table of Nations.
There were 70 men in the Great Sanhedrin, the Supreme Court of ancient Israel. (Sanhedrin 1:4.)
According to the Jewish Aggada, there are 70 perspectives ("faces") to the Torah (Numbers Rabbah 13:15).
Seventy elders were assembled by Moses on God's command in the desert ().
allots three score and ten (70 years) for a man's life, and the Mishnah attributes that age to "strength" (Avot 5:32), as one who survives that age is described by the verse as "the strong".
Ptolemy II Philadelphus ordered 72 Jewish elders to translate t |
https://en.wikipedia.org/wiki/Daniel%20John%20Cunningham | Daniel John Cunningham, (15 April 1850 – 23 July 1909) was a Scottish physician, zoologist, and anatomist, famous for Cunningham's Text-book of Anatomy and Cunningham's Manual of Practical Anatomy.
Biography
Cunningham was born in the manse at Crieff, the son of the Very Rev John Cunningham (1819–1893) and of his wife Susan Porteous Murray. His father became Moderator of the General Assembly in 1886.
Following education at Crieff Academy he studied medicine at the University of Edinburgh, where he qualified as Bachelor of Medicine and Master of Surgery (M.B. C.M.) with first class honours in 1874 and attained his M.D. in 1876, receiving a gold medal for his thesis. From 1876 until 1882 he acted as a demonstrator for his professor at the university. After one year as Professor of Anatomy at the Royal College of Surgeons of Ireland (in Dublin) he moved to the chair of Anatomy at Trinity College, Dublin, which he held from 1883 to 1903. On the appointment of Sir William Turner to the post of Principal and Vice-Chancellor at the University of Edinburgh he was invited to succeed him as Professor of Anatomy and he held that post from 1903 until his death. His Text-book of Anatomy, first published in 1902, went through 15 editions under various editors: the first three editions were prepared under Cunningham's editorship.
He was at various times president of the Royal Zoological Society of Ireland, secretary and vice-president of the Royal Dublin Society and president of the Anatomical Society (1893–95). Cunningham was also editor of the Journal of Anatomy between 1900 and 1907. He was elected a fellow of the Royal College of Surgeons of Ireland, the Royal College of Surgeons of Edinburgh, the Royal Society (1891) and the Royal Society of Edinburgh.
In 1878 he was elected a fellow of the Royal Society of Edinburgh. His proposers were Sir William Turner, John Hutton Balfour, Alexander Crum Brown, and James Bryce. In 1904 he was elected a member of the Aesculapian Club |
https://en.wikipedia.org/wiki/European%20Collection%20of%20Authenticated%20Cell%20Cultures | The European Collection of Authenticated Cell Cultures houses and supplies cell lines.
It is part of the Culture Collections of Public Health England. The collection is held in Porton Down.
ECACC, which was established in 1985, consists of a team with specialist knowledge which supply authenticated cell lines, induced Pluripotent stem cells (iPSCs) and nucleic acids to provide stock for the research community. ECACC is one of the first collections of authenticated cell cultures worldwide and now holds cell lines from 45 species including 50 tissue types, 300 HLA types, over 800 genetic disorders and roughly 450 monoclonal antibodies.
ECACC products are trademarked with Public Health England and the trademark cannot be used without a licence agreement which can be requested through contact with PHE Culture Collections. All ECACC products can be found at the culture collections website alongside a range of services such as Mycoplasma testing and training courses for cell culture. |
https://en.wikipedia.org/wiki/Gamma%20spectroscopy | Gamma-ray spectroscopy is the qualitative study of the energy spectra of gamma-ray sources, such as in the nuclear industry, geochemical investigation, and astrophysics. Gamma-ray spectrometry, on the other hand, is the method used to acquire a quantitative spectrum measurement.
Most radioactive sources produce gamma rays, which are of various energies and intensities. When these emissions are detected and analyzed with a spectroscopy system, a gamma-ray energy spectrum can be produced.
A detailed analysis of this spectrum is typically used to determine the identity and quantity of gamma emitters present in a gamma source, and is a vital tool in radiometric assay. The gamma spectrum is characteristic of the gamma-emitting nuclides contained in the source, just like in an optical spectrometer, the optical spectrum is characteristic of the material contained in a sample.
Gamma ray characteristics
Gamma rays are the highest-energy form of electromagnetic radiation, being physically the same as all other forms (e.g., X-rays, visible light, infrared, radio) but having (in general) higher photon energy due to their shorter wavelength. Because of this, the energy of gamma-ray photons can be resolved individually, and a gamma-ray spectrometer can measure and display the energies of the gamma-ray photons detected.
Radioactive nuclei (radionuclides) commonly emit gamma rays in the energy range from a few keV to ~10 MeV, corresponding to the typical energy levels in nuclei with reasonably long lifetimes. Such sources typically produce gamma-ray "line spectra" (i.e., many photons emitted at discrete energies), whereas much higher energies (upwards of 1 TeV) may occur in the continuum spectra observed in astrophysics and elementary particle physics. The difference between gamma rays and X-rays is somewhat blurred. Gamma rays are always from nuclear energy level transitions of atoms and are mono energetic, whereas X-rays are electrically generated (X-ray tube, linear accel |
https://en.wikipedia.org/wiki/Instantaneously%20trained%20neural%20networks | Instantaneously trained neural networks are feedforward artificial neural networks that create a new hidden neuron node for each novel training sample. The weights to this hidden neuron separate out not only this training sample but others that are near it, thus providing generalization. This separation is done using the nearest hyperplane that can be written down instantaneously. In the two most important implementations the neighborhood of generalization either varies with the training sample (CC1 network) or remains constant (CC4 network). These networks use unary coding for an effective representation of the data sets.
This type of network was first proposed in a 1993 paper of Subhash Kak. Since then, instantaneously trained neural networks have been proposed as models of short term learning and used in web search, and financial time series prediction applications. They have also been used in instant classification of documents and for deep learning and data mining.
As in other neural networks, their normal use is as software, but they have also been implemented in hardware using FPGAs and by optical implementation.
CC4 network
In the CC4 network, which is a three-stage network, the number of input nodes is one more than the size of the training vector, with the extra node serving as the biasing node whose input is always 1. For binary input vectors, the weights from the input nodes to the hidden neuron (say of index j) corresponding to the trained vector is given by the following formula:
where is the radius of generalization and is the Hamming weight (the number of 1s) of the binary sequence. From the hidden layer to the output layer the weights are 1 or -1 depending on whether the vector belongs to a given output class or not. The neurons in the hidden and output layers output 1 if the weighted sum to the input is 0 or positive and 0, if the weighted sum to the input is negative:
Other networks
The CC4 network has also been modified to include non-bina |
https://en.wikipedia.org/wiki/Sulfidation | Sulfidation (British spelling also sulphidation) is a process of installing sulfide ions in a material or molecule. The process is widely used to convert oxides to sulfides but is also related to corrosion and surface modification.
Inorganic, materials, and organic chemistry
Sulfidation is relevant to the formation of sulfide minerals.
A large scale application of sulfidation is the conversion of molybdenum oxides to the corresponding sulfides. This conversion is a step in the preparation of catalysts for hydrodesulfurization wherein alumina impregnated with molybdate salts are converted to molybdenum disulfide by the action of hydrogen sulfide.
In organosulfur chemistry, sulfiding is often called thiation. The preparation of thioamides from amides involves thiation. A typical reagent is phosphorus pentasulfide (P4S10). The idealized equation for this conversion is:
RC(O)NH2 + 1/4 P4S10 → RC(S)NH2 + 1/4 P4S6O4
This conversion where an oxygen atom in the amide function is replaced by a sulfur atom involves no redox reaction.
Sulfidation of metals
It is known that aluminum improves the sulfidation resistance of iron alloys.
The sulfidation of tungsten is a multiple step process. The first step is an oxidation reaction, converting the tungsten to a tungsten bronze on the surface of the object. The tungsten bronze coating is then converted to a sulfide.
One commonly encountered occurrence of sulfidation in manufacturing environments involves the sulfidic corrosion of metal piping. The increased resistance to corrosion found in stainless steel is attributed to a layer of chromium oxide that forms due to oxidation of the chromium found in the alloy.
The process of liquid sulfidation has also been used in the manufacturing of diamond-like carbon films. These films are generally used to coat surfaces to reduce the wear due to friction. The inclusion of sulfidation in the process has been shown to reduce the friction coefficient of the diamond-like car |
https://en.wikipedia.org/wiki/Occurrences%20of%20Grandi%27s%20series | This article lists occurrences of the paradoxical infinite "sum" +1 -1 +1 -1 ... , sometimes called Grandi's series.
Parables
Guido Grandi illustrated the series with a parable involving two brothers who share a gem.
Thomson's lamp is a supertask in which a hypothetical lamp is turned on and off infinitely many times in a finite time span. One can think of turning the lamp on as adding 1 to its state, and turning it off as subtracting 1. Instead of asking the sum of the series, one asks the final state of the lamp.
One of the best-known classic parables to which infinite series have been applied, Achilles and the tortoise, can also be adapted to the case of Grandi's series.
Numerical series
The Cauchy product of Grandi's series with itself is 1 − 2 + 3 − 4 + · · ·.
Several series resulting from the introduction of zeros into Grandi's series have interesting properties; for these see Summation of Grandi's series#Dilution.
Grandi's series is just one example of a divergent geometric series.
The rearranged series 1 − 1 − 1 + 1 + 1 − 1 − 1 + · · · occurs in Euler's 1775 treatment of the pentagonal number theorem as the value of the Euler function at q = 1.
Power series
The power series most famously associated with Grandi's series is its ordinary generating function,
Fourier series
Hyperbolic sine
In his 1822 Théorie Analytique de la Chaleur, Joseph Fourier obtains what is currently called a Fourier sine series for a scaled version of the hyperbolic sine function,
He finds that the general coefficient of sin nx in the series is
For n > 1 the above series converges, while the coefficient of sin x appears as 1 − 1 + 1 − 1 + · · · and so is expected to be 1⁄2. In fact, this is correct, as can be demonstrated by directly calculating the Fourier coefficient from an integral:
Dirac comb
Grandi's series occurs more directly in another important series,
At x = , the series reduces to −1 + 1 − 1 + 1 − · · · and so one might expect it to meaningfully equal −1⁄2. In |
https://en.wikipedia.org/wiki/Earthquake%20map | In hyperbolic geometry, an earthquake map is a method of changing one hyperbolic manifold into another, introduced by .
Earthquake maps
Given a simple closed geodesic on an oriented hyperbolic surface and a real number t, one can cut the manifold along the geodesic, slide the edges a distance t to the left, and glue them back. This gives a new hyperbolic surface, and the (possibly discontinuous) map between them is an example of a left earthquake.
More generally one can do the same construction with a finite number of disjoint simple geodesics, each with a real number attached to it. The result is called a simple earthquake.
An earthquake is roughly a sort of limit of simple earthquakes, where one has an infinite number of geodesics, and instead of attaching a positive real number to each geodesic one puts a measure on them.
A geodesic lamination of a hyperbolic surface is a closed subset with a foliation by geodesics. A left earthquake E consists of a map between copies of the hyperbolic plane with geodesic laminations, that is an isometry from each stratum of the foliation to a stratum. Moreover, if A and B are two strata then EE is a hyperbolic transformation whose axis separates A and B and which translates to the left, where EA is the isometry of the whole plane that restricts to E on A, and likewise for B.
Earthquake theorem
Thurston's earthquake theorem states that for any two points x, y of a Teichmüller space there is a unique left earthquake from x to y. It was proved by William Thurston in a course in Princeton in 1976–1977, but at the time he did not publish it, and the first published statement and proof was given by , who used it to solve the Nielsen realization problem. |
https://en.wikipedia.org/wiki/Particle%20identification | Particle identification is the process of using information left by a particle passing through a particle detector to identify the type of particle. Particle identification reduces backgrounds and improves measurement resolutions, and is essential to many analyses at particle detectors.
Charged particles
Charged particles have been identified using a variety of techniques. All methods rely on a measurement of the momentum in a tracking chamber combined with a measurement of the velocity to determine the charged particle mass, and therefore its identity.
Specific ionization
A charged particle loses energy in matter by ionization at a rate determined in part by its velocity. The energy loss per unit distance is typically called dE/dx. The energy loss is measured either in dedicated detectors, or in tracking chambers designed to also measure energy loss. The energy lost in a thin layer of material is subject to large fluctuations, and therefore accurate dE/dx determination requires a large number of measurements. Individual measurements in the low and high energy tails are excluded.
Time of flight
Time of flight detectors determine charged particle velocity by measuring the time required to travel from the interaction point to the time of flight detector, or between two detectors. The ability to distinguish particle types diminishes as the particle velocity approaches its maximum allowed value, speed of light, and thus is efficient only for particles with a small Lorentz factor.
Cherenkov detectors
Cherenkov radiation is emitted by a charged particle when it passes through a material with a speed greater than c/n, where n is the index of refraction of the material. The angle of the photons with respect to the charged particle direction depends on velocity. A number of Cherenkov detector geometries have been used.
Photons
Photons are identified because they leave all their energy in a detector's electromagnetic calorimeter, but do not appear in the trackin |
https://en.wikipedia.org/wiki/Hurwitz%20zeta%20function | In mathematics, the Hurwitz zeta function is one of the many zeta functions. It is formally defined for complex variables with and by
This series is absolutely convergent for the given values of and and can be extended to a meromorphic function defined for all . The Riemann zeta function is . The Hurwitz zeta function is named after Adolf Hurwitz, who introduced it in 1882.
Integral representation
The Hurwitz zeta function has an integral representation
for and (This integral can be viewed as a Mellin transform.) The formula can be obtained, roughly, by writing
and then interchanging the sum and integral.
The integral representation above can be converted to a contour integral representation
where is a Hankel contour counterclockwise around the positive real axis, and the principal branch is used for the complex exponentiation . Unlike the previous integral, this integral is valid for all s, and indeed is an entire function of s.
The contour integral representation provides an analytic continuation of to all . At , it has a simple pole with residue .
Hurwitz's formula
The Hurwitz zeta function satisfies an identity which generalizes the functional equation of the Riemann zeta function:
valid for Re(s) > 1 and 0 < a ≤ 1. The Riemann zeta functional equation is the special case a = 1:
Hurwitz's formula can also be expressed as
(for Re(s) < 0 and 0 < a ≤ 1).
Hurwitz's formula has a variety of different proofs. One proof uses the contour integration representation along with the residue theorem. A second proof uses a theta function identity, or equivalently Poisson summation. These proofs are analogous to the two proofs of the functional equation for the Riemann zeta function in Riemann's 1859 paper. Another proof of the Hurwitz formula uses Euler–Maclaurin summation to express the Hurwitz zeta function as an integral
(−1 < Re(s) < 0 and 0 < a ≤ 1) and then expanding the numerator as a Fourier series.
Functional equation for rational a
When a is a |
https://en.wikipedia.org/wiki/List%20of%20flags%20of%20Norfolk%20Island | The Following is a List of Flags used in Norfolk Island in Australia.
State Flag
Historical Flags
See also
List of Australian flags |
https://en.wikipedia.org/wiki/Dukhin%20number | The Dukhin number () is a dimensionless quantity that characterizes the contribution of the surface conductivity to various electrokinetic and electroacoustic effects, as well as to electrical conductivity and permittivity of fluid heterogeneous systems. The number was named after Stanislav and Andrei Dukhin.
Overview
It was introduced by Lyklema in “Fundamentals of Interface and Colloid Science”. A recent IUPAC Technical Report used this term explicitly and detailed several means of measurement in physical systems.
The Dukhin number is a ratio of the surface conductivity to the fluid bulk electrical conductivity Km multiplied by particle size a:
There is another expression of this number that is valid when the surface conductivity is associated only with ions motion above the slipping plane in the double layer. In this case, the value of the surface conductivity depends on ζ-potential, which leads to the following expression for the Dukhin number for symmetrical electrolyte with equal ions diffusion coefficient:
where the parameter m characterizes the contribution of electro-osmosis into motion of ions within the double layer
F is Faraday constant
T is absolute temperature
R is gas constant
C is ions concentration in bulk
z is ion valency
ζ is electrokinetic potential
ε0 is vacuum dielectric permittivity
εm is fluid dielectric permittivity
η is dynamic viscosity
D is diffusion coefficient |
https://en.wikipedia.org/wiki/Dsup | Dsup (contraction of damage suppressor) is a DNA-associating protein, unique to the tardigrade, that suppresses the occurrence of DNA breaks by radiation. When human HEK293 cells were engineered with Dsup proteins, they showed approximately 40% more tolerance against X-ray radiation.
Tardigrades can withstand 1,000 times more radiation than other animals, median lethal doses of 5,000 Gy (of gamma rays) and 6,200 Gy (of heavy ions) in hydrated animals (5 to 10 Gy could be fatal to a human). The only explanation found in earlier experiments for this ability was that their lowered water state provides fewer reactants for ionizing radiation. However, subsequent research found that tardigrades, when hydrated, still remain highly resistant to shortwave UV radiation in comparison to other animals, and that one factor for this is their ability to efficiently repair damage to their DNA resulting from that exposure. A landmark study on Dsup protein showed that it can bind nucleosomes in the cell and protect DNA.
The Dsup protein has been tested on other animal cells. Using a culture of human cells that express the Dsup protein, it was found that after X-ray exposure the cells had fewer DNA breaks than control cells.
After hydrogen peroxide treatment Dsup+ cells mainly activate the detoxification systems and the antioxidant enzymes that limit oxidative stress and eliminate oxidative free radicals, while DNA repair mechanisms are only marginally activated. Thus, upon induction of oxidative stress Dsup protein appears to mainly protect DNA directly.
Function and structure
The Dsup from Ramazzottius varieornatus is mainly used for study, since it is one of the most stress-tolerant species. Orthologous versions of Dsup are also found in Hypsibius exemplaris (OQV24709, ). Dsup does not exhibit a lot of secondary structure, save for the helix in the middle. The C-terminal half contains an NLS, and this Ala/Gly-rich half is sufficient for DNA binding. It is probably mostly diso |
https://en.wikipedia.org/wiki/Uniformly%20Cauchy%20sequence | In mathematics, a sequence of functions from a set S to a metric space M is said to be uniformly Cauchy if:
For all , there exists such that for all : whenever .
Another way of saying this is that as , where the uniform distance between two functions is defined by
Convergence criteria
A sequence of functions {fn} from S to M is pointwise Cauchy if, for each x ∈ S, the sequence {fn(x)} is a Cauchy sequence in M. This is a weaker condition than being uniformly Cauchy.
In general a sequence can be pointwise Cauchy and not pointwise convergent, or it can be uniformly Cauchy and not uniformly convergent. Nevertheless, if the metric space M is complete, then any pointwise Cauchy sequence converges pointwise to a function from S to M. Similarly, any uniformly Cauchy sequence will tend uniformly to such a function.
The uniform Cauchy property is frequently used when the S is not just a set, but a topological space, and M is a complete metric space. The following theorem holds:
Let S be a topological space and M a complete metric space. Then any uniformly Cauchy sequence of continuous functions fn : S → M tends uniformly to a unique continuous function f : S → M.
Generalization to uniform spaces
A sequence of functions from a set S to a uniform space U is said to be uniformly Cauchy if:
For all and for any entourage , there exists such that whenever .
See also
Modes of convergence (annotated index)
Functional analysis
Convergence (mathematics) |
https://en.wikipedia.org/wiki/Edward%20George%20Effros | Edward George Effros (December 10, 1935, Queens, New York City – December 21, 2019, Portland, Oregon) was an American mathematician, specializing in operator algebras and representation theory. His research included
"C*-algebras theory and operator algebras, descriptive set theory, Banach space theory, and quantum information."
Biography
Edward Effros grew up in Great Neck, New York. He finished his undergraduate study in three years at Massachusetts Institute of Technology and received his Ph.D. from Harvard University in 1962. His thesis On Representations of -algebras was supervised by George Mackey. Effros was a postdoc at Columbia University and then became a faculty member at the University of Pennsylvania. Effros married Rita Brickman in 1967. Their two children, Rachel and Stephen, were born in Philadelphia. In 1980 Edward Effros became a full professor at the University of California at Los Angeles (UCLA), and in 1979 the family relocated to Los Angeles. Rita Brickman Effros received her Ph.D. in immunology from the University of Pennsylvania. Eventually, she became a professor of pathology and laboratory medicine at the David Geffen School of Medicine at UCLA. In 2013 Edward Effros retired from UCLA as professor emeritus.
He was a Guggenheim Fellow for the academic year 1982–1983. In 1986 he was an invited speaker at the International Congress of Mathematicians in Berkeley, California. He was the author or coauthor of over 80 publications and supervised the doctoral dissertations of 16 students, including Patricia Clark Kenschaft. He was elected to the 2014 Class of Fellows of the American Mathematical Society.
According to Masamichi Takesaki,
Edward's older brother, Robert Carlton Effros (born 1933), became a lawyer and member of the legal department of the International Monetary Fund. Edward's identical twin, Richard M. Effros, graduated from NYU School of Medicine and became a pulmonologist. Edward was married to Rita née Brinkman for 52 years. The |
https://en.wikipedia.org/wiki/Gentleman%27s%20Relish | Gentleman's Relish is a British commercial brand of anchovy paste. It is also known as Patum Peperium (meaning 'pepper paste' in Latin). Created in 1828 by an Englishman named John Osborn, it is a savoury paste with a salty and slightly fishy taste, and contains salted anchovies (minimum 60%), butter, herbs and spices. Today, the secret recipe is withheld from all but one employee at Elsenham Quality Foods in Elsenham, England, the licensed manufacturer.
Uses
Gentleman's Relish is traditionally eaten very thinly spread on slices of hot buttered white-bread toast, either on its own, or with cucumber or "mustard and cress" sprouts. It can also be added to minced meat for a different-tasting cottage pie or to the mixture for fish cakes, potato cakes and croquettes. Alternatively it can be melted into scrambled eggs or be used as a topping for jacket potatoes. It is an ingredient in the dish Scotch woodcock.
Variations
Elsenham Quality Foods also make a similarly packaged product, Poacher's Relish, which is made from smoked salmon, butter, spices and lemon zest. Both types of relish are sold in plastic containers (pictured), and in more expensive but reusable and decorative traditional ceramic pots. Since 2008 a third variation, Angler's Relish, made from smoked mackerel, salted butter, lemon juice, vinegar, spices and other ingredients was introduced in commemorative packaging to mark the 180th anniversary of John Osborn's original creation. Both are also usually eaten on toast or savoury biscuits, in common with the original recipe.
See also
Garum
List of brand name condiments
Relish |
https://en.wikipedia.org/wiki/Eardrum | In the anatomy of humans and various other tetrapods, the eardrum, also called the tympanic membrane or myringa, is a thin, cone-shaped membrane that separates the external ear from the middle ear. Its function is to transmit sound from the air to the ossicles inside the middle ear, and then to the oval window in the fluid-filled cochlea. Hence, it ultimately converts and amplifies vibration in the air to vibration in cochlear fluid. The malleus bone bridges the gap between the eardrum and the other ossicles.
Rupture or perforation of the eardrum can lead to conductive hearing loss. Collapse or retraction of the eardrum can cause conductive hearing loss or cholesteatoma.
Structure
Orientation and relations
The tympanic membrane is oriented obliquely in the anteroposterior, mediolateral, and superoinferior planes. Consequently, its superoposterior end lies lateral to its anteroinferior end.
Anatomically, it relates superiorly to the middle cranial fossa, posteriorly to the ossicles and facial nerve, inferiorly to the parotid gland, and anteriorly to the temporomandibular joint.
Regions
The eardrum is divided into two general regions: the pars flaccida and the pars tensa.
The relatively fragile pars flaccida lies above the lateral process of the malleus between the notch of Rivinus and the anterior and posterior malleal folds. Consisting of two layers and appearing slightly pinkish in hue, it is associated with Eustachian tube dysfunction and cholesteatomas.
The larger pars tensa consists of three layers: skin, fibrous tissue, and mucosa. Its thick periphery forms a fibrocartilaginous ring called the annulus tympanicus or Gerlach's ligament. while the central umbo tents inward at the level of the tip of malleus. The middle fibrous layer, containing radial, circular, and parabolic fibers, encloses the handle of malleus. Though comparatively robust, the pars tensa is the region more commonly associated with perforations.
Umbo
The manubrium () of the malleus is f |
https://en.wikipedia.org/wiki/Russula%20risigallina | Russula risigallina is a species of mushroom. It was previously known as R. chamaeleontina. It is a small yellow russula that is edible and good-tasting, although identifying the species correctly can be difficult.
This mushroom can be found in various countries throughout Europe.
See also
List of Russula species |
https://en.wikipedia.org/wiki/Book%20of%20Optics | The Book of Optics (; or Perspectiva; ) is a seven-volume treatise on optics and other fields of study composed by the medieval Arab scholar Ibn al-Haytham, known in the West as Alhazen or Alhacen (965–c. 1040 AD).
The Book of Optics presented experimentally founded arguments against the widely held extramission theory of vision (as held by Euclid in his Optica), and proposed the modern intromission theory, the now accepted model that vision takes place by light entering the eye. The book is also noted for its early use of the scientific method, its description of the camera obscura, and its formulation of Alhazen's problem. The book extensively affected the development of optics, physics and mathematics in Europe between the 13th and 17th centuries.
Vision theory
Before the Book of Optics was written, two theories of vision existed. The extramission or emission theory was forwarded by the mathematicians Euclid and Ptolemy, who asserted that certain forms of radiation are emitted from the eyes onto the object which is being seen. When these rays reached the object they allowed the viewer to perceive its color, shape and size. An early version of the intromission theory, held by the followers of Aristotle and Galen, argued that sight was caused by agents, which were transmitted to the eyes from either the object or from its surroundings.
Al-Haytham offered many reasons against the extramission theory, pointing to the fact that eyes can be damaged by looking directly at bright lights, such as the sun. He wrote that the low probability that the eye can fill the entirety of space as soon as the eyelids are opened as an observer looks up into the night sky. Using the intromission theory as a foundation, he formed his own theory that an object emits rays of light from every point on its surface which then travel in all directions, thereby allowing some light into a viewer's eyes. According to this theory, the object being viewed is considered to be a compilation of an |
https://en.wikipedia.org/wiki/Nine%20Princes%20in%20Amber%20%28video%20game%29 | Nine Princes in Amber is an interactive fiction video game with graphics. The game was published by Telarium, a subsidiary of Spinnaker Software, in 1985. The game is based upon the fantasy novels Nine Princes in Amber and The Guns of Avalon by Roger Zelazny.
Gameplay
The single-player adventure is controlled via typed keyboard commands. Words and sentences are entered in a text parser. The player uses action commands (e.g. take, sit) and communication commands (e.g. ask, demand, hug) for the interaction with non-player characters. There are 40 different possible solutions to end the game.
Plot
The plot takes place in a fictional fantasy world. The player prince Corwin is the son of king Oberon, who rules the kingdom of Amber. Corwin wants to become king but his eight brothers, especially his brother Eric, are also interested in the throne of Amber. Prince Corwin must escape assassination attempts and intrigues enacted by his siblings, and yet must forge alliances with some of his siblings to become the reigning king of Amber.
Development
The adventure has static 2d graphics, a theme song and sound effects. It was implemented for the Commodore 64, DOS, Atari ST, MSX2 and Apple II. The MSX2 version is a translation into Spanish ("Nueve Principes en Amber") with new illustrations. The game is based upon the fantasy novels Nine Princes in Amber (Doubleday 1970) and The Guns of Avalon (Doubleday 1972) by Roger Zelazny. It was developed by a group of 20 people at Spinnaker Software and published by Telarium (1985). The design, writing, and game coding was done by Andrea Bird.
Reception
In 1986 a German reviewer called Nine Princes in Amber a precious adventure ("Edel-Adventure"). He praised the intelligent writing, the suspenseful storyline and the text parser.
In 2006 a study about the history of interactive fiction maintained, that on the one hand Nine Princes in Amber "is not a bad game – in fact, it is one of Telarium’s best, and working out the conversationa |
https://en.wikipedia.org/wiki/Transcription-translation%20coupling | Transcription-translation coupling is a mechanism of gene expression regulation in which synthesis of an mRNA (transcription) is affected by its concurrent decoding (translation). In prokaryotes, mRNAs are translated while they are transcribed. This allows communication between RNA polymerase, the multisubunit enzyme that catalyzes transcription, and the ribosome, which catalyzes translation. Coupling involves both direct physical interactions between RNA polymerase and the ribosome ("expressome" complexes), as well as ribosome-induced changes to the structure and accessibility of the intervening mRNA that affect transcription ("attenuation" and "polarity").
Significance
Bacteria depend on transcription-translation coupling for genome integrity, termination of transcription and control of mRNA stability. Consequently, artificial disruption of transcription-translation coupling impairs the fitness of bacteria. Without coupling, genome integrity is compromised as stalled transcription complexes interfere with DNA replication and induce DNA breaks. Lack of coupling produces premature transcription termination, likely due to increased binding of termination factor Rho. Degradation of prokaryotic mRNAs is accelerated by loss of coupled translation due to increased availability of target sites of RNase E. It has also been suggested that coupling of transcription with translation is an important mechanism of preventing formation of deleterious R-loops. While transcription-translation coupling is likely prevalent across prokaryotic organisms, not all species are dependent on it. Unlike Escherichia coli, in Bacillus subtilis transcription significantly outpaces translation, and coupling consequently does not occur.
Mechanisms
Translation promotes transcription elongation and regulates transcription termination. Functional coupling between transcription and translation is caused by direct physical interactions between the ribosome and RNA polymerase ("expressome complex"), |
https://en.wikipedia.org/wiki/Radical%20extension | In mathematics and more specifically in field theory, a radical extension of a field K is an extension of K that is obtained by adjoining a sequence of nth roots of elements.
Definition
A simple radical extension is a simple extension F/K generated by a single element satisfying for an element b of K. In characteristic p, we also take an extension by a root of an Artin–Schreier polynomial to be a simple radical extension. A radical series is a tower where each extension is a simple radical extension.
Properties
If E is a radical extension of F and F is a radical extension of K then E is a radical extension of K.
If E and F are radical extensions of K in an extension field C of K, then the compositum EF (the smallest subfield of C that contains both E and F) is a radical extension of K.
If E is a radical extension of F and E > K > F then E is a radical extension of K.
Solvability by radicals
Radical extensions occur naturally when solving polynomial equations in radicals. In fact a solution in radicals is the expression of the solution as an element of a radical series: a polynomial f over a field K is said to be solvable by radicals if there is a splitting field of f over K contained in a radical extension of K.
The Abel–Ruffini theorem states that such a solution by radicals does not exist, in general, for equations of degree at least five. Évariste Galois showed that an equation is solvable in radicals if and only if its Galois group is solvable. The proof is based on the fundamental theorem of Galois theory and the following theorem.
The proof is related to Lagrange resolvents. Let be a primitive nth root of unity (belonging to K). If the extension is generated by with as a minimal polynomial, the mapping induces a K-automorphism of the extension that generates the Galois group, showing the "only if" implication. Conversely, if is a K-automorphism generating the Galois group, and is a generator of the extension, let
The relation implies t |
https://en.wikipedia.org/wiki/Heronian%20mean | In mathematics, the Heronian mean H of two non-negative real numbers A and B is given by the formula
It is named after Hero of Alexandria.
Properties
Just like all means, the Heronian mean is symmetric (it does not depend on the order in which its two arguments are given) and idempotent (the mean of any number with itself is the same number).
The Heronian mean of the numbers A and B is a weighted mean of their arithmetic and geometric means:
Therefore, it lies between these two means, and between the two given numbers.
Application in solid geometry
The Heronian mean may be used in finding the volume of a frustum of a pyramid or cone. The volume is equal to the product of the height of the frustum and the Heronian mean of the areas of the opposing parallel faces.
A version of this formula, for square frusta, appears in the Moscow Mathematical Papyrus from Ancient Egyptian mathematics, whose content dates to roughly 1850 BC. |
https://en.wikipedia.org/wiki/List%20of%20centroids | The following is a list of centroids of various two-dimensional and three-dimensional objects. The centroid of an object in -dimensional space is the intersection of all hyperplanes that divide into two parts of equal moment about the hyperplane. Informally, it is the "average" of all points of . For an object of uniform composition, the centroid of a body is also its center of mass. In the case of two-dimensional objects shown below, the hyperplanes are simply lines.
2-D Centroids
For each two-dimensional shape below, the area and the centroid coordinates are given:
Where the centroid coordinates are marked as zero, the coordinates are at the origin, and the equations to get those points are the lengths of the included axes divided by two, in order to reach the center which in these cases are the origin and thus zero.
3-D Centroids
For each three-dimensional body below, the volume and the centroid coordinates are given:
See also
List of moments of inertia
List of second moments of area |
https://en.wikipedia.org/wiki/Gustav%20III%20of%20Sweden%27s%20coffee%20experiment | Gustav III of Sweden's coffee experiment was a purported twin study ordered by the king to study the health effects of coffee. The authenticity of the event has been questioned. The primitive medical study, supposedly conducted in the second half of the 18th century, failed to prove that coffee was a dangerous beverage.
Background
In Sweden coffee was banned by royal decree across three different reigns, in five separate periods between the 1750s and the 1820s: 1756–61, 1766–69, 1794–6, 1799–1802 and 1817–1823.
Coffee first arrived in Sweden around 1674, but was little used until the turn of the 18th century when it became fashionable among the wealthy. In 1746, a royal edict was issued against coffee and tea due to "the misuse and excesses of tea and coffee drinking". Heavy taxes were levied on consumption, and failure to pay the tax on the substance resulted in fines and confiscation of cups and dishes. Later, coffee was banned completely; despite the ban, consumption continued.
Gustav's father, Adolph Frederick had also been an opponent of stimulating drinks, signing the Misuse and Excesses Tea and Coffee Drinking Edict in 1760. Both Gustav III and his father had read and been strongly influenced by a 1715 treatise from a French physician on the dangers of what would later be identified as caffeine in tea and coffee.
Gustav III viewed coffee consumption as a threat to the public health and was determined to prove its negative health effects. To this end he ordered a scientific experiment to be carried out in what has been loosely referred to as the first clinical trial.
The experiment
The king ordered the experiment to be conducted using two identical twins. Both of the twins had been tried for the crimes they had committed and condemned to death. Their sentences were commuted to life imprisonment on the condition that one of the twins drink three pots of coffee, and the other drink the same amount of tea, every day for the rest of their lives.
The tea drin |
https://en.wikipedia.org/wiki/Intra-frame%20coding | Intra-frame coding is a data compression technique used within a video frame, enabling smaller file sizes and lower bitrates, with little or no loss in quality. Since neighboring pixels within an image are often very similar, rather than storing each pixel independently, the frame image is divided into blocks and the typically minor difference between each pixel can be encoded using fewer bits.
Intra-frame prediction exploits spatial redundancy, i.e. correlation among pixels within one frame, by calculating prediction values through extrapolation from already coded pixels for effective delta coding. It is one of the two classes of predictive coding methods in video coding. Its counterpart is inter-frame prediction which exploits temporal redundancy. Temporally independently coded so-called intra frames use only intra coding. The temporally coded predicted frames (e.g. MPEG's P- and B-frames) may use intra- as well as inter-frame prediction.
Usually only few of the spatially closest known samples are used for the extrapolation. Formats that operate sample by sample like Portable Network Graphics (PNG) can usually use one of four adjacent pixels (above, above left, above right, left) or some function of them like e.g. their average. Block-based (frequency transform) formats prefill whole blocks with prediction values extrapolated from usually one or two straight lines of pixels that run along their top and left borders.
The term intra-frame coding refers to the fact that the various lossless and lossy compression techniques are performed relative to information that is contained only within the current frame, and not relative to any other frame in the video sequence. In other words, no temporal processing is performed outside of the current picture or frame. Non-intra coding techniques are extensions to these basics. It turns out that this block diagram is very similar to that of a JPEG still image video encoder, with only slight implementation detail differences |
https://en.wikipedia.org/wiki/Mimicry%20in%20plants | In evolutionary biology, mimicry in plants is where a plant organism evolves to resemble another organism physically or chemically, increasing the mimic's Darwinian fitness. Mimicry in plants has been studied far less than mimicry in animals, with fewer documented cases and peer-reviewed studies. However, it may provide protection against herbivory, or may deceptively encourage mutualists, like pollinators, to provide a service without offering a reward in return.
Types of plant mimicry include Bakerian, where female flowers imitate males of the same species, Müllerian mimicry of the flower or fruit, where a plant mimics a rewarding flower (Dodsonian), luring pollinators by mimicking another species of flower, or fruit where feeders of the other species are attracted to a fake fruit to distribute seeds, Vavilovian, where a weed is unintentionally artificially selected to resemble a crop plant, Pouyannian, in which a flower imitates a female mate for a pollinating insect, Batesian, where a harmless species deter predators by mimicking the characteristics of a harmful species, and leaf mimicry, where a plant resembles a nearby plant to evade the attention of herbivores.
Bakerian
Bakerian mimicry, named after English naturalist Herbert Baker, is a form of automimicry or intraspecific mimicry that occurs within a single species. In plants, the female flowers mimic male flowers of their own species, cheating pollinators out of a reward. This reproductive mimicry may not be readily apparent as members of the same species may still exhibit some degree of sexual dimorphism, i.e. the phenotypic difference between males and females of the same species. It is common in many species of Caricaceae, a family of flowering plants in the order Brassicales, found primarily in tropical regions of Central and South America, and Africa.
Dodsonian
Dodsonian mimicry, named after American botanist, orchidologist, and taxonomist, Calaway H. Dodson, is a form of reproductive floral mi |
https://en.wikipedia.org/wiki/Existential%20theory%20of%20the%20reals | In mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of the form
where the variables are interpreted as having real number values, and where is a quantifier-free formula involving equalities and inequalities of real polynomials. A sentence of this form is true if it is possible to find values for all of the variables that, when substituted into formula , make it become true.
The decision problem for the existential theory of the reals is the problem of finding an algorithm that decides, for each such sentence, whether it is true or false. Equivalently, it is the problem of testing whether a given semialgebraic set is non-empty. This decision problem is NP-hard and lies in PSPACE, giving it significantly lower complexity than Alfred Tarski's quantifier elimination procedure for deciding statements in the first-order theory of the reals without the restriction to existential quantifiers. However, in practice, general methods for the first-order theory remain the preferred choice for solving these problems.
The complexity class has been defined to describe the class of computational problems that may be translated into equivalent sentences of this form. In structural complexity theory, it lies between NP and PSPACE. Many natural problems in geometric graph theory, especially problems of recognizing geometric intersection graphs and straightening the edges of graph drawings with crossings, belong to , and are complete for this class. Here, completeness means that there exists a translation in the reverse direction, from an arbitrary sentence over the reals into an equivalent instance of the given problem.
Background
In mathematical logic, a theory is a formal language consisting of a set of sentences written using a fixed set of symbols. The first-order theory of real closed fields has the following symbols:
the constants 0 and 1,
a countable collection of variables ,
th |
https://en.wikipedia.org/wiki/180%20%28video%20game%29 | 180 is a darts video game released for the ZX Spectrum, Commodore 64, Amstrad CPC, Atari 8-bit family in 1986 and MSX in 1987.
Gameplay
The player competes in 501 darts against other darts players waiting in a championship tournament with normal darts rules applying, subtracting your score from 501 to zero whilst finishing on a double. Beginning at the quarter-finals, the player must win a best of three match to advance through the tournament. Win another match in the semi-final stage to advance to the final and face the World Champion Jammy Jim. In the final match however, the player needs to win just one leg against him to win the tournament. Players can also compete against another human player or play Round the Clock, throwing darts around the dartboard from 20 to 1 within a time limit.
Opponents
There are a total of eight computer-controlled opponents in the game. Before the start of the match, the computer randomly selects an opponent, though Jammy Jim can only be played in the final. The opponents are Del Boy Desmond Sure Shot Sidney, Devious Dave, Limp Wrist Larry, Beer Belly Bill, Mega Mick,
Tactical Tel, and Jammy Jim.
Reception
At the time of its release, ratings for the game were favourable. The Spectrum version got a 72% rating from Crash magazine who labelled it as "the best darts game ever". The Commodore 64 version received a 70% rating from ZZAP! magazine. The Amstrad version got a rating of 67% from Amstrad Action.
The game was reviewed in Sinclair User, which rated the game 5 out of 5, stating "Darts ought to be boring and tedious, but with 180 it has been made funny, exciting and very impressive, a closet hit." The game was reviewed in Your Sinclair, which rated the game 9 out of 10, stating "In its presentation, 180 does veer toward the macho, crafty cockney Bristow school of darts rather than that of Gentleman John Lowe, but otherwise there's little to quibble about - a winner across the board!" The game was reviewed in ACE, stating "T |
https://en.wikipedia.org/wiki/Planomicrobium | Planomicrobium (formerly Planococcus) is a genus of gram-positive bacteria. It includes the hydrocarbon-degrading strain P. alkanoclasticum MAE2. |
https://en.wikipedia.org/wiki/Deborah%20Joseph | Deborah A. Joseph is an American computer scientist known for her research in computational geometry, computational biology, and computational complexity theory. She is a professor emeritus of computer science at the University of Wisconsin–Madison.
Education and career
Joseph graduated from Hiram College in 1976 with an interdisciplinary major in ecology.
She earned her Ph.D. in 1981 at Purdue University. Her dissertation, On the Power of Formal Systems for Analyzing Linear and Polynomial Time Program Behavior, was supervised by Paul R. Young.
At Wisconsin, Joseph was a recipient of the Presidential Young Investigator Award of the National Science Foundation. She was also an active member of the Computer Science and Telecommunications Board of the National Research Council.
Selected publications
. This paper introduces the -creative sets, which form a potential counterexample to the Berman–Hartmanis conjecture.
. Expanded version of a paper from the 23rd Symposium on Foundations of Computer Science (FOCS 1982).
.
. Expanded version of a paper from the 2nd Scandinavian Workshop on Algorithm Theory (SWAT 1990) and the PhD thesis of Joseph's student Gautam Das, in which they discover greedy geometric spanners. |
https://en.wikipedia.org/wiki/Data%20farming | Data farming is the process of using designed computational experiments to “grow” data, which can then be analyzed using statistical and visualization techniques to obtain insight into complex systems. These methods can be applied to any computational model.
Data farming differs from Data mining, as the following metaphors indicate:
Miners seek valuable nuggets of ore buried in the earth, but have no control over what is out there or how hard it is to extract the nuggets from their surroundings. ... Similarly, data miners seek to uncover valuable nuggets of information buried within massive amounts of data. Data-mining techniques use statistical and graphical measures to try to identify interesting correlations or clusters in the data set.
Farmers cultivate the land to maximize their yield. They manipulate the environment to their advantage using irrigation, pest control, crop rotation, fertilizer, and more. Small-scale designed experiments let them determine whether these treatments are effective. Similarly, data farmers manipulate simulation models to their advantage, using large-scale designed experimentation to grow data from their models in a manner that easily lets them extract useful information. ...the results can reveal root cause-and-effect relationships between the model input factors and the model responses, in addition to rich graphical and statistical views of these relationships.
A NATO modeling and simulation task group has documented the data farming process in the Final Report of MSG-088.
Here, data farming uses collaborative processes in combining rapid scenario prototyping, simulation modeling, design of experiments, high performance computing, and analysis and visualization in an iterative loop-of-loops .
History
The science of Design of Experiments (DOE) has been around for over a century, pioneered by R.A. Fisher for agricultural studies. Many of the classic experiment designs can be used in simulation studies. However, computation |
https://en.wikipedia.org/wiki/Riemann%E2%80%93Siegel%20formula | In mathematics, the Riemann–Siegel formula is an asymptotic formula for the error of the approximate functional equation of the Riemann zeta function, an approximation of the zeta function by a sum of two finite Dirichlet series. It was found by in unpublished manuscripts of Bernhard Riemann dating from the 1850s. Siegel derived it from the Riemann–Siegel integral formula, an expression for the zeta function involving contour integrals. It is often used to compute values of the Riemann–Siegel formula, sometimes in combination with the Odlyzko–Schönhage algorithm which speeds it up considerably. When used along the critical line, it is often useful to use it in a form where it becomes a formula for the Z function.
If M and N are non-negative integers, then the zeta function is equal to
where
is the factor appearing in the functional equation , and
is a contour integral whose contour starts and ends at +∞ and circles the singularities of absolute value at most . The approximate functional equation gives an estimate for the size of the error term. and derive the Riemann–Siegel formula from this by applying the method of steepest descent to this integral to give an asymptotic expansion for the error term R(s) as a series of negative powers of Im(s). In applications s is usually on the critical line, and the positive integers M and N are chosen to be about . found good bounds for the error of the Riemann–Siegel formula.
Riemann's integral formula
Riemann showed that
where the contour of integration is a line of slope −1 passing between 0 and 1 .
He used this to give the following integral formula for the zeta function: |
https://en.wikipedia.org/wiki/GeoNames | GeoNames (or GeoNames.org) is a user-editable geographical database available and accessible through various web services, under a Creative Commons attribution license. The project was founded in late 2005.
The GeoNames dataset differs from, but includes data from, the US Government's similarly named GEOnet Names Server.
Database and web services
The GeoNames database contains over 25,000,000 geographical names corresponding to over 11,800,000 unique features. All features are categorized into one of nine feature classes and further subcategorized into one of 645 feature codes. Beyond names of places in various languages, data stored include latitude, longitude, elevation, population, administrative subdivision and postal codes. All coordinates use the World Geodetic System 1984 (WGS84).
Those data are accessible free of charge through a number of Web services and a daily database export.
Wiki interface
The core of GeoNames database is provided by official public sources, the quality of which may vary. Through a wiki interface, users are invited to manually edit and improve the database by adding or correcting names, move existing features, add new features, etc.
Semantic Web integration
Each GeoNames feature is represented as a web resource identified by a stable URI. This URI provides access, through content negotiation, either to the HTML wiki page, or to a RDF description of the feature, using elements of the GeoNames ontology. This ontology describes the GeoNames features properties using the Web Ontology Language, the feature classes and codes being described in the SKOS language.
Through Wikipedia articles URL linked in the RDF descriptions, GeoNames data are linked to DBpedia data and other RDF Linked Data.
Accuracy and improvements
As in other crowdsourcing schemes, GeoNames edit interface allows everyone to sign in and edit the database, hence false information can be entered and such information can remain undetected especially for places that are |
https://en.wikipedia.org/wiki/Strategic%20network%20formation | Strategic network formation defines how and why networks take particular forms. In many networks, the relation between nodes is determined by the choice of the participating players involved, not by an arbitrary rule. A "strategic2 modeling of network requires defining a network’s costs and benefits and predicts how individual preferences become outcomes.
Introduction
A strategic network formation requires that individuals create relations that are beneficial and drop those that are not. One of the most well-known examples in this context is the marriage network of sixteen families in Florence, which showed how the Medici family gained power and took control of Florence by creating a high number of inter-marriages with the other families. “Thus, decisions about profitable relations are not a situation of choice, but a situation of strategic interaction – an aspect that is best covered by Game Theory”. In these kinds of settings, the nodes are usually called players, where {1, 2,… } is a set of players that have formed links in a network. Social Networks have diverse settings, however the simplest ones can be described by an undirected graph whereas more complicated situations are represented by directed graphs. There are fundamental differences in the way these games are modeled depending on their graph structure. If a link exists between player and player it is noted as . In cases of undirected networks, is considered equal to . A network represents a list of all the links between players. In a more formal setting, a network is defined as a set of unordered pairs {}, with element of .The set of all possible graphs on the set of players is denoted with . The benefits that they receive from the network are represented by utility functions. That is, the payoff to a player is represented by a function : , where () represents the net benefit that i receives if network is in place. To model strategic network formation the notion of network games is us |
https://en.wikipedia.org/wiki/Aigo | Beijing Huaqi Information Digital Technology Co., Ltd, trading as Aigo (stylized as aigo), is a Chinese consumer electronics company. It is headquartered in the Ideal Plaza () in Haidian District, Beijing.
History
Beijing Huaqi Information Digital Technology Co Ltd (北京华旗资讯科技发展有限公司) is a consumer electronics manufacturer headquartered in Beijing. It was founded by Féng Jūn, who is the current president, in 1993. The company initially produced keyboards. aigo may be participating in a trend that sees Chinese nationals preferring to purchase locally produced durable goods.
Products
aigo's products include MIDs, digital media players, computer cases, digital cameras, cpu cooling fans, computer peripherals, and monitors.
Subsidiaries
aigo has 27 subsidiaries and several R&D facilities. An incomplete list of aigo's subsidiaries can be found here.
aigo Music
Established in 1993 and located in Beijing, aigo Music operates a digital music service much like iTunes. The first of its kind in China, it is, as of 2009, the biggest portal for legal downloading of music in the country. Strategic partnerships with Warner Music, EMI and Sony allow a wide range of music to be offered at 0.99 yuan per song.
Beijing aifly Education and Technology Co Ltd
aigo set up this English as a Second Language brand with help from Crazy English founder Li Yang.
Beijing aigo Digital Animation Institution
An aigo subsidiary that specializes in 3D animated films.
Huaqi Information Technology (Singapore) Pte Ltd
Set up in October 2003, it operates two official aigo outlet stores in Singapore.
Shenzhen aigo R&D Co Ltd
Established in 2006, this Shenzhen-based research and development facility focuses on the development of mobile multimedia software.
Sponsorships
aigo is a sponsor of a number of sporting events, the majority involving automobile racing.
Motorsport
aigo was an official partner of the Vodafone McLaren Mercedes Formula One team.
As of 2008, aigo sponsors Chinese driver "Frankie" |
https://en.wikipedia.org/wiki/Highly%20optimized%20tolerance | In applied mathematics, highly optimized tolerance (HOT) is a method of generating power law behavior in systems by including a global optimization principle. It was developed by Jean M. Carlson and John Doyle in the early 2000s. For some systems that display a characteristic scale, a global optimization term could potentially be added that would then yield power law behavior. It has been used to generate and describe internet-like graphs, forest fire models and may also apply to biological systems.
Example
The following is taken from Sornette's book.
Consider a random variable, , that takes on values with probability . Furthermore, let’s assume for another parameter
for some fixed . We then want to minimize
subject to the constraint
Using Lagrange multipliers, this gives
giving us a power law. The global optimization of minimizing the energy along with the power law dependence between and gives us a power law distribution in probability.
See also
self-organized criticality |
https://en.wikipedia.org/wiki/Core-and-pod | Core-and-pod design is a computer network design that uses individual pods that hang off the core layer as atomic units.
Within the pod, there may be only a single access layer or a “leaf and spine” network in the pod. The routed core layer serves as a fast and simple way to connect many generations of pods to each other. When the “leaf and spine” network is used within the pod, the core layer can be referred to as the “spine of spines,” since it is the thing that connects the “spines” of the pods. This design then resembles some kind of large and wide tree, with many “branches,” or pods, off the main “trunk,” or core.
This new design differs from the original “three-tier” architecture through the fact that pods can be bundled as a unit. The units can be manipulated as however the staff of the network pleases. The new design also requires the staff of the network to understand the many designs and tools that can be used to manage the different pod iterations.
See also
Network planning and design
Data center network architectures |
https://en.wikipedia.org/wiki/Worldspan | Worldspan is a provider of travel technology and content and a part of the Travelport GDS business. It offers worldwide electronic distribution of travel information, Internet products and connectivity, and e-commerce capabilities for travel agencies, travel service providers and corporations. Its primary system is commonly known as a Global Distribution System (GDS), which is used by travel agents and travel related websites to book airline tickets, hotel rooms, rental cars, tour packages and associated products. Worldspan also hosts IT services and product solutions for major airlines.
Recent events
In December, 2006, Travelport, owner of the Galileo GDS, Gullivers Travel Associates (GTA) and a controlling share in Orbitz, agreed to acquire Worldspan. However, at the time, management of Travelport did not commit to the eventual merging of the two GDS systems, saying that they were considering all options, including running both systems in parallel. On August 21, 2007, the acquisition was completed for $1.4 billion and Worldspan became a part of Travelport GDS, which also includes Galileo and other related businesses. On September 28, 2008, the Galileo and Apollo GDS were moved from the Travelport datacenter in Denver, Colorado to the Worldspan datacenter in Atlanta, Georgia (although they continue to be run as separate systems from the Worldspan GDS).
In 2012, Worldspan customers were migrated from the TPF-based FareSource pricing engine to Travelport's Linux-based 360 Fares pricing engine already used by Galileo and Apollo. Although the three systems share a common pricing platform, they continue to operate as separate GDS.
History
Worldspan was formed in early 1990 by Delta Air Lines, Northwest Airlines, and TWA to operate and sell its GDS services to travel agencies worldwide. Worldspan operated very effectively and profitably, successfully expanding its business in markets throughout North America, South America, Europe, and Asia. As a result, in mid- |
https://en.wikipedia.org/wiki/ARINC%20629 | The ARINC 629 computer bus was introduced in May 1995 and is used on aircraft such as the Boeing 777, Airbus A330 and Airbus A340 as well as the Airbus A320 series.
The ARINC 629 bus operates as a multiple-source, multiple-sink system; each terminal can transmit data to, and receive data from, every other terminal on the data bus. This allows much more freedom in the exchange of data between units in the avionics system. ARINC 629 has the ability to accommodate up to a total of 128 terminals on a data bus and supports a data rate of 2 Mbit/s.
The ARINC 629 data bus was developed by the Airlines Electronic Engineering Committee (AEEC) to replace the ARINC 429 bus.
The ARINC 629 data bus was based on the Boeing DATAC bus. |
https://en.wikipedia.org/wiki/Ronald%20Graham | Ronald Lewis Graham (October 31, 1935July 6, 2020) was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
After graduate study at the University of California, Berkeley, Graham worked for many years at Bell Labs and later at the University of California, San Diego. He did important work in scheduling theory, computational geometry, Ramsey theory, and quasi-randomness, and many topics in mathematics are named after him. He published six books and about 400 papers, and had nearly 200 co-authors, including many collaborative works with his wife Fan Chung and with Paul Erdős.
Graham has been featured in Ripley's Believe It or Not! for being not only "one of the world's foremost mathematicians", but also an accomplished trampolinist and juggler. He served as president of the International Jugglers' Association.
Biography
Graham was born in Taft, California, on October 31, 1935; his father was an oil field worker and later merchant marine. Despite Graham's later interest in gymnastics, he was small and non-athletic. He grew up moving frequently between California and Georgia, skipping several grades of school in these moves, and never staying at any one school longer than a year. As a teenager, he moved to Florida with his then-divorced mother, where he went to but did not finish high school. Instead, at the age of 15 he won a Ford Foundation scholarship to the University of Chicago, where he learned gymnastics but took no mathematics courses.
After three years, when his scholarship expired, he moved to the University of California, Berkeley, officially as a student of electrical engineering but also studying n |
https://en.wikipedia.org/wiki/Fluorenylmethyloxycarbonyl%20chloride | Fluorenylmethyloxycarbonyl chloride (Fmoc-Cl) is a chloroformate ester. It is used to introduce the fluorenylmethyloxycarbonyl protecting group as the Fmoc carbamate.
Preparation
This compound may be prepared by reacting 9-fluorenylmethanol with phosgene: |
https://en.wikipedia.org/wiki/Ulnar%20artery | The ulnar artery is the main blood vessel, with oxygenated blood, of the medial aspects of the forearm. It arises from the brachial artery and terminates in the superficial palmar arch, which joins with the superficial branch of the radial artery. It is palpable on the anterior and medial aspect of the wrist.
Along its course, it is accompanied by a similarly named vein or veins, the ulnar vein or ulnar veins.
The ulnar artery, the larger of the two terminal branches of the brachial, begins a little below the bend of the elbow in the cubital fossa, and, passing obliquely downward, reaches the ulnar side of the forearm at a point about midway between the elbow and the wrist. It then runs along the ulnar border to the wrist, crosses the transverse carpal ligament on the radial side of the pisiform bone, and immediately beyond this bone divides into two branches, which enter into the formation of the superficial and deep volar arches.
Branches
Forearm:
Anterior ulnar recurrent artery,
Posterior ulnar recurrent artery,
Common interosseous is very short, around 1 cm, and gives rise to the anterior, posterior, and recurrent interosseous arteries and
close to the wrist it gives off the palmar carpal branch which is the ulnar contribution to the palmar carpal arch and it also gives a dorsal carpal branch which is the ulnar contribution to dorsal carpal arch.
Hand:
Deep palmar branch of ulnar artery which passes through the hypothenar muscles to anastomose with the deep palmar arch which is formed predominantly by the radial artery and
the terminal branch of the ulnar artery is then to form the superficial palmar arch.
Relations
In its upper half, it is deeply seated, being covered by the Pronator teres, Flexor carpi radialis, Palmaris longus, and Flexor digitorum superficialis; it lies upon the Brachialis and Flexor digitorum profundus.
The median nerve is in relation with the medial side of the artery for about 2.5 cm. and then crosses the vessel, being separated f |
https://en.wikipedia.org/wiki/Zinc%20finger%20homeobox%202 | Zinc finger homeobox 2 is a protein that in humans is encoded by the ZFHX2 gene. It has been implicated in pain insensitivity. |
https://en.wikipedia.org/wiki/GoVenture%20Educational%20Games%20and%20Simulations | GoVenture is the brand name for a series of educational computer games and simulations developed and published by MediaSpark Inc. The first GoVenture simulation was launched in 2000 and several more have been launched since. GoVenture educational games and simulations are themed on business and money subjects and are designed to give learners realistic experiences with various business processes and financial topics.
Reference Descriptions
Preparing for Work: Resources for International Youth Livelihood Education, reviews the GoVenture IdeaBook and Lemonade Stand simulation. 2010.
OSAPAC (Ontario Software Acquisition Program Advisory Committee) announces the purchase of four GoVenture simulations for all junior high schools and high schools in Ontario, Canada. 2010.
IBM announcement of virtual event references Mathew Georghiou and MediaSpark, 12 October 2006.
Cisco Entrepreneur Institute website references GoVenture games and simulations.
National Educational Computing Conference exhibitor announcement 24 June 2009.
CNET reviews of GoVenture software on 16 July 2010.
International Association of Business Communicators (IABC) announces 2004 Silver Leaf Award for GoVenture Live The Learning newsletter.
PC Magazine's review of GoVenture simulations, 3 October 2000.
CP24 (Canadian Online news channel) airs CityTV segment of Mathew Georghiou demonstrating GoVenture simulations, 26 May 2004. Video segment can be viewed on MediaSpark's website.
Macromedia eLearning Innovation Award 2000 – announcement.
Consortium for Entrepreneurship Education – List of approved classroom materials includes reference to GoVenture simulations by MediaSpark.
University of Western Ontario overview of Stock Market Challenges and Financial Competitions for the Classroom references GoVenture simulations.
Government of Nova Scotia press release announces availability of GoVenture software, 29 November 1999.
Serious Games Source Developer Showcase Q&A with MediaSpark.
Gamasutra re |
https://en.wikipedia.org/wiki/Semi-biotic%20systems | Semi-biotic systems are systems that incorporate biologically derived components/modules – which could range from multi-protein complexes through DNA constructs to multi-cellular assemblies – and integrate them with synthetic components (e.g. microfabricated systems) to produce hybrid devices. One of the potential attractions of these hybrid devices is the possibility that they can be designed to exhibit higher degrees of adaptability and autonomy than is possible with solid-state devices. Examples include: artificial organelle-like systems that could accomplish the synthesis of complex biomacromolecules, or synthetic multi-cellular structures that incorporate specific sensing and reporting functionalities, such that they could be used in hybrid devices for chemical or biological agent sensing.
Semi-biotic systems is an emerging area of research within the broader area of Synthetic Biology. In the European community a programme entitled NEONUCLEI was funded under FP6 whose aim is to generate synthetic analogues of cell nuclei capable of sustaining transcription, in self-assembled systems comprising DNA, macromolecules (or nanoparticles), and lipids.
See also
Animat
Hybrot |
https://en.wikipedia.org/wiki/TuiaNet | TuiaNet or Tuia was a national research and education network (NERN) in New Zealand. Established in 1992, it provided the first Internet backbone for the country. This backbone provided a 48kbit/s connection between every New Zealand university, many Crown Research Institute and the National Library. It also provided an international connection of 128 kbit/s (1992) to 512 kbit/s (1994) to the Ames Research Center. By 1993, the parties involved in the network rarely engaged in further collaboration on the network, and private internet service providers soon emerged.
The main international connection of the network was replaced with the Southern Cross Cable, and a new NERN emerged through the Kiwi Advanced Research and Education Network (KAREN) in 2006. |
https://en.wikipedia.org/wiki/Prejudice%20from%20an%20evolutionary%20perspective | Some evolutionary theorists consider prejudice as having functional utility in evolutionary process. A number of evolutionary psychologists in particular posit that human psychology, including emotion and cognition, is influenced by evolutionary processes. These theorists argue that although psychological variation appears between individuals, the majority of our psychological mechanisms are adapted specifically to solve recurrent problems in our evolutionary history, including social problems.
For example, James J. Gibson, a founder of ecological psychology, believes that human evolutionary success is enhanced by the ability to analyze social costs and benefits so that humans can recognize and functionally respond to threats and opportunities, and that errors in judgment will be biased toward minimizing costs to reproductive fitness. In other words, human responses to social stimuli proceed from adaptations that motivate action in order to take advantage of opportunities and avoid or confront threats. Some proponents of this perspective believe that these responses can be measured by implicit association tests.
Unconscious negative reactions are often referred to as prejudice, but prejudices are more contextually rich than simple reactions, which may involve discrete emotions in an evolutionary perspective. In this perspective, evolved biases may have implications for both beneficial or harmful expressions of stigma, prejudice, or discriminatory behavior in post-industrial societies.. Some common biases include those related to sex, age, and race.
Recognizing threats and opportunities
According to James J. Gibson, humans perceive their environment in terms of affordances. Different animals and objects afford different context-dependent actions. For instance, the same trait may afford both costs and benefits depending on the who carries it, the social and environmental contexts, and the relative affordances or vulnerabilities of the one interacting with th |
https://en.wikipedia.org/wiki/PBLU | pBLU is a commercially produced bacterial plasmid that contains genes for ampicillin resistance (beta lactamase and beta galactosidase). It is often used in conjunction with an ampicillin-susceptible E. coli strain to teach students about transformation of eubacteria. It is 5,437 base pairs long. There is a multiple cloning site in the lacZ gene. |
https://en.wikipedia.org/wiki/Nitrogen%20deficiency | Nitrogen deficiency is a deficiency of nitrogen in plants. This can occur when organic matter with high carbon content, such as sawdust, is added to soil. Soil organisms use any nitrogen available to break down carbon sources, making nitrogen unavailable to plants. This is known as "robbing" the soil of nitrogen. All vegetables apart from nitrogen fixing legumes are prone to this disorder.
Nitrogen deficiency can be prevented by using grass mowings as a mulch or foliar feeding with manure. Sowing green manure crops such as grazing rye to cover soil over the winter will help to prevent nitrogen leaching, while leguminous green manures such as winter tares will fix additional nitrogen from the atmosphere.
Moreover, poor irrigation system in the field can lead to loss of nitrogen in plants as stagnant water in the field will cause the nitrogen to evaporate in the air.
Symptoms
Some symptoms of nitrogen deficiency (in absence or low supply) are given below :
The chlorophyll content of the plant leaves is reduced which results in pale yellow color (chlorosis). Older leaves turn completely yellow.
Flowering, fruitings, protein and starch contents are reduced. Reduction in protein results in stunted growth and dormant lateral buds.
Disease
Plants look thin, pale and the condition is called general starvation.
Effect on Potato Production
Symptoms of nitrogen deficiencies in plants is general chlorosis of the leaves, which is when leaves turn pale green, and leaves cup upwards quite severely in deficient plants. Nitrogen deficiencies also cause leaves to remain small, and drop prematurely, resulting in less photosynthesis occurring in the plant, and fewer, smaller tubers can form for harvest. Research done by Yara International has shown that there is a direct correlation between tuber size and yield, and the amount of plant-available nitrogen in the soil. This makes it crucial that the fields have enough nitrogen in the soil to grow a prosperous crop. However, excess |
https://en.wikipedia.org/wiki/List%20of%20Croatian%20flags | For more information on main flags see article: Flag of Croatia
This is a list of flags which have been, or are still today, used in Croatia or by Croatians and Croats.
Modern Flag
Standard
Military
Army
Navy
Air Force
Coast Guard
Police
Security and Intelligence Agency
Subnational flags
Municipality flags
Political flags
Ethnic groups flags
Historical flags
Historical national flags
Royal Standards
Coronation Standards
Historical city flags
Historical regional flags
Historical flags (medieval)
Republic of Ragusa flags
Other
Flag proposals
Croatian people in other countries
Burgees of Croatia
Notes |
https://en.wikipedia.org/wiki/Podocin | Podocin is a protein component of the filtration slits of podocytes. Glomerular capillary endothelial cells, the glomerular basement membrane and the filtration slits function as the filtration barrier of the kidney glomerulus.
Mutations in the podocin gene NPHS2 can cause nephrotic syndrome, such as focal segmental glomerulosclerosis (FSGS) or minimal change disease (MCD). Symptoms may develop in the first few months of life (congenital nephrotic syndrome) or later in childhood.
Structure
Podocin is a membrane protein of the band-7-stomatin family, consisting of 383 amino acids. It has a transmembrane domain forming a hairpin structure, with two cytoplasmic ends at the N- and C-terminus, the latter of which interacts with the cytosolic tail of nephrin, with CD2AP serving as an adaptor.
Function
Podocin is localized on the membranes of podocyte pedicels (foot-like long processes), where it oligomerizes in lipid rafts together with nephrin to form the filtration slits. |
https://en.wikipedia.org/wiki/Sigillum%20Dei | The Sigillum Dei (seal of God, "Seal of Truth" or signum dei vivi, symbol of the Living God, called by John Dee the Sigillum Dei Aemeth) is a magical diagram, composed of two circles, a pentagram, two heptagons, and one heptagram, and is labeled with the names of God and its angels. It is an angelic magic seal with the magical function that, according to one of the oldest sources (Liber Juratus), allowed a destined intended magician to have the power to possess the Spirit of God and when activated can become the 'Living' God; or The Lord God itself; amongst humanity and all creation itself, communicate with spirits as well as angels and archangels, control all elements, control every creature's holy spirit on the planet including the Spirit of God itself; all except for the Archangels, and to control light itself. The intended user also possesses the true benefic vision of God.
Middle Ages
Liber Juratus
Probably the oldest known description and image of the Sigillum Dei is the 14th-century Liber Juratus (also Liber Sacratus, Liber sacer sive Juratus, or Sworn Booke), attributed to Honorius, son of Euclid. This may have been produced in the late 13th century, but likely not before the time of Pope John XXII. (1316–1334).
The description of the seal in the Liber Juratus begins with the dimensions of the circle surrounding the outside in relation to common symbol figures of the Christian tradition.
make first a circle whose diameter is three fingers, because of the three cross-nails of the Lord, or five fingers because of the five wounds of Christ, or seven for the seven sacraments, or nine for the nine orders of angels, but usually five fingers will suffice. Then make a second within this circle, let it be a distance from the first two grains because of the two Tablets of the Law of Moses, or three grains because of the persons of the Trinity.
The so created circular band will be at an apex of a small cross and from this starting point proceed from left to right |
https://en.wikipedia.org/wiki/Club%20filter | In mathematics, particularly in set theory, if is a regular uncountable cardinal then the filter of all sets containing a club subset of is a -complete filter closed under diagonal intersection called the club filter.
To see that this is a filter, note that since it is thus both closed and unbounded (see club set). If then any subset of containing is also in since and therefore anything containing it, contains a club set.
It is a -complete filter because the intersection of fewer than club sets is a club set. To see this, suppose is a sequence of club sets where Obviously is closed, since any sequence which appears in appears in every and therefore its limit is also in every To show that it is unbounded, take some Let be an increasing sequence with and for every Such a sequence can be constructed, since every is unbounded. Since and is regular, the limit of this sequence is less than We call it and define a new sequence similar to the previous sequence. We can repeat this process, getting a sequence of sequences where each element of a sequence is greater than every member of the previous sequences. Then for each is an increasing sequence contained in and all these sequences have the same limit (the limit of ). This limit is then contained in every and therefore and is greater than
To see that is closed under diagonal intersection, let be a sequence of club sets, and let To show is closed, suppose and Then for each for all Since each is closed, for all so To show is unbounded, let and define a sequence as follows: and is the minimal element of such that Such an element exists since by the above, the intersection of club sets is club. Then and since it is in each with
See also |
https://en.wikipedia.org/wiki/Bolt%20circle | A bolt circle diameter or pitch circle diameter (PCD), sometimes simply called bolt circle or pitch circle, is a common term for when a number of screw holes for bolts are evenly distributed with their centers along an imaginary circle with a given diameter.
An example of use is mounting of car rims, where the bolt circle is one of several factors that determine whether a set of rims will fit a car. For example, a bolt circle of 5×130 or 5-130 indicates that a rim is to be attached to the car via 5 screws evenly spaced along a circle with a diameter of 130 millimeters. Other common uses for bolt circles are for indicating mounting for sim racing and real-world car steering wheels, or in the industry for mounting of servomotors or for specifying the bolt pattern of a flange. Attachment of chain rings for bicycle cranksets are also specified by a bolt circle.
Examples
Racing wheels
On steering wheels for cars utilizing bolt circles, this usually measures 6×70 mm. Some racing wheels attach to the car via a quick release hub, and this hub then usually has a corresponding bolt circle of 6×70 mm. Example of other less used patterns include: 3×1.75 in (44.45 mm), 5×2.75 in (69.85 mm), 6×74 mm and 6×2.75 in (69.85 mm).
Servomotors
Servomotors in the industry are often mounted via a flange-like coupling to give the shortest possible leverage for high-torque uses. Industrial servomotors often use standardised mounting patterns, of which one example is a bolt circle of 4×130 mm diameter (approximately corresponds to a square pattern of 91.9 mm × 91.9 mm).
Car rims
The mounting pattern of most car rims are described using bolt patterns, and this pattern is one of many factors which determine whether a rim will fit a given car. Here, the bolt circle indicates the number of wheel nuts and associated hub bolts (or alternatively just wheel bolts).
An example of a bolt circle is 5×100 which indicates 5 nuts placed on a circle with a diameter of 100 mm. Some of the most c |
https://en.wikipedia.org/wiki/Crataegus%20phaenopyrum | Crataegus phaenopyrum is a species of hawthorn commonly known as Washington hawthorn or Washington thorn. It is widely grown as an ornamental plant, and can reach 10 m (about 32 feet) in height. The small red berry-like fruit grow closely together in large clusters and are food for squirrels and birds. They have a mild flavor and can be eaten raw or cooked. As with other species of hawthorn, the wood is hard and can be used to make tools.
The fruit is edible and can be made into jelly or crushed to make tea. The species is native to the mid-eastern United States. |
https://en.wikipedia.org/wiki/Rathayibacter | Rathayibacter is a genus of bacteria of the order Actinomycetales which are gram-positive soil organisms. |
https://en.wikipedia.org/wiki/Bandlimiting | Bandlimiting refers to a process which reduces the energy of a signal to an acceptably low level outside of a desired frequency range.
Bandlimiting is an essential part of many applications in signal processing and communications. Examples include controlling interference between radio frequency communications signals, and managing aliasing distortion associated with sampling for digital signal processing.
Bandlimited signals
A bandlimited signal is, strictly speaking, a signal with zero energy outside of a defined frequency range. In practice, a signal is considered bandlimited if its energy outside of a frequency range is low enough to be considered negligible in a given application.
A bandlimited signal may be either random (stochastic) or non-random (deterministic).
In general, infinitely many terms are required in a continuous Fourier series representation of a signal, but if a finite number of Fourier series terms can be calculated from that signal, that signal is considered to be band-limited. In mathematic terminology, a bandlimited signal has a Fourier transform or spectral density with bounded support.
Sampling bandlimited signals
A bandlimited signal can be fully reconstructed from its samples, provided that the sampling rate exceeds twice the bandwidth of the signal. This minimum sampling rate is called the Nyquist rate associated with the Nyquist–Shannon sampling theorem.
Real world signals are not strictly bandlimited, and signals of interest typically have unwanted energy outside of the band of interest. Because of this, sampling functions and digital signal processing functions which change sample rates usually require bandlimiting filters to control the amount of aliasing distortion. Bandlimiting filters should be designed carefully to manage other distortions because they alter the signal of interest in both its frequency domain magnitude and phase, and its time domain properties.
An example of a simple deterministic bandlimited signal is |
https://en.wikipedia.org/wiki/Sigil%20of%20Baphomet | The Sigil of Baphomet is the official insignia of the Church of Satan, first appearing on the cover of The Satanic Mass album in 1968, and adorning the cover of The Satanic Bible the following year. The sigil has been called a "material pentagram" representational of carnality and earthy principles. The Church describes the symbol as the "...preeminent visual distillation of the iconoclastic philosophy of Satanism."
History
The familiar goat's head inside an inverted pentagram did not become the foremost symbol of Satanism until the founding of the Church of Satan in 1966. The original goat pentagram containing the Hebrew letters at the five points of the pentagram spelling out Leviathan (לויתן), the ancient serpent from the biblical Chaoskampf, first appeared in the book La Clef de la Magie Noire by French occultist Stanislas de Guaita, in 1897. With the pentagram inverted, matter is ruling over spirit, a condition associated with evil. In the book, de Guaita also showed an upright pentagram with the Pentagrammaton (יהשוה) at the vertices of the pentagram. The Pentagrammaton is an esoteric version of the Hebrew name of Jesus, Yeshua, (ישוע) by adding the letter shin (ש) in the middle of the Tetragrammaton divine name Yod-He-Vav-He, (יהוה). The lower four points represented the four elements of the material world, while the uppermost point represented spirit ruling over matter. The upper Pentacle includes the concept of an inverted pentagram being a representation of evil and an upright pentagram symbolizing holiness, which originated with the 19th-century French occultist Eliphas Lévi. Anton LaVey, the founder of the Church of Satan based his “Sigil of Baphomet” on this image of Baphomet. This symbol was later used in Maurice Bessy's book A Pictorial History of Magic and the Supernatural, with the words "Samael" and "Lilith" removed.
During his years of research into the "black arts", LaVey had come across this book and added it to his collection. When he chose t |
https://en.wikipedia.org/wiki/SLiM | Simple Login Manager (SLiM) is a graphical display manager for the X Window System that can be run independently of any window manager or desktop environment. SLiM aims to be light, completely configurable, and suitable for machines on which remote login functionalities are not needed.
SLiM was forked from Per Lidén's Login.app program, with contributions from Martin Parm for PAM-related classes. SLiM is currently developed by Simone Rota and Johannes Winkelmann, and is currently maintained by Nobuhiro Iwamatsu.
As of March, 2016, SLiM seems to be abandoned. It is not fully compatible with systemd.
As of September, 2016, GhostBSD 10.3 replaced GDM with SLiM.
Features
SLiM supports the following features:
PNG and XFT support for alpha transparency and anti-aliased fonts
External themes support
Configurable runtime options: X server, login / shutdown / reboot commands
Single (GDM-like) or double (XDM-like) input control
Can load predefined user at startup
Configurable welcome / shutdown messages
Random theme selection
Dependencies
SLiM has the following dependencies:
X11
libpng
libjpeg
freetype
See also
LightDM, the formerly Ubuntu’s default display manager, now GDM
SDDM, the KDE Plasma 5 display manager
KDM, the KDE Plasma 4 display manager
GDM, the GNOME display manager
Other display managers |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.