HOME





Arthur Rubin
Arthur Leonard Rubin (born 1956) is an American mathematician and aerospace engineer. He was named a Putnam Fellow on four consecutive occasions from 1970 to 1973. Life and career Rubin's mother was Jean E. Rubin, a professor of mathematics at Purdue University, and his father was Herman Rubin, a professor of statistics at the same university. Arthur co-authored his first paper with his mother in 1969 at the age of 13. He earned his Ph.D. at the California Institute of Technology in 1978, under the direction of Alexander S. Kechris. Rubin unsuccessfully stood as a Libertarian to represent the 55th district in the 1984 California State Assembly elections. Awards and honors As an undergraduate, Rubin was named a Putnam Fellow on four occasions, the first time in 1970, aged 14, making him the youngest Fellow to date. In 1972, he tied for third place in the first USA Mathematical Olympiad. In 1974, Rubin was the subject of an article in the '' Madison Capital Times'', in whic ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Aquarium Of The Pacific
The Aquarium of the Pacific (formerly the Long Beach Aquarium of the Pacific) is a public aquarium on a site on Rainbow Harbor in Long Beach, California, United States. It is situated across the water from the Long Beach Convention Center, Shoreline Village, and the Queen Mary Hotel and Attraction. The aquarium sees 1.5 million visitors a year and has a total staff of about 1,875 people, including more than 1,500 volunteers and about 375 employees. It is a 501(c)(3) non-profit aquarium. The aquarium is an accredited member of the Association of Zoos and Aquariums (AZA). Exhibits The aquarium features a collection of over 11,000 animals representing over 500 different species in exhibits ranging in size and capacity from about 5,000 to 350,000 gallons. Exhibits introduce the inhabitants and seascapes of the Pacific, while also focusing on specific conservation messages associated with each region. The Pacific Ocean is the focus of three major permanent galleries, sunny Southe ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


United States Of America Mathematical Olympiad
The United States of America Mathematical Olympiad (USAMO) is a highly selective high school mathematics competition held annually in the United States. Since its debut in 1972, it has served as the final round of the American Mathematics Competitions. In 2010, it split into the USAMO and the United States of America Junior Mathematical Olympiad (USAJMO). Qualification for the USAMO or USAJMO is considered one of the most prestigious awards for high school students in the United States. Top scorers on both six-question, nine-hour mathematical proof competitions are invited to join the Mathematical Olympiad Program to compete and train to represent the United States at the International Mathematical Olympiad. Eligibility In order to be eligible to take the USAMO, a participant must be either a U.S. citizen or a legal resident of the United States or Canada. Only U.S. permanent residents and citizens may join the American IMO team. In addition, all participants, regardless of g ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

1956 Births
Events January * January 1 – The Anglo-Egyptian Condominium ends in Sudan. * January 8 – Operation Auca: Five U.S. evangelical Christian missionaries, Nate Saint, Roger Youderian, Ed McCully, Jim Elliot and Pete Fleming, are killed for trespassing by the Huaorani people of Ecuador, shortly after making contact with them. * January 16 – Egyptian leader Gamal Abdel Nasser vows to reconquer Palestine. * January 25– 26 – Finnish troops reoccupy Porkkala, after Soviet troops vacate its military base. Civilians can return February 4. * January 26 – The 1956 Winter Olympics open in Cortina d'Ampezzo, Italy. February * February 11 – British spies Guy Burgess and Donald Maclean resurface in the Soviet Union, after being missing for 5 years. * February 14– 25 – The 20th Congress of the Communist Party of the Soviet Union is held in Moscow. * February 16 – The 1956 World Figure Skating Championships open in Garmisch, West Germany. * February 22 – Elvis P ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


