close
1.

図書
図書
1. Concurrent reactive plans : anticipating and forestalling execution failures
Michael Beetz
出版情報: Berlin : Springer, 2000  xvi, 213 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1772 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Abstract
Acknowledgements
List of Figures
Introduction / 1：
The Approach / 1.1：
Technical Challenges / 1.2：
Introductory Example / 1.3：
Motivation / 1.4：
Relevance for Autonomous Robot Control / 1.4.1：
Relevance for AI Planning / 1.4.2：
The Computational Problem and Its Solution / 1.5：
The Computational Problem / 1.5.1：
The Computational Model / 1.5.2：
Contributions / 1.6：
Outline of the Book / 1.7：
Reactivity / 2：
The DeliveryWorld / 2.1：
The World / 2.1.1：
Commands and Jobs / 2.1.2：
The Robot / 2.1.3：
Justification of the DeliveryWorld / 2.1.4：
The Implementation of Routine Activities / 2.2：
Plan Steps vs. Concurrent Control Processes / 2.2.1：
Interfacing Continuous Control Processes / 2.2.2：
Coordinating Control Processes / 2.2.3：
Synchronization of Concurrent Control Threads / 2.2.4：
Failure Recovery / 2.2.5：
Perception / 2.2.6：
State, Memory, and World Models / 2.2.7：
The Structure of Routine Activities / 2.2.8：
The Structured Reactive Controller / 2.3：
Behavior and Planning Modules / 2.3.1：
The Body of the Structured Reactive Controller / 2.3.2：
Global Fluents, Variables, and the Plan Library / 2.3.3：
The RPL Runtime System / 2.3.4：
Summary and Discussion / 2.4：
Planning / 3：
The Structured Reactive Plan / 3.1：
Plans as Syntactic Objects / 3.1.1：
RPL as a Plan Language / 3.1.2：
The Computational Structure / 3.2：
The "Criticize-Revise" Cycle / 3.2.1：
The "Criticize" Step / 3.2.2：
The "Revise" Step / 3.2.3：
The XFRM Planning Framework / 3.3：
Anticipation and Forestalling of Behavior Flaws / 3.4：
The Detection of Behavior Flaws / 3.4.1：
Behavior Flaws and Plan Revisions / 3.4.2：
The Diagnosis of Behavior Flaws / 3.4.3：
Transparent Reactive Plans / 3.5：
Declarative Statements / 4.1：
RPL Construct Descriptions / 4.1.1：
Achievement Goals / 4.1.2：
Perceptions / 4.1.3：
Beliefs / 4.1.4：
Other Declarative Statements / 4.1.5：
Using Declarative Statements / 4.1.6：
Routine Plans / 4.2：
The Plan Library / 4.3：
Behavior Modules / 4.3.1：
Low-level Plans / 4.3.2：
High-level Plans / 4.3.3：
Discussion / 4.4：
Representing Plan Revisions / 5：
Conceptualization / 5.1：
Making Inferences / 5.2：
Some Examples / 5.2.1：
Accessing Code Trees / 5.2.2：
Predicates on Plan Interpretations / 5.2.3：
Predicates on Timelines / 5.2.4：
Timelines and Plan Interpretation / 5.2.5：
Expressing Plan Revisions / 5.3：
XFRML - The Implementation / 5.4：
Forestalling Behavior Flaws / 5.5：
FAUST / 6.1：
The Behavior Critic / 6.1.1：
Detecting Behavior Flaws: Implementation / 6.1.2：
Diagnosing the Causes of Behavior Flaws: Implementation / 6.1.3：
The Bug Class "Behavior-Specification Violation" / 6.1.4：
The Elimination of Behavior Flaws / 6.1.5：
The Plan Revisions for the Example / 6.2：
Some Behavior Flaws and Their Revisions / 6.3：
Perceptual Confusion / 6.3.1：
Missed Deadlines / 6.3.2：
Planning Ongoing Activities / 6.4：
Extending RPL / 7.1：
The RUNTIME-PLAN Statement / 7.1.1：
Plan Swapping / 7.1.2：
Making Planning Assumptions / 7.1.3：
Deliberative Controllers / 7.2：
Improving Iterative Plans by Local Planning / 7.2.1：
Plan Execution a la Shakey / 7.2.2：
Execution Monitoring and Replanning / 7.2.3：
Recovering from Execution Failures / 7.2.4：
Some Robot Control Architectures / 7.2.5：
The Controller in the Experiment / 7.3：
Evaluation / 7.4：
Analysis of the Problem / 8.1：
Assessment of the Method / 8.2：
Description of the Method / 8.2.1：
Evaluation of the Method / 8.2.2：
Demonstration / 8.3：
Evaluating SRCs in Standard Situations / 8.3.1：
Comparing SRCs with the Appropriate Fixed Controller179 / 8.3.2：
Problems that Require SRCs / 8.3.3：
Related Work / 8.4：
Control Architectures for Competent Physical Agents / 8.4.1：
Control Languages for Reactive Control / 8.4.2：
Robot Planning / 8.4.3：
Conclusion / 9：
What Do Structured Reactive Controllers Do? / 9.1：
Why Do Structured Reactive Controllers Work? / 9.2：
Do Structured Reactive Controllers Work for Real Robots? / 9.3：
References
Abstract
Acknowledgements
List of Figures
2.

