Structure and Interpretation of Computer Programs


Harold Abelson - 1984
    This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.

The 125 Best Brain Teasers of All Time: A Mind-Blowing Challenge of Math, Logic, and Wordplay


Marcel Danesi - 2018
    Collected here to keep your wits sharp, The Best Brain Teasers of All Time features the cleverest brain teasers from around the world and throughout history.The Best Brain Teasers of All Time gives you hours of fun-filled entertainment with brain teasers that develop your problem-solving skills in math, logic, and wordplay. Organized as an integrated challenge, these brain teasers build in momentum as they increase in difficulty from classic nursery rhymes to the riddle of the sphinx.The Best Brain Teasers of All Time puts your mind to the test with: 125 Brain Teasers that require no special skills to solve. Plus, each question comes with an optional clue in case you get stumped and a handy answer key in the back to test yourself or play with friends Brain Teasers for Every Level that cater to beginners and advanced masterminds alike, with brain teasers organized by level of difficulty to improve your skills as you move forward Hints of History that provide fun facts and background information for every brain teaser Get ready to sharpen your wit with every “aha” moment. The Best Brain Teasers of All Time is a go-to source for timeless fun and mind-blowing challenges.

A First Course in String Theory


Barton Zwiebach - 2004
    The first part deals with basic ideas, reviewing special relativity and electromagnetism while introducing the concept of extra dimensions. D-branes and the classical dynamics of relativistic strings are discussed next, and the quantization of open and closed bosonic strings in the light-cone gauge, along with a brief introduction to superstrings. The second part begins with a detailed study of D-branes followed by string thermodynamics. It discusses possible physical applications, and covers T-duality of open and closed strings, electromagnetic fields on D-branes, Born/Infeld electrodynamics, covariant string quantization and string interactions. Primarily aimed as a textbook for advanced undergraduate and beginning graduate courses, it will also be ideal for a wide range of scientists and mathematicians who are curious about string theory.

Statistics for People Who (Think They) Hate Statistics


Neil J. Salkind - 2000
    The book begins with an introduction to the language of statistics and then covers descriptive statistics and inferential statistics. Throughout, the author offers readers:- Difficulty Rating Index for each chapter′s material- Tips for doing and thinking about a statistical technique- Top tens for everything from the best ways to create a graph to the most effective techniques for data collection- Steps that break techniques down into a clear sequence of procedures- SPSS tips for executing each major statistical technique- Practice exercises at the end of each chapter, followed by worked out solutions.The book concludes with a statistical software sampler and a description of the best Internet sites for statistical information and data resources. Readers also have access to a website for downloading data that they can use to practice additional exercises from the book. Students and researchers will appreciate the book′s unhurried pace and thorough, friendly presentation.

The Calendar


David Ewing Duncan - 1998
    The year 2000 is alternatively the year 2544 (Buddhist), 6236 (Ancient Egyptian), 5761 (Jewish) or simply the Year of the Dragon (Chinese). The story of the creation of the Western calendar, which is related in this book, is a story of emperors and popes, mathematicians and monks, and the growth of scientific calculation to the point where, bizarrely, our measurement of time by atomic pulses is now more accurate than time itself: the Earth is an elderly lady and slightly eccentric - she loses half a second a century. Days have been invented (Julius Caesar needed an extra 80 days in 46BC), lost (Pope Gregory XIII ditched ten days in 1582) and moved (because Julius Caesar had 31 in his month, Augustus determined that he should have the same, so he pinched one from February).

Applied Cryptography: Protocols, Algorithms, and Source Code in C


Bruce Schneier - 1993
    … The book the National Security Agency wanted never to be published." –Wired Magazine "…monumental… fascinating… comprehensive… the definitive work on cryptography for computer programmers…" –Dr. Dobb's Journal"…easily ranks as one of the most authoritative in its field." —PC Magazine"…the bible of code hackers." –The Millennium Whole Earth CatalogThis new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography—the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What's new in the Second Edition? * New information on the Clipper Chip, including ways to defeat the key escrow mechanism * New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher * The latest protocols for digital signatures, authentication, secure elections, digital cash, and more * More detailed information on key management and cryptographic implementations

The Elements of Statistical Learning: Data Mining, Inference, and Prediction


Trevor Hastie - 2001
    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.

Physics and Technology for Future Presidents: An Introduction to the Essential Physics Every World Leader Needs to Know


Richard A. Muller - 2006
    From the physics of energy to climate change, and from spy technology to quantum computers, this is the only textbook to focus on the modern physics affecting the decisions of political leaders and CEOs and, consequently, the lives of every citizen. How practical are alternative energy sources? Can satellites really read license plates from space? What is the quantum physics behind iPods and supermarket scanners? And how much should we fear a terrorist nuke? This lively book empowers students possessing any level of scientific background with the tools they need to make informed decisions and to argue their views persuasively with anyone--expert or otherwise.Based on Richard Muller's renowned course at Berkeley, the book explores critical physics topics: energy and power, atoms and heat, gravity and space, nuclei and radioactivity, chain reactions and atomic bombs, electricity and magnetism, waves, light, invisible light, climate change, quantum physics, and relativity. Muller engages readers through many intriguing examples, helpful facts to remember, a fun-to-read text, and an emphasis on real-world problems rather than mathematical computation. He includes chapter summaries, essay and discussion questions, Internet research topics, and handy tips for instructors to make the classroom experience more rewarding.Accessible and entertaining, "Physics and Technology for Future Presidents" gives students the scientific fluency they need to become well-rounded leaders in a world driven by science and technology.Professors: A supplementary Instructor's Manual is available for this book. It is restricted to teachers using the text in courses. For information on how to obtain a copy, refer to: http: //press.princeton.edu/class_use/solutio...

Introduction to Algorithms


Thomas H. Cormen - 1989
    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.