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.

    These singularities are places where space-time begins or ends, and the presently known laws of physics break down. They will occur inside black holes, and in the past are what might be construed as the beginning of the universe. To show how these predictions arise, the authors discuss the General Theory of Relativity in the large. Starting with a precise formulation of the theory and an account of the necessary background of differential geometry, the significance of space-time curvature is discussed and the global properties of a number of exact solutions of Einstein's field equations are examined. The theory of the causal structure of a general space-time is developed, and is used to study black holes and to prove a number of theorems establishing the inevitability of singualarities under certain conditions. A discussion of the Cauchy problem for General Relativity is also included in this 1973 book.

    The first part deals with basic ideas, reviewing special relativity and electromagnetism while introducing the concept of extra dimensions. D-branes and the classical dynamics of relativistic strings are discussed next, and the quantization of open and closed bosonic strings in the light-cone gauge, along with a brief introduction to superstrings. The second part begins with a detailed study of D-branes followed by string thermodynamics. It discusses possible physical applications, and covers T-duality of open and closed strings, electromagnetic fields on D-branes, Born/Infeld electrodynamics, covariant string quantization and string interactions. Primarily aimed as a textbook for advanced undergraduate and beginning graduate courses, it will also be ideal for a wide range of scientists and mathematicians who are curious about string theory.

    The Authors Discuss The Mathematical Theory In Detail And Then Provide The Geometric Interpretation Necessary To Make 3D Math Intuitive. Working C++ Classes Illustrate How To Put The Techniques Into Practice, And Exercises At The End Of Each Chapter Help Reinforce The Concepts. This Book Explains Basic Concepts Such As Vectors, Coordinate Spaces, Matrices, Transformations, Euler Angles, Homogenous Coordinates, Geometric Primitives, Intersection Tests, And Triangle Meshes. It Discusses Orientation In 3D, Including Thorough Coverage Of Quaternions And A Comparison Of The Advantages And Disadvantages Of Different Representation Techniques. The Text Describes Working C++ Classes For Mathematical And Geometric Entities And Several Different Matrix Classes, Each Tailored To Specific Geometric Tasks. Also Included Are Complete Derivations For All The Primitive Transformation Matrices.

    Mathematical concepts and computational problems are motivated by applications in computer science. The reader learns by "doing," writing programs to implement the mathematical concepts and using them to carry out tasks and explore the applications. Examples include: error-correcting codes, transformations in graphics, face detection, encryption and secret-sharing, integer factoring, removing perspective from an image, PageRank (Google's ranking algorithm), and cancer detection from cell features. A companion web site, codingthematrix.com provides data and support code. Most of the assignments can be auto-graded online. Over two hundred illustrations, including a selection of relevant "xkcd" comics. Chapters: "The Function," "The Field," "The Vector," "The Vector Space," "The Matrix," "The Basis," "Dimension," "Gaussian Elimination," "The Inner Product," "Special Bases," "The Singular Value Decomposition," "The Eigenvector," "The Linear Program"

    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.

    Groundbreaking in every way when first published, this book is a simple, straightforward, direct calculus text. It's popularity is directly due to its broad use of applications, the easy-to-understand writing style, and the wealth of examples and exercises which reinforce conceptualization of the subject matter. The author wrote this text with three objectives in mind. The first was to make the book more student-oriented by expanding discussions and providing more examples and figures to help clarify concepts. To further aid students, guidelines for solving problems were added in many sections of the text. The second objective was to stress the usefulness of calculus by means of modern applications of derivatives and integrals. The third objective, to make the text as accurate and error-free as possible, was accomplished by a careful examination of the exposition, combined with a thorough checking of each example and exercise.

    The analytic material is accompanied by many applications, examples, and exercises. The theory of noncooperative games studies the behavior of agents in any situation where each agent's optimal choice may depend on a forecast of the opponents' choices. "Noncooperative" refers to choices that are based on the participant's perceived selfinterest. Although game theory has been applied to many fields, Fudenberg and Tirole focus on the kinds of game theory that have been most useful in the study of economic problems. They also include some applications to political science. The fourteen chapters are grouped in parts that cover static games of complete information, dynamic games of complete information, static games of incomplete information, dynamic games of incomplete information, and advanced topics.--mitpress.mit.edu

    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.

    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.

    This edition was rewritten, updated, and released on April 28, 2015.When recently-divorced American John Hammond arrives on the Aegean island of Samos, he is unaware of events that happened nearly seven decades earlier that will embroil him in death and violence, and change his life forever.Late one night he finds Greek fisherman Petros Vangelos mortally wounded in an alley. Vangelos gives Hammond a coded map before he expires. With that map, Hammond becomes the link to a Turkish tramp steamer named Sabiya that sank in a storm in 1945 with a fortune in gold and jewels aboard. Also on the Sabiya, in a waterproof safe, are documents that implicate a long-dead German SS Officer in the theft of tens of millions of dollars in valuables from Holocaust victims and the laundering of those valuables by the Nazi’s Swiss banker partner. That partnership helped build a huge banking enterprise that is now run by that Swiss banker’s son who will stop at nothing to prevent disclosure of his father’s crimes.Hammond’s visit to Samos quickly turns into a roller coaster ride on which he encounters violence, new friendships, and a woman he loves, all of which irrevocably alter the course of his life.The Pythagorean Solution is a thrilling, non-stop adventure that will make the reader want to reserve a seat on a flight to Samos.> This is a new release of a previously published edition.

    The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional coverage of introductory material such as 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.

    In chapters that follow, detailed topic reviews cover polynomial, trigonometric, exponential, logarithmic, and rational functions; coordinate and three-dimensional geometry; numbers and operations; data analysis, statistics, and probability; and graphing calculators, their operations and applications. Six full-length model tests with answers, explanations, and self-evaluation charts conclude this manual.