Computing

This text is intended to provide a modern and integrated treatment of the foundations and applications of continuum mechanics. There is a significant increase in interest in continuum mechanics because of its relevance to microscale phenomena. In addition to being tailored for advanced undergraduate students and including numerous examples and exercises, this text also features a chapter on continuum thermodynamics, including entropy production in Newtonian viscous fluid flow and thermoelasticity. Computer solutions and examples are emphasized through the use of the symbolic mathematical computing program Mathematica®.

First published in 1976, this monograph presents an exposition of some of the more important theoretical and computational techniques that have been developed for the determination and interpretation of molecular wave functions. Although a comprehensive theory of the electronic structure and bonding in molecules had been developed by 1960, only with the advent of the electronic computer in the late 1950s did it become possible to perform accurate non-empirical calculations for molecules of chemical interest; indeed, much of the subsequent evolution of the theory has occurred in parallel with the development of computing machines and techniques.

Information theory lies at the heart of modern technology, underpinning all communications, networking, and data storage systems. This book sets out, for the first time, a complete overview of both classical and quantum information theory. Throughout, the reader is introduced to key results without becoming lost in mathematical details. Opening chapters present the basic concepts and various applications of Shannon's entropy, moving on to the core features of quantum information and quantum computing. Topics such as coding, compression, error-correction, cryptography and channel capacity are covered from classical and quantum viewpoints. Employing an informal yet scientifically accurate approach, Desurvire provides the reader with the knowledge to understand quantum gates and circuits. Highly illustrated, with numerous practical examples and end-of-chapter exercises, this text is ideal for graduate students and researchers in electrical engineering and computer science, and practitione

本教材的內容遵循《中國計算機科學與技術學科教程2002》（China Computing Curricula 2002，CCC2002）的知識體系，介紹算法及其設計、分析的基礎知識，并通過大量例題，講解枚舉法、遞推法、分治法、貪婪算法、動態規劃及與圖搜索有關的算法策略。除此之外，還對算法設計基本工具的使用和算法設計中的技巧做了講解。最后通過例題進行算法設計的實踐。算法用了接近自然語言（英語）的符號

Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.

This is a full-length history of the Western Electric Company, which was the manufacturing arm of the Bell System. As manufacturer in the communications revolutions in the nineteenth and twentieth centuries, Western Electric made products that accelerated society's pace, such as telegraphs, telephones, an early computing machine, radios, radar and transistors. Western's history offers numerous examples of the difference between innovation and implementation. The aftermath of Western's 1882 acquisition by Bell Telephone, for instance, reveals vertical integration as a lengthy process rather than a single event. Ironically, although Western transformed business worldwide with innovations in areas such as quality control and industrial psychology, the company was slow to implement these innovations itself. Western's dual role as captive supplier for a regulated monopoly and as government contractor led to its most rapid change, in the area of civil rights.

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists i

1.本書以「理論」、「實務」、「個案」三個導向為主要架構，十分適合企業管理、資訊管理、行銷管理、商務管理、工業工程管理…等科系作為管理資訊系統或企業電子化的教學用書，也非常適合對資訊管理或企業e化有興趣的社會人士作為自修學習之用。 2.隨著Enterprise 2.0 時代的來臨，管理資訊系統(MIS) 面臨了許多新的議題。例如：Web Computing、Web 2.0、Enterprise 2

Since its emergence in the early twentieth century, quantum theory has become the fundamental physical paradigm, and is essential to our understanding of the world. Providing a deeper understanding of the microscopic world through quantum theory, this supplementary text reviews a wider range of topics than conventional textbooks. Emphasis is given to modern entanglement, quantum teleportation, and Bose-Einstein condensation. Macroscopic quantum effects of practical relevance, for example superconductivity and the quantum Hall effect, are also described. Looking to the future, the author discusses the exciting prospects for quantum computing. Physical, rather than formal, explanations are given, and mathematical formalism is kept to a minimum so readers can understand the concepts more easily. Theoretical discussions are combined with a description of the corresponding experimental results. This book is ideal for undergraduate and graduate students in quantum theory and quantum optics.

Models and likelihood are the backbone of modern statistics. This 2003 book gives an integrated development of these topics that blends theory and practice, intended for advanced undergraduate and graduate students, researchers and practitioners. Its breadth is unrivaled, with sections on survival analysis, missing data, Markov chains, Markov random fields, point processes, graphical models, simulation and Markov chain Monte Carlo, estimating functions, asymptotic approximations, local likelihood and spline regressions as well as on more standard topics such as likelihood and linear and generalized linear models. Each chapter contains a wide range of problems and exercises. Practicals in the S language designed to build computing and data analysis skills, and a library of data sets to accompany the book, are available over the Web.