図書
図書
2. Least squares orthogonal distance fitting of curves and surfaces in space
Sung Joon Ahn
出版情報: Berlin : Springer, c2004  xx, 125 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3151
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Curves and Surfaces in Space / 1.1：
Mathematical Description / 1.1.1：
Rigid Body Motion of Model Features in Space / 1.1.2：
Model Hierarchy / 1.1.3：
Curve and Surface Fitting / 1.2：
Applications of Curve and Surface Fitting / 1.2.1：
Algebraic Fitting Vs. Geometric Fitting / 1.2.2：
State-of-the-Art Orthogonal Distance Fitting / 1.2.3：
ISO 10360-6 and Requirements of CMM Software Tools / 1.2.4：
Least-Squares Orthogonal Distance Fitting / 2：
Moment Method for Line and Plane Fitting / 2.1：
Line Fitting / 2.1.1：
Plane Fitting / 2.1.2：
Relationship Between Line and Plane Fitting / 2.1.3：
Generalized Orthogonal Distance Fitting / 2.2：
Problem Definition / 2.2.1：
Point-to-Point Matching / 2.2.2：
Template Matching / 2.2.3：
Orthogonal Distance Fitting Algorithms / 2.3：
Distance-Based Algorithm / 2.3.1：
Coordinate-Based Algorithm / 2.3.2：
Model Fitting with Parameter Constraints / 2.3.3：
Parameter Test / 2.3.4：
Application to Circle and Sphere Fitting / 2.3.5：
Orthogonal Distance Fitting of Implicit Curves and Surfaces / 3：
Minimum Distance Point / 3.1：
Generalized Newton Method / 3.1.1：
Method of Lagrangian Multipliers / 3.1.2：
Verification of the Minimum Distance Point / 3.1.3：
Acceleration of Finding the Minimum Distance Point / 3.1.4：
Orthogonal Distance Fitting / 3.2：
Comparison of the Two Algorithms / 3.2.1：
Fitting Examples / 3.3：
Superellipse Fitting / 3.3.1：
Cone Fitting / 3.3.2：
Torus Fitting / 3.3.3：
Superellipsoid Fitting / 3.3.4：
Orthogonal Distance Fitting of Parametric Curves and Surfaces / 4：
Newton Method / 4.1：
Levenberg-MarquardtAlgorithm / 4.1.2：
Initial Values / 4.1.3：
Algorithm I (ETH) / 4.1.4：
Algorithm II (NPL, FhG) / 4.2.2：
Algorithm III (FhG) / 4.2.3：
Comparison of the Three Algorithms / 4.2.4：
Helix Fitting / 4.3：
Ellipsoid Fitting / 4.3.2：
Object Reconstruction from Unordered Point Cloud / 5：
Applications of Object Reconstruction / 5.1：
Semi-automatic Object Recognition / 5.2：
Segmentation, Outlier Elimination, and Model Fitting / 5.2.1：
Domain Volume for Measurement Points / 5.2.2：
Experimental Results with Real 3-D Measurement Points / 5.3：
3-D Point Cloud from Stripe Projection Method / 5.3.1：
3-D Point Cloud from Laser Radar / 5.3.2：
Conclusions / 6：
Summary / 6.1：
Future Work / 6.2：
References
Index
Implementation Examples / A：
Implicit 2-D Ellipse (Chap.3) / A.1：
Parametric 3-D Ellipse (Chap.4) / A.2：
CMM Software Tools Fulfilling ISO 10360-6 / B：
Curves and Surfaces Defined in ISO 10360-6 / B.1：
Competent Parameterization / B.1.1：
Role of the Mass Center / B.1.2：
Rotation Matrix / B.1.3：
Parameter Range / B.1.4：
Minimum Distance Point and FHG/XHG Matrix / B.2：
2-D Line / B.2.1：
3-D Line / B.2.2：
Plane / B.2.3：
2-D Circle / B.2.4：
3-D Circle / B.2.5：
Sphere / B.2.6：
Cylinder / B.2.7：
Cone / B.2.8：
Torus / B.2.9：
FHG Matrix of Superellipse and Superellipsoid / C：
Superellipse / C.1：
Superellipsoid / C.2：
Introduction / 1：
Curves and Surfaces in Space / 1.1：
Mathematical Description / 1.1.1：
3.

図書
図書
3. Intelligent information integration for the semantic web
Ubbo Visser
出版情報: Berlin : Springer, c2004  xiv, 150 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3159 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Related Work / Part I：
Introduction / 1：
Semantic Web Vision / 1.1：
Research Topics / 1.2：
Search on the Web / 1.3：
Integration Tasks / 1.4：
Organization / 1.5：
Related Work / 2：
Approaches for Terminological Representation and Reasoning / 2.1：
The Role of Ontologies / 2.1.1：
Use of Mappings / 2.1.2：
Approaches for Spatial Representation and Reasoning / 2.2：
Spatial Representation / 2.2.1：
Spatial Reasoning / 2.2.2：
More Approaches / 2.2.3：
Approaches for Temporal Representation and Reasoning / 2.3：
Temporal Theories Based on Time Points / 2.3.1：
Temporal Theories Based on Intervals / 2.3.2：
Summary of Recent Approaches / 2.3.3：
Evaluation of Approaches / 2.4：
Terminological Approaches / 2.4.1：
Spatial Approaches / 2.4.2：
Temporal Approaches / 2.4.3：
The Buster Approach for Terminological, Spatial, and Temporal Representation and Reasoning / Part II：
General Approach of Buster / 3：
Requirements / 3.1：
Conceptual Architecture / 3.2：
Query Phase / 3.2.1：
Acquisition Phase / 3.2.2：
Comprehensive Source Description / 3.3：
The Dublin Core Elements / 3.3.1：
Additional Element Descriptions / 3.3.2：
Background Models / 3.3.3：
Example / 3.3.4：
Relevance / 3.4：
Terminological Representation and Reasoning, Semantic Translation / 4：
Representation / 4.1：
Reasoning / 4.1.2：
Integration/Translation on the Data Level / 4.1.3：
Representation and Reasoning Components / 4.2：
Ontologies / 4.2.1：
Description Logics / 4.2.2：
Reasoning Components / 4.2.3：
Semantic Translation / 4.3：
Context Transformation by Rules / 4.3.1：
Context Transformation by Re-classification / 4.3.2：
Example: Translation ATKIS-CORINE Land Cover / 4.4：
Spatial Representation and Reasoning / 5：
Intuitive Spatial Labeling / 5.1：
Place Names, Gazetteers and Footprints / 5.1.2：
Place Name Structures / 5.1.3：
Spatial Relevance / 5.1.4：
Polygonal Tessellation / 5.1.5：
Place Names / 5.2.2：
Spatial Relevance Reasoning / 5.2.3：
Temporal Representation and Reasoning / 5.4：
Intuitive Labeling / 6.1：
Time Interval Boundaries / 6.1.2：
Structures / 6.1.3：
Explicit Qualitative Relations / 6.1.4：
Period Names / 6.2：
Boundaries / 6.2.3：
Relations / 6.2.4：
Temporal Relevance / 6.3：
Distance Between Time Intervals / 6.3.1：
Overlapping of Time Periods / 6.3.2：
Relations Between Boundaries / 6.4：
Relations Between Two Time Periods / 6.4.2：
Relations Between More Than Two Time Periods / 6.4.3：
Qualitative Statements / 6.5：
Quantitative Statements / 6.5.2：
Inconsistencies (Quantitative/Qualitative) / 6.5.3：
Inconsistencies (Reasoner Implicit/Qualitative) / 6.5.4：
Inconsistencies (Qualitative/Quantitative) / 6.5.5：
Implementation, Conclusion, and Future Work / Part III：
Implementation Issues and System Demonstration / 7：
Architecture / 7.1：
Single Queries / 7.2：
Terminological Queries / 7.2.1：
Spatial Queries / 7.2.2：
Temporal Queries / 7.2.3：
Combined Queries / 7.3：
Spatio-terminological Queries / 7.3.1：
Temporal-Terminological Queries / 7.3.2：
Spatio-temporal-terminological Queries / 7.3.3：
Conclusion and Future Work / 8：
Conclusion / 8.1：
Semantic Web / 8.1.1：
BUSTER Approach and System / 8.1.2：
Future Work / 8.2：
Terminological Part / 8.2.1：
Spatial Part / 8.2.2：
Temporal Part / 8.2.3：
References
Introduction and Related Work / Part I：
Introduction / 1：
Semantic Web Vision / 1.1：
4.

