|
Paul Tseng
Paul Tseng () was a Chinese-American (Hakka Taiwanese) and Canadian applied mathematician and a professor at the Department of Mathematics at the University of Washington, in Seattle, Washington. Tseng was recognized by his peers to be one of the leading optimization researchers of his generation. On August 13, 2009, Paul Tseng went missing while kayaking in the Yangtze River in the Yunnan province of China and is presumed dead. Biography Paul Tseng was born September 21, 1959 in Hsinchu, Taiwan. In December 1970, Tseng's family moved to Vancouver, British Columbia. Tseng received his B.Sc. from Queen's University in 1981 and his Ph.D. from Massachusetts Institute of Technology in 1986. In 1990 Tseng moved to the University of Washington's Department of Mathematics. Tseng has conducted research primarily in continuous optimization and secondarily in discrete optimization and distributed computation. Research Tseng made many contributions to mathematical optimization, publ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hsinchu
Hsinchu (, Chinese: 新竹, Pinyin: ''Xīnzhú'', Wade–Giles: ''Hsin¹-chu²'') is a city located in northwestern Taiwan. It is the most populous city in Taiwan Province not among the special municipalities, with estimated 450,655 inhabitants. Hsinchu is a coastal city bordering the Taiwan Strait to the west, Hsinchu County to the north and east, and Miaoli County to the south. Nicknamed the ''Windy City'' for its strong northeastern monsoon during the autumn and winter seasons. The area was originally settled by the Austronesian Taiwanese indigenous peoples, with the settlement being named "Tek-kham" by the Hoklo immigrants. The city was founded by Han Chinese settlers in 1711, and renamed to its current form in 1878. During the Japanese Era, the city was the seat of Shinchiku Prefecture, named after the city. The prefecture encompassed present-day Hsinchu City and County, as well as entire Taoyuan and Miaoli. After the ROC rule in 1945, the urban area of Hsinchu wa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematician
A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History One of the earliest known mathematicians were Thales of Miletus (c. 624–c.546 BC); he has been hailed as the first true mathematician and the first known individual to whom a mathematical discovery has been attributed. He is credited with the first use of deductive reasoning applied to geometry, by deriving four corollaries to Thales' Theorem. The number of known mathematicians grew when Pythagoras of Samos (c. 582–c. 507 BC) established the Pythagorean School, whose doctrine it was that mathematics ruled the universe and whose motto was "All is number". It was the Pythagoreans who coined the term "mathematics", and with whom the study of mathematics for its own sake begins. The first woman mathematician recorded by history was Hypati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Signal Processing
Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing ''signals'', such as audio signal processing, sound, image processing, images, and scientific measurements. Signal processing techniques are used to optimize transmissions, Data storage, digital storage efficiency, correcting distorted signals, subjective video quality and to also detect or pinpoint components of interest in a measured signal. History According to Alan V. Oppenheim and Ronald W. Schafer, the principles of signal processing can be found in the classical numerical analysis techniques of the 17th century. They further state that the digital refinement of these techniques can be found in the digital control systems of the 1940s and 1950s. In 1948, Claude Shannon wrote the influential paper "A Mathematical Theory of Communication" which was published in the Bell System Technical Journal. The paper laid the groundwork for later development of information c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Variational Inequalities
In mathematics, a variational inequality is an inequality involving a functional, which has to be solved for all possible values of a given variable, belonging usually to a convex set. The mathematical theory of variational inequalities was initially developed to deal with equilibrium problems, precisely the Signorini problem: in that model problem, the functional involved was obtained as the first variation of the involved potential energy. Therefore, it has a variational origin, recalled by the name of the general abstract problem. The applicability of the theory has since been expanded to include problems from economics, finance, optimization and game theory. History The first problem involving a variational inequality was the Signorini problem, posed by Antonio Signorini in 1959 and solved by Gaetano Fichera in 1963, according to the references and : the first papers of the theory were and , . Later on, Guido Stampacchia proved his generalization to the Lax–Milgram the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distributed Computing
A distributed system is a system whose components are located on different computer network, networked computers, which communicate and coordinate their actions by message passing, passing messages to one another from any system. Distributed computing is a field of computer science that studies distributed systems. The components of a distributed system interact with one another in order to achieve a common goal. Three significant challenges of distributed systems are: maintaining concurrency of components, overcoming the clock synchronization, lack of a global clock, and managing the independent failure of components. When a component of one system fails, the entire system does not fail. Examples of distributed systems vary from service-oriented architecture, SOA-based systems to massively multiplayer online games to peer-to-peer, peer-to-peer applications. A computer program that runs within a distributed system is called a distributed program, and ''distributed programming' ... [...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] |
Linear Programming
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear function#As a polynomial function, linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the mathematical optimization, optimization of a linear objective function, subject to linear equality and linear inequality Constraint (mathematics), constraints. Its feasible region is a convex polytope, which is a set defined as the intersection (mathematics), intersection of finitely many Half-space (geometry), half spaces, each of which is defined by a linear inequality. Its objective function is a real number, real-valued affine function, affine (linear) function defined on this polyhedron. A linear programming algorithm finds a point in the polytope where ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Interior Point Method
Interior-point methods (also referred to as barrier methods or IPMs) are a certain class of algorithms that solve linear and nonlinear convex optimization problems. An interior point method was discovered by Soviet mathematician I. I. Dikin in 1967 and reinvented in the U.S. in the mid-1980s. In 1984, Narendra Karmarkar developed a method for linear programming called Karmarkar's algorithm, which runs in provably polynomial time and is also very efficient in practice. It enabled solutions of linear programming problems that were beyond the capabilities of the simplex method. Contrary to the simplex method, it reaches a best solution by traversing the interior of the feasible region. The method can be generalized to convex programming based on a self-concordant barrier function used to encode the convex set. Any convex optimization problem can be transformed into minimizing (or maximizing) a linear function over a convex set by converting to the epigraph form. The idea of encodi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complexity
Complexity characterises the behaviour of a system or model whose components interaction, interact in multiple ways and follow local rules, leading to nonlinearity, randomness, collective dynamics, hierarchy, and emergence. The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of emergence greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of complex systems theory. The intuitive criterion of complexity can be formulated as follows: a system would be more complex if more parts could be distinguished, and if more connections between them existed. Science takes a number of approaches to characterizing complexity; Zayed ''et al.'' reflect many of these. Neil F. Johnson, Neil Johnson states that "even among scientists, there is no unique definition of complexity – and the scientific notion has traditionally been conveyed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zhi-Quan Tom Luo
Zhi-Quan (Tom) Luo (Chinese: 罗智泉; pinyin: ''Luó Zhìquán'') is Vice President (Academic) of The Chinese University of Hong Kong, Shenzhen, Director of Shenzhen Research Institute of Big Data and Director of CUHK(SZ)-Tencent AI Lab Joint Laboratory on Machine Intelligence. Education and experience Luo was born in November 1963 in Nanchang, China. He received his B.Sc. degree in Applied Mathematics from the Peking University, China, in 1984. He was then selected by a joint AMS-SIAM committee and the Ministry of Education of China for graduate study in the United States (S.S. Chern Program). After studying at the Nankai Institute of Mathematics, Tianjin, China, for one year, he went to study at the MIT and obtained a Ph.D. degree in Operations Research in 1989, under the supervision of John Tsitsiklis John N. Tsitsiklis ( el, Γιάννης Ν. Τσιτσικλής; born 1958) is a Clarence J. Lebel Professor of Electrical Engineering with the Department of Electrical Eng ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dimitri Bertsekas
Dimitri Panteli Bertsekas (born 1942, Athens, el, Δημήτρης Παντελής Μπερτσεκάς) is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe. Biography Bertsekas was born in Greece and lived his childhood there. He studied for five years at the National Technical University of Athens, Greece and studied for about a year and a half at The George Washington University, Washington, D.C., where he obtained his M.S. in electrical engineering in 1969, and for about two years at MIT, where he obtained his doctorate in system science in 1971. Prior to joining the MIT faculty in 1979, he taught for three years at the Engineering-Economic Systems Dept. of Stanford Un ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Optimization
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems of sorts arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries. In the more general approach, an optimization problem consists of maxima and minima, maximizing or minimizing a Function of a real variable, real function by systematically choosing Argument of a function, input values from within an allowed set and computing the Value (mathematics), value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. More generally, opti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