本教材的內容遵循《中國計算機科學與技術學科教程2002》（China Computing Curricula 2002，CCC2002）的知識體系，介紹算法及其設計、分析的基礎知識，并通過大量例題，講解枚舉法、遞推法、分治法、貪婪算法、動態規劃及與圖搜索有關的算法策略。除此之外，還對算法設計基本工具的使用和算法設計中的技巧做了講解。最后通過例題進行算法設計的實踐。算法用了接近自然語言（英語）的符號

本教材是參照ACM和IEEE最新推出的Computing Curricula 2005，根據教育部高等學校計算機科學與技術教學指導委員會最新編制的“高等學校計算機科學與技術專業規范”中制定的關于離散數學的知識結構和體系撰寫的。全書共14章，內容包含證明技巧、數理邏輯、集合與關系、函數、組合計數、圖和樹、初等數論、離散概率、代數系統等。本書體系嚴謹，選材精煉，講解翔實，例題豐富，注重與計算機科學技術

The Z notation is a language for expressing mathematical specifications of computing systems. By providing a formal semantics for Z, this book justifies the claim that Z is a precise specification language, and provides a standard framework for understanding Z specifications. Z is compared with other methods such as VDM and CLEAR, and in the final chapter, a number of studies in Z style are presented to show that Z can be used in a wide variety of specification tasks. This book will appeal to those who wish to deepen their understanding of the mathematical background of the Z method, those who want a concise definition of the language, and those interested in the design of specification languages.

This book, first published in 2000, explores the exciting field of complexity. It features in-depth coverage of important theoretical areas, including fractals, chaos, non-linear dynamics, artificial life and self-organization. It also provides overviews of complexity in several applied areas, including parallel computation, control systems, neural systems and ecosystems. Some of the properties that best characterize complex systems, including algorithmic richness, non-linearity and abundant interactions between components are examined. In this way the book draws out themes, especially the ideas of connectivity and natural computation, that reveal deep, underlying similarities between phenomena that have formerly been treated as completely distinct. The idea of natural computation is particularly rich in fresh approaches applicable to both biology and computing. Analogies such as the DNA code as life's underlying program, or organisms as automata, are very compelling. Conversely, biolo

From the Internet's infrastructure to operating systems like GNU/Linux, the open source movement comprises some of the greatest accomplishments in computing over the past quarter century. Its story embraces technological advances, unprecedented global collaboration, and remarkable tools for facilitating distributed development. The evolution of the Internet enabled an enormous expansion of open development, allowing developers to exchange information and ideas without regard to constraints of space, time, or national boundary. The movement has had widespread impact on education and government, as well as historic cultural and commercial repercussions. Part I discusses key open source applications, platforms, and technologies used in open development. Part II explores social issues ranging from demographics and psychology to legal and economic matters. Part III discusses the Free Software Foundation, open source in the public sector (government and education), and future prospects.

From the Internet's infrastructure to operating systems like GNU/Linux, the open source movement comprises some of the greatest accomplishments in computing over the past quarter century. Its story embraces technological advances, unprecedented global collaboration, and remarkable tools for facilitating distributed development. The evolution of the Internet enabled an enormous expansion of open development, allowing developers to exchange information and ideas without regard to constraints of space, time, or national boundary. The movement has had widespread impact on education and government, as well as historic cultural and commercial repercussions. Part I discusses key open source applications, platforms, and technologies used in open development. Part II explores social issues ranging from demographics and psychology to legal and economic matters. Part III discusses the Free Software Foundation, open source in the public sector (government and education), and future prospects.

Dating back to work of Berthelot, rigid cohomology appeared as a common generalization of Monsky-Washnitzer cohomology and crystalline cohomology. It is a p-adic Weil cohomology suitable for computing Zeta and L-functions for algebraic varieties on finite fields. Moreover, it is effective, in the sense that it gives algorithms to compute the number of rational points of such varieties. This is the first book to give a complete treatment of the theory, from full discussion of all the basics to descriptions of the very latest developments. Results and proofs are included that are not available elsewhere, local computations are explained, and many worked examples are given. This accessible tract will be of interest to researchers working in arithmetic geometry, p-adic cohomology theory, and related cryptographic areas.

