Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses.

    And this language is mathematics." In The Language of Mathematics, award-winning author Keith Devlin reveals the vital role mathematics plays in our eternal quest to understand who we are and the world we live in. More than just the study of numbers, mathematics provides us with the eyes to recognize and describe the hidden patterns of life—patterns that exist in the physical, biological, and social worlds without, and the realm of ideas and thoughts within.Taking the reader on a wondrous journey through the invisible universe that surrounds us—a universe made visible by mathematics—Devlin shows us what keeps a jumbo jet in the air, explains how we can see and hear a football game on TV, allows us to predict the weather, the behavior of the stock market, and the outcome of elections. Microwave ovens, telephone cables, children's toys, pacemakers, automobiles, and computers—all operate on mathematical principles. Far from a dry and esoteric subject, mathematics is a rich and living part of our culture. An exploration of an often woefully misunderstood subject, The Language of Mathematics celebrates the simplicity, the precision, the purity, and the elegance of mathematics.

    We have Mindstorms to thank for that. In this book, pioneering computer scientist Seymour Papert uses the invention of LOGO, the first child-friendly programming language, to make the case for the value of teaching children with computers. Papert argues that children are more than capable of mastering computers, and that teaching computational processes like de-bugging in the classroom can change the way we learn everything else. He also shows that schools saturated with technology can actually improve socialization and interaction among students and between students and teachers.

    Much of the book takes the form of a discussion between a teacher and his students. They propose various solutions to some mathematical problems and investigate the strengths and weaknesses of these solutions. Their discussion (which mirrors certain real developments in the history of mathematics) raises some philosophical problems and some problems about the nature of mathematical discovery or creativity. Imre Lakatos is concerned throughout to combat the classical picture of mathematical development as a steady accumulation of established truths. He shows that mathematics grows instead through a richer, more dramatic process of the successive improvement of creative hypotheses by attempts to 'prove' them and by criticism of these attempts: the logic of proofs and refutations.

    This concise introduction shows you how to perform statistical analysis computationally, rather than mathematically, with programs written in Python.You'll work with a case study throughout the book to help you learn the entire data analysis process—from collecting data and generating statistics to identifying patterns and testing hypotheses. Along the way, you'll become familiar with distributions, the rules of probability, visualization, and many other tools and concepts.Develop your understanding of probability and statistics by writing and testing codeRun experiments to test statistical behavior, such as generating samples from several distributionsUse simulations to understand concepts that are hard to grasp mathematicallyLearn topics not usually covered in an introductory course, such as Bayesian estimationImport data from almost any source using Python, rather than be limited to data that has been cleaned and formatted for statistics toolsUse statistical inference to answer questions about real-world data

    This is done in a way that is not only easy to understand, but is actually fun! Professors and engineers, with high school and college students following closely, comprise the largest percentage of our readers. It is a must-have for anyone interested in music, mathematics, physics, engineering, or complex science. Dr. Yoichiro Nambu, 2008 Nobel Prize Winner in Physics, served as a senior adviser to the English version of Who is Fourier? A Mathematical Adventure.

    The Art of Problem Solving, Volume 1, is the classic problem solving textbook used by many successful MATHCOUNTS programs, and have been an important building block for students who, like the authors, performed well enough on the American Mathematics Contest series to qualify for the Math Olympiad Summer Program which trains students for the United States International Math Olympiad team.Volume 1 is appropriate for students just beginning in math contests. MATHCOUNTS and novice high school students particularly have found it invaluable. Although the Art of Problem Solving is widely used by students preparing for mathematics competitions, the book is not just a collection of tricks. The emphasis on learning and understanding methods rather than memorizing formulas enables students to solve large classes of problems beyond those presented in the book.Speaking of problems, the Art of Problem Solving, Volume 1, contains over 500 examples and exercises culled from such contests as MATHCOUNTS, the Mandelbrot Competition, the AMC tests, and ARML. Full solutions (not just answers!) are available for all the problems in the solution manual.

    Widely recognized as the most comprehensive, accessible and practical basis for scientific computing, this new edition incorporates more than 400 Numerical Recipes routines, many of them new or upgraded. The executable C++ code, now printed in color for easy reading, adopts an object-oriented style particularly suited to scientific applications. The whole book is presented in the informal, easy-to-read style that made earlier editions so popular. Please visit www.nr.com or www.cambridge.org/us/numericalrecipes for more details. More information concerning licenses is available at: www.nr.com/licenses New key features: 2 new chapters, 25 new sections, 25% longer than Second Edition Thorough upgrades throughout the text Over 100 completely new routines and upgrades of many more. New Classification and Inference chapter, including Gaussian mixture models, HMMs, hierarchical clustering, Support Vector MachinesNew Computational Geometry chapter covers KD trees, quad- and octrees, Delaunay triangulation, and algorithms for lines, polygons, triangles, and spheres New sections include interior point methods for linear programming, Monte Carlo Markov Chains, spectral and pseudospectral methods for PDEs, and many new statistical distributions An expanded treatment of ODEs with completely new routines Plus comprehensive coverage of linear algebra, interpolation, special functions, random numbers, nonlinear sets of equations, optimization, eigensystems, Fourier methods and wavelets, statistical tests, ODEs and PDEs, integral equations, and inverse theory

    … The book the National Security Agency wanted never to be published." –Wired Magazine "…monumental… fascinating… comprehensive… the definitive work on cryptography for computer programmers…" –Dr. Dobb's Journal"…easily ranks as one of the most authoritative in its field." —PC Magazine"…the bible of code hackers." –The Millennium Whole Earth CatalogThis new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography—the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What's new in the Second Edition? * New information on the Clipper Chip, including ways to defeat the key escrow mechanism * New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher * The latest protocols for digital signatures, authentication, secure elections, digital cash, and more * More detailed information on key management and cryptographic implementations

    A remarkable pictorial discussion of the curved space-time we call home, it achieves even greater impact through the use of 141 excellent illustrations. This is the first sustained visual account of many important topics in relativity theory that up till now have only been treated separately.Finding a perfect analogy in the situation of the geometrical characters in Flatland, Professor Rucker continues the adventures of the two-dimensional world visited by a three-dimensional being to explain our three-dimensional world in terms of the fourth dimension. Following this adventure into the fourth dimension, the author discusses non-Euclidean geometry, curved space, time as a higher dimension, special relativity, time travel, and the shape of space-time. The mathematics is sound throughout, but the casual reader may skip those few sections that seem too purely mathematical and still follow the line of argument. Readable and interesting in itself, the annotated bibliography is a valuable guide to further study.Professor Rucker teaches mathematics at the State University of New York in Geneseo. Students and laymen will find his discussion to be unusually stimulating. Experienced mathematicians and physicists will find a great deal of original material here and many unexpected novelties. Annotated bibliography. 44 problems.

    The gold standard for attaining security is cryptography because it provides the most reliable tools for storing or transmitting digital information. Written by Niels Ferguson, lead cryptographer for Counterpane, Bruce Schneier's security company, and Bruce Schneier himself, this is the much anticipated follow-up book to Schneier's seminal encyclopedic reference, Applied Cryptography, Second Edition (0-471-11709-9), which has sold more than 150,000 copies. Niels Ferguson (Amsterdam, Netherlands) is a cryptographic engineer and consultant at Counterpane Internet Security. He has extensive experience in the creation and design of security algorithms, protocols, and multinational security infrastructures. Previously, Ferguson was a cryptographer for DigiCash and CWI. At CWI he developed the first generation of off-line payment protocols. He has published numerous scientific papers. Bruce Schneier (Minneapolis, MN) is Founder and Chief Technical Officer at Counterpane Internet Security, a managed-security monitoring company. He is also the author of Secrets and Lies: Digital Security in a Networked World (0-471-25311-1).

    It is suitable for a one or two semester university course on AI, as well as for researchers in the field.

    With its modern emphasis on the molecular view of physical chemistry, its wealth of contemporary applications (in the new "Impact on" features), vivid full-color presentation, and dynamic new media tools, the thoroughly revised new edition is again the most modern, most effective full-length textbook available for the physical chemistry classroom. NOW AVAILABLE IN SPLIT VOLUMESFor maximum flexibility in your physical chemistry course, this text isnow offered as a traditional or in two volumes.• Volume 1:  Thermodynamics and Kinetics (ISBN 0-7167-8567-6)• Volume 2:  Quantum Chemistry, Spectroscopy, and StatisticalThermodynamics (ISBN 0-7167-8569-2)See Table of Contents for the contents of each volume.

    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.

    This foundational text is the first comprehensive introduction to statistical natural language processing (NLP) to appear. The book contains all the theory and algorithms needed for building NLP tools. It provides broad but rigorous coverage of mathematical and linguistic foundations, as well as detailed discussion of statistical methods, allowing students and researchers to construct their own implementations. The book covers collocation finding, word sense disambiguation, probabilistic parsing, information retrieval, and other applications.