Book picks similar to
Geometric Partial Differential Equations and Image Analysis by Guillermo Sapiro


algorithms-and-computer-science
college-university-textbooks
computer-science
image-processing

The Strangest Man: The Hidden Life of Paul Dirac, Mystic of the Atom


Graham Farmelo - 2009
    He was one of the leading pioneers of the greatest revolution in twentieth-century science: quantum mechanics. The youngest theoretician ever to win the Nobel Prize for Physics, he was also pathologically reticent, strangely literal-minded and legendarily unable to communicate or empathize. Through his greatest period of productivity, his postcards home contained only remarks about the weather.Based on a previously undiscovered archive of family papers, Graham Farmelo celebrates Dirac's massive scientific achievement while drawing a compassionate portrait of his life and work. Farmelo shows a man who, while hopelessly socially inept, could manage to love and sustain close friendship.The Strangest Man is an extraordinary and moving human story, as well as a study of one of the most exciting times in scientific history.'A wonderful book . . . Moving, sometimes comic, sometimes infinitely sad, and goes to the roots of what we mean by truth in science.' Lord Waldegrave, Daily Telegraph

Collider: The Search for the World's Smallest Particles


Paul Halpern - 2009
    But what is the Higgs boson and why is it often referred to as the God Particle? Why are the Higgs and the LHC so important? Getting a handle on the science behind the LHC can be difficult for anyone without an advanced degree in particle physics, but you don't need to go back to school to learn about it. In Collider, award-winning physicist Paul Halpern provides you with the tools you need to understand what the LHC is and what it hopes to discover.Comprehensive, accessible guide to the theory, history, and science behind experimental high-energy physicsExplains why particle physics could well be on the verge of some of its greatest breakthroughs, changing what we think we know about quarks, string theory, dark matter, dark energy, and the fundamentals of modern physicsTells you why the theoretical Higgs boson is often referred to as the God particle and how its discovery could change our understanding of the universeClearly explains why fears that the LHC could create a miniature black hole that could swallow up the Earth amount to a tempest in a very tiny teapot"Best of 2009 Sci-Tech Books (Physics)"-Library Journal"Halpern makes the search for mysterious particles pertinent and exciting by explaining clearly what we don't know about the universe, and offering a hopeful outlook for future research."-Publishers WeeklyIncludes a new author preface, "The Fate of the Large Hadron Collider and the Future of High-Energy Physics"The world will not come to an end any time soon, but we may learn a lot more about it in the blink of an eye. Read Collider and find out what, when, and how.

From Mathematics to Generic Programming


Alexander A. Stepanov - 2014
    If you're a reasonably proficient programmer who can think logically, you have all the background you'll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem. As you read this book, you'll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You'll also gain deep insight into the value of mathematics to programming--insight that will prove invaluable no matter what programming languages and paradigms you use. You will learn aboutHow to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiencyAncient paradoxes, beautiful theorems, and the productive tension between continuous and discreteA simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on itPowerful mathematical approaches to abstractionHow abstract algebra provides the idea at the heart of generic programmingAxioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structuresSurprising subtleties of simple programming tasks and what you can learn from themHow practical implementations can exploit theoretical knowledge

The Algorithm Design Manual


Steven S. Skiena - 1997
    Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide. THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains: * a complete hypertext version of the full printed book. * the source code and URLs for all cited implementations. * over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.

Comptia A+ 220-801 and 220-802 Exam Cram