This book presents a model of computing and a measure of computational complexity which are intended to facilitate analysis of computations performed by people, machines, or a mixed system of people and machines. The model is designed to apply directly to models of economic theory, which typically involve continuous variables and smooth functions, without requiring analysis of approximations. The model permits analysis of the feasibility and complexity of the calculations required of economic agents in order for them to arrive at their decisions. The treatment contains applications of the model to game theory and economics, including comparison of the complexities of different solution concepts in certain bargaining games, and the trade-off between communication and computation in an example of an Edgeworth Box economy.

This volume presents a searching critique of the more traditional archaeological methodologies and interpretation strategies and lays down a firm philosophical and theoretical basis for symbolist and structuralist studies in archaeology. A variety of procedures, ranging from ethnoarchaeological studies and computing techniques to formal studies of artefact design variability, are utilized to provide models for archaeologists within the proposed framework and the theory and models are then applied to a range of archaeological analyses. This particular approach sees all human actions as being meaningfully constituted within a social and cultural framework. Material culture is not simply an adaptive tool, but is structured according to sets of underlying principles which give meaning to, and derive meanings from, the social world. Thus structural regularities are shown to link seemingly disparate aspects of material culture, from funerary monuments to artefact design, from the use of spac

本書從實用的角度出發，根據教育部高教司主持評審的《中國計算機科學與技術學科教程2002》組織編寫，并參照美國ACM和IEEE Computing Curricula 2001教程，對計算機科學與技術學科進行系統化和科學化的闡述。本書詳細介紹了計算機的基礎知識、計算機體系結構、操作系統、網絡計算、程序設計與算法分析、信息系統、軟件工程、圖形學和可視化計算、智能系統、離散結構等專業知識點以及與信息技術

In the late 1980s and 1990s, the advanced industrial countries considered replacing the existing analogue television infrastructure with a new digital one. A key common feature to the debates over digital TV (DTV) in the United States, Western Europe and Japan was the eventual victory of the ideas of digitalism (the superiority of everything digital over everything analogue) and of digital convergence (the merging of computing, telecommunications and broadcasting infrastructures made possible by digitalization) in public debates over standards. Jeffrey Hart's book shows how nationalism and regionalism combined with digitalism to produce three different and incompatible DTV standards in the three regions, an outcome which has led to missed opportunities in developing the new technologies. Hart's book contributes to our understanding of relations between business and government, and of competition between the world's great economic powers.

Computational vision deals with the underlying mathematical and computational models for how visual information is processed. Whether the processing is biological or machine, there are fundamental questions related to how the information is processed. How should information be represented? How should information be transduced in order to highlight features of interest while suppressing noise and other artefacts of the image capture process? Computational Vision in Neural and Machine Systems address these and other questions in 13 chapters, divided into three sections, which overlap between biological and computational systems: dynamical systems; attention, motion, and eye-movements; and stereovision. The editors have brought together the best and brightest minds in the field of computational vision, combining research from both biology and computing and enhancing the developing synergy between computational and biological visual modelling communities. Aimed at researchers and graduate

Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems, rather than on describing ad-hoc approaches. The book is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful.

Methods from contact and symplectic geometry can be used to solve highly non-trivial nonlinear partial and ordinary differential equations without resorting to approximate numerical methods or algebraic computing software. This book explains how it's done. It combines the clarity and accessibility of an advanced textbook with the completeness of an encyclopedia. The basic ideas that Lie and Cartan developed at the end of the nineteenth century to transform solving a differential equation into a problem in geometry or algebra are here reworked in a novel and modern way. Differential equations are considered as a part of contact and symplectic geometry, so that all the machinery of Hodge-deRham calculus can be applied. In this way a wide class of equations can be tackled, including quasi-linear equations and Monge-Ampere equations (which play an important role in modern theoretical physics and meteorology).

Suitable for a first year graduate course, this textbook unites the applications of numerical mathematics and scientific computing to the practice of chemical engineering. Written in a pedagogic style, the book describes basic linear and nonlinear algebric systems all the way through to stochastic methods, Bayesian statistics and parameter estimation. These subjects are developed at a level of mathematics suitable for graduate engineering study without the exhaustive level of the theoretical mathematical detail. The implementation of numerical methods in MATLAB is integrated within each chapter and numerous examples in chemical engineering are provided, with a library of corresponding MATLAB programs. This book will provide the graduate student with essential tools required by industry and research alike. Supplementary material includes solutions to homework problems set in the text, MATLAB programs and tutorial, lecture slides, and complicated derivations for the more advanced reader.