図書
図書
4. On-line error detection and fast recover techniques for dependable embedded processors
Matthias Pflanz
出版情報: Berlin : Springer, c2002  xii, 126 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2270
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Background and Motivation / 1.1：
Terminology / 1.2：
Embedded Systems / 1.2.1：
Cores / 1.2.2：
System-on-Chip / 1.2.3：
Test and Check / 1.2.4：
Fault-Tolerance Objectives / 1.2.5：
Safety-Critical Embedded Systems / 1.2.6：
Publications / 1.3：
Fault Models and Fault-Behavior of Processor Structures / 2：
Fault Models / 2.1：
Permanent Faults / 2.1.1：
Transient Faults / 2.1.2：
Embedded Processor Architectures / 2.2：
Control and Data Path / 2.2.1：
Processor Types / 2.2.2：
Fault Effects in Processors / 2.2.3：
On-line Check Technology for Processor Components / 3：
State of the Art / 3.1：
Component On-line Check Using Extended Berger Code Prediction / 3.2：
BCP for Integer Data-Paths / 3.2.1：
BCP for Floating-Point Components / 3.2.2：
Results / 3.2.3：
Component On-line Check with Cross-Parity Check / 3.3：
Cross-Parity Observation / 3.3.1：
Cross-Parity Error Detection Capabilities and Limitations / 3.3.3：
On-line Check Technology for Processor Control Signals / 3.3.4：
Control-Signal On-line Check with Pseudo-TMR Controller / 4.1：
Control-Signal On-line Check with State Code Prediction / 4.3：
Straightforward Processor State Encoding and Observation / 4.3.1：
Partitioned State Encoding and Observation / 4.3.3：
Outlook Regarding to Controller On-line Check / 4.3.4：
Fast Processor Recover Techniques with Micro Rollback / 5：
Previous Techniques and State of the Art / 5.1：
Micro Rollback with a Master-Trailer-Structure / 5.2：
Micro Rollback Test Circuit / 5.2.1：
Micro Rollback Technique for Simple Microprocessors / 5.2.2：
Micro Rollback in Pipeline-Processors / 5.2.3：
Recover Techniques for a Pipeline Processor / 5.3.1：
Implementations and Results / 5.3.2：
Conclusion and Outlook / 6：
Appendix - Demonstration Processors
Microprocessor t4008 / A.1：
Microprocessors t5008/16/32x / A.2：
Digital Signal Processors uDSP32a/b / A.3：
Pipeline Processors DLX32/64fpu_p / A.4：
Abbreviations, Symbols and Identifiers
List of Figures
List of Tables
References
Introduction / 1：
Background and Motivation / 1.1：
Terminology / 1.2：
5.

