This book introduces programmers to objects at a gradual pace. The syntax boxes are revised to show typical code examples rather than abstract notation. This includes optional example modules using Alice and Greenfoot. The examples feature annotations with dos and don'ts along with cross references to more detailed explanations in the...

A variety of problems m machine learning and digital communication deal with complex but structured natural or artificial systems. Natural patterns mat we wish to automatically classify' are a consequence of a hierarchical causal physical process. Learning about the world m which we live requires mat we extract useful sensor)'...

Some TIME ago a group of mathematicians and computer scientists (including the editors of this volume) thought of making a scientific pilgrimage to the birthplace of al-Khw&rizmf, the outstanding ninth-century mathematician who gave his name to the word "algorithm". As his name indicates, al-Khwarizmi came from the Khorezm...

The use of modular and parallel programming languages, and the development of distributed architectures is having a profound influence on computer programming and systems design; hardware and performance can now conspire to produce much higher operating speeds than could previously be achieved through sequential processing. Executing...

Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of...

This book constitutes the refereed proceedings of the 31st Annual International Cryptology Conference, CRYPTO 2011, held in Santa Barbara, CA, USA in August 2011. The 42 revised full papers presented were carefully reviewed and selected from 230 submissions. The volume also contains the abstract of one invited talk. The papers are organized...

Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear...

Concurrent processes can exhibit extremely complicated behavior, and neither informal reasoning nor testing is reliable enough to establish their correctness. In this thesis, we develop a new technique for the verification of parallel programs. The technique is stated in terms of axioms and inference rules, and it is used to prove...

Why is astronomy considered a science while astrology is considered only a pseudoscience? In other words, how can we prove that a theory faithfully describes reality, and that this theory can then be used to predict unknown facts? Karl Popper, the well-known philosopher, studied these problems and summarized his conclusions in one...

I became interested in ML programming when I taught CS109, the introduc- tory Computer Science Foundations course at Stanford, starting in 1991. ML was used by several of the instructors of this course, including Stu Reges and Mike Cleron, to introduce concepts such as functional programming and type systems. It was also used for the...

Android is hot, and many people are developing Android applications (apps for short). Perhaps you would also like to develop apps, but are unsure about how to get started. Although you could study Google’s online Android Developer’s Guide (http://developer.android.com/guide/index.html) to acquire the needed knowledge, you...