Macroeconomics is evolving in an almost dialectic fashion. The latest evolution is the development of a new synthesis that combines insights of new classical, new Keynesian and real business cycle traditions into a dynamic, stochastic general equilibrium (DSGE) model that serves as a foundation for thinking about macro policy. That new synthesis has opened up the door to a new antithesis, which is being driven by advances in computing power and analytic techniques. This new synthesis is coalescing around developments in complexity theory, automated general to specific econometric modeling, agent-based models, and non-linear and statistical dynamical models. This book thus provides the reader with an introduction to what might be called a Post Walrasian research program that is developing as the antithesis of the Walrasian DSGE synthesis.

Macroeconomics is evolving in an almost dialectic fashion. The latest evolution is the development of a new synthesis that combines insights of new classical, new Keynesian and real business cycle traditions into a dynamic, stochastic general equilibrium (DSGE) model that serves as a foundation for thinking about macro policy. That new synthesis has opened up the door to a new antithesis, which is being driven by advances in computing power and analytic techniques. This new synthesis is coalescing around developments in complexity theory, automated general to specific econometric modeling, agent-based models, and non-linear and statistical dynamical models. This book thus provides the reader with an introduction to what might be called a Post Walrasian research program that is developing as the antithesis of the Walrasian DSGE synthesis.

Companies face major challenges as they seek to flourish in competitive global markets, fuelled by developments in technology, from the Internet to grid computing and Web services. In this environment, service orientation - aligning business processes to the changing demands of customers - is emerging as a highly effective approach to increasing efficiency. In this book, Paul Allen provides an accessible guide to service orientation, showing how it works and highlighting the benefits it can deliver. The book provides an integrated approach: after covering the basics of service orientation, he discusses key issues such as business agility, designing quality-of-service infrastructure, implementing service-level agreements, and cultural factors. He provides roadmaps, definitions, templates, techniques, process patterns and checklists to help you realize service orientation. These resources are reinforced with detailed case studies, from the transport and banking sectors. Packed with valua

Thoroughly revised for its second edition, this advanced textbook provides an introduction to the basic methods of computational physics, and an overview of progress in several areas of scientific computing by relying on free software available from CERN. The book begins by dealing with basic computational tools and routines, covering approximating functions, differential equations, spectral analysis, and matrix operations. Important concepts are illustrated by relevant examples at each stage. The author also discusses more advanced topics, such as molecular dynamics, modeling continuous systems, Monte Carlo methods, genetic algorithm and programming, and numerical renormalization. It includes many more exercises. This can be used as a textbook for either undergraduate or first-year graduate courses on computational physics or scientific computation. It will also be a useful reference for anyone involved in computational research.

Complex fluid flows are encountered widely in nature, in living beings and in engineering practice. These flows often involve both geometric and dynamic complexity and present problems that are difficult to analyse because of their wide range of length and time scales, as well as their geometric configuration. This book describes some computational techniques and modelling strategies for analysing and predicting complex transport phenomena. It summarizes advances in the context of a pressure-based algorithm. Among methods discussed are discretization schemes for treating convection and pressure, parallel computing, multigrid methods, and composite, multiblock techniques. With respect to physical modelling, the book addresses issues of turbulence closure and multiscale, multiphase transport from an engineering viewpoint. Both fundamental and practical issues are considered, along with the relative merits of competing approaches. Numerous examples are given throughout the text. Mechanica

Optical techniques have a huge range of potential applications in signal processing and in the interconnection of digital computing systems. This 1995 book provides a detailed review of the key issues which must be addressed in the design, evaluation and implementation of practical systems for signal processing and optical interconnection. Considerations such as the computer modelling of optical design limitations, the size and noise characteristics of optical modulators, and the relative merits of free-space and guided-wave optical technology in different processing systems, are all discussed in detail. The book will be of great interest to optical researchers and designers, and to anyone wishing to learn about the basic techniques of optical processing.

Although topology was recognized by Gauss and Maxwell to play a pivotal role in the formulation of electromagnetic boundary value problems, it is a largely unexploited tool for field computation. The development of algebraic topology since Maxwell provides a framework for linking data structures, algorithms, and computation to topological aspects of three-dimensional electromagnetic boundary value problems. This book attempts to expose the link between Maxwell and a modern approach to algorithms. The first chapters lay out the relevant facts about homology and cohomology, stressing their interpretations in electromagnetism. These topological structures are subsequently tied to variational formulations in electromagnetics, the finite element method, algorithms, and certain aspects of numerical linear algebra. A recurring theme is the formulation of and algorithms for the problem of making branch cuts for computing magnetic scalar potentials and eddy currents.