図書
図書
5. Experience management : foundations, development methodology, and Internet-based applications
Ralph Bergmann
出版情報: Berlin : Springer, c2002  xx, 393 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2432 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Complex Problem Solving in the Internet Age / 1.1：
Knowledge Intensive Problem Solving / 1.1.1：
Complexity Issues / 1.1.2：
Internet-Based Applications / 1.1.3：
Example Application Scenarios / 1.2：
Electronic Commerce / 1.2.1：
Diagnosis of Complex Technical Equipment / 1.2.2：
Electronics Design / 1.2.3：
Experience Reuse / 1.3：
Basic Scenarios of Experience Reuse / 1.3.1：
Expected Benefits of Experience Reuse / 1.3.2：
Experience Management / 1.4：
Knowledge Management / 1.4.1：
Experience Management versus Knowledge Management / 1.4.2：
Experience Management Activities / 1.4.3：
Experience Management Definition / 1.4.4：
Web Technologies for Experience Management / 1.5：
Representing and Storing Experience on the Web / 1.5.1：
Accessing Experience from the Web / 1.5.2：
Limitations of Information Access Approaches for Experience Reuse / 1.5.3：
Internet Technologies as Infrastructure for Experience Management / 1.5.4：
Methods for Experience Management on the Conceptual Level / 1.6：
Overview of This Book / 1.7：
The Topic in a Nutshell / 1.7.1：
Contributions from Recent Projects / 1.7.2：
Structure of the Book / 1.7.3：
Knowledge, Experience and Their Characteristics / 2：
Data, Information, and Knowledge / 2.1.1：
Specific and General Knowledge / 2.1.2：
Experience / 2.1.3：
Representation of Experience and Related Knowledge for Reuse / 2.1.4：
General Model for Experience Management / 2.2：
Problem Solving Cycle / 2.2.1：
Development and Maintenance Methodology / 2.2.2：
Related Models / 2.3：
Knowledge Management and Organizational Memory / 2.3.1：
Quality Improvement Paradigm and Experience Factory / 2.3.2：
The Case-Based Reasoning Cycle / 2.3.3：
Knowledge Representation for Experience Management / Part I：
Representing Experience / 3：
Cases for Representing Experience / 3.1：
Basic Case Structure / 3.1.1：
A First General Formalization of Cases / 3.1.2：
Utility of Experience / 3.1.3：
Representing Experience with Respect to Utility / 3.1.4：
Overview of Case Representation Approaches / 3.2：
The Textual Approach / 3.2.1：
The Conversational Approach / 3.2.2：
The Structural Approach / 3.2.3：
Comparing the Different Approaches / 3.2.4：
Effort Required for the Different Approaches / 3.2.5：
Focus on the Structural Approach / 3.2.6：
Formalizing Structural Case Representations / 3.3：
Attribute-Value Representation / 3.3.1：
Object-Oriented Representations / 3.3.2：
Graph Representations / 3.3.3：
Predicate Logic Representations / 3.3.4：
Relation to the General Definition / 3.3.5：
Comparing Different Structural Case Representation Approaches / 3.3.6：
Generalized Cases / 3.4：
Extensional Definition of Generalized Cases / 3.4.1：
Different Kinds of Generalized Cases / 3.4.2：
Representation of Generalized Cases / 3.4.3：
Hierarchical Representations and Abstract Cases / 3.5：
Advantages of Abstract Cases / 3.5.1：
Levels of Abstraction / 3.5.2：
Kind of Cases / 3.5.3：
Languages for Structural Case Representations / 3.6：
Common Case Representation Language CASUEL / 3.6.1：
The XML-based Orenge Modeling Language OML / 3.6.2：
Choice of the Vocabulary / 3.7：
Characterization Part / 3.7.1：
Lesson Part / 3.7.2：
Choice of Types / 3.7.3：
Assessing Experience Utility / 4：
Approximating Utility with Similarity / 4.1：
Traditional View of Case-Based Reasoning / 4.1.1：
Extended View / 4.1.2：
Similarity Measures / 4.1.3：
Relations between Similarity and Utility / 4.1.4：
General Considerations Concerning Similarity and Distance / 4.2：
Distance Measures / 4.2.1：
Possible Properties of Similarity Measures / 4.2.2：
Similarity and Fuzzy Sets / 4.2.3：
Similarity Measures for Attribute-Value Representations / 4.3：
Simple Measures for Binary Attributes / 4.3.1：
Simple Measures for Numerical Attributes / 4.3.2：
TheLocal-Global Principle / 4.3.3：
Local Similarity Measures for Numeric Attributes / 4.3.4：
Local Similarity Measures for Unordered and Totally Ordered Symbolic Attributes / 4.3.5：
Taxonomically Ordered Symbolic Types / 4.3.6：
Global Similarity Measures / 4.3.7：
Similarity Measures for Object-Oriented Representations / 4.4：
Example Use of Class Hierarchies and Object Similarities / 4.4.1：
Computing Object Similarities / 4.4.2：
Handling Multi-value Attributes / 4.4.3：
Related Approaches / 4.4.4：
Similarity Measures for Graph Representations / 4.5：
Graph Matching / 4.5.1：
Graph Editing / 4.5.2：
Similarity Measures for Predicate Logic Representations / 4.6：
Treating Atomic Formulas as Binary Attributes / 4.6.1：
Similarity between Atomic Formulas / 4.6.2：
Similarity through Logical Inference / 4.6.3：
Similarity for Generalized Cases / 4.7：
Canonical Extension of a Similarity Measure / 4.7.1：
The General Problem of Similarity Assessment / 4.7.2：
Representing Knowledge for Adaptation / 5：
Rule-Based Representations / 5.1：
Different Kinds of Rules / 5.1.1：
Formalization for Rules in an Object-Oriented Framework / 5.1.2：
An Example / 5.1.3：
Operator-Based Representations / 5.2：
Basic Approach / 5.2.1：
Representation / 5.2.2：
Restricting Adaptability with Consistency Constraints / 5.3：
Methods for Experience Management / 5.4：
User Communication / 6：
Introduction to User Interaction / 6.1：
A Basic Communication Architecture / 6.1.1：
Requirements / 6.1.2：
Distribution between Client and Server Side / 6.1.3：
A Formal Dialog Model / 6.2：
Overview / 6.2.1：
Dialog Situation / 6.2.2：
Dialog Interactions / 6.2.3：
Dialog Strategy and Its Execution / 6.2.4：
Predefined Static Dialog / 6.3：
Three-Step Questionnaire-Based Problem Acquisition / 6.3.1：
Static Domain Specific Dialogs / 6.3.2：
Dynamic and Adaptable Strategies / 6.4：
Criteria for Attribute Selection / 6.4.1：
Compiling Dialog Strategies / 6.4.2：
Dynamically Interpreted Strategies / 6.4.3：
Learning from User Interaction / 6.4.4：
Experience Presentation / 6.5：
Simple Lesson Lists / 6.5.1：
Experience Lists with External Links / 6.5.2：
Adding Similarity Explanations / 6.5.3：
Adaptive Experience Presentation / 6.5.4：
Experience Retrieval / 7：
General Considerations / 7.1：
Formal Retrieval Task / 7.1.1：
Storing Case Data in Databases / 7.1.2：
Overview of Approaches / 7.1.3：
Sequential Retrieval / 7.2：
Indexing by kd-Tree Variants / 7.3：
The Standard kd-Tree / 7.3.1：
The Inreca Tree / 7.3.2：
Building the Inreca Tree / 7.3.3：
Retrieval with the Inreca-Tree / 7.3.4：
Properties of kd-Tree Based Retrieval / 7.3.5：
Fish and Shrink Retrieval / 7.4：
BasicIdea / 7.4.1：
Retrieval Algorithm / 7.4.2：
Properties ofFish and Shrink / 7.4.3：
Case Retrieval Nets / 7.5：
The Case Retrieval Net Index Structure / 7.5.1：
The Retrieval Algorithm / 7.5.2：
Properties of Case Retrieval Nets / 7.5.3：
SQL Approximation / 7.6：
The Basic Idea / 7.6.1：
Properties of SQL Approximation / 7.6.2：
Summary / 7.7：
Experience Adaptation / 8：
Overview and Characterization of Different Adaptation Approaches / 8.1：
The Continuum of Adaptation Models / 8.1.1：
Generative Adaptation / 8.1.2：
Compositional Adaptation / 8.1.3：
Hierarchical Adaptation / 8.1.4：
Adaptation for Experience Management for Complex Problem Solving / 8.1.5：
Theory of Transformational Adaptation / 8.2：
Experience Transformations / 8.2.1：
The Experience Transformation Process / 8.2.2：
Similarity Measures in the Context of Experience Transformations / 8.2.3：
Relation to Rewrite Systems / 8.2.4：
Relation to Generalized Cases / 8.2.5：
Adaptation with Explicit Transformation Knowledge / 8.3：
Rule-Based Adaptation / 8.3.1：
Interactive Operator-Based Adaptation / 8.3.2：
Incremental Compositional Adaptation / 8.4：
Highly Structured Problems / 8.4.1：
Compositional Approach / 8.4.2：
The Adaptation Cycle / 8.4.3：
Controlling the Adaptation Cycle / 8.4.4：
Adaptation as Hill-Climbing Search / 8.4.5：
Developing and Maintaining Experience Management Applications / 9：
General Purpose of a Methodology / 9.1：
Methodology for Experience Management / 9.1.2：
Contributions to Methodology Development / 9.1.3：
INRECA Methodology Overview / 9.2：
Process Modeling / 9.2.1：
Experience Captured in Software Process Models / 9.2.2：
The INRECA Experience Base / 9.3：
Process Modeling in INRECA / 9.4：
Technical, Organizational, and Managerial Processes / 9.4.1：
Interaction among Processes / 9.4.2：
Combining Processes to Process Models / 9.4.3：
Generic and Specific Descriptions / 9.4.4：
The Common Generic Level / 9.5：
Managerial Processes / 9.5.1：
Technical Processes: Software Development / 9.5.3：
Organizational Processes / 9.5.4：
Documenting the INRECA Experience / 9.6：
Process Description Sheets / 9.6.1：
Product Description Sheets / 9.6.2：
Simple Method Description Sheets / 9.6.3：
Complex Method Description Sheets / 9.6.4：
Reusing and Maintaining INRECA Experience / 9.7：
The INRECA Reuse Procedure / 9.7.1：
Relations to the EMM Problem Solving Cycle / 9.7.2：
Development and Maintenance of the INRECA Experience Base / 9.7.3：
Tool Support for the INRECA Methodology / 9.8：
INRECA Experience Modeling Methodology Tool / 9.8.1：
Knowledge Modeling Tools / 9.8.2：
Experience Management Application Areas / Part III：
Experience Management for Electronic Commerce / 10：
Introduction to the Electronic Commerce Scenario / 10.1：
Electronic Commerce Definition / 10.1.1：
Transaction Model / 10.1.2：
Knowledge Involved in Electronic Commerce / 10.1.3：
Opportunities for Experience Management Support / 10.1.4：
Analyzing Pre-sales Scenarios / 10.2：
Customer Wishes / 10.2.1：
Products / 10.2.2：
Experience Representation for Product Search / 10.2.3：
WEBSELL: A Generic Electronic Commerce Architecture / 10.3：
Pathways Server and Dialog Components / 10.3.1：
Case-Based Retrieval / 10.3.2：
Collaborative Recommendation / 10.3.3：
Customization / 10.3.4：
Methodology Recipe for Electronic Commerce / 10.4：
Requirements Acquisition / 10.4.1：
Knowledge Modeling / 10.4.2：
GUI Development / 10.4.3：
Implement CBR Retrieval Engine / 10.4.4：
Integrate CBR and GUI / 10.4.5：
Application Overview / 10.5：
Application: Product Catalog for Operational Amplifiers / 10.6：
Vocabulary and User Interface / 10.6.1：
Benefit Analysis / 10.6.2：
Application: Customization of Electro-mechanical Components / 10.7：
Vocabulary, Retrieval, Customization, and User Interface / 10.7.1：
Experience Management for Self-Service and Help-Desk Support / 10.7.2：
Structure and Representation of the Experience Base / 11.1：
Object-Oriented Representation / 11.2.1：
Case Structure / 11.2.2：
Partitioning the Experience Base / 11.2.3：
User and Roles / 11.3：
Overall Architecture / 11.4：
The Server / 11.4.1：
The HOMER Client / 11.4.2：
Hotline Component / 11.5：
Create a New Problem Description / 11.5.1：
Retrieving Problem Solutions / 11.5.2：
Feedback from Problem Solving / 11.5.3：
Methodology Recipe for Help-Desk Applications / 11.6：
Managerial Processes during System Development / 11.6.1：
Organizational Processes during System Development / 11.6.2：
Technical Processes during System Development / 11.6.3：
Managerial Processes during System Use / 11.6.4：
Organizational Processes during System Use / 11.6.5：
Technical Processes during System Use / 11.6.6：
Process Model for a Help-Desk Project / 11.6.7：
Evaluation of HOMER / 11.7：
Benefits for the Help-Desk Operators / 11.7.1：
Evaluation of the Methodology Recipe / 11.7.2：
Experience Management for Electronic Design Reuse / 11.8：
Electronic Design Reuse / 12.1：
Intellectual Properties / 12.1.1：
IP Reuse / 12.1.2：
Existing IP Reuse Support / 12.1.3：
Challenges of Experience Management for IP Reuse / 12.1.4：
Representation of Intellectual Properties / 12.2：
IP Taxonomy / 12.2.1：
IP Attributes / 12.2.2：
IP Representation as Generalized Cases / 12.2.3：
An Example IP / 12.2.4：
Descriptions of Design Problems and Reuse-Related Knowledge / 12.3：
Problem Descriptions / 12.3.1：
The READEE Prototype for DSP Selection / 12.3.2：
Issues ofFuture Research / 12.5：
List of Symbols
References
Index
Introduction / 1：
Complex Problem Solving in the Internet Age / 1.1：
Knowledge Intensive Problem Solving / 1.1.1：
6.

