source stringlengths 31 207 | text stringlengths 12 1.5k |
|---|---|
https://en.wikipedia.org/wiki/List%20of%20floods | A flood is an overflow of water that submerges land that is usually dry. In the sense of "flowing water", the word may also be applied to the inflow of the tide. Floods are an area of study of the discipline hydrology and are of significant concern in agriculture, civil engineering and public health.
List of notable floods
20th century BC
Jishi Gorge outburst flood about 1920 BC
14th century
Saint Marcellus's flood a storm tide is also called the "Second St. Marcellus flood".
St. Mary Magdalene's flood occurred on and around the feast day of St. Mary Magdalene, 25 July; the passage of a Genoa low the rivers Rhine, Moselle, Main, Danube, Weser, Werra, Unstrut, Elbe, Vltava and their tributaries inundated large areas. Even the river Eider north of Hamburg flooded the surrounding land. Many towns such as Cologne, Mainz, Frankfurt am Main, Würzburg, Regensburg, Passau and Vienna were seriously damaged. The affected area extended to Carinthia and northern Italy. The overall number of casualties is not known, but it is believed that in the Danube area alone 6000 people were killed.
15th century
The All Saints Day Flood of 1436 () on All Saints' Day (1 November) 1436 was a storm tide that hit the entire North Sea coast of the German Bight. In the North Frisian village of Tetenbüll alone 173 people died. Eidum on the island of Sylt was destroyed; its inhabitants left and founded the village of Westerland as a result. List on Sylt was also abandoned after the floods and re |
https://en.wikipedia.org/wiki/Robert%20Rockwell | Robert Rockwell (October 15, 1920 – January 25, 2003) was an American stage, film, radio and television actor. He is best known for playing the handsome, but awkward biology teacher Philip Boynton in the radio and television sitcom Our Miss Brooks opposite Eve Arden.
Career
A native of Lake Bluff, Illinois Rockwell studied at the Pasadena Playhouse College of Theatre Arts, from which he obtained a master's degree. During World War II he enlisted in the US Navy for four years serving in Washington D.C. After beginning his career as a contract player for Republic Studios he appeared, over his almost 50-year acting career, in more than 350 television episodes and, on stage, opposite José Ferrer in the 1946 Broadway production of Cyrano de Bergerac, and with Ginger Rogers during the 1960s in a San Diego production of Whitfield Cook's play A More Perfect Union. He appeared (uncredited) in the first Superman television show episode as Clark Kent's father, Jor-El in 1952. He appeared in The Millionaire in the 1958 episode "Millionaire Lee Randolph" as the title character. The following year, he performed as Mr. Philips in the Gunsmoke episode “Renegade White”, and as Dick Benedict in the Perry Mason episode "The case of the Deadly Toy" as the love interest of the defendant Claire Allison. He starred in the 1961 Perry Mason episode "The Case of the Misguided Missile" as an Air Force officer court-martialled on a murder charge. He later starred in the 1962 Perry Mason episodes "The |
https://en.wikipedia.org/wiki/Schatten%20class%20operator | In mathematics, specifically functional analysis, a pth Schatten-class operator is a bounded linear operator on a Hilbert space with finite pth Schatten norm. The space of pth Schatten-class operators is a Banach space with respect to the Schatten norm.
Via polar decomposition, one can prove that the space of pth Schatten class operators is an ideal in B(H). Furthermore, the Schatten norm satisfies a type of Hölder inequality:
If we denote by the Banach space of compact operators on H with respect to the operator norm, the above Hölder-type inequality even holds for . From this it follows that , is a well-defined contraction. (Here the prime denotes (topological) dual.)
Observe that the 2nd Schatten class is in fact the Hilbert space of Hilbert–Schmidt operators. Moreover, the 1st Schatten class is the space of trace class operators.
Operator theory |
https://en.wikipedia.org/wiki/Harmonic%20wavelet%20transform | In the mathematics of signal processing, the harmonic wavelet transform, introduced by David Edward Newland in 1993, is a wavelet-based linear transformation of a given function into a time-frequency representation. It combines advantages of the short-time Fourier transform and the continuous wavelet transform. It can be expressed in terms of repeated Fourier transforms, and its discrete analogue can be computed efficiently using a fast Fourier transform algorithm.
Harmonic wavelets
The transform uses a family of "harmonic" wavelets indexed by two integers j (the "level" or "order") and k (the "translation"), given by , where
These functions are orthogonal, and their Fourier transforms are a square window function (constant in a certain octave band and zero elsewhere). In particular, they satisfy:
where "*" denotes complex conjugation and is Kronecker's delta.
As the order j increases, these wavelets become more localized in Fourier space (frequency) and in higher frequency bands, and conversely become less localized in time (t). Hence, when they are used as a basis for expanding an arbitrary function, they represent behaviors of the function on different timescales (and at different time offsets for different k).
However, it is possible to combine all of the negative orders (j < 0) together into a single family of "scaling" functions where
The function φ is orthogonal to itself for different k and is also orthogonal to the wavelet functions for non-negative j:
|
https://en.wikipedia.org/wiki/Phi%20bond | In chemistry, phi bonds (φ bonds) are covalent chemical bonds, where six lobes of one involved atomic orbital overlap six lobes of the other involved atomic orbital. This overlap leads to the formation of a bonding molecular orbital with three nodal planes which contain the internuclear axis and go through both atoms.
The Greek letter φ in their name refers to f orbitals, since the orbital symmetry of the φ bond is the same as that of the usual (6-lobed) type of f orbital when seen down the bond axis.
There was one possible candidate known in 2005 of a molecule with phi bonding (a U−U bond, in the molecule U2). However, later studies that accounted for spin orbit interactions found that the bonding was only of fourth order. Experimental evidence of existence of phi bonding between a thorium atom and cyclooctatetraene in thorocene has been shown, supported by computational analysis.
References
Chemical bonding
Hypothetical processes |
https://en.wikipedia.org/wiki/Harry%20Treadaway | Harry John Newman Treadaway (born 10 September 1984) is a British actor. His credits include Control (2007), Fish Tank (2009), Pelican Blood (2010), Flight of the Storks (2012), Mr. Mercedes (2017-2018), The Crown (2019), Star Trek: Picard (2020), Deceit (2021), and The Chemistry of Death (2023).
Early life and education
Born at the Royal Devon and Exeter Hospital in Exeter, Devon, Treadaway was brought up in Sandford, Devon. His father is an architect and his mother is a primary school teacher. and twin Luke. Treadaway attended Queen Elizabeth's Community College in Crediton, Devon, where he played in the twice Devon Cup winning Rugby Union team.
Inspired by a love of Eddie Vedder and with support from their secondary school drama teacher, the twins formed a band called Lizardsun. They also both joined the National Youth Theatre.
Treadaway studied acting at LAMDA and graduated in 2006.
Career
While still at drama school, he had his professional debut in Brothers of the Head, alongside his twin brother Luke Treadaway, a feature film about conjoined twin brothers in a punk rock band. He played Tom Howe, the band's rhythm guitarist and songwriter, and his brother Luke played Barry Howe, the lead singer. The Treadaways performed all tracks featured in the film themselves live on stage, as well as recording nine tracks for the sound-track album.
In 2007, he acted in the Tiger Aspect film Recovery. He starred as Mark Brogan on the Channel 4 series Cape Wrath (known as M |
https://en.wikipedia.org/wiki/Complex%20Systems%20%28journal%29 | Complex Systems is a quarterly peer-reviewed open access scientific journal covering subjects ranging across a number of scientific and engineering fields, including computational biology, computer science, mathematics, and physics. It was established in 1987 with Stephen Wolfram as founding editor-in-chief. The journal is published by Complex Systems Publications.
Abstracting and indexing
The journal is abstracted and indexed in:
See also
List of journals in systems science
References
External links
Academic journals established in 1987
Systems journals
Computer science journals
Quarterly journals
English-language journals
Open access journals |
https://en.wikipedia.org/wiki/Structural%20risk%20minimization | Structural risk minimization (SRM) is an inductive principle of use in machine learning. Commonly in machine learning, a generalized model must be selected from a finite data set, with the consequent problem of overfitting – the model becoming too strongly tailored to the particularities of the training set and generalizing poorly to new data. The SRM principle addresses this problem by balancing the model's complexity against its success at fitting the training data. This principle was first set out in a 1974 paper by Vladimir Vapnik and Alexey Chervonenkis and uses the VC dimension.
In practical terms, Structural Risk Minimization is implemented by minimizing , where is the train error, the function is called a regularization function, and is a constant. is chosen such that it takes large values on parameters that belong to high-capacity subsets of the parameter space. Minimizing in effect limits the capacity of the accessible subsets of the parameter space, thereby controlling the trade-off between minimizing the training error and minimizing the expected gap between the training error and test error.
The SRM problem can be formulated in terms of data. Given n data points consisting of data x and labels y, the objective is often expressed in the following manner:
The first term is the mean squared error (MSE) term between the value of the learned model, , and the given labels . This term is the training error, , that was discussed earlier. The second term, place |
https://en.wikipedia.org/wiki/Suren%20Arakelov | Suren Yurievich Arakelov (, ) (born October 16, 1947 in Kharkiv) is a Soviet mathematician of Armenian descent known for developing Arakelov theory.
Biography
From 1965 onwards Arakelov attended the Mathematics department of Moscow State University, where he graduated in 1971.
In 1974, Arakelov received his candidate of sciences degree from the Steklov Institute in Moscow, under the supervision of Igor Shafarevich. He then worked as a junior researcher at the Gubkin Russian State University of Oil and Gas in Moscow until 1979. He did protest against arrest of Alexander Solzhenitsyn, and was arrested and committed to a mental hospital. Then he stopped his research activity to pursue other life goals. As of 2014 he lives in Moscow with his wife and children.
Arakelov theory
Arakelov theory was exploited by Paul Vojta to give a new proof of the Mordell conjecture and by Gerd Faltings in his proof of Lang's generalization of the Mordell conjecture.
Publications
References
External links
1947 births
20th-century Ukrainian mathematicians
Living people
Scientists from Kharkiv
Soviet mathematicians
Arithmetic geometers
Moscow State University alumni |
https://en.wikipedia.org/wiki/Storm%20in%20a%20Teacup | Storm in a Teacup may refer to:
Film and television
Storm in a Teacup (film), a 1937 British film
A Storm in a Teacup (2000 film), a 2000 film directed by Ding Sheng
"A Storm in a Teacup" (Porridge), a 1977 television episode
Literature
"A Storm in a Teacup" (short story), a 1920 story by Lu Xun
Storm in a Teacup: The Physics of Everyday Life, a 2016 book by Helen Czerski
Music
"Storm in a Teacup" (The Fortunes song), 1971
"Storm in a Teacup", a song by Badfinger from Magic Christian Music, 2010 reissue
"Storm in a Teacup", a song by Erasure from Light at the End of the World, 2007
"Storm in a Teacup", a song by Milburn from Well Well Well, 2006
"Storm in a Teacup", a song by the Red Hot Chili Peppers from Stadium Arcadium, 2006
Other uses
Storm in a teacup (idiom), or tempest in a teapot, an idiom meaning a small event that has been exaggerated
Storm in a Teacup (company), an Italian video game developer
See also
Teacup in a Storm, a Hong Kong radio talk program |
https://en.wikipedia.org/wiki/Isochore%20%28genetics%29 | In genetics, an isochore is a large region of genomic DNA (greater than 300 kilobases) with a high degree of uniformity in GC content; that is, guanine (G) and cytosine (C) bases. The distribution of bases within a genome is non-random: different regions of the genome have different amounts of G-C base pairs, such that regions can be classified and identified by the proportion of G-C base pairs they contain.
Bernardi and colleagues first noticed the compositional non-uniformity of vertebrate genomes using thermal melting and density gradient centrifugation.
The DNA fragments extracted by the gradient centrifugation were later termed "isochores", which was subsequently defined as "very long (much greater than 200 KB) DNA segments" that "are fairly homogeneous in base composition and belong to a small number of major classes distinguished by differences in guanine-cytosine (GC) content". Subsequently, the isochores "grew" and were claimed to be ">300 kb in size."
The theory proposed that the isochore composition of genomes varies markedly between "warm-blooded" (homeotherm) vertebrates and "cold-blooded" (poikilotherm) vertebrates and later became known as the isochore theory.
The thermodynamic stability hypothesis
The isochore theory purported that the genome of "warm-blooded" vertebrates (mammals and birds) are mosaics of long isochoric regions of alternating GC-poor and GC-rich composition, as opposed to the genome of "cold-blooded" vertebrates (fishes and amphibians) |
https://en.wikipedia.org/wiki/Ed%20Schrader | Ed L. Schrader was the president of Brenau University, a university and women's college in Gainesville, Georgia established in 1878, from 2005 to 2019. He is a geologist by profession.
Early life and education
He is a native of Mississippi. He received a B.S. in geology, with a minor in chemistry, from Millsaps College (Jackson, Mississippi) in 1973. In 1975 he received an M.S. degree from the University of Tennessee. He earned a Ph.D. in geochemistry from Duke University in 1977.
Career
From 1978 to 1980 he taught at the University of Alabama in Tuscaloosa, then worked for several corporations including Chevron Resources Company, J. M. Huber Corporation, United Catalysts/Sud-Chemie A.G., and Diversified Minerals Corporation (president, 1987–88). He taught at Millsaps College for twelve years, starting in 1988 as assistant professor of geology. In 1992 he became chair of the Geology Department, and from 1995 to 2000 he was Associate Dean of Sciences and Professor of Geology. From 2000 to 2005 he served as president of Shorter University in Rome, Georgia. From 2005 to 2019 he was president of Brenau University.
Schrader has written extensively for both academic and non-academic publications. He has authored 64 scholarly presentations and 34 peer-reviewed publications. He also has served as associate editor for Environmental Geology, an international scientific journal. Schrader is a founding member of the Phi Kappa Phi honor society at Brenau and of the Mississippi Alpha c |
https://en.wikipedia.org/wiki/Scott%20W.%20Williams | Scott Williams (born April 22, 1943, in Staten Island, New York) is a professor of mathematics at the University at Buffalo, SUNY. He was recognized by Mathematically Gifted & Black as a Black History Month 2017 Honoree.
Education
Raised in Baltimore, Maryland, Williams attended Morgan State University and earned his bachelor degree of Science in mathematics.
Before earning his bachelor's degree he was already able to solve four advanced problems in The Mathematical Monthly and co-authored two papers on Non-Associative Algebra with his undergraduate advisor Dr. Volodymir Bohun-Chudyniv. Scott Williams earned his Master's and Ph.D. in mathematics from Lehigh University in 1967 and 1969, respectively.
Career
Williams served as a Research Associate in the Department of Mathematics at Pennsylvania State University - University Park, from 1969 to 1971. In 1971, he was chosen to be assistant professor of mathematics at the University at Buffalo and in 1985 was promoted to Full Professor at the university. In 1982, he won the New York Chancellor Award for Excellence in Teaching. In 2004, he was named one of the 50 Most Important Blacks in Research Science by Science Spectrum Magazine and Career Communications Group.
Williams primarily focused on topology and the field of mathematics. In 1975, he was the first topologist to apply the concept of scales (now known as b=d) to give a partial solution of the famous Box Product problem, which is still unsettled today. Dr. Williams is |
https://en.wikipedia.org/wiki/Torkel%20Franz%C3%A9n | Torkel Franzén (1 April 1950, Norrbotten County – 19 April 2006, Stockholm) was a Swedish academic.
Biography
Franzén worked at the Department of Computer Science and Electrical Engineering at Luleå University of Technology, Sweden, in the fields of mathematical logic and computer science. He was known for his work on Gödel's incompleteness theorems and for his contributions to Usenet. He was active in the online science fiction fan community, and even issued his own electronic fanzine Frotz on his fiftieth birthday. He died of bone cancer at age 56.
Selected works
Gödel's Theorem: An Incomplete Guide to its Use and Abuse. Wellesley, Massachusetts: A K Peters, Ltd., 2005. x + 172 pp. .
Inexhaustibility: A Non-Exhaustive Treatment. Wellesley, Massachusetts: A K Peters, Ltd., 2004. Lecture Notes in Logic, #16, Association for Symbolic Logic. .
The Popular Impact of Gödel's Incompleteness Theorem, Notices of the American Mathematical Society, 53, #4 (April 2006), pp. 440–443.
Provability and Truth (Acta universitatis stockholmiensis, Stockholm Studies in Philosophy 9) (1987)
See also
Gödel's incompleteness theorems
References
External links
Home page
Raatikainen, Panu. Review of Gödel's Theorem: An Incomplete Guide to Its Use and Abuse. Notices of the American Mathematical Society, Vol. 54, No. 3 (March 2007), pp. 380–3.
1950 births
2006 deaths
Usenet people
20th-century Swedish mathematicians
21st-century Swedish mathematicians
Mathematical logicians
Academic s |
https://en.wikipedia.org/wiki/Reed%E2%80%93Muench%20method | See article above for overview of 50% endpoints and comparison with other methods of calculating 50% endpoints.
The Reed–Muench method is a simple method for determining 50% endpoints in experimental biology, that is, the concentration of a test substance that produces an effect of interest in half of the test units. Examples include LD50 (the median lethal dose of a toxin or pathogen), EC50 and IC50 (half maximal effective or inhibitory concentration, respectively, of a drug), and TCID50 (50% tissue culture infectious dose of a virus).
The reason for using 50% endpoints is that many dose-response relationships in biology follow a logistic function that flattens out as it approaches the minimal and maximal responses, so it is easier to measure the concentration of the test substance that produces a 50% response.
Notes
Toxicology tests |
https://en.wikipedia.org/wiki/Polymerase%20chain%20reaction%20optimization | The polymerase chain reaction (PCR) is a commonly used molecular biology tool for amplifying DNA, and various techniques for PCR optimization which have been developed by molecular biologists to improve PCR performance and minimize failure.
Contamination and PCR
The PCR method is extremely sensitive, requiring only a few DNA molecules in a single reaction for amplification across several orders of magnitude. Therefore, adequate measures to avoid contamination from any DNA present in the lab environment (bacteria, viruses, or human sources) are required. Because products from previous PCR amplifications are a common source of contamination, many molecular biology labs have implemented procedures that involve dividing the lab into separate areas. One lab area is dedicated to preparation and handling of pre-PCR reagents and the setup of the PCR reaction, and another area to post-PCR processing, such as gel electrophoresis or PCR product purification. For the setup of PCR reactions, many standard operating procedures involve using pipettes with filter tips and wearing fresh laboratory gloves, and in some cases a laminar flow cabinet with UV lamp as a work station (to destroy any extraneomultimer formation). PCR is routinely assessed against a negative control reaction that is set up identically to the experimental PCR, but without template DNA, and performed alongside the experimental PCR.
Hairpins
Secondary structures in the DNA can result in folding or knotting of DNA temp |
https://en.wikipedia.org/wiki/Byron%20Barnard%20Lamont | Byron Barnard Lamont (born 2 January 1945) is a Western Australian botanist. He is currently a senior researcher within the Department of Environmental Biology of Curtin University of Technology. A specialist in ecology of the flora of the South West Botanic Province, he has published hundreds of papers.
Born in Perth, Western Australia, he attended Applecross and Mount Pleasant Primary Schools, and later Wesley College. From 1963 to 1966 he pursued undergraduate studies at the Instituate of Agriculture, University of Western Australia, graduating with a Bachelor of Agricultural Science with majors in Soils, Agronomy and Microbiology. He then undertook a Master's degree under the supervision of Brian Grieve, focussed on soil-plant relationships of Hakea, especially its proteoid roots. His research into proteoid roots earned him a PhD. in 1974. Thereafter he began studying part time for a Doctor of Science degree, which was awarded in 1993. During this period he held a series of academic positions within Curtin University of Technology.
Among his many publications are two books, around 30 book chapters and review papers, and over 100 journal papers. He is the author of Hakea cygna, H. c. subsp. needlei and H. erecta. He also published the name Hakea rubriflora, but this has since been found to be a synonym of H. denticulata.
Lamont was made a Member of the Order of Australia (AM) in the 2010 Australia Day Honours "For service to conservation and the environment, particula |
https://en.wikipedia.org/wiki/Haplogroup%20L6 | In human mitochondrial genetics, Haplogroup L6 is a human mitochondrial DNA (mtDNA) haplogroup. It is a small African haplogroup.
Distribution
This haplogroup has been found most often in Yemen and Ethiopia.
Subclades
Tree
This phylogenetic tree of haplogroup M subclades is based on the paper by Mannis van Oven and Manfred Kayser Updated comprehensive phylogenetic tree of global human mitochondrial DNA variation and subsequent published research.
L3'4'6
L6
L6a
L6b
See also
Genealogical DNA test
Genetic genealogy
Human mitochondrial genetics
Population genetics
Human mitochondrial DNA haplogroups
References
External links
General
Ian Logan's Mitochondrial DNA Site
Mannis van Oven's Phylotree
L6 |
https://en.wikipedia.org/wiki/Thorold%20Gosset | John Herbert de Paz Thorold Gosset (16 October 1869 – December 1962) was an English lawyer and an amateur mathematician. In mathematics, he is noted for discovering and classifying the semiregular polytopes in dimensions four and higher, and for his generalization of Descartes' theorem on tangent circles to four and higher dimensions.
Biography
Thorold Gosset was born in Thames Ditton, the son of John Jackson Gosset, a civil servant and statistical officer for HM Customs, and his wife Eleanor Gosset (formerly Thorold). He was admitted to Pembroke College, Cambridge as a pensioner on 1 October 1888, graduated BA in 1891, was called to the bar of the Inner Temple in June 1895, and graduated LLM in 1896. In 1900 he married Emily Florence Wood, and they subsequently had two children, named Kathleen and John.
Mathematics
According to H. S. M. Coxeter, after obtaining his law degree in 1896 and having no clients, Gosset amused himself by attempting to classify the regular polytopes in higher-dimensional (greater than three) Euclidean space. After rediscovering all of them, he attempted to classify the "semi-regular polytopes", which he defined as polytopes having regular facets and which are vertex-uniform, as well as the analogous honeycombs, which he regarded as degenerate polytopes. In 1897 he submitted his results to James W. Glaisher, then editor of the journal Messenger of Mathematics. Glaisher was favourably impressed and passed the results on to William Burnside and Al |
https://en.wikipedia.org/wiki/Themistocles%20Zammit | Sir Themistocles "Temi" Zammit (or Żammit; 30 September 1864 – 2 November 1935) was a Maltese archaeologist and historian, professor of chemistry, medical doctor, researcher and writer. He served as Rector (1920–26) of the Royal University of Malta and first Director of the National Museum of Archaeology in his native city, Valletta.
Career
After graduating in medicine from the University of Malta, Zammit specialised in bacteriology in London and Paris. It's understood that in 1905 the discovery of contaminated milk as the vector for transmission to humans of Brucellosis melitensis present in the blood of the goat greatly contributed to the elimination from the islands of undulant fever, earning him the knighthood. However, it was Giuseppe Caruana Scicluna (1853-1921), the first Maltese analyst and bacteriologist trained at the world renowned Pasteur Institute in Paris who carried out most, if not all, of the bacteriological work.
Author of several literary works in the Maltese language, Zammit was conferred the DLitt Honoris Causa by Oxford University. He was knighted in 1930, having previously been admitted as a Companion to the Order of St Michael and St George. He also published a history of the Maltese islands and excavated important archaeological sites, such as the Hypogeum and the megalithic Tarxien Temples, Ħaġar Qim and Mnajdra, which have since been declared UNESCO World Heritage Sites.
Legacy
Zammit's scientific approach to archaeology further enhanced his |
https://en.wikipedia.org/wiki/Masayuki%20Kikuchi | Masayuki Kikuchi(菊地 正幸) (January 19, 1948 – October 18, 2003) was a Japanese seismologist. He was famous for real-time seismology.
Education and career
Bachelor of Science (1970), Master of Science (1972), and Doctor of Science (1976), in Geophysics, University of Tokyo.
Kikuchi dropped out of the Graduate School of Sciences, Tokyo University, 1973. In the same year, he took an assistant professorship at Yokohama City University. In 1976, he earned his doctorate in science. He was promoted to associate professor in 1983 and to professor in 1988.
Kikuchi returned to Tokyo University in 1996 and became the Director of the seismic prognosis information center at the Earthquake Research Institute, University of Tokyo.
Scientific contributions
(1) Computer simulation for dynamic rupture propagation. The specific fracture energy associated with large earthquakes was estimated to be much larger, by 5-6 of the order of magnitude, than that of the ordinary solid material in laboratory.
(2) Source rupture processes. Waveform inversion technique was developed in an attempt to extract the information of detailed source rupture processes. Heterogeneous fault slip distributions were determined for many large earthquakes. These are now being compiled into a fault asperity map in the world.
(3) Effect of multiple scatterings on the attenuation and dispersion of wave propagation. The numerical method to estimate the impulse response was developed and applied to laboratory data. |
https://en.wikipedia.org/wiki/Lionel%20Boulet | Lionel Boulet, (July 29, 1919 – January 1, 1996) was a Canadian engineer, academic, and utilities executive.
Born in Quebec City, Boulet received a Bachelor of Arts degree in 1938 and a Bachelor of Science degree in electrical engineering in 1942 from Université Laval. He received a Master of Science degree in 1947 from the University of Illinois. Later he received a Doctor of Science degree in 1968 from Sir George Williams University and a D.Gén. from the University of Ottawa. He was made a Fellow of the Engineering Institute of Canada in 1973 for leadership in the establishment and management of the Research Institute of Hydro-Quebec.
From 1950 to 1964, he taught at Université Laval and was chairman of the electrical engineering department. In 1964, he joined Hydro-Québec as a consultant and was appointed the first Director of the Institut de recherche d'Hydro-Québec (IREQ) in 1967, a position he occupied until 1982.
Honours
In 1975, he was made an Officer of the Order of Canada "in recognition of his contribution to the development of applied research in the field of electrical engineering and energy resources". He was posthumously made an Officer of the National Order of Quebec in June 1996. In 1993, he was the first recipient of the Prix Armand-Frappier. The Prix Lionel-Boulet is named in his honour. In 1968, he received an honorary doctorate from Sir George Williams University, which later became Concordia University. He was also awarded honorary degrees from Univer |
https://en.wikipedia.org/wiki/Kevin%20Granata | Kevin P. Granata (December 29, 1961 – April 16, 2007) was an American professor in multiple departments including the Departments of Engineering, Science and Mechanics (in which he was tenured) and Mechanical Engineering at Virginia Polytechnic Institute and State University (Virginia Tech), in Blacksburg, Virginia. Granata held an additional academic appointment as a professor in the Virginia Tech-Wake Forest School of Biomedical Engineering and was an adjunct professor at the University of Virginia in the Department of Orthopedic Surgery. During the Virginia Tech shooting, he shepherded students into his office in order to safeguard them. He was then killed by Seung-Hui Cho after he went to investigate and intervene.
Education and career
A native of Toledo, Ohio, Granata attended St. Francis de Sales High School in Toledo, where he played football and served on the debate team for four years, graduating in 1980 with a 4.0 GPA. Granata was awarded a bachelor's degree in engineering physics & electrical engineering from Ohio State University in 1984, a master's degree in physics from Purdue University in 1986, and a doctorate in biomechanics from Ohio State in 1993. He began his bachelor's degree in physics at John Carroll University in Cleveland, where he also played football, before transferring to Ohio State to finish the degree.
After earning his master's degree from Purdue, Granata worked for three years as a research scientist in the Applied Physics Lab at Johns Hopk |
https://en.wikipedia.org/wiki/Vachellia%20caven%20var.%20caven | Vachellia caven var. caven is a perennial tree native to South America.
References
External links
Aronson J. 1992. Evolutionary Biology of Acacia caven (Leguminosae, Mimosoideae): Infraspecific Variation in Fruit and Seed Characters. Annals of the Missouri Botanical Garden 79, 958-968
caven var. caven |
https://en.wikipedia.org/wiki/Tidal%20stream | A tidal stream can refer to two different phenomena:
tidal stream (marine science), currents associated with the tides
tidal stream (astrophysics), streams of stars and gas |
https://en.wikipedia.org/wiki/Fatou%27s%20theorem | In mathematics, specifically in complex analysis, Fatou's theorem, named after Pierre Fatou, is a statement concerning holomorphic functions on the unit disk and their pointwise extension to the boundary of the disk.
Motivation and statement of theorem
If we have a holomorphic function defined on the open unit disk , it is reasonable to ask under what conditions we can extend this function to the boundary of the unit disk. To do this, we can look at what the function looks like on each circle inside the disk centered at 0, each with some radius . This defines a new function:
where
is the unit circle. Then it would be expected that the values of the extension of onto the circle should be the limit of these functions, and so the question reduces to determining when converges, and in what sense, as , and how well defined is this limit. In particular, if the norms of these are well behaved, we have an answer:
Theorem. Let be a holomorphic function such that
where are defined as above. Then converges to some function pointwise almost everywhere and in norm. That is,
Now, notice that this pointwise limit is a radial limit. That is, the limit being taken is along a straight line from the center of the disk to the boundary of the circle, and the statement above hence says that
The natural question is, with this boundary function defined, will we converge pointwise to this function by taking a limit in any other way? That is, suppose instead of following a strai |
https://en.wikipedia.org/wiki/Trace%20monoid | In computer science, a trace is a set of strings, wherein certain letters in the string are allowed to commute, but others are not. It generalizes the concept of a string, by not forcing the letters to always be in a fixed order, but allowing certain reshufflings to take place. Traces were introduced by Pierre Cartier and Dominique Foata in 1969 to give a combinatorial proof of MacMahon's master theorem. Traces are used in theories of concurrent computation, where commuting letters stand for portions of a job that can execute independently of one another, while non-commuting letters stand for locks, synchronization points or thread joins.
The trace monoid or free partially commutative monoid is a monoid of traces. In a nutshell, it is constructed as follows: sets of commuting letters are given by an independency relation. These induce an equivalence relation of equivalent strings; the elements of the equivalence classes are the traces. The equivalence relation then partitions up the free monoid (the set of all strings of finite length) into a set of equivalence classes; the result is still a monoid; it is a quotient monoid and is called the trace monoid. The trace monoid is universal, in that all dependency-homomorphic (see below) monoids are in fact isomorphic.
Trace monoids are commonly used to model concurrent computation, forming the foundation for process calculi. They are the object of study in trace theory. The utility of trace monoids comes from the fact that they |
https://en.wikipedia.org/wiki/Dependency%20relation | In computer science, in particular in concurrency theory, a dependency relation is a binary relation on a finite domain , symmetric, and reflexive; i.e. a finite tolerance relation. That is, it is a finite set of ordered pairs , such that
If then (symmetric)
If , then (reflexive)
In general, dependency relations are not transitive; thus, they generalize the notion of an equivalence relation by discarding transitivity.
is also called the alphabet on which is defined. The independency induced by is the binary relation
That is, the independency is the set of all ordered pairs that are not in . The independency relation is symmetric and irreflexive. Conversely, given any symmetric and irreflexive relation on a finite alphabet, the relation
is a dependency relation.
The pair is called the concurrent alphabet. The pair is called the independency alphabet or reliance alphabet, but this term may also refer to the triple (with induced by ). Elements are called dependent if holds, and independent, else (i.e. if holds).
Given a reliance alphabet , a symmetric and irreflexive relation can be defined on the free monoid of all possible strings of finite length by: for all strings and all independent symbols . The equivalence closure of is denoted or and called -equivalence. Informally, holds if the string can be transformed into by a finite sequence of swaps of adjacent independent symbols. The equivalence classes of are called traces, and are studied |
https://en.wikipedia.org/wiki/Ethnoherpetology | Ethnoherpetology is the study of the past and present interrelationships between human cultures and reptiles and amphibians. It is a sub-field of ethnozoology, which in turn is a sub-field of ethnobiology.
Snakes and amphibians have been considered chthonic creatures in many cultures. Richly represented in mythology, culture, art, and literature, they often evoke revulsion, fear, suspicion and awe, sometimes even hysteria. Frogs and toads were believed to announce the rains with their choruses.
See also
Colorado River toad
Frogs in culture
Herpetology
Legendary salamander in popular culture
Nāga
Serpent (symbolism)
Bibliography
Bulmer, Ralph N.H. and Michael Tyler. 1968. Karam classification of frogs. Journal of the Polynesian Society 77(4): 621–639.
Indraneil Das – The Serpent's Tongue: A contribution to the ethnoherpetology of India and adjacent countries (Frankfurt am Main: Edition Chimaira, 1998)
Walsh, M.T. – Snakes and Other Reptiles in Mtanga: preliminary notes on ethnoherpetology in a village bordering Gombe Stream National Park, western Tanzania. (1997)
Bertrand, H. – Contribution à l'étude de l'herpétologie et de l'ethnoherpétologie en Anjou (A study on the herpetology and ethnoherpetology of Anjou province)
Lee, J. C. – Ethnoherpetology in the Yucatán Peninsula. In Amphibians and Reptiles of the Yucatán Peninsula, by J. C. Lee. Ithaca, NY: Cornell University Press, 1996.
An example of indigenous ethnoherpetological knowledge – notes written by a Buk |
https://en.wikipedia.org/wiki/Lyman%20Page | Lyman Alexander Page, Jr. (born September 24, 1957) is the James S. McDonnell Distinguished University Professor of Physics at Princeton University. He is an expert in observational cosmology and one of the original co-investigators for the Wilkinson Microwave Anisotropy Probe (WMAP) project that made precise observations of the electromagnetic radiation from the Big Bang, known as cosmic background radiation.
Early life and education
Page was born in San Francisco in 1957, and moved through Virginia and New Hampshire with his parents, eventually settling in Maine. His father was a pediatrician and his mother an artist. He has a younger brother and sister. He became interested in physics at Bowdoin College, Brunswick, Maine, where he did his undergraduate studies, after a course taught by Elroy O. LaCasce. He worked on the Mach’s principle for a course project and was drawn to cosmology. Page graduated with a BA in Physics in 1978.
Page then became a research technician for 15 months at the Bartol Research Foundation (now Bartol Research Institute), being stationed at the McMurdo Station in the Antarctica and operating a cosmic ray station. Returning to the United States, he bought and rebuilt a sailboat, and started sailing around the East Coast and the Caribbean for 2.5 years. He intermittently worked onshore in carpentry, rigging and other kinds of boat service, until he survived a storm near Venezuela, after which he decided to pursue graduate studies. Rainer Weiss fro |
https://en.wikipedia.org/wiki/Estrin | Estrin is a surname. Notable people with the surname include:
Allen Estrin (born 1954), American screenwriter and co-founder of PragerU
Dan Estrin (born 1976), guitarist for Hoobastank
Deborah Estrin, Professor of Computer Science, University of California Los Angeles
Gerald Estrin (1921-2012), Professor Emeritus of Computer Science, University of California Los Angeles
Judith Estrin, American business executive
Marc Estrin (born 1939) American writer and political activist
Morton Estrin (born 1923), American pianist
Robert Estrin (born 1942), American film editor
Thelma Estrin (1924-2014), American computer scientist and biomedical engineer
Yakov Estrin (1923–1987), Russian chess player
It may also refer to:
Estrin, a parent structure of the estrogen steroid hormones |
https://en.wikipedia.org/wiki/Plant%20and%20Soil | Plant and Soil is a monthly peer-reviewed scientific journal covering research on the relationships between plants and soil, such as relationships and interactions of plants with minerals, water and microbes, the anatomy and morphology of roots, soil biology and ecology, etc. It is published by Springer Science+Business Media on behalf of the Royal Netherlands Society of Agricultural Science (Koninklijke Landbouwkundige Vereniging).
The editor-in-chief is Hans Lambers (The University of Western Australia and China Agricultural University). According to the Journal Citation Reports, the journal has a 2020 impact factor of 4.192. The journal is indexed in Scopus and SCImago.
References
External links
Koninklijke Landbouwkundige Vereniging
Agricultural journals
Soil science journals
English-language journals
Academic journals established in 1948
Monthly journals
Springer Science+Business Media academic journals |
https://en.wikipedia.org/wiki/University%20of%20the%20Philippines%20Visayas | The University of the Philippines Visayas (UPV or UP Visayas) is a public research university in the Philippines with campuses and facilities throughout the Visayas. A constituent university of the University of the Philippines system, it teaches management, accountancy, marketing, economics, chemistry, applied mathematics and physics, marine science education and research, fisheries, and aquaculture. It offers regional studies programs on the preservation and enrichment of the Visayan cultural heritage.
UP Visayas has two campuses—Miagao and Iloilo City — with Miagao being the main campus where the central administration offices are located.
Most of the students of the university are drawn from the Visayas and the Visayan linguistic groups. Many of the leaders of the Visayas graduated from UPV or its predecessor institutions. As of 2007, the Commission on Higher Education of the Philippines awarded four National Centers of Excellence and Development to UPV including Fisheries (UPV-Miagao), Marine Science (UPV-Miagao), and Biology (UPV-Miagao).
The University of the Philippines College of Law (U.P. Diliman) has opened a law academic extension program in U.P. Visayas - Iloilo City Campus.
History
UPV was created by merging four UP colleges: UP College of Fisheries founded in 1944; UP Cebu founded in 1918, UP Iloilo founded in 1947, and UP Tacloban founded in 1973. When the Miagao campus was established, many of the academic programs offered in the Iloilo City campus were |
https://en.wikipedia.org/wiki/Lazy%20learning | In machine learning, lazy learning is a learning method in which generalization of the training data is, in theory, delayed until a query is made to the system, as opposed to eager learning, where the system tries to generalize the training data before receiving queries.
The primary motivation for employing lazy learning, as in the K-nearest neighbors algorithm, used by online recommendation systems ("people who viewed/purchased/listened to this movie/item/tune also ...") is that the data set is continuously updated with new entries (e.g., new items for sale at Amazon, new movies to view at Netflix, new clips at YouTube, new music at Spotify or Pandora). Because of the continuous update, the "training data" would be rendered obsolete in a relatively short time especially in areas like books and movies, where new best-sellers or hit movies/music are published/released continuously. Therefore, one cannot really talk of a "training phase".
Lazy classifiers are most useful for large, continuously changing datasets with few attributes that are commonly queried. Specifically, even if a large set of attributes exist - for example, books have a year of publication, author/s, publisher, title, edition, ISBN, selling price, etc. - recommendation queries rely on far fewer attributes - e.g., purchase or viewing co-occurrence data, and user ratings of items purchased/viewed.
Advantages
The main advantage gained in employing a lazy learning method is that the target function will be ap |
https://en.wikipedia.org/wiki/Offline%20learning | In machine learning, systems which employ offline learning do not change their approximation of the target function when the initial training phase has been completed. These systems are also typically examples of eager learning.
While in online learning, only the set of possible elements is known, in offline learning, the identity of the elements as well as the order in which they are presented is known to the learner.
Applications for robotics control
The ability of robots to learn is equal to create a table (information) which is filled with values. One option for doing so is programming by demonstration. Here, the table is filled with values by a human teacher. The demonstration is provided either as direct numerical control policy which is equal to a trajectory, or as an indirect objective function which is given in advance.
Offline learning is working in batch mode. In step 1 the task is demonstrated and stored in the table, and in step 2 the task is reproduced by the robot. The pipeline is slow and inefficient because a delay is there between behavior demonstration and skill replay.
A short example will help to understand the idea. Suppose the robot should learn a wall following task and the internal table of the robot is empty. Before the robot gets activated in the replay mode, the human demonstrator has to teach the behavior. He is controlling the robot with teleoperation and during the learning step the skill table is generated. The process is called offline, be |
https://en.wikipedia.org/wiki/Gutfreund | Gutfreund () is a surname of German origin. Notable people with the surname include:
Amir Gutfreund (1963-2015), Israeli writer
Hanoch Gutfreund, Israeli Andre Aisenstadt Chair in theoretical physics, and former President, of the Hebrew University of Jerusalem
Herbert Gutfreund (1921–2021), British biochemist
John Gutfreund (1929–2016), American businessman
Otto Gutfreund (1889–1927), Czech sculptor
Yossef Gutfreund (1932–1972), Israeli wrestling coach and referee who was killed in the Munich massacre at the 1972 Olympic Games
Andre R. Guttfreund (born 1946), Salvadoran film director and producer
See also
Goodfriend
German-language surnames
Surnames of Jewish origin
Yiddish-language surnames |
https://en.wikipedia.org/wiki/Abel%E2%80%93Jacobi%20map | In mathematics, the Abel–Jacobi map is a construction of algebraic geometry which relates an algebraic curve to its Jacobian variety. In Riemannian geometry, it is a more general construction mapping a manifold to its Jacobi torus.
The name derives from the theorem of Abel and Jacobi that two effective divisors are linearly equivalent if and only if they are indistinguishable under the Abel–Jacobi map.
Construction of the map
In complex algebraic geometry, the Jacobian of a curve C is constructed using path integration. Namely, suppose C has genus g, which means topologically that
Geometrically, this homology group consists of (homology classes of) cycles in C, or in other words, closed loops. Therefore, we can choose 2g loops generating it. On the other hand, another more algebro-geometric way of saying that the genus of C is g is that
where K is the canonical bundle on C.
By definition, this is the space of globally defined holomorphic differential forms on C, so we can choose g linearly independent forms . Given forms and closed loops we can integrate, and we define 2g vectors
It follows from the Riemann bilinear relations that the generate a nondegenerate lattice (that is, they are a real basis for ), and the Jacobian is defined by
The Abel–Jacobi map is then defined as follows. We pick some base point and, nearly mimicking the definition of define the map
Although this is seemingly dependent on a path from to any two such paths define a closed lo |
https://en.wikipedia.org/wiki/Nicholas%20J.%20Higham | Nicholas J. Higham may refer to:
Nicholas Higham (Nicholas John Higham), professor of mathematics at the University of Manchester (UK)
N. J. Higham (Nicholas John 'Nick' Higham), professor emeritus of history at the University of Manchester (UK) |
https://en.wikipedia.org/wiki/American%20Rocketry%20Challenge | The American Rocketry Challenge is an annual American model rocketry competition for students in grades six to 12 sponsored by the Aerospace Industries Association and the National Association of Rocketry. Co-sponsors include NASA, United States Department of Defense, the American Association of Physics Teachers and the Civil Air Patrol. Previously known as the "Team America Rocketry Challenge," the name was changed following the 2019 event.
The event receives local and national media coverage and usually draws well-known representatives of the Defense Department, NASA, the FAA, and other government agencies. Past National Fly-Offs have been attended by United States Secretary of Defense Robert Gates, Apollo 11 astronaut Buzz Aldrin, Rocket Boys author Homer Hickam, former NASA Administrator Sean O'Keefe, U.S. Senator Mike Enzi, and former NASA Administrator, Charles Bolden.
The 2010, 2011, 2013, 2015, and 2016 International Fly-Offs were won by the American winners of TARC.
History
The competition began in 2002 celebration of 100th anniversary of the flight, but due to a high level of interest became an annual occurrence. ARC fosters interest in aerospace engineering careers among its participants, and the National Fly-Off in May is an opportunity for corporations, universities, and the armed services to attract students. The program rebranded in 2019 to the American Rocketry Challenge.
Requirements
The requirements for each year's challenge are announced during the s |
https://en.wikipedia.org/wiki/GADGET | GADGET is free software for cosmological N-body/SPH simulations written by Volker Springel at the Max Planck Institute for Astrophysics. The name is an acronym of "GAlaxies with Dark matter and Gas intEracT". It is released under the GNU GPL. It can be used to study for example galaxy formation and dark matter.
Description
GADGET computes gravitational forces with a hierarchical tree algorithm (optionally in combination with a particle-mesh scheme for long-range gravitational forces) and represents fluids by means of smoothed-particle hydrodynamics (SPH). The code can be used for studies of isolated systems, or for simulations that include the cosmological expansion of space, both with or without periodic boundary conditions. In all these types of simulations, GADGET follows the evolution of a self-gravitating collisionless N-body system, and allows gas dynamics to be optionally included. Both the force computation and the time stepping of GADGET are fully adaptive, with a dynamic range which is, in principle, unlimited.
GADGET can therefore be used to address a wide array of astrophysically interesting problems, ranging from colliding and merging galaxies, to the formation of large-scale structure in the universe. With the inclusion of additional physical processes such as radiative cooling and heating, GADGET can also be used to study the dynamics of the gaseous intergalactic medium, or to address star formation and its regulation by feedback processes.
History
The first |
https://en.wikipedia.org/wiki/Lars%20Hernquist | Lars Hernquist (14 December 1954) is a theoretical astrophysicist and Mallinckrodt Professor of Astrophysics at the Center for Astrophysics Harvard & Smithsonian. He is best known for his research on dynamical processes in cosmology and galaxy formation/galaxy evolution.
Career and research
Hernquist's research involves the dynamics of galaxies and the effect of a merger driven model for galaxy evolution. He is a world expert in simulating mergers of galaxies to demonstrate the expected appearance and morphology of the resulting body. He defined the "Hernquist Profile", which is an analytic expression for the distribution of dark matter in galaxies. Hernquist's research is largely computational with one of the world's largest supercomputers accessible for his research.
Awards
Hernquist was awarded the 2020 Gruber Prize in Cosmology jointly with Volker Springel, who together have made computer simulations "an indispensable tool for cosmologists, allowing them to test theories and locate fertile areas for further research."
References
Year of birth missing (living people)
Living people
American astronomers
Harvard University faculty
Members of the United States National Academy of Sciences
Lawrenceville School alumni
External links
Stellar scattering and the formation of exponential discs in self-gravitating systems Wu et al. Formula (1) is the Hernquist profile (for dark matter halo) |
https://en.wikipedia.org/wiki/Reeb%20vector%20field | In mathematics, the Reeb vector field, named after the French mathematician Georges Reeb, is a notion that appears in various domains of contact geometry including:
in a contact manifold, given a contact 1-form , the Reeb vector field satisfies ,
in particular, in the context of Sasakian manifold#The Reeb vector field.
References
Contact geometry |
https://en.wikipedia.org/wiki/Chauncey%20Starr | Chauncey Starr (April 14, 1912 – April 17, 2007) was an American electrical engineer and an expert in nuclear energy.
Born in Newark, New Jersey, Starr received an electrical engineering degree in 1932 and a Ph.D. in physics in 1935 from Rensselaer Polytechnic Institute.
Starr was vice president of Rockwell International and president of its Atomics International Division. In 1967 he became the dean of the UCLA School of Engineering and Applied Science. Six years later he founded the Electric Power Research Institute (EPRI) and was its first president. He was the first president emeritus of EPRI.
Starr was a member of the board of directors at the George C. Marshall Institute, a member of the board of science advisors of the Science and Environmental Policy Project (SEPP) and, like most other members of that board, he signed the Leipzig Declaration on Global Climate Change.
Starr died at his home in Atherton, California, from natural causes. The day before his death he celebrated his 95th birthday at an EPRI ceremony.
Starr was elected to the National Academy of Engineering in 1965. He received in 1979 the Walter H. Zinn Award from the American Nuclear Society, and in 1990 he was awarded the National Medal of Technology by then President George H. W. Bush. He was a recipient of the Harold Pender Award in 1975.
Selected publications
Starr, C. (1969), "Social benefit versus technological risk", Science 165 (3899), pp. 1232-1238
References
External links
Chauncey Starr |
https://en.wikipedia.org/wiki/E%C3%B6tv%C3%B6s%20experiment | The Eötvös experiment was a famous physics experiment that measured the correlation between inertial mass and gravitational mass, demonstrating that the two were one and the same, something that had long been suspected but never demonstrated with the same accuracy. The earliest experiments were done by Isaac Newton (1642–1727) and improved upon by Friedrich Wilhelm Bessel (1784–1846). A much more accurate experiment using a torsion balance was carried out by Loránd Eötvös starting around 1885, with further improvements in a lengthy run between 1906 and 1909. Eötvös's team followed this with a series of similar but more accurate experiments, as well as experiments with different types of materials and in different locations around the Earth, all of which demonstrated the same equivalence in mass. In turn, these experiments led to the modern understanding of the equivalence principle encoded in general relativity, which states that the gravitational and inertial masses are the same.
It is sufficient for the inertial mass to be proportional to the gravitational mass. Any multiplicative constant will be absorbed in the definition of the unit of force.
Eötvös's original experiment
Eötvös's original experimental device consisted of two masses on opposite ends of a rod, hung from a thin fiber. A mirror attached to the rod, or fiber, reflected light into a small telescope. Even tiny changes in the rotation of the rod would cause the light beam to be deflected, which would in turn |
https://en.wikipedia.org/wiki/Stanford%20Joint%20Program%20in%20Design | The Joint Program in Design (officially Stanford Graduate Program in Product Design, colloquially Stanford Design Program) was a graduate program jointly offered by the Mechanical Engineering Department and the Art Department at Stanford University. It was discontinued with the last cohort of students graduating in Spring 2017 and is succeeded by the Stanford Design Impact Engineering Master's Degree. The program offered degrees in Mechanical Engineering and in Fine Arts/Design and was closely connected with the Stanford d.school (The d.school is not one of the seven schools at Stanford and does not grant degrees).
The program was founded in 1958, and had three full-time faculty. It maintained close links with the design and technology firms of nearby Silicon Valley.
History
Stanford's Design program dates from 1958 when Professor John E. Arnold, formerly of the Massachusetts Institute of Technology, first proposed the idea that design engineering should be human-centered. This was a radical concept in the era of Sputnik and the early Cold War. Building on Arnold's work, Bob McKim (Emeritus, Engineering) along with Matt Kahn (Art), created the Product Design major and the graduate-level Joint Program in Design. This curriculum was formalized in the mid-1960s, making the Joint Program in Design (JPD) one of the first inter-departmental programs at Stanford or other nationally prominent Universities. The key texts in those days were McKim's recently published Experiences in |
https://en.wikipedia.org/wiki/Do%20It%20Yourself%20%28disambiguation%29 | Do It Yourself may refer to:
Do it yourself (DIY), a term used by various communities that focus on people creating things for themselves without the aid of paid professionals
Do-it-yourself biology
Do-it-yourself investing
DIY Network, a television channel that focuses on do it yourself projects at home
DIY ethic
Do It Yourself (Ian Dury & the Blockheads album), a 1979 album
Do It Yourself (The Seahorses album), a 1997 album
"Do It Yourself" (song), 2007 single by Uniting Nations
"Do It Yourself" CBC TV Series (1982-1985) |
https://en.wikipedia.org/wiki/Homometric%20structures | In chemistry and crystallography, crystal structures that have the same set of interatomic distances are called homometric structures. Homometric structures need not be congruent (that is, related by a rigid motion or reflection). Homometric crystal structures produce identical diffraction patterns; therefore, they cannot be distinguished by a diffraction experiment.
Recently, a Monte Carlo algorithm was proposed to calculate the number of homometric structures corresponding to any given set of interatomic distances.
See also
Patterson function
Arthur Lindo Patterson
References
Stereochemistry |
https://en.wikipedia.org/wiki/Semiautomaton | In mathematics and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function.
Associated with any semiautomaton is a monoid called the characteristic monoid, input monoid, transition monoid or transition system of the semiautomaton, which acts on the set of states Q. This may be viewed either as an action of the free monoid of strings in the input alphabet Σ, or as the induced transformation semigroup of Q.
In older books like Clifford and Preston (1967) semigroup actions are called "operands".
In category theory, semiautomata essentially are functors.
Transformation semigroups and monoid acts
A transformation semigroup or transformation monoid is a pair consisting of a set Q (often called the "set of states") and a semigroup or monoid M of functions, or "transformations", mapping Q to itself. They are functions in the sense that every element m of M is a map . If s and t are two functions of the transformation semigroup, their semigroup product is defined as their function composition .
Some authors regard "semigroup" and "monoid" as synonyms. Here a semigroup need not have an identity element; a monoid is a semigroup with an identity element (also called "unit"). Since the notion of functions acting on a set always includes the notion of an identity function, which when applied to the s |
https://en.wikipedia.org/wiki/Yoel%20Lavi | Yoel Lavi () (born 8 February 1950) is an Israeli politician who was the mayor of Ramla in Israel.
Lavi was a member of Kadima, he was 114th on the party's list for the 2009 Knesset elections. He holds a B.Sc. degree in History from the Tel Aviv University and an M.A degree in Mathematics and Social Sciences, from the University of Haifa.
External links
1950 births
Living people
Jewish Israeli politicians
Kadima politicians
Mayors of places in Israel
People from Ramla
Tel Aviv University alumni
University of Haifa alumni |
https://en.wikipedia.org/wiki/Transition%20system | In theoretical computer science, a transition system is a concept used in the study of computation. It is used to describe the potential behavior of discrete systems. It consists of states and transitions between states, which may be labeled with labels chosen from a set; the same label may appear on more than one transition. If the label set is a singleton, the system is essentially unlabeled, and a simpler definition that omits the labels is possible.
Transition systems coincide mathematically with abstract rewriting systems (as explained further in this article) and directed graphs. They differ from finite-state automata in several ways:
The set of states is not necessarily finite, or even countable.
The set of transitions is not necessarily finite, or even countable.
No "start" state or "final" states are given.
Transition systems can be represented as directed graphs.
Formal definition
Formally, a transition system is a pair where is a set of states and , the transition relation, is a subset of . We say that there is a transition from state to state iff , and denote it .
A labelled transition system is a tuple where is a set of states, is a set of labels, and , the labelled transition relation, is a subset of . We say that there is a transition from state to state with label iff and denote it
Labels can represent different things depending on the language of interest. Typical uses of labels include representing input expected, conditions that m |
https://en.wikipedia.org/wiki/Mike%20Kaiser | Michael Hans Kaiser (born 20 April 1963 in Brisbane) is a former Australian politician with degrees in Electrical Engineering and Economics from the University of Queensland. He was a Labor Party member of the Legislative Assembly of Queensland from 2000 to 2001, representing the electorate of Woodridge. A former state secretary of the Queensland division of the Labor Party, he resigned as an MP after an inquiry found that he was used in a 1986 Labor Party branch stacking exercise. Editorializing on his resignation, The Brisbane Courier Mail wrote: "It was a penalty this newspaper has stated was disproportionate to the offence he committed." 19 August 2003.
After conducting his own Government Affairs consultancy, he was rehabilitated by the Australian Labor Party in 2003 and served as its Assistant National Secretary in the lead up to and during the 2004 federal election.
He was subsequently employed as the Chief of Staff to New South Wales Premier Morris Iemma before becoming Chief of Staff to Queensland Premier Anna Bligh in late 2007.
In December 2009, Kaiser commenced employment with NBN Co, the Company established by the Rudd Government to design, build and operate a National Broadband Network, as its Corporate Affairs Executive. In September 2011 he became NBN Co's Head of Quality, responsible for customer/ consumer satisfaction, process improvement, data quality and response management.
In January 2022 Kaiser commenced as the Director-General of the Queensland Depa |
https://en.wikipedia.org/wiki/Michael%20R.%20Angus | Sir Michael Richardson Angus (5 May 1930 – 13 March 2010) was a British businessman, best known as chair of Unilever.
Biography
Angus was born in West Ashford, Kent and raised in the Cotswolds near to Cirencester, and educated at Marling School, Stroud, Gloucestershire. Angus graduated in mathematics from Bristol University.
Career
Joining Anglo-Dutch conglomerate Unilever straight from university, he spent most of his career in the company's toiletries businesses (soaps and toothpaste) in France and Britain. In 1979 he moved to Lever Brothers in New York City, where he spent four years cleaning house at the Lever Brothers subsidiary. He returned to UK as the joint-chairman alongside Floris Maljers.
Other positions
Angus was President of the Confederation of British Industry from 7 May 1992 to May 1994. Sir Michael's other appointments include: –
Chairman of Whitbread Plc
non-executive directors and Deputy chairman British Airways Plc
non-executive director and chairman Boots Group
non-executive director National Westminster Bank
Chairman of Ashridge Business School
Member of the Council of British Executive Service Overseas
Chairman of the Trustees of The Leverhulme Trust
Director of the Ditchley Foundation
International Counsellor Emeritus of the Conference Board in New York
non-executive director for the Halcrow Group Limited.
Chairman of the Royal Agricultural College, Cirencester until 2005.
Angus was appointed a Deputy Lieutenant of Gloucestershire in 1997.
The G |
https://en.wikipedia.org/wiki/EPSI | The École privée des sciences informatiques (EPSI) is a French private school specialized in information technology. EPSI was founded by professionals. The first school was based in Paris. Later on, with the rise of the computer science industry, the school built branches in Bordeaux, Montpellier, Arras then in October 2002 in Nantes and then later in Lyon.
Information about the Administration
Director : Laurent ESPINE
Date of Creation : September 1961
Status : IT Private School
State recognition : The diploma is recognised by the French state : (Journal officiel du 9 septembre 1998)
Applying to EPSI
Profile examination
Meeting
Written tests (psychotechnical)
Level needed to Apply
Baccalauréat level to apply for the BTS (equivalent to HND) degree
The French baccalaureate or equivalent diploma is needed to apply for the BTS.
A Bac + 2 (2-year undergraduate degree) is required for the Bachelor (1-year program).
A Bac + 3 (3-year undergraduate degree) is required for the Engineering degree (2-year program).
Academic Curriculum
Number of years of study
2 years for the BTS
1 year for the Bachelor
2 years for the engineering degree (CSII)
Approved diplomas by French State :
BTS Services Informatiques aux Organisations Solutions logicielles et applications métier
BTS Services Informatiques aux Organisations Solutions d’infrastructure, systèmes et réseaux
Titre RNCP Niveau II Administrateur Système Réseaux et Bases de Données (Bachelor)
Titre RNCP Niveau II Concept |
https://en.wikipedia.org/wiki/Real%20structure | In mathematics, a real structure on a complex vector space is a way to decompose the complex vector space in the direct sum of two real vector spaces. The prototype of such a structure is the field of complex numbers itself, considered as a complex vector space over itself and with the conjugation map , with , giving the "canonical" real structure on , that is .
The conjugation map is antilinear: and .
Vector space
A real structure on a complex vector space V is an antilinear involution . A real structure defines a real subspace , its fixed locus, and the natural map
is an isomorphism. Conversely any vector space that is the complexification
of a real vector space has a natural real structure.
One first notes that every complex space V has a realification obtained by taking the same vectors as in the original set and restricting the scalars to be real. If and then the vectors and are linearly independent in the realification of V. Hence:
Naturally, one would wish to represent V as the direct sum of two real vector spaces, the "real and imaginary parts of V". There is no canonical way of doing this: such a splitting is an additional real structure in V. It may be introduced as follows. Let be an antilinear map such that , that is an antilinear involution of the complex space V.
Any vector can be written ,
where and .
Therefore, one gets a direct sum of vector spaces where:
and .
Both sets and are real vector spaces. The linear map , where , is an isomor |
https://en.wikipedia.org/wiki/Conservation%20Biology%20%28journal%29 | Conservation Biology is a bimonthly peer-reviewed scientific journal of the Society for Conservation Biology, published by Wiley-Blackwell and established in May 1987. It covers the science and practice of conserving Earth's biological diversity, including issues concerning any of the Earth's ecosystems or regions. The editor-in-chief is Mark Burgman.
Scope
The scientific papers in the journal cover a variety of topics, such as population ecology and genetics, climate change, freshwater and marine conservation, ecosystem management, citizen science, and other human dimensions of conservation, but all topics focus primarily on conservation relevance rather than specific ecosystems, species, or situations. Subscription to the journal is only open to members of Society for Conservation Biology.
Journal Metrics
According to the Journal Citation Reports, the journal has a 2019 impact factor of 5.405. It ranks 3rd among 55 in journals that focus on biodiversity and conservation, 12th among 158 in journals with an ecological focus. Conservation Biology also has an h5 index of 59, a cited half-life of >10, and a CiteScore of 5.97.
References
External links
Ecology journals
Conservation biology
English-language journals
Academic journals established in 1987
Wiley-Blackwell academic journals
Bimonthly journals
Academic journals associated with learned and professional societies |
https://en.wikipedia.org/wiki/Weitzenb%C3%B6ck%27s%20inequality | In mathematics, Weitzenböck's inequality, named after Roland Weitzenböck, states that for a triangle of side lengths , , , and area , the following inequality holds:
Equality occurs if and only if the triangle is equilateral. Pedoe's inequality is a generalization of Weitzenböck's inequality. The Hadwiger–Finsler inequality is a strengthened version of Weitzenböck's inequality.
Geometric interpretation and proof
Rewriting the inequality above allows for a more concrete geometric interpretation, which in turn provides an immediate proof.
Now the summands on the left side are the areas of equilateral triangles erected over the sides of the original triangle and hence the inequation states that the sum of areas of the equilateral triangles is always greater than or equal to threefold the area of the original triangle.
This can now can be shown by replicating area of the triangle three times within the equilateral triangles. To achieve that the Fermat point is used to partition the triangle into three obtuse subtriangles with a angle and each of those subtriangles is replicated three times within the equilateral triangle next to it. This only works if every angle of the triangle is smaller than , since otherwise the Fermat point is not located in the interior of the triangle and becomes a vertex instead. However if one angle is greater or equal to it is possible to replicate the whole triangle three times within the largest equilateral triangle, so the sum of area |
https://en.wikipedia.org/wiki/Mathematical%20maturity | In mathematics, mathematical maturity is an informal term often used to refer to the quality of having a general understanding and mastery of the way mathematicians operate and communicate. It pertains to a mixture of mathematical experience and insight that cannot be directly taught. Instead, it comes from repeated exposure to mathematical concepts. It is a gauge of mathematics students' erudition in mathematical structures and methods, and can overlap with other related concepts such as mathematical intuition and mathematical competence. The topic is occasionally also addressed in literature in its own right.
Definitions
Mathematical maturity has been defined in several different ways by various authors, and is often tied to other related concepts such as comfort and competence with mathematics, mathematical intuition and mathematical beliefs.
One definition has been given as follows:
A broader list of characteristics of mathematical maturity has been given as follows:
Finally, mathematical maturity has also been defined as an ability to do the following:
It is sometimes said that the development of mathematical maturity requires a deep reflection on the subject matter for a prolonged period of time, along with a guiding spirit which encourages exploration.
Progression
Mathematician Terence Tao has proposed a three-stage model of mathematics education that can be interpreted as a general framework of mathematical maturity progression. The stages are summarized in t |
https://en.wikipedia.org/wiki/Maurice%20Solovine | Maurice Solovine (21 May 1875 – 13 February 1958) was a Romanian philosopher and mathematician. He is best known for his association with Albert Einstein.
Biography
Solovine was born in Iași, a university city in eastern Romania, near the border with Moldova. As a young student of philosophy in Bern, Solovine applied to study physics with Albert Einstein in response to an advertisement. The two men struck up a close relationship and Einstein was said to say to Solovine a few days after meeting him: "It is not necessary to give you lessons in physics. The discussion about the problems which we face in physics today is much more interesting; simply come to me when you wish. I am pleased to be able to talk to you."
One day Solovine suggested reading and debating the works of great authors. Einstein agreed enthusiastically and soon mathematician Conrad Habicht (1876–1958) became involved in what was to be known as the "Akademie Olympia" (Olympia Academy). Often their meetings, held in Einstein's flat, would last until the early morning hours.
On one occasion Solovine missed a scheduled meeting in his flat, preferring to listen to a concert in the city. He had prepared a meal for his friends with a note: "Amicis carissimis ova dura et salutem." (To the beloved friends, hard-boiled eggs and greetings). However Einstein and Habicht turned his flat upside down after they had eaten the meal. Every piece of furniture was moved and plates, cups, forks, knives and books were scattere |
https://en.wikipedia.org/wiki/Grading%20%28earthworks%29 | Grading in civil engineering and landscape architectural construction is the work of ensuring a level base, or one with a specified slope, for a construction work such as a foundation, the base course for a road or a railway, or landscape and garden improvements, or surface drainage. The earthworks created for such a purpose are often called the sub-grade or finished contouring (see diagram).
Regrading
Regrading is the process of grading for raising and/or lowering the levels of land. Such a project can also be referred to as a regrade.
Regrading may be done on a small scale (as in preparation of a house site) or on quite a large scale (as in major reconfiguration of the terrain of a city, such as the Denny Regrade in Seattle).
Regrading is typically performed to make land more level (flatter), in which case it is sometimes called levelling.) Levelling can have the consequence of making other nearby slopes steeper, and potentially unstable or prone to erosion.
Transportation
In the case of gravel roads and earthworks for certain purposes, grading forms not just the base but the cover and surface of the finished construction, and is often called finished grade.
Process
It is often done using heavy machinery like bulldozers and excavators to roughly prepare an area and then using a grader for a finer finish.
Environmental design
In the environmental design professions, grading and regrading are a specifications and construction component in landscape design, landscap |
https://en.wikipedia.org/wiki/Convex%20metric%20space | In mathematics, convex metric spaces are, intuitively, metric spaces with the property any "segment" joining two points in that space has other points in it besides the endpoints.
Formally, consider a metric space (X, d) and let x and y be two points in X. A point z in X is said to be between x and y if all three points are distinct, and
that is, the triangle inequality becomes an equality. A convex metric space is a metric space (X, d) such that, for any two distinct points x and y in X, there exists a third point z in X lying between x and y.
Metric convexity:
does not imply convexity in the usual sense for subsets of Euclidean space (see the example of the rational numbers)
nor does it imply path-connectedness (see the example of the rational numbers)
nor does it imply geodesic convexity for Riemannian manifolds (consider, for example, the Euclidean plane with a closed disc removed).
Examples
Euclidean spaces, that is, the usual three-dimensional space and its analogues for other dimensions, are convex metric spaces. Given any two distinct points and in such a space, the set of all points satisfying the above "triangle equality" forms the line segment between and which always has other points except and in fact, it has a continuum of points.
Any convex set in a Euclidean space is a convex metric space with the induced Euclidean norm. For closed sets the converse is also true: if a closed subset of a Euclidean space together with the induced distance |
https://en.wikipedia.org/wiki/Residue%20field | In mathematics, the residue field is a basic construction in commutative algebra. If R is a commutative ring and m is a maximal ideal, then the residue field is the quotient ring k = R/m, which is a field. Frequently, R is a local ring and m is then its unique maximal ideal.
This construction is applied in algebraic geometry, where to every point x of a scheme X one associates its residue field k(x). One can say a little loosely that the residue field of a point of an abstract algebraic variety is the 'natural domain' for the coordinates of the point.
Definition
Suppose that R is a commutative local ring, with maximal ideal m. Then the residue field is the quotient ring R/m.
Now suppose that X is a scheme and x is a point of X. By the definition of scheme, we may find an affine neighbourhood U = Spec(A), with A some commutative ring. Considered in the neighbourhood U, the point x corresponds to a prime ideal p ⊆ A (see Zariski topology). The local ring of X in x is by definition the localization R = Ap, with the maximal ideal m = p·Ap. Applying the construction above, we obtain the residue field of the point x :
k(x) := Ap / p·Ap.
One can prove that this definition does not depend on the choice of the affine neighbourhood U.
A point is called K-rational for a certain field K, if k(x) = K.
Example
Consider the affine line A1(k) = Spec(k[t]) over a field k. If k is algebraically closed, there are exactly two types of prime ideals, namely
(t − a), a ∈ k
(0), the zero-i |
https://en.wikipedia.org/wiki/E%E2%80%93Z%20notation | E–Z configuration, or the E–Z convention, is the IUPAC preferred method of describing the absolute stereochemistry of double bonds in organic chemistry. It is an extension of cis–trans isomer notation (which only describes relative stereochemistry) that can be used to describe double bonds having two, three or four substituents.
Following the Cahn–Ingold–Prelog priority rules (CIP rules), each substituent on a double bond is assigned a priority, then positions of the higher of the two substituents on each carbon are compared to each other. If the two groups of higher priority are on opposite sides of the double bond (trans to each other), the bond is assigned the configuration E (from entgegen, , the German word for "opposite"). If the two groups of higher priority are on the same side of the double bond (cis to each other), the bond is assigned the configuration Z (from zusammen, , the German word for "together").
The letters E and Z are conventionally printed in italic type, within parentheses, and separated from the rest of the name with a hyphen. They are always printed as full capitals (not in lowercase or small capitals), but do not constitute the first letter of the name for English capitalization rules (as in the example above).
Another example: The CIP rules assign a higher priority to bromine than to chlorine, and a higher priority to chlorine than to hydrogen, hence the following (possibly counterintuitive) nomenclature.
For organic molecules with multiple dou |
https://en.wikipedia.org/wiki/Xylophanes%20chiron | Xylophanes chiron is a moth of the family Sphingidae first described by Dru Drury in 1771.
Distribution
It can be found in Mexico down to northern Argentina and in Guadeloupe, Martinique and Jamaica.
Description
The wingspan range is 77–81 mm.
Biology
The larvae feed on Rubiaceae species.
Subspecies
Xylophanes chiron chiron
Xylophanes chiron cubanus Rothschild & Jordan, 1906 (Cuba)
Xylophanes chiron lucianus Rothschild & Jordan, 1906 (Dominica)
Xylophanes chiron nechus (Cramer, 1777) (Brazil)
References
External links
Xylophanes chiron Sphingidae of the Americas
chiron
Moths described in 1771
Sphingidae of South America
Moths of South America
Taxa named by Dru Drury |
https://en.wikipedia.org/wiki/Mesoporous%20silica | Mesoporous silica is a form of silica that is characterised by its mesoporous structure, that is, having pores that range from 2 nm to 50 nm in diameter. According to IUPAC's terminology, mesoporosity sits between microporous (<2 nm) and macroporous (>50 nm). Mesoporous silica is a relatively recent development in nanotechnology. The most common types of mesoporous nanoparticles are MCM-41 and SBA-15. Research continues on the particles, which have applications in catalysis, drug delivery and imaging. Mesoporous ordered silica films have been also obtained with different pore topologies.
A compound producing mesoporous silica was patented around 1970. It went almost unnoticed and was reproduced in 1997. Mesoporous silica nanoparticles (MSNs) were independently synthesized in 1990 by researchers in Japan. They were later produced also at Mobil Corporation laboratories and named Mobil Composition of Matter (or Mobil Crystalline Materials, MCM).
Six years later, silica nanoparticles with much larger (4.6 to 30 nanometer) pores were produced at the University of California, Santa Barbara. The material was named Santa Barbara Amorphous type material, or SBA-15. These particles also have a hexagonal array of pores.
The researchers who invented these types of particles planned to use them as molecular sieves. Today, mesoporous silica nanoparticles have many applications in medicine, biosensors, thermal energy storage, water/gas filtration and imaging.
Synthesis
Mesoporous sili |
https://en.wikipedia.org/wiki/Diploma%20in%20Pharmacy | In India, Diploma in Pharmacy (often shortened as DPharm or DPharma) is an entry-level tertiary pharmacy credential. It is obtained following two years of training. Students can enrol in the course after successfully completing higher secondary education in science stream with physics, chemistry and either biology or maths as subjects. After obtaining the diploma, registration with the pharmacy council is required to be a registered pharmacist. A D.Pharm holder can also enroll for a professional (undergraduate) degree course of Bachelor of Pharmacy via lateral entry scheme.
A diploma holder can be employed as a registered pharmacist in a hospital or pharmacy dispensing drugs and pharmaceuticals. It is mandatory that at least one person employed in a pharmacy be a qualified and registered pharmacist.
First year subjects
Pharmaceutics
Pharmaceutical chemistry
Pharmacognosy
Human Anatomy and Physiology
Social Pharmacy
Second year subjects
Pharmacology
Community Pharmacy & management
Biochemistry & Clinical Pathology
Pharmacotherapeutics
Hospital & Clinical Pharmacy
Pharmacy law & ethics
References
https://www.pci.nic.in/pdf/14-55_ER_20%20_syllabus_23092021.pdf
External links
Pharmacy council of India
D.Pharma Books
Academic degrees of India
Pharmacy education in India |
https://en.wikipedia.org/wiki/Karamata%27s%20inequality | In mathematics, Karamata's inequality, named after Jovan Karamata, also known as the majorization inequality, is a theorem in elementary algebra for convex and concave real-valued functions, defined on an interval of the real line. It generalizes the discrete form of Jensen's inequality, and generalizes in turn to the concept of Schur-convex functions.
Statement of the inequality
Let be an interval of the real line and let denote a real-valued, convex function defined on . If and are numbers in such that majorizes , then
Here majorization means that and satisfies
and we have the inequalities
and the equality
If is a strictly convex function, then the inequality () holds with equality if and only if we have for all .
Remarks
If the convex function is non-decreasing, then the proof of () below and the discussion of equality in case of strict convexity shows that the equality () can be relaxed to
The inequality () is reversed if is concave, since in this case the function is convex.
Example
The finite form of Jensen's inequality is a special case of this result. Consider the real numbers and let
denote their arithmetic mean. Then majorizes the -tuple , since the arithmetic mean of the largest numbers of is at least as large as the arithmetic mean of all the numbers, for every . By Karamata's inequality () for the convex function ,
Dividing by gives Jensen's inequality. The sign is reversed if is concave.
Proof of the inequality
We may as |
https://en.wikipedia.org/wiki/Jorge%20Benach | Jorge Benach is a medical researcher at the Stony Brook University in New York state. Benach is the chair of the Department of Molecular Genetics and Microbiology. Benach's main area of research is the tick-borne spirochete Borrelia burgdorferi, which is the causative agent of Lyme disease.
Benach also has begun to investigate organisms that could be used as bioterrorism agents, specifically Francisella tularensis, the bacterial agent of tularemia.
Benach graduated with a PhD from Rutgers University in 1972. Benach was named to a National Advisory Allergy and Infectious Diseases Council (NIAID) in 1998 and was named a 1992 Fulbright-Hays Fellow and Exchange Professor.
Lyme Disease research
Benach was one of the early researchers in Lyme disease. Benach and Edward Bosler, Ph.D. collaborated in the dogged and dangerous work of gathering and testing ticks for disease-causing pathogens at the Mashomack Preserve on Shelter Island, off the coast of New York. Benach and Bosler later co-authored the book Lyme Disease and Related Disease Disorders, New York Academy of Sciences (September 1988).
In the fall of 1981, Benach, then at the New York State Health Department, provided NIH researcher Willy Burgdorfer with collections of I. dammini (scapularis) ticks from Shelter Island, as part of an ongoing investigation of Rocky Mounted spotted fever on Long Island. It was in the midgut of two of those ticks that Burgdorfer, looking for RMSF rickettsiae, noticed the “poorly stained, |
https://en.wikipedia.org/wiki/Zuckerman%20functor | In mathematics, a Zuckerman functor is used to construct representations of real reductive Lie groups from representations of Levi subgroups. They were introduced by Gregg Zuckerman (1978). The Bernstein functor is closely related.
Notation and terminology
G is a connected reductive real affine algebraic group (for simplicity; the theory works for more general groups), and g is the Lie algebra of G. K is a maximal compact subgroup of G.
L is a Levi subgroup of G, the centralizer of a compact connected abelian subgroup, and *l is the Lie algebra of L.
A representation of K is called K-finite if every vector is contained in a finite-dimensional representation of K. Denote by WK the subspace of K-finite vectors of a representation W of K.
A (g,K)-module is a vector space with compatible actions of g and K, on which the action of K is K-finite.
R(g,K) is the Hecke algebra of G of all distributions on G with support in K that are left and right K finite. This is a ring which does not have an identity but has an approximate identity, and the approximately unital R(g,K)- modules are the same as (g,K) modules.
Definition
The Zuckerman functor Γ is defined by
and the Bernstein functor Π is defined by
References
David A. Vogan, Representations of real reductive Lie groups,
Anthony W. Knapp, David A. Vogan, Cohomological induction and unitary representations, prefacereview by Dan Barbasch
David A. Vogan, Unitary Representations of Reductive Lie Groups. (AM-118) (Annals of Math |
https://en.wikipedia.org/wiki/Martyn%20Amos | Martyn Amos is a Professor in the Department of Computer and Information Sciences at Northumbria University, working in natural computation, crowd simulation, DNA computing and synthetic biology. He was born in Hexham, Northumberland in 1971, brought up in Heddon-on-the-Wall, and attended school in Ponteland. He graduated with a degree in Computer Science from Coventry University in 1993 (which included an industrial placement working on the Ministry of Defence (United Kingdom) Corporate Headquarters Office Technology System), before earning a Ph.D. in DNA computing in 1997, from the University of Warwick. He then held a Leverhulme Trust Special Research Fellowship at the University of Liverpool, before taking up permanent academic appointments at the University of Liverpool (2000–2002), the University of Exeter (2002–2006), and Manchester Metropolitan University (2006-2018). He is a Fellow of the British Computer Society (FBCS), an active contributor to the Speakers for Schools education charity, and a Trustee of the Literary and Philosophical Society of Newcastle upon Tyne (the Lit & Phil).
Bibliography
— The first general text to cover the whole field.
— A popular science style introduction to the topic.
— A collection of "science into fiction" short stories, based on the themes of "unconventional computing" and artificial life, with accompanying afterwords written by consultant scientists.
References
Living people
British computer scientists
Alumni of Coventry Un |
https://en.wikipedia.org/wiki/DyLight%20Fluor | The DyLight Fluor family of fluorescent dyes are produced by Dyomics in collaboration with Thermo Fisher Scientific. DyLight dyes are typically used in biotechnology and research applications as biomolecule, cell and tissue labels for fluorescence microscopy, cell biology or molecular biology.
Historically, fluorophores such as fluorescein, rhodamine, Cy3 and Cy5 have been used in a wide variety of applications. These dyes have limitations for use in microscopy and other applications that require exposure to an intense light source such as a laser, because they photobleach quickly (however, bleaching can be reduced at least 10 fold using oxygen scavenging). DyLight Fluors have comparable excitation and emission spectra and are claimed to be more photostable, brighter, and less pH-sensitive. The excitation and emission spectra of the DyLight Fluor series cover much of the visible spectrum and extend into the infrared region, allowing detection using most fluorescence microscopes, as well as infrared imaging systems.
To use the DyLight Fluors with fluorescent imagers, use a spectral line of the blue laser diode for DyLight 405, a cyan (488 nm) laser for DyLight 488, a green (526 nm) laser for DyLight 550 and 594, and a red (633 nm) laser for DyLight 633 and 650. The DyLight 680, 755 and 800 fluors are compatible with laser- and filter-based infrared imaging instruments that emit in the 700 nm, 750 nm and 800 nm region of the spectrum, respectively.
DyLight Fluors are synth |
https://en.wikipedia.org/wiki/Abbas%20Edalat | Abbas Edalat () is a British-Iranian academic who is a professor of computer science and mathematics at the Department of Computing, Imperial College London and a political activist. In a 2018 letter to The Guardian, 129 experts in computer science, mathematics and machine learning described him as "a prominent academic, making fundamental contributions to mathematical logic and theoretical computer science" Edalat also founded SAF and CASMII, a campaign against sanctions and military intervention in Iran.
Edalat has appeared on BBC News on numerous occasions.
Academic career
Edalat is Professor of Computer Science and Mathematics at Imperial College, London, since 1997. Before this he was a lecturer in the Department of Mathematical Sciences at Sharif University of Technology, Tehran (1987–88). He completed his PhD in Mathematics at Warwick University (UK) in 1985 advised by Christopher Zeeman. His research interests include Exact Computation in Differential and Integral Calculus, Computational Geometry, Computation in Logical Form, Optimisation Theory, Game Theory and Computational Psychiatry.
At Imperial College, Professor Edalat serves as the head of both the Algorithmic Human Development and Continuous Data-Types and Exact Computing research groups. His 1997 paper on "Bisimulation for Labelled Markov Processes" received the IEEE LICS Test of Time Award in 2017.
Science and Arts Foundation
In 1999, Edalat founded the Science and Arts Foundation (SAF), a UK registered |
https://en.wikipedia.org/wiki/Alexander%20Strehl | Alexander Strehl (born in Nuremberg) is a computer scientist, management consultant and business school professor. His areas of expertise are machine learning, consensus clustering, business intelligence, big data, artificial intelligence, cluster analysis, data mining, entrepreneurship and digital transformation. He received a Ph.D. in Computer Engineering from the University of Texas at Austin, was the creator of cluster ensembles, a director of flatfox AG, and a management consultant at McKinsey & Company. He is currently teaching at the University of Aalen and serves as an independent industry consultant.
References
External links
Home page for Alexander Strehl
Aalen University page for Alexander Strehl
Living people
Scientists from Nuremberg
German computer scientists
German management consultants
Place of birth missing (living people)
Year of birth missing (living people)
University of Texas at Austin alumni |
https://en.wikipedia.org/wiki/String%20operations | In computer science, in the area of formal language theory, frequent use is made of a variety of string functions; however, the notation used is different from that used for computer programming, and some commonly used functions in the theoretical realm are rarely used when programming. This article defines some of these basic terms.
Strings and languages
A string is a finite sequence of characters.
The empty string is denoted by .
The concatenation of two string and is denoted by , or shorter by .
Concatenating with the empty string makes no difference: .
Concatenation of strings is associative: .
For example, .
A language is a finite or infinite set of strings.
Besides the usual set operations like union, intersection etc., concatenation can be applied to languages:
if both and are languages, their concatenation is defined as the set of concatenations of any string from and any string from , formally .
Again, the concatenation dot is often omitted for brevity.
The language consisting of just the empty string is to be distinguished from the empty language .
Concatenating any language with the former doesn't make any change: ,
while concatenating with the latter always yields the empty language: .
Concatenation of languages is associative: .
For example, abbreviating , the set of all three-digit decimal numbers is obtained as . The set of all decimal numbers of arbitrary length is an example for an infinite language.
Alphabet of a string
The alphabet of a stri |
https://en.wikipedia.org/wiki/Bcfg2 | Bcfg2 (pronounced "bee-config") is a configuration management tool developed in the Mathematics and Computer Science Division of Argonne National Laboratory. Bcfg2 aids in the infrastructure management lifecycle – configuration analysis, service deployment, and configuration auditing. It includes tools for visualizing configuration information, as well as reporting tools that help administrators understand configuration patterns in their environments.
Bcfg2 differs from similar configuration management tools due to its auditing capability. One of the stated design goals for Bcfg2 is to determine if interactive (direct) changes have been made to a machine and report on these extra changes. The client can optionally remove any additional configuration.
Overview
Bcfg2 is written in Python and enables system administrator to manage the configuration of a large number of computers using a central configuration model. Bcfg2 operates using a simple model of system configuration, modeling intuitive items like packages, services and configuration files (as well as the dependencies between them). This model of system configuration is used for verification and validation, allowing robust auditing of deployed systems. The Bcfg2 configuration specification is written using a declarative XML model. The entire specification can be validated using widely available XML schema validators along with the custom schemas included in Bcfg2.
Built to be cross-platform, Bcfg2 works on most Unix-l |
https://en.wikipedia.org/wiki/John%20Reif | John H. Reif (born 1951) is an American academic, and Professor of Computer Science at Duke University, who has made contributions to large number of fields in computer science: ranging from algorithms and computational complexity theory to robotics. He has also published in many other scientific fields including chemistry (in particular, nanoscience), optics (in particular optical computing and design of head-mounted displays), and mathematics (in particular graph theory and game theory.
Biography
John Reif received a B.S. (magna cum laude) from Tufts University in 1973, a M.S. from Harvard University in 1975 and a Ph.D. from Harvard University in 1977.
From 1983 to 1986 he was associate professor of Harvard University, and since 1986 he has been Professor of Computer Science at Duke University. Currently he holds the Hollis Edens Distinguished Professor, Trinity College of Arts and Sciences, Duke University. From 2011 to 2014 he was Distinguished Adjunct Professor, Faculty of Computing and Information Technology (FCIT), King Abdulaziz University (KAU), Jeddah, Saudi Arabia.
He has also contributed to bringing together various disjoint research communities working in different areas of nano-sciences by organizing (as General Chairman) annual Conferences on "Foundations of Nanoscience: Self-assembled architectures and devices" (FNANO) for last 20 years.
He has been awarded Fellow of the following organizations: American Association for the Advancement of Science, IEEE, |
https://en.wikipedia.org/wiki/Journal%20of%20Systems%20and%20Software | The Journal of Systems and Software is a computer science journal in the area of software systems, established in 1979 and published by Elsevier.
Content and scope
The journal publishes research papers, state-of-the-art surveys, and practical experience reports. It includes papers covering issues of programming methodology, software engineering, and hardware/software systems. Topics include: "software systems, prototyping issues, high-level specification techniques, procedural and functional programming techniques, data-flow concepts, multiprocessing, real-time, distributed, concurrent, and telecommunications systems, software metrics, reliability models for software, performance issues, and management concerns."
Abstracting and indexing
According to the 2021 Journal Citation Reports, the Journal of Systems and Software has an impact factor of 3.514.
According to Google Scholar, the journal has an h5-index of 61, which ranks third among international publication venues in software systems, after ICSE and IEEE Transactions on Software Engineering.
Past and present editors-in-chief
John Manley and Alan Salisbury (1979–1983)
Richard E. Fairley (1984–1985)
Robert L. Glass (1986–2001)
David N. Card (2002–2008)
Hans van Vliet (2009–2017)
Paris Avgeriou and David Shepherd (2018–current)
Notable articles
A few of the most notable (downloaded) articles are:
Software defect prediction based on enhanced metaheuristic feature selection optimization and a hybrid deep neural |
https://en.wikipedia.org/wiki/Emmanuel%20Alo | Emmanuel Babatunde Alo (born April 15, 1950) is a Nigerian professor of applied biology, ecosystems, entomology and parasitology.
Background
Alo is noted for his research work on the transmission patterns of the HIV virus in the ABO and Rhesus blood groups. Alo's extensive research work on the almost extinct species of Dennettia tripetala is carried by the Chinese Government's National Science and Technology Library, the Institute for Scientific and Technical Information (INIST) of the French National Center for Scientific Research (CNRS) and the United Kingdom's Department for Environment, Food and Rural Affairs.
In 1991 Alo was appointed as the first Dean and founder of the School of Postgraduate Studies at the Federal University of Technology Yola. He went on to serve as the university's Deputy Vice-Chancellor from 1996 to 2000, and as interim Vice-Chancellor in 2001. He is also a chair member of the Executive Leadership Board of Rotary International District 9125.
Selected works
United Nations' Aquatic sciences and fisheries abstracts, Volume 19,(Published 1989), integrated pest management for developing countries (Nova Science Publishers, 2007) Crop Post-Harvest: Science and Technology, Volume 2 (Wiley-Blackwell;edition 1, November 5, 2004),
Advances in Virus Research, Vol. 53 Academic Press; 1 edition (October 25, 1999) and Extension Services in Wildlife Conservation: The Extension Agent and Information Worker, 22:267-269 Cambridge University Press.
Current advan |
https://en.wikipedia.org/wiki/Arthur%20Samuel%20%28computer%20scientist%29 | Arthur Lee Samuel (December 5, 1901 – July 29, 1990) was an American pioneer in the field of computer gaming and artificial intelligence. He popularized the term "machine learning" in 1959. The Samuel Checkers-playing Program was among the world's first successful self-learning programs, and as such a very early demonstration of the fundamental concept of artificial intelligence (AI). He was also a senior member in the TeX community who devoted much time giving personal attention to the needs of users and wrote an early TeX manual in 1983.
Biography
Samuel was born on December 5, 1901, in Emporia, Kansas, and graduated from College of Emporia in Kansas in 1923.
He received a master's degree in Electrical Engineering from MIT in 1926, and taught for two years as instructor. In 1928, he joined Bell Laboratories, where he worked mostly on vacuum tubes, including improvements of radar during World War II. He developed a gas-discharge transmit-receive switch (TR tube) that allowed a single antenna to be used for both transmitting and receiving. After the war he moved to the University of Illinois at Urbana–Champaign, where he initiated the ILLIAC project, but left before its first computer was complete.
Samuel went to IBM in Poughkeepsie, New York, in 1949, where he would conceive and carry out his most successful work. He is credited with one of the first software hash tables, and influencing early research in using transistors for computers at IBM. At IBM he made the first ch |
https://en.wikipedia.org/wiki/Xylophanes%20crotonis | Xylophanes crotonis is a moth of the family Sphingidae first described by Francis Walker in 1870.
Distribution
It is found in Guatemala, Colombia, Venezuela and south to Bolivia.
Description
The wingspan is . the larvae are green, turquoise or purplish with yellow dots. They are without eyespots in the second instar.
Biology
Adults are on wing year round in Costa Rica.
The larvae feed on Psychotria correae, Palicourea padifolia, Palicourea salicifolia, Coussarea austin-smithii, Coussarea caroliana and probably other Rubiaceae species. They have also been recorded on Rottboellia cochinchinensis.
References
External links
Xylophanes crotonis Sphingidae of the Americas
crotonis
Moths described in 1856
Moths of South America |
https://en.wikipedia.org/wiki/David%20Peleg%20%28computer%20scientist%29 | David Peleg () is an Israeli computer scientist. He is a professor at the Weizmann Institute of Science, holding the Norman D. Cohen Professorial Chair of Computer Sciences, and the present dean of the Faculty of Mathematics and Computer Science in Weizmann Institute.
His main research interests are algorithms, computer networks, and distributed computing. Many of his papers deal with a combination of all three.
He received his Ph.D. from the Weizmann Institute under the supervision of David Harel. He has published numerous papers and a book, chaired leading conferences in computer science, and is an editor of several scientific journals.
Awards and honors
In 2008, he was awarded the Edsger W. Dijkstra Prize in Distributed Computing along with Baruch Awerbuch for their 1990 paper “Sparse partitions.”
In 2011, he won the SIROCCO Prize for Innovation in Distributed Computing, awarded annually at the SIROCCO conference.
In 2017 he became a Fellow of the Association for Computing Machinery.
Since 2020, Peleg is editor-in-chief of the journal Information and Computation.
Selected publications
. Dijkstra Prize 2008.
Notes
References
David Peleg's home page.
Living people
Israeli computer scientists
Theoretical computer scientists
Researchers in distributed computing
Academic staff of Weizmann Institute of Science
Dijkstra Prize laureates
Fellows of the Association for Computing Machinery
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Inorganic%20polymer | In polymer chemistry, an inorganic polymer is a polymer with a skeletal structure that does not include carbon atoms in the backbone. Polymers containing inorganic and organic components are sometimes called hybrid polymers, and most so-called inorganic polymers are hybrid polymers. One of the best known examples is polydimethylsiloxane, otherwise known commonly as silicone rubber. Inorganic polymers offer some properties not found in organic materials including low-temperature flexibility, electrical conductivity, and nonflammability. The term inorganic polymer refers generally to one-dimensional polymers, rather than to heavily crosslinked materials such as silicate minerals. Inorganic polymers with tunable or responsive properties are sometimes called smart inorganic polymers. A special class of inorganic polymers are geopolymers, which may be anthropogenic or naturally occurring.
Main group backbone
Traditionally, the area of inorganic polymers focuses on materials in which the backbone is composed exclusively of main-group elements.
Homochain polymers
Homochain polymers have only one kind of atom in the main chain. One member is polymeric sulfur, which forms reversibly upon melting any of the cyclic allotropes, such as S8. Organic polysulfides and polysulfanes feature short chains of sulfur atoms, capped respectively with alkyl and H. Elemental tellurium and the gray allotrope of elemental selenium also are polymers, although they are not processable.
Polymeric for |
https://en.wikipedia.org/wiki/Levi%27s%20lemma | In theoretical computer science and mathematics, especially in the area of combinatorics on words, the Levi lemma states that, for all strings u, v, x and y, if uv = xy, then there exists a string w such that either
uw = x and v = wy (if |u| ≤ |x|)
or
u = xw and wv = y (if |u| ≥ |x|)
That is, there is a string w that is "in the middle", and can be grouped to one side or the other. Levi's lemma is named after Friedrich Wilhelm Levi, who published it in 1944.
Applications
Levi's lemma can be applied repeatedly in order to solve word equations; in this context it is sometimes called the Nielsen transformation by analogy with the Nielsen transformation for groups. For example, starting with an equation xα = yβ where x and y are the unknowns, we can transform it (assuming |x| ≥ |y|, so there exists t such that x=yt) to ytα = yβ, thus to tα = β. This approach results in a graph of substitutions generated by repeatedly applying Levi's lemma. If each unknown appears at most twice, then a word equation is called quadratic; in a quadratic word equation the graph obtained by repeatedly applying Levi's lemma is finite, so it is decidable if a quadratic word equation has a solution. A more general method for solving word equations is Makanin's algorithm.
Generalizations
The above is known as the Levi lemma for strings; the lemma can occur in a more general form in graph theory and in monoid theory; for example, there is a more general Levi lemma for traces originally due to Christ |
https://en.wikipedia.org/wiki/Institute%20of%20Problems%20of%20Chemical%20Physics | The Institute of Problems of Chemical Physics (IPCP) () of the Russian Academy of Sciences (RAS) consists of 10 scientific departments and about 100 laboratories each one held by an independent research groups.
IPCP was established in 1956 as branch of the Moscow Institute of Chemical Physics
See also
Mathematical chemistry
Aizik Isaakovich Vol'pert
Notes
References
. "The Institute of Chemical Physics. Historical essays" (English translation of the title) is an historical book on the Institute of Problems of Chemical Physics, written by Fedor Ivanovich Dubovitskii, one of his founders and leading directors for many years. It gives many useful details on the lives and the achievements of many scientists who worked there, including Aizik Isaakovich Vol'pert.
. "Institute of Problems of Chemical Physics. Fifty years in the trenches" (English translation of the title) is a brief historical sketch of the institute, published in the first volume of the 2004 yearbook.
External links
Official Website
Research institutes in the Soviet Union
Institutes of the Russian Academy of Sciences
Chemical research institutes
Moscow Institute of Physics and Technology
Nuclear weapons program of the Soviet Union
Research institutes established in 1956 |
https://en.wikipedia.org/wiki/Trace%20theory | In mathematics and computer science, trace theory aims to provide a concrete mathematical underpinning for the study of concurrent computation and process calculi. The underpinning is provided by an algebraic definition of the free partially commutative monoid or trace monoid, or equivalently, the history monoid, which provides a concrete algebraic foundation, analogous to the way that the free monoid provides the underpinning for formal languages.
The power of trace theory stems from the fact that the algebra of dependency graphs (such as Petri nets) is isomorphic to that of trace monoids, and thus, one can apply both algebraic formal language tools, as well as tools from graph theory.
While the trace monoid had been studied by Pierre Cartier and Dominique Foata for its combinatorics in the 1960s, trace theory was first formulated by Antoni Mazurkiewicz in the 1970s, in an attempt to evade some of the problems in the theory of concurrent computation, including the problems of interleaving and non-deterministic choice with regards to refinement in process calculi.
References
Volker Diekert, Grzegorz Rozenberg, eds. The Book of Traces, (1995) World Scientific, Singapore
Volker Diekert, Yves Metivier, "Partial Commutation and Traces", In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 3, Beyond Words. Springer-Verlag, Berlin, 1997.
Volker Diekert, Combinatorics on traces, LNCS 454, Springer, 1990,
Concurrent computing
Formal languages
Trace |
https://en.wikipedia.org/wiki/Nominal | Nominal may refer to:
Linguistics and grammar
Nominal (linguistics), one of the parts of speech
Nominal, the adjectival form of "noun", as in "nominal agreement" (= "noun agreement")
Nominal sentence, a sentence without a finite verb
Noun phrase or nominal phrase
Mathematics
Nominal data, a form of categorical data in statistics
Nominal number, a number used as an identifier in mathematics
Titles
Post-nominal letters, letters indicating a title, placed after the name of a person
Pre-nominal letters, letters indicating a title, placed before the name of a person
Other uses
Nominal aphasia or anomic aphasia, a problem remembering words and names
Nominal category, a group of objects or ideas that can be collectively grouped on the basis of one or more shared, arbitrary characteristics
Nominal damages, a small award to compensate for technical harm
Nominal GDP, a raw gross domestic product value uncompensated for inflation or deflation
Nominal techniques, computer science techniques for working with formal languages with name binding constructs
Real versus nominal value, an accepted condition which is a goal or an approximation as opposed to the real value
Real versus nominal value (economics), the face value of currency not corrected for inflation or compound interest
Nominal type system, a type system where properties of a data type are determined by explicit declaration and/or the name of a type
See also
Nominal group (disambiguation)
Nominalism
Nom |
https://en.wikipedia.org/wiki/Dorothea%20Rockburne | Dorothea Rockburne DFA (born c. 1932) is an abstract painter, drawing inspiration primarily from her deep interest in mathematics and astronomy. Her work is geometric and abstract, seemingly simple but very precise to reflect the mathematical concepts she strives to concretize. "I wanted very much to see the equations I was studying, so I started making them in my studio," she has said. "I was visually solving equations." Rockburne's attraction to Mannerism has also influenced her work.
Career
In 1950 Rockburne moved to the United States to attend Black Mountain College, where she studied with mathematician Max Dehn, a lifelong influence on her work. In addition to Dehn, she studied with Franz Kline, Philip Guston, John Cage, and Merce Cunningham. She also met fellow student Robert Rauschenberg. In 1955, Rockburne moved to New York City where she met many of the leading artists and poets of the time. She was influenced by the minimalist dances of Yvonne Rainer and the Judson Dance Theater.
Throughout her career, she created paintings that expressed mathematical concepts. In 1958, a solo show of her work was critically and financially successful but deemed "not good enough" by Rockburne herself. She did not publicly show her work again for more than a decade, turning her attention to dance and performance art by 1960. Rockburne participated in performances at the Judson Dance Theater and took classes at the American Ballet Theatre. During that time she supported her daughter |
https://en.wikipedia.org/wiki/List%20of%20Washington%20University%20faculty%20and%20staff | This is a list of faculty and staff of Washington University in St. Louis.
Arts and Sciences
School of Medicine
National Academy of Medicine
John P. Atkinson, Samuel B. Grant Professor Professor of Medicine & Molecular Microbiology
C. Robert Cloninger, Wallace Renard Professor and Director, Center for Psychobiology of Personality
Graham Colditz, Niess-Gain Professor in Medicine Department of Surgery
Jerome R. Cox, Jr., Senior Professor, Computer Science & Engineering
William Henry Danforth, Chancellor
Timothy J. Eberlein, Bixby Professor and chairman, Department of Surgery
Alex S. Evers, Henry E. Mallinckrodt Professor and Chairman Department of Anesthesiology
Richard H. Gelberman, Fred C. Reynolds Professor and chair, Orthopaedic Surgery
Eric M. Genden, Excellence in Teaching Award, 1998
David M. Kipnis, Distinguished University Professor
Stuart A. Kornfeld, David C. and Betty Farrell Professor of Medicine and Biochemistry
Timothy J. Ley, Alan and Edith Wolff Professor of Medicine Professor of Genetics
Susan E. Mackinnon, Sydney M. Schoenberg, Jr. & Robert H. Schoenberg Professor and Chief, Division of Plastic and Reconstructive Surgery
Phillip W. Majerus, Professor of Medicine
Phillip Needleman
Colin Nichols, Carl Cori Endowed Professor
John W. Olney, Professor of Psychiatry and Neuropathology
William A. Peck, Alan A. and Edith L. Woolf Distinguished Professor Director, Center for Health Policy
Marcus E. Raichle, Professor of Radiology and Neurology
Lee N. Robins, Univer |
https://en.wikipedia.org/wiki/Jia%20Rongqing | Jia Rongqing () is a Canadian mathematician of Chinese origin who is a mathematics professor at the University of Alberta researching approximation theory and wavelet analysis.
Life
He was an undergraduate student at the Zhejiang University in Hangzhou, China, where he obtained his Bachelor of Science in 1968. In 1980, he went to the University of Wisconsin–Madison and undertook M.Sc and Ph.D work under the supervision of Carl-Wilhelm de Boor, receiving his Ph.D. in 1983.
He is a professor of mathematics at the University of Alberta in Edmonton, Alberta.
Selected publications
R.Q. Jia, Smoothness of multivariate refinable functions in Sobolev spaces, Trans. Amer. Math. Soc.351 (1999) 4089-4112.
R.Q. Jia, Shift-invariant spaces and linear operator equations, Israel Math. J. 103 (1998), 259-288.
R.Q. Jia, Approximation properties of multivariate wavelets, Mathematics of Computation 67 (1998), 647-665
R.Q. Jia, Perturbation of polynomial ideals, Advances in Applied Mathematics 17 (1996), 308-336.
R.Q. Jia, The Toeplitz theorem and its applications to approximation theory and linear PDE's, Trans. Amer. Math. Soc. 347 (1995), 2585-2594.
References
External links
Rong-Qing Jia's office website at the University of Alberta
20th-century Canadian mathematicians
Academic staff of the University of Alberta
Zhejiang University alumni
University of Wisconsin–Madison alumni
Living people
Year of birth missing (living people)
21st-century Canadian mathematicians
Chinese emigrants to |
https://en.wikipedia.org/wiki/David%20Willey%20%28physicist%29 | David G. Willey (born 4 November 1947), known as the Mad Scientist, is a former physics instructor at the University of Pittsburgh at Johnstown in Johnstown, Pennsylvania. Physics has been a major interest in his life since he attended The Coleshill School and the John Port School in Etwall, Derbyshire. He has been presenting physics shows since the early 1980s. Willey is a scientific consultant for the skeptics group, C.S.I. (Committee for Skeptical Inquiry). He also designs physics apparatus/equipment for the Science Kit Boreal Labs. In his spare time he enjoys hunting, woodworking, working with stained glass, and playing golf.
Education and career
Willey studied at Aston University and Birmingham University from 1966 to 1971. Then he taught at Saltley Grammar School, in Birmingham from 1971 to 1972. Next, Willey moved from his home country of England to the United States and enrolled at the Ohio State University. He was in Columbus, Ohio until he obtained his master's degree in physics in 1974. His first teaching position was with the University of Pittsburgh at Johnstown. In the early 1980s, he performed his first physics show at the university's open house.
A few months later, Willey made a 15-minute video of physics demonstrations with a group of troubled boys from a remand home. This video was played on local television for the public to see. A local school teacher saw Willey's demonstrations and asked him to perform some of them for her class. Willey's physic |
https://en.wikipedia.org/wiki/Dullard%20protein | In cell biology, Dullard protein is a protein coding gene involved in neural development. It is a member of DXDX(T/V) phosphatase family and is a potential regulator of neural tube development in Xenopus. The gene promotes neural development by inhibiting Bone Morphogenetic Proteins (BMPs). Dullard is also known as CTDnep1, which stands for CTD nuclear envelope phosphatase 1. This gene is relatively small and only contains 244 amino acids.
Description
Dullard is also known as CTDnep1, which stands for CTD nuclear envelope phosphatase 1. It is a protein coding gene, which include phosphatase activity and protein serine/threonine phosphatase activity. This gene is relatively small and only contains 244 amino acids. Dullard protein or CTDnep1 encodes a protein serine/threonine phosphatase and dephosphoroylates LPIN1 and LPIN2. LPIN1 and LPIN2 catalyze the reaction of the conversion of phosphatidic acid to diacylglycerol. The reaction can affect and change the lipid concentration of the endoplasmic reticulum and the nucleus.
Dullard and BNP signaling
Neural development happens in the dorsal ectoderm. In the genus Xenopus, over expression of Dullard undergoes apoptosis in early development. Dullard helps promote Ubiquitin by proteosomal degradation. Dullard mRNA is derived from maternal genes and is localized within the animal neural hemisphere. Functioning negatively for the regulation of Bone Morphogenetic Proteins (BMPs), Dullard conserves the C-terminal region of NLI-IF, in |
https://en.wikipedia.org/wiki/Gregg%20Zuckerman | Gregg Jay Zuckerman (born 1949) is a mathematician at Yale University who discovered Zuckerman functors and translation functors, and with Anthony W. Knapp classified the irreducible tempered representations of semisimple Lie groups.
He received his Ph.D. in mathematics from Princeton University in 1975 after completing a doctoral dissertation, titled "Some character identities for semisimple Lie groups", under the supervision of Elias M. Stein.
Publications
References
External links
Yale page
1949 births
Living people
20th-century American mathematicians
21st-century American mathematicians
Princeton University alumni
Yale University faculty |
https://en.wikipedia.org/wiki/Eileen%20Pollack | Eileen Pollack (born 1956) is an American novelist, essayist, and short story writer. She is the former director of the Master of Fine Arts Program at the University of Michigan. Pollack holds an undergraduate degree in Physics from Yale University and an M.F.A in creative writing from the University of Iowa. She received the Rona Jaffe Foundation Writers' Award in 1996.
She currently divides her time between Ann Arbor, Michigan, and Manhattan.
Pollack's The Rabbi in the Attic and Other Stories (1991) features an Old-World male rabbi and his leftist female successor, and is among the early works of American Jewish literature to prominently feature the inclusion of women rabbis as literary figures.
Works
The Rabbi in the Attic
Paradise, New York
"In the Mouth"
"Woman Walking Ahead: In Search of Catherine Weldon and Sitting Bull"
Breaking and Entering
The Only Woman in the Room: Why Science Is Still a Boys' Club
A Perfect Life
References
External links
Official website
Brown University Interview
"Why Are There Still So Few Women in Science?" in The New York Times Magazine, 2013
"What Really Keeps Women Out of Tech" in The New York Times, 2015
21st-century American novelists
American women novelists
American women short story writers
1956 births
Living people
Yale University alumni
University of Iowa alumni
American women essayists
21st-century American women writers
University of Michigan faculty
Rona Jaffe Foundation Writers' Award winners
21st-century American sh |
https://en.wikipedia.org/wiki/Zonular%20cataract%20and%20nystagmus | Zonular cataract and nystagmus, also referred as nystagmus with congenital zonular cataract, is a rare congenital disease associated with Nystagmus and zonular cataract of the eye.
Genetics
It has been suggested that the disease follows an X-linked pattern of inheritance though studies done on this particular disease are few.
Diagnosis
Treatment
References
External links
Congenital disorders of eyes
Genetic disorders with OMIM but no gene |
https://en.wikipedia.org/wiki/Tony%20Hey | Professor Anthony John Grenville Hey (born 17 August 1946) was vice-president of Microsoft Research Connections, a division of Microsoft Research, until his departure in 2014.
Education
Hey was educated at King Edward's School, Birmingham and the University of Oxford. He graduated with a Bachelor of Arts degree in physics in 1967, and a Doctor of Philosophy in theoretical physics in 1970 supervised by P. K. Kabir. He was a student of Worcester College, Oxford and St John's College, Oxford.
Career and research
From 1970 through 1972 Hey was a postdoctoral fellow at California Institute of Technology (Caltech).
Moving to Pasadena, California, he worked with Richard Feynman and Murray Gell-Mann, both winners of the Nobel Prize in Physics.
He then moved to Geneva, Switzerland and worked as a fellow at CERN (the European organisation for nuclear research) for two years.
Hey worked about thirty years as an academic at University of Southampton, starting in 1974 as a particle physicist.
He spent 1978 as a visiting fellow at Massachusetts Institute of Technology.
For 1981 he returned to Caltech as a visiting research professor. There he learned of Carver Mead's work on very-large-scale integration and become interested in applying parallel computing techniques to large-scale scientific simulations.
Hey worked with British semiconductor company Inmos on the Transputer project in the 1980s.
He switched to computer science in 1985, and in 1986 became professor of computation in th |
https://en.wikipedia.org/wiki/Transferability%20%28chemistry%29 | In chemistry, transferability is the assumption that a chemical property that is associated with an atom or a functional group in a molecule will have a similar (but not identical) value in a variety of different circumstances. Examples of transferable properties include:
Electronegativity
Nucleophilicity
Chemical shifts in NMR spectroscopy
Characteristic frequencies in Infrared spectroscopy
Bond length and bond angle
Bond energy
Transferable properties are distinguished from conserved properties, which are assumed to always have the same value whatever the chemical situation, e.g. standard atomic weight.
References
Chemical properties |
https://en.wikipedia.org/wiki/History%20monoid | In mathematics and computer science, a history monoid is a way of representing the histories of concurrently running computer processes as a collection of strings, each string representing the individual history of a process. The history monoid provides a set of synchronization primitives (such as locks, mutexes or thread joins) for providing rendezvous points between a set of independently executing processes or threads.
History monoids occur in the theory of concurrent computation, and provide a low-level mathematical foundation for process calculi, such as CSP the language of communicating sequential processes, or CCS, the calculus of communicating systems. History monoids were first presented by M.W. Shields.
History monoids are isomorphic to trace monoids (free partially commutative monoids) and to the monoid of dependency graphs. As such, they are free objects and are universal. The history monoid is a type of semi-abelian categorical product in the category of monoids.
Product monoids and projection
Let
denote an n-tuple of (not necessarily pairwise disjoint) alphabets . Let denote all possible combinations of one finite-length string from each alphabet:
(In more formal language, is the Cartesian product of the free monoids of the . The superscript star is the Kleene star.) Composition in the product monoid is component-wise, so that, for
and
then
for all in . Define the union alphabet to be
(The union here is the set union, not the disjoint union.) Given |
https://en.wikipedia.org/wiki/St%20Thomas%20More%20Roman%20Catholic%20College | St Thomas More RC College located in Denton, Greater Manchester, England is a comprehensive school previously known as St Thomas More RC High School.St Thomas More has a roll of approximately 780 pupils and 40 teaching staff.
The school was opened in 1964 and gained Specialist College status in Mathematics and Computing in 2004. Following its designation as a high performing specialist college it was awarded a second specialism in Applied Learning in 2008 and awarded Leading Edge status in 2010.
References
Secondary schools in Tameside
Catholic secondary schools in the Diocese of Salford
Voluntary aided schools in England |
https://en.wikipedia.org/wiki/Flounce | Flounce may refer to:
Flounce (fabric), particular type of fabric manipulation that creates a similar look to ruffle but with less bulk
Flounce (physics) or crackle, in physics, the fifth derivative of the position vector with respect to time |
https://en.wikipedia.org/wiki/Springer%20correspondence | In mathematics, the Springer representations are certain representations of the Weyl group W associated to unipotent conjugacy classes of a semisimple algebraic group G. There is another parameter involved, a representation of a certain finite group A(u) canonically determined by the unipotent conjugacy class. To each pair (u, φ) consisting of a unipotent element u of G and an irreducible representation φ of A(u), one can associate either an irreducible representation of the Weyl group, or 0. The association
depends only on the conjugacy class of u and generates a correspondence between the irreducible representations of the Weyl group and the pairs (u, φ) modulo conjugation, called the Springer correspondence. It is known that every irreducible representation of W occurs exactly once in the correspondence, although φ may be a non-trivial representation. The Springer correspondence has been described explicitly in all cases by Lusztig, Spaltenstein and Shoji. The correspondence, along with its generalizations due to Lusztig, plays a key role in Lusztig's classification of the irreducible representations of finite groups of Lie type.
Construction
Several approaches to Springer correspondence have been developed. T. A. Springer's original construction proceeded by defining an action of W on the top-dimensional l-adic cohomology groups of the algebraic variety Bu of the Borel subgroups of G containing a given unipotent element u of a semisimple algebraic group G over a fin |
https://en.wikipedia.org/wiki/Arthur%20T.%20Ippen | Arthur Thomas Ippen (July 28, 1907 – April 5, 1974) was a noted hydrologist and engineer and was an Institute Professor at the Massachusetts Institute of Technology. Born to German parents, he attended high school and college in Aachen, Germany graduating with a degree in Civil Engineering in 1931. He then took an Institute of International Education scholarship to study at the University of Iowa but after his doctoral advisor, Floyd Nagler, died suddenly, Ippen transferred to Caltech to complete his Ph.D. His doctoral work, supervised by Theodore von Kármán and Robert T. Knapp, explored sediment transport and open-channel high-velocity flows and represented the first American development of sonic wave analogy to free-surface flow.
Ippen's took his first faculty appointment at Lehigh University in 1938 and remained there until he accepted a position at MIT in 1945. While at MIT, he took over the existing Hydrodynamics Laboratory and built up a research program of staff graduate students examining the sonic analogy, transient flows, instrumentation, turbulence, cavitation, shoaling waves, stratified flow, and sediment transport. The laboratory eventually expanded and became the Ralph M. Parsons Laboratory for Water Resources and Hydrodynamics.
Ippen served as the President of the International Association for Hydraulic Research, was elected to the National Academy of Engineering in April 1967 and the American Academy of Arts and Sciences, and also received honorary doctorate |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.