Hasil Pencarian  ::  Simpan CSV :: Kembali

"This update of the 1987 title of the same name is an examination of what is currently known about the probabilistic method, written by one of its principal developers. Based on the notes from Spencer's 1986 series of ten lectures, this new edition contains an additional lecture: The Janson Inequalities. These inequalities allow accurate approximation of extremely small probabilities. A new algorithmic approach to the Lovasz Local Lemma, attributed to Jozsef Beck, has been added to Lecture 8, as well. Throughout the monograph, Spencer retains the informal style of his original lecture notes and emphasizes the methodology, shunning the more technical "best possible" results in favor of clearer exposition. The book is not encyclopedic--it contains only those examples that clearly display the methodology. The probabilistic method is a powerful tool in graph theory, combinatorics, and theoretical computer science. It allows one to prove the existence of objects with certain properties (e.g., colorings) by showing that an appropriately defined random object has positive probability of having those properties."

"Basic Concepts of Probability and Statistics provides a mathematically rigorous introduction to the fundamental ideas of modern statistics for readers without a calculus background. It is the only book at this level to introduce readers to modern concepts of hypothesis testing and estimation, covering basic concepts of finite, discrete models of probability and elementary statistical methods. Although published in 1970, it maintains a modern outlook, especially in its emphasis on models and model building and also by its coverage of topics such as simple random and stratified survey sampling, experimental design, and nonparametric tests and its discussion of power. The book covers a wide range of applications in manufacturing, biology, and social science, including demographics, political science, and sociology."

"This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings. Still, there are several nongeometric optimization problems that receive full treatment, and these include the problems of the longest common subsequence and the longest increasing subsequence. The philosophy that guides the exposition is that analysis of concrete problems is the most effective way to explain even the most general methods or abstract principles."

"It is a commonplace that scientific inquiry makes extensive use of probabilities, many of which seem to be objective chances, describing features of reality that are independent of our minds. Such chances appear to have a number of paradoxical or puzzling features: they appear to be mind-independent facts, but they are intimately connected with rational psychology; they display a temporal asymmetry, but they are supposed to be grounded in physical laws that are time-symmetric; and chances are used to explain and predict frequencies of events, although they cannot be reduced to those frequencies. This book offers an accessible and non-technical introduction to these and other puzzles. Toby Handfield engages with traditional metaphysics and philosophy of science, drawing upon recent work in the foundations of quantum mechanics and thermodynamics to provide a novel account of objective probability that is empirically informed without requiring specialist scientific knowledge."