図書
図書
6. Isabelle/HOL : a proof assistant for higher-order logic
Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
出版情報: Berlin : Springer, c2002  xiii, 218 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2283
所蔵情報: loading…
目次情報: 続きを見る
Elementary Techniques / Part I：
The Basics / 1：
Introduction / 1.1：
Theories / 1.2：
Types, Terms, and Formulae / 1.3：
Variables / 1.4：
Interaction and Interfaces / 1.5：
Getting Started / 1.6：
Functional Programming in HOL / 2：
An Introductory Theory / 2.1：
An Introductory Proof / 2.2：
Some Helpful Commands / 2.3：
Datatypes / 2.4：
Lists / 2.4.1：
The General Format / 2.4.2：
Primitive Recursion / 2.4.3：
Case Expressions / 2.4.4：
Structural Induction and Case Distinction / 2.4.5：
Case Study: Boolean Expressions / 2.4.6：
Some Basic Types / 2.5：
Natural Numbers / 2.5.1：
Pairs / 2.5.2：
Datatype option / 2.5.3：
Definitions / 2.6：
Type Synonyms / 2.6.1：
Constant Definitions / 2.6.2：
The Definitional Approach / 2.7：
More Functional Programming / 3：
Simplification / 3.1：
What Is Simplification? / 3.1.1：
Simplification Rules / 3.1.2：
The simp Method / 3.1.3：
Adding and Deleting Simplification Rules / 3.1.4：
Assumptions / 3.1.5：
Rewriting with Definitions / 3.1.6：
Simplifying let-Expressions / 3.1.7：
Conditional Simplification Rules / 3.1.8：
Automatic Case Splits / 3.1.9：
Tracing / 3.1.10：
Induction Heuristics / 3.2：
Case Study: Compiling Expressions / 3.3：
Advanced Datatypes / 3.4：
Mutual Recursion / 3.4.1：
Nested Recursion / 3.4.2：
The Limits of Nested Recursion / 3.4.3：
Case Study: Tries / 3.4.4：
Total Recursive Functions / 3.5：
Defining Recursive Functions / 3.5.1：
Proving Termination / 3.5.2：
Simplification and Recursive Functions / 3.5.3：
Induction and Recursive Functions / 3.5.4：
Presenting Theories / 4：
Concrete Syntax / 4.1：
Infix Annotations / 4.1.1：
Mathematical Symbols / 4.1.2：
Prefix Annotations / 4.1.3：
Syntax Translations / 4.1.4：
Document Preparation / 4.2：
Isabelle Sessions / 4.2.1：
Structure Markup / 4.2.2：
Formal Comments and Antiquotations / 4.2.3：
Interpretation of Symbols / 4.2.4：
Suppressing Output / 4.2.5：
Logic and Sets / Part II：
The Rules of the Game / 5：
Natural Deduction / 5.1：
Introduction Rules / 5.2：
Elimination Rules / 5.3：
Destruction Rules: Some Examples / 5.4：
Implication / 5.5：
Negation / 5.6：
Interlude: The Basic Methods for Rules / 5.7：
Unification and Substitution / 5.8：
Substitution and the subst Method / 5.8.1：
Unification and Its Pitfalls / 5.8.2：
Quantifiers / 5.9：
The Universal Introduction Rule / 5.9.1：
The Universal Elimination Rule / 5.9.2：
The Existential Quantifier / 5.9.3：
Renaming an Assumption: rename_tac / 5.9.4：
Reusing an Assumption: frule / 5.9.5：
Instantiating a Quantifier Explicitly / 5.9.6：
Description Operators / 5.10：
Definite Descriptions / 5.10.1：
Indefinite Descriptions / 5.10.2：
Some Proofs That Fail / 5.11：
Proving Theorems Using the blast Method / 5.12：
Other Classical Reasoning Methods / 5.13：
Forward Proof: Transforming Theorems / 5.14：
Modifying a Theorem Using of and THEN / 5.14.1：
Modifying a Theorem Using OF / 5.14.2：
Forward Reasoning in a Backward Proof / 5.15：
The Method insert / 5.15.1：
The Method subgoal_tac / 5.15.2：
Managing Large Proofs / 5.16：
Tacticals, or Control Structures / 5.16.1：
Subgoal Numbering / 5.16.2：
Proving the Correctness of Euclid's Algorithm / 5.17：
Sets, Functions, and Relations / 6：
Sets / 6.1：
Finite Set Notation / 6.1.1：
Set Comprehension / 6.1.2：
Binding Operators / 6.1.3：
Finiteness and Cardinality / 6.1.4：
Functions / 6.2：
Function Basics / 6.2.1：
Injections, Surjections, Bijections / 6.2.2：
Function Image / 6.2.3：
Relations / 6.3：
Relation Basics / 6.3.1：
The Reflexive and Transitive Closure / 6.3.2：
A Sample Proof / 6.3.3：
Well-Founded Relations and Induction / 6.4：
Fixed Point Operators / 6.5：
Case Study: Verified Model Checking / 6.6：
Propositional Dynamic Logic - PDL / 6.6.1：
Computation Tree Logic - CTL / 6.6.2：
Inductively Defined Sets / 7：
The Set of Even Numbers / 7.1：
Making an Inductive Definition / 7.1.1：
Using Introduction Rules / 7.1.2：
Rule Induction / 7.1.3：
Generalization and Rule Induction / 7.1.4：
Rule Inversion / 7.1.5：
Mutually Inductive Definitions / 7.1.6：
The Reflexive Transitive Closure / 7.2：
Advanced Inductive Definitions / 7.3：
Universal Quantifiers in Introduction Rules / 7.3.1：
Alternative Definition Using a Monotone Function / 7.3.2：
A Proof of Equivalence / 7.3.3：
Another Example of Rule Inversion / 7.3.4：
Case Study: A Context Free Grammar / 7.4：
Advanced Material / Part III：
More about Types / 8：
Numbers / 8.1：
Numeric Literals / 8.1.1：
The Type of Natural Numbers, nat / 8.1.2：
The Type of Integers, int / 8.1.3：
The Type of Real Numbers, real / 8.1.4：
Pairs and Tuples / 8.2：
Pattern Matching with Tuples / 8.2.1：
Theorem Proving / 8.2.2：
Records / 8.3：
Record Basics / 8.3.1：
Extensible Records and Generic Operations / 8.3.2：
Record Equality / 8.3.3：
Extending and Truncating Records / 8.3.4：
Axiomatic Type Classes / 8.4：
Overloading / 8.4.1：
Axioms / 8.4.2：
Introducing New Types / 8.5：
Declaring New Types / 8.5.1：
Defining New Types / 8.5.2：
Advanced Simplification, Recursion, and Induction / 9：
Advanced Features / 9.1：
How the Simplifier Works / 9.1.2：
Advanced Forms of Recursion / 9.2：
Beyond Measure / 9.2.1：
Recursion over Nested Datatypes / 9.2.2：
Partial Functions / 9.2.3：
Advanced Induction Techniques / 9.3：
Massaging the Proposition / 9.3.1：
Beyond Structural and Recursion Induction / 9.3.2：
Derivation of New Induction Schemas / 9.3.3：
CTL Revisited / 9.3.4：
Case Study: Verifying a Security Protocol / 10：
The Needham-Schroeder Public-Key Protocol / 10.1：
Agents and Messages / 10.2：
Modelling the Adversary / 10.3：
Event Traces / 10.4：
Modelling the Protocol / 10.5：
Proving Elementary Properties / 10.6：
Proving Secrecy Theorems / 10.7：
Appendix / A：
Bibliography
Index
Elementary Techniques / Part I：
The Basics / 1：
Introduction / 1.1：
7.

