Nobel laureate Murray Gell-Mann offers a uniquely personal and unifying vision of the relationship between the fundamental laws of physics and the complexity and diversity of the natural world.

    Written with student centred, pedagogically driven approach, the text provides a self-contained introduction to the theory of signals and systems. This book looks at the concepts of systems, and also examines signals and the way that signals interact with physical systems. It covers topics ranging from basic signals and systems to signal analysis, properties of continuous-time Fourier transforms including Fourier transforms of standard signals, signal transmission through linear systems, relation between convolution and correlation of signals, sampling theorems and techniques, and transform analysis of LTI systems. All the solved and unsolved problems in this book are designed to illustrate the topics in a clear way.

    In this simple pattern beginning with two ones, each succeeding number is the sum of the two numbers immediately preceding it (1, 1, 2, 3, 5, 8, 13, 21, ad infinitum). Far from being just a curiosity, this sequence recurs in structures found throughout nature - from the arrangement of whorls on a pinecone to the branches of certain plant stems. All of which is astounding evidence for the deep mathematical basis of the natural world. With admirable clarity, two veteran math educators take us on a fascinating tour of the many ramifications of the Fibonacci numbers. They begin with a brief history of a distinguished Italian discoverer, who, among other accomplishments, was responsible for popularizing the use of Arabic numerals in the West. Turning to botany, the authors demonstrate, through illustrative diagrams, the unbelievable connections between Fibonacci numbers and natural forms (pineapples, sunflowers, and daisies are just a few examples). In art, architecture, the stock market, and other areas of society and culture, they point out numerous examples of the Fibonacci sequence as well as its derivative, the "golden ratio." And of course in mathematics, as the authors amply demonstrate, there are almost boundless applications in probability, number theory, geometry, algebra, and Pascal's triangle, to name a few.Accessible and appealing to even the most math-phobic individual, this fun and enlightening book allows the reader to appreciate the elegance of mathematics and its amazing applications in both natural and cultural settings.

    Now he brings his considerable talents to the history of one of math's most enduring puzzles: the seemingly paradoxical nature of infinity.Is infinity a valid mathematical property or a meaningless abstraction? The nineteenth-century mathematical genius Georg Cantor's answer to this question not only surprised him but also shook the very foundations upon which math had been built. Cantor's counterintuitive discovery of a progression of larger and larger infinities created controversy in his time and may have hastened his mental breakdown, but it also helped lead to the development of set theory, analytic philosophy, and even computer technology.Smart, challenging, and thoroughly rewarding, Wallace's tour de force brings immediate and high-profile recognition to the bizarre and fascinating world of higher mathematics.

    Imagine that you face three doors, behind one of which is a prize. You choose one but do not open it. The host--call him Monty Hall--opens a different door, alwayschoosing one he knows to be empty. Left with two doors, will you do better by sticking with your first choice, or by switching to the other remaining door? In this light-hearted yet ultimately serious book, Jason Rosenhouse explores the history of this fascinating puzzle. Using a minimum ofmathematics (and none at all for much of the book), he shows how the problem has fascinated philosophers, psychologists, and many others, and examines the many variations that have appeared over the years. As Rosenhouse demonstrates, the Monty Hall Problem illuminates fundamental mathematical issuesand has abiding philosophical implications. Perhaps most important, he writes, the problem opens a window on our cognitive difficulties in reasoning about uncertainty.

    But its myriad occurrences in art, nature, and science have been a source of speculation and wonder for thousands of years. Divine Proportion draws upon both religion and science to tell the story of Phi and to explore its manifestations in such diverse places as the structure of the inner ear, the spiral of a hurricane, the majesty of the Parthenon, and the elusive perfection of the Mona Lisa. A universal key to harmony, regeneration, and balance, Phi is at the heart of a tantalizing story begun on clay tablets in ancient Babylon, and which will continue to be written for centuries to come.

    Each chapter opens with a surprising insight—not a mathematic formula, but a common observation. From there, the authors leapfrog over math and anecdote toward profound ideas about nature, art, and music. Coincidences is a book for lovers of puzzles and posers of outlandish questions, lapsed math aficionados and the formula-phobic alike.

    From the classroom to the courtroom and from financial markets to supermarkets, Mlodinow's intriguing and illuminating look at how randomness, chance, and probability affect our daily lives will intrigue, awe, and inspire.

    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.

    With it has come vast amounts of data in a variety of fields such as medicine, biology, finance, and marketing. The challenge of understanding these data has led to the development of new tools in the field of statistics, and spawned new areas such as data mining, machine learning, and bioinformatics. Many of these tools have common underpinnings but are often expressed with different terminology. This book describes the important ideas in these areas in a common conceptual framework. While the approach is statistical, the emphasis is on concepts rather than mathematics. Many examples are given, with a liberal use of color graphics. It should be a valuable resource for statisticians and anyone interested in data mining in science or industry. The book's coverage is broad, from supervised learning (prediction) to unsupervised learning. The many topics include neural networks, support vector machines, classification trees and boosting—the first comprehensive treatment of this topic in any book. Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie wrote much of the statistical modeling software in S-PLUS and invented principal curves and surfaces. Tibshirani proposed the Lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many data-mining tools including CART, MARS, and projection pursuit.

    Theory and practice in the design of data graphics, 250 illustrations of the best (and a few of the worst) statistical graphics, with detailed analysis of how to display data for precise, effective, quick analysis. Design of the high-resolution displays, small multiples. Editing and improving graphics. The data-ink ratio. Time-series, relational graphics, data maps, multivariate designs. Detection of graphical deception: design variation vs. data variation. Sources of deception. Aesthetics and data graphical displays. This is the second edition of The Visual Display of Quantitative Information. Recently published, this new edition provides excellent color reproductions of the many graphics of William Playfair, adds color to other images, and includes all the changes and corrections accumulated during 17 printings of the first edition.

    R is packed with powerful programming capabilities, but learning to use R in the real world can be overwhelming for even the most seasoned statisticians. This easy-to-follow guide explains how to use R for data processing and statistical analysis, and then, shows you how to present your data using compelling and informative graphics. You'll gain practical experience using R in a variety of settings and delve deeper into R's feature-rich toolset.Includes tips for the initial installation of RDemonstrates how to easily perform calculations on vectors, arrays, and lists of dataShows how to effectively visualize data using R's powerful graphics packagesGives pointers on how to find, install, and use add-on packages created by the R communityProvides tips on getting additional help from R mailing lists and websitesWhether you're just starting out with statistical analysis or are a procedural programming pro, "R For Dummies" is the book you need to get the most out of R.

    Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. Some of the proofs are classics, but many are new and brilliant proofs of classical results. ...Aigner and Ziegler... write: ..". all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ... " Notices of the AMS, August 1999..". the style is clear and entertaining, the level is close to elementary ... and the proofs are brilliant. ..." LMS Newsletter, January 1999This third edition offers two new chapters, on partition identities, and on card shuffling. Three proofs of Euler's most famous infinite series appear in a separate chapter. There is also a number of other improvements, such as an exciting new way to "enumerate the rationals."

    It describes how the laws and discoveries of information theory now support controversial revisions to Darwinian evolution, begin to unravel the mysteries of language, memory and dreams, and stimulate provocative ideas in psychology, philosophy, art, music, computers and even the structure of society. Perhaps its most fascinating and unexpected surprise is the suggestion the order and complexity may be as natural as disorder and disorganization. Contrary to the entropy principle, which implies that order is the exception and confusion the rule, information theory asserts that order and sense can indeed prevail against disorder and nonsense. From the simplest forms of organic life to the words used to express our most complex ideas, from our genes to our dreams, from microcomputers to telecommunications, virtually everything around us follows simple rules of information. Life and the material world, like language, remain "grammatical." Grammatical man inhabits a grammatical universe.

    Yet Euler's formula is so simple it can be explained to a child. Euler's Gem tells the illuminating story of this indispensable mathematical idea.From ancient Greek geometry to today's cutting-edge research, Euler's Gem celebrates the discovery of Euler's beloved polyhedron formula and its far-reaching impact on topology, the study of shapes. In 1750, Euler observed that any polyhedron composed of V vertices, E edges, and F faces satisfies the equation V-E+F=2. David Richeson tells how the Greeks missed the formula entirely; how Descartes almost discovered it but fell short; how nineteenth-century mathematicians widened the formula's scope in ways that Euler never envisioned by adapting it for use with doughnut shapes, smooth surfaces, and higher dimensional shapes; and how twentieth-century mathematicians discovered that every shape has its own Euler's formula. Using wonderful examples and numerous illustrations, Richeson presents the formula's many elegant and unexpected applications, such as showing why there is always some windless spot on earth, how to measure the acreage of a tree farm by counting trees, and how many crayons are needed to color any map.Filled with a who's who of brilliant mathematicians who questioned, refined, and contributed to a remarkable theorem's development, Euler's Gem will fascinate every mathematics enthusiast.