Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen—coauthor of the leading college textbook on the subject—provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems.
Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order (“sorting”); how to solve basic problems that can be modeled in a computer with a mathematical structure called a “graph” (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.
The classical view of concepts in psychology was challenged in the 1970s when experimental evidence showed that concept categories are graded and thus cannot be represented adequately by classical sets. The possibility of using fuzzy set theory and fuzzy logic for representing and dealing with concepts was recognized initially but then virtually abandoned in the early 1980s. In this volume, leading researchers—both psychologists working on concepts and mathematicians working on fuzzy logic—reassess the usefulness of fuzzy logic for the psychology of concepts.
The book begins with two tutorials—one on concepts and the other on fuzzy logic—aimed at making relevant experimental and theoretical issues accessible to researchers in both fields. The contributors then discuss the experiments that led to the rejection of the classical view of concepts; analyze the various arguments against the use of fuzzy logic in the psychology of concepts and show that they are fallacious; review methods based on sound measurement principles for constructing fuzzy sets; introduce formal concept analysis and its capabilities when generalized by using fuzzy logic; consider conceptual combinations; examine lexical concepts; and propose a research program based on cooperation between researchers in the psychology of concepts and fuzzy logic.
Historians of mathematics have devoted considerable attention to Isaac Newton’s work on algebra, series, fluxions, quadratures, and geometry. In Isaac Newton on Mathematical Certainty and Method, Niccolò Guicciardini examines a critical aspect of Newton’s work that has not been tightly connected to Newton’s actual practice: his philosophy of mathematics. Newton aimed to inject certainty into natural philosophy by deploying mathematical reasoning (titling his main work The Mathematical Principles of Natural Philosophy most probably to highlight a stark contrast to Descartes’s Principles of Philosophy). To that end he paid concerted attention to method, particularly in relation to the issue of certainty, participating in contemporary debates on the subject and elaborating his own answers. Guicciardini shows how Newton carefully positioned himself against two giants in the “common” and “new” analysis, Descartes and Leibniz. Although his work was in many ways disconnected from the traditions of Greek geometry, Newton portrayed himself as antiquity's legitimate heir, thereby distancing himself from the moderns. Guicciardini reconstructs Newton’s own method by extracting it from his concrete practice and not solely by examining his broader statements about such matters. He examines the full range of Newton’s works, from his early treatises on series and fluxions to the late writings, which were produced in direct opposition to Leibniz. The complex interactions between Newton’s understanding of method and his mathematical work then reveal themselves through Guicciardini’s careful analysis of selected examples. Isaac Newton on Mathematical Certainty and Method uncovers what mathematics was for Newton, and what being a mathematician meant to him.
“Mathematics can be as effortless as humming a tune, if you know the tune,” writes Gareth Loy. In Musimathics, Loy teaches us the tune, providing a friendly and spirited tour of the mathematics of music--a commonsense, self-contained introduction for the nonspecialist reader. It is designed for musicians who find their art increasingly mediated by technology, and for anyone who is interested in the intersection of art and science.
In Volume 1, Loy presents the materials of music (notes, intervals, and scales); the physical properties of music (frequency, amplitude, duration, and timbre); the perception of music and sound (how we hear); and music composition. Calling himself “a composer seduced into mathematics,” Loy provides answers to foundational questions about the mathematics of music accessibly yet rigorously. The examples given are all practical problems in music and audio.
Volume 2 of Musimathics continues the story of music engineering begun in volume 1, focusing on the digital and computational domain. Loy goes deeper into the mathematics of music and sound, beginning with digital audio, sampling, and binary numbers, as well as complex numbers and how they simplify representation of musical signals. Chapters cover the Fourier transform, convolution, filtering, resonance, the wave equation, acoustical systems, sound synthesis, the short-time Fourier transform, and the wavelet transform. These subjects provide the theoretical underpinnings of today’s music technology. The examples given are all practical problems in music and audio. Additional material can be found at http://www.musimathics.com.
Downloadable instructor resources available for this title: file of figures in the book
In problem solving, as in street fighting, rules are for fools: do whatever works--don’t just stand there! Yet we often fear an unjustified leap even though it may land us on a correct result. Traditional mathematics teaching is largely about solving exactly stated problems exactly, yet life often hands us partly defined problems needing only moderately accurate solutions. This engaging book is an antidote to the rigor mortis brought on by too much mathematical rigor, teaching us how to guess answers without needing a proof or an exact calculation.In Street-Fighting Mathematics, Sanjoy Mahajan builds, sharpens, and demonstrates tools for educated guessing and down-and-dirty, opportunistic problem solving across diverse fields of knowledge--from mathematics to management. Mahajan describes six tools: dimensional analysis, easy cases, lumping, picture proofs, successive approximation, and reasoning by analogy. Illustrating each tool with numerous examples, he carefully separates the tool--the general principle--from the particular application so that the reader can most easily grasp the tool itself to use on problems of particular interest. Street-Fighting Mathematics grew out of a short course taught by the author at MIT for students ranging from first-year undergraduates to graduate students ready for careers in physics, mathematics, management, electrical engineering, computer science, and biology. They benefited from an approach that avoided rigor and taught them how to use mathematics to solve real problems.Street-Fighting Mathematics will appear in print and online under a Creative Commons Noncommercial Share Alike license.
Robert Reitano’s Introduction to Quantitative Finance offers an accessible yet rigorous development of many of the fields of mathematics necessary for success in investment and quantitative finance, covering topics applicable to portfolio theory, investment banking, option pricing, investment, and insurance risk management. The approach emphasizes the mathematical framework provided by each mathematical discipline, and the application of each framework to the solution of finance problems. This manual provides solutions to the Practice Exercises in the text.
This text offers an accessible yet rigorous development of many of the fields of mathematics necessary for success in investment and quantitative finance, covering topics applicable to portfolio theory, investment banking, option pricing, investment, and insurance risk management. The approach emphasizes the mathematical framework provided by each mathematical discipline, and the application of each framework to the solution of finance problems. It emphasizes the thought process and mathematical approach taken to develop each result instead of the memorization of formulas to be applied (or misapplied) automatically. The objective is to provide a deep level of understanding of the relevant mathematical theory and tools that can then be effectively used in practice, to teach students how to “think in mathematics” rather than simply to do mathematics by rote. Each chapter covers an area of mathematics such as mathematical logic, Euclidean and other spaces, set theory and topology, sequences and series, probability theory, and calculus, in each case presenting only material that is most important and relevant for quantitative finance. Each chapter includes finance applications that demonstrate the relevance of the material presented. Problem sets are offered on both the mathematical theory and the finance applications sections of each chapter. The logical organization of the book and the judicious selection of topics make the text customizable for a number of courses. The development is self-contained and carefully explained to support disciplined independent study as well. A solutions manual for students provides solutions to the book’s Practice Exercises; an instructor’s manual offers solutions to the Assignment Exercises as well as other materials.
Downloadable instructor resources available for this title: instructor's manual
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.
Downloadable instructor resources available for this title: instructor’s manual, file of figures in the book, and pseudocode