This book presents an easy-to-read discussion of domain decomposition algorithms, their implementation and analysis. The relationship between domain decomposition and multigrid methods is carefully explained at an elementary level, and discussions of the implementation of domain decomposition methods on massively parallel super computers are also included. All algorithms are fully described and explained, and a mathematical framework for the analysis and complete understanding of the methods is also carefully developed. In addition, numerous numerical examples are included to demonstrate the behaviour of this important class of numerical methods. This book is ideal for graduate students about to embark on a career in computational science. It will also be a valuable resource for all those interested in parallel computing and numerical computational methods.

In the late 1980s and 1990s, the advanced industrial countries considered replacing the existing analogue television infrastructure with a new digital one. A key common feature to the debates over digital TV (DTV) in the United States, Western Europe and Japan was the eventual victory of the ideas of digitalism (the superiority of everything digital over everything analogue) and of digital convergence (the merging of computing, telecommunications and broadcasting infrastructures made possible by digitalization) in public debates over standards. Jeffrey Hart's book shows how nationalism and regionalism combined with digitalism to produce three different and incompatible DTV standards in the three regions, an outcome which has led to missed opportunities in developing the new technologies. Hart's book contributes to our understanding of relations between business and government, and of competition between the world's great economic powers.

Models and likelihood are the backbone of modern statistics. This 2003 book gives an integrated development of these topics that blends theory and practice, intended for advanced undergraduate and graduate students, researchers and practitioners. Its breadth is unrivaled, with sections on survival analysis, missing data, Markov chains, Markov random fields, point processes, graphical models, simulation and Markov chain Monte Carlo, estimating functions, asymptotic approximations, local likelihood and spline regressions as well as on more standard topics such as likelihood and linear and generalized linear models. Each chapter contains a wide range of problems and exercises. Practicals in the S language designed to build computing and data analysis skills, and a library of data sets to accompany the book, are available over the Web.

The homotopy type of a closed simply connected 4-manifold is determined by the intersection form. The homotopy classes of maps between two such manifolds, however, do not coincide with the algebraic morphisms between intersection forms. Therefore the problem arises of computing the homotopy classes of maps algebraically and determining the law of composition for such maps. This problem is solved in the book by introducing new algebraic models of a 4-manifold. The book has been written to appeal to both established researchers in the field and graduate students interested in topology and algebra. There are many references to the literature for those interested in further reading.

This book presents a model of computing and a measure of computational complexity which are intended to facilitate analysis of computations performed by people, machines, or a mixed system of people and machines. The model is designed to apply directly to models of economic theory, which typically involve continuous variables and smooth functions, without requiring analysis of approximations. The model permits analysis of the feasibility and complexity of the calculations required of economic agents in order for them to arrive at their decisions. The treatment contains applications of the model to game theory and economics, including comparison of the complexities of different solution concepts in certain bargaining games, and the trade-off between communication and computation in an example of an Edgeworth Box economy.

Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding.

Stochastic processes with jumps and random measures are importance as drivers in applications like financial mathematics and signal processing. This 2002 text develops stochastic integration theory for both integrators (semimartingales) and random measures from a common point of view. Using some novel predictable controlling devices, the author furnishes the theory of stochastic differential equations driven by them, as well as their stability and numerical approximation theories. Highlights feature DCT and Egoroff's Theorem, as well as comprehensive analogs results from ordinary integration theory, for instance previsible envelopes and an algorithm computing stochastic integrals of càglàd integrands pathwise. Full proofs are given for all results, and motivation is stressed throughout. A large appendix contains most of the analysis that readers will need as a prerequisite. This will be an invaluable reference for graduate students and researchers in mathematics, physics, electrical en

何謂「Mobile」 所謂「Mobile」即是「行動」之意，但在此則是指使用者在可移動的狀態下，進行通訊或電腦運算（Computing）。幾年以前，「Mobile」一詞一直都有如下的強烈語感，意指：帶著筆記型電腦，在外出處使用電腦，以及透過行動電話或配備數據通訊功能的公共電話等，進行數據通訊。然而在日本，由於i-mode等具備上網功能的手機（以下稱為「上網型手機」）急速普及，近來將使用這