Illustrations and examples throughout show you how you can apply research to practice. Studying is made easy with a book-specific website that provides you with tutorial quizzes and links to additional related concepts. Outlines, introductions, boxes, chapter endings with main points, review questions and exercises, and internet exercises provide you with the information and practice you need to succeed in this course.

    The first and only true textbook written by professors who teach the undergraduate course, it presents the most current concepts in an experimental context with clinical advances highlighted in boxes, supported by the kind of helpful pedagogical tools that other books do not provide.

    Like its predecessors, the seventh edition includes the absolute minimum of mathematical/statistical notation necessary to teach the material. Concepts are fully explained in simple, easy-to-understand language as they are presented, making the book an excellent source from which to learn and teach. After each discussion, readers are guided through real-world examples to show how book principles work in professional practice. Includes easy-to-understand explanations of difficult statistical topics, such as sampling distributions, relationship between confidence level and confidence interval, interpreting r-square. A complete package of teaching/learning aids is provided in every chapter, including chapter review exercises, chapter concepts tests,"Statistics at Work" conceptual cases, "Computer Database Exercises," "From the Textbook to the Real-World Examples." This ISBN is in two volumes Part A and Part B.

    Turing Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be "computable," creating the field of computability theory in the process, a foundation of present-day computer programming.The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others.Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41.

    It's goal is the successful design and operation of chemical reactors. This text emphasizes qualitative arguments, simple design methods, graphical procedures, and frequent comparison of capabilities of the major reactor types. Simple ideas are treated first, and are then extended to the more complex.

    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.

    Now in its eleventh edition, it has become the standard introductory text for accounting students and professionals alike. The book is used on a wide variety of courses in accounting and business, both at secondary and tertiary level and for those studying for professional qualifications. It builds on Business Accounting 1 to cover advanced aspects of financial accounting. It also covers introductory aspects of management accounting suitable for use at all levels up to and including professional foundation level courses and first-year degree courses.

    Readers are encouraged to do math rather than just study it. The author draws upon his experience as a coach for the International Mathematics Olympiad to give students an enhanced sense of mathematics and the ability to investigate and solve problems.

    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.

    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.

    Charlotte Roberts and Keith Manchester offer a vivid picture of ancient disease and trauma by combining the results of scientific research with information gathered from documents, other areas of archaeology, art, and ethnography. The book contains information on congenital, infectious, dental, joint, endocrine, and metabolic diseases. The authors provide a clinical context for specific ailments and accidents and consider the relevance of ancient demography, basic bone biology, funerary practices, and prehistoric medicine. This fully revised third edition has been updated to and encompasses rapidly developing research methods of in this fascinating field.

    Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen years old, most of the material is timeless and presents a “Feynmanesque” overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

    Evolutionary Dynamics is concerned with these equations of life. In this book, Martin A. Nowak draws on the languages of biology and mathematics to outline the mathematical principles according to which life evolves. His work introduces readers to the powerful yet simple laws that govern the evolution of living systems, no matter how complicated they might seem. Evolution has become a mathematical theory, Nowak suggests, and any idea of an evolutionary process or mechanism should be studied in the context of the mathematical equations of evolutionary dynamics. His book presents a range of analytical tools that can be used to this end: fitness landscapes, mutation matrices, genomic sequence space, random drift, quasispecies, replicators, the Prisoner's Dilemma, games in finite and infinite populations, evolutionary graph theory, games on grids, evolutionary kaleidoscopes, fractals, and spatial chaos. Nowak then shows how evolutionary dynamics applies to critical real-world problems, including the progression of viral diseases such as AIDS, the virulence of infectious agents, the unpredictable mutations that lead to cancer, the evolution of altruism, and even the evolution of human language. His book makes a clear and compelling case for understanding every living system--and everything that arises as a consequence of living systems--in terms of evolutionary dynamics.

    … 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

    "Interpersonal Communication, 2e" demonstrates how effective interpersonal communication can make students' lives better. With careful consideration given to the impact of computer-mediated communication, the program reflects the rapid changes of the modern world in which today's students live and interact. The program also helps students understand and build interpersonal skills and choices for their academic, personal, and professional lives.