"The central part of the conference focused on research goals and priorities in : high-performance architectures, algorithms and theory, artificial intelligence, systems and software, neural networks, computer-based collaboration"--intro., p. 2

Computers are increasingly the enabling devices of the information revolution, and computing is becoming ubiquitous in every corner of society, from manufacturing to telecommunications to pharmaceuticals to entertainment. Even more importantly, the face of computing is changing rapidly, as even traditional rivals such as IBM and Apple Computer begin to cooperate and new modes of computing are developed. Computing the Future presents a timely assessment of academic computer science and engineering (CS&E), examining what should be done to ensure continuing progress in making discoveries that will carry computing into the twenty-first century. Most importantly, it advocates a broader research and educational agenda that builds on the field's impressive accomplishments. The volume outlines a framework of priorities for CS&E, along with detailed recommendations for education, funding, and leadership. A core research agenda is outlined for these areas: processors and multiple-processor systems, data communications and networking, software engineering, information storage and retrieval, reliability, and user interfaces. This highly readable volume examines: Computer science and engineering as a discipline-how computer scientists and engineers are pushing back the frontiers of their field. How CS&E must change to meet the challenges of the future. The influence of strategic investment by federal agencies in CS&E research. Recent structural changes that affect the interaction of academic CS&E and the business environment. Specific examples of interdisciplinary and applications research in four areas: earth sciences and the environment, computational biology, commercial computing, and the long-term goal of a national electronic library. The volume provides a detailed look at undergraduate CS&E education, highlighting the limitations of four-year programs, and discusses the emerging importance of a master's degree in CS&E and the prospects for broadening the scope of the Ph.D. It also includes a brief look at continuing education.

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.

Fusion offers the prospect of virtually unlimited energy. The United States and many nations around the world have made enormous progress toward achieving fusion energy. With ITER scheduled to go online within a decade and demonstrate controlled fusion ten years later, now is the right time for the United States to develop plans to benefit from its investment in burning plasma research and take steps to develop fusion electricity for the nation's future energy needs. At the request of the Department of Energy, the National Academies of Sciences, Engineering, and Medicine organized a committee to develop a strategic plan for U.S. fusion research. The final report's two main recommendations are: (1) The United States should remain an ITER partner as the most cost-effective way to gain experience with a burning plasma at the scale of a power plant. (2) The United States should start a national program of accompanying research and technology leading to the construction of a compact pilot plant that produces electricity from fusion at the lowest possible capital cost.

This book constitutes the refereed proceedings of the Third International Workshop on Cooperative Information Systems, CIA'99, held in Uppsala, Sweden in July/August 1999. The 16 revised full papers presented were carefully reviewed and selected from a total of 46 submissions. Also included are ten invited contributions by leading experts. The volume is divided in sections on information discovery and management on the Internet; information agents on the Internet-prototypes systems and applications; communication and collaboration, mobile information agents; rational information agents for electronic business; service mediation and negotiation; and adaptive personal assistance.

Increasing the designer’s con dence that a piece of software or hardwareis c- pliant with its speci cation has become a key objective in the design process for software and hardware systems. Many approaches to reaching this goal have been developed, including rigorous speci cation, formal veri cation, automated validation, and testing. Finite-state model checking, as it is supported by the explicit-state model checkerSPIN,is enjoying a constantly increasingpopularity in automated property validation of concurrent, message based systems. SPIN has been in large parts implemented and is being maintained by Gerard Ho- mann, and is freely available via ftp fromnetlib.bell-labs.comor from URL http://cm.bell-labs.com/cm/cs/what/spin/Man/README.html. The beauty of nite-state model checking lies in the possibility of building \push-button" validation tools. When the state space is nite, the state-space traversal will eventually terminate with a de nite verdict on the property that is being validated. Equally helpful is the fact that in case the property is inv- idated the model checker will return a counterexample, a feature that greatly facilitates fault identi cation. On the downside, the time it takes to obtain a verdict may be very long if the state space is large and the type of properties that can be validated is restricted to a logic of rather limited expressiveness.

This is a guidebook for those who want to use computational experiments to support their work in algorithm design and analysis. Numerous case studies and examples show how to apply these concepts. All the necessary concepts in computer architecture and data analysis are covered so that the book can be used by anyone who has taken a course or two in data structures and algorithms.

This book constitutes the refereed proceedings of the 5th International Symposium, Latin American Theoretical Informatics, LATIN 2002, held in Cancun, Mexico, in April 2002. The 44 revised full papers presented together with a tutorial and 7 abstracts of invited contributions were carefully reviewed and selected from a total of 104 submissions. The papers presented are devoted to a broad range of topics from theoretical computer science and mathematical foundations, with a certain focus on algorithmics and computations related to discrete structures.