図書
図書
7. Resource allocation in wireless networks : theory and algorithms
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
出版情報: Berlin : Springer, c2006  xxii, 189 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4000
所蔵情報: loading…
目次情報: 続きを見る
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
Some Basic Definitions / 1.1：
Some Bounds on the Perron Root and Their Applications / 1.2：
Concavity of the Perron Root on Some Subsets of Irreducible Matrices / 1.2.1：
Kullback-Leibler Divergence Characterization / 1.2.2：
Some Extended Perron Root Characterizations / 1.2.3：
Collatz-Wielandt-Type Characterization of the Perron Root / 1.2.4：
Convexity of the Perron Root / 1.3：
Some Definitions / 1.3.1：
Sufficient Conditions / 1.3.2：
Convexity of the Feasibility Set / 1.3.3：
Necessary Conditions / 1.3.4：
Special Classes of Matrices / 1.4：
Symmetric Matrices / 1.4.1：
Symmetric Positive Semidefinite Matrices / 1.4.2：
The Perron Root Under the Linear Mapping / 1.5：
Some Bounds / 1.5.1：
Disproof of the Conjecture / 1.5.2：
Some Remarks on Arbitrary Nonnegative Matrices / 1.6：
Log-Convexity of the Spectral Radius / 1.6.1：
Characterization of the Spectral Radius / 1.6.2：
Collatz-Wielandt-Type Characterization of the Spectral Radius / 1.6.3：
Bibliograpical Notes / 1.7：
On the Positive Solution to a Linear System with Nonnegative Coefficients / 2：
Basic Concepts and Definitions / 2.1：
Feasibility Sets / 2.2：
Convexity Results / 2.3：
Log-Convexity of the Positive Solution / 2.3.1：
Strict Log-Convexity / 2.3.2：
Strict Convexity of the Feasibility Sets / 2.3.4：
The Linear Case / 2.4：
Applications and Algorithms / Part II：
Introduction / 3：
Network Model / 4：
Basic Definitions / 4.1：
Medium Access Control / 4.2：
Wireless Communication Channel / 4.3：
Signal-to-Interference Ratio / 4.3.1：
Power Constraints / 4.3.2：
Data Rate Model / 4.3.3：
Two Examples / 4.3.4：
Resource Allocation Problem in Communications Networks / 5：
End-to-End Rate Control in Wired Networks / 5.1：
Fairness Criteria / 5.1.1：
Algorithms / 5.1.2：
Problem Formulation for Wireless Networks / 5.2：
Joint Power Control and Link Scheduling / 5.2.1：
Feasible Rate Region / 5.2.2：
End-to-End Window-Based Rate Control for Wireless Networks / 5.2.3：
MAC Layer Fair Rate Control for Wireless Networks / 5.2.4：
Utility-Based Power Control / 5.2.5：
Interpretation in the QoS Domain / 5.3：
Remarks on Joint Power Control and Link Scheduling / 5.4：
Optimal Joint Power Control and Link Scheduling / 5.4.1：
High SIR Regime / 5.4.2：
Low SIR Regime / 5.4.3：
Wireless Links with Self-Interference / 5.4.4：
Remarks on the Efficiency-Fairness Trade Off / 5.5：
Efficiency of the Max-Min Fair Power Allocation / 5.5.1：
Axiom-Based Interference Model / 5.5.2：
Power Control Algorithm / 6：
Convex Statement of the Problem / 6.1：
Strong Convexity Conditions / 6.3：
Gradient Projection Algorithm / 6.4：
Global Convergence / 6.4.1：
Rate of Convergence / 6.4.2：
Diagonal Scaling / 6.4.3：
Projection on a Closed Convex Set / 6.4.4：
Distributed Implementation / 6.5：
Local and Global Parts of the Gradient Vector / 6.5.1：
Adjoint Network / 6.5.2：
Distributed Handshake Protocol / 6.5.3：
Noisy Measurements / 6.5.4：
Appendices / Part III：
Some Concepts and Results from Matrix Analysis / A：
Vectors and Vector Norms / A.1：
Matrices and Matrix Norms / A.2：
Square Matrices and Eigenvalues / A.3：
Spectral Radius and Neumann Series / A.3.1：
Orthogonal, Symmetric and Positive Semidefinite Matrices / A.3.2：
Perron-Frobenius Theory / A.4：
Perron-Frobenius Theorem for Irreducible Matrices / A.4.1：
Perron-Frobenius Theorem for Primitive Matrices / A.4.2：
Some Remarks on Reducible Matrices / A.4.3：
The Existence of a Positive Solution p to ([alpha]I - X)p = b / A.4.4：
Some Concepts and Results from Convex Analysis / B：
Sets and Functions / B.1：
Convex Sets and Functions / B.2：
Strong Convexity / B.2.1：
Log-Convex Functions / B.3：
Inverse Functions of Monotonic Log-Convex Functions / B.3.1：
Convergence of Gradient Projection Algorithms / B.4：
References
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
8.

