They are spy satellites--the means by which the super-pwers keep tabs on each other in the deep black of space. Excellent . . . Highly recommended!--Booklist.

    Unlike traditional empirical psychology, it is more oriented toward the how than the what. An experiment in mind design is more likely to be an attempt to build something and make it work--as in artificial intelligence--than to observe or analyze what already exists. Mind design is psychology by reverse engineering.When Mind Design was first published in 1981, it became a classic in the then-nascent fields of cognitive science and AI. This second edition retains four landmark essays from the first, adding to them one earlier milestone (Turing's Computing Machinery and Intelligence) and eleven more recent articles about connectionism, dynamical systems, and symbolic versus nonsymbolic models. The contributors are divided about evenly between philosophers and scientists. Yet all are philosophical in that they address fundamental issues and concepts; and all are scientific in that they are technically sophisticated and concerned with concrete empirical research.ContributorsRodney A. Brooks, Paul M. Churchland, Andy Clark, Daniel C. Dennett, Hubert L. Dreyfus, Jerry A. Fodor, Joseph Garon, John Haugeland, Marvin Minsky, Allen Newell, Zenon W. Pylyshyn, William Ramsey, Jay F. Rosenberg, David E. Rumelhart, John R. Searle, Herbert A. Simon, Paul Smolensky, Stephen Stich, A.M. Turing, Timothy van Gelder

    Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics — profusely illustrated — include: Mathematical Models, Elementary Concepts of Graph Theory, Transportation Problems, Connection Problems, Party Problems, Digraphs and Mathematical Models, Games and Puzzles, Graphs and Social Psychology, Planar Graphs and Coloring Problems, and Graphs and Other Mathematics. A useful Appendix covers Sets, Relations, Functions, and Proofs, and a section devoted to exercises — with answers, hints, and solutions — is especially valuable to anyone encountering graph theory for the first time. Undergraduate mathematics students at every level, puzzlists, and mathematical hobbyists will find well-organized coverage of the fundamentals of graph theory in this highly readable and thoroughly enjoyable book.

    This is a very old science and its gems have lost their charm for us through everyday use. We have tried in this book to refresh them for you. The main part of the book is made up of problems. The best way to deal with them is: Solve the problem by yourself - compare your solution with the solution in the book (if it exists) - go to the next problem. However, if you have difficulties solving a problem (and some of them are quite difficult), you may read the hint or start to read the solution. If there is no solution in the book for some problem, you may skip it (it is not heavily used in the sequel) and return to it later. The book is divided into sections devoted to different topics. Some of them are very short, others are rather long. Of course, you know arithmetic pretty well. However, we shall go through it once more, starting with easy things. 2 Exchange of terms in addition Let's add 3 and 5: 3+5=8. And now change the order: 5+3=8. We get the same result. Adding three apples to five apples is the same as adding five apples to three - apples do not disappear and we get eight of them in both cases. 3 Exchange of terms in multiplication Multiplication has a similar property. But let us first agree on notation.

    Kevin Mitnick's last book sold 40,000 units in North America.As the clich� goes, information is power. In this age of technology, an increasing majority of the world's information is stored electronically. It makes sense then that we rely on high-tech electronic protection systems to guard that information. As professional hackers, Johnny Long and Kevin Mitnick get paid to uncover weaknesses in those systems and exploit them. Whether breaking into buildings or slipping past industrial-grade firewalls, their goal has always been the same: extract the information using any means necessary. After hundreds of jobs, they have discovered the secrets to bypassing every conceivable high-tech security system. This book reveals those secrets; as the title suggests, it has nothing to do with high technology.

    Machine learning provides these, developing methods that can automatically detect patterns in data and then use the uncovered patterns to predict future data. This textbook offers a comprehensive and self-contained introduction to the field of machine learning, based on a unified, probabilistic approach.The coverage combines breadth and depth, offering necessary background material on such topics as probability, optimization, and linear algebra as well as discussion of recent developments in the field, including conditional random fields, L1 regularization, and deep learning. The book is written in an informal, accessible style, complete with pseudo-code for the most important algorithms. All topics are copiously illustrated with color images and worked examples drawn from such application domains as biology, text processing, computer vision, and robotics. Rather than providing a cookbook of different heuristic methods, the book stresses a principled model-based approach, often using the language of graphical models to specify models in a concise and intuitive way. Almost all the models described have been implemented in a MATLAB software package—PMTK (probabilistic modeling toolkit)—that is freely available online. The book is suitable for upper-level undergraduates with an introductory-level college math background and beginning graduate students.

    Introducing students to the many facets of neural networks, this text provides many case studies to illustrate their real-life, practical applications.

    It is designed as a reference for students in the physical sciences and engineering.

    The unique on-line grading services instantly grades solutions to hundred of computer exercises. It is specially devised to be used by philosophy instructors in a way that is useful to undergraduates of philosophy, computer science, mathematics, and linguistics.The book is a completely rewritten and much improved version of The Language of First-order Logic. Introductory material is presented in a more systematic and accessible fashion. Advanced chapters include proofs of soundness and completeness for propositional and predicate logic, as well as an accessible sketch of Godel's first incompleteness theorem. The book is appropriate for a wide range of courses, from first logic courses for undergraduates (philosophy, mathematics, and computer science) to a first graduate logic course.The package includes four pieces of software:Tarski's World 5.0, a new version of the popular program that teaches the basic first-order language and its semantics; Fitch, a natural deduction proof environment for giving and checking first-order proofs;Boole, a program that facilitates the construction and checking of truth tables and related notions (tautology, tautological consequence, etc.);Submit, a program that allows students to submit exercises done with the above programs to the Grade Grinder, the automatic grading service.Grade reports are returned to the student and, if requested, to the student's instructor, eliminating the need for tedious checking of homework. All programs are available for Windows, Macintosh and Linux systems.Instructors do not need to use the programs themselves in order to be able to take advantage of their pedagogical value. More about the software can be found at lpl.stanford.edu.The price of a new text/software package includes one Registration ID, which must be used each time work is submitted to the grading service. Once activated, the Registration ID is not transferable.

    Includes expert coverage of new topics: Turbocodes, Turboequalization, Antenna Arrays, Digital Cellular Systems, and Iterative Detection. Convenient, sequential organization begins with a look at the historyo and classification of channel models and builds from there.

    Incorporating updated notations, selective answers to exercises, expanded treatment of natural deduction, and new discussions of predicate-functor logic and the affinities between higher set theory and the elementary logic of terms, W. V. Quine's new edition will serve admirably for both classroom and independent use.

    This introduction is ideal for beginners: it requires no previous programming experience and all concepts are explained from first principles via carefully chosen examples. Each chapter includes exercises that range from the straightforward to extended projects, plus suggestions for further reading on more advanced topics. The author is a leading Haskell researcher and instructor, well-known for his teaching skills. The presentation is clear and simple, and benefits from having been refined and class-tested over several years. The result is a text that can be used with courses, or for self-learning. Features include freely accessible Powerpoint slides for each chapter, solutions to exercises and examination questions (with solutions) available to instructors, and a downloadable code that's fully compliant with the latest Haskell release.

    In Marketing Metrics, four leading researchers and consultants systematically introduce today's most powerful marketing metrics. The authors show how to use a "dashboard" of metrics to view market dynamics from various perspectives, maximize accuracy, and "triangulate" to optimal solutions. Their comprehensive coverage includes measurements of promotional strategy, advertising, and distribution; customer perceptions; market share; competitors' power; margins and profits; products and portfolios; customer profitability; sales forces and channels; pricing strategies; and more. You'll learn how and when to apply each metric, and understand tradeoffs and nuances that are critical to using them successfully. The authors also demonstrate how to use marketing metrics as leading indicators, identifying crucial new opportunities and challenges. For clarity and simplicity all calculations can be performed by hand, or with basic spreadsheet techniques. In coming years, few marketers will rise to senior executive levels without deep fluency in marketing metrics. This book is the fastest, easiest way to gain that fluency.

    With its managerial orientation and interdisciplinary approach, this book is for beginners as well as graduate students in e-commerce.

    Its techniques are widely applied in engineering, science, finance, and commerce. This book is designed for a short course on machine learning. It is a short course, not a hurried course. From over a decade of teaching this material, we have distilled what we believe to be the core topics that every student of the subject should know. We chose the title `learning from data' that faithfully describes what the subject is about, and made it a point to cover the topics in a story-like fashion. Our hope is that the reader can learn all the fundamentals of the subject by reading the book cover to cover. ---- Learning from data has distinct theoretical and practical tracks. In this book, we balance the theoretical and the practical, the mathematical and the heuristic. Our criterion for inclusion is relevance. Theory that establishes the conceptual framework for learning is included, and so are heuristics that impact the performance of real learning systems. ---- Learning from data is a very dynamic field. Some of the hot techniques and theories at times become just fads, and others gain traction and become part of the field. What we have emphasized in this book are the necessary fundamentals that give any student of learning from data a solid foundation, and enable him or her to venture out and explore further techniques and theories, or perhaps to contribute their own. ---- The authors are professors at California Institute of Technology (Caltech), Rensselaer Polytechnic Institute (RPI), and National Taiwan University (NTU), where this book is the main text for their popular courses on machine learning. The authors also consult extensively with financial and commercial companies on machine learning applications, and have led winning teams in machine learning competitions.