List Of IEEE Publications
The publications of the Institute of Electrical and Electronics Engineers (IEEE) constitute around 30% of the world literature in the electrical and electronics engineering and computer science fields, publishing well over 100 peer-reviewed journals. The content in these journals as well as the content from several hundred annual conferences are available in the IEEE's online digital library. The IEEE also publishes more than 750 conference proceedings every year. /www.ieee.org/publications_standards/publications/confproc/index.html IEEE conference proceedings/ref> In addition, the IEEE Standards Association maintains over 1,300 standards in engineering. Some of the journals are published in association with other societies, like the Association for Computing Machinery (ACM), the American Society of Mechanical Engineers (ASME), the Optical Society (OSA), and the Minerals, Metals & Materials Society (TMS). Journals Magazines Other * '' Communications and Networks, Journal o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




IEEE Transactions On Information Theory
''IEEE Transactions on Information Theory'' is a monthly peer-reviewed scientific journal published by the IEEE Information Theory Society. It covers information theory and the mathematics of communications. It was established in 1953 as ''IRE Transactions on Information Theory''. The editor-in-chief is Muriel Médard (Massachusetts Institute of Technology). As of 2007, the journal allows the posting of preprints on arXiv. According to Jack van Lint, it is the leading research journal in the whole field of coding theory. A 2006 study using the PageRank network analysis algorithm found that, among hundreds of computer science-related journals, ''IEEE Transactions on Information Theory'' had the highest ranking and was thus deemed the most prestigious. ''ACM Computing Surveys'', with the highest impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a scientometric index calculated by Clarivate that reflects the yearly mean number of c ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Erdős Number
The Erdős number () describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual has collaborated with a large and broad number of peers. Overview Paul Erdős (1913–1996) was an influential Hungarian mathematician who in the latter part of his life spent a great deal of time writing papers with a large number of colleagues, working on solutions to outstanding mathematical problems. He published more papers during his lifetime (at least 1,525) than any other mathematician in history. (Leonhard Euler published more total pages of mathematics but fewer separate papers: about 800.) Erdős spent a large portion of his later life living out of a suitcase, visiting over 500 collaborators around the world. The idea of the Erdős number was originally created by the mathematician's friends as a tribute to his enormous o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics. Erdős published around 1,500 mathematical papers during his lifetime, a figure that remains unsurpassed. He firmly believed mathematics to be a social activity, living an itinerant lifestyle with the sole purpose of writing mathematical papers with other mat ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Graph Theory
In mathematics, graph theory is the study of '' graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by ''edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

List Coloring
In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It was first studied in the 1970s in independent papers by Vizing and by Erdős, Rubin, and Taylor. Definition Given a graph ''G'' and given a set ''L''(''v'') of colors for each vertex ''v'' (called a list), a list coloring is a ''choice function'' that maps every vertex ''v'' to a color in the list ''L''(''v''). As with graph coloring, a list coloring is generally assumed to be proper, meaning no two adjacent vertices receive the same color. A graph is ''k''-choosable (or ''k''-list-colorable) if it has a proper list coloring no matter how one assigns a list of ''k'' colors to each vertex. The choosability (or list colorability or list chromatic number) ch(''G'') of a graph ''G'' is the least number ''k'' such that ''G'' is ''k''-choosable. More generally, for a function ''f'' assigning a positive integer ''f''(''v'') to each ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Von Neumann–Bernays–Gödel Set Theory
In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of Zermelo–Fraenkel–choice set theory (ZFC). NBG introduces the notion of class, which is a collection of sets defined by a formula whose quantifiers range only over sets. NBG can define classes that are larger than sets, such as the class of all sets and the class of all ordinals. Morse–Kelley set theory (MK) allows classes to be defined by formulas whose quantifiers range over classes. NBG is finitely axiomatizable, while ZFC and MK are not. A key theorem of NBG is the class existence theorem, which states that for every formula whose quantifiers range only over sets, there is a class consisting of the sets satisfying the formula. This class is built by mirroring the step-by-step construction of the formula with classes. Since all set-theoretic formulas are constructed from two kinds of atomic formulas ( membership and equ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For example, the structure of groups is a single object in universal algebra, which is called the '' variety of groups''. History Before the nineteenth century, alge ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]