図書
図書
8. Interactive Markov chains : and the quest for quantified quality
Holger Hermanns
出版情報: Berlin : Springer, c2002  xii, 217 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2428
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Performance Estimation with Markov C hains / 1.1：
The Challenge of Compositional Performance Estimation / 1.2：
Roadmap / 1.3：
Interactive Processes / 2：
Transition Systems and Interactive Processes / 2.1：
Equivalences on Interactive Processes / 2.2：
Algorithmic C omputation of Equivalences / 2.3：
Application Example: A Distributed Mail System / 2.4：
Discussion / 2.5：
Markov Chains / 3：
Stochastic Processes / 3.1：
Discrete-Time Markov C hains / 3.2：
C ontinuous-Time Markov C hains / 3.3：
Analysing Markov C hains / 3.4：
Equivalences on Markov C hains / 3.5：
Interactive Markov Chains / 3.6：
Design Decisions / 4.1：
Interactive Markov C hains / 4.2：
Strong Bisimilarity / 4.3：
Weak Bisimilarity / 4.4：
Algorithmic C omputation / 4.5：
Application Example: Leaky Bucket / 4.6：
Algebra of Interactive Markov Chains / 4.7：
Basic Language / 5.1：
Strong Bisimilarity and Weak C ongruence / 5.2：
Algebra of Strong Bisimilarity and Weak Congruence / 5.3：
Parallel Composition and Abstraction / 5.4：
Time Constraints and Symmetric Composition / 5.5：
Interactive Markov Chains in Practice / 5.6：
State Space Aggregation by Example / 6.1：
Application Study: An Ordinary Telephony System / 6.2：
Nondeterminism and Underspecification / 6.3：
Conclusion / 6.4：
Major Achievements / 7.1：
Has the C hallenge Been Met? / 7.2：
The C hallenge C ontinues / 7.3：
Appendix
Proofs for Chapter 3 and Chapter 4 / A：
Theorem 3.6.1 / A.1：
Theorem 4.3.1 / A.2：
Theorem 4.3.2 / A.3：
Lemma 4.4.2 / A.4：
Theorem 4.4.1 / A.5：
Theorem 4.4.2 / A.6：
Theorem 4.5.1 / A.7：
Theorem 4.5.2 / A.8：
Lemma 4.5.1 / A.9：
Theorem 4.5.3 / A.10：
Proofs for Chapter 5 / B：
Theorem 5.2.2 / B.1：
Theorem 5.3.2 / B.2：
Theorem 5.3.3 / B.3：
Theorem 5.3.6 / B.4：
Lemma 5.3.3 / B.5：
Theorem 5.3.8 / B.6：
Theorem 5.5.2 / B.7：
Theorem 5.5.3 / B.8：
Theorem 5.5.4 / B.9：
Bibliography
Introduction / 1：
Performance Estimation with Markov C hains / 1.1：
The Challenge of Compositional Performance Estimation / 1.2：
9.

