Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics — profusely illustrated — include: Mathematical Models, Elementary Concepts of Graph Theory, Transportation Problems, Connection Problems, Party Problems, Digraphs and Mathematical Models, Games and Puzzles, Graphs and Social Psychology, Planar Graphs and Coloring Problems, and Graphs and Other Mathematics. A useful Appendix covers Sets, Relations, Functions, and Proofs, and a section devoted to exercises — with answers, hints, and solutions — is especially valuable to anyone encountering graph theory for the first time. Undergraduate mathematics students at every level, puzzlists, and mathematical hobbyists will find well-organized coverage of the fundamentals of graph theory in this highly readable and thoroughly enjoyable book.

    A basic idea that proved elusive for hundreds of years and bent the minds of the greatest thinkers in the world, the algorithm is what made the modern world possible. Without the algorithm, there would have been no computer, no Internet, no virtual reality, no e-mail, or any other technological advance that we rely on every day.In The Advent of the Algorithm, David Berlinski combines science, history, and math to explain and explore the intriguing story of how the algorithm was finally discovered by a succession of mathematicians and logicians, and how this paved the way for the digital age. Beginning with Leibniz and culminating in the middle of the twentieth century with the groundbreaking work of Gödel and Turing, The Advent of the Algorithm is an epic tale told with clarity and imaginative brilliance.

    This updated edition of Ross's classic bestseller provides an introduction to elementary probability theory and stochastic processes, and shows how probability theory can be applied to the study of phenomena in fields such as engineering, computer science, management science, the physical and social sciences, and operations research. With the addition of several new sections relating to actuaries, this text is highly recommended by the Society of Actuaries.This book now contains a new section on compound random variables that can be used to establish a recursive formula for computing probability mass functions for a variety of common compounding distributions; a new section on hiddden Markov chains, including the forward and backward approaches for computing the joint probability mass function of the signals, as well as the Viterbi algorithm for determining the most likely sequence of states; and a simplified approach for analyzing nonhomogeneous Poisson processes. There are also additional results on queues relating to the conditional distribution of the number found by an M/M/1 arrival who spends a time t in the system; inspection paradox for M/M/1 queues; and M/G/1 queue with server breakdown. Furthermore, the book includes new examples and exercises, along with compulsory material for new Exam 3 of the Society of Actuaries.This book is essential reading for professionals and students in actuarial science, engineering, operations research, and other fields in applied probability.

    Plethora of Solved examples help the students know the variety of problems & Procedure to solve them. Plenty of practice problems facilitate testing their understanding of the subject. Key Features: Covers the syllabus of all the four papers of Engineering Mathematics Detailed coverage of topics with lot of solved examples rendering clear understanding to the students. Engineering Applications of Integral Calculus, Ordinary Differential Equations of First and Higher Order, & Partial Differential Equations illustrate the use of these methods. Chapters on preliminary topics like Analytical Solid Geometry Matrices and Determinants Sequence and Series Complex Numbers Vector Algebra Differential and Integral Calculus Extensive coverage of Probability and Statistics (5 chapters). Covers the syllabus of all the four papers of Engineering Mathematics Engineering Applications of Integral Calculus, Ordinary Differential Equations of First and Higher Order, & Partial Differential Equations illustrate the use of these methods. Extensive coverage of ?Probability and Statistics (5 chapters) Table of Content: PART I PRELIMI NARIES Chapter 1 Vector Algebra , Theory of Equations ,Complex Numbers PART II DIFFERENTIAL AND INTEGRAL CALCULUS

    A riveting history of counting and calculating, from the time of the cave dwellers to the twentieth century, this fascinating volume brings numbers to thrilling life, explaining their development in human terms, the intriguing situations that made them necessary, and the brilliant achievements in human thought that they made possible. It takes us through the numbers story from Europe to China, via ancient Greece and Rome, Mesopotamia, Latin America, India, and the Arabic countries. Exploring the many ways civilizations developed and changed their mathematical systems, Ifrah imparts a unique insight into the nature of human thought–and into how our understanding of numbers and the ways they shape our lives have changed and grown over thousands of years.

    … 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

    It explains what algorithms do, how they are used, the risks associated with using them, and why governments should be concerned. Important areas arehighlighted, such as Stream Ciphers, block ciphers, public key algorithms, digital signatures, and applications such as e-commerce. This book highlights the explosive impact of cryptography on modern society, with, for example, the evolution of the internet and the introduction of more sophisticatedbanking methods.

    Fasten yourself into the first ever rollercoaster, as you ride through time and help Jexter The Clown, collect the oddest of oddities, the most freakish of freaks, and the grandest performers ever to perform under the big-top! This dark caravan of misfits needs just one thing to complete the show fantastical... YOU!Do not enter a carnival... Enter The Carnival! "ENTER THE CARNIVAL" "CARNIVAL COMICS" and "CARNIVAL OF SOULS" are Registered Trademarks.

    This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.

    Inside: Logic Resource CD-ROM

    Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen years old, most of the material is timeless and presents a “Feynmanesque” overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

    Stewart's Calculus is successful throughout the world because he explains the material in a way that makes sense to a wide variety of readers. His explanations make ideas come alive, and his problems challenge, to reveal the beauty of calculus. Stewart's examples stand out because they are not just models for problem solving or a means of demonstrating techniques--they also encourage readers to develp an analytic view of the subject. This edition includes new problems, examples, and projects. This version of Stewart's book introduced exponential and logarithmic functions in the first chapter and their limits and derivatives are found in Chapters 2 and 3.

    Offering inspiration and intellectual delight, the problems throughout the book encourage students to express their ideas in writing to explain how they conceive problems, what conjectures they make, and what conclusions they reach. Applying specific techniques and strategies, readers will acquire a solid understanding of the fundamental concepts and ideas of number theory.

    But sometimes the solutions are not as interesting as the beautiful symmetric patterns that lead to them. Written in a friendly style for a general audience, Fearless Symmetry is the first popular math book to discuss these elegant and mysterious patterns and the ingenious techniques mathematicians use to uncover them.Hidden symmetries were first discovered nearly two hundred years ago by French mathematician �variste Galois. They have been used extensively in the oldest and largest branch of mathematics--number theory--for such diverse applications as acoustics, radar, and codes and ciphers. They have also been employed in the study of Fibonacci numbers and to attack well-known problems such as Fermat's Last Theorem, Pythagorean Triples, and the ever-elusive Riemann Hypothesis. Mathematicians are still devising techniques for teasing out these mysterious patterns, and their uses are limited only by the imagination.The first popular book to address representation theory and reciprocity laws, Fearless Symmetry focuses on how mathematicians solve equations and prove theorems. It discusses rules of math and why they are just as important as those in any games one might play. The book starts with basic properties of integers and permutations and reaches current research in number theory. Along the way, it takes delightful historical and philosophical digressions. Required reading for all math buffs, the book will appeal to anyone curious about popular mathematics and its myriad contributions to everyday life.