Author: Ryan Mungia
Publisher:
ISBN: 9780991619825
Category : Art
Languages : en
Pages : 0

View

Book Description
Before Alexa and the iPhone, there was the large and unwieldy mainframe computer. In the postwar 1950s, computers were mostly used for aerospace and accounting purposes. To the public at large, they were on a rung that existed somewhere between engineering and science fiction. Magazine ads and marketing brochures were designed to create a fantasy surrounding these machines for prospective clients: Higher profit margins! Creativity unleashed! Total automation! With the invention of the microchip in the 1970s came the PC and video games, which shifted the target of computer advertising from corporations to the individual. By the end of the millennium, the notion of selling tech burst wide open to include robots, cell phones, blogs, online dating services, and much, much more. Do You Compute? is a broad survey featuring the very best of computer advertising in the 20th century. From the Atomic Age to the Y2K bug, this volume presents a connoisseur's selection of graphic gems culled from museums, university archives, and private collections to illustrate the evolution of the computer from its early days as a hulking piece of machinery to its current state as a handheld device. Accompanied by two essays--one by cultural anthropologist Ryan Mungia and the other by graphic design historian Steven Heller--and including five different decade-long timelines that highlight some of the most influential moments in computer history, this fun yet meaningful volume is a unique look at the computer and how it has shaped our world.

Author: Jin-Yi Cai
Publisher: Springer
ISBN: 3540725040
Category : Computers
Languages : en
Pages : 772

View

Book Description
This book constitutes the refereed proceedings of the 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007, held in Shanghai, China in May 2007. It addresses all major areas in computer science; mathematics, especially logic; and the physical sciences, particularly with regard to computation and computability theory. The papers particularly focus on algorithms, complexity and computability theory.

Author: Jason Zink
Publisher: CRC Press
ISBN: 1568817207
Category : Computers
Languages : en
Pages : 649

View

Book Description
Direct3D 11 offers such a wealth of capabilities that users can sometimes get lost in the details of specific APIs and their implementation. While there is a great deal of low-level information available about how each API function should be used, there is little documentation that shows how best to leverage these capabilities. Written by active members of the Direct3D community, Practical Rendering and Computation with Direct3D 11 provides a deep understanding of both the high and low level concepts related to using Direct3D 11. The first part of the book presents a conceptual introduction to Direct3D 11, including an overview of the Direct3D 11 rendering and computation pipelines and how they map to the underlying hardware. It also provides a detailed look at all of the major components of the library, covering resources, pipeline details, and multithreaded rendering. Building upon this material, the second part of the text includes detailed examples of how to use Direct3D 11 in common rendering scenarios. The authors describe sample algorithms in-depth and discuss how the features of Direct3D 11 can be used to your advantage. All of the source code from the book is accessible on an actively maintained open source rendering framework. The sample applications and the framework itself can be downloaded from http://hieroglyph3.codeplex.com By analyzing when to use various tools and the tradeoffs between different implementations, this book helps you understand the best way to accomplish a given task and thereby fully leverage the potential capabilities of Direct3D 11.

Author: John MacCormick
Publisher: Princeton University Press
ISBN: 0691170665
Category : Computers
Languages : en
Pages : 404

View

Book Description
An accessible and rigorous textbook for introducing undergraduates to computer science theory What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference. The book covers the standard topics in the theory of computation, including Turing machines and finite automata, universal computation, nondeterminism, Turing and Karp reductions, undecidability, time-complexity classes such as P and NP, and NP-completeness, including the Cook-Levin Theorem. But the book also provides a broader view of computer science and its historical development, with discussions of Turing's original 1936 computing machines, the connections between undecidability and Gödel's incompleteness theorem, and Karp's famous set of twenty-one NP-complete problems. Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book's examples and other content allow readers to view demonstrations of—and to experiment with—a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation. An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation Features a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understanding Gives equal emphasis to computability and complexity Includes special topics that demonstrate the profound nature of key ideas in the theory of computation Lecture slides and Python programs are available at whatcanbecomputed.com

Author: Ronald Cramer
Publisher: Cambridge University Press
ISBN: 1107043050
Category : Computers
Languages : en
Pages : 385

View

Book Description
This book provides information on theoretically secure multiparty computation (MPC) and secret sharing, and the fascinating relationship between the two concepts.

Author: Toshihide Ibaraki
Publisher: Springer Science & Business Media
ISBN: 3540206957
Category : Computers
Languages : en
Pages : 764

View

Book Description
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.

Author: Gene Howard Golub
Publisher: Oxford University Press
ISBN: 0199206813
Category : Mathematics
Languages : en
Pages : 581

View

Book Description
The text presents and discusses some of the most influential papers in Matrix Computation authored by Gene H. Golub, one of the founding fathers of the field. Including commentaries by leading experts and a brief biography, this text will be of great interest to students and researchers in numerical analysis and scientific computation.

Author: E. J. Hinch
Publisher: Cambridge University Press
ISBN: 1108479545
Category : Mathematics
Languages : en
Pages : 243

View

Book Description
This guide to computational fluid mechanics introduces beginning graduate students to the subject's standard methods and common pitfalls.

Author: Tom Stuart
Publisher: "O'Reilly Media, Inc."
ISBN: 144933010X
Category : Computers
Languages : en
Pages : 332

View

Book Description
Finally, you can learn computation theory and programming language design in an engaging, practical way. Understanding Computation explains theoretical computer science in a context you’ll recognize, helping you appreciate why these ideas matter and how they can inform your day-to-day programming. Rather than use mathematical notation or an unfamiliar academic programming language like Haskell or Lisp, this book uses Ruby in a reductionist manner to present formal semantics, automata theory, and functional programming with the lambda calculus. It’s ideal for programmers versed in modern languages, with little or no formal training in computer science. Understand fundamental computing concepts, such as Turing completeness in languages Discover how programs use dynamic semantics to communicate ideas to machines Explore what a computer can do when reduced to its bare essentials Learn how universal Turing machines led to today’s general-purpose computers Perform complex calculations, using simple languages and cellular automata Determine which programming language features are essential for computation Examine how halting and self-referencing make some computing problems unsolvable Analyze programs by using abstract interpretation and type systems

Author: John V. Guttag
Publisher: MIT Press
ISBN: 0262529629
Category : Computers
Languages : en
Pages : 466

View

Book Description
The new edition of an introductory text that teaches students the art of computational problem solving, covering topics ranging from simple algorithms to information visualization. This book introduces students with little or no prior programming experience to the art of computational problem solving using Python and various Python libraries, including PyLab. It provides students with skills that will enable them to make productive use of computational techniques, including some of the tools and techniques of data science for using computation to model and interpret data. The book is based on an MIT course (which became the most popular course offered through MIT's OpenCourseWare) and was developed for use not only in a conventional classroom but in in a massive open online course (MOOC). This new edition has been updated for Python 3, reorganized to make it easier to use for courses that cover only a subset of the material, and offers additional material including five new chapters. Students are introduced to Python and the basics of programming in the context of such computational concepts and techniques as exhaustive enumeration, bisection search, and efficient approximation algorithms. Although it covers such traditional topics as computational complexity and simple algorithms, the book focuses on a wide range of topics not found in most introductory texts, including information visualization, simulations to model randomness, computational techniques to understand data, and statistical techniques that inform (and misinform) as well as two related but relatively advanced topics: optimization problems and dynamic programming. This edition offers expanded material on statistics and machine learning and new chapters on Frequentist and Bayesian statistics.