David L. Prowse - 2012
     Limited Time Offer: Buy CompTIA(R) A+ 220-801 and 220-802 Exam Cram and receive a 10% off discount code for the CompTIA A+ 220-801 and 220-802 exams. To receive your 10% off discount code:Register your product at pearsonITcertification.com/registerFollow the instructionsGo to your Account page and click on "Access Bonus Content" CompTIA(R) A+ 220-801 and 220-802 Exam Cram, Sixth Edition is the perfect study guide to help you pass CompTIA's A+ 220-801 and 220-802 exams. It provides coverage and practice questions for every exam topic, including substantial new coverage of Windows 7, new PC hardware, tablets, smartphones, and professional-level networking and security. The book presents you with an organized test preparation routine through the use of proven series elements and techniques. Exam topic lists make referencing easy. Exam Alerts, Sidebars, and Notes interspersed throughout the text keep you focused on what you need to know. Cram Quizzes help you assess your knowledge, and the Cram Sheet tear card is the perfect last minute review. Covers the critical information you'll need to know to score higher on your CompTIA A+ 220-801 and 220-802 exams!Deploy and administer desktops and notebooks running Windows 7, Vista, or XPUnderstand, install, and troubleshoot motherboards, processors, and memoryTest and troubleshoot power-related problemsUse all forms of storage, including new Blu-ray and Solid State (SSD) devicesWork effectively with mobile devices, including tablets and smartphonesInstall, configure, and troubleshoot both visible and internal laptop componentsConfigure Windows components and applications, use Windows administrative tools, and optimize Windows systemsRepair damaged Windows environments and boot errorsWork with audio and video subsystems, I/O devices, and the newest peripheralsInstall and manage both local and network printersConfigure IPv4 and understand TCP/IP protocols and IPv6 changesInstall and configure SOHO wired/wireless networks and troubleshoot connectivityImplement secure authentication, prevent malware attacks, and protect data Companion CDThe companion CD contains a digital edition of the Cram Sheet and the powerful Pearson IT Certification Practice Test engine, complete with hundreds of exam-realistic questions and two complete practice exams. The assessment engine offers you a wealth of customization options and reporting features, laying out a complete assessment of your knowledge to help you focus your study where it is needed most. Pearson IT Certifcation Practice Test Minimum System RequirementsWindows XP (SP3), WIndows Vista (SP2), or Windows 7Microsoft .NET Framework 4.0 ClientPentium-class 1 GHz processor (or equivalent)512 MB RAM650 MB disk space plus 50 MB for each downloaded practice exam David L. Prowse is an author, computer network specialist, and technical trainer. Over the past several years he has authored several titles for Pearson Education, including the well-received CompTIA A+ Exam Cram and CompTIA Security+ Cert Guide. As a consultant, he installs and secures the latest in computer and networking technology. He runs the website www.davidlprowse.com, where he gladly answers questions from students and readers.

Lectures on the Foundations of Mathematics, Cambridge 1939


Ludwig Wittgenstein - 1989
    A lecture class taught by Wittgenstein, however, hardly resembled a lecture. He sat on a chair in the middle of the room, with some of the class sitting in chairs, some on the floor. He never used notes. He paused frequently, sometimes for several minutes, while he puzzled out a problem. He often asked his listeners questions and reacted to their replies. Many meetings were largely conversation. These lectures were attended by, among others, D. A. T. Gasking, J. N. Findlay, Stephen Toulmin, Alan Turing, G. H. von Wright, R. G. Bosanquet, Norman Malcolm, Rush Rhees, and Yorick Smythies. Notes taken by these last four are the basis for the thirty-one lectures in this book. The lectures covered such topics as the nature of mathematics, the distinctions between mathematical and everyday languages, the truth of mathematical propositions, consistency and contradiction in formal systems, the logicism of Frege and Russell, Platonism, identity, negation, and necessary truth. The mathematical examples used are nearly always elementary.

Algorithms


Robert Sedgewick - 1983
    This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

Hello World: Being Human in the Age of Algorithms


Hannah Fry - 2018
    It’s time we stand face-to-digital-face with the true powers and limitations of the algorithms that already automate important decisions in healthcare, transportation, crime, and commerce. Hello World is indispensable preparation for the moral quandaries of a world run by code, and with the unfailingly entertaining Hannah Fry as our guide, we’ll be discussing these issues long after the last page is turned.

My Best Mathematical and Logic Puzzles


