source stringlengths 31 168 | text stringlengths 51 3k |
|---|---|
https://en.wikipedia.org/wiki/Ein%20Elkaram | Ein Elkaram () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Ein Elkaram had a population of 564 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Ein%20Farraj | Ein Farraj () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Ein Farraj had a population of 190 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Jbita%2C%20Hama | Jbita () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Jbita, Hama had a population of 687 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Kafr%20Laha%2C%20Hama | Kafr Laha, Hama () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Kafr Laha, Hama had a population of 379 in the 2004 census.
History
In 1838, Kafr Laha's inhabitants were noted to be predominantly Sunni Muslims.
References
Bibliography
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Kameliyeh | Kameliyeh () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Kameliyeh had a population of 532 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Marha%2C%20Hama | Marha, Hama () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Marha, Hama had a population of 378 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Meisreh | Meisreh () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Meisreh had a population of 330 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Naqir | Naqir () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Naqir had a population of 389 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Qossiyeh | Qossiyeh () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Qossiyeh had a population of 645 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Al-Sindiyana%2C%20Masyaf | Al-Sindiyana () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), al-Sindiyana had a population of 621 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Tamarqiyeh | Tamarqiyeh () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Tamarqiyeh had a population of 607 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Zaytuneh | Zaytuneh () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Zaytuneh had a population of 304 according to the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Bit%20Elwadi | Bit Elwadi () is a Syrian village located in Wadi al-Uyun Nahiyah in Masyaf District, Hama. According to the Syria Central Bureau of Statistics (CBS), Bit Elwadi had a population of 157 in the 2004 census.
References
Populated places in Masyaf District |
https://en.wikipedia.org/wiki/Inverted%20Dirichlet%20distribution | In statistics, the inverted Dirichlet distribution is a multivariate generalization of the beta prime distribution, and is related to the Dirichlet distribution. It was first described by Tiao and Cuttman in 1965.
The distribution has a density function given by
The distribution has applications in statistical regression and arises naturally when considering the multivariate Student distribution. It can be characterized by its mixed moments:
provided that and .
The inverted Dirichlet distribution is conjugate to the negative multinomial distribution if a generalized form of odds ratio is used instead of the categories' probabilities- if the negative multinomial parameter vector is given by , by changing parameters of the negative multinomial to where .
T. Bdiri et al. have developed several models that use the inverted Dirichlet distribution to represent and model non-Gaussian data. They have introduced finite and infinite mixture models of inverted Dirichlet distributions using the Newton–Raphson technique to estimate the parameters and the Dirichlet process to model infinite mixtures.
T. Bdiri et al. have also used the inverted Dirichlet distribution to propose an approach to generate Support Vector Machine kernels basing on Bayesian inference and another approach to establish hierarchical clustering.
References
Multivariate continuous distributions
Conjugate prior distributions
Exponential family distributions
Continuous distributions |
https://en.wikipedia.org/wiki/Continuous-time%20random%20walk | In mathematics, a continuous-time random walk (CTRW) is a generalization of a random walk where the wandering particle waits for a random time between jumps. It is a stochastic jump process with arbitrary distributions of jump lengths and waiting times. More generally it can be seen to be a special case of a Markov renewal process.
Motivation
CTRW was introduced by Montroll and Weiss as a generalization of physical diffusion process to effectively describe anomalous diffusion, i.e., the super- and sub-diffusive cases. An equivalent formulation of the CTRW is given by generalized master equations. A connection between CTRWs and diffusion equations with fractional time derivatives has been established. Similarly, time-space fractional diffusion equations can be considered as CTRWs with continuously distributed jumps or continuum approximations of CTRWs on lattices.
Formulation
A simple formulation of a CTRW is to consider the stochastic process defined by
whose increments are iid random variables taking values in a domain and is the number of jumps in the interval . The probability for the process taking the value at time is then given by
Here is the probability for the process taking the value after jumps, and is the probability of having jumps after time .
Montroll–Weiss formula
We denote by the waiting time in between two jumps of and by its distribution. The Laplace transform of is defined by
Similarly, the characteristic function of the jump distribution is given by its Fourier transform:
One can show that the Laplace–Fourier transform of the probability is given by
The above is called Montroll–Weiss formula.
Examples
References
Variants of random walks |
https://en.wikipedia.org/wiki/Jorge%20Carranza | Jorge Carlos Carranza (born 7 May 1981) is an Argentine professional footballer who plays as a goalkeeper for Instituto.
Career statistics
Club
.
Honours
Instituto
Primera B Nacional: 2003–04
References
External links
1981 births
Living people
Argentine men's footballers
Argentine expatriate men's footballers
Club Rivadavia footballers
Atlético de Rafaela footballers
Ferro Carril Oeste footballers
Godoy Cruz Antonio Tomba footballers
Instituto Atlético Central Córdoba footballers
O'Higgins F.C. footballers
Club Olimpo footballers
San Martín de Tucumán footballers
Correcaminos UAT footballers
Club Atlético Colón footballers
Boca Unidos footballers
Chilean Primera División players
Argentine Primera División players
Primera Nacional players
Torneo Federal A players
Men's association football goalkeepers
Argentine expatriate sportspeople in Chile
Argentine expatriate sportspeople in Mexico
Expatriate men's footballers in Chile
Expatriate men's footballers in Mexico |
https://en.wikipedia.org/wiki/SESI%20Mathematics | SESI Mathematics is a project developed by FIRJAN System with the aim of improving the teaching of math for high school students. The program consists of a series of initiatives, from the organization of training courses for teachers and distribution of educational kits, to the providing of physical spaces for students of SESI Rio and SENAI Rio network, as well as for those from selected state schools. Although the project has the pretension of being expanded to other Brazilian states, nowadays it only operates in the states of Rio de Janeiro and Bahia.
History
SESI Mathematics was launched in 2012 by SESI Rio. The program counted on an initial investment of R$ 10 million and was created based on the Lei de Diretrizes e Bases da Educação Nacional (read "Law of Guidelines and Bases of National Education"), motivated by the poor performance of Brazil in national and international reviews, as well as in researches that indicated a lack of skilled people to work in areas related to the exact sciences, which require mastery of mathematics.
In 2013, an agreement was signed between SESI Bahia and the Government of Bahia State to extend the project to the schools of the state of Bahia. In the same year, the project won the Idea Brasil award in the "Design Strategy" category.
Methodology
The project's initiatives make use of online interactive technologies such as educational games as a way to encourage the teaching of students.
The games are developed by the English company Mangahigh.
SESI Mathematics House
In partnership with the Instituto Nacional de Matemática Pura e Aplicada (read "National Institute for Pure and Applied Mathematics"), one of the initiatives of the project is the construction of a public space dedicated to temporary and permanent exhibitions of themes related to mathematics, among other activities. The space will be located at Barra da Tijuca (Rio de Janeiro, Brasil) and is scheduled to open in 2015.
Notes
References
External links
SESI Mathematics (in Portuguese)
Educational games
Mathematical games
Games of mental skill
Education policy in Brazil
Mathematics education
Education by method |
https://en.wikipedia.org/wiki/Roy%20Hart%20%28footballer%29 | Roy Ernest Hart (30 May 1933 – June 2014) was an English professional footballer who played in the Football League for Brentford as a centre half.
Career statistics
References
1933 births
Footballers from Acton, London
English men's footballers
Brentford F.C. players
English Football League players
2014 deaths
Men's association football wing halves |
https://en.wikipedia.org/wiki/Fields%20of%20Science%20and%20Technology | Fields of Science and Technology (FOS) is a compulsory classification for statistics of branches of scholarly and technical fields, published by the OECD in 2002. It was created out of the need to interchange data of research facilities, research results etc. It was revised in 2007 under the name Revised Fields of Science and Technology.
List
Natural sciences
Mathematics
Computer and information sciences
Physical sciences
Chemical sciences
Earth and related environmental sciences
Biological sciences
Other natural sciences
Engineering and technology
Civil engineering
Electrical engineering, electronic engineering, information engineering
Mechanical engineering
Chemical engineering
Materials engineering
Medical engineering
Environmental engineering
Systems engineering
Environmental biotechnology
Industrial biotechnology
Nano technology
Other engineering and technologies
Medical and health sciences
Basic medicine
Clinical medicine
Health sciences
Health biotechnology
Other medical sciences
Agricultural sciences
Agriculture, forestry, and fisheries
Animal and dairy science
Veterinary science
Agricultural biotechnology
Other agricultural sciences
Social science
Psychology
Economics and business
Educational sciences
Sociology
Law
Political science
Social and economic geography
Media and communications
Other social sciences
Humanities
History and archaeology
Languages and literature
Philosophy, ethics and religion
Arts (arts, history of arts, performing arts, music)
Other humanities
See also
International Standard Classification of Education
International Standard Classification of Occupations
Wissenschaft – epistemological concept in which serious scholarly works of history, literature, art, and religion are similar to natural sciences
References
OECD
Scientific classification |
https://en.wikipedia.org/wiki/Shahar%20Pe%27er%20career%20statistics | This is a list of the main career statistics of professional Israeli tennis player Shahar Peer.
Performance timelines
Only main-draw results in WTA Tour, Grand Slam tournaments, Fed Cup and Olympic Games are included in win–loss records.
Singles
Doubles
Significant finals
Grand Slam finals
Doubles: 1 runner–up
WTA Premier Mandatory & 5 finals
Doubles: 2 runner–ups
WTA career finals
Singles: 9 (5 titles, 4 runners-up)
Doubles: 10 (3 titles, 7 runners-up)
WTA Challenger finals
Singles: 1 (1 title)
ITF finals
Singles: 9 (5 titles, 4 runner–ups)
Doubles: 6 (4 titles, 2 runner–ups)
Junior Grand Slam finals
Singles: 1 (1 title)
Record against other players
Record vs. No. 1 ranked players
0-1
0-6
0-5
0-2
0-1
0-7
3-1
1-2
4-3
1-6
0-2
0-1
0-2
0-1
Top 10 wins
Career double bagels (6–0, 6–0)
Notes
External links
Peer, Shahar |
https://en.wikipedia.org/wiki/List%20of%20things%20named%20after%20Jean%20d%27Alembert | This article is a list of things named after Jean d'Alembert:
Mathematics and natural sciences
d'Alembert criterion
d'Alembert force
d'Alembert operator
d'Alembertian
d’Alembert reduction
d'Alembert system
d'Alembert's equation
d'Alembert's form of the principle of virtual work
d'Alembert's functional equation
d'Alembert's formula
d'Alembert's paradox
d'Alembert's principle
d'Alembert's theorem
d'Alembert–Euler condition
Fiction and literature
"Le rêve de D'Alembert" ("D'Alembert's Dream"), by Denis Diderot.
D'Alembert's Principle, a novel by Andrew Crumey (1996).
Others
Tree of Diderot and d'Alembert
Ile d'Alembert, island better known by the English name of Lipson Island.
d'Alembert, crater
Alembert |
https://en.wikipedia.org/wiki/Vincent%20average | In applied statistics, Vincentization was described by Ratcliff (1979), and is named after biologist S. B. Vincent (1912), who used something very similar to it for constructing learning curves at the beginning of the 1900s. It basically consists of averaging subjects' estimated or elicited quantile functions in order to define group quantiles from which can be constructed.
To cast it in its greatest generality, let represent arbitrary (empirical or theoretical) distribution functions and define their corresponding quantile functions by
The Vincent average of the 's is then computed as
where the non-negative numbers have a sum of .
References
Applied statistics |
https://en.wikipedia.org/wiki/Equivalent%20definitions%20of%20mathematical%20structures | In mathematics, equivalent definitions are used in two somewhat different ways. First, within a particular mathematical theory (for example, Euclidean geometry), a notion (for example, ellipse or minimal surface) may have more than one definition. These definitions are equivalent in the context of a given mathematical structure (Euclidean space, in this case). Second, a mathematical structure may have more than one definition (for example, topological space has at least seven definitions; ordered field has at least two definitions).
In the former case, equivalence of two definitions means that a mathematical object (for example, geometric body) satisfies one definition if and only if it satisfies the other definition.
In the latter case, the meaning of equivalence (between two definitions of a structure) is more complicated, since a structure is more abstract than an object. Many different objects may implement the same structure.
Isomorphic implementations
Natural numbers may be implemented as 0 = , 1 = = , 2 = = , 3 = = and so on; or alternatively as 0 = , 1 = =, 2 = = and so on. These are two different but isomorphic implementations of natural numbers in set theory.
They are isomorphic as models of Peano axioms, that is, triples (N,0,S) where N is a set, 0 an element of N, and S (called the successor function) a map of N to itself (satisfying appropriate conditions). In the first implementation S(n) = n ∪ ; in the second implementation S(n) = . As emphasized in Benacerraf's identification problem, the two implementations differ in their answer to the question whether 0 ∈ 2; however, this is not a legitimate question about natural numbers (since the relation ∈ is not stipulated by the relevant signature(s), see the next section). Similarly, different but isomorphic implementations are used for complex numbers.
Deduced structures and cryptomorphisms
The successor function S on natural numbers leads to arithmetic operations, addition and multiplication, and the total order, thus endowing N with an ordered semiring structure. This is an example of a deduced structure. The ordered semiring structure (N, +, ·, ≤) is deduced from the Peano structure (N, 0, S) by the following procedure:
n + 0 = n, m + S (n) = S (m + n), m · 0 = 0, m · S (n) = m + (m · n), and m ≤ n if and only if there exists k ∈ N such that m + k = n. And conversely, the Peano structure is deduced from the ordered semiring structure as follows: S (n) = n + 1, and 0 is defined by 0 + 0 = 0. It means that the two structures on N are equivalent by means of the two procedures.
The two isomorphic implementations of natural numbers mentioned in the previous section are isomorphic as triples (N,0,S), that is, structures of the same signature (0,S) consisting of a constant symbol 0 and a unary function S. An ordered semiring structure (N, +, ·, ≤) has another signature (+, ·, ≤) consisting of two binary functions and one binary relation. The notion of isomorphism does no |
https://en.wikipedia.org/wiki/David%20Broomhead | David S. Broomhead (13 November 1950 – 24 July 2014) was a British mathematician specialising in dynamical systems and was professor of applied mathematics at the School of Mathematics, University of Manchester.
Education
Broomhead was born on 13 November 1950 in Leeds. He attended Aireborough Grammar School and, after spending a year teaching in Uganda, Broomhead moved to Merton College, Oxford, where he read chemistry for his first degree. He remained in Oxford for his D.Phil., researching quantum mechanics under the supervision of Peter Atkins. He completed his thesis Molecules in Electromagnetic Fields in 1976.
Career
After a year as a postdoc at the Atomic Energy Research Establishment, Broomhead moved to Japan. He held at two-year NATO Postdoctoral Fellowship in the Department of Physics at the University of Kyoto, in K. Tomita's group. On returning to the U.K., he worked as a postdoc with George Rowlands at the University of Warwick, again in the Physics Department. In 1983, Broomhead began working in the Signal Processing group at the Royal Signals and Radar Establishment (RSRE, now QinetiQ) in Malvern, becoming Senior Principal Scientific Officer. In 1995 he moved to Manchester, taking a Chair in Applied Mathematics, initially at UMIST and then after 2004, at the School of Mathematics at the new University of Manchester.
From 1989 to 1992 he was Coordinator of the EPSRC Nonlinear Mathematics Initiative. He held visiting positions at University College London, the University of Oxford and Hiroshima University. Broomhead was a Fellow of the Institute of Mathematics and its Applications (IMA), a member of the IMA Council from 1998 and was Chair of the Editorial Board of Mathematics Today from 2002. In 2013 he was made an Honorary Fellow of the IMA.
Research
Broomhead's main interest was the development of methods for time series analysis and nonlinear signal processing using techniques from the theory of nonlinear dynamical systems. He also championed applying these ideas in interdisciplinary research.
In Japan, Broomhead began to work seriously on applied nonlinear dynamics and chaos. With Greg King he developed techniques to determine whether an experimental time series had been generated by a deterministic chaotic system by combining the pure mathematical results on topological embedding due to Takens with the engineering method of singular value decompositions.
While in Malvern, Broomhead wrote his influential papers on delay embedding and on neural networks. In 1989 he was awarded the John Benjamin Memorial Prize for work with David Lowe and Andrew Webb that exploited an analogy between neural networks and interpolation using the newly developed radial basis functions from numerical analysis.
At Manchester he became increasingly interested in applications to biology. He worked initially on eye movement control with Richard Abadi. Later, as a member of the Manchester Centre for Integrative Systems Biology, he worked with Dou |
https://en.wikipedia.org/wiki/Grouped%20Dirichlet%20distribution | In statistics, the grouped Dirichlet distribution (GDD) is a multivariate generalization of the Dirichlet distribution It was first described by Ng et al. 2008. The Grouped Dirichlet distribution arises in the analysis of categorical data where some observations could fall into any of a set of other 'crisp' category. For example, one may have a data set consisting of cases and controls under two different conditions. With complete data, the cross-classification of disease status forms a 2(case/control)-x-(condition/no-condition) table with cell probabilities
If, however, the data includes, say, non-respondents which are known to be controls or cases, then the cross-classification of disease status forms a 2-x-3 table. The probability of the last column is the sum of the probabilities of the first two columns in each row, e.g.
The GDD allows the full estimation of the cell probabilities under such aggregation conditions.
Probability Distribution
Consider the closed simplex set and
. Writing for the first elements of a member of , the distribution of for two partitions has a density function given by
where is the multivariate beta function.
Ng et al. went on to define an m partition grouped Dirichlet distribution with density of given by
where is a vector of integers with . The normalizing constant given by
The authors went on to use these distributions in the context of three different applications in medical science.
References
Multivariate continuous distributions
Conjugate prior distributions
Exponential family distributions
Continuous distributions |
https://en.wikipedia.org/wiki/Derek%20Lawden | Derek Frank Lawden (15 September 1919 – 15 February 2008) was a British-New Zealand mathematician.
Academic career
After reading mathematics at Cambridge University he served in the Royal Artillery and then lectured at the Royal Military College of Science and the College of Advanced Technology Birmingham, where he worked on rocket trajectories and space flight. In 1956 he moved to University of Canterbury as professor. In the 1960s he received a DSc from Cambridge, was appointed a Fellow of the Royal Society of New Zealand and won the Hector Medal. He return to the UK to University of Aston in 1967.
After the World War II, he was the first to register in the literature considerations about the use of gravity assist for space exploration. In his pioneering work on optimal space trajectories in the 1960s, he coined the term "primer vector" to refer to the adjoint variables in the costate equation associated with the velocity vector, pointing out their fundamental connection to optimal thrust.
References
External links
google scholar
British expatriates in New Zealand
British Army personnel of World War II
Academics of Cranfield University
Academics of Aston University
Alumni of the University of Cambridge
Academic staff of the University of Canterbury
Rocket scientists
English mathematicians
Fellows of the Royal Society of New Zealand
1919 births
2008 deaths
20th-century British mathematicians
Royal Artillery personnel
Military personnel from Birmingham, West Midlands |
https://en.wikipedia.org/wiki/Marquinho%20%28footballer%2C%20born%20August%201986%29 | Marco Aurélio Iubel (born 7 August 1986), simply known as Marquinho is a Brazilian professional footballer playing for San Francisco Glens SC in USL League Two as a winger.
Club Career Statistics
References
External links
1986 births
Living people
Men's association football forwards
Brazilian men's footballers
Footballers from Paraná (state)
J. Malucelli Futebol players
Vitória S.C. players
C.S. Marítimo players
Esporte Clube Vitória players
Vila Nova Futebol Clube players
Paraná Clube players
Mirassol Futebol Clube players
Saba Qom F.C. players
Zob Ahan Esfahan F.C. players
Campeonato Brasileiro Série A players
Campeonato Brasileiro Série B players
Primeira Liga players
Liga Portugal 2 players |
https://en.wikipedia.org/wiki/2014%E2%80%9315%20Levante%20UD%20season | The 2014–15 season was the 106th season in Levante’s history and the 10th in the top-tier.
Squad statistics
Appearances and goals
|-
! colspan=10 style=background:#0000CD;color:red;text-align:center|Goalkeepers
|-
! colspan=10 style=background:#0000CD;color:red;text-align:center|Defenders
|-
! colspan=10 style=background:#0000CD;color:red;text-align:center|Midfielders
|-
! colspan=10 style=background:#0000CD;color:red;text-align:center|Forwards
|-
! colspan=10 style=background:#0000CD;color:red;text-align:center| Players transferred out during the season
Transfer in
Transfer out
Competitions
Overall
Friendlies
Primera División
League table
Results summary
Matches
Kickoff times are in CET and CEST.
Copa del Rey
References
Levante UD seasons
Levante UD |
https://en.wikipedia.org/wiki/Peter%20Lorimer%20%28mathematician%29 | Peter James Lorimer (16 April 1939 – 7 February 2010) was a New Zealand mathematician. His research concerned group theory, combinatorics, and Ramsey theory.
Academic career
Born in Christchurch, Lorimer did a BSc / MSc in mathematics at the University of Auckland and won a Commonwealth Scholarship to do a PhD at McGill University in Montreal, which he completed in 1963 under the supervision of Hans Schwerdtfeger. He returned to New Zealand to lecture, first at University of Canterbury and then at University of Auckland.
References
External links
institutional homepage
1939 births
2010 deaths
Group theorists
Combinatorialists
University of Auckland alumni
Academic staff of the University of Auckland
People from Christchurch
McGill University alumni
Academic staff of the University of Canterbury
New Zealand mathematicians
Fellows of the Royal Society of New Zealand |
https://en.wikipedia.org/wiki/Query%20rewriting | Query rewriting is a typically automatic transformation that takes a set of database tables, views, and/or queries, usually indices, often gathered data and query statistics, and other metadata, and yields a set of different queries, which produce the same results but execute with better performance (for example, faster, or with lower memory use). Query rewriting can be based on relational algebra or an extension thereof (e.g. multiset relational algebra with sorting, aggregation and three-valued predicates i.e. NULLs as in the case of SQL). The equivalence rules of relational algebra are exploited, in other words, different query structures and orderings can be mathematically proven to yield the same result. For example, filtering on fields A and B, or cross joining R and S can be done in any order, but there can be a performance difference. Multiple operations may be combined, and operation orders may be altered.
The result of query rewriting may not be at the same abstraction level or application programming interface (API) as the original set of queries (though often is). For example, the input queries may be in relational algebra or SQL, and the rewritten queries may be closer to the physical representation of the data, e.g. array operations. Query rewriting can also involve materialization of views and other subqueries; operations that may or may not be available to the API user. The query rewriting transformation can be aided by creating indices from which the optimizer can choose (some database systems create their own indexes if deemed useful), mandating the use of specific indices, creating materialized and/or denormalized views, or helping a database system gather statistics on the data and query use, as the optimality depends on patterns in data and typical query usage.
Query rewriting may be rule based or optimizer based. Some sources discuss query rewriting as a distinct step prior to optimization, operating at the level of the user accessible algebra API (e.g. SQL).
There are other, largely unrelated concepts also named similarly, for example, query rewriting by search engines.
See also
Query optimization
References
Data management |
https://en.wikipedia.org/wiki/List%20of%20UD%20Almer%C3%ADa%20records%20and%20statistics | Unión Deportiva Almería (English: Almería Sports Union), often referred to as just Almería, is a professional football club, based in Almería, Andalusia, Spain.
Founded in 1989 under the name of Almería Club de Fútbol, changed its name to the current one in 2001.
Honours
UD Almería's only major trophy was the Segunda División title in the 2021–22 campaign. The club's precessor (AD Almería) also won the Segunda División in 1978–79, and won a Segunda División B trophy in the previous season.
Regional titles
Trofeo Benéfico UCAM:
Winners (1):
2014 – (2–1 UCAM Murcia)
Trofeo Festa d'Elx:
Winners (2):
2012 – (3–1 Elche)
2015 – (1–0 Elche)
Trofeo Memorial Juan Rojas:
Winners (7):
2001 – (2–1 Alicante)
2002 – (1–1 (5–4 p.) Villarreal)
2003 – (5–0 Málaga)
2005 – (2–0 Nacional )
2008 – (3–1 Betis)
2010 – (2–0 Granada)
2011 – (0–0 (3–1 p.) Villarreal)
Trofeo Agroponiente:
Winners (1):
2011 – (3–0 Comarca de Níjar)
Trofeo Carabela de Plata:
Winners (1):
2011 – (2–1 Cartagena)
Trofeo Lagarto de Jaén:
Winners (1):
2009 – (2–0 Jaén)
Trofeo Vendimia:
Winners (1):
2007 – (1–0 Xerez)
Trofeo Alcalde de Águilas:
Winners (1):
2007
Trofeo Villa de Nerja:
Winners (1):
2007 – (3–2 Málaga)
Trofeo Costa Brava:
Winners (1):
2007
Trofeo Ciudad de Terrassa:
Winners (1):
2007
National titles
Segunda División:
Winners (1): 2021–22
Runners-up (1): 2006–07
Segunda División B:
Runners-up (2): 1994–95, 2001–02
Tercera División:
Runners-up (1): 1992–93
Statistics
Seasons in La Liga: 6
Best position in La Liga: 8th (2007–08)
Points obtained: 52
Worst position in La Liga: 20th (2010–11)
Seasons in Segunda División: 13
Best position in Segunda División: 1st (2021–22)
Points obtained: 81
Worst position in Segunda División: 18th (2002–03, 2015–16, 2017–18)
Most goals scored in a season: 88 (1992–93)
Most goals scored in a La Liga match:
Home:Almería 3 – Villarreal 0 (4 April 2009), Almería 3 – Mallorca 1 (15 May 2011), Almería 3 – Granada 0 (4 January 2014), Almería 3 – Granada 0 (11 April 2015)
Away:Sevilla 1 – Almería 4 (19 April 2008)
Most goals conceded in a La Liga match:
Home: Almería 0 – Barcelona 8 (20 November 2010)
Away: Real Madrid 8 – Almería 1 (21 May 2011)
Overall seasons table in La Liga
{|class="wikitable"
|-bgcolor="#efefef"
! Pos.
! Club
! Season In D1
! Pl.
! W
! D
! L
! GS
! GA
! Dif.
! Pts
!Champion
!2nd place
!3rd place
!4th place
|-
|align=center|37
|Almería
|align=center|7
|align=center|266
|align=center|73
|align=center|64
|align=center|129
|align=center|293
|align=center|431
|align=center|-138
|align=center|283
| align=center bgcolor=gold| 0
| align=center bgcolor=silver| 0
| align=center bgcolor=bronze| 0
| align=center | 0
|}
Last updated: 29 September 2023
Pos. = Position; Pl = Match played; W = Win; D = Draw; L = Lost; GS = Goals scored; GA = Goals against; P = Points.
Colors: Gold = winner; Silver = runner-up.
Milestones
Players in bold are still playing for the club, and players in i |
https://en.wikipedia.org/wiki/G-measure | In mathematics, a G-measure is a measure that can be represented as the weak-∗ limit of a sequence of measurable functions . A classic example is the Riesz product
where . The weak-∗ limit of this product is a measure on the circle , in the sense that for :
where represents Haar measure.
History
It was Keane who first showed that Riesz products can be regarded as strong mixing invariant measure under the shift operator . These were later generalized by Brown and Dooley to Riesz products of the form
where .
References
External links
Riesz Product at Encyclopedia of Mathematics
Measures (measure theory)
Dimension theory |
https://en.wikipedia.org/wiki/2015%20Lao%20Premier%20League | Statistics of Lao Premier League in the 2015 season. The league is composed of clubs starts on 28 February 2015. Hoang Anh Attapeu are the defending champions, having won their first league title in 2014.
Clubs
Champasak United
Ezra
Hoang Anh Attapeu
Lanexang United
Lao Police Club
Young Elephant
SHB Vientiane
Lao Toyota FC
EDL FC
Eastern Star FC
Savan FC
Format
Over the course of a season, which runs annually from January to July, each team plays twice against the others in the league, once at 'home' and once 'away'. Three points are awarded for a win, one for a draw and zero for a loss. The teams are ranked in the league table by points gained, then goal difference, then goals scored and then their head-to-head record for that season.
Stadium
League table
Top scorers
References
External links
Lao League at rsssf.com
Lao Premier League seasons
1
Laos
Laos |
https://en.wikipedia.org/wiki/P-group%20generation%20algorithm | In mathematics, specifically group theory, finite groups of prime power order , for a fixed prime number and varying integer exponents , are briefly called finite p-groups.
The p-group generation algorithm by M. F. Newman
and E. A. O'Brien
is a recursive process for constructing the descendant tree
of an assigned finite p-group which is taken as the root of the tree.
Lower exponent-p central series
For a finite p-group , the lower exponent-p central series (briefly lower p-central series) of
is a descending series of characteristic subgroups of ,
defined recursively by
and , for .
Since any non-trivial finite p-group is nilpotent,
there exists an integer such that
and is called the exponent-p class (briefly p-class) of .
Only the trivial group has .
Generally, for any finite p-group ,
its p-class can be defined as .
The complete lower p-central series of is therefore given by
,
since is the Frattini subgroup of .
For the convenience of the reader and for pointing out the shifted numeration, we recall that
the (usual) lower central series of is also a descending series of characteristic subgroups of ,
defined recursively by
and , for .
As above, for any non-trivial finite p-group ,
there exists an integer such that
and is called the nilpotency class of ,
whereas is called the index of nilpotency of .
Only the trivial group has .
The complete lower central series of is given by
,
since is the commutator subgroup or derived subgroup of .
The following Rules should be remembered for the exponent-p class:
Let be a finite p-group.
Rule: , since the descend more quickly than the .
Rule: If , for some group , then , for any .
Rule: For any , the conditions and imply .
Rule: Let . If , then , for all , in particular, , for all .
Parents and descendant trees
The parent of a finite non-trivial p-group with exponent-p class
is defined as the quotient of by the last non-trivial term of the lower exponent-p central series of .
Conversely, in this case, is called an immediate descendant of .
The p-classes of parent and immediate descendant are connected by .
A descendant tree is a hierarchical structure
for visualizing parent-descendant relations
between isomorphism classes of finite p-groups.
The vertices of a descendant tree are isomorphism classes of finite p-groups.
However, a vertex will always be labelled by selecting a representative of the corresponding isomorphism class.
Whenever a vertex is the parent of a vertex
a directed edge of the descendant tree is defined by
in the direction of the canonical projection onto the quotient .
In a descendant tree, the concepts of parents and immediate descendants can be generalized.
A vertex is a descendant of a vertex ,
and is an ancestor of ,
if either is equal to
or there is a path
, where ,
of directed edges from to .
The vertices forming the path necessarily coincide with the iterated parents of , with :
, where .
They can also be viewed as |
https://en.wikipedia.org/wiki/Narutaka%20Ozawa | (born 1974) is a Japanese mathematician, known for his work in operator algebras and discrete groups. He has been a professor at Kyoto University since 2013. He earned a bachelor's degree in mathematics in 1997 from the University of Tokyo and a Ph.D. in mathematics in 2000 from the same institution. One year later he received a Ph.D. in mathematics from Texas A&M University. He was selected for one of the prestigious Sloan Research Fellowships in 2005 and was an invited speaker at the 2006 ICM in Madrid where he gave a talk on "Amenable actions and Applications". He has won numerous prizes including the Mathematical Society of Japan (MSJ) Spring Prize and the Japan Society for the Promotion of Science (JSPS) Prize. Before becoming a full professor at Kyoto University in 2013, he was an associate professor at the University of Tokyo and at University of California, Los Angeles.
Notes
References
External links
Narutaka OZAWA
Functional analysts
20th-century Japanese mathematicians
21st-century Japanese mathematicians
Living people
1974 births |
https://en.wikipedia.org/wiki/Bal%C3%A1zs%20Vill%C3%A1m | Balázs Villám (born 2 June 1989) is a Hungarian football player who currently plays for Iváncsa.
Club statistics
Updated to games played as of 29 November 2017.
References
MLSZ
HLSZ
1989 births
Living people
People from Kalocsa
Hungarian men's footballers
Men's association football defenders
Vasas SC players
Bajai LSE footballers
Dunaújváros PASE players
Szolnoki MÁV FC footballers
Zalaegerszegi TE players
Budapest Honvéd FC players
Nemzeti Bajnokság I players
Footballers from Bács-Kiskun County |
https://en.wikipedia.org/wiki/Nor%C3%B0fj%C3%B6r%C3%B0ur%20Airport | Norðfjörður Airport is an airport serving Neskaupstaður, Iceland. The town is on the Norðfjörður fjord.
The Nordfjordur non-directional beacon (Ident: NF) is located on the field.
Statistics
Passengers and movements
See also
Transport in Iceland
List of airports in Iceland
Notes
References
Google Earth
External links
OurAirports - Norðfjörður
Norðfjörður Airport
OpenStreetMap - Norðfjörður
Airports in Iceland |
https://en.wikipedia.org/wiki/M%C3%BDvatn%20Airport | Mývatn Airport is an airport serving Reykjahlíð, Iceland.
The Lake Mývatn area is a nature preserve of volcanic origin.
Statistics
Passengers and movements
See also
Transport in Iceland
List of airports in Iceland
Notes
References
Google Earth
External links
OurAirports - Reykjahlíð
Mývatn Airport
OpenStreetMap - Reykjahlíð
Airports in Iceland |
https://en.wikipedia.org/wiki/Truncated%20rhombicosidodecahedron | In geometry, the truncated rhombicosidodecahedron is a polyhedron, constructed as a truncated rhombicosidodecahedron. It has 122 faces: 12 decagons, 30 octagons, 20 hexagons, and 60 squares.
Other names
Truncated small rhombicosidodecahedron
Beveled icosidodecahedron
Zonohedron
As a zonohedron, it can be constructed with all but 30 octagons as regular polygons. It is 2-uniform, with 2 sets of 120 vertices existing on two distances from its center.
This polyhedron represents the Minkowski sum of a truncated icosidodecahedron, and a rhombic triacontahedron.
Related polyhedra
The truncated icosidodecahedron is similar, with all regular faces, and 4.6.10 vertex figure. Also see the truncated rhombirhombicosidodecahedron.
The truncated rhombicosidodecahedron can be seen in sequence of rectification and truncation operations from the icosidodecahedron. A further alternation step leads to the snub rhombicosidodecahedron.
See also
Expanded icosidodecahedron
Truncated rhombicuboctahedron
References
Coxeter Regular Polytopes, Third edition, (1973), Dover edition, (pp. 145–154 Chapter 8: Truncation)
John H. Conway, Heidi Burgiel, Chaim Goodman-Strauss, The Symmetries of Things 2008,
External links
George Hart's Conway interpreter: generates polyhedra in VRML, taking Conway notation as input
Polyhedra |
https://en.wikipedia.org/wiki/Rectified%20truncated%20icosahedron | In geometry, the rectified truncated icosahedron is a convex polyhedron. It has 92 faces: 60 isosceles triangles, 12 regular pentagons, and 20 regular hexagons. It is constructed as a rectified, truncated icosahedron, rectification truncating vertices down to mid-edges.
As a near-miss Johnson solid, under icosahedral symmetry, the pentagons are always regular, although the hexagons, while having equal edge lengths, do not have the same edge lengths with the pentagons, having slightly different but alternating angles, causing the triangles to be isosceles instead. The shape is a symmetrohedron with notation I(1,2,*,[2])
Images
Dual
By Conway polyhedron notation, the dual polyhedron can be called a joined truncated icosahedron, jtI, but it is topologically equivalent to the rhombic enneacontahedron with all rhombic faces.
Related polyhedra
The rectified truncated icosahedron can be seen in sequence of rectification and truncation operations from the truncated icosahedron. Further truncation, and alternation operations creates two more polyhedra:
See also
Near-miss Johnson solid
Rectified truncated tetrahedron
Rectified truncated octahedron
Rectified truncated cube
Rectified truncated dodecahedron
References
Coxeter Regular Polytopes, Third edition, (1973), Dover edition, (pp. 145–154 Chapter 8: Truncation)
John H. Conway, Heidi Burgiel, Chaim Goodman-Strauss, The Symmetries of Things 2008,
External links
George Hart's Conway interpreter: generates polyhedra in VRML, taking Conway notation as input
Polyhedra |
https://en.wikipedia.org/wiki/Rectified%20truncated%20octahedron | In geometry, the rectified truncated octahedron is a convex polyhedron, constructed as a rectified, truncated octahedron. It has 38 faces: 24 isosceles triangles, 6 squares, and 8 hexagons.
Topologically, the squares corresponding to the octahedron's vertices are always regular, although the hexagons, while having equal edge lengths, do not have the same edge lengths with the squares, having different but alternating angles, causing the triangles to be isosceles instead.
Related polyhedra
The rectified truncated octahedron can be seen in sequence of rectification and truncation operations from the octahedron. Further truncation, and alternation creates two more polyhedra:
See also
Rectified truncated tetrahedron
Rectified truncated cube
Rectified truncated dodecahedron
Rectified truncated icosahedron
References
Coxeter Regular Polytopes, Third edition, (1973), Dover edition, (pp. 145–154 Chapter 8: Truncation)
John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008,
External links
George Hart's Conway interpreter: generates polyhedra in VRML, taking Conway notation as input
Polyhedra |
https://en.wikipedia.org/wiki/Bruno%20Pascua | Bruno Pascua (born 21 January 1990) is a Spanish football player who currently plays for Bolivian club Guabirá.
Club statistics
Updated to games played as of 2 December 2014.
References
External links
MLSZ
1990 births
Living people
People from Santander, Spain
Spanish men's footballers
Spanish expatriate men's footballers
Men's association football midfielders
Rayo Cantabria players
Dunaújváros PASE players
Universitario de Sucre footballers
Grindavík men's football players
C.A. Nacional Potosí players
Club Deportivo Guabirá players
Tercera División players
Segunda División B players
Nemzeti Bajnokság I players
Bolivian Primera División players
Expatriate men's footballers in Hungary
Expatriate men's footballers in Bolivia
Expatriate men's footballers in Iceland
Spanish expatriate sportspeople in Hungary
Spanish expatriate sportspeople in Bolivia
Spanish expatriate sportspeople in Iceland |
https://en.wikipedia.org/wiki/Tibor%20S%C3%B3ron | Tibor Sóron (born 18 January 1993) is a Hungarian football player who currently plays for Bicskei TC.
Club statistics
Updated to games played as of 9 December 2014.
References
HLSZ
1993 births
Living people
People from Esztergom
Hungarian men's footballers
Men's association football forwards
Dunaújváros PASE players
FC Ajka players
Rákosmenti KSK players
Kaposvári Rákóczi FC players
III. Kerületi TVE footballers
Vác FC players
Szeged-Csanád Grosics Akadémia footballers
Nemzeti Bajnokság I players
Nemzeti Bajnokság II players
Sportspeople from Komárom-Esztergom County |
https://en.wikipedia.org/wiki/D%C3%A1vid%20Jakab | Dávid Jakab (born 21 May 1993) is a Hungarian football player.
Club statistics
Updated to games played as of 2 December 2014.
References
HLSZ
1993 births
Living people
Footballers from Budapest
Hungarian men's footballers
Men's association football midfielders
Dunaújváros PASE players
MTK Budapest FC players
Zalaegerszegi TE players
Győri ETO FC players
Mosonmagyaróvári TE footballers
Kecskeméti TE players
Kazincbarcikai SC footballers
Nemzeti Bajnokság I players
Nemzeti Bajnokság II players
Nemzeti Bajnokság III players |
https://en.wikipedia.org/wiki/Rectified%20truncated%20dodecahedron | In geometry, the rectified truncated dodecahedron is a convex polyhedron, constructed as a rectified, truncated dodecahedron. It has 92 faces: 20 equilateral triangles, 60 isosceles triangles, and 12 decagons.
Topologically, the triangles corresponding to the dodecahedrons's vertices are always equilateral, although the decagons, while having equal edge lengths, do not have the same edge lengths with the equilateral triangles, having different but alternating angles, causing the other triangles to be isosceles instead.
Related polyhedra
The rectified truncated dodecahedron can be seen in sequence of rectification and truncation operations from the dodecahedron. Further truncation, and alternation operations creates two more polyhedra:
See also
Rectified truncated tetrahedron
Rectified truncated octahedron
Rectified truncated cube
Rectified truncated icosahedron
References
Coxeter Regular Polytopes, Third edition, (1973), Dover edition, (pp. 145–154 Chapter 8: Truncation)
John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008,
External links
George Hart's Conway interpreter: generates polyhedra in VRML, taking Conway notation as input
Polyhedra |
https://en.wikipedia.org/wiki/Rectified%20truncated%20cube | In geometry, the rectified truncated cube is a polyhedron, constructed as a rectified, truncated cube. It has 38 faces: 8 equilateral triangles, 24 isosceles triangles, and 6 octagons.
Topologically, the triangles corresponding to the cube's vertices are always equilateral, although the octagons, while having equal edge lengths, do not have the same edge lengths with the equilateral triangles, having different but alternating angles, causing the other triangles to be isosceles instead.
Related polyhedra
The rectified truncated cube can be seen in sequence of rectification and truncation operations from the cube. Further truncation, and alternation operations creates two more polyhedra:
See also
Rectified truncated tetrahedron
Rectified truncated octahedron
Rectified truncated dodecahedron
Rectified truncated icosahedron
References
Coxeter Regular Polytopes, Third edition, (1973), Dover edition, (pp. 145–154 Chapter 8: Truncation)
John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008,
External links
George Hart's Conway interpreter: generates polyhedra in VRML, taking Conway notation as input
Polyhedra |
https://en.wikipedia.org/wiki/Rectified%20truncated%20tetrahedron | In geometry, the rectified truncated tetrahedron is a polyhedron, constructed as a rectified, truncated tetrahedron. It has 20 faces: 4 equilateral triangles, 12 isosceles triangles, and 4 regular hexagons.
Topologically, the triangles corresponding to the tetrahedron's vertices are always equilateral, although the hexagons, while having equal edge lengths, do not have the same edge lengths with the equilateral triangles, having different but alternating angles, causing the other triangles to be isosceles instead.
Related polyhedra
The rectified truncated tetrahedron can be seen in sequence of rectification and truncation operations from the tetrahedron. Further truncation, and alternation operations creates two more polyhedra:
See also
Rectified truncated cube
Rectified truncated octahedron
Rectified truncated dodecahedron
Rectified truncated icosahedron
References
Coxeter Regular Polytopes, Third edition, (1973), Dover edition, (pp. 145–154 Chapter 8: Truncation)
John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008,
External links
George Hart's Conway interpreter: generates polyhedra in VRML, taking Conway notation as input
Polyhedra |
https://en.wikipedia.org/wiki/Mikl%C3%B3s%20Kitl | Miklós Kitl (born 1 June 1997) is a Hungarian football player who plays for Siófok.
Statistics
Club
Updated to games played as of 9 December 2017
References
MLSZ
1997 births
Sportspeople from Senta
Footballers from North Banat District
Hungarians in Vojvodina
Living people
Hungarian men's footballers
Hungary men's youth international footballers
Men's association football midfielders
Kecskeméti TE players
Diósgyőri VTK players
Dorogi FC footballers
Békéscsaba 1912 Előre footballers
BFC Siófok players
Nemzeti Bajnokság I players
Nemzeti Bajnokság II players |
https://en.wikipedia.org/wiki/Krist%C3%B3f%20Poly%C3%A1k | Kristóf Polyák (born 28 September 1995 in Kecskemét) is a Hungarian football player who currently plays for Ceglédi VSE.
Club statistics
Updated to games played as of 15 October 2014.
References
1995 births
Living people
Footballers from Kecskemét
Hungarian men's footballers
Men's association football defenders
Budapest Honvéd FC players
Kecskeméti TE players
Szigetszentmiklósi TK footballers
Ceglédi VSE footballers
Tiszakécske FC footballers
Nemzeti Bajnokság I players
Nemzeti Bajnokság II players |
https://en.wikipedia.org/wiki/Symbolic%20power%20of%20an%20ideal | In algebra and algebraic geometry, given a commutative Noetherian ring and an ideal in it, the n-th symbolic power of is the ideal
where is the localization of at , we set is the canonical map from a ring to its localization, and the intersection runs through all of the associated primes of .
Though this definition does not require to be prime, this assumption is often worked with because in the case of a prime ideal, the symbolic power can be equivalently defined as the -primary component of . Very roughly, it consists of functions with zeros of order n along the variety defined by . We have: and if is a maximal ideal, then .
Symbolic powers induce the following chain of ideals:
Uses
The study and use of symbolic powers has a long history in commutative algebra. Krull’s famous proof of his principal ideal theorem uses them in an essential way. They first arose after primary decompositions were proved for Noetherian rings. Zariski used symbolic powers in his study of the analytic normality of algebraic varieties. Chevalley's famous lemma comparing topologies states that in a complete local domain the symbolic powers topology of any prime is finer than the m-adic topology. A crucial step in the vanishing theorem on local cohomology of Hartshorne and Lichtenbaum uses that for a prime defining a curve in a complete local domain, the powers of are cofinal with the symbolic powers of . This important property of being cofinal was further developed by Schenzel in the 1970s.
In algebraic geometry
Though generators for ordinary powers of are well understood when is given in terms of its generators as , it is still very difficult in many cases to determine the generators of symbolic powers of . But in the geometric setting, there is a clear geometric interpretation in the case when is a radical ideal over an algebraically closed field of characteristic zero.
If is an irreducible variety whose ideal of vanishing is , then the differential power of consists of all the functions in that vanish
to order ≥ n on , i.e.
Or equivalently, if is the maximal ideal for a point , .
Theorem (Nagata, Zariski) Let be a prime ideal in a polynomial ring over an algebraically closed field. Then
This result can be extended to any radical ideal. This formulation is very useful because, in characteristic zero, we can compute the differential powers in terms of generators as:
For another formulation, we can consider the case when the base ring is a polynomial ring over a field. In this case, we can interpret the n-th symbolic power as the sheaf of all function germs over
In fact, if is a smooth variety over a perfect field, then
Containments
It is natural to consider whether or not symbolic powers agree with ordinary powers, i.e. does hold? In general this is not the case. One example of this is the prime ideal . Here we have that . However, does hold and the generalization of this inclusion is well understood. Indeed, the containment f |
https://en.wikipedia.org/wiki/B%C3%A1lint%20B%C3%B6r%C3%B6czky | Bálint Böröczky (born 18 March 1994) is a Hungarian professional footballer who plays for FC Veszprém.
Club statistics
Updated to games played as of 18 November 2014.
References
External links
Profile at MLSZ
Profile at HLSZ
1994 births
Living people
People from Pápa
Hungarian men's footballers
Men's association football midfielders
Pápai FC footballers
Nemzeti Bajnokság I players
Footballers from Veszprém County |
https://en.wikipedia.org/wiki/Double%20lattice | In mathematics, especially in geometry, a double lattice in is a discrete subgroup of the group of Euclidean motions that consists only of translations and point reflections and such that the subgroup of translations is a lattice. The orbit of any point under the action of a double lattice is a union of two Bravais lattices, related to each other by a point reflection. A double lattice in two dimensions is a p2 wallpaper group. In three dimensions, a double lattice is a space group of the type , as denoted by international notation.
Double lattice packing
A packing that can be described as the orbit of a body under the action of a double lattice is called a double lattice packing. In many cases the highest known packing density for a body is achieved by a double lattice. Examples include the regular pentagon, heptagon, and nonagon and the equilateral triangular bipyramid.
Włodzimierz Kuperberg and Greg Kuperberg showed that all convex planar bodies can pack at a density of at least by using a double lattice.
In a preprint released in 2016, Thomas Hales and Wöden Kusner announced a proof that the double lattice packing of the regular pentagon has the optimal density among all packings of regular pentagons in the plane. This packing has been used as a decorative pattern in China since at least 1900, and in this context has been called the "pentagonal ice-ray". , the proof of its optimality has not yet been refereed and published.
It has been conjectured that, among all convex shapes, the regular heptagon has the lowest packing density for its optimal double lattice packing, but this remains unproven.
References
Crystallography
Lattice points |
https://en.wikipedia.org/wiki/Carolyn%20Eisele | Carolyn Eisele (June 13, 1902 – January 15, 2000) was an American mathematician and historian of mathematics known as an expert on the works of Charles Sanders Peirce.
Education and career
Eisele was born on June 13, 1902, in The Bronx, New York City.
She studied at Hunter College High School and then Hunter College, graduating Phi Beta Kappa in 1923.
She earned a master's degree in mathematics and education from Columbia University in 1925.
At that time, Columbia did not offer Ph.D.s in mathematics to women, but Eisele continued her graduate studies at the University of Chicago (where she studied differential geometry) and the University of Southern California before returning home to New York, without a doctorate, to care for her injured father. Her studies also included opera singing, with Jeanne Fourestier in Paris in 1931 and later with Los Angeles-based voice coach Morris Halpern, whom she married in 1943.
Eisele taught mathematics at Hunter College for nearly 50 years. She began teaching as an instructor there after her college graduation in 1923, eventually reached the rank of full professor in 1965, and retired in 1972.
Eisele died on January 15, 2000 in Manhattan, New York City.
Peirce studies
As a student at Columbia University, Eisele took a course in the history of mathematics from David Eugene Smith, but her professional contributions to the subject began in 1947, when she took a sabbatical to prepare for a course in the history of mathematics that she had been asked to teach at Hunter College. While working in the George Arthur Plimpton collection at the Columbia University library, she found a manuscript by Charles Sanders Peirce on Fibonacci's Liber Abaci and in 1951 she published a paper about her discovery in Scripta Mathematica. Other early works of Eisele on Peirce included his correspondence with Simon Newcomb and his Peirce quincuncial projection for maps of the world. Her work on Peirce took a holistic view, in which his contributions to philosophy and logic were treated as part of a whole together with his contributions to mathematics and science, rather than as separate and unrelated chapters in his life.
Eisele served as the president of the Charles S. Peirce Society from 1973 to 1975.
In 1976, Eisele began publishing a multi-volume collection of Peirce's writings that she had edited, the New Elements of Mathematics, and in the same year she helped organize the Peirce Bicentennial International Congress in Amsterdam.
Books
Studies in the Science and Mathematical Philosophy of Charles S. Peirce: Essays by Carolyn Eisele (1979)
Historical Perspectives on Peirce’s Logic of Science: A History of Science (1985)
Awards and honors
Eisele was named a Fellow of the American Association for the Advancement of Science in 1960.
On her retirement from Hunter College in 1972, Eisele joined the Hunter Hall of Fame. She was given honorary doctorates from Texas Tech University in 1980 and from Lehigh University in 1982.
In |
https://en.wikipedia.org/wiki/Convenient%20vector%20space | In mathematics, convenient vector spaces are locally convex vector spaces satisfying a very mild completeness condition.
Traditional differential calculus is effective in the analysis of finite-dimensional vector spaces and for Banach spaces. Beyond Banach spaces, difficulties begin to arise; in particular, composition of continuous linear mappings stop being jointly continuous at the level of Banach spaces, for any compatible topology on the spaces of continuous linear mappings.
Mappings between convenient vector spaces are smooth or if they map smooth curves to smooth curves. This leads to a Cartesian closed category of smooth mappings between -open subsets of convenient vector spaces (see property 6 below). The corresponding calculus of smooth mappings is called convenient calculus.
It is weaker than any other reasonable notion of differentiability, it is easy to apply, but there are smooth mappings which are not continuous (see Note 1).
This type of calculus alone is not useful in solving equations.
The c∞-topology
Let be a locally convex vector space. A curve is called smooth or if all derivatives exist and are continuous. Let be the space of smooth curves. It can be shown that the set of smooth curves does not depend entirely on the locally convex
topology of only on its associated bornology (system of bounded sets); see [KM], 2.11.
The final topologies with respect to the following sets of mappings into coincide; see [KM], 2.13.
The set of all Lipschitz curves (so that is bounded in for each ).
The set of injections where runs through all bounded absolutely convex subsets in and where is the linear span of equipped with the Minkowski functional
The set of all Mackey convergent sequences (there exists a sequence with bounded).
This topology is called the -topology on and we write for the resulting topological space.
In general (on the space of smooth functions with compact support on the real line, for example) it is finer than the given locally convex topology, it is not a vector space topology, since addition is no longer jointly continuous. Namely, even
The finest among all locally convex topologies on which are coarser than is the bornologification of the given locally convex topology. If is a Fréchet space, then
Convenient vector spaces
A locally convex vector space is said to be a convenient vector space if one of the following equivalent conditions holds (called -completeness); see [KM], 2.14.
For any the (Riemann-) integral exists in .
Any Lipschitz curve in is locally Riemann integrable.
Any scalar wise curve is : A curve is smooth if and only if the composition is in for all where is the dual of all continuous linear functionals on .
Equivalently, for all , the dual of all bounded linear functionals.
Equivalently, for all , where is a subset of which recognizes bounded subsets in ; see [KM], 5.22.
Any Mackey-Cauchy-sequence (i.e., for some in converges in . This is |
https://en.wikipedia.org/wiki/Chamfer%20%28geometry%29 | In geometry, chamfering or edge-truncation is a topological operator that modifies one polyhedron into another. It is similar to expansion, moving faces apart and outward, but also maintains the original vertices. For polyhedra, this operation adds a new hexagonal face in place of each original edge.
In Conway polyhedron notation it is represented by the letter . A polyhedron with edges will have a chamfered form containing new vertices, new edges, and new hexagonal faces.
Chamfered Platonic solids
In the chapters below the chamfers of the five Platonic solids are described in detail. Each is shown in a version with edges of equal length and in a canonical version where all edges touch the same midsphere. (They only look noticeably different for solids containing triangles.) The shown duals are dual to the canonical versions.
Chamfered tetrahedron
The chamfered tetrahedron (or alternate truncated cube) is a convex polyhedron constructed as an alternately truncated cube or chamfer operation on a tetrahedron, replacing its 6 edges with hexagons.
It is the Goldberg polyhedron GIII(2,0), containing triangular and hexagonal faces.
Chamfered cube
The chamfered cube is a convex polyhedron with 32 vertices, 48 edges, and 18 faces: 12 hexagons and 6 squares. It is constructed as a chamfer of a cube. The squares are reduced in size and new hexagonal faces are added in place of all the original edges. Its dual is the tetrakis cuboctahedron.
It is also inaccurately called a truncated rhombic dodecahedron, although that name rather suggests a rhombicuboctahedron. It can more accurately be called a tetratruncated rhombic dodecahedron because only the order-4 vertices are truncated.
The hexagonal faces are equilateral but not regular. They are formed by a truncated rhombus, have 2 internal angles of about 109.47°, or , and 4 internal angles of about 125.26°, while a regular hexagon would have all 120° angles.
Because all its faces have an even number of sides with 180° rotation symmetry, it is a zonohedron. It is also the Goldberg polyhedron GPIV(2,0) or {4+,3}2,0, containing square and hexagonal faces.
The chamfered cube is the Minkowski sum of a rhombic dodecahedron and a cube of side length 1 when eight vertices of the rhombic dodecahedron are at and its six vertices are at the permutations of .
A topological equivalent with pyritohedral symmetry and rectangular faces can be constructed by chamfering the axial edges of a pyritohedron. This occurs in pyrite crystals.
Chamfered octahedron
In geometry, the chamfered octahedron is a convex polyhedron constructed from the rhombic dodecahedron by truncating the 8 (order 3) vertices.
It can also be called a tritruncated rhombic dodecahedron, a truncation of the order-3 vertices of the rhombic dodecahedron.
The 8 vertices are truncated such that all edges are equal length. The original 12 rhombic faces become flattened hexagons, and the truncated vertices become triangles.
The hexagonal faces |
https://en.wikipedia.org/wiki/Chamfered%20square%20tiling | In geometry, the chamfered square tiling or semitruncated square tiling is a tiling of the Euclidean plane. It is a square tiling with each edge chamfered into new hexagonal faces.
It can also be seen as the intersection of two truncated square tilings with offset positions. And its appearance is similar to a truncated square tiling, except only half of the vertices have been truncated, leading to its descriptive name semitruncated square tiling.
Usage and Names in tiling patterns
In floor tiling, this pattern with small squares has been labeled as Metro Broadway Matte and alternate corner square tile.
With large squares it has been called a Dijon tile pattern.
As 3 rows of rectangles, it has been called a basketweave tiling and triple block tile pattern .
Variations
Variations can be seen in different degrees of truncation. As well, geometric variations exist within a given symmetry. The second row shows the tilings with a 45 degree rotation which also look a little different.
Lower symmetry forms are related to the cairo pentagonal tiling with axial edges expanded into rectangles.
The chiral forms be seen as two overlapping pythagorean tilings.
Semikis square tiling
The dual tiling looks like a square tiling with half of the squares divided into central triangles. It can be called a semikis square tiling, as alternate squares with kis operator applied. It can be seen as 4 sets of parallel lines.
References
Euclidean tilings |
https://en.wikipedia.org/wiki/Electronic%20Journal%20of%20Statistics | The Electronic Journal of Statistics is an open access peer-reviewed scientific journal published by the Institute of Mathematical Statistics and the Bernoulli Society. It covers all aspects of statistics (theoretical, computational, and applied) and the editor-in-chief is Domenico Marinucci. According to the Journal Citation Reports, the journal has a 2013 impact factor of 1.024. By 2017, the impact factor was recorded as 1.529.
References
External links
Statistics journals
English-language journals
Academic journals established in 2007
Creative Commons Attribution-licensed journals
Institute of Mathematical Statistics academic journals
Online-only journals |
https://en.wikipedia.org/wiki/Prime%20avoidance%20lemma | In algebra, the prime avoidance lemma says that if an ideal I in a commutative ring R is contained in a union of finitely many prime ideals Pi's, then it is contained in Pi for some i.
There are many variations of the lemma (cf. Hochster); for example, if the ring R contains an infinite field or a finite field of sufficiently large cardinality, then the statement follows from a fact in linear algebra that a vector space over an infinite field or a finite field of large cardinality is not a finite union of its proper vector subspaces.
Statement and proof
The following statement and argument are perhaps the most standard.
Statement: Let E be a subset of R that is an additive subgroup of R and is multiplicatively closed. Let be ideals such that are prime ideals for . If E is not contained in any of 's, then E is not contained in the union .
Proof by induction on n: The idea is to find an element that is in E and not in any of 's. The basic case n = 1 is trivial. Next suppose n ≥ 2. For each i, choose
where the set on the right is nonempty by inductive hypothesis. We can assume for all i; otherwise, some avoids all the 's and we are done. Put
.
Then z is in E but not in any of 's. Indeed, if z is in for some , then is in , a contradiction. Suppose z is in . Then is in . If n is 2, we are done. If n > 2, then, since is a prime ideal, some is in , a contradiction.
E. Davis' prime avoidance
There is the following variant of prime avoidance due to E. Davis.
Proof: We argue by induction on r. Without loss of generality, we can assume there is no inclusion relation between the 's; since otherwise we can use the inductive hypothesis.
Also, if for each i, then we are done; thus, without loss of generality, we can assume . By inductive hypothesis, we find a y in J such that . If is not in , we are done. Otherwise, note that (since ) and since is a prime ideal, we have:
.
Hence, we can choose in that is not in . Then, since , the element has the required property.
Application
Let A be a Noetherian ring, I an ideal generated by n elements and M a finite A-module such that . Also, let = the maximal length of M-regular sequences in I = the length of every maximal M-regular sequence in I. Then ; this estimate can be shown using the above prime avoidance as follows. We argue by induction on n. Let be the set of associated primes of M. If , then for each i. If , then, by prime avoidance, we can choose
for some in such that = the set of zerodivisors on M. Now, is an ideal of generated by elements and so, by inductive hypothesis, . The claim now follows.
Notes
References
Mel Hochster, Dimension theory and systems of parameters, a supplementary note
Algebra |
https://en.wikipedia.org/wiki/Heptagonal%20tiling%20honeycomb | In the geometry of hyperbolic 3-space, the heptagonal tiling honeycomb or 7,3,3 honeycomb a regular space-filling tessellation (or honeycomb). Each infinite cell consists of a heptagonal tiling whose vertices lie on a 2-hypercycle, each of which has a limiting circle on the ideal sphere.
Geometry
The Schläfli symbol of the heptagonal tiling honeycomb is {7,3,3}, with three heptagonal tilings meeting at each edge. The vertex figure of this honeycomb is a tetrahedron, {3,3}.
Related polytopes and honeycombs
It is a part of a series of regular polytopes and honeycombs with {p,3,3} Schläfli symbol, and tetrahedral vertex figures:
It is a part of a series of regular honeycombs, {7,3,p}.
It is a part of a series of regular honeycombs, with {7,p,3}.
Octagonal tiling honeycomb
In the geometry of hyperbolic 3-space, the octagonal tiling honeycomb or 8,3,3 honeycomb a regular space-filling tessellation (or honeycomb). Each infinite cell consists of an octagonal tiling whose vertices lie on a 2-hypercycle, each of which has a limiting circle on the ideal sphere.
The Schläfli symbol of the octagonal tiling honeycomb is {8,3,3}, with three octagonal tilings meeting at each edge. The vertex figure of this honeycomb is an tetrahedron, {3,3}.
Apeirogonal tiling honeycomb
In the geometry of hyperbolic 3-space, the apeirogonal tiling honeycomb or ∞,3,3 honeycomb a regular space-filling tessellation (or honeycomb). Each infinite cell consists of an apeirogonal tiling whose vertices lie on a 2-hypercycle, each of which has a limiting circle on the ideal sphere.
The Schläfli symbol of the apeirogonal tiling honeycomb is {∞,3,3}, with three apeirogonal tilings meeting at each edge. The vertex figure of this honeycomb is an tetrahedron, {3,3}.
The "ideal surface" projection below is a plane-at-infinity, in the Poincare half-space model of H3. It shows an Apollonian gasket pattern of circles inside a largest circle.
See also
Convex uniform honeycombs in hyperbolic space
List of regular polytopes
References
Coxeter, Regular Polytopes, 3rd. ed., Dover Publications, 1973. . (Tables I and II: Regular polytopes and honeycombs, pp. 294–296)
The Beauty of Geometry: Twelve Essays (1999), Dover Publications, , (Chapter 10, Regular Honeycombs in Hyperbolic Space ) Table III
Jeffrey R. Weeks The Shape of Space, 2nd edition (Chapters 16–17: Geometries on Three-manifolds I,II)
George Maxwell, Sphere Packings and Hyperbolic Reflection Groups, JOURNAL OF ALGEBRA 79,78-97 (1982)
Hao Chen, Jean-Philippe Labbé, Lorentzian Coxeter groups and Boyd-Maxwell ball packings, (2013)
Visualizing Hyperbolic Honeycombs arXiv:1511.02851 Roice Nelson, Henry Segerman (2015)
External links
John Baez, Visual insights: {7,3,3} Honeycomb (2014/08/01) {7,3,3} Honeycomb Meets Plane at Infinity (2014/08/14)
Danny Calegari, Kleinian, a tool for visualizing Kleinian groups, Geometry and the Imagination 4 March 2014.
Honeycombs (geometry)
Heptagonal tilings |
https://en.wikipedia.org/wiki/Fernando%20Cod%C3%A1%20Marques | Fernando Codá dos Santos Cavalcanti Marques (born 8 October 1979) is a Brazilian mathematician working mainly in geometry, topology, partial differential equations and Morse theory. He is a professor at Princeton University. In 2012, together with André Neves, he proved the Willmore conjecture.
Biography
Fernando Codá Marques was born on 8 October 1979 in São Carlos and grew up in Maceió. His parents were both professors of engineering.
Codá Marques started as a student of civil engineering at the Federal University of Alagoas in 1996, but switched to mathematics after two years.
He obtained a master's degree from the Instituto Nacional de Matemática Pura e Aplicada (IMPA) in 1999. Among his teachers at the IMPA were Manfredo do Carmo and Elon Lages Lima.
Following the advice of Manfredo do Carmo, Codá Marques went to Cornell University to learn geometric analysis from José F. Escobar, so that he could return and bring this area of research to Brazil. While still in Brazil, Codá Marques had been informed that Escobar was facing cancer and that he could maybe die before Codá Marques could complete his Ph.D. with him. Despite this information, Codá Marques decided to keep the arrangement and became his student.
In 2001, Codá Marques was awarded Cornell's Battig Prize for graduate students, for "excellence and promise in mathematics". He obtained his Ph.D. from Cornell University in 2003, under the supervision of José F. Escobar (thesis: Existence and Compactness Theorems on Conformal Deformation of Metrics).
Despite the usual path being to go for a postdoctoral research, Codá Marques had in mind that his mission was to return to Brazil. IMPA had already offered him a position of researcher, and he accepted it. But after six months in Brazil, Escobar, who was his main connection with researchers outside of Brazil, died. Codá Marques faced the difficulties of doing research in isolation, so he decided to accept an invitation to stay one year as a postdoc at Stanford University. There he was influenced by Richard Schoen's school of thought in geometry and met André Neves (who would become his main collaborator), and many other of his contacts.
He worked at IMPA from 2003 to 2014.
On 1 September 2014, Codá Marques joined Princeton University as a full professor.
Antoine Song was a student of his.
Mathematical work
Some of his best known works are the following:
Yamabe problem
In 2009, together with Richard Schoen and Marcus Khuri he did important work on the Yamabe problem. He solved Schoen's conjecture on compactness in the Yamabe problem for spin manifolds.
Rigidity conjecture of Min-Oo
In April 2010, in cooperation with Simon Brendle and André Neves, Marques provided a counter-example to the rigidity conjecture of Min-Oo.
Willmore conjecture
Codá Marques and Neves "Min-max theory and the Willmore conjecture" was uploaded to arXiv in February 2012, in it they solved the Willmore conjecture, using Almgren–Pitts min-max theory, whic |
https://en.wikipedia.org/wiki/Approximation%20property%20%28ring%20theory%29 | In algebra, a commutative Noetherian ring A is said to have the approximation property with respect to an ideal I if each finite system of polynomial equations with coefficients in A has a solution in A if and only if it has a solution in the I-adic completion of A. The notion of the approximation property is due to Michael Artin.
See also
Artin approximation theorem
Popescu's theorem
Notes
References
Ring theory |
https://en.wikipedia.org/wiki/Saeed%20Ghaedifar | Saeed Ghaedifar is a defender who played for Fajr Sepasi in the Azadegan League.
Club career statistics
Last Update: 1 August 2014
Honours
Club
Sepahan
Iran Pro League (1): 2014–15
References
Sepahan S.C. footballers
Khooshe Talaei Saveh F.C. players
1992 births
Living people
People from Yasuj
Iranian men's footballers
Men's association football fullbacks |
https://en.wikipedia.org/wiki/Annals%20of%20the%20Institute%20of%20Statistical%20Mathematics | Annals of the Institute of Statistical Mathematics (AISM) is a bimonthly peer-reviewed scientific journal covering statistics. It was established in 1949 and is published by Springer Science+Business Media on behalf of Institute of Statistical Mathematics. The editor-in-chief is Yoshiyuki Ninomiya (Institute of Statistical Mathematics). According to the Journal Citation Reports, the journal has a 2020 impact factor of 1.267.
References
External links
Journal Office (delayed open access)
Statistics journals
Academic journals established in 1949
Bimonthly journals
Springer Science+Business Media academic journals
English-language journals |
https://en.wikipedia.org/wiki/Deryk%20Osthus | Deryk Osthus is the Professor of Graph Theory at the School of Mathematics, University of Birmingham. He is known for his research in combinatorics, predominantly in extremal and probabilistic graph theory.
Career
Osthus earned a B.A. in mathematics from Cambridge University in 1996, followed by the Certificate of Advanced Studies in Mathematics (Part III) from Cambridge in 1997. He earned a PhD in theoretical computer science from Humboldt University of Berlin in 2000. From 2000 until 2004, he was a postdoctoral researcher in Berlin. He joined Birmingham University in 2004 as a lecturer. Working at the Birmingham University from 2004 to a 2010 as lecturer, Deryk was a promoted in 2010 to a senior lecturer. From 2011 to 2012, he was a reader in graph theory. He was appointed Professor in Graph Theory in 2012.
Awards and honours
Together with Daniela Kühn and Alain Plagne, he was one of the first winners of the European Prize in Combinatorics in 2003. Together with Kühn, he was a recipient of the 2014 Whitehead Prize of the London Mathematical Society for "their many results in extremal graph theory and related areas. Several of their papers resolve long-standing open problems in the area." In 2014, he was also invited to a lecture at the International Congress of Mathematics in Seoul.
Grants
With the variety of intense research that Deryk Osthus was interested in, many grants were needed to conduct, analyze, and publish the research and publications that Deryk Osthus wanted to figure out, and gain more reliable and valid information on graph theories and other detailed areas. Throughout the years starting from the mid 2000's, many grants were accepted and given to Deryk Osthus in order to complete his research interests and potentially answer any research questions. In August 2007, Deryk Osthus was given his first grant for "Graph expansion and applications." Two months later, in October 2007 he was given another grant for "The regularity method for directed graphs." 3 years later in October 2010, he was given a grant for "Problems in Extremal Graph Theory." In June 2012, he had received a grant for "Edge-colourings and Hamilton decompositions of graphs." A few months later in December 2012, another grant was given to Deryk for "Asymptotic properties of graphs." 3 years later In March 2015, he received a grant for "Randomized approaches to combinatorial packing and covering problems." From January 2019 to the current date, he was given a grant for "Approximate structure in large graphs and hypergraphs."
Research Interests
With an education stemming back From the late 90's and early 2000's, Deryk Osthus had many areas of interest in the field of research. Deryk Osthus has done a variety of research in his area of interest, which resulted in a variety of different publications. Deryk's research interests are in extremal graph theory, random graphs, randomized algorithms, structural graph theory as well as Ramsey theory. His recent research h |
https://en.wikipedia.org/wiki/Miguel%20Walsh | Miguel Nicolás Walsh is an Argentine mathematician working in number theory and ergodic theory. He has previously held a Clay Research Fellowship and was a fellow of Merton College at the University of Oxford. He is a professor of mathematics at the University of Buenos Aires.
He received the MCA Prize in 2013. In 2014, he was awarded the ICTP Ramanujan Prize for his contributions to mathematics. He is the youngest recipient to date of both awards.
In June 2017 Walsh was invited to present his research at the 2018 International Congress of Mathematicians in Rio de Janeiro, Brazil.
Selected publications
References
External links
Walsh's homepage at the University of Oxford
lanacion.com – El matemático argentino Miguel Walsh, de 26 años, ganó el premio Ramanujan (in Spanish)
mincyt – Interview with Miguel Walsh
ICTP – 2014 Ramanujan Prize Announced
Argentine mathematicians
1987 births
Living people
Fellows of Merton College, Oxford
University of Buenos Aires alumni
Number theorists |
https://en.wikipedia.org/wiki/Kim%20Min-sung%20%28baseball%29 | Kim Min-sung (born December 17, 1988) is South Korean professional baseball infielder for the LG Twins of the KBO League.
References
External links
Career statistics and player information from the KBO League
Kim Min-sung at heroes-baseball.co.kr
Kiwoom Heroes players
Lotte Giants players
KBO League infielders
South Korean baseball players
Baseball players from Seoul
1988 births
Living people
Asian Games medalists in baseball
Baseball players at the 2014 Asian Games
Medalists at the 2014 Asian Games
Asian Games gold medalists for South Korea |
https://en.wikipedia.org/wiki/Anita%20Straker | Anita Straker is a British mathematics educator who became president of the Mathematical Association for the 1986 term.
After teaching maths in schools, Straker became a maths advisor for the county of Wiltshire in the UK and then a school inspector. She went on to pioneer computers in schools from within the UK Department for Education and Employment.
In the 1980s the only primary school software available was American, so she started writing her own programs. She wrote the educational text adventure games Mallory Manor (1983), Merlin's Castle (1984), Zoo (1984), Martello Tower (1986) and Puff (1986) for the BBC Micro.
In the 1990s, she designed the National Numeracy Strategy for primary school children in the UK for which she was honoured with the CB and the OBE.
She has written several maths textbooks.
References
British mathematicians
Women mathematicians
Mathematics educators
British educational theorists
Video game developers
Living people
Women video game developers
Officers of the Order of the British Empire
Companions of the Order of the Bath
Place of birth missing (living people)
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Royal%20Dutch%20Mathematical%20Society | The Royal Dutch Mathematical Society (Koninklijk Wiskundig Genootschap in Dutch, abbreviated as KWG) was founded in 1778. Its goal is to promote the development of mathematics, both from a theoretical and applied point of view.
The society publishes the quarterly journal Nieuw Archief voor Wiskunde, the magazine Pythagoras, wiskundetijdschrift voor jongeren for high school children, and the scientific journal Indagationes Mathematicae.
Each year the society organizes a winter symposium for high school teachers. Biannually Koninklijk Wiskundig Genootschap organizes the Dutch Mathematical Congress. Once every three years, the society awards the prestigious Brouwer Medal to a distinguished mathematician. This medal is named after L. E. J. Brouwer.
Honorary members
Institutional members
The society has the following institutional members:
Centrum Wiskunde & Informatica
Delft University of Technology
Eindhoven University of Technology
Leiden University
Radboud University Nijmegen
University of Amsterdam:
Institute for Logic, Language and Computation
Korteweg-de Vries Institute for Mathematics
University of Groningen
Utrecht University
Vrije Universiteit Amsterdam
References
External links
Mathematical societies
Learned societies of the Netherlands
Organizations established in 1778
Organisations based in the Netherlands with royal patronage |
https://en.wikipedia.org/wiki/Liebmann%20Hersch | Pesach Liebmann Hersch (25 May 1882 – 9 June 1955), also Liebman Hersh (), was a professor of demography and statistics at the University of Geneva, and an intellectual of the Jewish Labor Bund, whose pioneering work on Jewish migration achieved international recognition in the period after the First World War.
Biography
Liebmann Hersch was born in the small Lithuanian town of Pamūšis, in the district of Šiauliai, in what was then the Russian Empire. He was the son of Meyer Dovid Hersch (1858–1933) and Hannah-Dvorah Hersch (née Blumberg; 1860–1890). Liebmann's father was a maskil and a journalist who published articles in various Hebrew journals, including Ha-Maggid and Ha-Melitz. Liebmann was the oldest of six sons. Within a year or two of his birth his family moved to his father's hometown of Joniškis (Yanishok), where a younger brother was born, in 1884. Subsequently, they moved again, to Šiauliai (Shavel), his mother's hometown, where, between 1886 and 1890, four more sons were born. Liebmann's mother died in 1890, at the age of 30, seven weeks after giving birth to her youngest child.
In 1891 Meyer Dovid Hersch traveled to South Africa, where he worked as a correspondent for the Hebrew press in Eastern Europe. During their father's four-year sojourn in South Africa Liebmann and his brothers were in the care of a teacher in the town. Liebmann's father returned to Šiauliai in 1895, and remarried the same year. He and his second wife, Ita Melamed Hersch (1871–1958), moved with their family to Warsaw, where Liebmann attended high school, and participated in Zionist youth activities.
Liebmann Hersch studied mathematics at the University of Warsaw. Because of his involvement in anti-Czarist political activity Hersch was eventually forced to flee Warsaw. He moved to Geneva in 1904. In 1905 he joined the Jewish socialist party—the General Union of Jewish Workers in Lithuania, Poland and Russia (Yiddish: Algemeyner Yidisher Arbeter Bund), also known as the Jewish Labor Bund, or simply the Bund—that had been founded in 1897. Influenced by the debates within the Bund about the economic and political future of the Jews in Eastern Europe, Hersch pursued research on the causes and characteristics of Jewish emigration.
At the University of Geneva, Liebmann Hersch studied sociology. He became an instructor in the department of statistics and demography in 1909, and went on to complete his dissertation, which was published in French in 1913 as Le Juif errant d'aujourd'hui (The wandering Jew today). A revised edition was published the following year in Yiddish as Di yudishe emigratsie (Jewish emigration). He subsequently spent his entire professional career in Geneva.
In connection with his Bundist activities, Hersch published articles on political and social issues in the Yiddish, Polish and Russian press, with a focus on emigration and the problems of Jewish nationalism.
In the period following World War I, by which time he was a professor at the Un |
https://en.wikipedia.org/wiki/Jorge%20Hankamer | Jorge Hankamer is Professor of Linguistics at the University of California, Santa Cruz, where he is also chair of the Philosophy department. He earned his B.A. in Mathematics and Physics and M.A. in German Literature at Rice University before going on to complete a Ph.D in linguistics at Yale University. His dissertation, Constraints on Deletion in Syntax, has since been published under the title "Deletion in Coordinate Structures" by the Harvard University Press's Outstanding Dissertations in Linguistics Series. A student of David Perlmutter, Hankamer has been one of the leading experts on the syntax of ellipsis, coordination and anaphora since the publication of his doctoral dissertation and his early work with Ivan Sag on Deep and Surface Anaphors. His keçi system (from the Turkish word for goat) is an early top-down morphological parser for Turkish.
References
External links
Jorge Hankamer's homepage
UCSC Linguistics
University of California, Santa Cruz faculty
Rice University alumni
Living people
Syntacticians
Year of birth missing (living people)
Linguists from the United States
Fellows of the Linguistic Society of America
Yale University alumni |
https://en.wikipedia.org/wiki/Quantification%20%28science%29 | In mathematics and empirical science, quantification (or quantitation) is the act of counting and measuring that maps human sense observations and experiences into quantities. Quantification in this sense is fundamental to the scientific method.
Natural science
Some measure of the undisputed general importance of quantification in the natural sciences can be gleaned from the following comments:
"these are mere facts, but they are quantitative facts and the basis of science."
It seems to be held as universally true that "the foundation of quantification is measurement."
There is little doubt that "quantification provided a basis for the objectivity of science."
In ancient times, "musicians and artists ... rejected quantification, but merchants, by definition, quantified their affairs, in order to survive, made them visible on parchment and paper."
Any reasonable "comparison between Aristotle and Galileo shows clearly that there can be no unique lawfulness discovered without detailed quantification."
Even today, "universities use imperfect instruments called 'exams' to indirectly quantify something they call knowledge."
This meaning of quantification comes under the heading of pragmatics.
In some instances in the natural sciences a seemingly intangible concept may be quantified by creating a scale—for example, a pain scale in medical research, or a discomfort scale at the intersection of meteorology and human physiology such as the heat index measuring the combined perceived effect of heat and humidity, or the wind chill factor measuring the combined perceived effects of cold and wind.
Social sciences
In the social sciences, quantification is an integral part of economics and psychology. Both disciplines gather data – economics by empirical observation and psychology by experimentation – and both use statistical techniques such as regression analysis to draw conclusions from it.
In some instances a seemingly intangible property may be quantified by asking subjects to rate something on a scale—for example, a happiness scale or a quality-of-life scale—or by the construction of a scale by the researcher, as with the index of economic freedom. In other cases, an unobservable variable may be quantified by replacing it with a proxy variable with which it is highly correlated—for example, per capita gross domestic product is often used as a proxy for standard of living or quality of life.
Frequently in the use of regression, the presence or absence of a trait is quantified by employing a dummy variable, which takes on the value 1 in the presence of the trait or the value 0 in the absence of the trait.
Quantitative linguistics is an area of linguistics that relies on quantification. For example, indices of grammaticalization of morphemes, such as phonological shortness, dependence on surroundings, and fusion with the verb, have been developed and found to be significantly correlated across languages with stage of evolution of function of the |
https://en.wikipedia.org/wiki/List%20of%20ACF%20Fiorentina%20records%20and%20statistics | ACF Fiorentina is an Italian football team based in Florence, founded in 1926.
The list encompasses the major honours won by Fiorentina and the records set by the players and the club.
Honours
National titles
Serie A:
Winners (2) : 1955–56; 1968–69
Runners-up (5): 1956–57; 1957–58; 1958–59; 1959–60; 1981–82
Coppa Italia:
Winners (6) : 1939–40; 1960–61; 1965–66; 1974–75; 1995–96; 2000–01
Runners-up (5): 1958, 1959–60, 1998–99, 2013–14, 2022–23
Supercoppa Italiana:
Winners (1) : 1996
Runners-up (1): 2001
European titles
European Cup:
Runners-up (1): 1956–57
UEFA Cup Winners' Cup:
Winners (1) : 1960–61
Runners-up (1): 1961–62
UEFA Cup:
Runners-up (1): 1989–90
UEFA Europa Conference League:
Runners-up (1): 2022–23
Minor titles
Coppa Grasshoppers
Winners (1) : 1957
Mitropa Cup
Winners (1) : 1966
Anglo-Italian League Cup
Winners (1) : 1975
Serie B
Winners: 1930–31; 1938–39; 1993–94
Serie C2 (as Florentia Viola)
Winners: 2002–03
Serie A record by opponent
Following is a table detailing ACF Fiorentina's record against each opponent in Serie A. It includes only results from seasons disputed in a single group round robin format. The data is updated to the end of the 2014-15 season.
ACF Fiorentina in European competitions
Player records
Appearances
Only including appearances in competitive matches, including substitutes.
Most appearances in all competitions
Most appearances in Serie A
Goalscorers
Only including goals scored in competitive matches, including substitutes.
Top goalscorers in all official competitions
Top goalscorers in Serie A
Club records
Biggest home win:
8–0 v Modena (1941–42)
Biggest home defeat:
0–5 v Juventus (2011–12)
Biggest away win:
7–1 v Atalanta (1963–64)
Biggest away defeat:
0–8 v Juventus (1952–53)
Most points in a season:
70 (2012–13)
Fewest points in a season:
15 (1937–38)
Most wins in a season:
22 (2005–06)
Fewest wins in a season:
3 (1937–38 & 1970–71)
Most defeats in a season:
22 (2001–02)
Fewest defeats in a season:
1 (1955–56 & 1968–69)
Most goals in a season:
95 (1958–59)
Fewest goals in a season:
26 (1970–71 & 1978–79)
Most goals conceded in a season:
69 (1946–47)
Fewest goals conceded in a season:
17 (1981–82)
First Italian club to play in a European Cup final, in the 1956–57 European Cup.
First Italian club to win an official UEFA competition, in the 1960–61 European Cup Winners' Cup.
References
Fiorentina
ACF Fiorentina |
https://en.wikipedia.org/wiki/Murnaghan%E2%80%93Nakayama%20rule | In group theory, a branch of mathematics, the Murnaghan–Nakayama rule, named after Francis Murnaghan and Tadashi Nakayama, is a combinatorial method to compute irreducible character values of a symmetric group.
There are several generalizations of this rule beyond the representation theory of symmetric groups, but they are not covered here.
The irreducible characters of a group are of interest to mathematicians because they concisely summarize important information about the group, such as the dimensions of the vector spaces in which the elements of the group can be represented by linear transformations that “mix” all the dimensions. For many groups, calculating irreducible character values is very difficult; the existence of simple formulas is the exception rather than the rule.
The Murnaghan–Nakayama rule is a combinatorial rule for computing symmetric group character values χ using a particular kind of Young tableaux.
Here λ and ρ are both integer partitions of some integer n, the order of the symmetric group under consideration. The partition λ specifies the irreducible character, while the partition ρ specifies the conjugacy class on whose group elements the character is evaluated to produce the character value. The partitions are represented as weakly decreasing tuples; for example, two of the partitions of 8 are (5,2,1) and (3,3,1,1).
There are two versions of the Murnaghan-Nakayama rule, one non-recursive and one recursive.
Non-recursive version
Theorem:
where the sum is taken over the set BST(λ,ρ) of all border-strip tableaux of shape λ and type ρ.
That is, each tableau T is a tableau such that
the k-th row of T has λk boxes
the boxes of T are filled with integers, with the integer i appearing ρi times
the integers in every row and column are weakly increasing
the set of squares filled with the integer i form a border strip, that is, a connected skew-shape with no 2×2-square.
The height, ht(T), is the sum of the heights of the border strips in T. The height of a border strip is one less than the number of
rows it touches.
It follows from this theorem that the character values of a symmetric group are integers.
For some combinations of λ and ρ, there are no border-strip tableaux. In this case, there are no terms in the sum and therefore the character value is zero.
Example
Consider the calculation of one of the character values for the symmetric group of order 8, when λ is the partition (5,2,1) and ρ is the partition (3,3,1,1). The shape partition λ specifies that the tableau must have three rows, the first having 5 boxes, the second having 2 boxes, and the third having 1 box. The type partition ρ specifies that the tableau must be filled with three 1's, three 2's, one 3, and one 4. There are six such border-strip tableaux:
If we call these , , , , , and , then their heights are
and the character value is therefore
Recursive version
Theorem:
where the sum is taken over the set BS(λ,ρ1) of border strips within the Yo |
https://en.wikipedia.org/wiki/List%20of%20career%20achievements%20by%20Shaquille%20O%27Neal | This page details the records, statistics, and other achievements pertaining to Shaquille O'Neal.
NBA career statistics
Regular season
|-
| style="text-align:left;"|
| style="text-align:left;"| Orlando
| 81 || 81 || 37.9 || .562 || .000 || .592 || 13.9 || 1.9 || .7 || 3.5 || 23.4
|-
| style="text-align:left;"|
| style="text-align:left;"| Orlando
| 81 || 81 || 39.8 || .599 || .000 || .554 || 13.2 || 2.4 || .9 || 2.9 || 29.3
|-
| style="text-align:left;"|
| style="text-align:left;"| Orlando
| 79 || 79 || 37.0 || .583 || .000 || .533 || 11.4 || 2.7 || .9 || 2.4 || 29.3
|-
| style="text-align:left;"|
| style="text-align:left;"| Orlando
| 54 || 52 || 36.0 || .573 || .500 || .487 || 11.0 || 2.9 || .6 || 2.1 || 26.6
|-
| style="text-align:left;"|
| style="text-align:left;"| L.A. Lakers
| 51 || 51 || 38.1 || .557 || .000 || .484 || 12.5 || 3.1 || .9 || 2.9 || 26.2
|-
| style="text-align:left;"|
| style="text-align:left;"| L.A. Lakers
| 60 || 57 || 36.3 || .584 || .000 || .527 || 11.4 || 2.4 || .7 || 2.4 || 28.3
|-
| style="text-align:left;"|
| style="text-align:left;"| L.A. Lakers
| 49 || 49 || 34.8 || .576 || .000 || .540 || 10.7 || 2.3 || .7 || 1.7 || 26.3
|-
|style="text-align:left;background:#afe6ba;"| †
| style="text-align:left;"| L.A. Lakers
| 79 || 79 || 40.0 || .574 || .000 || .524 || 13.6 || 3.8 || .5 || 3.0 || 29.7
|-
|style="text-align:left;background:#afe6ba;"| †
| style="text-align:left;"| L.A. Lakers
| 74 || 74 || 39.5 || .572 || .000 || .513 || 12.7 || 3.7 || .6 || 2.8 || 28.7
|-
|style="text-align:left;background:#afe6ba;"| †
| style="text-align:left;"| L.A. Lakers
| 67 || 66 || 36.1 || .579 || .000 || .555 || 10.7 || 3.0 || .6 || 2.0 || 27.2
|-
| style="text-align:left;"|
| style="text-align:left;"| L.A. Lakers
| 67 || 66 || 37.8 || .574 || .000 || .622 || 11.1 || 3.1 || .6 || 2.4 || 27.5
|-
| style="text-align:left;"|
| style="text-align:left;"| L.A. Lakers
| 67 || 67 || 36.8 || .584 || .000 || .490 || 11.5 || 2.9 || .5 || 2.5 || 21.5
|-
| style="text-align:left;"|
| style="text-align:left;"| Miami
| 73 || 73 || 34.1 || .601 || .000 || .461 || 10.4 || 2.7 || .5 || 2.3 || 22.9
|-
|style="text-align:left;background:#afe6ba;"| †
| style="text-align:left;"| Miami
| 59 || 58 || 30.6 || .600 || .000 || .469 || 9.2 || 1.9 || .4 || 1.8 || 20.0
|-
| style="text-align:left;"|
| style="text-align:left;"| Miami
| 40 || 39 || 28.4 || .591 || .000 || .422 || 7.4 || 2.0 || .2 || 1.4 || 17.3
|-
| style="text-align:left;"|
| style="text-align:left;"| Miami
| 33 || 33 || 28.6 || .581 || .000 || .494 || 7.8 || 1.4 || .6 || 1.6 || 14.2
|-
| style="text-align:left;"|
| style="text-align:left;"| Phoenix
| 28 || 28 || 28.7 || .611 || .000 || .513 || 10.6 || 1.7 || .5 || 1.2 || 12.9
|-
| style="text-align:left;"|
| style="text-align:left;"| Phoenix
| 75 || 75 || 30.0 || .609 || .000 || .595 || 8.4 || 1.7 || .6 || 1.4 || 17.8
|-
| style="text-align:left;"|
| style="text-align:left;"| Cleveland
| 53 || 53 || 23.4 || .566 || .000 || .496 || 6.7 |
https://en.wikipedia.org/wiki/Howard%20Gobioff | Howard Gobioff (1971 – 2008) was a computer scientist. He graduated magna cum laude with a double major in computer science and mathematics from the University of Maryland, College Park. At Carnegie Mellon University, he worked on the network attached secure disks project, before he went on to earn his PhD in computer science. He died suddenly from lymphoma at the age of 36.
Career
In 1999, Gobioff went to work for Google, which was then just a 40-person startup. As a software engineer, he worked on the advertising system and the crawling and indexing system. In 2004, as a Google engineering director, he launched and led their Tokyo research and development center.
Google File System
Gobioff was one of the architects of the Google File System, a proprietary distributed file system developed by Google for its own use. In "The Google File System," the seminal paper about the software, Gobioff and his co-authors outlined their design, reported measurements, and presented real world use of the system.
Apache Hadoop's MapReduce and Hadoop Distributed File System components were originally derived respectively from Google's MapReduce and Google File System papers. Using the Google File System and MapReduce, or the Hadoop Distributed File System and MapReduce, a project can perform a computation over 300 Tbytes of data using 1,000 nodes, which previously would have been unachievable for most projects.
Gobioff Foundation
The Gobioff Foundation was founded by Howard Gobioff in 2007, months before his sudden death in March 2008. His directive was to "make the world a better place." The Foundation funds the same causes that Gobioff himself supported and awards grants and microgrants in the fields of arts and human rights.
Among other initiatives, the Gobioff Foundation supported the Think Small to Think Big arts microgrant program in Tampa, Florida, which funded nearly 50 projects in the fields of dance, theater, installation, performance, sculpture, painting, jazz, punk rock, film, and digital art between 2011 and 2014.
In 2014, the Gobioff Foundation joined a team of Florida grantmakers led by the Florida Philanthropic Network on Capitol Hill to meet with Florida's congressional delegation to discuss local philanthropic efforts and related legislative and public policy issues. These meetings were part of the annual Foundations on the Hill event organized by the Forum of Regional Associations of Grantmakers, in partnership with the Council on Foundations and the Alliance for Charitable Reform.
U.S. patents
Gobioff was registered as co-inventor on 11 U.S. patents during his lifetime and post-mortem.
United States Patent 7065618 – Ghemawat, Gobioff, & Leung (2006). Leasing scheme for data-modifying operations.
United States Patent 7107419 – Ghemawat, Gobioff, Leung, & Desjardins (2006). Systems and methods for performing record append operations.
United States Patent 7222119 – Ghemawat, Gobioff, & Leung (2007). Namespace locking scheme.
United Sta |
https://en.wikipedia.org/wiki/Amoeba%20order | In mathematics, the amoeba order is the partial order of open subsets of 2ω of measure less than 1/2, ordered by reverse inclusion. Amoeba forcing is forcing with the amoeba order; it adds a measure 1 set of random reals.
There are several variations, where 2ω is replaced by the real numbers or a real vector space or the unit interval, and the number 1/2 is replaced by some positive number ε.
The name "amoeba order" come from the fact that a subset in the amoeba order can "engulf" a measure zero set by extending a "pseudopod" to form a larger subset in the order containing this measure zero set, which is analogous to the way an amoeba eats food.
The amoeba order satisfies the countable chain condition.
References
Order theory
Forcing (mathematics) |
https://en.wikipedia.org/wiki/Centipede%20mathematics | Centipede mathematics is a term used, sometimes derogatorily, to describe the generalisation and study of mathematical objects satisfying progressively fewer and fewer restrictions. This type of study is likened to studying how a centipede behaves when its legs are removed one by one.
The term is attributed to Polish mathematician Antoni Zygmund. Zygmund is said to have described the metaphor of the centipede thus: "You take a centipede and pull off ninety-nine of its legs and see what it can do." Thus, Zygmund has been known by many mathematicians as the "Centipede Surgeon".
The study of semigroups is cited as an example of doing centipede mathematics. One starts with the notion of an abelian group. First delete the commutativity restriction to obtain the concept of a group. The restriction of existence of inverses is then removed. This produces a monoid. If one now removes the restriction regarding the existence of identity, the resulting object turns out to be a semigroup. Still more legs can be removed. If the associativity restriction is also discarded one gets a magma or a groupoid. The restrictions that define an abelian group may be removed in different orders also. The study of ternary ring has been cited as an example of centipede mathematics. The progressive removal of axioms of Euclidean geometry and studying the resulting geometrical objects also illustrate the methodology of centipede mathematics.
The following quote summarises the value and usefulness of the concept: "The term ‘centipede mathematics’ is new to me, but its practice is surely of great antiquity. The binomial theorem (tear off the leg that says that the exponent has to be a natural number) is a good example. A related notion is the importance of good notation and the importance of overloading, aka abuse of language, to establish useful analogies." — Gavin Wraith.
References
External links
Procrustean Mathematics
Philosophy of mathematics |
https://en.wikipedia.org/wiki/Yasuyuki%20Nakai | Yasuyuki Nakai (; August 7, 1954 – August 9, 2014) was a Japanese baseball player.
References
External links
Baseball statistics
Japanese baseball players
Yomiuri Giants players
1954 births
2014 deaths |
https://en.wikipedia.org/wiki/Caliber%20%28mathematics%29 | In mathematics, the caliber or calibre of a topological space X is a cardinal κ such that for every set of κ nonempty open subsets of X there is some point of X contained in κ of these subsets. This concept was introduced by .
There is a similar concept for posets. A pre-caliber of a poset P is a cardinal κ such that for any collection of elements of P indexed by κ, there is a subcollection of cardinality κ that is centered. Here a subset of a poset is called centered if for any finite subset there is an element of the poset less than or equal to all of them.
References
Topology |
https://en.wikipedia.org/wiki/Nikolai%20Shanin | Nikolai Aleksandrovich Shanin () (25 May 1919 Pskov – 17 September 2011) was a Russian mathematician who worked on topology and constructive mathematics. He introduced the delta-system lemma and the caliber of a topological space.
Further reading
External links
Nikolai Aleksandrovich Shanin at the Steklov Institute of Mathematics at St. Petersburg
Russian mathematicians
1919 births
2011 deaths
People from Pskov |
https://en.wikipedia.org/wiki/Marta%20Sanz-Sol%C3%A9 | Marta Sanz-Solé (born 19 January 1952 in Sabadell, Barcelona) is a Catalan mathematician specializing in probability theory.
She obtained her PhD in 1978 from the University of Barcelona under the supervision of David Nualart.
Career
Sanz-Solé is professor at the University of Barcelona, and head of the research group on stochastic processes. Prior to taking up her post at the UB, she was associate professor at the University Autònoma of Barcelona. She was Dean of the Faculty of Mathematics UB from 1993-1996, and Vice-president of the Division of Experimental Sciences and Mathematics from 2000-2003. In May 2015 she was appointed chair of the scientific Committee of the Graduate School of Mathematics (BGSMath). and from May 2018 until October 2019, she held the position of Director.
Research
Her research interests are in stochastic analysis, in particular stochastic differential and partial differential equations. She has published more than 100 scientific articles according to MathSciNet and zbMath Open.
and a monograph on Malliavin calculus and applications to SPDEs.
Service
Sanz-Solé served in the executive committee of the European Mathematical Society in 1997-2004. She was elected president in 2010, and held the post from January 2011 to December 2014. She is or has been member of several international committees overseeing the mathematical sciences. In particular, the Board of Directors of the Institut Henri Poincaré, the FSMP (Fondation Sciences Mathématiques de Paris), the committee for research and education of the École Polytechnique, and the Scientific Committee of CIRM (Centre des Rencontres Mathématiques, Luminy, France). In the past years, she served in the Scientific Council of the Banach Center (2010-2014), the Fellows Committee of the Institute of Mathematical Statistics (2012-2014), and the Committee of Special Lectures (2008-2010). She was a member of the Board of Directors of the Centre de Recerca Matemàtica (Bellaterra, Barcelona) for a three-year period, starting April 2007.
On the list of her editorial service there is the membership of the editorial board of the Annals of Probability
from 2015 to 2020.
In June 2015, she was appointed member of the Abel Committee for the Abel Prize 2016, 2017.
She served at the ERC Consolidator Grant panel PE1 in 2015, 2017, 2019 and 2021, and was the chair in the last two calls.
Recognition
In 1998 she was awarded with Narcis Monturiol Medal of Scientific and Technological Excellence by the Generalitat of Catalonia. In 2011 she was elected Fellow of the Institute of Mathematical Statistics. In november 2016, she was elected numerary member of the Institute of Catalan Studies. In 2017 she was awarded the Real Sociedad Matemática Española Medal for her scientific contributions and relevant international positions and service. The same year, she was elected honorary fellow of the Catalan College of Economists
. In January 2019, she became numerary member of the Royal Academy |
https://en.wikipedia.org/wiki/List%20of%20SSC%20Napoli%20records%20and%20statistics | Società Sportiva Calcio Napoli is an Italian professional association football club based in Naples. The club was formed in 1926 as Associazione Calcio Napoli, a name it retained until 1964, when the current name was adopted. The team has played at the San Paolo Stadium since 1959. Napoli have won Serie A three times, the Coppa Italia six times and the UEFA Cup once.
The list encompasses the major honours won by Napoli, records set by the club, their managers and their players, and details of their performance in European competition. The player records section itemises the club's leading goalscorers and those who have made most appearances in first-team competitions.
Honours
Napoli have won honours both domestically and in European competitions. Their first silverware was the Coppa Italia, which they won in 1962. They won their first scudetto in the 1986–87 season, and two seasons later they won the UEFA Cup.
Napoli's achievements include the following:
European
UEFA Cup
Winners (1): 1988–89
Anglo-Italian League Cup
Winners (1): 1976
Coppa delle Alpi
Winners (1): 1966
Domestic
Serie A
Winners (3): 1986–87, 1989–90, 2022–23
Coppa Italia
Winners (6): 1961–62, 1975–76, 1986–87, 2011–12, 2013–14, 2019–20
Supercoppa Italiana
Winners (2): 1990, 2014
Serie B
Winners (2): 1945–46 (Serie A-B Southern Italy co-champions with Bari), 1949–50
Serie C1
Winners (1): 2005–06
Divisional movements
Player records
Most appearances
Slovakian midfielder Marek Hamšík is the player with the most appearances for Napoli with 520 in all competitions; he also holds the record for most appearances in league competition with 408, and UEFA competitions with 80.
Competitive matches only, including substitutes.
Notes
Goalscorers
Most goals scored in all competitions: 148, Dries Mertens
Most goals scored in league matches: 113, Dries Mertens
Most goals scored in Serie A: 113, Dries Mertens
Most goals scored in Coppa Italia: 29, Diego Maradona
Most goals scored in European competition: 28, Dries Mertens
Most goals scored in a season in all competitions: 38, Edinson Cavani in 2012–13 and Gonzalo Higuaín in 2015–16
Most league goals in a Serie A season: 36, Gonzalo Higuaín in 2015–16.
Most league goals in a Serie B season: 22, Stefan Schwoch in 1999–2000.
Most league goals in a Serie C season: 18, Emanuele Calaiò in 2004–05.
Most goals in a competitive match: 5, Attila Sallustro against Reggiana, in the 1928–29 Divisione Nazionale, and Daniel Fonseca against Valencia, in the 1992–93 UEFA Cup.
Top goalscorers
On 13 June 2020, in a Coppa Italia match against Internazionale, Dries Mertens scored his 122nd Napoli goal, becoming the player with the most goals for the club.
Competitive matches only.
Notes
International honours won while playing at Napoli
FIFA World Cup
The following players have won the FIFA World Cup while playing for Napoli:
Giuseppe Cavanna – 1934
Diego Maradona – 1986
UEFA European Championship
The following players have won the UEFA Eu |
https://en.wikipedia.org/wiki/Joel%20Tropp | Joel Aaron Tropp (born July 1977 in Austin, Texas) is the Steele Family Professor of Applied and Computational Mathematics in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on sparse approximation, numerical linear algebra, and random matrix theory.
Academic biography
Tropp studied at the University of Texas, where he completed the BS degree in Mathematics and the BA degree in Plan II Honors in 1999 and the MS and PhD degrees in Computational & Applied Mathematics in 2001 and 2004.
His dissertation was titled Topics in Sparse Approximation, and his advisers were Inderjit Dhillon and Anna C. Gilbert.
He taught at the University of Michigan from 2004 to 2007.
He has been on the faculty of the California Institute of Technology since 2007.
Research
In his early research, Tropp developed performance guarantees for algorithms for sparse approximation and compressed sensing.
In 2011, he published a paper
on randomized algorithms for computing a truncated singular value decomposition.
He has also worked in random matrix theory, where he has established a family of results,
collectively called matrix concentration inequalities, that includes the matrix Chernoff bound.
Awards and honors
Tropp was a recipient of the Presidential Early Career Award for Scientists and Engineers (PECASE) in 2008.
In 2010, he was awarded an Alfred P. Sloan Research Fellowship in Mathematics,
and he received the Sixth Vasil A. Popov Prize in approximation theory for his work on Matching Pursuit algorithms.
He won the Eighth Monroe H. Martin Prize in applied mathematics in 2011 for work on sparse optimization.
He was recognized as a Thomson Reuters Highly Cited Researcher in Computer Science for the years 2014, 2015, and 2016.
In 2019 he was named a SIAM Fellow "for contributions to signal processing, data analysis, and randomized linear algebra".
References
External links
Joel A. Tropp professional home page
1977 births
Living people
University of Texas alumni
California Institute of Technology faculty
20th-century American mathematicians
Sloan Research Fellows
Fellows of the Society for Industrial and Applied Mathematics
Mathematicians from Texas
21st-century American mathematicians
University of Michigan faculty |
https://en.wikipedia.org/wiki/Thomas%20Hou | Thomas Yizhao Hou (born 1962) is the Charles Lee Powell Professor of Applied and Computational Mathematics in the Department of Computing and Mathematical Sciences at the California Institute of Technology. He is known for his work in numerical analysis and mathematical analysis.
Academic biography
Hou studied at the South China University of Technology, where he received a B.S. in Mathematics in 1982.
He completed his Ph.D. in Mathematics at the University of California, Los Angeles in 1987
under the supervision of Björn Engquist.
His dissertation was titled Convergence of Particle Methods for Euler and Boltzmann Equations with Oscillatory Solutions.
From 1989 to 1993, he taught at the Courant Institute of Mathematical Sciences
at New York University. He has been on the faculty of the California Institute of Technology since 1993. He became the Charles Lee Powell Professor of Applied and Computational Mathematics in 2004.
Research
Hou is known for his research on multiscale analysis and singularity formation of the three-dimensional incompressible Euler and Navier-Stokes equations. He is an author of the monograph Multiscale finite element methods. The multiscale finite element method developed by Hou and his former postdoc, Xiao-Hui Wu, was one of the earliest multiscale methods and has found many applications from the engineering community. A variant of his method has been adopted by several major oil companies in their new generation of flow simulators. Hou has worked extensively on computational and analytical aspects of the Euler and Navier-Stokes equations. In 2014, Hou and his former postdoc, Guo Luo, presented convincing numerical evidence that the axisymmetric Euler equations develop finite time singularity from smooth initial data. In 2022, Hou and his former Ph.D. student, Jiajie Chen, made a breakthrough by proving the finite time singularity of the axisymmetric Euler equations with smooth data and boundary (the so-called Hou-Luo blowup scenario). Hou’s recent work on the potentially singular behavior of the three-dimensional Navier-Stokes equations has also generated a lot of interests.
Hou is also known for his work in computational fluid dynamics. His early work on the convergence of the point vortex method for incompressible Euler equations was very surprising and considered as a breakthrough. The level set method developed by Hou and co-workers was the first level set method for multiphase flows and has found many applications. The Small-Scale Decomposition method developed by Hou-Lowengrub-Shelley was considered a tour de force for fluid interface problems and has been used widely in computational fluid dynamics, materials science, and biology.
Hou was cofounder of SIAM Journal on Multiscale Modeling and Simulation, and he served as the editor-in-chief from 2002 to 2007. He was also cofounder of Advances in Adaptive Data Analysis.
Awards and honors
Hou has won several major awards. He received an Alfred P. Sloan Research F |
https://en.wikipedia.org/wiki/Oscar%20Bruno | Oscar P. Bruno is Professor of Applied & Computational Mathematics in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for research on numerical analysis.
Academic biography
Bruno received the Licenciado degree from the University of Buenos Aires in 1982, and he completed the PhD in mathematics at New York University in 1989.
His adviser was Robert V. Kohn, and his dissertation was titled The Effective Conductivity of an Infinitely Interchangeable Mixture.
He taught at the University of Minnesota from 1989 to 1991, and he was at the Georgia Institute of Technology from 1991 to 1995.
He has been on the faculty of the California Institute of Technology since 1995.
Awards and honors
In 1994, Bruno was awarded an Alfred P. Sloan Research Fellowship.
He was inducted as a Fellow of the Society for Industrial and Applied Mathematics (SIAM) in 2013.
References
External links
Oscar P. Bruno professional home page
Living people
Courant Institute of Mathematical Sciences alumni
California Institute of Technology faculty
20th-century American mathematicians
21st-century American mathematicians
Argentine mathematicians
Fellows of the Society for Industrial and Applied Mathematics
University of Buenos Aires alumni
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/M%C3%A1t%C3%A9%20Papp | Máté Papp (born 12 March 1993) is a Hungarian professional footballer who plays for Dunaújváros.
Club statistics
Updated to games played as of 19 October 2014.
References
MLSZ
1993 births
Living people
Footballers from Budapest
Hungarian men's footballers
Hungary men's youth international footballers
Men's association football midfielders
Fehérvár FC players
Dunaújváros PASE players
Puskás Akadémia FC players
Soproni VSE players
Soroksár SC players
Aqvital FC Csákvár players
Nyíregyháza Spartacus FC players
Nemzeti Bajnokság I players
Nemzeti Bajnokság II players
Nemzeti Bajnokság III players |
https://en.wikipedia.org/wiki/Set%20constraint | In mathematics and theoretical computer science, a set constraint is an equation or an inequation between sets of terms.
Similar to systems of (in)equations between numbers, methods are studied for solving systems of set constraints.
Different approaches admit different operators (like "∪", "∩", "\", and function application) on sets and different (in)equation relations (like "=", "⊆", and "⊈") between set expressions.
Systems of set constraints are useful to describe (in particular infinite) sets of ground terms.
They arise in program analysis, abstract interpretation, and type inference.
Relation to regular tree grammars
Each regular tree grammar can be systematically transformed into a system of set inclusions such that its minimal solution corresponds to the tree language of the grammar.
For example, the grammar (terminal and nonterminal symbols indicated by lower and upper case initials, respectively) with the rules
{|
|-
| BoolG || → false
|-
| BoolG || → true
|-
| BListG || → nil
|-
| BListG || → cons(BoolG,BListG)
|-
| BList1G || → cons(true,BListG)
|-
| BList1G || → cons(false,BList1G)
|}
is transformed to the set inclusion system (constants and variables indicated by lower and upper case initials, respectively):
{|
|-
| BoolS || ⊇ false
|-
| BoolS || ⊇ true
|-
| BListS || ⊇ nil
|-
| BListS || ⊇ cons(BoolS,BListS)
|-
| BList1S || ⊇ cons(true,BListS)
|-
| BList1S || ⊇ cons(false,BList1S)
|}
This system has a minimal solution, viz. ("L(N)" denoting the tree language corresponding to the nonterminal N in the above tree grammar):
{|
|-
| BoolS || = L(BoolG) || = { false, true }
|-
| BListS || = L(BListG) || = { nil, cons(false,nil), cons(true,nil), cons(false,cons(false,nil)), ... }
|-
| BList1S || = L(BList1G) || = { nil, cons(true,nil), cons(true,cons(false,nil)),... }
|}
The maximal solution of the system is trivial; it assigns the set of all terms to every variable.
Literature
Literature on negative constraints
Notes
Formal languages |
https://en.wikipedia.org/wiki/Curvature%20%28disambiguation%29 | Curvature refers to mathematical concepts in different areas of geometry.
Curvature may also refer to:
Curvature LLC, a network hardware company
Human vertebral column, curvature of the spine
Curvatures of the stomach, curvatures of the stomach
Figure of the Earth, curvature of the Earth
Degree of curvature, degree of curvature used in civil engineering
Curvature (film) |
https://en.wikipedia.org/wiki/16%2C807 | 16807 is the natural number following 16806 and preceding 16808.
In mathematics
As a number of the form nn − 2 (16807 = 75), it can be applied in Cayley's formula to count the number of trees with seven labeled nodes.
In other fields
Several authors have suggested a Lehmer random number generator:
References
External links
16807 : facts & properties
16807 |
https://en.wikipedia.org/wiki/Einstein%20problem | In plane geometry, the einstein problem asks about the existence of a single prototile that by itself forms an aperiodic set of prototiles; that is, a shape that can tessellate space but only in a nonperiodic way. Such a shape is called an einstein, a word play on ein Stein, German for "one stone". Several variants of the problem, depending on the particular definitions of nonperiodicity and the specifications of what sets may qualify as tiles and what types of matching rules are permitted, were solved beginning in the 1990s. The strictest version of the problem was solved in 2023 (the initial discovery was in November 2022, with a preprint published in March 2023), pending peer review. The einstein problem can be seen as a natural extension of the second part of Hilbert's eighteenth problem, which asks for a single polyhedron that tiles Euclidean 3-space, but such that no tessellation by this polyhedron is isohedral. Such anisohedral tiles were found by Karl Reinhardt in 1928, but these anisohedral tiles all tile space periodically.
Proposed solutions
In 1988, Peter Schmitt discovered a single aperiodic prototile in three-dimensional Euclidean space. While no tiling by this prototile admits a translation as a symmetry, some have a screw symmetry. The screw operation involves a combination of a translation and a rotation through an irrational multiple of π, so no number of repeated operations ever yield a pure translation. This construction was subsequently extended by John Horton Conway and Ludwig Danzer to a convex aperiodic prototile, the Schmitt–Conway–Danzer tile. The presence of the screw symmetry resulted in a reevaluation of the requirements for non-periodicity. Chaim Goodman-Strauss suggested that a tiling be considered strongly aperiodic if it admits no infinite cyclic group of Euclidean motions as symmetries, and that only tile sets which enforce strong aperiodicity be called strongly aperiodic, while other sets are to be called weakly aperiodic.
In 1996, Petra Gummelt constructed a decorated decagonal tile and showed that when two kinds of overlaps between pairs of tiles are allowed, the tiles can cover the plane, but only non-periodically. A tiling is usually understood to be a covering with no overlaps, and so the Gummelt tile is not considered an aperiodic prototile. An aperiodic tile set in the Euclidean plane that consists of just one tile–the Socolar–Taylor tile–was proposed in early 2010 by Joshua Socolar and Joan Taylor. This construction requires matching rules, rules that restrict the relative orientation of two tiles and that make reference to decorations drawn on the tiles, and these rules apply to pairs of nonadjacent tiles. Alternatively, an undecorated tile with no matching rules may be constructed, but the tile is not connected. The construction can be extended to a three-dimensional, connected tile with no matching rules, but this tile allows tilings that are periodic in one direction, and so it is only weakly ape |
https://en.wikipedia.org/wiki/Aurore%20Delaigle | Aurore Delaigle is a Professor and ARC Future Fellow in the Department of Mathematics and Statistics at the University of Melbourne, Australia. Her research interests include nonparametric statistics, deconvolution and functional data analysis.
Education and career
Following her undergraduate degree in mathematics at Université catholique de Louvain, Belgium, she completed a PhD in statistics at the same institution on kernel estimation in deconvolution problems. In her early career, she undertook a postdoctoral fellowship at University of California, Davis, before joining University of California, San Diego as an assistant professor. She was also a Reader at the University of Bristol.
In 2014, she was promoted to Professor at the University of Melbourne.
Awards and fellowships
While at UC San Diego, she was awarded a Hellman Fellowship (2006–07).
In 2013, she was awarded the Moran Medal from the Australian Academy of Science, for her contribution to "contemporary statistical problems".
From 2013 to 2018, she is an ARC Future Fellow, investigating new nonparametric statistical methods.
She is a Fellow of the Institute of Mathematical Statistics for her work in "non-parametric function estimation, measurement error problems, and functional data". She is also an elected member of the International Statistical Institute. In 2018 she became a Fellow of the American Statistical Association and in May 2020 she was elected Fellow of the Australian Academy of Science.
References
External links
Living people
Australian statisticians
Australian women scientists
Women statisticians
Elected Members of the International Statistical Institute
Fellows of the Institute of Mathematical Statistics
Fellows of the American Statistical Association
Université catholique de Louvain alumni
University of California, San Diego faculty
Academic staff of the University of Melbourne
Belgian emigrants to Australia
Year of birth missing (living people)
Fellows of the Australian Academy of Science |
https://en.wikipedia.org/wiki/Louis%20Bachelier%20Prize | The Louis Bachelier Prize is a biennial prize in applied mathematics jointly awarded by the London Mathematical Society, the Natixis Foundation for Quantitative Research and the Société de Mathématiques Appliquées et Industrielles (SMAI) in recognition for "exceptional contributions to mathematical modelling in finance, insurance, risk management and/or scientific computing applied to finance and insurance."
The prize is named in honor of French mathematician Louis Bachelier, a pioneer in the field of probability and its use in financial modeling.
Description
The Louis Bachelier Prize was created in 2007 by the Société de Mathématiques Appliquées et Industrielles [Society for Applied and Industrial Mathematics] in collaboration with the Natixis Quantitative Research Foundation and the French Academy of Sciences. The prize, of 20,000, is awarded biennially to a scientist with less than 25 years of postdoctoral experience. The candidates must be permanent residents of a country of the European Union. From its creation in 2015, the Louis Bachelier Prize was awarded by the French Academy of Sciences. Since 2015, the prize is administered by the London Mathematical Society.
Winners
2022 :
2020 :
2018 : Pauline Barrieu
2016 : Damir Filipović
2014 : Josef Teichmann
2012 : Nizar Touzi
2010 : Rama Cont
2007 :
See also
List of mathematics awards
References
External links
French awards
French science and technology awards
Awards established in 2007
Awards of the London Mathematical Society
Early career awards |
https://en.wikipedia.org/wiki/Axiom%20of%20adjunction | In mathematical set theory, the axiom of adjunction states that for any two sets x, y there is a set w = x ∪ {y} given by "adjoining" the set y to the set x. It is stated as
introduced the axiom of adjunction as one of the axioms for a system of set theory that he introduced in about 1929.
It is a weak axiom, used in some weak systems of set theory such as general set theory or finitary set theory. The adjunction operation is also used as one of the operations of primitive recursive set functions.
Interpretability of arithmetic
Tarski and Szmielew showed that Robinson arithmetic () can be interpreted in a weak set theory whose axioms are extensionality, the existence of the empty set, and the axiom of adjunction .
In fact, empty set and adjunction alone (without extensionality) suffice to interpret . (They are mutually interpretable.)
Adding epsilon-induction to empty set and adjunction yields a theory that is mutually interpretable with Peano arithmetic ().
Another axiom schema also yields a theory that is mutually interpretable with :
,
where is not allowed to have free. This combines axioms of set theory: For trivially true it reduced to the adjunction axiom above, and for it gives the axiom of separation with .
References
Tarski, A., and Givant, Steven (1987) A Formalization of Set Theory without Variables. Providence RI: AMS Colloquium Publications, v. 41.
Axioms of set theory |
https://en.wikipedia.org/wiki/Lauren%20Williams%20%28mathematician%29 | Lauren Kiyomi Williams (born 1978) is an American mathematician known for her work on cluster algebras, tropical geometry, algebraic combinatorics, amplituhedra, and the positive Grassmannian. She is Dwight Parker Robinson Professor of Mathematics at Harvard University.
Education
Williams's father is an engineer; her mother is third-generation Japanese American. She grew up in Los Angeles, where her interest in mathematics was sparked by winning a fourth-grade mathematics contest. She was the valedictorian of Palos Verdes Peninsula High School in 1996, and while there participated in summer research at the Massachusetts Institute of Technology with Satomi Okazaki, a student of her eventual advisor, Richard P. Stanley. She graduated magna cum laude from Harvard University in 2000 with a A.B. in mathematics, and received her PhD in 2005 at the Massachusetts Institute of Technology under the supervision of Stanley. Her dissertation was titled Combinatorial Aspects of Total Positivity.
Work
After postdoctoral positions at the University of California, Berkeley and Harvard, Williams rejoined the Berkeley mathematics department as an assistant professor in 2009, and was promoted to associate professor in 2013 and then full professor in 2016.
Starting in the fall of 2018, she rejoined the Harvard mathematics department as a full professor, making her the second ever tenured female math professor at Harvard. The first, Sophie Morel, left Harvard in 2012.
Along with colleagues O. Mandelshtam (her former student, now an assistant professor at University of Waterloo) and S. Corteel, in 2018 Williams developed a new characterization of both symmetric and nonsymmetric Macdonald polynomials using the combinatorial exclusion process.
Awards
In 2012, she became one of the inaugural fellows of the American Mathematical Society. She is the 2016 winner of the Association for Women in Mathematics and Microsoft Research Prize in Algebra and Number Theory. In 2022 she was awarded a Guggenheim Fellowship.
Selected publications
References
External links
Home page
Living people
Date of birth missing (living people)
Year of birth missing (living people)
21st-century American mathematicians
21st-century women mathematicians
American academics of Japanese descent
American women mathematicians
Combinatorialists
Fellows of the American Mathematical Society
Harvard College alumni
Massachusetts Institute of Technology School of Science alumni
University of California, Berkeley faculty
Harvard University Department of Mathematics faculty
Harvard University faculty
21st-century American women |
https://en.wikipedia.org/wiki/Richard%20Toomey | Richard Toomey is an American former professional ice hockey player and coach who led Brown for four seasons in the mid-1970s.
Career statistics
Head coaching record
College
References
External links
American ice hockey coaches
American men's ice hockey forwards
Boston University Terriers men's ice hockey players
Brown Bears men's ice hockey coaches
Ice hockey coaches from Massachusetts
Living people
Sportspeople from Newton, Massachusetts
Year of birth missing (living people)
Ice hockey players from Massachusetts |
https://en.wikipedia.org/wiki/Merrilyn%20Goos | Merrilyn Goos is an Australian mathematics educator. Since October 2017 she has been Professor of STEM Education and Director of EPI*STEM at the University of Limerick, Ireland.
From 2012-2017 Goos was professor and head of the School of Education at the University of Queensland, and prior to this was Director of the Teaching and Educational Development Institute at The University of Queensland. She has taught in mathematics education and in 2003 she received the university's Award for Excellence in Teaching.
Qualifications
Goos has Associate and Licentiate Teachers Diplomas in Speech and Drama from Trinity College London, a B.Sc., Diploma, Master's degree in educational studies, and Ph.D. from the University of Queensland, and a Graduate Diploma in Reading from Griffith University.
Professional associations
Goos was president of the Mathematics Education Research Group of Australasia, past vice-president of the Queensland Association of Mathematics Teachers, and past chair of the Queensland Studies Authority's Mathematics Syllabus Advisory Committee.
In 2004 she won an Office for Learning and Teaching teaching award for her work as a mathematics teacher educator, and in 2006 was awarded national fellowships to investigate assessment leadership in higher education institutions.
References
Australian women scientists
Living people
Year of birth missing (living people)
20th-century Australian mathematicians
21st-century Australian mathematicians
Australian women mathematicians
University of Queensland alumni
20th-century women mathematicians
21st-century women mathematicians
Educational Studies in Mathematics editors
20th-century Australian women |
https://en.wikipedia.org/wiki/Barbara%20R.%20Holland | Barbara Ruth Holland is a New Zealand born Australian scientist. She is a Professor of mathematics and member of the Theoretical Phylogenetics Group at the School of Mathematics & Physics at the University of Tasmania. Barbara is also a Chief Investigator at the ARC Centre of Excellence for Plant Success in Nature and Agriculture. She has made substantial contributions to the methods for reconstructing phylogenetic trees from DNA and protein sequence data. Holland has published over 50 journal articles, presented over 30 invited or keynote lectures, refereed five conference proceedings, 2 book chapters and 1 book review. She is a senior editor of the scientific journal Molecular Biology and Evolution.
Research
Holland has research interests in phylogenetics, mathematical biology, population genetics, and epidemiology. Her primary area of interest is in the estimation of evolutionary trees, and she works to develop tools that can assess how well a given model describes a sequence of data. Holland uses her knowledge to help biologists translate the unsolved problems of their field into mathematical language.
Career
Holland completed a doctorate at Massey University in New Zealand in 2001, on evolutionary analyses of large datasets. Holland is currently a professor of mathematics at the University of Tasmania in Australia, where she teaches statistics, operations research, and phylogenetics and is a member of the university's Theoretical Phylogenetics Group.
Holland spent about a year beginning in 2001 as a Post Doctoral Researcher at Ruhr University Bochum in Germany. From 2002 to 2010 Holland was working in a number of different capacities at Massey University in New Zealand. For the duration of her stay she was a part of the Allan Wilson Centre as a Post Doctoral Fellow (2002-2005) and then as a Research Fellow (2005-2010). Holland spent a year as a lecturer in mathematics for the university beginning in 2007 and was a senior lecturer from 2008 to 2010, also in mathematics. In 2010 Holland began lecturing in mathematics at the University of Tasmania in Australia. From 2011 to 2014 she was Future Fellow at the university, a fellowship awarded to her by the Australian Research Council.
Scientific meeting organizer
From 2010 to 2014, Holland served as a co-organizer of Phylomania, a conference which sought to bring together phylogenetic researchers interested in theory to address some of the primary challenges in the field and further develop the branch of mathematics focused on computational phylogenetic methods. In 2010, she was also chief organizer of the New Zealand Phylogenetics Meeting in Whakapapa Village, February 9–14.
Professional recognition
Holland's expertise has allowed her serve as associate, principal, and co-investigator on a variety of research projects and has earned her a number of professional awards and recognitions. In 2004 she was an Associate Investigator on the Marsden-funded project 'Understanding Prokaryotes and E |
https://en.wikipedia.org/wiki/Index%20%28statistics%29 | In statistics and research design, an index is a composite statistic – a measure of changes in a representative group of individual data points, or in other words, a compound measure that aggregates multiple indicators. Indexes – also known as composite indicators – summarize and rank specific observations.
Much data in the field of social sciences and sustainability are represented in various indices such as Gender Gap Index, Human Development Index or the Dow Jones Industrial Average. The ‘Report by the Commission on the Measurement of Economic Performance and Social Progress’, written by Joseph Stiglitz, Amartya Sen, and Jean-Paul Fitoussi in 2009 suggests that these measures have experienced a dramatic growth in recent years due to three concurring factors:
improvements in the level of literacy (including statistical)
increased complexity of modern societies and economies, and
widespread availability of information technology.
According to Earl Babbie, items in indexes are usually weighted equally, unless there are some reasons against it (for example, if two items reflect essentially the same aspect of a variable, they could have a weight of 0.5 each).
According to the same author, constructing the items involves four steps. First, items should be selected based on their content validity, unidimensionality, the degree of specificity in which a dimension is to be measured, and their amount of variance. Items should be empirically related to one another, which leads to the second step of examining their multivariate relationships. Third, indexes scores are designed, which involves determining their score ranges and weights for the items. Finally, indexes should be validated, which involves testing whether they can predict indicators related to the measured variable not used in their construction.
A handbook for the construction of composite indicators (CIs) was published jointly by the OECD and by the European Commission's Joint Research Centre in 2008. The handbook – officially endorsed by the OECD high level statistical committee, describe ten recursive steps for developing an index:
Step 1: Theoretical framework
Step 2: Data selection
Step 3: Imputation of missing data
Step 4: Multivariate analysis
Step 5: Normalisation
Step 6: Weighting
Step 7: Aggregating indicators
Step 8: Sensitivity analysis
Step 9: Link to other measures
Step 10: Visualisation
As suggested by the list, many modelling choices are needed to construct a composite indicator, which makes their use controversial. The delicate issue of assigning and validating weights is discussed e.g. in. A sociological reading of the nature of composite indicators is offered by Paul-Marie Boulanger, who sees these measures at the intersection of three movements:
the democratisation of expertise, the concept that more knowledge is needed to tackle societal and environmental issues that can be provided by the sole experts – this line of thought connects to the concept of ex |
https://en.wikipedia.org/wiki/Indicator%20%28statistics%29 | In statistics and research design, an indicator is an observed value of a variable, or in other words "a sign of a presence or absence of the concept being studied". Just like each color indicates in a traffic lights the change in the movement.
For example, if a variable is religiosity, and a unit of analysis is an individual, then that one of potentially more numerous indicators of that individual's religiosity would be whether they attend religious services; others - how often, or whether they donate money to religious organizations.
Numerous indicators can be aggregated into an index.
The complexity of biological systems makes evaluating them a challenge. Bioindicators, such as indicator bacteria, are ecological indicators, sometimes requiring further consideration of environmental indicators. In public health study, one relies on health indicators. In a given locality, community indicators inform planners, while the design quality indicator can be the basis of building permits. Assessment of social conditions relies on sustainability indicators or the genuine progress indicator. Standard measurements are given in the OECD Main Economic Indicators. A famous popular science individual psychological assessment is the Myers–Briggs Type Indicator.
References
Research methods |
https://en.wikipedia.org/wiki/Distinguished%20limit | In mathematics, a distinguished limit is an appropriately chosen scale factor used in the method of matched asymptotic expansions.
External links
Singular perturbation theory, Scholarpedia
Differential equations
Asymptotic analysis |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.