|
David H. Bailey (mathematician)
David Harold Bailey (born 1948) is a mathematician and computer scientist. He received his B.S. in mathematics from Brigham Young University in 1972 and his Ph.D. in mathematics from Stanford University in 1976. He worked for 14 years as a computer scientist at NASA Ames Research Center, and then from 1998 to 2013 as a Senior Scientist at the Lawrence Berkeley National Laboratory. He is now retired from the Berkeley Lab. Bailey is perhaps best known as a co-author (with Peter Borwein and Simon Plouffe) of a 1997 paper that presented a new formula for π (pi), which had been discovered by Plouffe in 1995. This Bailey–Borwein–Plouffe formula permits one to calculate binary or hexadecimal digits of pi beginning at an arbitrary position, by means of a simple algorithm. Subsequently, Bailey and Richard Crandall showed that the existence of this and similar formulas has implications for the long-standing question of "normality"—whether and why the digits of certain mathematica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Crandall
Richard E. Crandall (December 29, 1947 – December 20, 2012) was an American physicist and computer scientist who made contributions to computational number theory. Background Richard Crandall was born in Ann Arbor, Michigan, and spent two years at Caltech before transferring to Reed College in Portland, Oregon, where he graduated in physics and wrote his undergraduate thesis on randomness. Career and accomplishments Crandall earned a Ph.D in theoretical physics from MIT. In 1978, he became a physics professor at Reed College, where he taught courses in experimental physics and computational physics for many years, ultimately becoming Vollum Professor of Science and director of the Center for Advanced Computation. He was also, at various times, Chief Scientist at NeXT, Inc., Chief Cryptographer and Distinguished Scientist at Apple, and head of Apple's Advanced Computation Group. He was a pioneer in experimental mathematics. He developed the irrational base discrete weighted trans ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Church Of Jesus Christ Of Latter-day Saints
The Church of Jesus Christ of Latter-day Saints, informally known as the LDS Church or Mormon Church, is a Nontrinitarianism, nontrinitarian Christianity, Christian church that considers itself to be the Restorationism, restoration of the One true church#Latter Day Saint movement, original church founded by Jesus in Christianity, Jesus Christ. The church is headquartered in the United States in Salt Lake City, Salt Lake City, Utah, and has established congregations and built Temple (LDS Church), temples worldwide. According to the church, it has over 16.8 million the Church of Jesus Christ of Latter-day Saints membership statistics, members and 54,539 Missionary (LDS Church), full-time volunteer missionaries. The church is the Christianity in the United States, fourth-largest Christian denomination in the United States, with over 6.7 million US members . It is the List of denominations in the Latter Day Saint movement, largest denomination in the Latter Day Saint m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Mathematical Society
The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, advocacy and other programs. The society is one of the four parts of the Joint Policy Board for Mathematics and a member of the Conference Board of the Mathematical Sciences. History The AMS was founded in 1888 as the New York Mathematical Society, the brainchild of Thomas Fiske, who was impressed by the London Mathematical Society on a visit to England. John Howard Van Amringe was the first president and Fiske became secretary. The society soon decided to publish a journal, but ran into some resistance, due to concerns about competing with the American Journal of Mathematics. The result was the ''Bulletin of the American Mathematical Society'', with Fiske as editor-in-chief. The de facto journal, as intended, was influential in in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For Computing Machinery
The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, claiming nearly 110,000 student and professional members . Its headquarters are in New York City. The ACM is an umbrella organization for academic and scholarly interests in computer science ( informatics). Its motto is "Advancing Computing as a Science & Profession". History In 1947, a notice was sent to various people: On January 10, 1947, at the Symposium on Large-Scale Digital Calculating Machinery at the Harvard computation Laboratory, Professor Samuel H. Caldwell of Massachusetts Institute of Technology spoke of the need for an association of those interested in computing machinery, and of the need for communication between them. ..After making some inquiries during May and June, we believe there is ample interest to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Association Of America
The Mathematical Association of America (MAA) is a professional society that focuses on mathematics accessible at the undergraduate level. Members include university, college, and high school teachers; graduate and undergraduate students; pure and applied mathematicians; computer scientists; statisticians; and many others in academia, government, business, and industry. The MAA was founded in 1915 and is headquartered at 1529 18th Street, Northwest in the Dupont Circle neighborhood of Washington, D.C. The organization publishes mathematics journals and books, including the '' American Mathematical Monthly'' (established in 1894 by Benjamin Finkel), the most widely read mathematics journal in the world according to records on JSTOR. Mission and Vision The mission of the MAA is to advance the understanding of mathematics and its impact on our world. We envision a society that values the power and beauty of mathematics and fully realizes its potential to promote human flourishing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IEEE Computer Society
The Institute of Electrical and Electronics Engineers (IEEE) is a 501(c)(3) professional association for electronic engineering and electrical engineering (and associated disciplines) with its corporate office in New York City and its operations center in Piscataway, New Jersey. The mission of the IEEE is ''advancing technology for the benefit of humanity''. The IEEE was formed from the amalgamation of the American Institute of Electrical Engineers and the Institute of Radio Engineers in 1963. Due to its expansion of scope into so many related fields, it is simply referred to by the letters I-E-E-E (pronounced I-triple-E), except on legal business documents. , it is the world's largest association of technical professionals with more than 423,000 members in over 160 countries around the world. Its objectives are the educational and technical advancement of electrical and electronic engineering, telecommunications, computer engineering and similar disciplines. History Orig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Finance
Mathematical finance, also known as quantitative finance and financial mathematics, is a field of applied mathematics, concerned with mathematical modeling of financial markets. In general, there exist two separate branches of finance that require advanced quantitative techniques: derivatives pricing on the one hand, and risk and portfolio management on the other. Mathematical finance overlaps heavily with the fields of computational finance and financial engineering. The latter focuses on applications and modeling, often by help of stochastic asset models, while the former focuses, in addition to analysis, on building tools of implementation for the models. Also related is quantitative investing, which relies on statistical and numerical models (and lately machine learning) as opposed to traditional fundamental analysis when managing portfolios. French mathematician Louis Bachelier's doctoral thesis, defended in 1900, is considered the first scholarly work on mathematical fina ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NAS Benchmarks
NAS Parallel Benchmarks (NPB) are a set of benchmarks targeting performance evaluation of highly parallel supercomputers. They are developed and maintained by the NASA Advanced Supercomputing (NAS) Division (formerly the NASA Numerical Aerodynamic Simulation Program) based at the NASA Ames Research Center. NAS solicits performance results for NPB from all sources. History Motivation Traditional benchmarks that existed before NPB, such as the Livermore loops, the LINPACK Benchmark and thNAS Kernel Benchmark Program were usually specialized for vector computers. They generally suffered from inadequacies including parallelism-impeding tuning restrictions and insufficient problem sizes, which rendered them inappropriate for highly parallel systems. Equally unsuitable were full-scale application benchmarks due to high porting cost and unavailability of automatic software parallelization tools. As a result, NPB were developed in 1991 and released in 1992 to address the ensuing lack o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
PSLQ Algorithm
An integer relation between a set of real numbers ''x''1, ''x''2, ..., ''x''''n'' is a set of integers ''a''1, ''a''2, ..., ''a''''n'', not all 0, such that :a_1x_1 + a_2x_2 + \cdots + a_nx_n = 0.\, An integer relation algorithm is an algorithm for finding integer relations. Specifically, given a set of real numbers known to a given precision, an integer relation algorithm will either find an integer relation between them, or will determine that no integer relation exists with coefficients whose magnitudes are less than a certain upper bound. History For the case ''n'' = 2, an extension of the Euclidean algorithm can find any integer relation that exists between any two real numbers ''x''1 and ''x''2. The algorithm generates successive terms of the continued fraction expansion of ''x''1/''x''2; if there is an integer relation between the numbers, then their ratio is rational and the algorithm eventually terminates. *The Ferguson–Forcade algorithm was published in 1979 by Helam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fast Fourier Transform
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors. As a result, it manages to reduce the complexity of computing the DFT from O\left(N^2\right), which arises if one simply applies the definition of DFT, to O(N \log N), where N is the data size. The difference in speed can be enormous, especially for long data sets where ''N'' may be in the thousands or millions. In the presence of round-off error, many FFT algorithm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parallel Computing
Parallel computing is a type of computation in which many calculations or processes are carried out simultaneously. Large problems can often be divided into smaller ones, which can then be solved at the same time. There are several different forms of parallel computing: bit-level, instruction-level, data, and task parallelism. Parallelism has long been employed in high-performance computing, but has gained broader interest due to the physical constraints preventing frequency scaling.S.V. Adve ''et al.'' (November 2008)"Parallel Computing Research at Illinois: The UPCRC Agenda" (PDF). Parallel@Illinois, University of Illinois at Urbana-Champaign. "The main techniques for these performance benefits—increased clock frequency and smarter but increasingly complex architectures—are now hitting the so-called power wall. The computer industry has accepted that future performance increases must largely come from increasing the number of processors (or cores) on a die, rather than m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
