Unnikrishna Pillai of Polytechnic University. The book is intended for a senior/graduate level course in probability and is aimed at students in electrical engineering, math, and physics departments. The authors' approach is to develop the subject of probability theory and stochastic processes as a deductive discipline and to illustrate the theory with basic applications of engineering interest. Approximately 1/3 of the text is new material--this material maintains the style and spirit of previous editions. In order to bridge the gap between concepts and applications, a number of additional examples have been added for further clarity, as well as several new topics.

    Beginning with the background and very nature of probability theory, the book then proceeds through sample spaces, combinatorial analysis, fluctuations in coin tossing and random walks, the combination of events, types of distributions, Markov chains, stochastic processes, and more. The book's comprehensive approach provides a complete view of theory along with enlightening examples along the way.

    This is the currently used textbook for "Probabilistic Systems Analysis," an introductory probability course at the Massachusetts Institute of Technology, attended by a large number of undergraduate and graduate students. The book covers the fundamentals of probability theory (probabilistic models, discrete and continuous random variables, multiple random variables, and limit theorems), which are typically part of a first course on the subject. It also contains, a number of more advanced topics, from which an instructor can choose to match the goals of a particular course. These topics include transforms, sums of random variables, least squares estimation, the bivariate normal distribution, and a fairly detailed introduction to Bernoulli, Poisson, and Markov processes. The book strikes a balance between simplicity in exposition and sophistication in analytical reasoning. Some of the more mathematically rigorous analysis has been just intuitively explained in the text, but is developed in detail (at the level of advanced calculus) in the numerous solved theoretical problems. The book has been widely adopted for classroom use in introductory probability courses within the USA and abroad.

    Focused on groups, rings and fields, this text gives students a firm foundation for more specialized work by emphasizing an understanding of the nature of algebraic structures. KEY TOPICS: Sets and Relations; GROUPS AND SUBGROUPS; Introduction and Examples; Binary Operations; Isomorphic Binary Structures; Groups; Subgroups; Cyclic Groups; Generators and Cayley Digraphs; PERMUTATIONS, COSETS, AND DIRECT PRODUCTS; Groups of Permutations; Orbits, Cycles, and the Alternating Groups; Cosets and the Theorem of Lagrange; Direct Products and Finitely Generated Abelian Groups; Plane Isometries; HOMOMORPHISMS AND FACTOR GROUPS; Homomorphisms; Factor Groups; Factor-Group Computations and Simple Groups; Group Action on a Set; Applications of G-Sets to Counting; RINGS AND FIELDS; Rings and Fields; Integral Domains; Fermat's and Euler's Theorems; The Field of Quotients of an Integral Domain; Rings of Polynomials; Factorization of Polynomials over a Field; Noncommutative Examples; Ordered Rings and Fields; IDEALS AND FACTOR RINGS; Homomorphisms and Factor Rings; Prime and Maximal Ideas; Gr�bner Bases for Ideals; EXTENSION FIELDS; Introduction to Extension Fields; Vector Spaces; Algebraic Extensions; Geometric Constructions; Finite Fields; ADVANCED GROUP THEORY; Isomorphism Theorems; Series of Groups; Sylow Theorems; Applications of the Sylow Theory; Free Abelian Groups; Free Groups; Group Presentations; GROUPS IN TOPOLOGY; Simplicial Complexes and Homology Groups; Computations of Homology Groups; More Homology Computations and Applications; Homological Algebra; Factorization; Unique Factorization Domains; Euclidean Domains; Gaussian Integers and Multiplicative Norms; AUTOMORPHISMS AND GALOIS THEORY; Automorphisms of Fields; The Isomorphism Extension Theorem; Splitting Fields; Separable Extensions; Totally Inseparable Extensions; Galois Theory; Illustrations of Galois Theory; Cyclotomic Extensions; Insolvability of the Quintic; Matrix Algebra MARKET: For all readers interested in abstract algebra.

    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

    The exposition is simple and leads to the most complete direct means of solving problems in mechanics. The final sections on adiabatic invariants have been revised and augmented. In addition a short biography of L D Landau has been inserted.

    CONGRATULATIONS TO HERBERT KROEMER, 2000 NOBEL LAUREATE FOR PHYSICS For upper-division courses in thermodynamics or statistical mechanics, Kittel and Kroemer offers a modern approach to thermal physics that is based on the idea that all physical systems can be described in terms of their discrete quantum states, rather than drawing on 19th-century classical mechanics concepts.

    

     This top-selling, theorem-proof text presents a careful treatment of the principal topics of linear algebra, and illustrates the power of the subject through a variety of applications. It emphasizes the symbiotic relationship between linear transformations and matrices, but states theorems in the more general infinite-dimensional case where appropriate.

    Publilius Syrus, Moral Sayings We've been very fortunate to receive fantastic feedback from our readers during the last four years, since the first edition of How to Solve It: Modern Heuristics was published in 1999. It's heartening to know that so many people appreciated the book and, even more importantly, were using the book to help them solve their problems. One professor, who published a review of the book, said that his students had given the best course reviews he'd seen in 15 years when using our text. There can be hardly any better praise, except to add that one of the book reviews published in a SIAM journal received the best review award as well. We greatly appreciate your kind words and personal comments that you sent, including the few cases where you found some typographical or other errors. Thank you all for this wonderful support.

    Worked examples and exercises support the text. An ELBS/LPBB edition is available.

    Shilov, Professor of Mathematics at the Moscow State University, covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional algebras and their representations, with an appendix on categories of finite-dimensional spaces.The author begins with elementary material and goes easily into the advanced areas, covering all the standard topics of an advanced undergraduate or beginning graduate course. The material is presented in a consistently clear style. Problems are included, with a full section of hints and answers in the back.Keeping in mind the unity of algebra, geometry and analysis in his approach, and writing practically for the student who needs to learn techniques, Professor Shilov has produced one of the best expositions on the subject. Because it contains an abundance of problems and examples, the book will be useful for self-study as well as for the classroom.

    This text introduces students to proof techniques and writing proofs of their own. As such, it is an introduction to the mathematics enterprise, providing solid introductions to relations, functions, and cardinalities of sets.

    It offers a comprehensive and accessible treatment of the theory of algorithms and complexity—the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

    Essentially, you make an initial guess, and then get more data to improve it. Bayes Theorem, or Bayes Rule, has a ton of real world applications, from estimating your risk of a heart attack to making recommendations on Netflix But It Isn't That Complicated This book is a short introduction to Bayes Theorem. It is only 15 pages long, and is intended to show you how Bayes Theorem works as quickly as possible. The examples are intentionally kept simple to focus solely on Bayes Theorem without requiring that the reader know complicated probability distributions. If you want to learn the basics of Bayes Theorem as quickly as possible, with some easy to duplicate examples, this is a good book for you.