図書
図書
9. Programming Constraint Services : high-level programming of standard and new constraint services
Christian Schulte
出版情報: Berlin : Springer, c2002  xii, 176 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2302 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Constraint Programming / 1.1：
Motivation / 1.2：
Approach / 1.3：
Outline / 1.4：
Source Material / 1.5：
Constraints / 2：
Search / 2.2：
Programming / 2.3：
Introducing Oz Light / 3：
Overview / 3.1：
Oz Light: Basics / 3.2：
The Store / 3.2.1：
Threads / 3.2.2：
Statements / 3.2.3：
Oz Light Continued / 3.3：
Primitive Operations / 3.3.1：
Exceptions / 3.3.2：
Ports and Active Services / 3.3.3：
Finite Domain Constraints / 3.3.4：
Syntactic Convenience / 3.4：
Relation to Full Oz / 3.5：
Spaces for Search / 4：
Local Computation Spaces / 4.1：
Space Manipulation / 4.3：
Space Creation / 4.3.1：
Merging Spaces / 4.3.2：
Injecting into Spaces / 4.3.3：
Control and Status / 4.4：
Alternatives / 4.5：
Distributable Spaces / 4.5.2：
Synchronizing on Stability / 4.5.3：
Committing to Alternatives / 4.5.4：
Cloning Spaces / 4.5.5：
Refining Commit / 4.5.6：
Situated Procedure Calls: Services Reconsidered / 4.6：
Previous Work: Solve Combinator / 4.7：
Summary / 4.8：
Search Engines / 5：
Depth-First Search / 5.1：
Simplifying Control: Exceptions / 5.2：
Binarization / 5.3：
Multiple Solutions / 5.4：
Explicit State Representation / 5.5：
Limited Discrepancy Search / 5.6：
Best-First Search / 5.7：
Best-Solution Search / 6：
Constraining Spaces / 6.1：
Iterative Best-Solution Search / 6.2：
Branch-and-Bound Best-Solution Search / 6.3：
An Alternative Formulation of BAB / 6.4：
Prune-Search: Generalizing BAB / 6.5：
Recomputation / 7：
Full Recomputation / 7.1：
Fixed Recomputation / 7.3：
Why Recomputation Matters / 7.4：
Adaptive Recomputation / 7.5：
Oz Explorer: Visual Search / 8：
Development of Constraint Programs / 8.1：
Example: Aligning for a Photo / 8.2：
Features / 8.3：
Implementation / 8.4：
Evaluation / 8.5：
Related Work / 8.6：
Distributed Search / 9：
Distributed Oz / 9.1：
Architecture / 9.3：
Cooperation / 9.3.1：
Worker / 9.3.2：
Manager / 9.3.3：
Distributed Search Engines / 9.3.4：
Spaces for Combinators / 9.5：
Space Tree / 10.1：
Space Tree Manipulation / 10.3：
Stability / 10.3.1：
Status Variable / 10.4.2：
Debugging Support / 10.4.3：
Choice of Programming Language / 10.5：
Constraint Combinators / 11：
Concurrent Negation / 11.1：
Generic Reification / 11.3：
Disjunction / 11.4：
Conditional / 11.5：
Andorra-Style Disjunction / 11.6：
Discussion and Evaluation / 11.7：
Implementing Oz Light / 12：
Synchronization / 12.1：
Store / 12.3：
Scheduler / 12.4：
Implementing Spaces / 13：
Nodes and Links / 13.1：
The Store: Model / 13.2.2：
The Store: Implementation / 13.2.4：
Runnable Threads / 13.3：
Globally Suspended Threads / 13.3.2：
Speculative Constraints / 13.3.3：
Local Threads / 13.3.4：
Checking Stability / 13.3.5：
Merge / 13.4：
Choose and Commit / 13.5：
Richer Basic Constraints / 13.5.2：
Variable Aliasing / 13.6.1：
Tree Constraints / 13.6.2：
Ports / 13.6.3：
Performance Overview / 13.8：
Other Approaches to Search / 14：
Other Constraint Programming Systems / 14.1：
Comparison with Trailing / 14.2：
Expressiveness / 14.2.1：
Implementation Issues / 14.2.2：
Criteria and Examples / 14.2.3：
Copying / 14.2.4：
Copying versus Trailing / 14.2.5：
Recomputation versus Trailing / 14.2.6：
System Comparison / 14.3：
Conclusion / 15：
Main Contributions / 15.1：
Future Work / 15.2：
Benchmark Problems and Platforms / A：
Benchmark Problems / A.1：
Sequential Platform / A.2：
Distributed Platform / A.3：
References
Index
Introduction / 1：
Constraint Programming / 1.1：
Motivation / 1.2：
10.

図書
図書
10. Next generation teletraffic and wired/wireless advanced networking : 6th International Conference, NEW2AN 2006, St. Petersburg, Russia, May 29 - June 2, 2006 : proceedings
Yevgeni Koucheryavy, Jarmo Harju, Villy B, Iversen (eds.)
出版情報: Berlin : Springer, c2006  xvi, 582 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4003
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