source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Polish%20space | In the mathematical discipline of general topology, a Polish space is a separable completely metrizable topological space; that is, a space homeomorphic to a complete metric space that has a countable dense subset. Polish spaces are so named because they were first extensively studied by Polish topologists and logicians—Sierpiński, Kuratowski, Tarski and others. However, Polish spaces are mostly studied today because they are the primary setting for descriptive set theory, including the study of Borel equivalence relations. Polish spaces are also a convenient setting for more advanced measure theory, in particular in probability theory.
Common examples of Polish spaces are the real line, any separable Banach space, the Cantor space, and the Baire space. Additionally, some spaces that are not complete metric spaces in the usual metric may be Polish; e.g., the open interval is Polish.
Between any two uncountable Polish spaces, there is a Borel isomorphism; that is, a bijection that preserves the Borel structure. In particular, every uncountable Polish space has the cardinality of the continuum.
Lusin spaces, Suslin spaces, and Radon spaces are generalizations of Polish spaces.
Properties
Every Polish space is second countable (by virtue of being separable metrizable).
(Alexandrov's theorem) If is Polish then so is any -subset of .
A subspace of a Polish space is Polish if and only if is the intersection of a sequence of open subsets of . (This is the converse to Alexandrov's theorem.)
(Cantor–Bendixson theorem) If is Polish then any closed subset of can be written as the disjoint union of a perfect set and a countable set. Further, if the Polish space is uncountable, it can be written as the disjoint union of a perfect set and a countable open set.
Every Polish space is homeomorphic to a -subset of the Hilbert cube (that is, of , where is the unit interval and is the set of natural numbers).
The following spaces are Polish:
closed subsets of a |
https://en.wikipedia.org/wiki/FNAEG | The Fichier National Automatisé des Empreintes Génétiques () is the French national DNA database, used by both the national police force and local gendarmerie.
Origins and evolution
In June 1998, the Guigou law on the prevention of sexually-related crimes, passed by the Plural Left Lionel Jospin government, created a national DNA database. The implementation, originally planned for 1999, was finally completed in 2001, with the database itself located at Écully in the Rhône, managed by a subdirectorate of the technical and scientific departments of the French police force.
In the aftermath of the September 11 attacks on the USA in 2001, the French government increased the scope of the database to include DNA related to other serious criminal offences, such as voluntary manslaughter, criminal violence and terrorism.
A further 'law for interior safety' introduced on 18 March 2003 expanded the scope still further to cover almost all violent crimes to people or property, serious crimes such as drug trafficking, simple thefts, tags and dégradations, and finally almost all small offenses, but not traffic offenses or crimes committed abroad. Samples are taken from convicted persons and also from simple suspects. The law does not specify a minimum age.
In September 2009, Matthieu Bonduelle, the general secretary of the Syndicat de la Magistrature (the first syndicat of juges) has declared that "nobody defends a universal database, but, in fact, it is being done."
Relative size
As at 1 October 2003, FNAEG was understood to contain the DNA records of approximately 8,000 convicted criminals and another 3,200 suspects.
In 2006, this number was believed to now be in excess of 330,000 entries.
In May 2007, this number was believed to now be in excess of nearly 500,000 entries.
In December 2009, there were 1.27 million entries.
Privacy concerns
With the expansion of the database in 2003, it also became an offence for suspects to fail to provide a DNA sample, with punishme |
https://en.wikipedia.org/wiki/Mean%20systemic%20pressure | In medicine, the mean systemic pressure (mean systemic filling pressure (MSFP)) is defined as the mean pressure that exists in the circulatory system when there is no blood motion. A similar term, mean circulatory filling pressure, (MCFP) is defined as the mean pressure that exists in the combined circulatory system & pulmonary system when there is no blood motion. The value of MSP in animal experimental models is approximately 7 mm Hg. It is an indicator of how full the circulatory system is (i.e. the volume of blood in the system compared to the capacity of the system), and is influenced by the volume of circulating blood and the smooth muscle tone in the walls of the venous system (which determines the capacity of the system).
MSP is measured in two ways experimentally, and as a result has two alternative naming conventions. MSFP is measured after clamping the aortic root and the great veins at point of entry to right atrium. On the other hand, MCFP is measured experimentally by briefly inducing cardiac arrest or naturally during cardiac arrest once the blood redistributes. It may also be estimated in vivo using a series of inspiratory holds when a patient is on a mechanical ventilator. It can be used to demonstrate effects of drugs on the venous tone while the circulating blood volume remains constant, or to measure haemodynamic changes during haemorrhage.
Mean systemic pressure increases if there is an increase in blood volume or if there is a decrease in venous compliance (where blood is shifted from the veins to the arteries). An increase in mean systemic pressure is reflected in a shift of the vascular function curve to the right. Mean systemic pressure is decreased by a decrease in blood volume or by an increase in venous compliance (where blood is shifted from the arteries to the veins). A decrease in mean systemic pressure is reflected in a shift of the vascular function curve to the left.
Calculations involving MSP
Mean systemic pressure is defined |
https://en.wikipedia.org/wiki/Iskradata%201680 | Iskradata 1680 was a computer developed by Iskradata in 1979. |
https://en.wikipedia.org/wiki/Amazon%20DynamoDB | Amazon DynamoDB is a fully managed proprietary NoSQL database offered by Amazon.com as part of the Amazon Web Services portfolio. DynamoDB offers a fast persistent Key-Value Datastore with built-in support for replication, autoscaling, encryption at rest, and on-demand backup among other features.
Background
Werner Vogels, CTO at Amazon.com, provided a motivation for the project in his 2012 announcement. Amazon began as a decentralized network of services. Originally, services had direct access to each other's databases. When this became a bottleneck on engineering operations, services moved away from this direct access pattern in favor of public-facing APIs. Still, third-party relational database management systems struggled to handle Amazon's client base. This culminated during the 2004 holiday season, when several technologies failed under high traffic.
Engineers were normalizing these relational systems to reduce data redundancy, a design that optimizes for storage. The sacrifice: they stored a given "item" of data (e.g., the information pertaining to a product in a product database) over several relations, and it takes time to assemble disjoint parts for a query. Many of Amazon's services demanded mostly primary-key reads on their data, and with speed a top priority, putting these pieces together was extremely taxing.
Content with compromising storage efficiency, Amazon's response was Dynamo: a highly available key–value store built for internal use. Dynamo, it seemed, was everything their engineers needed, but adoption lagged. Amazon's developers opted for "just works" design patterns with S3 and SimpleDB. While these systems had noticeable design flaws, they did not demand the overhead of provisioning hardware and scaling and re-partitioning data. Amazon's next iteration of NoSQL technology, DynamoDB, automated these database management operations.
Overview
In DynamoDB, data is stored in Tables as items, and can be queried using indices. Items consist of |
https://en.wikipedia.org/wiki/SH3BP2 | SH3BP2 (SH3 domain-binding protein 2) is a protein that comes from a gene located on Chromosome 4. SH3BP2 binds differentially to the SH3 domains of certain proteins of signal transduction pathways. It binds to phosphatidylinositols linking the hemopoietic tyrosine kinase fes to the cytoplasmic membrane in a phosphorylation dependent mechanism. It is also associated with cherubism.
See also
SH3 domain
External links
GeneReviews/NCBI/NIH/UW entry on Cherubism
Genetics Home Reference on SH3BP2 |
https://en.wikipedia.org/wiki/IBM%20Naval%20Ordnance%20Research%20Calculator | The IBM Naval Ordnance Research Calculator (NORC) was a one-of-a-kind first-generation (vacuum tube) computer built by IBM for the United States Navy's Bureau of Ordnance. It went into service in December 1954 and was likely the most powerful computer at the time. The Naval Ordnance Research Calculator (NORC), was built at the Watson Scientific Computing Laboratory under the direction of Wallace Eckert.
The computer was presented to the US Navy on December 2, 1954. At the presentation ceremony, it calculated pi to 3,089 digits, which was a record at the time. The calculation took only 13 minutes. In 1955, NORC was moved to the Naval Proving Ground at Dahlgren, Virginia. It was their main computer until 1958, when more modern computers were acquired. It continued to be used until 1963. Its design influenced the IBM 701 and subsequent machines in the IBM 700 series of computers.
Technology
The machine originally used Williams–Kilburn tubes for memory which stored 2,000 words electrostatically, with an access time of 8 microseconds. Each word consisted of 16 decimal digits, using four bits to represent each digit, plus two modulo-4 error-checking bits. A word could store a 13-digit number with sign and 2-digit index, or one instruction. NORC used four sets of 66 electrostatic tubes in parallel for memory. Each of the tubes in a set of 66 stored one bit of each of 500 words, so each of the four sets of 66 tubes stored 2,000 words. An upgrade to the addressing circuitry for the Williams tubes allowed memory per tube to be expanded from 500 bits to 900 bits, expanding the total memory to 3,600 words without needing to add any more Williams tubes.
At some point the Williams tube memory was replaced with 20,000 words of magnetic-core memory, with an access time of 8 microseconds.
The speed of the NORC was 15,000 operations per second. An addition took 15 microseconds, a multiplication took 31 microseconds, and a division took 227 microseconds, not counting memory |
https://en.wikipedia.org/wiki/Adrian%20Bejan | Adrian Bejan is a Romanian-American professor who has made contributions to modern thermodynamics and developed his constructal law. He is J. A. Jones Distinguished Professor of Mechanical Engineering at Duke University and author of the books Design in Nature, The Physics of Life , Freedom and Evolution and Time And Beauty: Why Time Flies And Beauty Never Dies
Early life and education
Bejan was born in Galaţi, a city on the Danube in Romania.
His mother, Marioara Bejan (1914–1998), was a pharmacist. His father, Dr. Anghel Bejan (1910–1976), was a veterinarian. Bejan showed an early talent in drawing, and his parents enrolled him in art school. He also excelled in basketball, which earned him a position on the Romanian national basketball team.
At age 19 Bejan won a scholarship to the United States and entered Massachusetts Institute of Technology in Cambridge, Massachusetts. In 1972 he was awarded BS and MS degrees as a member of the Honors Course in Mechanical Engineering. He graduated in 1975 with a PhD from MIT with a thesis titled "Improved thermal design of the cryogenic cooling system for a superconducting synchronous generator". His advisor was Joseph L. Smith Jr.
Career
From 1976 to 1978 Bejan was a Miller research fellow in at the University of California Berkeley working with Chang-Lin Tien. In 1978 he moved to Colorado and joined the faculty of the Department of Mechanical Engineering at the University of Colorado in Boulder. In 1982 Bejan published his first book, Entropy Generation Through Heat and Fluid Flow. The book is aimed at practical applications of the second law of thermodynamics, and presented his ideas on irreversibility, availability and exergy analysis in a form for engineers. In 1984 he published Convection Heat Transfer. In an era when researchers did heat transfer calculations using numerical methods on supercomputers, the book emphasized new research methods such as intersection of asymptotes, heatlines, and scale analysis to solv |
https://en.wikipedia.org/wiki/Willis%20Dysart | Willis Nelson Dysart (March 15, 1923 in Omega, Georgia - November 8, 2011) was an American mental calculator. His talent for arithmetic emerged at the age of three after his mother taught him to count. He quit school in the third grade (age 9) and pursued a career as a lightning calculator.
In 1938 Robert Ripley featured Dysart in his 'Believe It Or Not' newspaper column and introduced what would become Dysart's stage name - 'Willie the Wizard'.
In 1940 Dysart was recruited by a local radio station to tally votes in the US presidential election. Dysart would very quickly (much more quickly than rival radio stations aided by calculating machines) give "the exact standing of any candidate on the board, including his current total, the percentage of votes counted at that point and the probable outcome of the contest on the basis of existing information". Not content with that, Dysart would provide a little entertainment by, for instance, asking for the birth dates of the candidates and immediately giving the years, months, hours, minutes and seconds they had lived to that moment.
Dysart has given many live demonstrations of his skill at a range of venues. He has also appeared on numerous television shows, including I've Got a Secret, You Asked For It, The Art Linkletter Show and The Joe Pyne Show, which made him famous in the United States. He has also been the subject of psychological studies.
Although excelling at all kinds of arithmetic, Dysart's most startling demonstrations have been in addition and multiplication. Multiplying a pair of three-digit numbers is for Dysart a trivial task, which is why he breaks larger numbers into groups of three digits before multiplying them (many of the multiplications reported to have been made by Dysart involve six or nine-digit numbers). In this respect Dysart is unique among the documented calculators, some of whom – most notably Dutchman Wim Klein – multiplied large numbers by breaking them up into groups of two-digit num |
https://en.wikipedia.org/wiki/CAESAR%20Competition | The Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR) is a competition organized by a group of international cryptologic researchers to encourage the design of authenticated encryption schemes. The competition was announced at the Early Symmetric Crypto workshop in January 2013 and the final portfolio in February 2019.
Use Cases
The final CAESAR portfolio is organized into three use cases:
1: Lightweight applications (resource constrained environments)
2: High-performance applications
3: Defense in depth
Final Portfolio
The final portfolio announced by the CAESAR committee is:
CAESAR committee
The committee in charge of the CAESAR Competition consisted of:
Steve Babbage (Vodafone Group, UK)
Daniel J. Bernstein (University of Illinois at Chicago, USA, and Technische Universiteit Eindhoven, Netherlands); secretary, non-voting
Alex Biryukov (University of Luxembourg, Luxembourg)
Anne Canteaut (Inria Paris-Rocquencourt, France)
Carlos Cid (Royal Holloway, University of London, UK)
Joan Daemen (STMicroelectronics, Belgium)
Orr Dunkelman (University of Haifa, Israel)
Henri Gilbert (ANSSI, France)
Tetsu Iwata (Nagoya University, Japan)
Stefan Lucks (Bauhaus-Universität Weimar, Germany)
Willi Meier (FHNW, Switzerland)
Bart Preneel (COSIC, KU Leuven, Belgium)
Vincent Rijmen (KU Leuven, Belgium)
Matt Robshaw (Impinj, USA)
Phillip Rogaway (University of California at Davis, USA)
Greg Rose (kitchen4140, USA)
Serge Vaudenay (EPFL, Switzerland)
Hongjun Wu (Nanyang Technological University, Singapore) |
https://en.wikipedia.org/wiki/Biham%E2%80%93Middleton%E2%80%93Levine%20traffic%20model | The Biham–Middleton–Levine traffic model is a self-organizing cellular automaton traffic flow model. It consists of a number of cars represented by points on a lattice with a random starting position, where each car may be one of two types: those that only move downwards (shown as blue in this article), and those that only move towards the right (shown as red in this article). The two types of cars take turns to move. During each turn, all the cars for the corresponding type advance by one step if they are not blocked by another car. It may be considered the two-dimensional analogue of the simpler Rule 184 model. It is possibly the simplest system exhibiting phase transitions and self-organization.
History
The Biham–Middleton–Levine traffic model was first formulated by Ofer Biham, A. Alan Middleton, and Dov Levine in 1992. Biham et al found that as the density of traffic increased, the steady-state flow of traffic suddenly went from smooth flow to a complete jam. In 2005, Raissa D'Souza found that for some traffic densities, there is an intermediate phase characterized by periodic arrangements of jams and smooth flow. In the same year, Angel, Holroyd and Martin were the first to rigorously prove that for densities close to one, the system will always jam. Later, in 2006, Tim Austin and Itai Benjamini found that for a square lattice of side N, the model will always self-organize to reach full speed if there are fewer than N/2 cars.
Lattice space
The cars are typically placed on a square lattice that is topologically equivalent to a torus: that is, cars that move off the right edge would reappear on the left edge; and cars that move off the bottom edge would reappear on the top edge.
There has also been research in rectangular lattices instead of square ones. For rectangles with coprime dimensions, the intermediate states are self-organized bands of jams and free-flow with detailed geometric structure, that repeat periodically in time. In non-coprime rectangles |
https://en.wikipedia.org/wiki/Direct%20sum%20of%20modules | In abstract algebra, the direct sum is a construction which combines several modules into a new, larger module. The direct sum of modules is the smallest module which contains the given modules as submodules with no "unnecessary" constraints, making it an example of a coproduct. Contrast with the direct product, which is the dual notion.
The most familiar examples of this construction occur when considering vector spaces (modules over a field) and abelian groups (modules over the ring Z of integers). The construction may also be extended to cover Banach spaces and Hilbert spaces.
See the article decomposition of a module for a way to write a module as a direct sum of submodules.
Construction for vector spaces and abelian groups
We give the construction first in these two cases, under the assumption that we have only two objects. Then we generalize to an arbitrary family of arbitrary modules. The key elements of the general construction are more clearly identified by considering these two cases in depth.
Construction for two vector spaces
Suppose V and W are vector spaces over the field K. The cartesian product V × W can be given the structure of a vector space over K by defining the operations componentwise:
(v1, w1) + (v2, w2) = (v1 + v2, w1 + w2)
α (v, w) = (α v, α w)
for v, v1, v2 ∈ V, w, w1, w2 ∈ W, and α ∈ K.
The resulting vector space is called the direct sum of V and W and is usually denoted by a plus symbol inside a circle:
It is customary to write the elements of an ordered sum not as ordered pairs (v, w), but as a sum v + w.
The subspace V × {0} of V ⊕ W is isomorphic to V and is often identified with V; similarly for {0} × W and W. (See internal direct sum below.) With this identification, every element of V ⊕ W can be written in one and only one way as the sum of an element of V and an element of W. The dimension of V ⊕ W is equal to the sum of the dimensions of V and W. One elementary use is the reconstruction
of a finite vector space f |
https://en.wikipedia.org/wiki/BP%20holin%20family | The β-proteobacterial holin (BP-Hol) family (TC# 1.E.50) is a small family that includes members derived from a number of Burkholderia phage as well as a Poloromonas species. As of April 3, 2016, this family belongs to the Holin superfamily II. Members of Saier Bioinformatics Lab at University of California, San Diego found that the BP-Hol family is most closely related to the T7 holin family (TC# 1.E.6). These proteins are of 60 to 110 amino acyl residues (aas) in length and exhibit 1 or 2 transmembrane segments (TMSs). Some are annotated as type II hollins and may be related to members of the T7 Holin family (TC# 1.E.6), although BP-Hol proteins remain functionally uncharacterized. A representative list of the proteins belonging to the BP-Hol family can be found in the Transporter Classification Database.
See also
Holin
Lysin
Transporter Classification Database
Further reading
"BcepMigl_gp72 - Holin - Burkholderia phage BcepMigl - BcepMigl_gp72 gene & protein".www.uniprot.org. Retrieved 2016-03-29.
Gründling, Angelika; Manson, Michael D.; Young, Ry (2001-07-31). "Holins kill without warning".Proceedings of the National Academy of Sciences 98 (16): 9348–9352. . . . .
Preston, Gail M.; Studholme, David J.; Caldelari, Isabelle (2005-04-01). "Profiling the secretomes of plant pathogenic Proteobacteria". FEMS Microbiology Reviews 29 (2): 331–360. . . .
Reddy, Bhaskara L.; Saier Jr., Milton H. (2013-11-01). "Topological and phylogenetic analyses of bacterial holin families and superfamilies". Biochimica et Biophysica Acta (BBA) - Biomembranes 1828 (11): 2654–2671.. . .
Saier, Milton H.; Reddy, Bhaskara L. (2015-01-01). "Holins in Bacteria, Eukaryotes, and Archaea: Multifunctional Xenologues with Potential Biotechnological and Biomedical Applications". Journal of Bacteriology 197(1): 7–17. . . . .
Wang, I. N.; Smith, D. L.; Young, R. (2000-01-01). "Holins: the protein clocks of bacteriophage infections". Annual Review of Microbiology 54: 799–825. . .. |
https://en.wikipedia.org/wiki/Anna%20Bogomolnaia | Anna Vladimirovna Bogomolnaia () is a Russian economist specializing in microeconomics and game theory. She is a professor in economics at the Adam Smith Business School of the University of Glasgow,, and was until 2022 chief research fellow of the International Laboratory for Game Theory and Decision Making at the Higher School of Economics in Russia.
Education and career
After earning a master's degree in mathematics at Saint Petersburg State University in 1989, Bogomolnaia went to the Autonomous University of Barcelona for doctoral studies in economics. Her 1998 dissertation, Medians and Lotteries: Strategy-Proof Social Choice Rules for Restricted Domains, was supervised by .
After earning her doctorate, she worked at the University of Nottingham, became an assistant professor at Southern Methodist University, and earned tenure at Rice University in 2005. She took her positions at the University of Glasgow and the Higher School of Economics in 2013 and 2015 respectively.
Contributions
Bogomolnaia is known for her work on coalitions and on randomized solutions to assignment problems. With Hervé Moulin she formulated the probabilistic-serial procedure for solving the fair random assignment problem. With Matthew O. Jackson she introduced the concept of hedonic games to model coalition-forming in multiplayer games. |
https://en.wikipedia.org/wiki/Gauntlet%3A%20The%20Deeper%20Dungeons | Gauntlet: The Deeper Dungeons is an expansion pack for Gauntlet.
Gameplay
Gauntlet: The Deeper Dungeons is an expansion pack for the original computer ports of Gauntlet with 512 new levels. The player requires the original game to play the expansion. Available player characters are Merlin the wizard, Thor the warrior, Thyra the valkyrie, and Questor the elf.
The pack significantly increases the amount of enemies to fight. The blue flashing traps appear right from the beginning of the game; these traps remove the walls holding back the enemies. There are also more Deaths to be encountered.
Invisibility amulets and healing potions are more common than in the original game, as is poisoned cider. There is a limit on item inventory, so if players pick up too many potions they will not have enough room for the keys they need.
Development
It was released in 1987 by the British company U.S. Gold in the UK and Europe, and Mindscape in the United States for the Amstrad CPC, MSX, Atari ST, Commodore 64, and ZX Spectrum ports of Gauntlet. It was developed by Gremlin Graphics.
Many of its levels were entries in a competition throughout Europe in which ten winners were awarded prizes, a Gauntlet T-shirt and a copy of the program for their computers. The contest was announced in the instructions of many of the ported games. The levels are presented randomly and its artwork is the side panel artwork of the arcade cabinet with only the main characters shown. The enemies were removed from the image and replaced with a pink background.
Reception
Reviewers noted that the levels were much harder than those in the original game, although the consensus was that it was not quite as good as the first game or the newly released arcade sequel.
Paul Rixon for Page 6 said "The Deeper Dungeons are simply more of the same – quite a lot more in fact."
Tony Hetherington for Your Commodore said "If you enjoyed the original Gauntlet (if not, why not?) then you'll relish another 512 levels wh |
https://en.wikipedia.org/wiki/Data%20Matrix | A Data Matrix is a two-dimensional code consisting of black and white "cells" or dots arranged in either a square or rectangular pattern, also known as a matrix. The information to be encoded can be text or numeric data. Usual data size is from a few bytes up to 1556 bytes. The length of the encoded data depends on the number of cells in the matrix. Error correction codes are often used to increase reliability: even if one or more cells are damaged so it is unreadable, the message can still be read. A Data Matrix symbol can store up to 2,335 alphanumeric characters.
Data Matrix symbols are rectangular, usually square in shape and composed of square "cells" which represent bits. Depending on the coding used, a "light" cell represents a 0 and a "dark" cell is a 1, or vice versa. Every Data Matrix is composed of two solid adjacent borders in an "L" shape (called the "finder pattern") and two other borders consisting of alternating dark and light "cells" or modules (called the "timing pattern"). Within these borders are rows and columns of cells encoding information. The finder pattern is used to locate and orient the symbol while the timing pattern provides a count of the number of rows and columns in the symbol. As more data is encoded in the symbol, the number of cells (rows and columns) increases. Each code is unique. Symbol sizes vary from 10×10 to 144×144 in the new version ECC 200, and from 9×9 to 49×49 in the old version ECC 000 – 140.
Applications
The most popular application for Data Matrix is marking small items, due to the code's ability to encode fifty characters in a symbol that is readable at and the fact that the code can be read with only a 20% contrast ratio.
A Data Matrix is scalable; commercial applications exist with images as small as (laser etched on a silicon device) and as large as a 1 metre (3 ft) square (painted on the roof of a boxcar). Fidelity of the marking and reading systems are the only limitation.
The US Electronic Industries A |
https://en.wikipedia.org/wiki/Society%20for%20Research%20on%20Biological%20Rhythms | The Society for Research on Biological Rhythms (SRBR) is an international chronobiological research society with three key goals:
to promote the advancement and dissemination of basic and applied research in all aspects of biological rhythms.
to enhance the education and training of students and researchers in the field.
to foster interdisciplinary communication and an international exchange of ideas.
The society holds biennial meetings and informal gatherings, and participates in peer-reviewed science and evidence-based policy making. It is one of four prominent existing Chronology Research Societies and one of the 14 societies that make up The World Federation of Societies for Chronobiology. The organization is currently composed of 1,000 scientists and clinicians dedicated to studying biological rhythms and their impact. The society has its own official journal, the Journal of Biological Rhythms. Through its journal and meetings the society engages scientists of all backgrounds and nationalities. It advocates the need for funding in research areas in biological rhythms such as sleep and supports other research efforts such as the National Institutes of Health and National Science Foundation.
Founding and Early History
In 1986, Benjamin Rusak founded the Journal of Biological Rhythms. Rusak wanted an accompanying society that would hold meetings concerning research on biological rhythms, so he asked Fred W. Turek to organize the first meeting. The society was officially founded on November 12, 1986 by Fred Turek, Dave Hudson, Joe Takahashi, and Gene Block. The society is sometimes cited as being founded in 1988, as this was when the first meeting occurred.
Colin Pittendrigh, Turek's Ph.D. adviser, and one of the fathers of the field, was initially opposed to the society, worrying that it would have an isolating effect on the field rather than connecting it to related disciplines. Pittendrigh came around to the idea after the successful first meeting. Ture |
https://en.wikipedia.org/wiki/Michel%20Dumontier | Michel Justin Dumontier (born 1975) is a Distinguished Professor of Data Science at Maastricht University. His research focuses on methods to represent knowledge on the web with applications for drug discovery and personalized medicine. He was previously an Associate Professor of Medicine (Biomedical Informatics) at the Stanford University School of Medicine and an Associate Professor of Bioinformatics at Carleton University. He is best known for his work in biomedical ontologies, linked data and biomedical knowledge discovery. He has taught courses on biochemistry, bioinformatics, computational systems biology, and translational medicine. His research has been funded by Natural Sciences and Engineering Research Council, Canada Foundation for Innovation, Mitacs Canada, the Ontario Ministry of Research, Innovation and Science, CANARIE, and the US National Institutes of Health. Dumontier has an h-index of over 30 and has authored over 125 scientific publications in journals and conferences. He lives in Maastricht with his wife Tifany Irene Leung and their lionhead rabbit Storm.
Biography
Dumontier received his Bachelor of Science in biochemistry from the University of Manitoba in 1998. In his second year of undergraduate study, he joined the lab of James D. Jamieson where he developed a computational method to reconstruct the Golgi Apparatus. He then worked as research assistant at the Max Planck Institute of Biochemistry in Munich to investigate cellular dynamics of Rac1 protein of small GTPases. He defended his PhD in the department of biochemistry at the University of Toronto on the subject of "Species-specific optimizations of sequence and structure.". After a brief postdoctoral fellowship at the Blueprint Initiative, a project funded by Genome Canada and hosted in the Mount Sinai Hospital Research Institute, he joined the department of biology at Carleton University as an assistant professor in 2005. He was subsequently cross-appointed to the school of computer |
https://en.wikipedia.org/wiki/Cliff%20Jones%20%28computer%20scientist%29 | Clifford "Cliff" B. Jones (born 1 June 1944) is a British computer scientist, specializing in research into formal methods. He undertook a late DPhil at the Oxford University Computing Laboratory (now the Oxford University Department of Computer Science) under Tony Hoare, awarded in 1981. Jones' thesis proposed an extension to Hoare logic for handling concurrent programs, rely/guarantee.
Prior to his DPhil, Jones worked for IBM, between the Hursley and Vienna Laboratories. In Vienna, Jones worked with Peter Lucas, Dines Bjørner and others on the Vienna Development Method (VDM), originally as a method for specifying the formal semantics of programming languages, and subsequently for specifying and verifying programs.
Cliff Jones was a professor at the Victoria University of Manchester in the 1980s and early 1990s, worked in industry at Harlequin for a period, and is now a Professor of Computing Science at Newcastle University. He has been editor-in-chief of the Formal Aspects of Computing journal.
As well as formal methods, Jones also has interests in interdisciplinary aspects of computer science and the history of computer science.
Books
Jones has authored and edited many books, including:
Understanding Programming Languages, Jones, C.B. Springer, Cham. Print / online (2020).
Reflections on the Work of C.A.R. Hoare, Roscoe, A.W., Jones, C.B. and Wood, K. (eds.). Springer. (2010).
VDM: Une methode rigoureuse pour le development du logiciel, Jones, C.B. Masson, Paris. (1993).
MURAL: A Formal Development Support System, Jones, C.B., Jones, K.D., Lindsay, P.A. and Moore, R. (eds.). Springer-Verlag. (1991).
Systematic Software Development using VDM (2nd Edition), Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. , 1990
Case Studies in Systematic Software Development, Jones, C.B. and Shaw, R.C.F. (eds.). Prentice Hall International Series in Computer Science, Prentice Hall. (1989).
Essays in Computing Science, Hoare, |
https://en.wikipedia.org/wiki/Query%20language | A query language, also known as data query language or database query language (DQL), is a computer language used to make queries in databases and information systems. In database systems, query languages rely on strict theory to retrieve information. A well known example is the Structured Query Language (SQL).
Types
Broadly, query languages can be classified according to whether they are database query languages or information retrieval query languages. The difference is that a database query language attempts to give factual answers to factual questions, while an information retrieval query language attempts to find documents containing information that is relevant to an area of inquiry. Other types of query languages include:
Full-text. The simplest query language is treating all terms as bag of words that are to be matched with the postings in the inverted index and where subsequently ranking models are applied to retrieve the most relevant documents. Only tokens are defined in the CFG. Web search engines often use this approach.
Boolean. A query language that also supports the use of the Boolean operators AND, OR, NOT.
Structured. A language that supports searching within (a combination of) fields when a document is structured and has been indexed using its document structure.
Natural language. A query language that supports natural language by parsing the natural language query to a form that can be best used to retrieve relevant documents, for example with Question answering systems or conversational search.
Examples
Attempto Controlled English is a query language that is also a controlled natural language.
AQL is a query language for the ArangoDB native multi-model database system.
.QL is a proprietary object-oriented query language for querying relational databases; successor of Datalog;
CodeQL is the analysis engine used by developers to automate security checks, and by security researchers to perform variant analysis on GitHub.
Contextual Q |
https://en.wikipedia.org/wiki/Digital%20Library%20of%20Mathematical%20Functions | The Digital Library of Mathematical Functions (DLMF) is an online project at the National Institute of Standards and Technology (NIST) to develop a database of mathematical reference data for special functions and their applications. It is intended as an update of Abramowitz's and Stegun's Handbook of Mathematical Functions (A&S). It was published online on 7 May 2010, though some chapters appeared earlier. In the same year it appeared at Cambridge University Press under the title NIST Handbook of Mathematical Functions.
In contrast to A&S, whose initial print run was done by the U.S. Government Printing Office and was in the public domain, NIST asserts that it holds copyright to the DLMF under Title 17 USC 105 of the U.S. Code.
See also
NIST Dictionary of Algorithms and Data Structures |
https://en.wikipedia.org/wiki/DREAM%20Challenges | DREAM Challenges (Dialogue for Reverse Engineering Assessment and Methods) is a non-profit initiative for advancing biomedical and systems biology research via crowd-sourced competitions. Started in 2006, DREAM challenges collaborate with Sage Bionetworks to provide a platform for competitions run on the Synapse platform. Over 60 DREAM challenges have been conducted over the span of over 15 years.
Overview
DREAM Challenges were founded in 2006 by Gustavo Stolovizky from IBM Research and Andrea Califano from Columbia University. Current chair of the DREAM organization is Paul Boutros from University of California. Further organization spans emeritus chairs Justin Guinney and Gustavo Stolovizky, and multiple DREAM directors.
Individual challenges focus on tackling a specific biomedical research question, typically narrowed down to a specific disease. A prominent disease focus has been on oncology, with multiple past challenges focused on breast cancer, acute myeloid leukemia, and prostate cancer or similar diseases. The data involved in an individual challenge reflects the disease context; while cancers typically involve data such as mutations in the human genome, gene expression and gene networks in transcriptomics, and large scale proteomics, newer challenges have shifted towards single cell sequencing technologies as well as emerging gut microbiome related research questions, thus reflecting trends in the wider research community.
Motivation for DREAM Challenges is that via crowd-sourcing data to a larger audience via competitions, better models and insight is gained than if the analysis was conducted by a single entity. Past competitions have been published in such scientific venues as the flagship journals of the Nature Portfolio and PLOS publishing groups. Results of DREAM challenges are announced via web platforms, and the top performing participants are invited to present their results in the annual RECOMB/ISCB Conferences with RSG/DREAM organized by the |
https://en.wikipedia.org/wiki/Kim%20Sterelny | Kim Sterelny (born 1950) is an Australian philosopher and professor of philosophy in the Research School of Social Sciences at Australian National University and Victoria University of Wellington. He is the winner of several international prizes in the philosophy of science, and was previously editor of Biology and Philosophy. He is also a member of the Australian Academy of the Humanities. He is currently the First Vice President of the Division for Logic, Methodology and Philosophy of Science and Technology of the International Union of History and Philosophy of Science and Technology (2020–2023).
Work
Sterelny's principal area of research is in the philosophy of biology. He states "the development of evolutionary biology since 1858 is one of the great intellectual achievements of science." Sterelny has also written extensively about the philosophy of psychology. He is the author of many important papers in these areas, including widely anthologised papers on group selection, meme theory and cultural evolution such as "Return of the Gene" (with Philip Kitcher), "Memes Revisited" and "The Evolution and Evolvability of Culture."
Together with his former student Paul Griffiths, in 1999, Sterelny published Sex and Death, a comprehensive treatment of problems and alternative positions in the philosophy of biology. This book incorporated a number of the positions developed in previous articles on the range of topics in the philosophy of biology. At certain points Sterelny and his coauthor differed (for example, on the Darwinian treatment of emotions and on the prospects for developmental systems theory).
In 2004 Sterelny's book Thought in a Hostile World: The Evolution of Human Cognition received the Lakatos Award for a distinguished contribution to the philosophy of science. This book provides a Darwinian account of the nature and evolution of human cognitive capacities, and is an important alternative to nativist accounts familiar from evolutionary psychology. By c |
https://en.wikipedia.org/wiki/Zoophorus | Zoophorus () and Zophorus (), meaning "bearing animals", was the Ancient Greek term for a decorated frieze between the architrave and cornice, typically with a continuous bas-relief. A zoophoric column is a pillar supporting the figure of an animal. The word is rarely used in modern English architectural writing. |
https://en.wikipedia.org/wiki/Iota%20subscript | The iota subscript is a diacritic mark in the Greek alphabet shaped like a small vertical stroke or miniature iota placed below the letter. It can occur with the vowel letters eta , omega , and alpha . It represents the former presence of an offglide after the vowel, forming a so‐called "long diphthong". Such diphthongs (i.e., )—phonologically distinct from the corresponding normal or "short" diphthongs (i.e., )—were a feature of ancient Greek in the pre-classical and classical eras.
The offglide was gradually lost in pronunciation, a process that started already during the classical period and continued during the Hellenistic period, with the result that, from approximately the 1st century BC onwards, the former long diphthongs were no longer distinguished in pronunciation from the simple long vowels (long monophthongs) respectively.
During the Roman and Byzantine eras, the iota, now mute, was sometimes still written as a normal letter but was often simply left out. The iota subscript was invented by Byzantine philologists in the 12th century AD as an editorial symbol marking the places where such spelling variation occurred.
The alternative practice, of writing the mute iota not under, but next to the preceding vowel, is known as iota adscript. In mixed-case environments, it is represented either as a slightly reduced iota (smaller than regular lowercase iota), or as a full-sized lowercase iota. In the latter case, it can be recognized as iota adscript by the fact that it never carries any diacritics (breathing marks, accents).
In uppercase-only environments, it is represented again either as slightly reduced iota (smaller than regular lowercase iota), or as a full-sized uppercase Iota. In digital environments, and for linguistic reasons also in all other environments, the representation as a slightly reduced iota is recommended. There are Unicode codepoints for all Greek uppercase vowels with iota adscript (for example, ), allowing for easy implementati |
https://en.wikipedia.org/wiki/List%20of%20Ukrainian%20flags | The following is a list of flags of Ukraine:
State flag
Presidential Standard
Military flags
Flags of service branches
Command Standards
Maritime flags
Former flags
Personal naval flags
Former flags
Government and non-military security forces
Flags of Ukrainian regions
Flags of oblasts
Flags of cities with special status
Flags of other cities
Regional and minority flags
Historical flags
Kingdom of Galicia–Volhynia
Kingdom of Galicia and Lodomeria
Cossack Hetmanate
Crimean Khanate (1441–1478)
Ukrainian People's Republic and Ukrainian State
Maritime flags
Royal Family standards
Organization of Ukrainian Nationalists
Flags of occupational powers
Ottoman Empire
Poland and Lithuania
Russian Empire (1654–1917)
Maritime flags
Habsburg Monarchy, the Austrian Empire, and Austria–Hungary from 1772 to 1918
Makhnovshchina
Soviet Union and Ukrainian SSR
Kingdom of Romania
ending flag
Nazi Germany
Miscellaneous
External links
Flags of Ukraine from Vexillographia (in Russian)
Flags
Ukraine
Flag |
https://en.wikipedia.org/wiki/Ioliomics | Ioliomics (from a portmanteau of ions and liquids) is the study of ions in liquids (or liquid phases) and stipulated with fundamental differences of ionic interactions. Ioliomics covers a broad research area concerning structure, properties and applications of ions involved in various biological and chemical systems. The concept of this research discipline is related to other comprehensive research fields, such as genomics, proteomics, glycomics, petroleomics, etc., where the suffix -omics is used for describing the comprehensiveness of data.
Fundamental nature
The nature of chemical reactions and their description is one of the most fundamental problems in chemistry. The concepts of covalent and ionic bonds which emerged in the beginning of the 20th century specify the profound differences between their electronic structures. These differences, in turn, lead to dramatically different behavior of covalent and ionic compounds both in the solution and solid phase. In the solid phase, ionic compounds, e.g. salts, are prone to formation of crystal lattices; in polar solvents, they dissociate into ions surrounded by solvate shells, thus rendering the solution highly ionic conductive. In contrast to covalent bonds, ionic interactions demonstrate flexible, dynamic behavior, which allows tuning ionic compounds to obtain desired properties.
Importance
Ionic compounds interact strongly with the solvent medium; therefore, their impact on chemical and biochemical processes involving ions can be significant. Even in the case of simplest ions and solvents, the presence of the former can lead to rearrangement and restructuring of the latter. It is established that ionic reactions are involved in numerous phenomena at the scales of whole galaxies or single living cells. To name a few, in living cells, metal ions bind to metalloenzymes and other proteins therefore modulating their activity; ions are involved in the control of neuronal functioning during sleep – wakefulness cy |
https://en.wikipedia.org/wiki/Autoinducer-2 | Autoinducer-2 (AI-2), a furanosyl borate diester or tetrahydroxy furan (species dependent), is a member of a family of signaling molecules used in quorum sensing. AI-2 is one of only a few known biomolecules incorporating boron. First identified in the marine bacterium Vibrio harveyi, AI-2 is produced and recognized by many Gram-negative and Gram-positive bacteria. AI-2 arises by the reaction of 4,5-dihydroxy-2,3-pentanedione, which is produced enzymatically, with boric acid and is recognized by the two-component sensor kinase LuxPQ in Vibrionaceae.
AI-2 is actively transported by the Lsr ABC-type transporter into the cell in Enterobacteriaceae and few other bacterial taxa such as Pasteurella, Photorhabdus, Haemophilus, and Bacillus, where it is phosphorylated by LsrK. Then, Phospho-AI-2 binds the transcriptional repressor protein, LsrR, which subsequently is released from the promoter/operator region of the lsr operon – and transcription of the lsr genes is initiated. AI-2 signalling is also regulated by glucose and cAMP/CRP via the lsr operon. In the presence of glucose, low levels of cAMP/CRP result in almost no lsr operon (lsrABCDFG) expression. Without glucose, cAMP-CRP is needed to stimulate the lsr expression, while LsrR represses its expression in the absence of the inducer, phospho-AI-2. As AI-2 accumulates, more AI-2 is taken in via LsrABCD, phosphorylated via LsrK, and the lsr transcription is de-repressed, enabling even more AI-2 uptake.
Doubts have been expressed regarding AI-2's status as a universal signal. Although the luxS gene, which encodes the protein responsible for AI-2 production is widespread, the latter has mainly a primary metabolic role in the recycling of S-adenosyl-L-methionine, with AI-2 being a by-product of that process. An unequivocally AI-2 related behavior was found to be restricted primarily to organisms bearing known AI-2 receptor genes. Thus, while it is certainly true that some bacteria respond to AI-2, it is doubtful that it |
https://en.wikipedia.org/wiki/Nitrogen-vacancy%20center | The nitrogen-vacancy center (N-V center or NV center) is one of numerous point defects in diamond. Its most explored and useful property is its photoluminescence, which allows observers to read out its spin-state. The NV center's electron spin, localized at atomic scales, can be manipulated at room temperature by external factors such as magnetic, or electric fields, microwave radiation, or optical light, resulting in sharp resonances in the intensity of the photoluminescence. These resonances can be explained in terms of electron spin related phenomena such as quantum entanglement, spin–orbit interaction and Rabi oscillations, and analysed using advanced quantum optics theory. An individual NV center can be used as a basic unit for a quantum computer, a qubit, and used for quantum cryptography. Further potential applications in novel fields of electronics and sensing include spintronics, masers, and quantum sensors. If the charge is not specified the term "NV center" refers to the negatively charged NV− center.
Structure
The nitrogen-vacancy center is a point defect in the diamond lattice. It consists of a nearest-neighbor pair of a nitrogen atom, which substitutes for a carbon atom, and a lattice vacancy.
Two charge states of this defect, neutral NV0 and negative NV−, are known from spectroscopic studies using optical absorption, photoluminescence (PL), electron paramagnetic resonance (EPR) and optically detected magnetic resonance (ODMR), which can be viewed as a hybrid of PL and EPR; most details of the structure originate from EPR. The nitrogen atom on one hand has five valence electrons. Three of them are covalently bonded to the carbon atoms, while the other two remain non-bonded and are called a lone pair. The vacancy on the other hand has three unpaired electrons. Two of them form a quasi covalent bond and one remains unpaired. The overall symmetry, however, is axial (trigonal C3V); one can visualize this by imagining the three unpaired vacancy electrons |
https://en.wikipedia.org/wiki/State%20Research%20Center%20of%20Virology%20and%20Biotechnology%20VECTOR | The State Research Center of Virology and Biotechnology VECTOR, also known as the Vector Institute (), is a biological research center in Koltsovo, Novosibirsk Oblast, Russia. It has research facilities and capabilities for all levels of biological hazard, CDC levels 1–4. It is one of two official repositories for the now-eradicated smallpox virus, and was part of the system of laboratories known as the Biopreparat.
The facility was upgraded and secured using modern cameras, motion sensors, fences and biohazard containment systems. Its relative seclusion makes security an easier task. Since its inception there has been an army regiment guarding the facility.
At least in Soviet times the facility was a nexus for biological warfare research (see Soviet biological weapons program), though the nature of any ongoing research in this area is uncertain.
As of April 2022 the Vector Institute is the Russian site for the WHO H5 Reference Laboratory Network, which responds "to the public health needs arising from avian influenza A(H5N1) infection in humans and influenza pandemic preparedness."
History
Organized in 1974, the center has a long history of virology, making impressive Soviet contribution to smallpox research. Genetic engineering projects included creation of viruses that manufacture toxins as well as research on bioregulators and various peptides that function in the nervous system. In the post-Soviet times the center made research and development contributions in many projects like a vaccine for Hepatitis A, influenza vaccines, vaccines for the Ebola virus, antiviral drugs with nucleotide analogs, test-systems for diagnostics of HIV and Hepatitis B and other development. It is one of the two laboratories worldwide that are authorized to keep smallpox.
COVID-19 vaccine development
In March 2020 it was reported that Russian scientists have begun to test vaccine prototypes for the new coronavirus disease (COVID-19), with the plan of presenting the most effect |
https://en.wikipedia.org/wiki/Reinventing%20Gravity | Reinventing Gravity: A Scientist Goes Beyond Einstein is a science text by John W. Moffat, which explains his controversial theory of gravity.
Moffat's theory
Moffat's work culminates in his nonsymmetric gravitational theory and scalar–tensor–vector gravity (now called MOG). His theory explains galactic rotation curves without invoking dark matter. He proposes a variable speed of light approach to cosmological problems, which posits that G/c is constant through time, but G and c separately have not been. Moreover, the speed of light c may have been much higher (at least trillion trillion times faster than the normal speed of light) during early moments of the Big Bang. His recent work on inhomogeneous cosmological models purports to explain certain anomalous effects in the CMB data, and to account for the recently discovered acceleration of the expansion of the universe.
The theory is based on an action principle and postulates the existence of a vector field, while elevating the three constants of the theory to scalar fields. In the weak-field approximation, STVG produces a Yukawa-like modification of the gravitational force due to a point source. Intuitively, this result can be described as follows: far from a source gravity is stronger than the Newtonian prediction, but at shorter distances, it is counteracted by a repulsive fifth force due to the vector field.
Reception
The book was positively reviewed in EE Times, Physics World and Publishers Weekly.
See also
Einstein Wrote Back, another book by Moffat |
https://en.wikipedia.org/wiki/Stygofauna | Stygofauna are any fauna that live in groundwater systems or aquifers, such as caves, fissures and vugs. Stygofauna and troglofauna are the two types of subterranean fauna (based on life-history). Both are associated with subterranean environments – stygofauna are associated with water, and troglofauna with caves and spaces above the water table. Stygofauna can live within freshwater aquifers and within the pore spaces of limestone, calcrete or laterite, whilst larger animals can be found in cave waters and wells. Stygofaunal animals, like troglofauna, are divided into three groups based on their life history - stygophiles, stygoxenes, and stygobites.
Stygophiles inhabit both surface and subterranean aquatic environments, but are not necessarily restricted to either.
Stygoxenes are like stygophiles, except they are defined as accidental or occasional presence in subterranean waters. Stygophiles and stygoxenes may live for part of their lives in caves, but don't complete their life cycle in them.
Stygobites are obligate, or strictly subterranean, aquatic animals and complete their entire life in this environment.
Extensive research of stygofauna has been undertaken in countries with ready access to caves and wells such as France, Slovenia, the US and, more recently, Australia. Many species of stygofauna, particularly obligate stygobites, are endemic to specific regions or even individual caves. This makes them an important focus for the conservation of groundwater systems.
Diet and lifecycle
Stygofauna have adapted to the limited food supply and are extremely energy efficient. Stygofauna feed on plankton, bacteria, and plants found in streams.
To survive in an environment where food is scarce and oxygen levels are low, stygofauna often have very low metabolism. As a result, stygofauna may live longer than other terrestrial species. For example, the crayfish Orconectes australis from Shelta Cave in Alabama has been estimated to reproduce at 100 years and live |
https://en.wikipedia.org/wiki/Mac%20OS%20Georgian | Mac OS Georgian is a character encoding for Mac OS created by Michael Everson for use in his fonts. It is not an official Mac OS character set.
The encoding is a form of extended ASCII, with the Georgian characters occupying the upper half of the 8-bit code space. Like the Georgian Unicode block, Mac OS Georgian encodes the characters from the Asomtavruli and Mkhedruli scripts (the former is used primarily in Georgian Orthodox Church materials, while the latter is used for most Georgian writing); it also includes a number of symbols and punctuation marks not found in 7-bit ASCII. All characters in Mac OS Georgian that also appear in Mac OS Roman are placed at the same locations as in Mac OS Roman, aiding compatibility with applications designed for Mac OS Roman.
Each character is shown with its equivalent Unicode code point. Only the second half of the table (code points 128–255) is shown, the first half (code points 0–127) being the same as ASCII. |
https://en.wikipedia.org/wiki/Pamela%20Hardt-English | Pamela Hardt-English is an American food scientist and computer scientist who created Resource One, a "people's computing center" in 1972 at Project One, a "technological commune" in San Francisco, California.
Education
Pamela Hardt-English was a graduate student in computer science at the University of California, Berkeley. She left the computer science program in 1970 in protest against the American incursion into Cambodia. As she noted, "I dropped out of school because I decided that I spent too much time preparing to do stuff and not enough time actually doing anything."
Resource One
Hardt-English joined Project One, a live-work community (sometimes referred to as a "technological commune"), conceptualized around Symbas School — an alternative high school — and housed in a multistory former factory building in San Francisco, in 1970. In 1972, she arranged for the delivery of a decommissioned SDS 940, a mainframe computer, to the commune, establishing Resource One. Resource One's goal was to link together the centers of counterculture across the Bay Area with a computer network.
Career
After leaving Project One, Hardt-English received master's degrees in agricultural engineering and food science from the University of California, Davis. She is currently the president of PhF Specialists, Inc. in San Jose, California.
Notes
Living people
American women computer scientists
American computer scientists
Women food scientists
University of California, Davis alumni
Year of birth missing (living people)
21st-century American women |
https://en.wikipedia.org/wiki/Kilimandjaro%20%28song%29 | "Kilimandjaro", sometimes known as "Les Neiges du Kilimandjaro" (The Snows of Kilimanjaro) is a famous French-language song by French singer Pascal Danel released in 1966. It was considered one of the definitive French songs of the 1960s, Danel's biggest hit, and one of the most-broadcast French songs on French radio. The lyrics were written by Michel Delancray and the music was composed by Danel himself. The arrangement of the song was by Laurent Voulzy. The song was certified platinum, topping the French charts, and it has been the subject of tens of cover versions in many languages.
The song was successful in many European countries, the Middle East and Asia, most particularly Japan. Pascal Danel released many language versions including Italian, Spanish, German, Japanese, and Corsican.
Later on, he sang it live at the Olympia in 1980 and in the 2007 tour "Âge tendre" and 2008 tour "Têtes de bois" with revised orchestration versions. Other artists have interpreted the song in German, Spanish, Hebrew, and Portuguese, with chart successes in various countries.
In 1989, Pascal Danel proposed a remixed version of "Kilimandjaro" that was produced by his son, and the album containing the remix was certified gold.
In popular culture
"Kilimandjaro" was named as one of the Top 15 best French songs of the decade according to a survey by Télé 7 Jours. In the television broadcast Succès fous, it was named third most popular after a song by Daniel Balavoine and another by Joe Dassin. In the 1990s, the song came back yet again through the show Les Années Twist (meaning the Twist Years). The song was featured on the soundtrack of Robert Guédiguian's 2011 film The Snows of Kilimanjaro titled in French ().
1966 songs
French songs
French-language songs
Songs about Africa
Songs about mountains
Songs about weather
1966 singles |
https://en.wikipedia.org/wiki/Pierre%20Bieliavsky | Pierre Bieliavsky (born 1970 in Brussels, Belgium), is a Belgian mathematician.
Biography
Pierre Bieliavsky graduated from the Université libre de Bruxelles in 1991. He completed a doctorate in 1995 under the supervision of Michel Cahen at the Université libre de Bruxelles on Symmetric symplectic spaces.
He is currently professor of mathematics at the Université catholique de Louvain. His research subjects are theory of symmetric space, harmonic analysis, noncommutative geometry and mathematical physics.
Prizes
Prix Eugène-Catalan from the Royal Academy of Science, Letters and Fine Arts of Belgium (2015)
Publications
with Victor Gayral, Deformation Quantization for Actions of Kählerian Lie Groups, Volume 236, Number 1115, Memoirs of the American Mathematical Society (2014)
Semisimple symplectic symmetric spaces, Geom. Dedicata 73 (1998), no. 3, 245–273.
Symmetric spaces and star representations, Advances in Geometry, Progr. Math. 172, Birkhauser (Boston), 1999, 71–82.
Strict quantization of solvable symmetric spaces, Journal of Symplectic Geometry 1 (2002), no. 2, 269–320. (math.QA/0010004.)
with Y. Maeda, Convergent star product algebras on "$ax+b$", Lett. Math. Phys. 62 (2002), no. 3, 233–243.
with M. Massar, Oscillatory integral formulae for left-invariant star products on a class of Lie groups, Lett. Math. Phys. 58 (2001), no. 2, 115–128.
with M. Rooman, Ph. Spindel, Regular Poisson structures on massive non-rotating BTZ black holes, Nuclear Physics B 645 (2002), no. 1-2, 349–364.
with M.Pevzner, Symmetric spaces and star representations III. The Poincarré disk, Noncommutative Harmonic Analysis, Progress in Mathematics, 220, Birkhäuser Boston, P. Delorme, M. Vergne eds (2004). (math.RT/0209206). |
https://en.wikipedia.org/wiki/Float%20%28liquid%20level%29 | Liquid level floats, also known as float balls, are spherical, cylindrical, oblong or similarly shaped objects, made from either rigid or flexible material, that are buoyant in water and other liquids. They are non-electrical hardware frequently used as visual sight-indicators for surface demarcation and level measurement. They may also be incorporated into switch mechanisms or translucent fluid-tubes as a component in monitoring or controlling liquid level.
Liquid level floats, or float switches, use the principle of material buoyancy (differential densities) to follow fluid levels. Solid floats are often made of plastics with a density less than water or other application liquid, and so they float. Hollow floats filled with air are much less dense than water or other liquids, and are appropriate for some applications.
Stainless Steel Magnetic floats are tubed magnetic floats, used for reed switch activation; they have a hollow tubed connection running through them. These magnetic floats have become standard equipment where strength, corrosion resistance and buoyancy are necessary. They are manufactured by welding two drawn half shells together. The welding process is critical for the strength and durability of the float. The weld is a full penetration weld providing a smoothly finished seam, hardly distinguishable from the rest of the float surface.
Liquid level floats can also be constructed with thermoplastic corrosion-resistant materials. These materials include PVC, Polypropylene and PVDF. An example of an application that would require such materials would be if a manufacturer of metal plating and metal finishing lines required continuous level measurement of their chromic acid tanks. Stainless Steel would rapidly corrode in chromic acid, which is why one would have the option to go with a PVDF float, which is a material with great chemical resistance to chromic acid.
Thermoplastic level floats are a great alternative to some other forms of level sensors |
https://en.wikipedia.org/wiki/Gr%C3%BCnbaum%E2%80%93Rigby%20configuration | In geometry, the Grünbaum–Rigby configuration is a symmetric configuration consisting of 21 points and 21 lines, with four points on each line and four lines through each point. Originally studied by Felix Klein in the complex projective plane in connection with the Klein quartic, it was first realized in the Euclidean plane by Branko Grünbaum and John F. Rigby.
History and notation
The Grünbaum–Rigby configuration was known to Felix Klein, William Burnside, and H. S. M. Coxeter. Its original description by Klein in 1879 marked the first appearance in the mathematical literature of a 4-configuration, a system of points and lines with four points per line and four lines per point.
In Klein's description, these points and lines belong to the complex projective plane, a space whose coordinates are complex numbers rather than the real-number coordinates of the Euclidean plane.
The geometric realisation of this configuration as points and lines in the Euclidean plane, based on overlaying three regular heptagrams, was only established much later, by . Their paper on it became the first of a series of works on configurations by Grünbaum, and contained the first published graphical depiction of a 4-configuration.
In the notation of configurations, configurations with 21 points, 21 lines, 4 points per line and 4 lines per point are denoted (214). However, the notation does not specify the configuration itself, only its type (the numbers of points, lines, and incidences). It also does not specify whether the configuration is purely combinatorial (an abstract incidence pattern of lines and points) or whether the points and lines of the configuration are realizable in the Euclidean plane or another standard geometry.
The type (214) is highly ambiguous: there is an unknown but large number of (combinatorial) configurations of this type, 200 of which were listed by .
Construction
The Grünbaum–Rigby configuration can be constructed from the seven points of a regular heptagon a |
https://en.wikipedia.org/wiki/Epibrassicasterol | Epibrassicasterol (also called crinosterol) is a type of cholesterol most commonly found in marine invertebrates. Epibrassicasterol is a 28 carbon cholesterol with an alpha oriented methyl group at carbon 24. It is often mixed isomerically with the more common beta-isomer, brassicasterol. Epibrassicasterol can be used as a biomarker to identify the presence of marine life in an environment and can be dated based on the location of fossilized remains in various rock structures.
Early Findings
Studies in the late 1980s and 1990s focused on identifying multiple organic biomarkers commonly produced by marine life. Both epibrassicasterol and brassicasterol were found to be present in algae and mollusks. However, because many mollusks eat algae and mollusks often produce extra alkyl side chains on organic molecules that they create, it is believed that epibrassicasterol and brassicasterol originally come only from algae. The occurrence of both of these isomers simultaneously can indicate a high algal presence in the local environment. |
https://en.wikipedia.org/wiki/WLAE-TV | WLAE-TV (channel 32) is an educational independent television station in New Orleans, Louisiana, United States. The station is owned by the Educational Broadcasting Foundation, a partnership between the Willwoods Community (a Catholic-related organization) and the Louisiana Educational Television Authority (operator of Louisiana Public Broadcasting, which owns the PBS member stations in Louisiana that are located outside of New Orleans). WLAE's studios are located on Howard Avenue in New Orleans, and its transmitter is located on Paris Road/Highway 47 (northeast of Chalmette).
History
As a PBS member station
In 1978, a group of married couples, supported by the Catholic Church, formed the Willwoods Community. The organization joined forces with the Louisiana Educational Television Authority, which had been looking for a way to get its locally-based programming into the state's largest market. At the time, WYES-TV (channel 12) was the city's sole public TV station, and Willwoods sought to obtain the other non-commercial license allocated to the New Orleans market. On December 14, 1981, under the banner of the "Educational Broadcasting Foundation," the partnership was granted an educational station license from the Federal Communications Commission (FCC).
WLAE-TV first signed on the air on July 8, 1984; it originally served as a member station of the Public Broadcasting Service (PBS). WLAE-TV operated as a secondary member of the network through PBS' Program Differentiation Plan, and thus only carried 25% of the programming broadcast by PBS, while the remainder aired on WYES. As a side note, Sesame Street was one of the few programs that was shown on both stations. In addition to offering PBS programming, WLAE also aired, and still airs, locally produced educational programs, as well as select programming from Louisiana Public Broadcasting (mostly consisting of news and public affairs programming).
WLAE is also one of very few public television stations to televi |
https://en.wikipedia.org/wiki/Tandy%202000 | The Tandy 2000 is a personal computer introduced by Radio Shack in September 1983 based on the 8 MHz Intel 80186 microprocessor running MS-DOS. By comparison, the IBM PC XT (introduced in March 1983) used the older 4.77 MHz Intel 8088 processor, and the IBM PC/AT (introduced in 1984) would later use the newer 6 MHz Intel 80286. Due to the 16-bit data bus and more efficient instruction decoding of the 80186, the Tandy 2000 ran significantly faster than other PC compatibles, and slightly faster than the PC AT. (Later IBM upgraded the 80286 in new PC AT models to 8 MHz, though with wait states.) The Tandy 2000 was the company's first computer built around an Intel x86 series microprocessor; previous models used the Zilog Z80 and Motorola 6809 CPUs.
While touted as being compatible with the IBM XT, the Tandy 2000 was different enough that most existing PC software that was not purely text-oriented failed to work properly.
The Tandy 2000 and its special version of MS-DOS supported up to 768 KB of RAM, significantly more than the 640 KB limit imposed by the IBM architecture. It used 80-track double-sided quad-density floppy drives of 720 KB capacity; the IBM standard at the time of the introduction of the Tandy 2000 was only 360 KB.
The Tandy 2000 had both "Tandy" and "TRS-80" logos on its case, marking the start of the phaseout of the "TRS-80" brand.
History
The introduction of IBM's Model 5150 Personal Computer in August 1981 created an entirely new market for microcomputers. Many hardware and software companies were founded specifically to exploit IBM's and Microsoft's new presence as a standard-setter for small computers, and most other established manufacturers shifted focus to it as well.
By this date Tandy/Radio Shack had been in the small-computer market for four years, since its August 1977 introduction of the TRS-80 Model I. The new computer division followed in October 1979 with the TRS-80 Model II—a high-end business-oriented system. In 1983 the TRS-80 M |
https://en.wikipedia.org/wiki/Particle%20velocity | Particle velocity (denoted or ) is the velocity of a particle (real or imagined) in a medium as it transmits a wave. The SI unit of particle velocity is the metre per second (m/s). In many cases this is a longitudinal wave of pressure as with sound, but it can also be a transverse wave as with the vibration of a taut string.
When applied to a sound wave through a medium of a fluid like air, particle velocity would be the physical speed of a parcel of fluid as it moves back and forth in the direction the sound wave is travelling as it passes.
Particle velocity should not be confused with the speed of the wave as it passes through the medium, i.e. in the case of a sound wave, particle velocity is not the same as the speed of sound. The wave moves relatively fast, while the particles oscillate around their original position with a relatively small particle velocity. Particle velocity should also not be confused with the velocity of individual molecules, which depends mostly on the temperature and molecular mass.
In applications involving sound, the particle velocity is usually measured using a logarithmic decibel scale called particle velocity level. Mostly pressure sensors (microphones) are used to measure sound pressure which is then propagated to the velocity field using Green's function.
Mathematical definition
Particle velocity, denoted , is defined by
where is the particle displacement.
Progressive sine waves
The particle displacement of a progressive sine wave is given by
where
is the amplitude of the particle displacement;
is the phase shift of the particle displacement;
is the angular wavevector;
is the angular frequency.
It follows that the particle velocity and the sound pressure along the direction of propagation of the sound wave x are given by
where
is the amplitude of the particle velocity;
is the phase shift of the particle velocity;
is the amplitude of the acoustic pressure;
is the phase shift of the acoustic pressure.
Taking the La |
https://en.wikipedia.org/wiki/Menyh%C3%A9rt%20Pal%C3%A1gyi | Menyhért Palágyi, in German Melchior or Meinhert Palagyi (16 or 26 December 1859 in Paks, Hungary – 14 July 1924 in Darmstadt, Germany) was a Hungarian philosopher, mathematician, and physicist of Jewish descent (his original name was Silberstein, it was changed in 1895). He was the elder brother of the Hungarian poet Ludwig Palágyi.
Palágyi presented new theory of space and time (1901), which had a certain similarity with the space-time formalism of Henri Poincaré and Hermann Minkowski in the context of special relativity theory (e.g. Palagyi used the imaginary time coordinate it as the fourth dimension of "space-time"). However, his philosophy had little in common with the physics of relativity theory. Therefore, in 1914 he expressed his criticism of the theories of Albert Einstein and Hermann Minkowski. However, in a subsequent paper Max Born showed that Palagyi's criticism was misguided.
Palagyi's concept of vital fantasy makes him an ancestor of cybernetic anthropology. His theory of virtual movement forms the basis for different movement-therapeutic concepts. Palágyi also engaged in controversy with Edmund Husserl.
Works
Madách Imre élete és költészete (I. Madachs Leben u. Dichtungen. Mit Portr. Von M. P.). Budapest: Athenaeum, 1900.
Neue Theorie des Raumes und der Zeit. Die Grundbegriffe einer Metageometrie. Unveränd. reprogr. Nachdr. d. Ausg. Leipzig, Engelmanns Verlag, 1901. Darmstadt: Wiss. Buchges., 1967.
Kant und Bolzano: Eine krit. Parallele. Halle a.S.: M. Niemeyer, 1902.
Der Streit der Psychologisten und Formalisten in der modernen Logik. Leipzig: W. Engelmann, 1902.
Die Relativitätstheorie in der modernen Physik. Vortrag gehalten auf dem 85. Naturforschertag in Wien. Berlin: G. Reimer, 1914.
Zur Weltmechanik. Beiträge zur Metaphysik der Physik. Mit einem Geleitwort von Ernst Gehrcke. Leipzig. Verlag von Johann Ambrosius Barth. 1925
Naturphilosophische Vorlesungen: Über die Grundprobleme des Bewusstseins und des Lebens. Leipzig: Johann Ambr |
https://en.wikipedia.org/wiki/Watershed%20area%20%28medical%29 | Watershed area is the medical term referring to regions of the body, that receive dual blood supply from the most distal branches of two large arteries, such as the splenic flexure of the large intestine. The term refers metaphorically to a geological watershed, or drainage divide, which separates adjacent drainage basins.
During times of blockage of one of the arteries that supply the watershed area, such as in atherosclerosis, these regions are spared from ischemia by virtue of their dual supply. However, during times of systemic hypoperfusion, such as in disseminated intravascular coagulation or heart failure, these regions are particularly vulnerable to ischemia because they are supplied by the most distal branches of their arteries, and thus the least likely to receive sufficient blood.
Watershed areas are found in the brain, where areas are perfused by both the anterior and middle cerebral arteries, and in the intestines, where areas are perfused by both the superior and inferior mesenteric arteries (i.e., splenic flexure). Additionally, the sigmoid colon and rectum form a watershed zone with blood supply from inferior mesenteric, pudendal and iliac circulations. Hypoperfusion in watershed areas can lead to mural and mucosal infarction in the case of ischemic bowel disease. When watershed stroke occurs in the brain, it produces unique focal neurologic symptoms that aid clinicians in diagnosis and localization. For example, a cerebral watershed area is situated in the dorsal prefrontal cortex; when it is affected on the left side, this can lead to transcortical motor aphasia. |
https://en.wikipedia.org/wiki/Morphological%20skeleton | In digital image processing, morphological skeleton is a skeleton (or medial axis) representation of a shape or binary image, computed by means of morphological operators.
Morphological skeletons are of two kinds:
Those defined by means of morphological openings, from which the original shape can be reconstructed,
Those computed by means of the hit-or-miss transform, which preserve the shape's topology.
Skeleton by openings
Lantuéjoul's formula
Continuous images
In (Lantuéjoul 1977), Lantuéjoul derived the following morphological formula for the skeleton of a continuous binary image :
,
where and are the morphological erosion and opening, respectively, is an open ball of radius , and is the closure of .
Discrete images
Let , , be a family of shapes, where B is a structuring element,
, and
, where o denotes the origin.
The variable n is called the size of the structuring element.
Lantuéjoul's formula has been discretized as follows. For a discrete binary image , the skeleton S(X) is the union of the skeleton subsets , , where:
.
Reconstruction from the skeleton
The original shape X can be reconstructed from the set of skeleton subsets as follows:
.
Partial reconstructions can also be performed, leading to opened versions of the original shape:
.
The skeleton as the centers of the maximal disks
Let be the translated version of to the point z, that is, .
A shape centered at z is called a maximal disk in a set A when:
, and
if, for some integer m and some point y, , then .
Each skeleton subset consists of the centers of all maximal disks of size n.
Performing Morphological Skeletonization on Images
Morphological Skeletonization can be considered as a controlled erosion process. This involves shrinking the image until the area of interest is 1 pixel wide. This can allow quick and accurate image processing on an otherwise large and memory intensive operation. A great example of using skeletonization on an image is processing fingerprints. |
https://en.wikipedia.org/wiki/San%20Jose%20BioCenter | The San Jose BioCenter is a business incubator formed as a university foundation in 2004 and focused on the initiation and development of technology companies, with an emphasis on the life sciences industry. The BioCenter emerged from San Jose State University in an effort to revitalize an industrial area of San Jose, California. , the BioCenter had thirty-five member (assisted) companies and twelve affiliate (supporting) companies. In addition to office space, the BioCenter provides wet laboratory facilities to member companies.
Awards and recognition
The BioCenter was awarded in 2009 two "incubator of the year" awards from the National Business Incubation Association. |
https://en.wikipedia.org/wiki/Self-adjoint%20operator | In mathematics, a self-adjoint operator on an infinite-dimensional complex vector space V with inner product (equivalently, a Hermitian operator in the finite-dimensional case) is a linear map A (from V to itself) that is its own adjoint. If V is finite-dimensional with a given orthonormal basis, this is equivalent to the condition that the matrix of A is a Hermitian matrix, i.e., equal to its conjugate transpose A. By the finite-dimensional spectral theorem, V has an orthonormal basis such that the matrix of A relative to this basis is a diagonal matrix with entries in the real numbers. This article deals with applying generalizations of this concept to operators on Hilbert spaces of arbitrary dimension.
Self-adjoint operators are used in functional analysis and quantum mechanics. In quantum mechanics their importance lies in the Dirac–von Neumann formulation of quantum mechanics, in which physical observables such as position, momentum, angular momentum and spin are represented by self-adjoint operators on a Hilbert space. Of particular significance is the Hamiltonian operator defined by
which as an observable corresponds to the total energy of a particle of mass m in a real potential field V. Differential operators are an important class of unbounded operators.
The structure of self-adjoint operators on infinite-dimensional Hilbert spaces essentially resembles the finite-dimensional case. That is to say, operators are self-adjoint if and only if they are unitarily equivalent to real-valued multiplication operators. With suitable modifications, this result can be extended to possibly unbounded operators on infinite-dimensional spaces. Since an everywhere-defined self-adjoint operator is necessarily bounded, one needs be more attentive to the domain issue in the unbounded case. This is explained below in more detail.
Definitions
Let be an unbounded (i.e. not necessarily bounded) operator with a dense domain This condition holds automatically when is fin |
https://en.wikipedia.org/wiki/Breit%20equation | The Breit equation is a relativistic wave equation derived by Gregory Breit in 1929 based on the Dirac equation, which formally describes two or more massive spin-1/2 particles (electrons, for example) interacting electromagnetically to the first order in perturbation theory. It accounts for magnetic interactions and retardation effects to the order of 1/c2. When other quantum electrodynamic effects are negligible, this equation has been shown to give results in good agreement with experiment. It was originally derived from the Darwin Lagrangian but later vindicated by the Wheeler–Feynman absorber theory and eventually quantum electrodynamics.
Introduction
The Breit equation is not only an approximation in terms of quantum mechanics, but also in terms of relativity theory as it is not completely invariant with respect to the Lorentz transformation. Just as does the Dirac equation, it treats nuclei as point sources of an external field for the particles it describes. For particles, the Breit equation has the form ( is the distance between particle and ):
where
is the Dirac Hamiltonian (see Dirac equation) for particle at position and is the scalar potential at that position; is the charge of the particle, thus for electrons .
The one-electron Dirac Hamiltonians of the particles, along with their instantaneous Coulomb interactions , form the Dirac–Coulomb operator. To this, Breit added the operator (now known as the (frequency-independent) Breit operator):
where the Dirac matrices for electron i: . The two terms in the Breit operator account for retardation effects to the first order.
The wave function in the Breit equation is a spinor with elements, since each electron is described by a Dirac bispinor with 4 elements as in the Dirac equation, and the total wave function is the tensor product of these.
Breit Hamiltonians
The total Hamiltonian of the Breit equation, sometimes called the Dirac–Coulomb–Breit Hamiltonian () can be decomposed into the follo |
https://en.wikipedia.org/wiki/East%20Malling%20Research%20Station | NIAB EMR is a horticultural and agricultural research institute at East Malling, Kent in England, with a specialism in fruit and clonally propagated crop production. In 2016, the institute became part of the NIAB Group.
History
A research station was established on the East Malling site in 1913 on the impetus of local fruit growers. The original buildings are still in use today. Some of the finest and most important research on perennial crops has been conducted on the site, resulting in East Malling’s worldwide reputation. Some of the more well-known developments have been achieved in the areas of plant raising, fruit plant culture (especially the development of rootstocks), fruit breeding, ornamental breeding, fruit storage and the biology and control of pests and diseases.
From 1990 a division of Horticulture Research International (HRI) was on the site. HRI closed in 2009.
In 2016, East Malling Research became part of the National Institute of Agricultural Botany (NIAB) group.
Apple rootstocks
In 1912, Ronald Hatton initiated the work of classification, testing and standardisation of apple tree rootstocks. With the help of Dr Wellington, Hatton sorted out the incorrect naming and mixtures then widespread in apple rootstocks distributed throughout Europe. These verified and distinct apple rootstocks are called the "Malling series". The most widespread used was the M9 rootstock.
Structure
It is situated east of East Malling, and north of the Maidstone East Line. The western half of the site is in East Malling and Larkfield and the eastern half is in Ditton. It is just south of the A20, and between junctions 4 and 5 of the M20 motorway.
Function
Today the Research Centre also acts as a business enterprise centre supported by leading local businesses including QTS Analytical and Network Computing Limited. The conference centre trades as East Malling Ltd, being incorporated on 17 February 2004. |
https://en.wikipedia.org/wiki/List%20of%20lemmas | This following is a list of lemmas (or, "lemmata", i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list of axioms, list of theorems and list of conjectures.
Algebra
Abhyankar's lemma
Aubin–Lions lemma
Bergman's diamond lemma
Fitting lemma
Injective test lemma
Hua's lemma (exponential sums)
Krull's separation lemma
Schanuel's lemma (projective modules)
Schwartz–Zippel lemma
Shapiro's lemma
Stewart–Walker lemma (tensors)
Whitehead's lemma (Lie algebras)
Zariski's lemma
Algebraic geometry
Abhyankar's lemma
Fundamental lemma (Langlands program)
Category theory
Five lemma
Horseshoe lemma
Nine lemma
Short five lemma
Snake lemma
Splitting lemma
Linear algebra
Matrix determinant lemma
Matrix inversion lemma
Group theory
Burnside's lemma also known as the Cauchy–Frobenius lemma
Frattini's lemma (finite groups)
Goursat's lemma
Mautner's lemma (representation theory)
Ping-pong lemma (geometric group theory)
Schreier's subgroup lemma
Schur's lemma (representation theory)
Zassenhaus lemma
Polynomials
Gauss's lemma (polynomials)
Schwartz–Zippel lemma
Ring theory and commutative algebra
Artin–Rees lemma
Hensel's lemma (commutative rings)
Nakayama lemma
Noether's normalization lemma
Prime avoidance lemma
Universal algebra
Jónsson's lemma
Analysis
Fekete's lemma
Fundamental lemma of calculus of variations
Hopf lemma
Sard's lemma (singularity theory)
Stechkin's lemma (functional and numerical analysis)
Vitali covering lemma (real analysis)
Watson's lemma
Complex analysis
Estimation lemma (contour integrals)
Hartogs's lemma (several complex variables)
Jordan's lemma
Lemma on the Logarithmic derivative
Schwarz lemma
Fourier analysis
Riemann–Lebesgue lemma
Differential equations
Borel's lemma (partial differential equations)
Grönwall's lemma
Lax–Milgram lemma
Pugh's closing lemma
Weyl's lemma (Laplace equation) (partial differential equations)
Differential forms
Poincaré lemma of closed and exa |
https://en.wikipedia.org/wiki/Cardiolipin | Cardiolipin (IUPAC name 1,3-bis(sn-3’-phosphatidyl)-sn-glycerol, "sn" designating stereospecific numbering) is an important component of the inner mitochondrial membrane, where it constitutes about 20% of the total lipid composition. It can also be found in the membranes of most bacteria. The name "cardiolipin" is derived from the fact that it was first found in animal hearts. It was first isolated from the beef heart in the early 1940s by Mary C. Pangborn. In mammalian cells, but also in plant cells, cardiolipin (CL) is found almost exclusively in the inner mitochondrial membrane, where it is essential for the optimal function of numerous enzymes that are involved in mitochondrial energy metabolism.
Structure
Cardiolipin (CL) is a kind of diphosphatidylglycerol lipid. Two phosphatidic acid moieties connect with a glycerol backbone in the center to form a dimeric structure. So it has four alkyl groups and potentially carries two negative charges. As there are four distinct alkyl chains in cardiolipin, the potential for complexity of this molecule species is enormous. However, in most animal tissues, cardiolipin contains 18-carbon fatty alkyl chains with 2 unsaturated bonds on each of them. It has been proposed that the (18:2)4 acyl chain configuration is an important structural requirement for the high affinity of CL to inner membrane proteins in mammalian mitochondria. However, studies with isolated enzyme preparations indicate that its importance may vary depending on the protein examined.
Since there are two phosphates in the molecule, each of them can catch one proton. Although it has a symmetric structure, ionizing one phosphate happens at a very different levels of acidity than ionizing both: pK1 = 3 and pK2 > 7.5. So under normal physiological conditions (wherein pH is around 7), the molecule may carry only one negative charge. The hydroxyl groups (–OH and –O−) on phosphate would form a stable intramolecular hydrogen bond with the centered glycerol's hydr |
https://en.wikipedia.org/wiki/B%C3%BClent%20%C5%9E%C4%B1k | Bülent Şık is a Turkish food engineer, environmental and human rights activist and a whistleblower. He was convicted after disclosing the results from a government study on environmental pollution and carcinogens.
Early life and education
Career
Şık has worked at Akdeniz University in Antalya, where he was a deputy director of the Food Safety and Agricultural Research Center.
In the early 2010s, Şık worked on a 5-year research project for the Turkey's Ministry of Health investigating a possible relation between the high incidence of cancer in western Turkey (Kocaeli, Tekirdağ, Kırklareli, Edirne and Antalya) and toxicity in local soil, water, and food. Şık found dangerous levels of toxicity in a number of food and water samples, concluding that water in several residential areas is unsafe for drinking. In 2015, he reported his findings to the government.
In 2016, he was fired from his university position as assistant professor by a presidential decree-law after signing a petition "calling for peace between Turkish forces and Kurdish militants in southeast Turkey".
In April 2018, as no action was taken on the water pollution for three years, Şık published his findings in the opposition newspaper Cumhuriyet. After the publication, the Turkish government claimed the newspaper publication violated the confidentiality clauses prohibiting to reveal the findings unless approved by the authorities, but it did not deny the accuracy of information. Subsequently the Ministry of Health sued Şık for "revealing confidential information as well as provoking outrage among the public".
On 26 September 2019, Şık was sentenced to 15 months in jail for "disclosing information about duty" while he has been acquitted of "providing prohibited information". Amnesty International has criticized the trial, describing Şık as a whistleblower.
Private life
Bülent Şık is the brother of Ahmet Şık, a journalist and an opposition party member of Parliament. |
https://en.wikipedia.org/wiki/Ringback%20number | A ringback number is a telephone number for a telephone line that automatically calls the line that the call was placed from, after the caller has hung up. The typical use of this facility is by telephone company technicians for testing a new installation or for trouble-shooting.
Operation
Ringback testing is an acceptance testing procedure conducted by telephone installers to verify the quality of customer premises wiring to prevent network damage from faulty equipment or installation. The test consists of calling a reverting calling telephone number (ringback number) or a vertical service code with a standard telephone. Upon answering the call, the exchange plays a unique signal tone as a signal for the installer to hangup the telephone. The exchange then places a reverting call to the originating line, causing the telephone to ring. When answered, the exchange plays a verification tone. The verification tone is issued so that telephone subscribers cannot easily use the ringback system as an intercom between multiple stations in a residence on the same line by taking the stations off-hook.
Ringback numbers are typically not listed or communicated to subscribers.
Coin telephones
Narcotics trafficking and other criminal activity can use payphones to conduct crimes anonymously, so many payphones are not equipped with a ringer at all, or a quiet "chirper" solid state speaker and designated "No Incoming Calls". All payphones in the United States must be assigned a telephone number in order to make calls, some can ring or chirp if that number is called. Many customer-owned coin-operated telephones (COCOT) answer the phone at first ring with a built in modem which can be accessed by technicians to report conditions and program function parameters, one programmable function is the number of rings until the modem answers, another is whether to impose an additional charge for incoming calls or even accept no incoming calls at all. Where a payphone does not have any numbe |
https://en.wikipedia.org/wiki/Thyroid%20hormone%20binding%20ratio | Thyroid hormone binding ratio (THBR) is a thyroid function test that measures the "uptake" of T3 or T4 tracer by thyroid-binding globulin (TBG) in a given serum sample. This provides an indirect and reciprocal estimate of the available binding sites on TBG within the sample.
The results are then reported as a ratio to normal serum.
Indications
Attempts to correct for changes in thyroid binding globulin due to liver disease, protein losing states, pregnancy or various drugs
It is used to calculate free thyroxine index (total T4 x T3 uptake), an estimate of free T4. Free thyroxine index may be calculated with increased diagnostic accuracy using direct TBG measurement when the total hormone concentration is abnormally elevated
Examples
In patients with hyperthyroidism, there will be fewer available binding sites on TBG (due to the increased circulating T3 / T4). This will lead to an increased thyroid hormone binding ratio.
In patients with hypothyroidism, there will be more free binding sites on TBG (due to the decreased amount of circulating T3 / T4) and as such the THBR will be decreased.
In general, High with High thyroid activity and Low with Low thyroid activity.
Other Conditions
Total TBG can be increased (thereby decreasing the THBR) congenitally, or in conditions such as pregnancy (period of increased estrogen) and with the treatment of certain infections such as Hepatitis C. In the latter, reduction of inflammation of the liver results in increased protein synthesis
Total TBG can be decreased (thereby increasing the THBR) congenitally, or in conditions such as liver failure, protein-losing conditions, or nephrotic conditions. Increased androgen levels will also decrease TBG synthesis, increasing THBR.
THBR can be directly altered by drugs such as;
Anticonvulsants such as phenytoin and carbamazepine
Antinflammatory drugs such as salicylates (Aspirin) or phenylbutazone (NSAID)
High levels of free fatty acids, commonly seen in acutely ill patients |
https://en.wikipedia.org/wiki/Alexandrov%27s%20uniqueness%20theorem | The Alexandrov uniqueness theorem is a rigidity theorem in mathematics, describing three-dimensional convex polyhedra in terms of the distances between points on their surfaces. It implies that convex polyhedra with distinct shapes from each other also have distinct metric spaces of surface distances, and it characterizes the metric spaces that come from the surface distances on polyhedra. It is named after Soviet mathematician Aleksandr Danilovich Aleksandrov, who published it in the 1940s.
Statement of the theorem
The surface of any convex polyhedron in Euclidean space forms a metric space, in which the distance between two points is measured by the length of the shortest path from one point to the other along the surface. Within a single shortest path, distances between pairs of points equal the distances between corresponding points of a line segment of the same length; a path with this property is known as a geodesic.
This property of polyhedral surfaces, that every pair of points is connected by a geodesic, is not true of many other metric spaces, and when it is true the space is called a geodesic space. The geodesic space formed from the surface of a polyhedron is called its development.
The polyhedron can be thought of as being folded from a sheet of paper (a net for the polyhedron) and it inherits the same geometry as the paper: for every point p within a face of the polyhedron, a sufficiently small open neighborhood of p will have the same distances as a subset of the Euclidean plane. The same thing is true even for points on the edges of the polyhedron: they can be modeled locally as a Euclidean plane folded along a line and embedded into three-dimensional space, but the fold does not change the structure of shortest paths along the surface. However, the vertices of the polyhedron have a different distance structure: the local geometry of a polyhedron vertex is the same as the local geometry at the apex of a cone. Any cone can be formed from a flat she |
https://en.wikipedia.org/wiki/Mars%20Nederland | Mars Nederland () is the Dutch division of Mars, Incorporated, a privately held multi-national company in food, pet care products, and confectionery products. It has its headquarters and main production site in Veghel, North Brabant known as Mars Nederland B.V. A second production site is located in Oud-Beijerland, South Holland. The chocolate factory in Veghel is the largest production site owned by Mars, Incorporated, and is among the largest chocolate factories in the world.
It was opened in 1963. Mars has over 230 sites around the world.
2016 Product recall
In February 2016, Mars recalled products from 55 countries after pieces from a red plastic container were found in chocolate. The chocolate had best before dates between 19 June 2016 and 8 January 2017, and was produced in the Veghel factory. A piece of red plastic had been found by a customer in a bar of Snickers.
Structure
The Marsfabriek is situated in Veghel, in the north-east of North Brabant (Noord-Brabant), in the south of the Netherlands. Mars Veghel employ about 1200 people. The site lies in the west of Veghel, towards the A50 motorway. To the east of the plant is the South Willem's Canal (Zuid-Willemsvaart) which runs north-west to south-east along the N279.
Mars also employs 250 people further north in Oud-Beijerland in South Holland, south of Rotterdam; the site makes Dolmio, and other non-chocolate products. Jack Tabbers is the General Manager of Mars Nederland.
Function
Products it makes include Mars, Bounty, Snickers and Milky Way. It makes 254,000 tonnes of chocolate products a year. |
https://en.wikipedia.org/wiki/Monkey%20testing | In software testing, monkey testing is a technique where the user tests the application or system by providing random inputs and checking the behavior, or seeing whether the application or system will crash. Monkey testing is usually implemented as random, automated unit tests.
While the source of the name "monkey" is uncertain, it is believed by some that the name has to do with the infinite monkey theorem, which states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type a given text, such as the complete works of William Shakespeare. Some others believe that the name comes from the classic Mac OS application "The Monkey" developed by Steve Capps prior to 1983. It used journaling hooks to feed random events into Mac programs, and was used to test for bugs in MacPaint.
Monkey Testing is also included in Android Studio as part of the standard testing tools for stress testing.
Types of monkey testing
Monkey testing can be categorized into smart monkey tests or dumb monkey tests.
Smart monkey tests
Smart monkeys are usually identified by the following characteristics:
Have a brief idea about the application or system
Know its own location, where it can go and where it has been
Know its own capability and the system's capability
Focus to break the system
Report bugs they found
Some smart monkeys are also referred to as brilliant monkeys, which perform testing as per user's behavior and can estimate the probability of certain bugs.
Dumb monkey tests
Dumb monkeys, also known as "ignorant monkeys", are usually identified by the following characteristics:
Have no knowledge about the application or system
Don't know if their input or behavior is valid or invalid
Don't know their or the system's capabilities, nor the flow of the application
Can find fewer bugs than smart monkeys, but can also find important bugs that are hard to catch by smart monkeys
Advantages and disadvantages
Advantages
Mo |
https://en.wikipedia.org/wiki/Consortium%20of%20European%20Taxonomic%20Facilities | The Consortium of European Taxonomic Facilities (CETAF) is a taxonomic research network formed by scientific institutions in Europe. It was formed in December 1996 by ten of the largest European natural history museums and botanical gardens to be a voice for taxonomy and systematic biology in Europe, to promote scientific research and access to European natural history collections, and to exploit European funding opportunities. Since then, CETAF has served as a meeting point for major European natural history museums and botanical gardens, and has initiated and played an important role in a number of projects (see Initiatives and related projects section below).
Currently, CETAF has 37 members, which constitute a total of 63 institutions spanning 22 European countries (see Members section below). One of these members, the Royal Belgian Institute of Natural Sciences, also hosts CETAF's General Secretariat.
Together, CETAF institutions hold a large fraction (c. 500 million objects) of the world’s most important natural history collections, and the scientific staff have unique expertise in taxonomy and systematics. Biodiversity loss, global warming and other environmental issues need natural history collections and related expertise as sources of knowledge and for reference. The increasing political and public awareness of environmental questions and their importance for society provide both challenges and opportunities for taxonomic facilities.
CETAF strives to represent the interests of its member institutions, to enhance the visibility of its members, and to be a powerful voice for natural history collections and collections-based research in Europe.
General Meetings
General Meetings with representatives of each member institution are held twice a year. The meetings are hosted by any of the member institutions and held at any of the European natural history museums or botanic gardens. Current business between the General Meetings are run by the Chair and the St |
https://en.wikipedia.org/wiki/S%20band | The S band is a designation by the Institute of Electrical and Electronics Engineers (IEEE) for a part of the microwave band of the electromagnetic spectrum covering frequencies from 2 to 4 gigahertz (GHz). Thus it crosses the conventional boundary between the UHF and SHF bands at 3.0 GHz. The S band is used by airport surveillance radar for air traffic control, weather radar, surface ship radar, and some communications satellites, especially those satellites used by NASA to communicate with the Space Shuttle and the International Space Station. The 10 cm radar short-band ranges roughly from 1.55 to 5.2 GHz. The S band also contains the 2.4–2.483 GHz ISM band, widely used for low power unlicensed microwave devices such as cordless phones, wireless headphones (Bluetooth), wireless networking (WiFi), garage door openers, keyless vehicle locks, baby monitors as well as for medical diathermy machines and microwave ovens (typically at 2.495 GHz). India's regional satellite navigation network (IRNSS) broadcasts on 2.483778 to 2.500278 GHz.
WiFi
The largest use of this band is by WiFi networks; the IEEE 802.11b and 802.11g standards use the 2.4 GHz section of the S band. These are the most widely used computer networks in the world, used globally in home and small office networks to link desktop and laptop computers, tablet computers, smartphones, smart TVs, printers, and smart speakers together and to a wireless router to connect them to the Internet, and in wireless access points in public places like coffee shops, hotels, libraries and airports to provide the public Internet access for mobile devices.
Mobile Services
Mobile Services are operated in the 2.3 GHz to 2.6 GHz range, specifically between the 2300 - 2400 MHz band and the 2500 - 2690 MHz band. Spectrum in the 3.55 - 3.7 GHz band has been auctioned off in the United States to be used for CBRS services and spectrum between 3.45 - 3.55 GHz and 3.7 - 3.98 GHz has been auctioned off by the FCC for 5G although thi |
https://en.wikipedia.org/wiki/Structure%20of%20Management%20Information | In computing, the Structure of Management Information (SMI), an adapted subset of ASN.1, is a technical language used in definitions of Simple Network Management Protocol (SNMP) and its extensions to define sets ("modules") of related managed objects in a Management Information Base (MIB).
SMI subdivides into three parts: module definitions, object definitions, and notification definitions.
Module definitions are used when describing information modules. An ASN .1 macro, MODULE-IDENTITY, is used to concisely convey the semantics of an information module.
Object definitions describe managed objects. An ASN.1 macro, OBJECT-TYPE, is used to concisely convey the syntax and semantics of a managed object.
Notification definitions (aka "traps") are used when describing unsolicited transmissions of management information. An ASN.1 macro, NOTIFICATION-TYPE, concisely conveys the syntax and semantics of a notification.
Implementations
libsmi, a C library for accessing MIB information |
https://en.wikipedia.org/wiki/International%20Council%20for%20Industrial%20and%20Applied%20Mathematics | The International Council for Industrial and Applied Mathematics (ICIAM) is an organisation for professional applied mathematics societies and related organisations. The current (2020) President is Ya-xiang Yuan.
History
Until 1999 the Council was known as the Committee for International Conferences on Industrial and Applied Mathematics (CICIAM). Formed in 1987 with the start of the ICIAM conference series, this committee represented the leaders of four applied mathematics societies: the Gesellschaft für Angewandte Mathematik und Mechanik (GAMM), in Germany, the Institute of Mathematics and its Applications (IMA), in England, the Society for Industrial and Applied Mathematics (SIAM), in the USA, and the Société de Mathématiques Appliquées et Industrielles (SMAI), in France. The first two presidents of the council, Roger Temam and Reinhard Mennicken, oversaw the addition of several other societies as members and associate members of the council; as of 2015 it had 21 full members and 26 associate members. Past Presidents include Olavi Nevanlinna, Ian Sloan, Rolf Jeltsch, Barbara Keyfitz, and María J. Esteban.
Congress
ICIAM organizes the four-yearly International Congress on Industrial and Applied Mathematics, the first of which was held in 1987. The most recent congress was in 2019 in Valencia (Spain), and the next will be in 2023 in Tokyo (Japan). It also sponsors several prizes, awarded at the congresses: the Lagrange Prize for exceptional career contributions, the Collatz Prize for outstanding applied mathematicians under the age of 42, the Pioneer Prize for applied mathematical work in a new field, the Maxwell Prize for originality in applied mathematics, and the Su Buchin Prize for outstanding contributions to emerging economies and human development.
Collatz Prize
The Collatz Prize is awarded by ICIAM every four years at the International Congress on Industrial and Applied Mathematics, to an applied mathematician under the age of 42. It was established in 19 |
https://en.wikipedia.org/wiki/RivX%20sRNA | RivX sRNA is a non-coding RNA molecule involved in the interface between two key regulators of virulence in the human pathogen Streptococcus pyogenes (Group A Streptoccus, also known as GAS): the CovR/S system and Mga regulator. This RNA, along with its downstream protein-coding gene RivR, are the first discovered links between these two important regulation networks. An extra protein linking the two pathways, TrxR, was described a year later. The adjoining of these two pathways could allow a consistently high virulence of S. pyogenes despite a variety of environmental conditions.
RivX is thought to be co-transcribed with RivR mRNA before post-transcriptional processing releases the sRNA. It was found to be a non-coding transcript through site-directed mutagenesis experimentation.
In total, the GAS genome is now predicted to encode 75 total sRNAs, a number approximately equal to the number of transcription factors encoded by the genome, which shows the importance of RNA regulation in GAS. |
https://en.wikipedia.org/wiki/IgG4-related%20disease | IgG4-related disease (IgG4-RD), formerly known as IgG4-related systemic disease, is a chronic inflammatory condition characterized by tissue infiltration with lymphocytes and IgG4-secreting plasma cells, various degrees of fibrosis (scarring) and a usually prompt response to oral steroids. In approximately 51–70% of people with this disease, serum IgG4 concentrations are elevated during an acute phase.
It is a relapsing-remitting disease associated with a tendency to mass forming, tissue-destructive lesions in multiple sites, with a characteristic histopathological appearance in whichever site is involved. Inflammation and the deposition of connective tissue in affected anatomical sites can lead to organ dysfunction, organ failure, or even death if not treated.
Early detection is important to avoid organ damage and potentially serious complications. Treatment is recommended in all symptomatic cases of IgG4-RD and also in asymptomatic IgG4-RD involving certain anatomical sites.
Signs and symptoms
IgG4-related disease has been described as an indolent condition. Although possibly based on opinion rather than on objective assessments, symptoms, if any, are commonly described as mild in the medical literature.
This can be in spite of considerable underlying organ destruction. People are often described as being generally well at the time of diagnosis, although some may give a history of weight loss.
Pain is generally not a feature of inflammation. However, it may occur as a secondary effect, for example, due to either obstruction or compression.
Laboratory levels of IGG4 greater than 135
Moreover, diagnosis is made due to the presence of painless swellings or mass lesions, or due to complications of masses, e.g. jaundice due to involvement of the pancreas, biliary tree or liver. Symptoms are commonly attributed to other conditions and other diagnoses may have been made years before diagnosis, e.g. urinary symptoms in men attributed to common prostate conditions. Le |
https://en.wikipedia.org/wiki/Occupancy%20grid%20mapping | Occupancy Grid Mapping refers to a family of computer algorithms in probabilistic robotics for mobile robots which address the problem of generating maps from noisy and uncertain sensor measurement data, with the assumption that the robot pose is known. Occupancy grids were first proposed by H. Moravec and A. Elfes in 1985.
The basic idea of the occupancy grid is to represent a map of the environment as an evenly spaced field of binary random variables each representing the presence of an obstacle at that location in the environment. Occupancy grid algorithms compute approximate posterior estimates for these random variables.
Algorithm outline
There are four major components of occupancy grid mapping approach. They are:
Interpretation
Integration
Position estimation
Exploration
Occupancy grid mapping algorithm
The goal of an occupancy mapping algorithm is to estimate the posterior probability over maps given the data: , where is the map, is the set of measurements from time 1 to t, and is the set of robot poses from time 1 to t. The controls and odometry data play no part in the occupancy grid mapping algorithm since the path is assumed known.
Occupancy grid algorithms represent the map as a fine-grained grid over the continuous space of locations in the environment. The most common type of occupancy grid maps are 2d maps that describe a slice of the 3d world.
If we let denote the grid cell with index i (often in 2d maps, two indices are used to represent the two dimensions), then the notation represents the probability that cell i is occupied.
The computational problem with estimating the posterior is the dimensionality of the problem: if the map contains 10,000 grid cells (a relatively small map), then the number of possible maps that can be represented by this gridding is . Thus calculating a posterior probability for all such maps is infeasible.
The standard approach, then, is to break the problem down into smaller problems of estimating
for a |
https://en.wikipedia.org/wiki/Amphibian%20antimicrobial%20peptides | Amphibian antimicrobial peptides are a family of highly potent antimicrobial peptides with a large spectrum of activity, which are synthesized by vertebrates as an efficient host-defence mechanism against invading microorganisms. A number of these defence peptides are secreted from the skin of frogs and other amphibians, including the opiate-like dermorphins and deltorphins, and antimicrobial dermaseptins, temporins, bombinins, magainin, pseudin, bombesins, and maculatins. |
https://en.wikipedia.org/wiki/Optimal%20cutting%20temperature%20compound | Optimal cutting temperature compound (OCT compound) is used to embed tissue samples prior to frozen sectioning on a microtome-cryostat. This process is undertaken so as to mount slices (sections) of a sample onto slides for analysis.
Components
As stated on the bottle:
10.24% polyvinyl alcohol
4.26% polyethylene glycol
85.5% non-reactive ingredients"
See also
Microtome
Cryostat |
https://en.wikipedia.org/wiki/PRIMUS%20%28journal%29 | PRIMUS: Problems, Resources, and Issues in Mathematics Undergraduate Studies is a peer-reviewed academic journal covering the teaching of undergraduate mathematics, established in 1991. The journal has been published by Taylor & Francis since March 2007. It is abstracted and indexed in Cambridge Scientific Abstracts, MathEduc, PsycINFO, and Zentralblatt MATH.
PRIMUS is an affiliated journal of the Mathematical Association of America, so all MAA members have access to PRIMUS.
Editorial Team
PRIMUS was started by founding editor-in-chief Brian Winkel in 1991 to address the lack of venues for tertiary mathematics educators to share their pedagogical work. In 2011, Jo Ellis-Monaghan became the second editor-in-chief, with Matt Boelkins serving as associate editor. In 2017, Ellis-Monaghan and Boelkins became co-editors-in-chief.
Currently, Matt Boelkins serves as editor in chief, Kathy Weld as associate editor, Brian P Katz serves as associate and communications editor, and Rachel Schwell as managing editor. |
https://en.wikipedia.org/wiki/International%20Botanical%20Congress | International Botanical Congress (IBC) is an international meeting of botanists in all scientific fields, authorized by the International Association of Botanical and Mycological Societies (IABMS) and held every six years, with the location rotating between different continents. The current numbering system for the congresses starts from the year 1900; the XVIII IBC was held in Melbourne, Australia, 24–30 July 2011, and the XIX IBC was held in Shenzhen, China, 23–29 July 2017.
The IBC has the power to alter the ICN (International Code of Nomenclature for algae, fungi, and plants), which was renamed from the International Code of Botanical Nomenclature (ICBN) at the XVIII IBC. Formally the power resides with the Plenary Session; in practice this approves the decisions of the Nomenclature Section. The Nomenclature Section meets before the actual Congress and deals with all proposals to modify the Code: this includes ratifying recommendations from sub-committees on conservation. To reduce the risk of a hasty decision the Nomenclature Section adopts a 60% majority requirement for any change not already recommended by a committee.
History
Prior to the first International Botanical Congress, local congresses concerned with natural sciences generally had grown to be very large, and a more specialized but also international meeting was considered desirable. The first annual IBC was held in 1864 in Brussels, in conjunction with an international horticultural exhibit. At the second annual congress (held in Amsterdam), Karl Koch made a proposal to standardize botanical nomenclature, and the third congress (held in London) resolved that this matter would be dealt with by the next congress.
The fourth congress, which had as one of its principal purposes to establish laws of botanical nomenclature, was organized by la Société botanique de France, and took place in Paris in August 1867. The laws adopted were based on those prepared by Alphonse de Candolle. Regular internationa |
https://en.wikipedia.org/wiki/Digital%20Control%20Bus | DCB (Digital Control Bus, Digital Connection Bus or Digital Communication Bus in some sources) was a proprietary data interchange interface by Roland Corporation, developed in 1981 and introduced in 1982 in their Roland Juno-60 and Roland Jupiter-8 products. DCB functions were basically the same as MIDI, but unlike MIDI (which is capable of transmitting a wide array of information), DCB could provide note on/off, program change and VCF/VCA control only. DCB-to-MIDI adapters were produced for a number of early Roland products. The DCB interface was made in 2 variants, the earlier one used 20-pin sockets and cables, later switching to the 14-pin Amphenol DDK connector vaguely resembling a parallel port.
Supporting equipment
DCB was quickly replaced by MIDI in the early 1980s which Roland helped co-develop with Sequential Circuits. The only DCB-equipped instruments produced were the Roland Jupiter-8 and JUNO-60; Roland produced at least two DCB sequencers, the JSQ-60 and the MSQ-700. The latter was capable of saving eight sequences, or a total of 3000 notes, and was capable of transmitting and receiving data via MIDI (though it could not convert signals between DCB and MIDI, nor could it use both protocols simultaneously). Roland later released the MD-8, a rather large black box capable of converting MIDI signals to DCB and vice versa. While this allows note on/off to be sent to a JUNO-60 by MIDI, the solution pales in comparison to the full MIDI implementation on the JUNO-60's successor, the Roland Juno-106. A few other companies offer similar conversion boxes to connect DCB instruments to regular MIDI systems for the support of vintage synthesizers in modern sound production environments; one of the more fully-featured devices being the Kenton PRO-DCB Mk3 which has some bi-directional control limited to a few parameters.
Implementation
Following information comes from the Roland JUNO-60 Service Notes, First Edition, page 17–19.
Physical connection
DCB |
https://en.wikipedia.org/wiki/UWB%20ranging | Ultra-wideband impulse radio ranging (or UWB-IR ranging) is a wireless positioning technology based on IEEE 802.15.4z standard, which is a wireless communication protocol introduced by IEEE, for systems operating in unlicensed spectrum, equipped with extremely large bandwidth transceivers. UWB enables very accurate ranging (in the order of centimeters) without introducing significant interference with narrowband systems. To achieve these stringent requirements, UWB-IR systems exploit the available bandwidth (which exceeds 500 MHz for systems compliant to IEEE 802.15.4z protocol) that they support, which guarantees very accurate timing (and thus ranging) and robustness against multipath, especially in indoor environments. The available bandwidth also enables UWB systems to spread the signal power over a large spectrum (this technology is thus called spread spectrum), avoiding narrowband interference.
Protocol
UWB-IR relies on the low-power transmission of specific sequences of short-duration pulses. The transmit power is limited according to FCC regulations, in order to reduce interference and power consumption. The bands supported by the standard are the following ones:
The sub-gigahertz band, which contains only 1 channel and ranges from 249.6 MHz to 749.6 MHz.
The low band, which contains 4 channels and ranges from 3.1 GHz to 4.8 GHz.
The high band, which contains 11 channels and ranges from 6.0 GHz to 10.6 GHz.
The primary time division in UWB systems is structured in frames. Each frame is composed by the concatenation of 2 sequences:
The first one is called preamble (also known as SHR or synchronization header) and consists of a header, known a priori both at transmitter and receiver side. It is employed for synchronization purposes.
The second one is called physical layer protocol data unit (abbreviated to PPDU) and contains the data to communicate, which are known a priori only at transmitter side.
The further time subdivisions of the preamble and t |
https://en.wikipedia.org/wiki/Peierls%20transition | A Peierls transition or Peierls distortion is a distortion of the periodic lattice of a one-dimensional crystal. Atomic positions oscillate, so that the perfect order of the 1-D crystal is broken.
Peierls’ theorem
Peierls' theorem states that a one-dimensional equally spaced chain with one electron per ion is unstable.
This theorem was first espoused in the 1930s by Rudolf Peierls. It can be proven using a simple model of the potential for an electron in a 1-D crystal with lattice spacing . The periodicity of the crystal creates energy band gaps in the diagram at the edge of the Brillouin zone (similar to the result of the Kronig–Penney model, which helps to explain the origin of band gaps in semiconductors). If the ions each contribute one electron, then the band will be half-filled, up to values of in the ground state.
Imagine a lattice distortion where every other ion moves closer to one neighbor and further away from the other, the unfavourable energy of the long bond between ions is outweighed by the energy gain of the short bond. The period has just doubled from to . In essence, the proof relies on the fact that doubling the period would introduce new band gaps located at multiples of ; see the figure in the right. This would cause small energy savings, based on the distortion of the bands in the vicinity of the new gaps. Approaching , the distortion due to the introduction of the new band gap will cause the electrons to be at a lower energy than they would be in the perfect crystal. Therefore, this lattice distortion becomes energetically favorable when the energy savings due to the new band gaps outweighs the elastic energy cost of rearranging the ions. Of course, this effect will be noticeable only when the electrons are arranged close to their ground state – in other words, thermal excitation should be minimized. Therefore, the Peierls transition should be seen at low temperature. This is the basic argument for the occurrence of the Pei |
https://en.wikipedia.org/wiki/Language%20primitive | In computing, language primitives are the simplest elements available in a programming language. A primitive is the smallest 'unit of processing' available to a programmer of a given machine, or can be an atomic element of an expression in a language.
Primitives are units with a meaning, i.e., a semantic value in the language. Thus they are different from tokens in a parser, which are the minimal elements of syntax.
Machine-level primitives
A machine instruction, usually generated by an assembler program, is often considered the smallest unit of processing although this is not always the case. It typically performs what is perceived to be one operation such as copying a byte or string of bytes from one computer memory location to another or adding one processor register to another.
Microcode primitives
Many of today's computers, however, actually embody an even lower unit of processing known as microcode which interprets the machine code and it is then that the microcode instructions would be the genuine primitives. These instructions would typically be available for modification only by the hardware vendor's programmers.
High-level language primitives
A high-level programming language (HLL) program is composed of discrete statements and primitive data types that may also be perceived to perform a single operation or represent a single data item, but at a higher semantic level than those provided by the machine. Copying a data item from one location to another may actually involve many machine instructions that, for instance,
calculate the address of both operands in memory, based on their positions within a data structure,
convert from one data type to another
before finally
performing the final store operation to the target destination.
Some HLL statements, particularly those involving loops, can generate thousands or even millions of primitives in a low-level programming language (LLL), which comprise the genuine instruction path length the processor ha |
https://en.wikipedia.org/wiki/Dynamical%20lifetime | In statistical orbital mechanics, a body's dynamical lifetime refers to the mean time that a small body can be expected to remain in its current mean motion resonance. Classic examples are comets and asteroids which evolve from the 7:3 resonance to the 5:2 resonance with Jupiter's orbit with dynamical lifetimes of 1-100 Ma. |
https://en.wikipedia.org/wiki/GunZ%3A%20The%20Duel | GunZ: The Duel (), or simply GunZ, was an online third-person shooting game, created by South Korean-based MAIET Entertainment.
It was free-to-play, with a microtransaction business model for purchasing premium in-game items. The game allowed players to perform exaggerated, gravity-defying action moves, including wall running, stunning, tumbling, and blocking bullets with swords, in the style of action films and anime.
Gameplay
In Quest mode, players, in a group of up to 4 members, went through parts of a map for a certain number of stages, which were determined by the quest level. In each stage, players were required to kill 18 to 44 creatures, and the game ended when every member of the player team died or completed all of the stages. Quests could take place in the Prison, Mansion, or Dungeon map.
Players could make the quests tougher and more profitable by using special quest items to increase the quest level that could be bought from the in-game store or obtained during a quest. Quest items in-game were stored in glowing chests that spawned where the monster that it came from died; certain items could have been dropped depending on the monster killed. Players ran through these to obtain an item randomly selected from the possibilities of that monster. The items obtained depended on the monster that the chest came from. By sacrificing certain items in combination, players could enter a boss quest. Boss items were obtained through pages and other boss quests, and pages were obtained through the in-game shop. The quest system was designed to reduce the amount of time needed to prepare for boss raids that are typical in many other online games.
A significant and unique part of the gameplay was the movement system. Players could run on walls, perform flips off of them, and do quick mid-air dodges in any horizontal direction. Advanced movement and combat techniques were commonly referred to as "K-Style" or Korean style; a variety of techniques fell under this cat |
https://en.wikipedia.org/wiki/Roland%20Geyer | Roland Geyer is professor of industrial ecology at the Bren School of Environmental Science and Management, University of California at Santa Barbara. He is a specialist in the ecological impact of plastics.
In March 2021, Geyer wrote in The Guardian that humanity should ban fossil fuels, just at it had earlier banned tetraethyllead (TEL) and chlorofluorocarbons (CFC). |
https://en.wikipedia.org/wiki/Chore%20division | Chore division is a fair division problem in which the divided resource is undesirable, so that each participant wants to get as little as possible. It is the mirror-image of the fair cake-cutting problem, in which the divided resource is desirable so that each participant wants to get as much as possible. Both problems have heterogeneous resources, meaning that the resources are nonuniform. In cake division, cakes can have edge, corner, and middle pieces along with different amounts of frosting. Whereas in chore division, there are different chore types and different amounts of time needed to finish each chore. Similarly, both problems assume that the resources are divisible. Chores can be infinitely divisible, because the finite set of chores can be partitioned by chore or by time. For example, a load of laundry could be partitioned by the number of articles of clothing and/or by the amount of time spent loading the machine. The problems differ, however, in the desirability of the resources. The chore division problem was introduced by Martin Gardner in 1978.
Chore division is often called fair division of bads, in contrast to the more common problem called "fair division of goods" (an economic bad is the opposite of an economic good). Another name is dirty work problem. The same resource can be either good or bad, depending on the situation. For example, suppose the resource to be divided is the back-yard of a house. In a situation of dividing inheritance, this yard would be considered good, since each heir would like to have as much land as possible, so it is a cake-cutting problem. But in a situation of dividing house-chores such as lawn-mowing, this yard would be considered bad, since each child would probably like to have as little land as possible to mow, so it is a chore-cutting problem.
Some results from fair cake-cutting can be easily translated to the chore-cutting scenario. For example, the divide and choose procedure works equally well in both probl |
https://en.wikipedia.org/wiki/XMM%20Cluster%20Survey | The XMM Cluster Survey (XCS) is a serendipitous X-ray galaxy cluster survey being conducted using archival data taken by ESA’s XMM-Newton satellite. Galaxy clusters trace the large scale structure of the universe, and their number density evolution with redshift provides a way to measure cosmological parameters, independent of cosmic microwave background experiments or supernovae cosmology projects.
The collaboration is based in the United Kingdom and this is also where the majority of researchers are based. However, there are members of the collaboration across Europe and the Atlantic.
Science Goals
Derivation of cosmological parameters
Measurement of X-ray scaling relations and their evolution
Galaxy evolution in dense environments
Properties of unusual (non cluster) X-ray sources, such as high redshift quasars and isolated neutron stars.
Achievements
The XCS collaboration have detected 503 clusters serendipitously in XMM-Newton observations.
Publications |
https://en.wikipedia.org/wiki/Time-triggered%20architecture | Time-triggered architecture (abbreviated as TTA), also known as a time-triggered system, is a computer system that executes one or more sets of tasks according to a pre-determined and set task schedule. Implementation of a TT system will typically involve use of a single interrupt that is linked to the periodic overflow of a timer. This interrupt may drive a task scheduler (a restricted form of real-time operating system). The scheduler willin turnrelease the system tasks at predetermined points in time.
History and development
Because they have highly deterministic timing behavior, TT systems have been used for many years to develop safety-critical aerospace and related systems.
An early text that sets forth the principles of time triggered architecture, communications, and sparse time approaches is Real-Time Systems: Design Principles for Distributed Embedded Applications in 1997.
Use of TT systems was popularized by the publication of Patterns for Time-Triggered Embedded Systems (PTTES) in 2001 and the related introductory book Embedded C in 2002. The PTTES book also introduced the concepts of time-triggered hybrid schedulers (an architecture for time-triggered systems that require task pre-emption) and shared-clock schedulers (an architecture for distributed time-triggered systems involving multiple, synchronized, nodes).
Since publication of PTTES, extensive research work on TT systems has been carried out.
Current applications
Time-triggered systems are now commonly associated with international safety standards such as IEC 61508 (industrial systems), ISO 26262 (automotive systems), IEC 62304 (medical systems) and IEC 60730 (household goods).
Alternatives
Time-triggered systems can be viewed as a subset of a more general event-triggered (ET) system architecture (see event-driven programming).
Implementation of an ET system will typically involve use of multiple interrupts, each associated with specific periodic events (such as timer overflows) |
https://en.wikipedia.org/wiki/Desensitization%20%28telecommunications%29 | In telecommunications, desensitization (also known as receiver blocking) is a form of electromagnetic interference where a radio receiver is unable to receive a weak radio signal that it might otherwise be able to receive when there is no interference. This is caused by a nearby transmitter with a strong signal on a close frequency, which overloads the receiver and makes it unable to fully receive the desired signal.
Typical receiver operation is such that the Minimum Detectable Signal (MDS) level is determined by the thermal noise of its electronic components. When a signal is received, additional spurious signals are produced within the receiver because it is not truly a linear device. When these spurious signals have a power level that is less than the thermal noise power level, then the receiver is operating normally. When these spurious signals have a power level that is higher than the thermal noise floor, then the receiver is desensitized. This is because the MDS has risen due to the level of the spurious signals. Spurious signals increase in level when the received signal strength increases.
When an interfering signal is present, it can contribute to the level of the spurious signals. Stronger interference generates stronger spurious signals. The interference may be at a different frequency than the signal of interest, but the spurious signals caused by that interference can show up at the same frequency as the signal of interest. It is these spurious signals that degrade the ability of the receiver by raising the MDS.
Consider the case of a repeater station, a station consisting of a transmitter and receiver, both operating at the same time, but on separate frequencies, and in some cases, separate antennas. Elevated MDS can be experienced in this case as well.
One way to correct this condition is adding a duplexer to the station. This is common in Land Mobile Radio services such as police, fire, various commercial and amateur service.
See also
Receiver |
https://en.wikipedia.org/wiki/Access%20Now | Access Now is a non-profit organization founded in 2009 with a mission to defend and extend the digital civil rights of people around the world. Access Now supports programs including an annual conference on Human Rights (RightsCon), an index of internet shutdowns (#KeepItOn), and providing exit nodes for Tor network.
, Access Now has legal entities in Belgium, Costa Rica, Tunisia, and the United States, with its staff, operations, and activities distributed across all regions of the world. In 2018, Access Now received approximately $5.1 million in funding. Major funders included Facebook, Global Affairs Canada, the Dutch Ministry of Foreign Affairs, and the Swedish International Development Cooperation Agency.
History
Access Now was founded by Brett Solomon, Cameran Ashraf, Sina Rabbani and Kim Pham in 2009, after the contested Iranian presidential election of that year. During the protests that followed this election, Access Now disseminated the video footage which came out of Iran. Access Now has campaigned against internet shutdowns, online censorship, international trade agreements, and government surveillance. Access Now has supported the use of encryption and limited cyber security laws and regulations.
Access Now runs an annual conference, RightsCon, a multi stakeholder event. The conference was first held in Silicon Valley in 2011, followed by events in Rio de Janeiro, Brazil (2012), Silicon Valley (2014), Manila, Philippines (2015), and Silicon Valley (2016); thus alternated between Silicon Valley and a city in the Global South. After being held in Brussels and Toronto, RightsCon 2019 took place in Tunis, Tunisia (1114 June). The 2019 RightsCon event gathered activists and stakeholders from all over the globe discussed the intersection between human rights and digitalization by government representatives, tech giants, policy makers, NGOs and independent activists. The discussions were about hate speech and freedom of expression, artificial intelligen |
https://en.wikipedia.org/wiki/Optical%20illusion | In visual perception, an optical illusion (also called a visual illusion) is an illusion caused by the visual system and characterized by a visual percept that arguably appears to differ from reality. Illusions come in a wide variety; their categorization is difficult because the underlying cause is often not clear but a classification proposed by Richard Gregory is useful as an orientation. According to that, there are three main classes: physical, physiological, and cognitive illusions, and in each class there are four kinds: Ambiguities, distortions, paradoxes, and fictions. A classical example for a physical distortion would be the apparent bending of a stick half immerged in water; an example for a physiological paradox is the motion aftereffect (where, despite movement, position remains unchanged). An example for a physiological fiction is an afterimage. Three typical cognitive distortions are the Ponzo, Poggendorff, and Müller-Lyer illusion. Physical illusions are caused by the physical environment, e.g. by the optical properties of water. Physiological illusions arise in the eye or the visual pathway, e.g. from the effects of excessive stimulation of a specific receptor type. Cognitive visual illusions are the result of unconscious inferences and are perhaps those most widely known.
Pathological visual illusions arise from pathological changes in the physiological visual perception mechanisms causing the aforementioned types of illusions; they are discussed e.g. under visual hallucinations.
Optical illusions, as well as multi-sensory illusions involving visual perception, can also be used in the monitoring and rehabilitation of some psychological disorders, including phantom limb syndrome and schizophrenia.
Physical visual illusions
A familiar phenomenon and example for a physical visual illusion is when mountains appear to be much nearer in clear weather with low humidity (Foehn) than they are. This is because haze is a cue for depth perception, signall |
https://en.wikipedia.org/wiki/Bulirsch%E2%80%93Stoer%20algorithm | In numerical analysis, the Bulirsch–Stoer algorithm is a method for the numerical solution of ordinary differential equations which combines three powerful ideas: Richardson extrapolation, the use of rational function extrapolation in Richardson-type applications, and the modified midpoint method, to obtain numerical solutions to ordinary differential equations (ODEs) with high accuracy and comparatively little computational effort. It is named after Roland Bulirsch and Josef Stoer. It is sometimes called the Gragg–Bulirsch–Stoer (GBS) algorithm because of the importance of a result about the error function of the modified midpoint method, due to William B. Gragg.
Underlying ideas
The idea of Richardson extrapolation is to consider a numerical calculation whose accuracy depends on the used stepsize h as an (unknown) analytic function of the stepsize h, performing the numerical calculation with various values of h, fitting a (chosen) analytic function to the resulting points, and then evaluating the fitting function for h = 0, thus trying to approximate the result of the calculation with infinitely fine steps.
Bulirsch and Stoer recognized that using rational functions as fitting functions for Richardson extrapolation in numerical integration is superior to using polynomial functions because rational functions are able to approximate functions with poles rather well (compared to polynomial functions), given that there are enough higher-power terms in the denominator to account for nearby poles. While a polynomial interpolation or extrapolation only yields good results if the nearest pole is rather far outside a circle around the known data points in the complex plane, rational function interpolation or extrapolation can have remarkable accuracy even in the presence of nearby poles.
The modified midpoint method by itself is a second-order method, and therefore generally inferior to fourth-order methods like the fourth-order Runge–Kutta method. However, it has th |
https://en.wikipedia.org/wiki/Muriel%20Seltman | Muriel Seltman (; 27 March 1927 – 2 December 2019) was British left-wing activist, mathematics educator, historian of mathematics, and author of books on mathematics, religion, politics, and philosophy.
Life
Seltman was born in Stamford Hill, a Jewish neighborhood of London, on 27 March 1927. She studied mathematics and mathematics education at Trinity College Dublin, and met her husband there. They joined the Communist Party of Great Britain in 1952, but by the early 1960s had been expelled from the party for their anti-revisionism (sympathy for Maoism and opposition to the Khrushchev Thaw). They traveled with their son to North Korea, where Seltman worked as a teacher, but, bored with the North Korean cult of personality and their life there, left for China in 1965, just in time for the Cultural Revolution. Disillusioned, they returned to England in 1966, and Seltman later wrote a book What's Left? What's Right? describing her experiences.
She taught mathematics at Avery Hill College beginning in 1968, retiring in 1981 but continuing on a part-time basis for another 20 years, through the college's 1985 incorporation into the University of Greenwich. Her works in mathematics and the history of mathematics include a translation of a book on algebra by Thomas Harriot, originally published in 1631, a few years after Harriot's death. Co-editor Robert Goulding provided the translation, while Seltman was responsible for the book's detailed commentary on Harriot's work, with both translation and commentary based on a master's thesis she wrote at University College London, A Commentary on the Artis Analyticae Praxis of Thomas Harriot (1972). She also completed a PhD at University College London, with the dissertation Descartes's "Regulae ad directionem ingenii": a case-study in the emergence of early modern algebra (1987).
Although of Jewish descent, she became a nontheist Quaker, and despite her early experiences continued to describe herself as a Marxist. She died on |
https://en.wikipedia.org/wiki/William%20Feller | William "Vilim" Feller (July 7, 1906 – January 14, 1970), born Vilibald Srećko Feller, was a Croatian–American mathematician specializing in probability theory.
Early life and education
Feller was born in Zagreb to Ida Oemichen-Perc, a Croatian–Austrian Catholic, and Eugen Viktor Feller, son of a Polish–Jewish father (David Feller) and an Austrian mother (Elsa Holzer).
Eugen Feller was a famous chemist and created Elsa fluid named after his mother. According to Gian-Carlo Rota, Eugen Feller's surname was a "Slavic tongue twister", which William changed at the age of twenty. This claim appears to be false. His forename, Vilibald, was chosen by his Catholic mother for the saint day of his birthday.
Work
Feller held a docent position at the University of Kiel beginning in 1928. Because he refused to sign a Nazi oath, he fled the Nazis and went to Copenhagen, Denmark in 1933. He also lectured in Sweden (Stockholm and Lund). As a refugee in Sweden, Feller reported being troubled by increasing fascism at the universities. He reported that the mathematician Torsten Carleman would offer his opinion that Jews and foreigners should be executed.
Finally, in 1939 he arrived in the U.S., where he became a citizen in 1944 and was on the faculty at Brown and Cornell. In 1950 he became a professor at Princeton University.
The works of Feller are contained in 104 papers and two books on a variety of topics such as mathematical analysis, theory of measurement, functional analysis, geometry, and differential equations in addition to his work in mathematical statistics and probability.
Feller was one of the greatest probabilists of the twentieth century. He is remembered for his championing of probability theory as a branch of mathematical analysis in Sweden and the United States. In the middle of the 20th century, probability theory was popular in France and Russia, while mathematical statistics was more popular in the United Kingdom and the United States, according to the Swed |
https://en.wikipedia.org/wiki/Otto%20the%20Orange | Otto the Orange is the mascot for the Syracuse Orange, the athletic teams of Syracuse University in Syracuse, New York, USA. Otto is an anthropomorphism of the citrus fruit, wearing a large blue hat and blue pants. Otto can often be seen at Syracuse sporting events in the JMA Wireless Dome and other venues.
Mascot history
Saltine Warrior
The Syracuse mascot was originally a Native American character named "The Saltine Warrior" (Syracuse's unofficial nickname is the Salt City) and "Big Chief Bill Orange". The character was born out of a hoax in which it was claimed that a 16th-century Onondaga chief was unearthed while digging the foundation for the women's gymnasium in 1928.
In the mid-1950s, the father of a Lambda Chi Alpha fraternity brother owned a cheerleading camp. He made a Saltine Warrior costume for his son to wear at SU football games. Thus began a nearly forty-year tradition of Lambda Chi brothers serving as SU's mascot. In 1990 however the University opened up the mascot traditions to the entire student body (Daily Orange, February 22, 1990).
In December 1977, Native American students successfully petitioned the University to discontinue the Saltine Warrior, citing the mascot's stereotypical portrayal of Native Americans. The mascot was discontinued in 1978. During the 1978 season, the University introduced a Roman gladiator dressed in orange armor, but the idea proved largely unpopular among fans, who regularly booed the mascot.
Otto becomes official
In the 1980s, a new Syracuse University mascot emerged and was described by Sports Illustrated in 1984 as a "juiced-up, bumbling citrus fruit from which two legs protrude", and quickly became popular on campus. Then, the mascot was simply known as "the Orange", and was designed and crafted by Eric Heath, an SU cheerleader, according to the SU Archives.
Early on the mascot had multiple monikers, including Clyde and Woody. In the summer of 1990, the cheerleaders and mascots were at Cheerleading Camp in T |
https://en.wikipedia.org/wiki/Choke%20pear%20%28plant%29 | A choke pear or chocky-pear is an astringent fruit. The term is used for the fruit of any variety of pear which has an astringent taste and is difficult to swallow.
Varieties
One variety of choke pear is poire d'Angoisse, a variety of pear that was grown in Angoisse, a commune in the Arrondissement of Nontron in Dordogne, France, in the Middle Ages, which was hard, bad tasting, and almost impossible to eat raw. In the words of L'Académie française, the pear is "si âpre et si revèche au goût qu'on a de la peine à l'avaler" ("so harsh and crabbed of taste that one can only with difficulty swallow it"). These qualities, and the common meaning of angoisse in French language ("anguish") apparently originated the French idiom avaler des poires d'angoisse ("swallow pears of Angoisse/anguish") meaning "to suffer great displeasures". Possibly because of this idiom, the names "choke pear" and "pear of anguish" have been used for a gagging device allegedly used in Europe, sometime before the 17th century.
Dalechamps has identified this with the species of pear that Pliny the Elder listed as "ampullaceum" in his Naturalis Historia. It, like most sour-tasting pear cultivars, was most likely used to make perry.
Similar fruits
Similarly named trees with astringent fruits include the choke cherry (the common name for several species of cherry tree that grow in North America and whose fruits are small and bitter tasting: Prunus virginiana, Prunus demissa, and Prunus serotina) and the choke plum. |
https://en.wikipedia.org/wiki/Solipsis | Solipsis is a free and open-source system for a massively multi-participant shared virtual world designed by Joaquin Keller and Gwendal Simon at France Télécom Research and Development Labs. It aims to provide the infrastructure for a metaverse-like public virtual territory. Relying on a peer-to-peer architecture, the virtual world may potentially be inhabited by a theoretically unlimited number of participants.
Motivations
A central objective of Solipsis is to create a virtual world which is as independent as possible from the influence of private interests, such as server ownership. In order to achieve this, it is based around a peer-to-peer model rather than the traditional server-client one. Additionally, it aims to give users more flexibility in designing interfaces and content in their individual segments of the virtual world.
Main principles
A Solipsis entity is a basic element of the virtual world. To exist, an entity should run a node that may be controlled by a navigator. Nodes are self-organized in a pure peer-to-peer network, in which relationships depend on virtual proximity. A navigator is mainly a graphical user interface, but some communication services may be added to one for interaction between entities.
The virtual world is initially empty and is only filled by entities run by end users' computers. All Solipsis nodes are functionally equal, and no preordained infrastructure is required. This eliminates as far as possible any restrictions on the content or functionality of the world.
Current status
Solipsis currently consists of:
A peer-to-peer protocol over UDP. The Solipsis protocol gives a node the ability to broadcast its presence within the virtual world. Moreover, this protocol aims to guarantee the maintenance of some global properties.
A node-navigator interface, which takes the form of an API between the node and the navigator. Currently written in XML-RPC, this interface allows a navigator to control a node and to retrieve inf |
https://en.wikipedia.org/wiki/KLV | KLV (Key-Length-Value) is a data encoding standard, often used to embed information in video feeds. The standard uses a type–length–value encoding scheme. Items are encoded into Key-Length-Value triplets, where key identifies the data, length specifies the data's length, and value is the data itself. It is defined in SMPTE 336M-2007 (Data Encoding Protocol Using Key-Length Value), approved by the Society of Motion Picture and Television Engineers. Due to KLV's large degree of interoperability, it has also been adopted by the Motion Imagery Standards Board.
Byte packing
In a binary stream of data, a KLV set is broken down in the following fashion, with all integer-interpretation being big endian:
Key field
The first few bytes are the Key, much like a key in a standard hash table data structure. Keys can be 1, 2, 4, or 16 bytes in length. Presumably in a separate specification document you would agree on a key length for a given application. Sixteen byte keys are usually reserved for use as globally registered unique identifiers, and the Value portion of such a packet usually contains a series of more KLV sets with smaller keys.
Length field
Following the bytes for the Key are bytes for the Length field which will tell you how many bytes follow the length field and make up the Value portion. There are four kinds of encoding for the Length field: 1-byte, 2-byte, 4-byte and Basic Encoding Rules (BER). The 1-, 2-, and 4-byte variants are pretty straightforward: make an unsigned integer out of the bytes, and that integer is the number of bytes that follow.
BER length encoding is a bit more complicated but the most flexible. If the first byte in the length field does not have the high bit set (0x80), then that single byte represents an integer between 0 and 127 and indicates the number of Value bytes that immediately follows. If the high bit is set, then the lower seven bits indicate how many bytes follow that themselves make up a length field.
For example if the |
https://en.wikipedia.org/wiki/Park%20Royal | Park Royal is an area in London, England, partly in the London Borough of Ealing and partly the London Borough of Brent.
It is the site of the largest business park in London, but despite intensive existing use, the area is, together with adjacent Old Oak Common, intended to become the UK's largest regeneration scheme. This arises from the area's relatively central location and also the strong and improving transport links which will include (at Old Oak Common), HS2 and the Elizabeth line. The scale of redevelopment has led to the Park Royal and Old Oak area being described as a potential "Canary Wharf of West London".
Location
To the north of Park Royal is Harlesden in the northeast, West Twyford, an outlying area of Ealing, in the northwest, and a Network Rail depot at Stonebridge Park in the far north, which also has London Underground Bakerloo line tracks running through it (and Harlesden station nearby). On the eastern side, Park Royal is bounded by Acton Lane and Park Royal Road (B4492). The Central Middlesex Hospital is located here.
The Grand Union Canal runs through the middle of the Park Royal industrial estate, with pedestrian access via the towpath.
History
The name Park Royal derives from the short-lived showgrounds opened in 1903 by the Royal Agricultural Society as a permanent exhibition site for the society's annual show. After only three years the society sold the site, and returned to a touring format for its shows. With its road, rail and canal links, Park Royal was subsequently developed for industrial use, mainly during the 1930s.
For many years it was a centre of engineering, with firms including Park Royal Vehicles, GKN and Landis and Gyr.
Queens Park Rangers F.C. played on two grounds in Park Royal. The first was the Horse Ring, later the site of the Guinness brewery, which had a capacity of 40,000. When the Royal Agricultural Society sold the grounds in 1907, QPR moved to the Park Royal Ground, south, an almost exact replica of Ayres |
https://en.wikipedia.org/wiki/Theodore%20J.%20Rivlin | Theodore Joseph Rivlin (11 September 1926, Brooklyn – 22 July 2006, Croton-on-Hudson) was an American mathematician, specializing in approximation theory. He is known for his 1969 book An Introduction to the Approximation of Functions (Dover reprint, 1981), which became a standard text.
Education and career
Rivlin received in 1948 his bachelor's degree from Brooklyn College. After serving in the United States Army Air Force for eighteen months, he became a graduate student in mathematics at Harvard University, where he received in 1953 his Ph.D. with thesis advisor Joseph L. Walsh and thesis Overconvergent Taylor series and the zeroes of related polynomials. Rivlin from 1952 to 1955 taught mathematics at Johns Hopkins University and from 1955 to 1956 was a research associate at the Institute for Mathematics Sciences at New York University (later renamed the Courant Institute of Mathematical Sciences). He was from 1956 to 1959 a senior mathematical analyst at the Fairchild Engine and Airplane Corporation in Deer Park on Long Island; there he began intensive study of approximation theory and Chebyshev polynomials in connection with his work on developing thermodynamic tables. From 1959 until his retirement nearly 35 years later, Rivlin was a research staff member at IBM's Thomas J. Watson Research Center in Yorktown Heights, New York. He was on sabbatical from 1969 to 1970 at Stanford University's Computer Science Department and from 1976 to 1977 at Imperial College London's Mathematics Department.
From 1966 to 1976 Rivlin was an adjunct professor of mathematics at the Graduate Center of the City University of New York, where he lectured on approximation theory. For many years he was an associate editor for the Journal of Approximation Theory and wrote over 80 research articles on approximation theory and computational mathematics. The Annals of Numerical Analysis published in 1997 a special issue entitled The Heritage of P.L. Chebyshev: A Festschrift in honor of th |
https://en.wikipedia.org/wiki/Mac%20OS%20Hebrew | Mac OS Hebrew is used in Apple Macintosh computers to represent Hebrew texts. |
https://en.wikipedia.org/wiki/Hamming%20scheme | The Hamming scheme, named after Richard Hamming, is also known as the hyper-cubic association scheme, and it is the most important example for coding theory. In this scheme the set of binary vectors of length and two vectors are -th associates if they are Hamming distance apart.
Recall that an association scheme is visualized as a complete graph with labeled edges. The graph has vertices, one for each point of and the edge joining vertices and is labeled if and are -th associates. Each edge has a unique label, and the number of triangles with a fixed base labeled having the other edges labeled and is a constant depending on but not on the choice of the base. In particular, each vertex is incident with exactly edges labeled ; is the valency of the relation The in a Hamming scheme are given by
Here, and The matrices in the Bose-Mesner algebra are matrices, with rows and columns labeled by vectors In particular the -th entry of is if and only if |
https://en.wikipedia.org/wiki/Pseudospectral%20optimal%20control | Pseudospectral optimal control is a joint theoretical-computational method for solving optimal control problems. It combines pseudospectral (PS) theory with optimal control theory to produce a PS optimal control theory. PS optimal control theory has been used in ground and flight systems in military and industrial applications. The techniques have been extensively used to solve a wide range of problems such as those arising in UAV trajectory generation, missile guidance, control of robotic arms, vibration damping, lunar guidance, magnetic control, swing-up and stabilization of an inverted pendulum, orbit transfers, tether libration control, ascent guidance and quantum control.
Overview
There are a very large number of ideas that fall under the general banner of pseudospectral optimal control. Examples of these are the Legendre pseudospectral method, the Chebyshev pseudospectral method, the Gauss pseudospectral method, the Ross-Fahroo pseudospectral method, the Bellman pseudospectral method, the flat pseudospectral method and many others. Solving an optimal control problem requires the approximation of three types of mathematical objects: the integration in the cost function, the differential equation of the control system, and the state-control constraints. An ideal approximation method should be efficient for all three approximation tasks. A method that is efficient for one of them, for instance an efficient ODE solver, may not be an efficient method for the other two objects. These requirements make PS methods ideal because they are efficient for the approximation of all three mathematical objects. In a pseudospectral method, the continuous functions are approximated at a set of carefully selected quadrature nodes. The quadrature nodes are determined by the corresponding orthogonal polynomial basis used for the approximation. In PS optimal control, Legendre and Chebyshev polynomials are commonly used. Mathematically, quadrature nodes are able to achieve high acc |
https://en.wikipedia.org/wiki/Broken%20space%20diagonal | In a magic cube, a broken space diagonal is a sequence of cells of the cube that follows a line parallel to a space diagonal of the cube, and continues on the corresponding point of an opposite face whenever it reaches a face of the cube. The corresponding concept in two-dimensional magic squares is a broken diagonal. |
https://en.wikipedia.org/wiki/Nuker%20Team | The Nuker Team was formed to use the Hubble Space Telescope, with its high-resolution imaging and spectroscopy, to investigate the central structure and dynamics of galaxies. The team used the HST to examine supermassive black holes and determined the relationship between a galaxy's central black hole's mass and velocity dispersion. The team continues to conduct research and publish papers on the supermassive black holes of galaxies and clusters. The group was initially formed by Tod R. Lauer, then a first year postdoc. At the first meeting of the group held at Princeton University in June 1985, Sandra Faber was elected the group leader.
Members
The original members of the Nuker Team include Alan Dressler (OCIW), Sandra Faber (UCO/Lick; First PI), John Kormendy (Texas), Tod R. Lauer (NOAO), Douglas Richstone (Michigan; Present PI), and Scott Tremaine (IAS). Later additions to the team include Ralf Bender (Munchen), Alexei V. Filippenko (Berkeley), Karl Gebhardt (Texas), Richard Green (LBTO), Kayhan Gultekin (Michigan), Luis C. Ho (OCIW), John Magorrian (Oxford), Jason Pinkney (Ohio Northern), and Christos Siopis (Michigan).
Etymology
The name "Nuker" began as an informal internal reference by members of the team to each other, because they came together to study the nuclei of galaxies using the space telescope. The first use of the name was in a 1989 email from Faber, who addressed her five colleagues as "Dear Nukers". As the team began to publish its research, the name came into general use in the scientific community.
The name "Nuker" is also used in reference to the "Nuker Law", which is a description of the inner few (~3-10) arcseconds of predominantly nearby (< 30 Mpc) early-type galaxy light-profiles. The Nuker Law was described first by members of the Nuker Team, from which it gets its name.
See also
List of astronomical societies |
https://en.wikipedia.org/wiki/Wattle%20%28construction%29 | Wattle is made by weaving flexible branches around upright stakes to form a woven lattice. The wattle may be made into an individual panel, commonly called a hurdle, or it may be formed into a continuous fence. Wattles also form the basic structure for wattle and daub wall construction, where wattling is daubed with a plaster-like substance to make a weather-resistant wall.
History
Evidence of wattle construction was found at Woodcutts Settlement from the British Iron Age, and the Roman Vitruvius wrote about wattles in his book on architecture, De architectura, but the technique goes back to Neolithic times.
Technique
The construction of wattles starts with the uprights, whether they are set into a frame or placed into the ground. Starting at the bottom, flexible willow shoots, called withies, are woven in and out of the uprights (staves).
Wattle and daub
Wattles forms the basis of wattle and daub, a composite building material used for making walls, in which wattle is daubed with a sticky material usually made of some combination of wet soil, clay, sand, animal dung and straw. Wattle and daub has been used for at least 6,000 years, and is still an important construction material in many parts of the world. The technique is similar to modern lath and plaster, a common building material for wall and ceiling surfaces, in which a series of nailed wooden strips are covered with plaster smoothed into a flat surface. Many historic buildings include wattle and daub construction, mostly as infill panels in timber frame construction.
See also
Basket weaving
Lath and plaster |
https://en.wikipedia.org/wiki/Gene%20flow | In population genetics, gene flow (also known as migration and allele flow) is the transfer of genetic material from one population to another. If the rate of gene flow is high enough, then two populations will have equivalent allele frequencies and therefore can be considered a single effective population. It has been shown that it takes only "one migrant per generation" to prevent populations from diverging due to drift. Populations can diverge due to selection even when they are exchanging alleles, if the selection pressure is strong enough. Gene flow is an important mechanism for transferring genetic diversity among populations. Migrants change the distribution of genetic diversity among populations, by modifying allele frequencies (the proportion of members carrying a particular variant of a gene). High rates of gene flow can reduce the genetic differentiation between the two groups, increasing homogeneity. For this reason, gene flow has been thought to constrain speciation and prevent range expansion by combining the gene pools of the groups, thus preventing the development of differences in genetic variation that would have led to differentiation and adaptation. In some cases dispersal resulting in gene flow may also result in the addition of novel genetic variants under positive selection to the gene pool of a species or population (adaptive introgression.)
There are a number of factors that affect the rate of gene flow between different populations. Gene flow is expected to be lower in species that have low dispersal or mobility, that occur in fragmented habitats, where there is long distances between populations, and when there are small population sizes. Mobility plays an important role in dispersal rate, as highly mobile individuals tend to have greater movement prospects. Although animals are thought to be more mobile than plants, pollen and seeds may be carried great distances by animals, water or wind. When gene flow is impeded, there can be an in |
https://en.wikipedia.org/wiki/Chang%20graphs | In the mathematical field of graph theory, the Chang graphs are three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly regular, with the same parameters and spectrum as the line graph L(K8) of the complete graph K8.
Each of these three graphs may be obtained by graph switching from L(K8). That is, a subset S of the vertices of L(K8) is chosen, each edge that connects a vertex in S with a vertex not in S is deleted from L(K8), and an edge is added for each pair of vertices (with again one in S and one not in S) that were not already connected by an edge. Among the graphs that can be generated in this way, three of them are the Chang graphs.
The Chang graphs are named after Chang Li-Chien, who proved that, with only these exceptions, every line graph of a complete graph is uniquely determined by its parameters as a strongly regular graph.
See also
Shrikhande graph, a similar exception to the uniqueness of the strongly regular graphs |
https://en.wikipedia.org/wiki/Sound%20speed%20profile | A sound speed profile shows the speed of sound in water at different vertical levels. It has two general representations:
tabular form, with pairs of columns corresponding to ocean depth and the speed of sound at that depth, respectively.
a plot of the speed of sound in the ocean as a function of depth, where the vertical axis corresponds to the depth and the horizontal axis corresponds to the sound speed. By convention, the horizontal axis is placed at the top of the plot, and the vertical axis is labeled with values that increase from top to bottom, thus reproducing visually the ocean from its surface downward.
Table 1 shows an example of the first representation; figure 1 shows the same information using the second representation.
Although given as a function of depth, the speed of sound in the ocean does not depend solely on depth. Rather, for a given depth, the speed of sound depends on the temperature at that depth, the depth itself, and the salinity at that depth, in that order.
The speed of sound in the ocean at different depths can be measured directly, e.g., by using a velocimeter, or, using measurements of temperature and salinity at different depths, it can be calculated using a number of different sound speed formulae which have been developed. Examples of such formulae include those by Wilson, Chen and Millero ,and Mackenzie. Each such formulation applies within specific limits of the independent variables.
From the shape of the sound speed profile in figure 1, one can see the effect of the order of importance of temperature and depth on sound speed. Near the surface, where temperatures are generally highest, the sound speed is often highest because the effect of temperature on sound speed dominates. Further down the water column, sound speed also decreases as temperature decreases in the ocean thermocline, and sound speed also decreases. At a certain point, however, the effect of depth, i.e., pressure, begins to dominate, and the sound s |
https://en.wikipedia.org/wiki/MolecularLab | MolecularLab is an Italian website of science, specialized in science, biotechnology, molecular biology, with news, forums, and events. With over 4 million page views in May 2009 it is the most visited Italian science webzine.
Purpose
MolecularLab has several objectives:
Providing the latest news and important discoveries in the biotechnology, medical, and molecular fields
Developing the building of a community, allowing the encounter and cultural exchange among researchers, teachers, and companies
Deepening techniques of molecular biology and cellular technologies with an educational section for university students, enriched with video and interactive animations
History
The site was founded in 2001 with the publication of notes from a degree course. In 2003 the Molecularlab.it site was created and then has gradually added new features: to the didactics was added daily news and then a community. It was the first news organization specializing on Italian science daily.
One of the features of this site has been the intensive use of systems for distribution of news: custom feeds to be updated on certain categories or topics, News Ticker and widgets to spread to other sites, an ICS file to sync with the events reported by MolecularLab, and other tools as plugins to search the site by the browser. Since January 2006 MolecularLab is in partnership with World Community Grid to promote the use of computers in biomedical research.
During the first years, the comments associated to the news were free making it possible for users to open discussions of interest. From 2007, comments were moderated and limited to registered users.
Later a multimedia section, a directory science, a section for beginners, and a glossary were added. The last section consists of a quiz.
The newspaper, now owned by Richard Fallini, works with the European information system CORDIS and the association for consumers Aduc, receives press releases from the major Italian research institutions, a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.