The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

    This work offers accesible coverage of the fundamentals of electrodynamics, enhanced with with discussion points, examples and exercises.

    A simple web search picks out a handful of relevant needles from the world's biggest haystack: the billions of pages on the World Wide Web. Uploading a photo to Facebook transmits millions of pieces of information over numerous error-prone network links, yet somehow a perfect copy of the photo arrives intact. Without even knowing it, we use public-key cryptography to transmit secret information like credit card numbers; and we use digital signatures to verify the identity of the websites we visit. How do our computers perform these tasks with such ease? This is the first book to answer that question in language anyone can understand, revealing the extraordinary ideas that power our PCs, laptops, and smartphones. Using vivid examples, John MacCormick explains the fundamental "tricks" behind nine types of computer algorithms, including artificial intelligence (where we learn about the "nearest neighbor trick" and "twenty questions trick"), Google's famous PageRank algorithm (which uses the "random surfer trick"), data compression, error correction, and much more. These revolutionary algorithms have changed our world: this book unlocks their secrets, and lays bare the incredible ideas that our computers use every day.

    It reveals the attraction that has drawn leading mathematicians and amateurs alike to number theory over the course of history.

    The book's approach interweaves traditional topics with data analysis and reflects the use of the computer with close ties to the practice of statistics. The author stresses analysis of data, examines real problems with real data, and motivates the theory. The book's descriptive statistics, graphical displays, and realistic applications stand in strong contrast to traditional texts which are set in abstract settings.

    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.

    Whether you're a student, parent, or teacher, this book is your key to unlocking the aha! moments that make math truly click -- and make learning enjoyable.The book intentionally avoids mindless definitions and focuses on building a deep, natural intuition so you can integrate the ideas into your everyday thinking. Its explanations on the natural logarithm, imaginary numbers, exponents and the Pythagorean Theorem are among the most-visited in the world.The topics in Math, Better Explained include:1. Developing Math Intuition2. The Pythagorean Theorem3. Pythagorean Distance4. Radians and Degrees5. Imaginary Numbers6. Complex Arithmetic7. Exponential Functions & e8. The Natural Logarithm (ln)9. Interest Rates10. Understanding Exponents11. Euler’s Formula12. Introduction To CalculusThe book is written as the author wishes math was taught: with a friendly attitude, vivid illustrations and a focus on true understanding. Learn right, not rote!

    It would become the world's most baffling mathematical mystery. Simple, elegant, and utterly impossible to prove, Fermat's Last Theorem captured the imaginations of amateur and professional mathematicians for over three centuries. For some it became a wonderful passion. For others it was an obsession that led to deceit, intrigue, or insanity. In a volume filled with the clues, red herrings, and suspense of a mystery novel, Dr. Amir Aczel reveals the previously untold story of the people, the history, and the cultures that lie behind this scientific triumph. From formulas devised for the farmers of ancient Babylonia to the dramatic proof of Fermat's theorem in 1993, this extraordinary work takes us along on an exhilarating intellectual treasure hunt. Revealing the hidden mathematical order of the natural world in everything from stars to sunflowers, "Fermat's Last Theorem" brilliantly combines philosophy and hard science with investigative journalism. The result: a real-life detective story of the intellect, at once intriguing, thought-provoking, and impossible to put down.

    This book leads the reader from simple graphs through planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. Includes exercises. 1976 edition.

    The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.

    It is highly recommended for anyone planning to study advanced analysis, e.g., complex variables, differential equations, Fourier analysis, numerical analysis, several variable calculus, and statistics. It is also recommended for future secondary school teachers. A limited number of concepts involving the real line and functions on the real line are studied. Many abstract ideas, such as metric spaces and ordered systems, are avoided. The least upper bound property is taken as an axiom and the order properties of the real line are exploited throughout. A thorough treatment of sequences of numbers is used as a basis for studying standard calculus topics. Optional sections invite students to study such topics as metric spaces and Riemann-Stieltjes integrals.

    Not in an editor, IDE, or design tool. You're well educated on how to work with software and hardware, but what about wetware--our own brains? Learning new skills and new technology is critical to your career, and it's all in your head. In this book by Andy Hunt, you'll learn how our brains are wired, and how to take advantage of your brain's architecture. You'll learn new tricks and tips to learn more, faster, and retain more of what you learn. You need a pragmatic approach to thinking and learning. You need to Refactor Your Wetware. Programmers have to learn constantly; not just the stereotypical new technologies, but also the problem domain of the application, the whims of the user community, the quirks of your teammates, the shifting sands of the industry, and the evolving characteristics of the project itself as it is built. We'll journey together through bits of cognitive and neuroscience, learning and behavioral theory. You'll see some surprising aspects of how our brains work, and how you can take advantage of the system to improve your own learning and thinking skills.In this book you'll learn how to:Use the Dreyfus Model of Skill Acquisition to become more expertLeverage the architecture of the brain to strengthen different thinking modesAvoid common "known bugs" in your mindLearn more deliberately and more effectivelyManage knowledge more efficientlyPrinted in full color.

    It proceeds from familiar concepts to the unfamiliar, from the concrete to the abstract. Readers consistently praise this outstanding text for its expository style and clarity of presentation. The applications version features a wide variety of interesting, contemporary applications. Clear, accessible, step-by-step explanations make the material crystal clear. Established the intricate thread of relationships between systems of equations, matrices, determinants, vectors, linear transformations and eigenvalues.

    It shows how causality has grown from a nebulous concept into a mathematical theory with significant applications in the fields of statistics, artificial intelligence, philosophy, cognitive science, and the health and social sciences. Pearl presents a unified account of the probabilistic, manipulative, counterfactual and structural approaches to causation, and devises simple mathematical tools for analyzing the relationships between causal connections, statistical associations, actions and observations. The book will open the way for including causal analysis in the standard curriculum of statistics, artifical intelligence, business, epidemiology, social science and economics. Students in these areas will find natural models, simple identification procedures, and precise mathematical definitions of causal concepts that traditional texts have tended to evade or make unduly complicated. This book will be of interest to professionals and students in a wide variety of fields. Anyone who wishes to elucidate meaningful relationships from data, predict effects of actions and policies, assess explanations of reported events, or form theories of causal understanding and causal speech will find this book stimulating and invaluable. Professor of Computer Science at the UCLA, Judea Pearl is the winner of the 2008 Benjamin Franklin Award in Computers and Cognitive Science.

    The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to take a hard pass on Knuth's brilliant but impenetrable theories and the dense multi-page proofs you'll find in most textbooks, this is the book for you. This fully-illustrated and engaging guide makes it easy for you to learn how to use algorithms effectively in your own programs.Grokking Algorithms is a disarming take on a core computer science topic. In it, you'll learn how to apply common algorithms to the practical problems you face in day-to-day life as a programmer. You'll start with problems like sorting and searching. As you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression or artificial intelligence. Whether you're writing business software, video games, mobile apps, or system utilities, you'll learn algorithmic techniques for solving problems that you thought were out of your grasp. For example, you'll be able to:Write a spell checker using graph algorithmsUnderstand how data compression works using Huffman codingIdentify problems that take too long to solve with naive algorithms, and attack them with algorithms that give you an approximate answer insteadEach carefully-presented example includes helpful diagrams and fully-annotated code samples in Python. By the end of this book, you will know some of the most widely applicable algorithms as well as how and when to use them.