Martin Gardner - 1994
    He was especially careful to present new and unfamiliar puzzles that had not been included in such classic collections as those by Sam Loyd and Henry Dudeney. Later, these puzzles were published in book collections, incorporating reader feedback on alternate solutions or interesting generalizations.The present volume contains a rich selection of 70 of the best of these brain teasers, in some cases including references to new developments related to the puzzle. Now enthusiasts can challenge their solving skills and rattle their egos with such stimulating mind-benders as The Returning Explorer, The Mutilated Chessboard, Scrambled Box Tops, The Fork in the Road, Bronx vs. Brooklyn, Touching Cigarettes, and 64 other problems involving logic and basic math. Solutions are included.

Turing's Cathedral: The Origins of the Digital Universe


George Dyson - 2012
    In Turing’s Cathedral, George Dyson focuses on a small group of men and women, led by John von Neumann at the Institute for Advanced Study in Princeton, New Jersey, who built one of the first computers to realize Alan Turing’s vision of a Universal Machine. Their work would break the distinction between numbers that mean things and numbers that do things—and our universe would never be the same. Using five kilobytes of memory (the amount allocated to displaying the cursor on a computer desktop of today), they achieved unprecedented success in both weather prediction and nuclear weapons design, while tackling, in their spare time, problems ranging from the evolution of viruses to the evolution of stars. Dyson’s account, both historic and prophetic, sheds important new light on how the digital universe exploded in the aftermath of World War II. The proliferation of both codes and machines was paralleled by two historic developments: the decoding of self-replicating sequences in biology and the invention of the hydrogen bomb. It’s no coincidence that the most destructive and the most constructive of human inventions appeared at exactly the same time.  How did code take over the world? In retracing how Alan Turing’s one-dimensional model became John von Neumann’s two-dimensional implementation, Turing’s Cathedral offers a series of provocative suggestions as to where the digital universe, now fully three-dimensional, may be heading next.

Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation


Mark C. Chu-Carroll - 2013
    There is joy and beauty in mathematics, and in more than two dozen essays drawn from his popular “Good Math” blog, you’ll find concepts, proofs, and examples that are often surprising, counterintuitive, or just plain weird.Mark begins his journey with the basics of numbers, with an entertaining trip through the integers and the natural, rational, irrational, and transcendental numbers. The voyage continues with a look at some of the oddest numbers in mathematics, including zero, the golden ratio, imaginary numbers, Roman numerals, and Egyptian and continuing fractions. After a deep dive into modern logic, including an introduction to linear logic and the logic-savvy Prolog language, the trip concludes with a tour of modern set theory and the advances and paradoxes of modern mechanical computing.If your high school or college math courses left you grasping for the inner meaning behind the numbers, Mark’s book will both entertain and enlighten you.

MARVEL MATHEMATICS FOR MHT-CET


HEMANT G. AINAPURE
    CONTAINS MCQ'S

A Textbook of Engineering Mathematics


N.P. Bali - 2010
    The salient features of the book are as follows: It exactly covers the prescribed syllabus. Nothing undesirable has been included and nothing essential has been left. Its approach is explanatory and language is lucid and communicable. The exposition of the subject matter is systematic and the students are better prepared to solve the problems. All fundamentals of the included topics are explained with a micro-analysis. Sufficient number of solved examples have been given to let the students understand the various skills necessary to solve the problems. These examples are well-graded. Unsolved exercises of multi-varieties have been given in a well-graded style. Attempting those on his own, will enable a student to create confidence and independence in him/her regarding the understanding of the subject. Daily life problems and practical applications have been incorporated in the body of the text. A large number of attractive and accurate figures have been drawn which enable a student to grasp the subject in an easier way. All the answers have been checked and verified. About The Author: N.P. Bali is a prolific author of over 100 books for degree and engineering students. He has been writing books for more than forty years. His books on the following topics are well known for their easy comprehension and lucid presentation: Algebra, Trigonometry, Differential Calculus, Integral Calculus, Real Analysis, Co-ordinate Geometry, Statics, Dynamics etc. Dr. Manish Goyal has been associated with

Archimedes' Revenge: The Joys and Perils of Mathematics


Paul Hoffman - 1988
    An extremely clever account.--The New Yorker.

Types and Programming Languages


Benjamin C. Pierce - 2002
    The study of type systems--and of programming languages from a type-theoretic perspective--has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.