The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. KEY TOPICS: In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

    Verification that algorithms work is emphasized more than their complexity. An effective use of examples, and huge number of interesting exercises, demonstrate the topics of trees and distance, matchings and factors, connectivity and paths, graph coloring, edges and cycles, and planar graphs. For those who need to learn to make coherent arguments in the fields of mathematics and computer science.

    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.

    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).

    The presentation is never awkward or dry, as it sometimes is in other "modern" textbooks; it is as unconventional as one has come to expect from the author. The book contains about 350 well placed and instructive problems, which cover a considerable part of the subject. All in all, this is an excellent work, of equally high value for both student and teacher." Zentralblatt f�r Mathematik

    This book covers relevant geometric principles and how to represent objects algebraically so they can be computed and applied. Recent major developments in the theory and practice of scene reconstruction are described in detail in a unified framework. Richard Hartley and Andrew Zisserman provide comprehensive background material and explain how to apply the methods and implement the algorithms. First Edition HB (2000): 0-521-62304-9

    The author has a direct style. His book presents detailed and intensive explanations. Many diagrams and key examples are used to aid understanding, as well as the application of calculus to physics and engineering and economics. The text is well organized, and it covers single variable and multivariable calculus in depth. An instructor's manual and student guide are available online at http: //ocw.mit.edu/ans7870/resources/Strang/....

    Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.

    The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will be especially welcome. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement. All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered. The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms. In the second edition, besides revisions to the first edition, a number of new exercises have been added.

    Highlights of the book include realistic problems and examples from a wide range of application areas. New to this edition are: much sharper pedagogy; an increase in the number of examples; more thorough development of the concepts; a greater range of homework problems; a greater number and variety of worked out examples; expanded coverage of dynamics modelling and Laplace transform topics; and integration of MATLAB, including many examples that are formatted in MATLAB.

    The book encourages a critical discussion of the different approaches and looks at some of the most important thinkers and their influence.

    With pedagogical use of second color, it covers devices in one place so that circuit characteristics are developed early.

    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.

    Dozens of books have offered a variety of solutions to the puzzle, but they all draw on the same handful of documents and conflicting eyewitness accounts. Now, a wealth of new information uncovered by the International Group for Historic Aircraft Recovery (TIGHAR) allows this book to offer the first fully documented history of what happened. Scrupulously accurate and thrilling to read, it tells the story from the letters, logs, and telegrams that recorded events as they unfolded. Many long-accepted facts are revealed as myths. Author Ric Gillespie, TIGHAR's executive director, draws on the work of his organization's historians, archaeologists, and scientists, who compiled and analyzed more than five thousand documents relating to the Earhart case. Their research led to the hypothesis that Earhart and Noonan died as castaways on a remote Pacific atoll. But this book is not a polemic that argues for a particular theory. Rather, it presents all of the authenticated historical dots and leaves it to the reader to make the connections. In addition to details about the Earhart's career and final flight, the book examines her relationship with the U.S. government and the massive search undertaken by the U.S. Coast Guard and Navy. For serious students of Earhart's disappearance, an accompanying DVD reproduces the documents, reports, and technical studies cited in the text, allowing instant review and verification of the sources.

    With more traditional web servers becoming obsolete, having knowledge on servers that achieve high scalability and optimal resource consumption using Node.js is the key to your app development success. Teaching you the essentials to making event-driven server-side apps, this book demonstrates how you can use less space and take less time for communication between web client and server.Contains numerous hands-on examples Explains implementation of real-time apps including Socket.IO and HTML5, and WebSockets Addresses practical Node.js advantages from specific design choices Demonstrates why knowledge and use of JavaScript is beneficial Includes an interactive online component with sample chapters Explains components of stand out apps including brevity and benchmarks Looking to enhance your abilities even further? Smashing Node.js: JavaScript Everywhere makes developing server-side apps accessible with its focus on JavaScript, open source, and easy-to-use language.