Computation : the micro and the macro view

목차 (Table of Contents)

• CONTENTS
• Preface = ⅴ
• QUANTUM LIMITS ON INFORMATION THANSMISSION FOR SINGLE AND MANY CHANNELS ARCHITECTURES / Marcelo Schiffer = 1
• 1. Introduction = 2
• 2. Quantum Limits on the Information Flow = 3
• 3. The Linear Quantum Bound on the Information Flow = 4
• 4. Analytical Proofs = 5
• 4.1 The heuristic 'proof' = 6
• 4.2 Microcanonical proof = 7
• 4.3 The information theoretical approach = 9
• 4.4 Many channels architecture = 10
• 4.5 Signalling with 'non-occupation number' states = 11
• 5. Signalling with Coherent States = 11
• 5.1 Quantum detection and quantum noise = 13
• 5.2 Quantum states for signalling = 15
• 6. Concluding Remarks = 17
• References = 17
• ALGORITHMIC RANDOMNESS, PHYSICAL ENTROPY, MEASUREMENTS, AND THE SECOND LAW / W.H. Zurek = 19
• 1. Introduction = 20
• 2. Definitions of Algorithmic Randomness = 21
• 3. Thermodynamics Engines, the Second Law, and Shannon's Noiseless Coding Theorem = 25
• References = 31
• COOPERATIVE PROBLEM SOLVING / Scott H. Clearwater ; Tad Hogg ; Bernardo A. Huberman = 33
• 1. Introduction = 34
• 2. Constraint Satisfaction Problems = 35
• 3. Search = 37
• 3.1 Individual search = 38
• 3.2 Search in cryptarithmetic = 39
• 3.3 Relating search steps to time = 40
• 3.4 Non-cooperative search = 41
• 3.5 Cooperative search = 41
• 3.6 Performance measures = 44
• 4. Experimental Results = 45
• 4.1 Problem solving by committee = 45
• 4.2 Problem solving by hierarchial organizations = 54
• 5. Theory = 56
• 5.1 Single agent behavior = 56
• 5.2 Relating search steps to time = 57
• 5.3 Non-cooperative agents = 58
• 5.4 Cooperative agents = 59
• 5.5 Dynamic cooperation = 65
• 6. Discussion = 66
• References = 69
• DIRECTED-GRAPH EPIDEMIOLOGICAL MODELS OF COMPUTER VIRUSES / Jeffrey O. Kephart ; Steve R. White = 71
• 1. Introduction = 72
• 1.1 The problem of computer viruses = 72
• 1.2 Previous work on computer virus spread = 73
• 1.3 Previous epidemiological models and their limitations = 74
• 2. SIS Model on a Random Graph = 76
• 2.1 Deterministic approximation = 77
• 2.2 Probabilistic analysis = 78
• 2.3 Simulations = 85
• 2.4 Weak links = 88
• 3. Hierarchical Model = 90
• 4. Spatial Model = 93
• 4.1 Deterministic analysis = 93
• 4.2 Simulations on two-dimensional lattices = 94
• 5. Conclusion = 97
• References = 100
• THE USE OF PHYSICS CONCEPTS IN COMPUTATION / Geoffrey C. Fox = 103
• 1. Introduction = 104
• 2. Complex Systems and the Space-Time Picture = 105
• 2.1 Problems and computers = 105
• 2.2 Space-time picture = 109
• 3. Spatial Structure of Problems and Computers = 111
• 3.1 Performance model of homogeneous multicomputers = 111
• 3.2 Information dimension = 117
• 3.3 Physical analogy = 122
• 3.4 Load balancing = 125
• 3.5 Dynamic load balancing = 129
• 4. The Dynamics and Temporal Structure of Computation = 135
• 4.1 The string formalism = 135
• 4.2 Message routing = 136
• 4.3 Optimizing compilers = 139
• 4.4 The neural navigator = 142
• 4.5 Classical dynamics = 145
• 4.6 Event driven simulation = 146
• 4.7 The elastic network = 147
• 5. Problem Architectures = 148
• 6. Matching the Space-Time Structure of Problems and Computers = 152
• 6.1 The duality between memory structure of the computer and space-time structure of the problem = 152
• 6.2 Parallel computer software = 154
• References = 156