1.
図書
edited with translation and explanatory notes by S.D. Joshi and J.A.F. Roodbergen
2.
図書
Thomas Barkowsky
目次情報:
続きを見る
Introduction / 1：
Mental Processing of Geographic Knowledge / 1.1：
Cognitive Maps / 1.1.1：
Mental Construction of Spatial Knowledge: An Example / 1.1.2：
Theses and Assumptions / 1.2：
Knowledge Construction and Human Memory / 1.2.1：
Characteristics of Geographic Knowledge / 1.2.2：
Spatial Knowledge Organization in Long-Term Memory / 1.2.3：
Visual Mental Images and Diagrammatic Reasoning / 1.2.4：
Research Questions and Goals / 1.3：
Research Questions / 1.3.1：
Goals / 1.3.2：
Approach: Experimental Computational Modeling / 1.4：
Computational Cognition / 1.4.1：
Building Computational Models / 1.4.2：
Modeling as Experimental Approach / 1.4.3：
Organization of this Thesis / 1.5：
State of the Art / 2：
Spatial Knowledge Conceptions: Cognitive Maps and Other Metaphors / 2.1：
Rubber Sheet Maps, Cognitive Atlases, Collages, and Geographic Information Systems / 2.1.1：
Spatial Mental Models / 2.1.3：
Other Conceptions / 2.1.4：
Human Memory / 2.2：
Working Memory / 2.2.1：
Long-Term Memory / 2.2.2：
Interacting Memory Systems in Mental Imagery / 2.2.3：
Mental Imagery / 2.3：
The Imagery Debate / 2.3.1：
Psychological and Neuroscientific Foundations / 2.3.2：
The Kosslyn Models / 2.3.3：
The 1980 Model / 2.3.3.1：
The 1994 Model / 2.3.3.2：
Spatial Reasoning / 2.4：
Topology / 2.4.1：
Orientation / 2.4.2：
Distance / 2.4.3：
Shape / 2.4.4：
Computational Geometry / 2.4.5：
Diagrammatic Reasoning / 2.5：
Propositional vs. Analogical Knowledge Representation / 2.5.1：
Types of Diagrammatic Reasoning Systems / 2.5.2：
Examples for Diagrammatic Reasoning Architectures / 2.5.3：
DEPIC-2D / 2.5.3.1：
WHISPER / 2.5.3.2：
Computational Imagery / 2.5.3.3：
Summary / 2.6：
MIRAGE - Developing the Model / 3：
Characteristics of the Model / 3.1：
Evaluating the Working Memory Representation / 3.1.1：
MIRAGE - Outline of the Model / 3.2：
Types of Entities and Spatial Relations in MIRAGE / 3.3：
Entities / 3.3.1：
Relations / 3.3.2：
Subsystems, Structures, and Processes / 3.4：
Long-Term Memory Activation / 3.4.1：
Spatial Knowledge Fragments / 3.4.1.1：
The Hierarchical Long-Term Memory Representation / 3.4.1.2：
The Access Process / 3.4.1.3：
The Activated Long-Term Memory Representation / 3.4.1.4：
The Construction Process / 3.4.1.5：
Visual Mental Image Construction / 3.4.2：
The Enriched Representation / 3.4.2.1：
The Conversion Process / 3.4.2.2：
The Visual Buffer / 3.4.2.3：
The Visualization Process / 3.4.2.4：
Image Inspection / 3.4.3：
The Inspection Result / 3.4.3.1：
The Inspection Process / 3.4.3.2：
Visual Mental Image Construction in Detail / 4：
A More Demanding Scenario / 4.1：
Diagrammatic Representations of Lean Knowledge / 4.2：
Consequences for Image Construction / 4.3：
Relaxation of Spatial Constraints / 4.3.1：
Completion of Qualitative Spatial Relations / 4.3.2：
Interpretation of Qualitative Spatial Relations / 4.3.3：
Image Revision Strategies in MIRAGE / 4.4：
Unstable Images / 4.4.1：
Omission of Facts / 4.4.2：
Revision of Relational Completion / 4.4.3：
Variation of Relational Completion / 4.4.3.1：
Relaxation of Relational Completion / 4.4.3.2：
Revision of Image Specification / 4.4.4：
Depicting Qualitative Spatial Relations / 4.4.4.1：
Depicting Unspecified Spatial Relations / 4.4.4.2：
MIRAGE Implementation / 4.5：
Computational Tools for Modeling: SIMSIS / 5.1：
The Idea of SIMSIS / 5.1.1：
The Aspect Map Model / 5.1.1.1：
Modeling Aspect Maps in SIMSIS / 5.1.1.2：
Depictions, Scenarios, and Interpretations / 5.1.2：
SIMSIS Pictures / 5.1.2.1：
SIMSIS Facts and Scenarios / 5.1.2.2：
SIMSIS Interpretations and Meaning Systems / 5.1.2.3：
Realization of the Model / 5.2：
MIRAGE Structures / 5.2.1：
Entities, Relations, and Spatial Knowledge Fragments / 5.2.1.1：
The Long-Term Memory Representations / 5.2.1.2：
MIRAGE Processes / 5.2.1.3：
The Long-Term Memory Activation Processes / 5.2.2.1：
The Image Construction Processes / 5.2.2.2：
Operation and Behavior of MIRAGE / 5.2.2.3：
Conclusion and Outlook / 6：
Results and Discussion / 6.1：
Reflecting the Theses / 6.2.1：
Spatial Knowledge Construction / 6.2.1.1：
Underdeterminacy in Long-Term Memory / 6.2.1.2：
Fragmentation and Hierarchical Organization / 6.2.1.3：
Visual Mental Imagery / 6.2.1.4：
The Parameters of the Model / 6.2.2：
Explicit Parameters / 6.2.2.1：
Implicit Parameters / 6.2.2.2：
Conclusions / 6.2.3：
Future Work / 6.3：
Extending MIRAGE / 6.3.1：
Geographic Entities and Spatial Relations / 6.3.1.1：
Partially Aggregated Knowledge Structures / 6.3.1.2：
Mental Imagery Functionality / 6.3.1.3：
Parameters of MIRAGE / 6.3.1.4：
Empirical Investigations / 6.3.2：
Use of Default Knowledge / 6.3.2.1：
Control of Image Construction / 6.3.2.2：
Processing Capacity for Mental Images / 6.3.2.3：
Use of Chunking Facilities / 6.3.2.4：
Combination of Propositional and Image-Based Reasoning / 6.3.2.5：
Application Perspectives / 6.3.3：
Adequate Presentation of Visual Information / 6.3.3.1：
External Support of Reasoning in Mental Images / 6.3.3.2：
Bibliography
Index
Introduction / 1：
Mental Processing of Geographic Knowledge / 1.1：
Cognitive Maps / 1.1.1：
3.
図書
[редакция ... В.Г. Озерова ... и др.]
出版情報:
Москва : "Книга", 1927- v. ; 27 cm
子書誌情報:
loading…
所蔵情報:
loading…
4.
図書
Joseph Wang
出版情報:
New York, N.Y. : VCH, c1994 xi, 198 p. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Abbreviations and Symbols
Fundamental Concepts / 1：
Why Electroanalysis? / 1.1：
Faradaic Processes / 1.2：
Mass-Transport-Controlled Reactions / 1.2.1：
Potential-Step Experiment / 1.2.1.1：
Potential-Sweep Experiments / 1.2.1.2：
Reactions Controlled by the Rate of Electron Transfer / 1.2.2：
Activated Complex Theory / 1.2.2.1：
Electrical Double Layer / 1.3：
Electrocapillary Effect / 1.4：
Supplementary Reading / 1.5：
Problems
References
Study of Electrode Reactions and Interfacial Properties / 2：
Cyclic Voltammetry / 2.1：
Data Interpretation / 2.1.1：
Reversible Systems / 2.1.1.1：
Irreversible and Quasi-reversible Systems / 2.1.1.2：
Study of Reaction Mechanisms / 2.1.2：
Study of Adsorption Processes / 2.1.3：
Quantitative Applications / 2.1.4：
Spectroelectrochemistry / 2.2：
Experimental Arrangement / 2.2.1：
Principles and Applications / 2.2.2：
Electrochemiluminescence / 2.2.3：
Optical Probing of Electrode-Solution Interfaces / 2.2.4：
Scanning Probe Microscopy / 2.3：
Scanning Tunneling Microscopy / 2.3.1：
Atomic Force Microscopy / 2.3.2：
Scanning Electrochemical Microscopy / 2.3.3：
Electrochemical Quartz Crystal Microbalance / 2.4：
Impedance Spectroscopy / 2.5：
Examples
Controlled-Potential Techniques / 3：
Chronoamperometry / 3.1：
Polarography / 3.2：
Pulse Voltammetry / 3.3：
Normal-Pulse Voltammetry / 3.3.1：
Differential-Pulse Voltammetry / 3.3.2：
Square-Wave Voltammetry / 3.3.3：
Staircase Voltammetry / 3.3.4：
AC Voltammetry / 3.4：
Stripping Analysis / 3.5：
Anodic Stripping Voltammetry / 3.5.1：
Potentiometric Stripping Analysis / 3.5.2：
Adsorptive Stripping Voltammetry and Potentiometry / 3.5.3：
Cathodic Stripping Voltammetry / 3.5.4：
Abrasive Stripping Voltammetry / 3.5.5：
Applications / 3.5.6：
Flow Analysis / 3.6：
Principles / 3.6.1：
Cell Design / 3.6.2：
Mass Transport and Current Response / 3.6.3：
Detection Modes / 3.6.4：
Practical Considerations / 4：
Electrochemical Cells / 4.1：
Solvents and Supporting Electrolytes / 4.2：
Oxygen Removal / 4.3：
Instrumentation / 4.4：
Working Electrodes / 4.5：
Mercury Electrodes / 4.5.1：
Solid Electrodes / 4.5.2：
Rotating Disk and Rotating Ring Disk Electrodes / 4.5.2.1：
Carbon Electrodes / 4.5.2.2：
Glassy Carbon Electrodes / 4.5.2.2.1：
Carbon Paste Electrodes / 4.5.2.2.2：
Carbon Fiber Electrodes / 4.5.2.2.3：
Diamond Electrodes / 4.5.2.2.4：
Metal Electrodes / 4.5.2.3：
Chemically Modified Electrodes / 4.5.3：
Self-Assembled Monolayers / 4.5.3.1：
Carbon-Nanotube-Modified Electrodes / 4.5.3.2：
Sol-gel Encapsulation of Reactive Species / 4.5.3.3：
Electrocatalytically Modified Electrodes / 4.5.3.4：
Preconcentrating Electrodes / 4.5.3.5：
Permselective Coatings / 4.5.3.6：
Conducting Polymers / 4.5.3.7：
Microelectrodes / 4.5.4：
Diffusion at Microelectrodes / 4.5.4.1：
Microelectrode Configurations / 4.5.4.2：
Composite Electrodes / 4.5.4.3：
Potentiometry / 5：
Principles of Potentiometric Measurements / 5.1：
Ion-Selective Electrodes / 5.2：
Glass Electrodes / 5.2.1：
pH Electrodes / 5.2.1.1：
Glass Electrodes for Other Cations / 5.2.1.2：
Liquid Membrane Electrodes / 5.2.2：
Ion Exchanger Electrodes / 5.2.2.1：
Neutral Carrier Electrodes / 5.2.2.2：
Solid-State Electrodes / 5.2.3：
Coated-Wire Electrodes and Solid-State Electrodes Without an Internal Filling Solution / 5.2.4：
On-line, On-site, and In Vivo Potentiometric Measurements / 5.3：
Electrochemical Sensors / 6：
Electrochemical Biosensors / 6.1：
Enzyme-Based Electrodes / 6.1.1：
Practical and Theoretical Considerations / 6.1.1.1：
Enzyme Electrodes of Analytical Significance / 6.1.1.2：
Glucose Sensors / 6.1.1.2.1：
Preface
Abbreviations and Symbols
Fundamental Concepts / 1：
5.
図書
text, translation and notes by J.A.F. Roodbergen ; edited by S.D. Joshi
6.
図書
Michael Beetz
目次情報:
続きを見る
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
7.
図書
Bernhard Westfechtel
目次情報:
続きを見る
Introduction / Part I：
Development Processes / 1：
Management / 1.2：
Definition / 1.2.1：
Managerial and Technical Level / 1.2.2：
Products, Activities, and Resources / 1.2.3：
Tools for Managing Development Processes / 1.3：
Management, System: Structure and Functionality / 1.3.1：
Scope of the Management System / 1.3.2：
Models for Managing Development Processes / 1.4：
Process Models / 1.4.1：
Models as Tool Specifications / 1.4.2：
Dynamics of Development Processes / 1.5：
Comparison to Other Business Domains / 1.5.1：
Dynamics at the Instance Level / 1.5.2：
Dynamics at the Definition Level / 1.5.3：
Approach and Contributions / 1.6：
Overall Approach / 1.6.1：
Context of Research / 1.6.2：
Models / 1.6.3：
Formal Specification / 1.6.4：
Tools / 1.6.5：
Related Work / 1.7：
Overview / 1.7.1：
Management of Development Processes: State of the Art / Part II：
Process Management / 2：
Product Management / 2.1：
Documents and Configurations / 2.1.1：
Version Control / 2.1.2：
Workspace Management / 2.1.3：
Activity Management / 2.2：
Modeling of Activities / 2.2.1：
Functions of Activity Management / 2.2.3：
Tools for Activity Management / 2.2.4：
Resource Management / 2.3：
Human Resources / 2.3.1：
Computer Resources / 2.3.2：
Conclusion / 2.4：
Functions of Product Management / 3：
Models for Product Management / 3.2：
Product Space / 3.2.1：
Version Space / 3.2.2：
Interplay of Product Space and Version Space / 3.2.3：
Construction of Versions / 3.2.4：
Workspaces / 3.2.5：
Tools for Product Management / 3.3：
System Descriptions / 3.3.1：
Universe of Discourse / 3.4：
Functions and Objectives of Process Management. / 4.1.1：
Characterization of Development Processes / 4.1.2：
Models for Activity Management / 4.2：
Conceptual Framework / 4.2.1：
Process Meta Models / 4.2.2：
Product Development / 4.2.3：
Management of Human Resources / 4.3：
Models for Human Resource Management / 5.1.1：
Tools for Human Resource Management / 5.1.2：
Management of Computer Resources / 5.2：
Tool Integration / 5.3：
Tool Integration: Classification and Overview / 6.1：
Tool Integration Technologies / 6.2：
A Management System for Mechanical Engineering / 6.3：
The SUKITS Project / 7：
Overview of the SUKITS Project / 7.1：
Motivation / 7.1.1：
Goals / 7.1.2：
Application Domain / 7.1.3：
Project Structure and Results / 7.1.4：
The SUKITS Approach to Process Management / 7.2：
Contributions / 7.2.1：
Management Models / 7.2.2：
Management Tools / 7.2.3：
Management Model: Informal Description / 7.3：
Product Management Model / 8.1：
Documents, Dependencies, and Configurations / 8.1.1：
Versions and Versioned Objects / 8.1.2：
Version and Configuration Graphs / 8.1.3：
Consistency Control and Data Integration / 8.1.4：
Activity Management Model / 8.2：
Product-Centered Activity Management / 8.2.1：
Process Dynamics / 8.2.2：
Resource Management Model / 8.3：
Integration of Formal and Informal Cooperation / 8.4：
Management Model: Formal Specification / 8.5：
PROGRES at a First Glance / 9.1：
Graph Schema / 9.2：
Graph Transformations / 9.2.2：
Model Adaptation / 9.3：
Adaptation in SUKITS / 9.5.1：
PROGRES Specification of Model Adaptation / 9.5.2：
Discussion / 9.6：
Specification-in-the-Small / 9.6.1：
Specification-in-the-Large / 9.6.2：
Management System / 9.7：
Tools: Functionality and User Interface / 10.1：
Management Environment / 10.1.1：
Modeling Environment / 10.1.2：
Work Environment / 10.1.3：
Realization / 10.2：
Communication and Distribution / 10.2.1：
Applications, Experiences, and Evaluation / 10.3：
SUKITS Prototypes / 11.1：
Demonstration: Development of a Drill / 11.2：
Demo Steps / 11.2.1：
Evaluation / 11.3：
ManagementModel / 11.3.1：
Applications / 11.3.2：
Toward an Adaptable Environment for Modeling and Managing Development Processes / 11.4：
Dimensions of Management / 12：
Model Architecture / 12.1.2：
Limitations of the SUKITS Approach / 12.1.3：
Modeling of Management Configurations / 12.2：
Architectural Issues / 12.2.1：
Models for Managing Products, Activities, and Resources / 12.2.2：
PROGRES Environment / 12.3：
Process Support Environment / 12.3.4：
Dynamic Task Nets / 12.4：
Informal Description / 13.1：
Structure of Task Nets / 13.1.1：
Levels of Modeling / 13.1.2：
Behavior of Task Nets / 13.1.3：
Examples / 13.1.4：
Base Model / 13.2：
Standard Behavior / 13.2.2：
Structural Adaptation / 13.2.3：
Behavioral Adaptation / 13.2.4：
Net-based approaches / 13.2.5：
Rule-based approaches / 13.3.2：
State-based approaches / 13.3.3：
Procedural approaches / 13.3.4：
Unified Multi-Project Resource Management / 13.4：
Features of RESMOD / 14.1：
Resources / 14.1.2：
Resource Configurations / 14.1.3：
Plan and Actual Resources / 14.1.4：
Base and Project Resources / 14.1.5：
Task Assignments / 14.1.6：
Layer 1: Resource Hierarchies / 14.2：
Layer 2: Actual and Required Resources / 14.2.2：
Layer 3: Base and Project Resources / 14.2.3：
Object-Oriented Process Modeling / 14.2.4：
Meta Process / 15.1：
Process Analysis / 15.3：
Process Specification / 15.4：
Structural Modeling / 15.4.1：
Model Structuring / 15.4.2：
Behavioral Modeling / 15.4.3：
Environment Generation / 15.5：
Lessons Learned / 15.6：
Current Status and Future Work / 15.7：
Management Model / 16.1：
Modeling Languages / 16.2：
Glossary / 16.3：
References
Index
Introduction / Part I：
Development Processes / 1：
Management / 1.2：
8.
図書
Sung Joon Ahn
目次情報:
続きを見る
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：
9.
図書
Larry L. Peterson & Bruce S. Davie
目次情報:
続きを見る
Foreword
Foreword to the First Edition
Preface / Chapter 1：
Foundation
Direct Link Networks / 1：
Problem: Building a Network / Chapter 3：
Packet Switching
Internetworking / 1.1：
Applications
End-to-End Protocols / Chapter 5：
Requirements / Chapter 6：
Congestion Control & Resource Allocation
End-to-end Data / 1.2.1：
Connectivity
Security / Chapter 8：
Cost-Effective Resource Sharing / Chapter 9：
Support for Common Services / 1.2.3：
Network Architecture / 1.3：
Layering and Protocols / 1.3.1：
OSI Architecture / 1.3.2：
Internet Architecture / 1.3.3：
Implementing Network Software / 1.4：
Application Programming Interface (Sockets) / 1.4.1：
Example Application / 1.4.2：
Protocol Implementation Issues / 1.4.3：
Performance / 1.5：
Bandwidth and Latency / 1.5.1：
Delay x Bandwidth Product / 1.5.2：
High-Speed Networks / 1.5.3：
Application Performance Needs / 1.5.4：
Summary / 1.6：
Open Issue: Ubiquitous Networking
Further Reading
Exercises
Problem: Physically Connecting Hosts / 2：
Hardware Building Blocks / 2.1：
Nodes / 2.1.1：
Links / 2.1.2：
Encoding (NRZ, NRZI, Manchester, 4B/5B) / 2.2：
Framing / 2.3：
Byte-Oriented Protocols (BISYNC, PPP, DDCMP) / 2.3.1：
Bit-Oriented Protocols (HDLC) / 2.3.2：
Clock-Based Framing (SONET) / 2.3.3：
Error Detection / 2.4：
Two-Dimensional Parity / 2.4.1：
Internet Checksum Algorithm / 2.4.2：
Cyclic Redundancy Check / 2.4.3：
Reliable Transmission / 2.5：
Stop-and-Wait / 2.5.1：
Sliding Window / 2.5.2：
Concurrent Logical Channels / 2.5.3：
Ethernet (802.3) / 2.6：
Physical Properties / 2.6.1：
Access Protocol / 2.6.2：
Experience with Ethernet / 2.6.3：
Token Rings (802.5, FDDI) / 2.7：
Token Ring Media Access Control / 2.7.1：
Token Ring Maintenance / 2.7.3：
Frame Format / 2.7.4：
FDDI / 2.7.5：
Wireless (802.11) / 2.8：
Collision Avoidance / 2.8.1：
Distribution System / 2.8.3：
Network Adaptors / 2.8.4：
Components / 2.9.1：
View from the Host / 2.9.2：
Memory Bottleneck / 2.9.3：
Open Issue: Does It Belong in Hardware? / 2.10：
Problem: Not All Networks Are Directly Connected / 3：
Switching and Forwarding / 3.1：
Datagrams / 3.1.1：
Virtual Circuit Switching / 3.1.2：
Source Routing / 3.1.3：
Bridges and LAN Switches / 3.2：
Learning Bridges / 3.2.1：
Spanning Tree Algorithm / 3.2.2：
Broadcast and Multicast / 3.2.3：
Limitations of Bridges / 3.2.4：
Cell Switching (ATM) / 3.3：
Cells / 3.3.1：
Segmentation and Reassembly / 3.3.2：
Virtual Paths / 3.3.3：
Physical Layers for ATM / 3.3.4：
ATM in the LAN / 3.3.5：
Implementation and Performance / 3.4：
Ports / 3.4.1：
Fabrics / 3.4.2：
Open Issue: The Future of ATM / 3.5：
Problem: There Is More Than One Network / 4：
Simple Internetworking (IP) / 4.1：
What Is an Internetwork? / 4.1.1：
Service Model / 4.1.2：
Global Addresses / 4.1.3：
Datagram Forwarding in IP / 4.1.4：
Address Translation (ARP) / 4.1.5：
Host Configuration (DHCP) / 4.1.6：
Error Reporting (ICMP) / 4.1.7：
Virtual Networks and Tunnels / 4.1.8：
Routing / 4.2：
Network as a Graph / 4.2.1：
Distance Vector (RIP) / 4.2.2：
Link State (OSPF) / 4.2.3：
Metrics / 4.2.4：
Routing for Mobile Hosts / 4.2.5：
Global Internet / 4.3：
Subnetting / 4.3.1：
Classless Routing (CIDR) / 4.3.2：
Interdomain Routing (BGP) / 4.3.3：
Routing Areas / 4.3.4：
IP Version 6 (IPv6) / 4.3.5：
Multicast / 4.4：
Link-State Multicast / 4.4.1：
Distance-Vector Multicast / 4.4.2：
Protocol Independent Multicast (PIM) / 4.4.3：
Multiprotocol Label Switching (MPLS) / 4.5：
Destination-Based Forwarding / 4.5.1：
Explicit Routing / 4.5.2：
Virtual Private Networks and Tunnels / 4.5.3：
Open Issue: Deployment of IPV6 / 4.6：
Problem: Getting Processess to Communicate / 5：
Simple Demultiplexer (UDP) / 5.1：
Reliable Byte Stream (TCP) / 5.2：
End-to-End Issues / 5.2.1：
Segment Format / 5.2.2：
Connection Establishment and Termination / 5.2.3：
Sliding Window Revisited / 5.2.4：
Triggering Transmission / 5.2.5：
Adaptive Retransmission / 5.2.6：
Record Boundaries / 5.2.7：
TCP Extensions / 5.2.8：
Alternative Design Choices / 5.2.9：
Remote Procedure Call / 5.3：
Bulk Transfer (BLAST) / 5.3.1：
Request/Reply (CHAN) / 5.3.2：
Dispatcher (SELECT) / 5.3.3：
Putting It All Together (SunRPC, DCE) / 5.3.4：
Open Issue: Application-Specific Protocols / 5.4：
Congestion Control and Resource Allocation / 6：
Problem: Allocating Resources
Issues in Resource Allocation / 6.1：
Network Model / 6.1.1：
Taxonomy / 6.1.2：
Evaluation Criteria / 6.1.3：
Queuing Disciplines / 6.2：
FIFO / 6.2.1：
Fair Queuing / 6.2.2：
TCP Congestion Control / 6.3：
Additive Increase/Multiplicative Decrease / 6.3.1：
Slow Start / 6.3.2：
Fast Retransmit and Fast Recovery / 6.3.3：
Congestion-Avoidance Mechanisms / 6.4：
DECbit / 6.4.1：
Random Early Detection (RED) / 6.4.2：
Source-Based Congestion Avoidance / 6.4.3：
Quality of Service / 6.5：
Application Requirements / 6.5.1：
Integrated Services (RSVP) / 6.5.2：
Differentiated Services (EF, AF) / 6.5.3：
ATM Quality of Service / 6.5.4：
Equation-Based Congestion Control / 6.5.5：
Open Issue: Inside versus Outside the Network / 6.6：
End-to-End Data / 7：
Problem: What Do We Do with the Data?
Presentation Formatting / 7.1：
Examples (XDR, ASN. 1, NDR) / 7.1.1：
Markup Languages (XML) / 7.1.3：
Data Compression / 7.2：
Lossless Compression Algorithms / 7.2.1：
Image Compression (JPEG) / 7.2.2：
Video Compression (MPEG) / 7.2.3：
Transmitting MPEG over a Network / 7.2.4：
Audio Compression (MP3) / 7.2.5：
Open Issue: Computer Networks Meet Consumer Electronics / 7.3：
Network Security / 8：
Problem: Securing the Data
Cryptographic Algorithms / 8.1：
Secret Key Encryption (DES) / 8.1.1：
Public Key Encryption (RSA) / 8.1.3：
Message Digest Algorithms (MD5) / 8.1.4：
Security Mechanisms / 8.1.5：
Authentication Protocols / 8.2.1：
Message Integrity Protocols / 8.2.2：
Public Key Distribution (X.509) / 8.2.3：
Example Systems / 8.3：
Pretty Good Privacy (PGP) / 8.3.1：
Secure Shell (SSH) / 8.3.2：
Transport Layer Security (TLS, SSL, HTTPS) / 8.3.3：
IP Security (IPSEC) / 8.3.4：
Firewalls / 8.4：
Filter-Based Firewalls / 8.4.1：
Proxy-Based Firewalls / 8.4.2：
Limitations / 8.4.3：
Open Issue: Denial-of-Service Attacks / 8.5：
Problem: Applications Need Their Own Protocols / 9：
Name Service (DNS) / 9.1：
Domain Hierarchy / 9.1.1：
Name Servers / 9.1.2：
Name Resolution / 9.1.3：
Traditional Applications / 9.2：
Electronic Mail (SMTP, MIME, IMAP) / 9.2.1：
World Wide Web (HTTP) / 9.2.2：
Network Management (SNMP) / 9.2.3：
Multimedia Applications / 9.3：
Real-time Transport Protocol (RTP) / 9.3.1：
Session Control and Call Control (SDP, SIP, H.323) / 9.3.2：
Overlay Networks / 9.4：
Routing Overlays / 9.4.1：
Peer-to-Peer Networks / 9.4.2：
Content Distribution Networks / 9.4.3：
Open Issue: New Network Artichitecture / 9.5：
Glossary
Bibliography
Solutions to Selected Exercises
Index
About the Authors
Foreword
Foreword to the First Edition
Preface / Chapter 1：
10.
図書
Larry L. Peterson & Bruce S. Davie
出版情報:
San Francisco, Calif. : Morgan Kaufmann Publishers, c1996 xxiii, 552 p. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Foreword
Foreword to the First Edition
Preface / Chapter 1：
Foundation
Direct Link Networks / 1：
Problem: Building a Network / Chapter 3：
Packet Switching
Internetworking / 1.1：
Applications
End-to-End Protocols / Chapter 5：
Requirements / Chapter 6：
Congestion Control & Resource Allocation
End-to-end Data / 1.2.1：
Connectivity
Security / Chapter 8：
Cost-Effective Resource Sharing / Chapter 9：
Support for Common Services / 1.2.3：
Network Architecture / 1.3：
Layering and Protocols / 1.3.1：
OSI Architecture / 1.3.2：
Internet Architecture / 1.3.3：
Implementing Network Software / 1.4：
Application Programming Interface (Sockets) / 1.4.1：
Example Application / 1.4.2：
Protocol Implementation Issues / 1.4.3：
Performance / 1.5：
Bandwidth and Latency / 1.5.1：
Delay x Bandwidth Product / 1.5.2：
High-Speed Networks / 1.5.3：
Application Performance Needs / 1.5.4：
Summary / 1.6：
Open Issue: Ubiquitous Networking
Further Reading
Exercises
Problem: Physically Connecting Hosts / 2：
Hardware Building Blocks / 2.1：
Nodes / 2.1.1：
Links / 2.1.2：
Encoding (NRZ, NRZI, Manchester, 4B/5B) / 2.2：
Framing / 2.3：
Byte-Oriented Protocols (BISYNC, PPP, DDCMP) / 2.3.1：
Bit-Oriented Protocols (HDLC) / 2.3.2：
Clock-Based Framing (SONET) / 2.3.3：
Error Detection / 2.4：
Two-Dimensional Parity / 2.4.1：
Internet Checksum Algorithm / 2.4.2：
Cyclic Redundancy Check / 2.4.3：
Reliable Transmission / 2.5：
Stop-and-Wait / 2.5.1：
Sliding Window / 2.5.2：
Concurrent Logical Channels / 2.5.3：
Ethernet (802.3) / 2.6：
Physical Properties / 2.6.1：
Access Protocol / 2.6.2：
Experience with Ethernet / 2.6.3：
Token Rings (802.5, FDDI) / 2.7：
Token Ring Media Access Control / 2.7.1：
Token Ring Maintenance / 2.7.3：
Frame Format / 2.7.4：
FDDI / 2.7.5：
Wireless (802.11) / 2.8：
Collision Avoidance / 2.8.1：
Distribution System / 2.8.3：
Network Adaptors / 2.8.4：
Components / 2.9.1：
View from the Host / 2.9.2：
Memory Bottleneck / 2.9.3：
Open Issue: Does It Belong in Hardware? / 2.10：
Problem: Not All Networks Are Directly Connected / 3：
Switching and Forwarding / 3.1：
Datagrams / 3.1.1：
Virtual Circuit Switching / 3.1.2：
Source Routing / 3.1.3：
Bridges and LAN Switches / 3.2：
Learning Bridges / 3.2.1：
Spanning Tree Algorithm / 3.2.2：
Broadcast and Multicast / 3.2.3：
Limitations of Bridges / 3.2.4：
Cell Switching (ATM) / 3.3：
Cells / 3.3.1：
Segmentation and Reassembly / 3.3.2：
Virtual Paths / 3.3.3：
Physical Layers for ATM / 3.3.4：
ATM in the LAN / 3.3.5：
Implementation and Performance / 3.4：
Ports / 3.4.1：
Fabrics / 3.4.2：
Open Issue: The Future of ATM / 3.5：
Problem: There Is More Than One Network / 4：
Simple Internetworking (IP) / 4.1：
What Is an Internetwork? / 4.1.1：
Service Model / 4.1.2：
Global Addresses / 4.1.3：
Datagram Forwarding in IP / 4.1.4：
Address Translation (ARP) / 4.1.5：
Host Configuration (DHCP) / 4.1.6：
Error Reporting (ICMP) / 4.1.7：
Virtual Networks and Tunnels / 4.1.8：
Routing / 4.2：
Network as a Graph / 4.2.1：
Distance Vector (RIP) / 4.2.2：
Link State (OSPF) / 4.2.3：
Metrics / 4.2.4：
Routing for Mobile Hosts / 4.2.5：
Global Internet / 4.3：
Subnetting / 4.3.1：
Classless Routing (CIDR) / 4.3.2：
Interdomain Routing (BGP) / 4.3.3：
Routing Areas / 4.3.4：
IP Version 6 (IPv6) / 4.3.5：
Multicast / 4.4：
Link-State Multicast / 4.4.1：
Distance-Vector Multicast / 4.4.2：
Protocol Independent Multicast (PIM) / 4.4.3：
Multiprotocol Label Switching (MPLS) / 4.5：
Destination-Based Forwarding / 4.5.1：
Explicit Routing / 4.5.2：
Virtual Private Networks and Tunnels / 4.5.3：
Open Issue: Deployment of IPV6 / 4.6：
Problem: Getting Processess to Communicate / 5：
Simple Demultiplexer (UDP) / 5.1：
Reliable Byte Stream (TCP) / 5.2：
End-to-End Issues / 5.2.1：
Segment Format / 5.2.2：
Connection Establishment and Termination / 5.2.3：
Sliding Window Revisited / 5.2.4：
Triggering Transmission / 5.2.5：
Adaptive Retransmission / 5.2.6：
Record Boundaries / 5.2.7：
TCP Extensions / 5.2.8：
Alternative Design Choices / 5.2.9：
Remote Procedure Call / 5.3：
Bulk Transfer (BLAST) / 5.3.1：
Request/Reply (CHAN) / 5.3.2：
Dispatcher (SELECT) / 5.3.3：
Putting It All Together (SunRPC, DCE) / 5.3.4：
Open Issue: Application-Specific Protocols / 5.4：
Congestion Control and Resource Allocation / 6：
Problem: Allocating Resources
Issues in Resource Allocation / 6.1：
Network Model / 6.1.1：
Taxonomy / 6.1.2：
Evaluation Criteria / 6.1.3：
Queuing Disciplines / 6.2：
FIFO / 6.2.1：
Fair Queuing / 6.2.2：
TCP Congestion Control / 6.3：
Additive Increase/Multiplicative Decrease / 6.3.1：
Slow Start / 6.3.2：
Fast Retransmit and Fast Recovery / 6.3.3：
Congestion-Avoidance Mechanisms / 6.4：
DECbit / 6.4.1：
Random Early Detection (RED) / 6.4.2：
Source-Based Congestion Avoidance / 6.4.3：
Quality of Service / 6.5：
Application Requirements / 6.5.1：
Integrated Services (RSVP) / 6.5.2：
Differentiated Services (EF, AF) / 6.5.3：
ATM Quality of Service / 6.5.4：
Equation-Based Congestion Control / 6.5.5：
Open Issue: Inside versus Outside the Network / 6.6：
End-to-End Data / 7：
Problem: What Do We Do with the Data?
Presentation Formatting / 7.1：
Examples (XDR, ASN. 1, NDR) / 7.1.1：
Markup Languages (XML) / 7.1.3：
Data Compression / 7.2：
Lossless Compression Algorithms / 7.2.1：
Image Compression (JPEG) / 7.2.2：
Video Compression (MPEG) / 7.2.3：
Transmitting MPEG over a Network / 7.2.4：
Audio Compression (MP3) / 7.2.5：
Open Issue: Computer Networks Meet Consumer Electronics / 7.3：
Network Security / 8：
Problem: Securing the Data
Cryptographic Algorithms / 8.1：
Secret Key Encryption (DES) / 8.1.1：
Public Key Encryption (RSA) / 8.1.3：
Message Digest Algorithms (MD5) / 8.1.4：
Security Mechanisms / 8.1.5：
Authentication Protocols / 8.2.1：
Message Integrity Protocols / 8.2.2：
Public Key Distribution (X.509) / 8.2.3：
Example Systems / 8.3：
Pretty Good Privacy (PGP) / 8.3.1：
Secure Shell (SSH) / 8.3.2：
Transport Layer Security (TLS, SSL, HTTPS) / 8.3.3：
IP Security (IPSEC) / 8.3.4：
Firewalls / 8.4：
Filter-Based Firewalls / 8.4.1：
Proxy-Based Firewalls / 8.4.2：
Limitations / 8.4.3：
Open Issue: Denial-of-Service Attacks / 8.5：
Problem: Applications Need Their Own Protocols / 9：
Name Service (DNS) / 9.1：
Domain Hierarchy / 9.1.1：
Name Servers / 9.1.2：
Name Resolution / 9.1.3：
Traditional Applications / 9.2：
Electronic Mail (SMTP, MIME, IMAP) / 9.2.1：
World Wide Web (HTTP) / 9.2.2：
Network Management (SNMP) / 9.2.3：
Multimedia Applications / 9.3：
Real-time Transport Protocol (RTP) / 9.3.1：
Session Control and Call Control (SDP, SIP, H.323) / 9.3.2：
Overlay Networks / 9.4：
Routing Overlays / 9.4.1：
Peer-to-Peer Networks / 9.4.2：
Content Distribution Networks / 9.4.3：
Open Issue: New Network Artichitecture / 9.5：
Glossary
Bibliography
Solutions to Selected Exercises
Index
About the Authors
Foreword
Foreword to the First Edition
Preface / Chapter 1：
11.
図書
Ubbo Visser
目次情報:
続きを見る
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：
12.
図書
Manolis Koubarakis ... [et al.]
目次情報:
続きを見る
Introduction / Manolis Koubarakis ; Timos Sellis1：
Why Spatio-temporal Databases? / 1.1：
Chorochronos / 1.2：
Contributions / 1.3：
Organization of the Book / 1.4：
References
Ontology for Spatio-temporal Databases / Andrew U. Frank2：
Ontology to Drive Information System Design / 2.1：
Ontological Problems of Geographic Information Systems and Other Spatio-temporal Information Systems / 2.1.2：
Structure of the Chapter / 2.1.3：
The Notion of Ontology / 2.2：
Classical View / 2.2.1：
Social Reality / 2.2.2：
Application Domains / 2.3：
Table-Top Situation / 2.3.1：
Cityscape / 2.3.2：
Geographic Landscape / 2.3.3：
Model of Information Systems / 2.4：
Information Systems as Vehicles of Exchange between Multiple Agents / 2.4.1：
Correctness of Information System Related to Observations / 2.4.2：
Semantics for Terms in Information Systems / 2.4.3：
Grounding of Semantics in Physical Operations / 2.4.4：
The Five Tiers of the Ontology / 2.5：
Physical Reality Seen as an Ontology of a Four-Dimensional Field / 2.5.1：
Observation of Physical Reality / 2.5.2：
Operations and Ontology of Individuals / 2.5.3：
Social Ontology / 2.5.4：
Ontology of Cognitive Agents / 2.5.5：
The Language to Describe the Ontology / 2.6：
Tools to Implement Ontologies / 2.6.1：
Multi-agent Systems and Formalization of Database Ontologies / 2.6.2：
Ontological Tier 0: Ontology of the Physical Reality / 2.7：
Properties / 2.7.1：
Physical Space-Time Field / 2.7.2：
Ontological Tier 1: Our Limited Knowledge of the World through Observations of Reality / 2.8：
Observations / 2.8.1：
Measurement Units / 2.8.2：
Classification of Values / 2.8.3：
Special Observations: Points in Space and Time / 2.8.4：
Approximate Location / 2.8.5：
Discretization and Sampling / 2.8.6：
Virtual Datasets: Validity of Values / 2.8.7：
Ontological Tier 2: Representation - World of Individual Objects / 2.9：
Objects Are Defined by Uniform Properties / 2.9.1：
Geometry of Objects / 2.9.2：
Properties of Objects / 2.9.3：
Geographic Objects Are not Solid Bodies / 2.9.4：
Objects Endure in Time / 2.9.5：
Temporal, but A-Spatial Objects / 2.9.6：
Ontological Tier 3: Socially Constructed Reality / 2.10：
Social Reality Is Real within a Context / 2.10.1：
Names / 2.10.2：
Institutional Reality / 2.10.3：
Ontological Tier 4: Modeling Cognitive Agents / 2.11：
Logical Deduction / 2.11.1：
Two Time Perspectives / 2.11.2：
Sources of Knowledge / 2.11.3：
Ontological Commitments Necessary for a Spatio-temporal Database / 2.12：
Existence of a Single Reality / 2.12.1：
Values for Properties Can Be Observed / 2.12.2：
Assume Space and Time / 2.12.3：
Observations Are Necessarily Limited / 2.12.4：
Processes Determine Objects / 2.12.5：
Names of Objects / 2.12.6：
Social, Especially Institutionally Constructed Reality / 2.12.7：
Knowledge of an Agent Is Changing in Time / 2.12.8：
Conclusions / 2.13：
Conceptual Models for Spatio-temporal Applications / Nectaria Tryfona ; Rosanne Price ; Christian S. Jensen3：
Motivation / 3.1：
Spatio-temporal Foundations / 3.2：
Spatio-temporal Entity-Relationship Model / 3.3：
Extending the ER with Spatio-temporal Constructs / 3.3.1：
A Textual Notation for STER / 3.3.2：
Example of Usage of STER / 3.3.3：
Spatio-temporal Unified Modeling Language / 3.4：
Using UML Core Constructs for Spatio-temporal Data / 3.4.1：
Overview of Extended Spatio-temporal UML / 3.4.2：
Basic Constructs: Spatial, Temporal, Thematic / 3.4.3：
Additional Constructs: Specification Box, Existence Time, and Groups / 3.4.4：
Example of Usage / 3.4.5：
Related Work / 3.5：
Spatio-temporal Models and Languages: An Approach Based on Data Types / Ralf Hartmut Güting ; Michael H. Böhlen ; Martin Erwig ; Nikos Lorentzos ; Enrico Nardelli ; Markus Schneider ; Jose R.R. Viqueira3.6：
The Data Type Approach / 4.1：
Modeling / 4.2.1：
Some Example Queries / 4.2.3：
Some Basic Issues / 4.2.4：
An Abstract Model: A Foundation for Representing and Querying Moving Objects / 4.3：
Spatio-temporal Data Types / 4.3.1：
Language Embedding of Abstract Data Types / 4.3.2：
Overview of Data Type Operations / 4.3.3：
Operations on Non-temporal Types / 4.3.4：
Operations on Temporal Types / 4.3.5：
Application Example / 4.3.6：
Summary / 4.3.7：
A Discrete Model: Data Structures for Moving Objects Databases / 4.4：
Overview / 4.4.1：
Definition of Discrete Data Types / 4.4.2：
Outlook / 4.5：
Spatio-temporal Predicates and Developments / 4.5.1：
Spatio-temporal Partitions / 4.5.2：
On a Spatio-temporal Relational Model Based on Quanta / 4.5.3：
Spatio-temporal Statement Modifiers / 4.5.4：
Spatio-temporal Models and Languages: An Approach Based on Constraints / Stéphane Grumbach ; Philippe Rigaux ; Michel Scholl ; Spiros Skiadopoulos5：
Representing Spatio-temporal Information Using Constraints / 5.1：
An Algebra for Relations with Constraints / 5.2.1：
Indefinite Information in Spatio-temporal Databases / 5.3：
Querying Indefinite Information / 5.3.1：
Beyond Flat Constraint Relations: The dedale Approach / 5.4：
The dedale Algebra / 5.4.1：
The User Query Language of dedale / 5.5：
The Syntax / 5.5.1：
Example Queries / 5.5.2：
Access Methods and Query Processing Techniques / Adriano Di Pasquale ; Luca Forlizzi ; Yannis Manolopoulos ; Dieter Pfoser ; Guido Proietti ; Simonas èaltenis ; Yannis Theodoridis ; Theodoros Tzouramanis ; Michael Vassilakopoulos5.6：
R-Tree-Based Methods / 6.1：
Preliminary Approaches / 6.2.1：
The Spatio-bitemporal R Tree / 6.2.2：
The Time-Parameterized R Tree / 6.2.3：
Trajectory Bundle / 6.2.4：
Quadtree-Based Methods / 6.3：
The MOF Tree / 6.3.1：
The MOF+-Tree / 6.3.2：
Overlapping Linear Quadtrees / 6.3.3：
Multiversion Linear Quadtree / 6.3.4：
Data Structures and Algorithms for the Discrete Model / 6.4：
Data Structures / 6.4.1：
Two Example Algorithms / 6.4.2：
Benchmarking and Data Generation / 6.5：
Benchmarking / 6.5.1：
Data Generation / 6.5.2：
Distribution and Optimization Issues / 6.6：
Distributed Indexing Techniques / 6.6.1：
Query Optimization / 6.6.2：
Architectures and Implementations of Spatio-temporal Database Management Systems / Martin Breunig ; Can Türker ; Stefan Dieker ; Lukas Relly ; Hans-Jörg Schek ; Michel Scholl|p2636.7：
Architectural Aspects / 7.1：
The Layered Architecture / 7.2.1：
The Monolithic Architecture / 7.2.2：
The Extensible Architecture / 7.2.3：
Commercial Approaches to Spatial-temporal Extensions / 7.2.4：
The Concert Prototype System / 7.3：
Architecture / 7.3.1：
Spatio-temporal Extensions / 7.3.3：
Implementation Details / 7.3.4：
Case Studies / 7.3.5：
The Secondo Prototype System / 7.4：
Second-Order Signature / 7.4.1：
Implementing Spatio-temporal Algebra Modules / 7.4.3：
The Dedale Prototype System / 7.5：
Interpolation in the Constraint Model: Representation of Moving Objects / 7.5.1：
Example of Query Evaluation / 7.5.3：
The Tiger Prototype System / 7.6：
Tiger's Implementation / 7.6.1：
Processing Queries Using External Modules-Case Study / 7.6.5：
The GeoToolKit Prototype System / 7.7：
CaseStudies / 7.7.1：
Advanced Uses: Composing Interactive Spatio-temporal Documents / Isabelle Mirbel ; Barbara Pernici ; Babis Theodoulidis ; Alex Vakaloudis ; Michalis Vazirgiannis7.8：
Interactive Presentations and Spatio-temporal Databases / 8.1：
Modeling the Components of Spatio-temporal Interactive Documents / 8.3：
Particularities of 3D-Spatio-temporal Modeling for ScenarioComponents / 8.3.1：
Meta-modeling / 8.3.2：
Temporal Semantics / 8.3.3：
3D-Spatial Semantics / 8.3.4：
3D-Spatio-temporal Semantics / 8.3.5：
Modeling of Spatio-temporal Behavior / 8.4：
Modeling Interaction with Events / 8.4.1：
Database Support for Scenario Components / 8.5：
Querying and Accessing Stored Components / 8.5.1：
A Global Architecture / 8.5.2：
Examples of Applications / 8.6：
Spatio-temporal Databases in the Years Ahead / 8.7：
Mobile and Wireless Computing / 9.1：
Data Warehousing and Mining / 9.3：
The Semantic Web / 9.4：
List of Contributors / 9.5：
Introduction / Manolis Koubarakis ; Timos Sellis1：
Why Spatio-temporal Databases? / 1.1：
Chorochronos / 1.2：
13.
図書
Daniel Scharstein
目次情報:
続きを見る
Introduction / 1：
The Problem / 1.1：
Applications / 1.1.1：
The Computer Graphics Approach / 1.1.2：
Avoiding the Model / 1.1.3：
A Review of Stereo Vision / 1.2：
Camera Model and Image Formation / 1.2.1：
Stereo Geometry / 1.2.2：
The Correspondence Problem / 1.2.3：
The Epipolar Constraint / 1.2.4：
A Simple Stereo Geometry / 1.2.5：
Rectification / 1.2.6：
Example: SSD / 1.2.7：
Contributions and Outline / 1.3：
A Survey of Image-Based Rendering and Stereo / 2：
Image-Based Rendering / 2.1：
View Synthesis Based on Stereo / 2.1.1：
View Interpolation / 2.1.2：
Mosaics and Layered Representations / 2.1.3：
Stereo / 2.2：
A Framework for Stereo / 2.2.1：
Preprocessing / 2.2.2：
Matching Cost / 2.2.3：
Evidence Aggregation / 2.2.4：
Disparity Selection / 2.2.5：
Sub-Pixel Disparity Computation / 2.2.6：
Diffusion-Based Techniques / 2.2.7：
Other Techniques / 2.2.8：
Promising Recent Approaches / 2.2.9：
Computer Vision Books / 2.3：
View Synthesis / 3：
Geometry / 3.1：
Three-View Rectification / 3.1.1：
The Linear Warping Equation / 3.1.2：
Computing the Rectifying Homographies / 3.1.3：
Synthesizing a New View / 3.2：
Resolving Visibility / 3.2.1：
Holes and Sampling Gaps / 3.2.2：
Combining Information from Both Images / 3.2.3：
Adjusting Intensities / 3.2.4：
Filling Holes / 3.2.5：
The View Synthesis Algorithm / 3.2.6：
Limitations of the Approach / 3.2.7：
Experiments / 3.3：
Image-Based Scene Representations / 3.4：
Summary / 3.5：
Re-evaluating Stereo / 4：
Traditional Applications of Stereo / 4.1：
Automated Cartography / 4.1.1：
Robot Navigation / 4.1.2：
3D Reconstruction / 4.1.3：
3D Recognition / 4.1.4：
Visual Servoing / 4.1.5：
Full vs. Weak Calibration / 4.1.6：
Comparison of Requirements / 4.1.7：
Stereo for View Synthesis / 4.2：
Accuracy / 4.3：
Correct vs. Realistic Views / 4.4：
Areas of Uniform Intensities / 4.5：
Geometric Constraints / 4.5.1：
Interpolated Views / 4.5.2：
Extrapolated Views / 4.5.3：
General Views and the Aperture Problem / 4.5.4：
Assigning Canonical Depth Interpretations / 4.5.5：
Does Adding More Cameras Help? / 4.5.6：
Partial Occlusion / 4.6：
Gradient-Based Stereo / 4.7：
Similarity and Confidence / 5.1：
Displacement-Oriented Stereo / 5.2：
The Evidence Measure / 5.3：
Comparing Two Gradient Vectors / 5.3.1：
Comparing Gradient Fields / 5.3.2：
Computing Gradients of Discrete Images / 5.3.3：
Accumulating the Measure / 5.4：
Stereo: 1D Search Range / 5.5：
General Motion: 2D Search Range / 5.5.3：
Computing Disparity Maps for View Synthesis / 5.6：
Occlusion Boundaries / 5.6.1：
Detecting Partially Occluded Points and Uniform Regions / 5.6.2：
Extrapolating the Disparities / 5.6.3：
Efficiency / 5.7：
Discussion and Possible Extensions / 5.8：
Stereo Using Diffusion / 5.9：
Disparity Space / 6.1：
The SSD Algorithm and Boundary Blurring / 6.2：
Aggregating Support by Diffusion / 6.3：
The Membrane Model / 6.3.1：
Support Function for the Membrane Model / 6.3.2：
Diffusion with Local Stopping / 6.4：
A Bayesian Model of Stereo Matching / 6.5：
The Prior Model / 6.5.1：
The Measurement Model / 6.5.2：
Explicit Local Distribution Model / 6.5.3：
Conclusion / 6.6：
Contributions in View Synthesis / 7.1：
Contributions in Stereo / 7.2：
Extensions and Future Work / 7.3：
Bibliography
Introduction / 1：
The Problem / 1.1：
Applications / 1.1.1：
14.
図書
by Wunibald Kunz and Josef Schintlmeister
出版情報:
Oxford ; New York : Pergamon Press, 1963- v. ; 30 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
pt. 1. Nuclear properties. v. 1. The elements from neutron to tin, 0-50. v. 2. The elements from antimony to nobelium, 51-102
pt. 2. Nuclear reactions. v. 1. The elements from neutron to magnesium, 0-12. 2 v. v. 2. The elements from aluminium to sulphur, 13-16
pt. 2, v. 3. The elements from chlorine to calcium
pt. 1. Nuclear properties. v. 1. The elements from neutron to tin, 0-50. v. 2. The elements from antimony to nobelium, 51-102
pt. 2. Nuclear reactions. v. 1. The elements from neutron to magnesium, 0-12. 2 v. v. 2. The elements from aluminium to sulphur, 13-16
pt. 2, v. 3. The elements from chlorine to calcium
15.
図書
by E.J. Gumbel
出版情報:
New York : Columbia University Press, 1958 xx, 375 p. ; 24 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Aims and Tools / Chapter 1：
Aims / 1.0.：
Conditions / 1.0.1.：
History / 1.0.2.：
The Flood Problem / 1.0.3.：
Methodology / 1.0.4.：
Arrangement of Contents / 1.0.5.：
General Tools / 1.1.：
Linear Transformations / 1.1.1.：
Other Transformations / 1.1.2.：
Symmetry / 1.1.3.：
Measures of Dispersion / 1.1.4.：
Moments / 1.1.5.：
Generating Function / 1.1.6.：
Convolution / 1.1.7.：
The Gamma Function / 1.1.8.：
The Logarithmic Normal Distribution / 1.1.9.：
Specific Tools / 1.2.：
Problems / 1.2.0.：
The Intensity Function / 1.2.1.：
The Distribution of Repeated Occurrences / 1.2.2.：
Analysis of Return Periods / 1.2.3.：
"Observed" Distributions / 1.2.4.：
Construction of Probability Papers / 1.2.5.：
The Plotting Problem / 1.2.6.：
Conditions for Plotting Positions / 1.2.7.：
Fitting Straight Lines on Probability Papers / 1.2.8.：
Application to the Normal Distribution / 1.2.9.：
Order Statistics and Their Exceedances / Chapter 2：
Order Statistics / 2.1.：
Distributions / 2.1.0.：
Averages / 2.1.2.：
Distribution of Frequencies / 2.1.3.：
Asymptotic Distribution of mth Central Values / 2.1.4.：
The Order Statistic with Minimum Variance / 2.1.5.：
Control Band / 2.1.6.：
Joint Distribution of Order Statistics / 2.1.7.：
Distribution of Distances / 2.1.8.：
The Distribution of Exceedances / 2.2.：
Introduction / 2.2.0.：
Distribution of the Number of Exceedances / 2.2.1.：
The Median / 2.2.2.：
The Probability of Exceedances as Tolerance Limit / 2.2.4.：
Extrapolation from Small Samples / 2.2.5.：
Normal and Rare Exceedances / 2.2.6.：
Frequent Exceedances / 2.2.7.：
Summary / 2.2.8.：
Exact Distribution of Extremes / Chapter 3：
Averages of Extremes / 3.1.：
Exact Distributions / 3.1.0.：
Return Periods of Largest and Large Values / 3.1.2.：
Quantiles of Extremes / 3.1.3.：
Characteristic Extremes / 3.1.4.：
The Extremal Intensity Function / 3.1.5.：
The Mode / 3.1.6.：
The Maximum of the Mean Largest Value / 3.1.7.：
Extremal Statistics / 3.2.：
Absolute Extreme Values / 3.2.0.：
Exact Distribution of Range / 3.2.2.：
The Mean Range / 3.2.3.：
The Range as Tolerance Limit / 3.2.4.：
The Maximum of the Mean Range / 3.2.5.：
Exact Distribution of the Midrange / 3.2.6.：
Asymptotic Independence of Extremes / 3.2.7.：
The Extremal Quotient / 3.2.8.：
Analytical Study of Extremes / Chapter 4：
The Exponential Type / 4.1.：
Largest Value for the Exponential Distribution / 4.1.0.：
Order Statistics for the Exponential Distribution / 4.1.2.：
L'Hopital's Rule / 4.1.3.：
Definition of the Exponential Type / 4.1.4.：
The Three Classes / 4.1.5.：
The Logarithmic Trend / 4.1.6.：
The Characteristic Product / 4.1.7.：
Extremes of the Exponential Type / 4.2.：
The Logistic Distribution / 4.2.0.：
Normal Extremes, Numerical Values / 4.2.2.：
Analysis of Normal Extremes / 4.2.3.：
Normal Extreme Deviates / 4.2.4.：
Gamma Distribution / 4.2.5.：
Logarithmic Normal Distribution / 4.2.6.：
The Normal Distribution as a Distribution of Extremes / 4.2.7.：
The Cauchy Type / 4.3.：
The Exponential Type and the Existence of Moments / 4.3.0.：
Pareto's Distribution / 4.3.2.：
Definition of the Pareto and the Cauchy Types / 4.3.3.：
Extremal Properties / 4.3.4.：
Other Distributions without Moments / 4.3.5.：
The First Asymptotic Distribution / 4.3.6.：
The Three Asymptotes / 5.1.：
Preliminary Derivation / 5.1.0.：
The Stability Postulate / 5.1.2.：
Outline of Other Derivations / 5.1.3.：
Interdependence / 5.1.4.：
The Double Exponential Distribution / 5.2.：
Derivations / 5.2.0.：
The Methods of Cramer and Von Mises / 5.2.2.：
Mode and Median / 5.2.3.：
Generating Functions / 5.2.4.：
Standard and Mean Deviations / 5.2.5.：
Probability Paper and Return Period / 5.2.6.：
Comparison with Other Distributions / 5.2.7.：
Barricelli's Generalization / 5.2.8.：
Extreme Order Statistics / 5.3.：
Distribution of the MTH Extreme / 5.3.0.：
Probabilities of the mth Extreme / 5.3.2.：
Cramer's Distribution of MTH Extremes / 5.3.3.：
Extreme Distances / 5.3.5.：
The Largest Absolute Value and the Two Sample Problem / 5.3.6.：
Uses of the First Asymptote / Chapter 6：
Order Statistics from the Double Exponential Distribution / 6.1.：
Maxima of Largest Values / 6.1.0.：
Minima of Largest Values / 6.1.2.：
Consecutive Modes / 6.1.3.：
Consecutive Means and Variances / 6.1.4.：
Standard Errors / 6.1.5.：
Extension of the Control Band / 6.1.6.：
The Control Curve of Dick and Darwin / 6.1.7.：
Estimation of Parameters / 6.2.：
Exponential and Normal Extremes / 6.2.0.：
Use of Order Statistics / 6.2.2.：
Estimates for Probability Paper / 6.2.3.：
Sufficient Estimation Functions / B. F. Kimball6.2.4.：
Maximum Likelihood Estimations / 6.2.5.：
Approximate Solutions / 6.2.6.：
Asymptotic Variance of a Forecast / 6.2.7.：
Numerical Examples / 6.3.：
Floods / 6.3.0.：
The Design Flood / 6.3.2.：
Meteorological Examples / 6.3.3.：
Application to Aeronautics / 6.3.4.：
Oldest Ages / 6.3.5.：
Breaking Strength / 6.3.6.：
Breakdown Voltage / 6.3.7.：
Applications to Naval Engineering / 6.3.8.：
An Application to Geology / 6.3.9.：
The Second and Third Asymptotes / Chapter 7：
The Second Asymptote / 7.1.：
Frechet's Derivation / 7.1.0.：
Averages and Moments / 7.1.2.：
Estimation of the Parameters / 7.1.4.：
The Increase of the Extremes / 7.1.5.：
Generalization / 7.1.6.：
Applications / 7.1.7.：
The Third Asymptote / 7.1.8.：
The Von Mises Derivation / 7.2.0.：
Other Derivations / 7.2.2.：
Averages and Moments of Smallest Values / 7.2.3.：
Special Cases / 7.2.4.：
The 15 Relations Among the 3 Asymptotes / 7.2.5.：
Applications of the Third Asymptote / 7.3.：
Estimation of the Three Parameters / 7.3.0.：
Estimation of Two Parameters / 7.3.2.：
Analytical Examples / 7.3.3.：
Droughts / 7.3.4.：
Fatigue Failures / 7.3.5.：
The Range / Chapter 8：
Asymptotic Distributions of Range and Midrange / 8.1.：
The Range of Minima / 8.1.0.：
Generating Function of the Range / 8.1.2.：
The Reduced Range / 8.1.3.：
Asymptotic Distribution of the Midrange / 8.1.4.：
A Bivariate Transformation / 8.1.5.：
Asymptotic Distribution of the Range / 8.1.6.：
Boundary Conditions / 8.1.7.：
Extreme Ranges / 8.1.8.：
Extremal Quotient and Geometric Range / 8.1.9.：
Definitions / 8.2.0.：
The Geometric Range / 8.2.2.：
The Midrange / 8.3.：
The Parameters in the Distribution of Range / 8.3.2.：
Normal Ranges / 8.3.3.：
Estimation of Initial Standard Deviation / 8.3.4.：
Climatological Examples / 8.3.5.：
Bibliography
Index
Aims and Tools / Chapter 1：
Aims / 1.0.：
Conditions / 1.0.1.：
16.
図書
edited by Jacques Carmona and Michèle Vergne
目次情報:
続きを見る
Introduction to Acoustics / 1：
Fundamental Physical Principles / 1.1：
Sound Pressure / 1.1.1：
Particle Velocity / 1.1.2：
Sound Power / 1.1.3：
Frequency / 1.1.4：
The Speed of Sound / 1.1.5：
Wavelength / 1.1.6：
Characteristics of the Auditory System / 1.2：
The Sensation of Loudness / 1.2.1：
Masking / 1.2.2：
Directional Characteristics / 1.2.3：
Directional Hearing / 1.2.4：
The Cocktail Party Effect / 1.2.5：
Masking for the Musician / 1.2.6：
Sensitivity to Changes in Frequency and Sound Pressure Level / 1.2.7：
Structure of Musical Sound / 2：
Introducing the Model / 2.1：
Frequency-and Level: Structures / 2.2：
The Harmonic Tone Structure of Sound Spectra / 2.2.1：
The Frequency Range of Sound Spectra / 2.2.2：
Formants / 2.2.3：
The Effect of Individual Partials / 2.2.4：
Frequency Width of Partials / 2.2.5：
Noise Contributions / 2.2.6：
Dynamics and the Sound Spectrum / 2.2.7：
Dynamic Range and Sound Power / 2.2.8：
Time Structures / 2.3：
Deviations from a Steady Vibration Process / 2.3.1：
The Starting Transient / 2.3.2：
Inharmonic Components / 2.3.3：
Decay of Resonating Systems / 2.3.4：
Decay Time and Reverberation Time / 2.3.5：
Fluctuations in the Quasistationary Part / 2.3.6：
Tonal Characteristics of Musical Instruments / 3：
Brass Instruments / 3.1：
The French Horn / 3.1.1：
The Trumpet / 3.1.2：
The Trombone / 3.1.3：
The Tuba / 3.1.4：
Woodwind Instruments / 3.2：
The Flute / 3.2.1：
The Oboe / 3.2.2：
The Clarinet / 3.2.3：
The Bassoon / 3.2.4：
String Instruments / 3.3：
The Violin / 3.3.1：
The Viola / 3.3.2：
The Cello / 3.3.3：
Double Bass / 3.3.4：
The Piano / 3.4：
Sound Spectra / 3.4.1：
Dynamics / 3.4.2：
Time Structure / 3.4.3：
The Harpsichord / 3.5：
The Harp / 3.5.1：
Percussion Instruments / 3.6.1：
Timpani / 3.7.1：
The Bass Drum / 3.7.2：
Snare Drum / 3.7.3：
Gong / 3.7.4：
Cymbals / 3.7.5：
The Triangle / 3.7.6：
The Singing Voice / 3.8：
Choral Singing / 3.8.1：
Foundations of Directional Sound Radiation / 4：
Directional Effects and Polar Diagrams / 4.1.1：
Evaluation and Representation / 4.1.2：
General Considerations / 4.2：
The Double Bass / 4.4.2：
The Grand Piano / 4.5：
Lid Open / 4.5.1：
Lid Closed / 4.5.2：
Lid Half Open / 4.5.3：
Lid Removed / 4.5.4：
The Timpani / 4.5.5：
The Drum / 4.7.2：
Gongs / 4.7.3：
Color Plates Following Page / 4.8：
Foundations of Room Acoustics / 5：
Reflection and Refraction / 5.1：
Reflection from a Flat Surface / 5.1.1：
Reflection from Curved Surfaces / 5.1.2：
Influence of the Wavelength / 5.1.3：
Absorption / 5.2：
Reverberation / 5.3：
Direct Sound and Diffuse Field / 5.4：
The Energy Density / 5.4.1：
The Direct Sound / 5.4.2：
Diffuse-Field Distance / 5.4.3：
Temporal Structure of the Sound Field / 5.5：
Acoustical Properties of Old and New Performance Spaces / 6：
Concert Halls / 6.1：
Tonal Requirements / 6.1.1：
Reverberation Time and Hall Size / 6.1.2：
Sound Field and Hall Shape / 6.1.3：
Acoustic Conditions on the Stage / 6.1.4：
The Location of the Conductor / 6.1.5：
Opera Houses / 6.2：
Reverberation Time and Room Size / 6.2.1：
Direct Sound and Early Reflections / 6.2.2：
Churches / 6.3：
Chamber Music Halls / 6.4：
Studios / 6.5：
Special Purpose Rooms / 6.6：
Open Air Stages / 6.7：
Seating Arrangement in the Concert Hall / 7：
Customary Positioning of Instrument Groups / 7.1：
The Tonal Effect in the Hall / 7.2：
Grand Pianos / 7.2.1：
Harps / 7.2.6：
Combined Sound of the Orchestra / 7.2.7：
Singing Voices / 7.2.8：
Acoustic Considerations for Instrumentation and Playing Technique / 8：
Strength of Ensembles / 8.1：
Historical Development / 8.1.1：
Adapting to the Hall / 8.1.2：
Performance Technique / 8.2：
Articulation and Tone Presentation / 8.3.1：
Vibrato / 8.3.2：
Playing Positions of Wind Instruments / 8.3.3：
Tempo and Room Acoustics / 8.4：
Acoustical Problems in the Opera House / 9：
Strength of the Orchestra / 9.1：
Sound Level in the Hall / 9.1.1：
Sound Level in the Orchestra Pit / 9.1.3：
Seating Arrangement in the Orchestra Pit / 9.2：
Customary Arrangements of Instrument Groups / 9.2.1：
Balance between Singers and Orchestra / 9.2.2：
Arrangement of Choirs and Music on Stage / 9.4：
Musicians in the Scene / 9.4.1：
Musicians behind the Scene / 9.4.2：
Appendix Table for Angular Dependence of the Statistical Directivity Factor
References
Subject Index
Author, Composer, and Composition Index
Introduction to Acoustics / 1：
Fundamental Physical Principles / 1.1：
Sound Pressure / 1.1.1：
17.
図書
Peter Müller
目次情報:
続きを見る
Introduction / 1：
Motivation / 1.1：
Specification and Verification Technique / 1.2：
The Problem / 1.3：
Modular Correctness / 1.3.1：
The Frame Problem / 1.3.2：
Modular Verification of Type Invariants / 1.3.3：
The Extended State Problem / 1.3.4：
Alias Control / 1.3.5：
Modularity Aspects of Programs, Specifications, and Proofs / 1.4：
Modularity of Programs / 1.4.1：
Modularity of Universal Specifications / 1.4.2：
Modularity of Interface Specifications / 1.4.3：
Modularity of Correctness Proofs / 1.4.4：
Approach, Outline, and Contributions / 1.5：
Approach / 1.5.1：
Outline / 1.5.2：
Contributions / 1.5.3：
Related Work / 1.6：
Specification Techniques / 1.6.1：
Verification and Analysis Techniques / 1.6.2：
Mojave and the Universe Type System / 2：
Mojave: The Language / 2.1：
The Language Core / 2.1.1：
Modularity / 2.1.2：
Universes: A Type System for Flexible Alias Control / 2.2：
The Ownership Model / 2.2.1：
The Universe Programming Model / 2.2.2：
Programming with Universes / 2.2.3：
Examples / 2.2.4：
Formalization of the Universe Type System / 2.2.5：
Discussion / 2.2.6：
The Semantics of Mojave / 2.3：
Programming Logic / 3.1：
Formal Data and State Model / 3.1.1：
Axiomatic Semantics / 3.1.2：
Language Properties / 3.1.3：
Type Safety / 3.2.1：
Liveness Properties / 3.2.2：
Properties of Readonly Methods / 3.2.3：
Correctness / 3.3：
Correctness of Closed Programs / 3.3.1：
Correctness of Open Programs: Modular Correctness / 3.3.2：
Modular Soundness / 3.3.3：
Composition of Modular Correct Open Programs / 3.3.4：
Modular Specification and Verification of Functional Behavior / 3.4：
Foundations of Interface Specifications / 4.1：
Specification of Functional Behavior / 4.2：
Abstract Fields / 4.2.1：
Pre-post-specifications / 4.2.2：
Verification of Functional Behavior / 4.3：
Verification of Method Bodies / 4.3.1：
Proofs for Virtual Methods / 4.3.2：
Example / 4.3.3：
Modular Specification and Verification of Frame Properties / 4.4：
Meaning of Modifies-Clauses / 5.1：
Explicit Dependencies / 5.1.2：
Modularity Rules / 5.1.3：
Formalization of Explicit Dependencies / 5.2：
Declaration of Dependencies / 5.2.1：
Axiomatization of the Depends-Relation / 5.2.2：
Consistency with Representation / 5.2.3：
Formalization of the Modularity Rules / 5.2.4：
Axiomatization of the Notdepends-Relation / 5.2.5：
Formalization of Modifies-Clauses / 5.2.6：
Verification of Frame Properties / 5.4：
Local Update Property / 5.4.1：
Accessibility Properties / 5.4.3：
Modularity Theorem for Frame Properties / 5.4.4：
Leino's and Nelson's Work on Dependencies / 5.4.5：
Other Work on the Frame Problem / 5.5.2：
Modular Specification and Verification of Type Invariants / 6：
Motivation and Approach / 6.1：
Invariant Semantics for Nonmodular Programs / 6.1.1：
Problems for Modular Verification of Invariants / 6.1.2：
Specification of Type Invariants / 6.1.3：
Declaration of Type Invariants / 6.2.1：
Formal Meaning of Invariants / 6.2.2：
Verification of Type Invariants / 6.3：
Verification Methodology / 6.3.1：
Module Invariants / 6.3.2：
History Constraints / 6.4.2：
Conclusion / 6.5：
Summary and Contributions / 7.1：
The Lopex Project / 7.2：
Tool Support / 7.3：
Directions for Future Work / 7.4：
Formal Background and Notations / A：
Formal Background / A.1：
Notations / A.2：
Predefined Type Declarations / B：
Doubly Linked List / C：
Property Editor / C.2：
Auxiliary Lemmas, Proofs, and Models / D：
Auxiliary Lemmas and Proofs from Chapter 3 / D.1：
Auxiliary Lemmas and Proofs from Chapter 5 / D.2：
Auxiliary Lemmas and Proofs from Chapter 6 / D.3：
A Model for the Axiomatization of the Depends-Relation / D.4：
Bibliography
List of Figures
Index
Introduction / 1：
Motivation / 1.1：
Specification and Verification Technique / 1.2：
18.
図書
edited with translation and explanatory notes by S.D. Joshi in collaboration with J.A.F. Roodbergen
19.
図書
by V.N. Faddeyeva and N.M. Terent'ev ; edited by Academician V.A. Fok ; translated from the Russian by D.G. Fry, B.A. Hons.
20.
図書
Steffen Staab
目次情報:
続きを見る
Introduction / 1：
Problems in Understanding Degree Expressions / 1.1：
General Approach / 1.2：
Overview / 1.3：
ParseTalk - The System Context / 2：
An Architecture for Text Knowledge Extraction / 2.1：
Syntactic Analysis / 2.2：
Dependency Grammar / 2.2.1：
The ParseTalk Parser / 2.2.2：
Conceptual System / 2.3：
Description Logics / 2.3.1：
Knowledge Base / 2.3.2：
Semantic System / 2.3.3：
Referring and Relating / 2.4：
Centering / 2.4.1：
Relation Path Patterns and Metonymy / 2.4.2：
An Example Text / 2.4.3：
Lexical Semantics of Degree Expressions / 3：
Scales / 3.1：
Critique on Ontological Models for Degree Expressions / 3.1.1：
New Ontological Entities / 3.1.2：
Gradable Adjectives / 3.2：
Classification of Adjectives / 3.2.1：
Figurative Language / 3.2.2：
Multiple Word Senses / 3.2.3：
Nominative vs. Normative Use / 3.2.4：
Two Types of Comparison / 3.2.5：
Non-adjectival Degree Expressions / 3.3：
Summary / 3.4：
Representation and Inferences / 4：
Requirements on Modeling Degree Relations / 4.1：
Linguistic Stipulations / 4.1.1：
Stipulations from Vagueness / 4.1.2：
Stipulations on Inferences / 4.1.3：
The Challenge: Functions / 4.1.4：
Binary Relations / 4.2：
Representation / 4.2.1：
Inferencing / 4.2.2：
Soundness and Incompleteness / 4.2.3：
Computational Complexity / 4.2.4：
Non-binary Relations / 4.3：
TCSPs and Allen's Calculus / 4.3.1：
From Binary to Non-binary Relations / 4.3.2：
A Formal Model of Generalized Temporal Networks (GTNs) / 4.3.3：
Determining Consistency / 4.3.4：
Computing the Minimal Network / 4.3.5：
Scaling by Abstractions / 4.3.6：
Scaling by Generalizations / 4.3.7：
Related Work / 4.4：
Related Work on Representing and Inferencing with Degree Expressions / 4.4.1：
Related Work on Temporal and Spatial Reasoning / 4.4.2：
Conclusion on Representation and Inferences / 4.5：
Relative Comparisons / 5：
Basic Model for Interpreting Relative Comparatives / 5.1：
Comparative Interpretation as Semantic Copying / 5.1.1：
Core Algorithm / 5.1.2：
An Example of Semantic Interpretation / 5.1.3：
Extension to Textual Phenomena / 5.2：
Comparatives with Omitted Complements / 5.2.1：
An Example for Omitted Complements / 5.2.2：
Metonymies in the Complement / 5.2.3：
Metonymic Entities in the Omitted Complement / 5.2.4：
An Example for Metonymic Entities in the Omitted Complement / 5.2.5：
Theoretical and Empirical Coverage / 5.3：
Generative Linguistics / 5.4：
Cognitive Foundations / 5.4.2：
Computational Approaches / 5.4.3：
Conclusion on Relative Comparisons / 5.5：
Absolute Comparisons / 6：
A Cognitive Framework for Absolute Comparisons / 6.1：
Representing Comparison Classes / 6.2：
Knowledge about Intercorrelations / 6.3：
Computing Comparison Classes / 6.4：
The Algorithm / 6.4.1：
A Sample Computation / 6.4.2：
Empirical Evaluation / 6.5：
Conclusion on Absolute Comparisons / 6.6：
Integration and Conclusion / 7：
Integration / 7.1：
(Comparison) Relations and Intercorrelations Revisited 150 / 7.1.1：
Drawing the Lines between the Two Comparison Paradigms / 7.1.2：
Relative Comparisons Meet Absolute Comparisons / 7.1.3：
Comparison Classes Meet Inferences / 7.1.4：
Further Research Issues / 7.2：
Pragmatics / 7.2.1：
Relative Comparisons and Analogy / 7.2.2：
Further Norms of Expectation / 7.2.3：
Conclusion / 7.3：
List of Conventions / A：
The Entity-Relationship Model / B：
Auxiliary Proofs / C：
Proof of Optimization Lemma / C.1：
Proof of Clipping Lemma / C.2：
Efficiency of Constraint Propagation / C.3：
Bibliography
Introduction / 1：
Problems in Understanding Degree Expressions / 1.1：
General Approach / 1.2：
21.
図書
Peter Y. Yu, Manuel Cardona
出版情報:
New York ; Tokyo : Springer Verlag, 1999 xvi, 620 p. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
A Survey of Semiconductors / 1.1：
Elemental Semiconductors / 1.1.1：
Binary Compounds / 1.1.2：
Oxides / 1.1.3：
Layered Semiconductors / 1.1.4：
Organic Semiconductors / 1.1.5：
Magnetic Semiconductors / 1.1.6：
Other Miscellaneous Semiconductors / 1.1.7：
Growth Techniques / 1.2：
Czochralski Method / 1.2.1：
Bridgman Method / 1.2.2：
Chemical Vapor Deposition / 1.2.3：
Molecular Beam Epitaxy / 1.2.4：
Liquid Phase Epitaxy / 1.2.5：
Summary
Electronic Band Structures / 2：
Quantum Mechanics / 2.1：
Translational Symmetry and Brillouin Zones / 2.2：
A Pedestrian's Guide to Group Theory / 2.3：
Definitions and Notations / 2.3.1：
Symmetry Operations of the Diamond and Zinc-Blende Structures / 2.3.2：
Representations and Character Tables / 2.3.3：
Some Applications of Character Tables / 2.3.4：
Empty Lattice or Nearly Free Electron Energy Bands / 2.4：
Nearly Free Electron Band Structure in a Zinc-Blende Crystal / 2.4.1：
Nearly Free Electron Energy Bands in Diamond Crystals / 2.4.2：
Band Structure Calculation by Pseudopotential Methods / 2.5：
Pseudopotential Form Factors in Zinc-Blende- and Diamond-Type Semiconductors / 2.5.1：
Empirical and Self-Consistent Pseudopotential Methods / 2.5.2：
The kċp Method of Band-Structure Calculations / 2.6：
Effective Mass of a Nondegenerate Band Using the kċp Method / 2.6.1：
Band Dispersion near a Degenerate Extremum: Top Valence Bands in Diamondand Zinc-Blende-Type Semiconductors / 2.6.2：
Tight-Binding or LCAO Approach to the Band Structure of Semiconductors / 2.7：
Molecular Orbitals and Overlap Parameters / 2.7.1：
Band Structure of Group-IV Elements by the Tight-Binding Method / 2.7.2：
Overlap Parameters and Nearest-Neighbor Distances / 2.7.3：
Problems
Vibrational Properties of Semiconductors, and Electron-Phonon Interactions / 3：
Phonon Dispersion Curves of Semiconductors / 3.1：
Models for Calculating Phonon Dispersion Curves of Semiconductors / 3.2：
Force Constant Models / 3.2.1：
Shell Model / 3.2.2：
Bond Models / 3.2.3：
Bond Charge Models / 3.2.4：
Electron-Phonon Interactions / 3.3：
Strain Tensor and Deformation Potentials / 3.3.1：
Electron-Acoustic-Phonon Interaction at Degenerate Bands / 3.3.2：
Piezoelectric Electron-Acoustic-Phonon Interaction / 3.3.3：
Electron-Optical-Phonon Deformation Potential Interactions / 3.3.4：
Frohlich Interaction / 3.3.5：
Interaction Between Electrons and Large-Wavevector Phonons: Intervalley Electron-Phonon Interaction / 3.3.6：
Electronic Properties of Defects / 4：
Classification of Defects / 4.1：
Shallow or Hydrogenic Impurities / 4.2：
Effective Mass Approximation / 4.2.1：
Hydrogenic or Shallow Donors / 4.2.2：
Donors Associated with Anisotropic Conduction Bands / 4.2.3：
Acceptor Levels in Diamond-and Zinc-Blende-Type Semiconductors / 4.2.4：
Deep Centers / 4.3：
Green's Function Method for Calculating Defect Energy Levels / 4.3.1：
An Application of the Green's Function Method: Linear Combination of Atomic Orbitals / 4.3.2：
Another Application of the Green's Function Method: Nitrogen in GaP and Ga AsP Alloys / 4.3.3：
Final Note on Deep Centers / 4.3.4：
Electrical Transport / 5：
Quasi-Classical Approach / 5.1：
Carrier Mobility for a Nondegenerate Electron Gas / 5.2：
Relaxation Time Approximation / 5.2.1：
Nondegenerate Electron Gas in a Parabolic Band / 5.2.2：
Dependence of Scattering and Relaxation Times on Electron Energy / 5.2.3：
Momentum Relaxation Times / 5.2.4：
Temperature Dependence of Mobilities / 5.2.5：
Modulation Doping / 5.3：
High-Field Transport and Hot Carrier Effects / 5.4：
Velocity Saturation / 5.4.1：
Negative Differential Resistance / 5.4.2：
Gunn Effect / 5.4.3：
Magneto-Transport and the Hall Effect / 5.5：
Magneto-Conductivity Tensor / 5.5.1：
Hall Effect / 5.5.2：
Hall Coefficient for Thin Film Samples (van der Pauw Method) / 5.5.3：
Hall Effect for a Distribution of Electron Energies / 5.5.4：
Optical Properties I / 6：
Macroscopic Electrodynamics / 6.1：
Digression: Units for the Frequency of Electromagnetic Waves / 6.1.1：
Experimental Determination of Optical Constants / 6.1.2：
Kramers-Kronig Relations / 6.1.3：
The Dielectric Function / 6.2：
Experimental Results / 6.2.1：
Microscopic Theory of the Dielectric Function / 6.2.2：
Joint Density of States and Van Hove Singularities / 6.2.3：
Van Hove Singularities in ϵi / 6.2.4：
Direct Absorption Edges / 6.2.5：
Indirect Absorption Edges / 6.2.6：
""""Forbidden"""" Direct Absorption Edges / 6.2.7：
Excitons / 6.3：
Exciton Effect at M0 Critical Points / 6.3.1：
Absorption Spectra of Excitons / 6.3.2：
Exciton Effect at M1 Critical Points or Hyperbolic Excitons / 6.3.3：
Exciton Effect at M3 Critical Points / 6.3.4：
Phonon-Polaritons and Lattice Absorption / 6.4：
Phonon-Polaritons / 6.4.1：
Lattice Absorption and Reflection / 6.4.2：
Multiphonon Lattice Absorption / 6.4.3：
Dynamic Effective Ionic Charges in Heteropolar Semiconductors / 6.4.4：
Absorption Associated with Extrinsic Electrons / 6.5：
Free-Carrier Absorption in Doped Semiconductors / 6.5.1：
Absorption by Carriers Bound to Shallow Donors and Acceptors / 6.5.2：
Modulation Spectroscopy / 6.6：
Frequency Modulated Reflectance and Thermoreflectance / 6.6.3：
Piezoreflectance / 6.6.4：
Electroreflectance (Franz-Keldysh Effect) / 6.6.5：
Photoreflectance / 6.6.6：
Reflectance Difference Spectroscopy / 6.6.7：
Optical Properties II / 7：
Emission Spectroscopies / 7.1：
Band-to-Band Transitions / 7.1.1：
Free-to-Bound Transitions / 7.1.2：
Donor-Acceptor Pair Transitions / 7.1.3：
Excitons and Bound Excitons / 7.1.4：
Luminescence Excitation Spectroscopy / 7.1.5：
Light Scattering Spectroscopies / 7.2：
Macroscopic Theory of Inelastic Light Scattering by Phonons / 7.2.1：
Raman Tensor and Selection Rules / 7.2.2：
Experimental Determination of Raman Spectra / 7.2.3：
Microscopic Theory of Raman Scattering / 7.2.4：
A Detour into the World of Feynman Diagrams / 7.2.5：
Brillouin Scattering / 7.2.6：
Experimental Determination of Brillouin Spectra / 7.2.7：
Resonant Raman and Brillouin Scattering / 7.2.8：
Photoelectron Spectroscopy / 8：
Photoemission / 8.1：
Angle-Integrated Photoelectron Spectra of the Valence Bands / 8.1.1：
Angle-Resolved Photoelectron Spectra of the Valence Bands / 8.1.2：
Core Levels / 8.1.3：
Inverse Photoemission
Surface Effects / 8.2：
Surface States and Surface Reconstruction / 8.3.1：
Surface Energy Bands / 8.3.2：
Fermi Level Pinning and Space Charge Layers / 8.3.3：
Effect of Quantum Confinement on Electrons and Phonons in Semiconductors / 9：
Quantum Confinement and Density of States / 9.1：
Quantum Confinement of Electrons and Holes / 9.2：
Semiconductor Materials for Quantum Wells and Superlattices / 9.2.1：
Classification of Multiple Quantum Wells and Superlattices / 9.2.2：
Confinement of Energy Levels of Electrons and Holes / 9.2.3：
Some Experimental Results / 9.2.4：
Phonons in Superlattices / 9.3：
Phonons in Superlattices: Folded Acoustic and Confined Optic Modes / 9.3.1：
Folded Acoustic Modes: Macroscopic Treatment / 9.3.2：
Confined Optical Modes: Macroscopic Treatment / 9.3.3：
Electrostatic Effects in Polar Crystals: Interface Modes / 9.3.4：
Raman Spectra of Phonons in Semiconductor Superlattices / 9.4：
Raman Scattering by Folded Acoustic Phonons / 9.4.1：
Raman Scattering by Confined Optical Phonons / 9.4.2：
Raman Scattering by Interface Modes / 9.4.3：
Macroscopic Models of Electron-LO Phonon (Fröhlich) Interaction in Multiple Quantum Wells / 9.4.4：
Electrical Transport: Resonant Tunneling / 9.5：
Resonant Tunneling Through a Double-Barrier Quantum Well / 9.5.1：
I-V Characteristics of Resonant Tunneling Devices / 9.5.2：
Quantum Hall Effects in Two-Dimensional Electron Gases / 9.6：
Landau Theory of Diamagnetism in a Three-Dimensional Free Electron Gas / 9.6.1：
Magneto-Conductivity of a Two-Dimensional Electron Gas: Filling Factor / 9.6.2：
The Experiment of von Klitzing, Pepper and Dorda / 9.6.3：
Explanation of the Hall Plateaus in the Integral Quantum Hall Effect / 9.6.4：
Concluding Remarks / 9.7：
Appendix: Pioneers of Semiconductor Physics Remember
Ultra-Pure Germanium: From Applied to Basic Research or an Old Semiconductor Offering New Opportunities / Eugene E. Haller
Two Pseudopotential Methods: Empirical and Ab Initio / Marvin L. Cohen
The Early Stages of Band-Structures Physics and Its Struggles for a Place in the Sun / Conyers Herring
Cyclotron Resonance and Structure of Conduction and Valence Band Edges in Silicon and Germanium / Charles Kittel
Optical Properties of Amorphous Semiconductors and Solar Cells / Jan Tauc
Optical Spectroscopy of Shallow Impurity Centers / Elias Burstein
On the Prehistory of Angular Resolved Photoemission / Neville V. Smith
The Discovery and Very Basics of the Quantum Hall Effect / Klaus von Klitzing
The Birth of the Semiconductor Superlattice / Leo Esaki
References
Subject Index
Table of Fundamental Physical Constants (Inside Front Cover)
Table of Units (Inside Back Cover)
Introduction / 1：
A Survey of Semiconductors / 1.1：
Elemental Semiconductors / 1.1.1：
22.
図書
Francis A. Carey and Richard J. Sundberg
目次情報:
続きを見る
Alkylation of Nucleophilic Carbon Intermediates / Chapter 1.：
Generation of Carbanions by Deprotonation / 1.1.：
Regioselectivity and Stereoselectivity in Enolate Formation / 1.2.：
Other Means of Generating Enolates / 1.3.：
Alkylation of Enolates / 1.4.：
Generation and Alkylation of Dianions / 1.5.：
Medium Effects in the Alkylation of Enolates / 1.6.：
Oxygen versus Carbon as the Site of Alkylation / 1.7.：
Alkylation of Aldehydes, Esters, Amides, and Nitriles / 1.8.：
The Nitrogen Analogs of Enols and Enolates--Enamines and Imine Anions / 1.9.：
Alkylation of Carbon Nucleophiles by Conjugate Addition / 1.10.：
General References
Problems
Reaction of Carbon Nucleophiles with Carbonyl Groups / Chapter 2.：
Aldol Addition and Condensation Reactions / 2.1.：
The General Mechanism / 2.1.1.：
Mixed Aldol Condensations with Aromatic Aldehydes / 2.1.2.：
Control of Regiochemistry and Stereochemistry of Mixed Aldol Reactions of Aliphatic Aldehydes and Ketones / 2.1.3.：
Intramolecular Aldol Reactions and the Robinson Annulation / 2.1.4.：
Addition Reactions of Imines and Iminium Ions / 2.2.：
The Mannich Reaction / 2.2.1.：
Amine-Catalyzed Condensation Reactions / 2.2.2.：
Acylation of Carbanions / 2.3.：
The Wittig and Related Reactions of Phosphorus-Stabilized Carbon Nucleophiles / 2.4.：
Reactions of Carbonyl Compounds with [alpha]-Trimethylsilylcarbanions / 2.5.：
Sulfur Ylides and Related Nucleophiles / 2.6.：
Nucleophilic Addition--Cyclization / 2.7.：
Functional Group Interconversion by Nucleophilic Substitution / Chapter 3.：
Conversion of Alcohols to Alkylating Agents / 3.1.：
Sulfonate Esters / 3.1.1.：
Halides / 3.1.2.：
Introduction of Functional Groups by Nucleophilic Substitution at Saturated Carbon / 3.2.：
General Solvent Effects / 3.2.1.：
Nitriles / 3.2.2.：
Azides / 3.2.3.：
Oxygen Nucleophiles / 3.2.4.：
Nitrogen Nucleophiles / 3.2.5.：
Sulfur Nucleophiles / 3.2.6.：
Phosphorus Nucleophiles / 3.2.7.：
Summary of Nucleophilic Substitution at Saturated Carbon / 3.2.8.：
Nucleophilic Cleavage of Carbon-Oxygen Bonds in Ethers and Esters / 3.3.：
Interconversion of Carboxylic Acid Derivatives / 3.4.：
Preparation of Reactive Reagents for Acylation / 3.4.1.：
Preparation of Esters / 3.4.2.：
Preparation of Amides / 3.4.3.：
Electrophilic Additions to Carbon--Carbon Multiple Bonds / Chapter 4.：
Addition of Hydrogen Halides / 4.1.：
Hydration and Other Acid-Catalyzed Additions of Oxygen Nucleophiles / 4.2.：
Oxymercuration / 4.3.：
Addition of Halogens to Alkenes / 4.4.：
Electrophilic Sulfur and Selenium Reagents / 4.5.：
Addition of Other Electrophilic Reagents / 4.6.：
Electrophilic Substitution Alpha to Carbonyl Groups / 4.7.：
Additions to Allenes and Alkynes / 4.8.：
Addition at Double Bonds via Organoborane Intermediates / 4.9.：
Hydroboration / 4.9.1.：
Reactions of Organoboranes / 4.9.2.：
Enantioselective Hydroboration / 4.9.3.：
Hydroboration of Alkynes / 4.9.4.：
Reduction of Carbonyl and Other Functional Groups / Chapter 5.：
Addition of Hydrogen / 5.1.：
Catalytic Hydrogenation / 5.1.1.：
Other Hydrogen-Transfer Reagents / 5.1.2.：
Group III Hydride-Donor Reagents / 5.2.：
Reduction of Carbonyl Compounds / 5.2.1.：
Stereoselectivity of Hydride Reduction / 5.2.2.：
Reduction of Other Functional Groups by Hydride Donors / 5.2.3.：
Group IV Hydride Donors / 5.3.：
Hydrogen-Atom Donors / 5.4.：
Dissolving-Metal Reductions / 5.5.：
Reductive Removal of Functional Groups / 5.5.1.：
Reductive Carbon--Carbon Bond Formation / 5.5.3.：
Reductive Deoxygenation of Carbonyl Groups / 5.6.：
Reductive Elimination and Fragmentation / 5.7.：
Cycloadditions, Unimolecular Rearrangements, and Thermal Eliminations / Chapter 6.：
Cycloaddition Reactions / 6.1.：
The Diels--Alder Reaction: General Features / 6.1.1.：
The Diels--Alder Reaction: Dienophiles / 6.1.2.：
The Diels--Alder Reaction: Dienes / 6.1.3.：
Asymmetric Diels--Alder Reactions / 6.1.4.：
Intramolecular Diels--Alder Reactions / 6.1.5.：
Dipolar Cycloaddition Reactions / 6.2.：
[2 + 2] Cycloadditions and Other Reactions Leading to Cyclobutanes / 6.3.：
Photochemical Cycloaddition Reactions / 6.4.：
[3,3] Sigmatropic Rearrangements / 6.5.：
Cope Rearrangements / 6.5.1.：
Claisen Rearrangements / 6.5.2.：
[2,3] Sigmatropic Rearrangements / 6.6.：
Ene Reactions / 6.7.：
Unimolecular Thermal Elimination Reactions / 6.8.：
Cheletropic Elimination / 6.8.1.：
Decomposition of Cyclic Azo Compounds / 6.8.2.：
[beta] Eliminations Involving Cyclic Transition States / 6.8.3.：
Organometallic Compounds of the Group I, II, and III Metals / Chapter 7.：
Preparation and Properties / 7.1.：
Reactions of Organomagnesium and Organolithium Compounds / 7.2.：
Reactions with Alkylating Agents / 7.2.1.：
Reactions with Carbonyl Compounds / 7.2.2.：
Organic Derivatives of Group IIB and Group IIIB Metals / 7.3.：
Organozinc Compounds / 7.3.1.：
Organocadmium Compounds / 7.3.2.：
Organomercury Compounds / 7.3.3.：
Organoindium Reagents / 7.3.4.：
Organolanthanide Reagents / 7.4.：
Reactions Involving the Transition Metals / Chapter 8.：
Organocopper Intermediates / 8.1.：
Preparation and Structure of Organocopper Reagents / 8.1.1.：
Reactions Involving Organocopper Reagents and Intermediates / 8.1.2.：
Reactions Involving Organopalladium Intermediates / 8.2.：
Palladium-Catalyzed Nucleophilic Substitution and Alkylation / 8.2.1.：
The Heck Reaction / 8.2.2.：
Palladium-Catalyzed Cross Coupling / 8.2.3.：
Carbonylation Reactions / 8.2.4.：
Reactions Involving Organonickel Compounds / 8.3.：
Reactions Involving Rhodium and Cobalt / 8.4.：
Organometallic Compounds with [pi] Bonding / 8.5.：
Carbon--Carbon Bond-Forming Reactions of Compounds of Boron, Silicon, and Tin / Chapter 9.：
Organoboron Compounds / 9.1.：
Synthesis of Organoboranes / 9.1.1.：
Carbon--Carbon Bond-Forming Reactions of Organoboranes / 9.1.2.：
Organosilicon Compounds / 9.2.：
Synthesis of Organosilanes / 9.2.1.：
Carbon--Carbon Bond-Forming Reactions / 9.2.2.：
Organotin Compounds / 9.3.：
Synthesis of Organostannanes / 9.3.1.：
Reactions Involving Carbocations, Carbenes, and Radicals as Reactive Intermediates / 9.3.2.：
Reactions Involving Carbocation Intermediates / 10.1.：
Carbon-Carbon Bond Formation Involving Carbocations / 10.1.1.：
Rearrangement of Carbocations / 10.1.2.：
Related Rearrangements / 10.1.3.：
Fragmentation Reactions / 10.1.4.：
Reactions Involving Carbenes and Nitrenes / 10.2.：
Structure and Reactivity of Carbenes / 10.2.1.：
Generation of Carbenes / 10.2.2.：
Addition Reactions / 10.2.3.：
Insertion Reactions / 10.2.4.：
Generation and Reactions of Ylides by Carbenoid Decomposition / 10.2.5.：
Rearrangement Reactions / 10.2.6.：
Related Reactions / 10.2.7.：
Nitrenes and Related Intermediates / 10.2.8.：
Rearrangements to Electron-Deficient Nitrogen / 10.2.9.：
Reactions Involving Free-Radical Intermediates / 10.3.：
Sources of Radical Intermediates / 10.3.1.：
Introduction of Functionality by Radical Reactions / 10.3.2.：
Addition Reactions of Radicals to Substituted Alkenes / 10.3.3.：
Cyclization of Free-Radical Intermediates / 10.3.4.：
Fragmentation and Rearrangement Reactions / 10.3.5.：
Aromatic Substitution Reactions / Chapter 11.：
Electrophilic Aromatic Substitution / 11.1.：
Nitration / 11.1.1.：
Halogenation / 11.1.2.：
Friedel-Crafts Alkylations and Acylations / 11.1.3.：
Electrophilic Metalation / 11.1.4.：
Nucleophilic Aromatic Substitution / 11.2.：
Aryl Diazonium Ions as Synthetic Intermediates / 11.2.1.：
Substitution by the Addition-Elimination Mechanism / 11.2.2.：
Substitution by the Elimination-Addition Mechanism / 11.2.3.：
Transition-Metal-Catalyzed Substitution Reactions / 11.2.4.：
Aromatic Radical Substitution Reactions / 11.3.：
Substitution by the S[subscript RN]1 Mechanism / 11.4.：
Oxidations / Chapter 12.：
Oxidation of Alcohols to Aldehydes, Ketones, or Carboxylic Acids / 12.1.：
Transition-Metal Oxidants / 12.1.1.：
Other Oxidants / 12.1.2.：
Addition of Oxygen at Carbon-Carbon Double Bonds / 12.2.：
Epoxides from Alkenes and Peroxidic Reagents / 12.2.1.：
Transformations of Epoxides / 12.2.3.：
Reaction of Alkenes with Singlet Oxygen / 12.2.4.：
Cleavage of Carbon-Carbon Double Bonds / 12.3.：
Oxonolysis / 12.3.1.：
Selective Oxidative Cleavages at Other Functional Groups / 12.4.：
Cleavage of Glycols / 12.4.1.：
Oxidative Decarboxylation / 12.4.2.：
Oxidation of Ketones and Aldehydes / 12.5.：
Oxidation of Ketones and Aldehydes by Oxygen and Peroxidic Compounds / 12.5.1.：
Oxidation with Other Reagents / 12.5.3.：
Allylic Oxidation / 12.6.：
Oxidations at Unfunctionalized Carbon / 12.6.1.：
Planning and Execution of Multistep Syntheses / Chapter 13.：
Protective Groups / 13.1.：
Hydroxyl-Protecting Groups / 13.1.1.：
Amino-Protecting Groups / 13.1.2.：
Carbonyl-Protecting Groups / 13.1.3.：
Carboxylic Acid-Protecting Groups / 13.1.4.：
Synthetic Equivalent Groups / 13.2.：
Synthetic Analysis and Planning / 13.3.：
Control of Stereochemistry / 13.4.：
Illustrative Syntheses / 13.5.：
Juvabione / 13.5.1.：
Longifolene / 13.5.2.：
Prelog-Djerassi Lactone / 13.5.3.：
Taxol / 13.5.4.：
Epothilone A / 13.5.5.：
Solid-Phase Synthesis / 13.6.：
Solid-Phase Synthesis of Polypeptides / 13.6.1.：
Solid-Phase Synthesis of Oligonucleotides / 13.6.2.：
Combinatorial Synthesis / 13.7.：
References for Problems
Index
Alkylation of Nucleophilic Carbon Intermediates / Chapter 1.：
Generation of Carbanions by Deprotonation / 1.1.：
Regioselectivity and Stereoselectivity in Enolate Formation / 1.2.：
23.
図書
Josef Pauli
目次情報:
続きを見る
Introduction / 1：
Need for New-Generation Robot Systems / 1.1：
Paradigms of Computer Vision (CV) and Robot Vision (RV) / 1.2：
Characterization of Computer Vision / 1.2.1：
Ch aracterization of Robot Vision / 1.2.2：
Robot Systems versus Autonomous Robot Systems / 1.3：
Characterization of a Robot System / 1.3.1：
Characterization of an Autonomous Robot System / 1.3.2：
Autonomous Camera-Equipped Robot System / 1.3.3：
Important Role of Demonstration and Learning / 1.4：
Learning Feature Compatibilities under Real Imaging / 1.4.1：
Learning Feature Manifolds of Real World Situations / 1.4.2：
Learning Environment-Effector-Image Relationships / 1.4.3：
Compatibilities, Manifolds, and Relationships / 1.4.4：
Ch apter Overview of th e Work / 1.5：
Compatibilities for Object Boundary Detection / 2：
Introduction to th e Ch apter / 2.1：
General Context of th e Ch apter / 2.1.1：
Object Localization and Boundary Extraction / 2.1.2：
Detailed Review of Relevant Literature / 2.1.3：
Outline of th e Sections in th e Ch apter / 2.1.4：
Geometric/Photometric Compatibility Principles / 2.2：
HoughTransformation for Line Extraction / 2.2.1：
Orientation Compatibility between Lines and Edges / 2.2.2：
Junction Compatibility between Pencils and Corners / 2.2.3：
Compatibility-Based Structural Level Grouping / 2.3：
HoughPeaks for Approximate Parallel Lines / 2.3.1：
Phase Compatibility between Parallels and Ramps / 2.3.2：
Extraction of Regular Quadrangles / 2.3.3：
Extraction of Regular Polygons / 2.3.4：
Compatibility-Based Assembly Level Grouping / 2.4：
Focusing Image Processing on Polygonal Windows / 2.4.1：
Vanishing-Point Compatibility of Parallel Lines / 2.4.2：
Pencil Compatibility of Meeting Boundary Lines / 2.4.3：
Boundary Extraction for Approximate Polyhedra / 2.4.4：
Geometric Reasoning for Boundary Extraction / 2.4.5：
Visual Demonstrations for LearningDegrees ofCompatibility / 2.5：
LearningDegreeofLine/EdgeOrientationCompatibility / 2.5.1：
LearningDegreeofParallel/RampPhaseCompatibility / 2.5.2：
Learning Degree of Parallelism Compatibility / 2.5.3：
Summary and Discussion of th e Ch apter / 2.6：
Manifolds for Object and Situation Recognition / 3：
Approachfor Object and Situation Recognition / 3.1：
Learning Pattern Manifolds withGBFs and PCA / 3.1.3：
Compatibility and Discriminability for Recognition / 3.2.1：
Regularization Principles and GBF Networks / 3.2.2：
Canonical FrameswithPrincipalComponent Analysis.116 / 3.2.3：
GBF Networks for Approximation of Recognition Functions / 3.3：
Approachof GBF Network Learning for Recognition / 3.3.1：
Object Recognition under Arbitrary View Angle / 3.3.2：
Object Recognition for Arbitrary View Distance / 3.3.3：
Scoring of Grasping Situations / 3.3.4：
SophisticatedManifoldApproximationforRobustRecognition.133 / 3.4：
Making Manifold Approximation Tractable / 3.4.1：
Log-Polar Transformation for Manifold Simplification.137 / 3.4.2：
Space-Time Correlations for Manifold Refinement / 3.4.3：
Learning Strategy withPCA/GBF Mixtures / 3.4.4：
Learning-Based Achievement of RV Competences / 3.5：
Learning Beh avior-Based Systems / 4.1：
Integrating Deliberate Strategies and Visual Feedback / 4.1.3：
Dynamical Systems and Control Mechanisms / 4.2.1：
Generic Modules for System Development / 4.2.2：
Treatment of an Exemplary High-Level Task / 4.3：
Description of an Exemplary High-Level Task / 4.3.1：
Localization of a Target Object in the Image / 4.3.2：
Determining and Reconstructing Obstacle Objects / 4.3.3：
Approaching and Grasping Obstacle Objects / 4.3.4：
Clearing Away Obstacle Objects on a Parking Area / 4.3.5：
Inspection and/or Manipulation of a Target Object / 4.3.6：
Monitoring the Task-Solving Process / 4.3.7：
Overall Task-Specific Configuration of Modules / 4.3.8：
Basic Mechanisms for Camera-Robot Coordination / 4.4：
Camera-Manipulator Relation for One-Step Control / 4.4.1：
Camera-Manipulator Relation for Multi-step Control.245 / 4.4.2：
Hand Servoing for Determining the Optical Axis / 4.4.3：
Determining th e Field of Sh arp View / 4.4.4：
Summary and Discussion / 4.5：
Developing Camera-Equipped Robot Systems / 5.1：
Rationale for th e Contents of Th is Work / 5.2：
Proposals for Future Research Topics / 5.3：
Ellipsoidal Interpolation / Appendix 1：
Further Behavioral Modules / Appendix 2：
Symbols
Index
References
Introduction / 1：
Need for New-Generation Robot Systems / 1.1：
Paradigms of Computer Vision (CV) and Robot Vision (RV) / 1.2：
24.
図書
Mikael Pettersson
目次情報:
続きを見る
Introduction / 1：
The Problem / 1.1：
Our Solution / 1.2：
Overview of this Thesis / 1.3：
Relation to our Previous Work / 1.4：
Preliminaries / 2：
Use of Formal Specifications / 2.1：
Why Generate Compilers? / 2.1.1：
Ways to Specify Semantics / 2.2：
Interpreters / 2.2.1：
Abstract Machines / 2.2.2：
Attribute Grammars / 2.2.3：
Donotational Semantics / 2.2.4：
Action Semantics / 2.2.5：
Evolving Algebras / 2.2.6：
Structural Operational Semantics / 2.2.7：
Natural Semantics / 2.3：
Natural Deduction / 2.3.1：
Relation to Programming Languages / 2.3.2：
Example / 2.3.3：
Meaning / 2.3.4：
Pragmatics / 2.3.5：
Recent Extensions / 2.3.6：
The Design of RML / 3：
Syntax / 3.1：
Static Semantics / 3.2：
Bindings and Unknowns / 3.2.1：
Technicalities / 3.2.2：
Modelling Backtracking / 3.3：
Intuition / 3.3.1：
Origins / 3.3.2：
Denotational Semantics of Backtracking / 3.3.3：
Deter minacy / 3.4：
History / 3.5：
Dynamic Semantics / 3.5.1：
Differences from SML / 3.6：
Examples / 4：
A Small Example / 4.1：
Abstract Syntax / 4.1.1：
Inference Rules / 4.1.2：
Operational Interpretation / 4.1.3：
Mini-Freja / 4.2：
Values / 4.2.1：
Environments / 4.2.3：
Evaluation / 4.2.4：
Modularity / 4.2.5：
Adding Recursion / 4.2.6：
Summary / 4.2.7：
Diesel / 4.3：
Static Elaboration / 4.3.1：
Flattening / 4.3.2：
Emitting Code / 4.3.3：
C Glue / 4.3.4：
Petrol / 4.3.5：
Mini-ML / 4.4.1：
Rémy-Style let-Polymorphism / 4.5.1：
Equality Types / 4.5.2：
Wright's Simple Imperative Polymorphism / 4.5.3：
Overloading / 4.5.4：
Specification Fragments / 4.5.5：
Problematic Issues / 4.5.6：
Default Rules / 4.6.1：
Implementation Overview / 4.7：
Compilation Strategy / 5.1：
Development / 5.1.1：
Alternatives / 5.2：
Prolog / 5.2.1：
Warren's Abstract Machine / 5.2.2：
SML / 5.2.3：
Implementation Status / 5.3：
Reducing Nondeterminism / 6：
Background / 6.1：
Grammars / 6.1.1：
FOL Representation / 6.2：
The Front-End / 6.3：
The FOL-TRS Rewriting System / 6.4：
Properties / 6.5：
Termination / 6.5.1：
Confluence / 6.5.2：
Alternatives for Rewriting Negations / 6.5.3：
append / 6.6：
lookup / 6.6.2：
Missed Conditionals / 6.7：
Implementation Notes / 6.8：
Implementation Complexity / 6.8.1：
Limitations / 6.9：
Related Work / 6.10：
Compiling Pattern Matching / 7：
What is Matching? / 7.1：
Compiling Term Matching / 7.1.2：
Troublesome Examples / 7.2：
Copied Expressions / 7.2.1：
Repeated and Sub-Optimal Tests / 7.2.2：
Intuitive Operation / 7.3：
Objects / 7.4：
Operations / 7.4.2：
The Algorithm / 7.5：
Step 1: Preprocessing / 7.5.1：
Step 2: Generating the DFA / 7.5.2：
Step 3: Merging of Equivalent States / 7.5.3：
Step 4: Generating Intermediate Code / 7.5.4：
The Examples Revisited / 7.6：
The demo Function / 7.6.1：
The unwieldy Function / 7.6.2：
State Merging / 7.6.3：
Data Representation / 7.7：
Compile-Time Warnings / 7.7.2：
Matching Exceptions / 7.7.3：
Guarded Patterns / 7.7.4：
Modifications for RML / 7.8：
Experiences and Conclusions / 7.10：
Compiling Continuations / 8：
Properties of CPS / 8.1：
Translating RML to CPS / 8.2：
Local Optimizations on CPS / 8.2.1：
Translating CPS to Code / 8.3：
Control / 8.3.1：
Copy Propagation / 8.3.2：
Memory Allocation / 8.3.3：
Data / 8.3.4：
Translating Code to C / 8.4：
Memory Management / 8.4.1：
A Code Generation Example / 8.5：
Simulating Tailcalls in C / 9：
Overview / 9.1：
Why is C not Tail-Recursive? / 9.2：
Why do not Prototypes Help? / 9.2.1：
ANDF / 9.2.2：
Tailcall Classification / 9.3：
Plain Dispatching Labels / 9.4：
Alternative Access Methods for Globals / 9.4.1：
The Monster Switch / 9.5：
Dispatching Switches / 9.6：
Step 1: Fast Known Intramodule Calls / 9.6.1：
Step 2: Recognizing Unknown Intramodule Calls / 9.6.2：
Step 3: Fast Unknown Intramodule Calls / 9.6.3：
Additional Benefits / 9.6.4：
Pushy Labels / 9.7：
Pushy Labels and Register Windows / 9.7.1：
The `Warped Gotos' Technique / 9.8：
The wamcc Approach / 9.9：
Non-Solutions / 9.10：
Experimental Results / 9.11：
Conclusions / 9.12：
Performance Evaluation / 10：
Target Systems / 10.1：
Allocation Arena Size / 10.2：
State Access Methods / 10.4：
Compiler Optimizations / 10.5：
Facing the Opposition / 10.6：
Concluding Remarks / 10.6.1：
Future Work / 11.1：
Programming Sub-Language / 11.2.1：
Taming Side-Effects / 11.2.3：
Moded Types / 11.2.4：
Linear Types / 11.2.5：
Compile to SML / 11.2.6：
Tuning the Runtime Systems / 11.2.7：
User-Friendliness / 11.2.8：
The Definition of RML / A：
Differences to SML / A.1：
Notation for Natural Semantics / A.2：
Lexical Definitions / A.2.1：
Syntax Definitions / A.2.2：
Sets / A.2.3：
Tuples / A.2.4：
Finite Sequences / A.2.5：
Finite Maps / A.2.6：
Substitutions / A.2.7：
Disjoint Unions / A.2.8：
Relations / A.2.9：
Lexical Structure / A.2.10：
Reserved Words / A.3.1：
Integer Constants / A.3.2：
Real Constants / A.3.3：
Character Constants / A.3.4：
String Constants / A.3.5：
Identifiers / A.3.6：
Type Variables / A.3.7：
Whitespace and Comments / A.3.8：
Lexical Analysis / A.3.9：
Syntactic Structure / A.4：
Derived Forms, Full and Core Grammar / A.4.1：
Ambiguity / A.4.2：
Simple Objects / A.5：
Compound Objects / A.5.2：
Initial Static Environments / A.5.3：
Initial Dynamic Objects / A.5.4：
Inference Rides / A.6.4：
Initial Objects / A.7：
Initial Static Objects / A.7.1：
Bibliography / A.7.2：
Index
Introduction / 1：
The Problem / 1.1：
Our Solution / 1.2：
25.
図書
Karsten Konrad
目次情報:
続きを見る
Motivation / 1：
The Subject of This Volume / 1.1：
Interpretation, Analysis, Computation / 1.2：
Interpretation / 1.2.1：
Analysis / 1.2.2：
Computation / 1.2.3：
Acknowledgments / 1.3：
Logics / Part I：
Model Generation / 2：
Introduction / 2.1：
Preliminaries / 2.2：
Topics / 2.3：
Models and Decidability / 2.3.1：
Herbrand Models / 2.3.2：
Finite Models / 2.3.3：
Representations / 2.3.4：
Minimality / 2.3.5：
Subset Minimality / 2.3.6：
Domain Minimality / 2.3.7：
Predicate-Specific Minimality / 2.3.8：
Enumeration / 2.3.9：
Model Enumeration with Theorem Provers / 2.3.10：
Enumeration with Finite Model Generators / 2.3.11：
Methods / 2.4：
Analytical Tableaux / 2.4.1：
Ground Tableaux / 2.4.2：
Free Variable Tableaux / 2.4.3：
Positive Unit Hyper-resolution / 2.4.4：
A Method Complete for Finite Satisfiability / 2.4.5：
The Davis-Putnam Procedure / 2.4.6：
Calculus and Procedure / 2.4.7：
Branches as Models / 2.4.8：
Efficiency / 2.4.9：
Related Work / 2.5：
Higher-Order Model Generation / 3：
The A-Calculus in Linguistics / 3.1：
Composition of Meaning / 3.1.1：
Quantification in Natural Language / 3.1.2：
Quantifiers as Higher-Order Expressions / 3.1.3：
First-Order Limitations / 3.1.4：
A Motivation for a New Kind of Logic / 3.1.5：
Higher-Order Logic / 3.2：
Syntax / 3.2.1：
Types / 3.2.2：
Terms / 3.2.3：
Semantics / 3.2.4：
Functional Interpretations / 3.2.5：
Logical Constants / 3.2.6：
Defining a Logic / 3.2.7：
Standard Frames and Generalised Interpretations / 3.2.8：
Model Generation for Generalised Frames? / 3.2.9：
Equivalency for Higher-Order Atoms / 3.2.10：
Function Domains and Quantification / 3.2.11：
A Fragment of Higher-Order Logic / 3.3：
Constant Frames / 3.3.1：
Interpretations and Denotations / 3.3.4：
An <$>{\cal M}{\cal Q}{\cal L}<$> Logic / 3.3.5：
Connectives / 3.3.6：
Quantifiers / 3.3.7：
Definitions / 3.3.8：
Equality / 3.3.9：
Constructing Models / 3.4：
Determining Models Intelligently / 3.4.1：
Formulas as Constraints / 3.4.2：
Solving Constraints / 3.4.3：
Translating Formulas into Constraints / 3.4.4：
An Example / 3.4.5：
Properties of the Translation / 3.4.6：
Refutation Soundness / 3.4.7：
Completeness for <$>{\cal M}{\cal Q}{\cal L}<$> Satisfiability / 3.4.8：
Enumerating Models / 3.4.9：
Minimal Model Generation / 4：
Decidability of Local Minimality / 4.1：
Linguistics / Part II：
The Analysis of Definites / 5：
The Semantics of Definite Descriptions / 5.1：
Definites and Deduction / 5.1.2：
How Models Interpret Sentences / 5.1.3：
Discourse Models / 5.1.4：
Models for Definites / 5.1.5：
Uniqueness and Lots of Rabbits / 5.1.6：
Some Representations / 5.2：
Simple Cases / 5.2.1：
Donkeys, Context Sets, and Anaphoric Use / 5.2.2：
Quantifiers and Donkey Sentences / 5.2.3：
Context Set Restrictions / 5.2.4：
The Treatment of Names / 5.2.5：
Restrictions with Knowledge / 5.2.6：
Implicit Knowledge and Accommodation / 5.2.7：
Bridging / 5.2.8：
Simple Cases Revisited / 5.2.9：
Non-resolvable Anaphora in DRT / 5.2.10：
Definites Are Not Anaphora / 5.2.11：
Non-existence / 5.2.12：
What We Have Learned so Far / 5.3：
Reciprocity / 6：
Exploring the Meaning of Each Other / 6.1：
Reciprocals for Larger Groups / 6.2.1：
Classifying Reciprocal Meaning / 6.2.2：
Strong Reciprocity / 6.2.3：
One-Way Weak Reciprocity / 6.2.4：
Inclusive Alternative Ordering / 6.2.5：
Intermediate Reciprocity / 6.2.6：
Intermediate Alternative Reciprocity / 6.2.7：
Strong Alternative Reciprocity / 6.2.8：
Parameterisation / 6.2.9：
The Landscape of Reciprocity / 6.2.10：
Parameterised Definitions / 6.2.11：
Interpreting Reciprocals / 6.2.12：
The Strongest Meaning Hypothesis / 6.2.13：
A Counter-Example / 6.2.14：
The SMH Does Not Compute (Yet) / 6.2.15：
Inference to Best Reciprocal Meaning / 6.3：
To Strong Meaning through Minimality / 6.3.1：
Predicate Minimisation / 6.3.2：
A Logical Encoding of Less Is More / 6.3.3：
A First Attempt at Computation / 6.3.4：
First Method: Minimality by Proof / 6.3.5：
Second Method: Minimality by Bounded Search / 6.3.6：
Third Method: A Two-Stage Combination / 6.3.7：
Conservative Minimality / 6.3.8：
Experiments / 6.4：
Pitchers and Pearls / 6.4.1：
The Boston Pitchers / 6.4.2：
Pearls / 6.4.3：
Measles / 6.4.4：
Marriages / 6.4.5：
Loose Ends / 6.5：
How We Can Understand Each Other / 6.6：
Abduction / 7：
What Is Abduction? / 7.1：
A Formal Definition of Abduction / 7.1.1：
Models for Anaphora Resolution / 7.2：
Chasing the Criminal / 7.2.1：
Explaining Resolutions / 7.2.2：
Discussion / 7.2.3：
Incremental Inference instead of Generate-and-Test / 7.2.4：
An Alternative by Conservative Minimality / 7.2.5：
Weighted Abduction / 7.3：
Logic Programming and Abduction / 7.3.1：
Abductive Explanations / 7.3.2：
Weights and Costs / 7.3.3：
Applications / 7.3.4：
Definite Reference / 7.3.5：
Composite Noun Phrases / 7.3.6：
Resolving Ambiguity / 7.3.7：
Similarities / 7.3.8：
Differences and Comparison / 7.3.10：
Implementation / 8：
System Architecture / 8.1：
The Syntax / 8.3：
Formulas / 8.3.1：
Problem Specifications / 8.3.3：
A Small Example / 8.3.4：
The Semantics / 8.3.5：
Logic Definition Structures / 8.4.1：
Propagator Procedures / 8.4.2：
Monadic Quantifiers / 8.4.3：
Diadic Quantifiers / 8.4.5：
The Translation / 8.4.6：
Proof Engines and Controlling Search / 8.5：
Proof Engines / 8.5.1：
Search / 8.5.2：
System Performance / 8.6：
Identifying Single Solutions / 8.6.1：
Kimba as a Propositional Theorem Prover / 8.6.2：
Generating Minimal Models / 8.6.3：
Conclusion / 9：
Why Inference Is Worth the Effort / 9.1：
Contributions / 9.2：
Models as Meaning / 9.3：
Some Example Problems / A：
The Job Puzzle / A.1：
Reciprocals: The Boston Pitchers / A.2：
References
Index
Motivation / 1：
The Subject of This Volume / 1.1：
Interpretation, Analysis, Computation / 1.2：
26.
図書
Peter Y. Yu, Manuel Cardona
目次情報:
続きを見る
Introduction / 1：
A Survey of Semiconductors / 1.1：
Elemental Semiconductors / 1.1.1：
Binary Compounds / 1.1.2：
Oxides / 1.1.3：
Layered Semiconductors / 1.1.4：
Organic Semiconductors / 1.1.5：
Magnetic Semiconductors / 1.1.6：
Other Miscellaneous Semiconductors / 1.1.7：
Growth Techniques / 1.2：
Czochralski Method / 1.2.1：
Bridgman Method / 1.2.2：
Chemical Vapor Deposition / 1.2.3：
Molecular Beam Epitaxy / 1.2.4：
Liquid Phase Epitaxy / 1.2.5：
Summary
Electronic Band Structures / 2：
Quantum Mechanics / 2.1：
Translational Symmetry and Brillouin Zones / 2.2：
A Pedestrian's Guide to Group Theory / 2.3：
Definitions and Notations / 2.3.1：
Symmetry Operations of the Diamond and Zinc-Blende Structures / 2.3.2：
Representations and Character Tables / 2.3.3：
Some Applications of Character Tables / 2.3.4：
Empty Lattice or Nearly Free Electron Energy Bands / 2.4：
Nearly Free Electron Band Structure in a Zinc-Blende Crystal / 2.4.1：
Nearly Free Electron Energy Bands in Diamond Crystals / 2.4.2：
Band Structure Calculation by Pseudopotential Methods / 2.5：
Pseudopotential Form Factors in Zinc-Blende- and Diamond-Type Semiconductors / 2.5.1：
Empirical and Self-Consistent Pseudopotential Methods / 2.5.2：
The kċp Method of Band-Structure Calculations / 2.6：
Effective Mass of a Nondegenerate Band Using the kċp Method / 2.6.1：
Band Dispersion near a Degenerate Extremum: Top Valence Bands in Diamondand Zinc-Blende-Type Semiconductors / 2.6.2：
Tight-Binding or LCAO Approach to the Band Structure of Semiconductors / 2.7：
Molecular Orbitals and Overlap Parameters / 2.7.1：
Band Structure of Group-IV Elements by the Tight-Binding Method / 2.7.2：
Overlap Parameters and Nearest-Neighbor Distances / 2.7.3：
Problems
Vibrational Properties of Semiconductors, and Electron-Phonon Interactions / 3：
Phonon Dispersion Curves of Semiconductors / 3.1：
Models for Calculating Phonon Dispersion Curves of Semiconductors / 3.2：
Force Constant Models / 3.2.1：
Shell Model / 3.2.2：
Bond Models / 3.2.3：
Bond Charge Models / 3.2.4：
Electron-Phonon Interactions / 3.3：
Strain Tensor and Deformation Potentials / 3.3.1：
Electron-Acoustic-Phonon Interaction at Degenerate Bands / 3.3.2：
Piezoelectric Electron-Acoustic-Phonon Interaction / 3.3.3：
Electron-Optical-Phonon Deformation Potential Interactions / 3.3.4：
Frohlich Interaction / 3.3.5：
Interaction Between Electrons and Large-Wavevector Phonons: Intervalley Electron-Phonon Interaction / 3.3.6：
Electronic Properties of Defects / 4：
Classification of Defects / 4.1：
Shallow or Hydrogenic Impurities / 4.2：
Effective Mass Approximation / 4.2.1：
Hydrogenic or Shallow Donors / 4.2.2：
Donors Associated with Anisotropic Conduction Bands / 4.2.3：
Acceptor Levels in Diamond-and Zinc-Blende-Type Semiconductors / 4.2.4：
Deep Centers / 4.3：
Green's Function Method for Calculating Defect Energy Levels / 4.3.1：
An Application of the Green's Function Method: Linear Combination of Atomic Orbitals / 4.3.2：
Another Application of the Green's Function Method: Nitrogen in GaP and Ga AsP Alloys / 4.3.3：
Final Note on Deep Centers / 4.3.4：
Electrical Transport / 5：
Quasi-Classical Approach / 5.1：
Carrier Mobility for a Nondegenerate Electron Gas / 5.2：
Relaxation Time Approximation / 5.2.1：
Nondegenerate Electron Gas in a Parabolic Band / 5.2.2：
Dependence of Scattering and Relaxation Times on Electron Energy / 5.2.3：
Momentum Relaxation Times / 5.2.4：
Temperature Dependence of Mobilities / 5.2.5：
Modulation Doping / 5.3：
High-Field Transport and Hot Carrier Effects / 5.4：
Velocity Saturation / 5.4.1：
Negative Differential Resistance / 5.4.2：
Gunn Effect / 5.4.3：
Magneto-Transport and the Hall Effect / 5.5：
Magneto-Conductivity Tensor / 5.5.1：
Hall Effect / 5.5.2：
Hall Coefficient for Thin Film Samples (van der Pauw Method) / 5.5.3：
Hall Effect for a Distribution of Electron Energies / 5.5.4：
Optical Properties I / 6：
Macroscopic Electrodynamics / 6.1：
Digression: Units for the Frequency of Electromagnetic Waves / 6.1.1：
Experimental Determination of Optical Constants / 6.1.2：
Kramers-Kronig Relations / 6.1.3：
The Dielectric Function / 6.2：
Experimental Results / 6.2.1：
Microscopic Theory of the Dielectric Function / 6.2.2：
Joint Density of States and Van Hove Singularities / 6.2.3：
Van Hove Singularities in ϵi / 6.2.4：
Direct Absorption Edges / 6.2.5：
Indirect Absorption Edges / 6.2.6：
""""Forbidden"""" Direct Absorption Edges / 6.2.7：
Excitons / 6.3：
Exciton Effect at M0 Critical Points / 6.3.1：
Absorption Spectra of Excitons / 6.3.2：
Exciton Effect at M1 Critical Points or Hyperbolic Excitons / 6.3.3：
Exciton Effect at M3 Critical Points / 6.3.4：
Phonon-Polaritons and Lattice Absorption / 6.4：
Phonon-Polaritons / 6.4.1：
Lattice Absorption and Reflection / 6.4.2：
Multiphonon Lattice Absorption / 6.4.3：
Dynamic Effective Ionic Charges in Heteropolar Semiconductors / 6.4.4：
Absorption Associated with Extrinsic Electrons / 6.5：
Free-Carrier Absorption in Doped Semiconductors / 6.5.1：
Absorption by Carriers Bound to Shallow Donors and Acceptors / 6.5.2：
Modulation Spectroscopy / 6.6：
Frequency Modulated Reflectance and Thermoreflectance / 6.6.3：
Piezoreflectance / 6.6.4：
Electroreflectance (Franz-Keldysh Effect) / 6.6.5：
Photoreflectance / 6.6.6：
Reflectance Difference Spectroscopy / 6.6.7：
Optical Properties II / 7：
Emission Spectroscopies / 7.1：
Band-to-Band Transitions / 7.1.1：
Free-to-Bound Transitions / 7.1.2：
Donor-Acceptor Pair Transitions / 7.1.3：
Excitons and Bound Excitons / 7.1.4：
Luminescence Excitation Spectroscopy / 7.1.5：
Light Scattering Spectroscopies / 7.2：
Macroscopic Theory of Inelastic Light Scattering by Phonons / 7.2.1：
Raman Tensor and Selection Rules / 7.2.2：
Experimental Determination of Raman Spectra / 7.2.3：
Microscopic Theory of Raman Scattering / 7.2.4：
A Detour into the World of Feynman Diagrams / 7.2.5：
Brillouin Scattering / 7.2.6：
Experimental Determination of Brillouin Spectra / 7.2.7：
Resonant Raman and Brillouin Scattering / 7.2.8：
Photoelectron Spectroscopy / 8：
Photoemission / 8.1：
Angle-Integrated Photoelectron Spectra of the Valence Bands / 8.1.1：
Angle-Resolved Photoelectron Spectra of the Valence Bands / 8.1.2：
Core Levels / 8.1.3：
Inverse Photoemission
Surface Effects / 8.2：
Surface States and Surface Reconstruction / 8.3.1：
Surface Energy Bands / 8.3.2：
Fermi Level Pinning and Space Charge Layers / 8.3.3：
Effect of Quantum Confinement on Electrons and Phonons in Semiconductors / 9：
Quantum Confinement and Density of States / 9.1：
Quantum Confinement of Electrons and Holes / 9.2：
Semiconductor Materials for Quantum Wells and Superlattices / 9.2.1：
Classification of Multiple Quantum Wells and Superlattices / 9.2.2：
Confinement of Energy Levels of Electrons and Holes / 9.2.3：
Some Experimental Results / 9.2.4：
Phonons in Superlattices / 9.3：
Phonons in Superlattices: Folded Acoustic and Confined Optic Modes / 9.3.1：
Folded Acoustic Modes: Macroscopic Treatment / 9.3.2：
Confined Optical Modes: Macroscopic Treatment / 9.3.3：
Electrostatic Effects in Polar Crystals: Interface Modes / 9.3.4：
Raman Spectra of Phonons in Semiconductor Superlattices / 9.4：
Raman Scattering by Folded Acoustic Phonons / 9.4.1：
Raman Scattering by Confined Optical Phonons / 9.4.2：
Raman Scattering by Interface Modes / 9.4.3：
Macroscopic Models of Electron-LO Phonon (Fröhlich) Interaction in Multiple Quantum Wells / 9.4.4：
Electrical Transport: Resonant Tunneling / 9.5：
Resonant Tunneling Through a Double-Barrier Quantum Well / 9.5.1：
I-V Characteristics of Resonant Tunneling Devices / 9.5.2：
Quantum Hall Effects in Two-Dimensional Electron Gases / 9.6：
Landau Theory of Diamagnetism in a Three-Dimensional Free Electron Gas / 9.6.1：
Magneto-Conductivity of a Two-Dimensional Electron Gas: Filling Factor / 9.6.2：
The Experiment of von Klitzing, Pepper and Dorda / 9.6.3：
Explanation of the Hall Plateaus in the Integral Quantum Hall Effect / 9.6.4：
Concluding Remarks / 9.7：
Appendix: Pioneers of Semiconductor Physics Remember
Ultra-Pure Germanium: From Applied to Basic Research or an Old Semiconductor Offering New Opportunities / Eugene E. Haller
Two Pseudopotential Methods: Empirical and Ab Initio / Marvin L. Cohen
The Early Stages of Band-Structures Physics and Its Struggles for a Place in the Sun / Conyers Herring
Cyclotron Resonance and Structure of Conduction and Valence Band Edges in Silicon and Germanium / Charles Kittel
Optical Properties of Amorphous Semiconductors and Solar Cells / Jan Tauc
Optical Spectroscopy of Shallow Impurity Centers / Elias Burstein
On the Prehistory of Angular Resolved Photoemission / Neville V. Smith
The Discovery and Very Basics of the Quantum Hall Effect / Klaus von Klitzing
The Birth of the Semiconductor Superlattice / Leo Esaki
References
Subject Index
Table of Fundamental Physical Constants (Inside Front Cover)
Table of Units (Inside Back Cover)
Introduction / 1：
A Survey of Semiconductors / 1.1：
Elemental Semiconductors / 1.1.1：
27.
図書
Olaf Burkart
目次情報:
続きを見る
Introduction / 1：
Sequential Processes / 1.1：
Model Checking / 1.2：
Equivalence Checking / 1.3：
Organisation of This Book / 1.4：
Background / 2：
Fixpoint Theory / 2.1：
Ordered Sets / 2.2.1：
Fixpoint Theorems / 2.2.2：
Relations and Rewrite Systems / 2.3：
Relations / 2.3.1：
Rewrite Systems / 2.3.2：
Context-Free Languages / 2.4：
Processes and Labelled Transition Graphs / 2.5：
Behavioural Equivalences / 2.5.1：
Normedness and Determinism / 2.5.2：
Context-Free Processes / 2.6：
Syntax and Semantics / 2.6.1：
Normedness / 2.6.2：
Self-bisimulations / 2.6.3：
Pushdown Processes / 3：
Expressiveness / 3.1：
PDPA Laws / 3.4：
Pushdown Normal Form / 3.5：
Parallel Composition / 3.6：
Example / 3.6.1：
Parallel Decomposition and 2-PDNF / 3.7：
Related work / 3.8：
Context-Free Graphs / 3.8.1：
Prefix Transition Graphs / 3.8.2：
Pushdown Transition Graphs / 3.8.3：
Equational graphs / 3.8.4：
MSOL Definable Hypergraphs / 3.8.5：
BPA with the state operator / 3.8.6：
The Modal µ-Calculus / 4：
Syntax / 4.2.1：
Semantics / 4.2.2：
Continuity / 4.2.3：
Alternation Depth / 4.2.4：
Assertion-Based Semantics / 4.3：
A Motivating Example / 4.3.1：
Definition of Assertion-Based Semantics / 4.3.2：
Properties of Assertion-Based Semantics / 4.3.3：
Verifying Behavioural Properties / 4.4：
Hierarchical Equational µ-Formulas / 4.4.1：
The Model Checking Algorithm / 4.4.2：
A Working Example / 4.4.3：
Expressiveness of the modal µ-calculus / 4.5：
The Bisimulation Equivalence Problem / 5：
Separability / 5.3：
Deciding Bisimilarity of Normed BPA / 5.4：
A Bound for Separability / 5.5：
The Algorithm / 5.6：
Bisimulation Bases / 5.6.1：
The Computation of an Initial Base / 5.6.2：
The Branching Algorithm / 5.6.3：
Summary of the Decision Procedure / 5.6.4：
Summary and Perspectives / 6：
Summary of the Main Results / 6.1：
Perspectives / 6.2：
Regularity of Context-Free Processes / 6.2.1：
Index
Introduction / 1：
Sequential Processes / 1.1：
Model Checking / 1.2：
28.
図書
Matthias Pflanz
目次情報:
続きを見る
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：
29.
図書
Petra Perner
目次情報:
続きを見る
Introduction / 1：
What Is Data Mining? / 1.1：
Some More Real-World Applications / 1.2：
Data Mining Methods - An Overview / 1.3：
Basic Problem Types / 1.3.1：
Prediction / 1.3.2：
Classification / 1.3.2.1：
Regression / 1.3.2.2：
Knowlegde Discovery / 1.3.3：
Deviation Detection / 1.3.3.1：
Cluster Analysis / 1.3.3.2：
Visualization / 1.3.3.3：
Association Rules / 1.3.3.4：
Segmentation / 1.3.3.5：
Data Mining Viewed from the Data Side / 1.4：
Types of Data / 1.5：
Conclusion / 1.6：
Data Preparation / 2：
Data Cleaning / 2.1：
Handling Outlier / 2.2：
Handling Noisy Data / 2.3：
Missing Values Handling / 2.4：
Coding / 2.5：
Recognition of Correlated or Redundant Attributes / 2.6：
Abstraction / 2.7：
Attribute Construction / 2.7.1：
Images / 2.7.2：
Time Series / 2.7.3：
Web Data / 2.7.4：
Conclusions / 2.8：
Methods for Data Mining / 3：
Decision Tree Induction / 3.1：
Basic Principle / 3.1.1：
Terminology of Decision Tree / 3.1.2：
Subtasks and Design Criteria for Decision Tree Induction / 3.1.3：
Attribute Selection Criteria / 3.1.4：
Information Gain Criteria and Gain Ratio / 3.1.4.1：
Gini Function / 3.1.4.2：
Discretization of Attribute Values / 3.1.5：
Binary Discretization / 3.1.5.1：
Multi-interval Discretization / 3.1.5.2：
Discretization of Categorical or Symbolical Attributes / 3.1.5.3：
Pruning / 3.1.6：
Overview / 3.1.7：
Cost-Complexity Pruning / 3.1.8：
Some General Remarks / 3.1.9：
Summary / 3.1.10：
Case-Based Reasoning / 3.2：
Background / 3.2.1：
The Case-Based Reasoning Process / 3.2.2：
CBR Maintenance / 3.2.3：
Knowledge Containers in a CBR System / 3.2.4：
Design Consideration / 3.2.5：
Similarity / 3.2.6：
Formalization of Similarity / 3.2.6.1：
Similarity Measures / 3.2.6.2：
Similarity Measures for Images / 3.2.6.3：
Case Description / 3.2.7：
Organization of Case Base / 3.2.8：
Learning in a CBR System / 3.2.9：
Learning of New Cases and Forgetting of Old Cases / 3.2.9.1：
Learning of Prototypes / 3.2.9.2：
Learning of Higher Order Constructs / 3.2.9.3：
Learning of Similarity / 3.2.9.4：
Clustering / 3.2.10：
General Comments / 3.3.1：
Distance Measures for Metrical Data / 3.3.3：
Using Numerical Distance Measures for Categorical Data / 3.3.4：
Distance Measure for Nominal Data / 3.3.5：
Contrast Rule / 3.3.6：
Agglomerate Clustering Methods / 3.3.7：
Partitioning Clustering / 3.3.8：
Graphs Clustering / 3.3.9：
Similarity Measure for Graphs / 3.3.10：
Hierarchical Clustering of Graphs / 3.3.11：
Conceptual Clustering / 3.3.12：
Concept Hierarchy and Concept Description / 3.4.1：
Category Utility Function / 3.4.3：
Algorithmic Properties / 3.4.4：
Algorithm / 3.4.5：
Conceptual Clustering of Graphs / 3.4.6：
Notion of a Case and Similarity Measure / 3.4.6.1：
Evaluation Function / 3.4.6.2：
Prototype Learning / 3.4.6.3：
An Example of a Learned Concept Hierarchy / 3.4.6.4：
Evaluation of the Model / 3.4.7：
Error Rate, Correctness, and Quality / 3.5.1：
Sensitivity and Specifity / 3.5.2：
Test-and-Train / 3.5.3：
Random Sampling / 3.5.4：
Cross Validation / 3.5.5：
Feature Subset Selection / 3.5.6：
Feature Subset Selection Algorithms / 3.6.1：
The Wrapper and the Filter Model for Feature Subset Selection / 3.6.2.1：
Feature Selection Done by Decision Tree Induction / 3.6.3：
Feature Subset Selection Done by Clustering / 3.6.4：
Contextual Merit Algorithm / 3.6.5：
Floating Search Method / 3.6.6：
Applications / 3.6.7：
Controlling the Parameters of an Algorithm/Model by Case-Based Reasoning / 4.1：
Modelling Concerns / 4.1.1：
Case-Based Reasoning Unit / 4.1.2：
Management of the Case Base / 4.1.3：
Case Structure and Case Base / 4.1.4：
Non-image Information / 4.1.4.1：
Image Information / 4.1.4.2：
Image Similarity Determination / 4.1.5：
Image Similarity Measure 1 (ISim_1) / 4.1.5.1：
Image Similarity Measure 2 (iSIM_2) / 4.1.5.2：
Comparision of ISim_1 and ISim_2 / 4.1.5.3：
Segmentation Algorithm and Segmentation Parameters / 4.1.6：
Similarity Determination / 4.1.7：
Overall Similarity / 4.1.7.1：
Similarity Measure for Non-image Information / 4.1.7.2：
Similarity Measure for Image Information / 4.1.7.3：
Knowledge Acquisition Aspect / 4.1.8：
Mining Images / 4.1.9：
Preparing the Experiment / 4.2.1：
Image Mining Tool / 4.2.3：
The Application / 4.2.4：
Brainstorming and Image Catalogue / 4.2.5：
Interviewing Process / 4.2.6：
Setting Up the Automatic Image Analysis and Feature Extraction Procedure / 4.2.7：
Image Analysis / 4.2.7.1：
Feature Extraction / 4.2.7.2：
Collection of Image Descriptions into the Data Base / 4.2.8：
The Image Mining Experiment / 4.2.9：
Review / 4.2.10：
Using the Discovered Knowledge / 4.2.11：
Lessons Learned
Appendix / 5：
The IRIS Data Set
References
Index
Introduction / 1：
What Is Data Mining? / 1.1：
Some More Real-World Applications / 1.2：
30.
図書
Neil Gershenfeld
目次情報:
続きを見る
Preface
Introduction / 1：
Interactions, Units, and Magnitudes / 2：
Units / 2.1：
Particles and Forces / 2.2：
Orders of Magnitude / 2.3：
Selected References / 2.4：
Problems / 2.5：
Noise in Physical Systems / 3：
Random Variables / 3.1：
Expectation Values / 3.1.1：
Spectral Theorems / 3.1.2：
Probability Distributions / 3.2：
Binomial / 3.2.1：
Poisson / 3.2.2：
Gaussian / 3.2.3：
Central Limit Theorem / 3.2.4：
Noise Mechanisms / 3.3：
Shot Noise / 3.3.1：
Johnson Noise / 3.3.2：
l/f Noise and Switching Noise / 3.3.3：
Amplifier Noise / 3.3.4：
Thermodynamics and Noise / 3.4：
Thermodynamics and Statistical Mechanics / 3.4.1：
Equipartition Theorem / 3.4.2：
Fluctuation--Dissipation Theorem / 3.4.3：
Information in Physical Systems / 3.5：
Information / 4.1：
Channel Capacity / 4.2：
The Gaussian Channel / 4.3：
Fisher Information / 4.4：
Information and Thermodynamics / 4.5：
Electromagnetic Fields and Waves / 4.6：
Vector Calculus / 5.1：
Vectors / 5.1.1：
Differential Operators / 5.1.2：
Integral Relationships / 5.1.3：
Statics / 5.2：
Electrostatics / 5.2.1：
Magnetostatics / 5.2.2：
Multipoles / 5.2.3：
Dynamics / 5.3：
Maxwell's Equations / 5.3.1：
Boundary Conditions / 5.3.2：
Electromagnetic Units / 5.3.3：
Radiation and Energy / 5.4：
Waves / 5.4.1：
Electromagnetic Energy / 5.4.2：
Circuits, Transmission Lines, and Waveguides / 5.5：
Circuits / 6.1：
Current and Voltage / 6.1.1：
Kirchhoff's Laws / 6.1.2：
Resistance / 6.1.3：
Power / 6.1.4：
Capacitance / 6.1.5：
Inductance / 6.1.6：
Wires and Transmission Lines / 6.2：
Skin Depth / 6.2.1：
Transmission Lines / 6.2.2：
Wave Solutions / 6.2.3：
Reflections and Terminations / 6.2.4：
Waveguides / 6.3：
Governing Equations / 6.3.1：
Rectangular Waveguides / 6.3.2：
Circular Waveguides / 6.3.3：
Dielectric Waveguides and Fiber Optics / 6.3.4：
Antennas / 6.4：
Time-Dependent Potentials / 7.1：
Dipole Radiation / 7.2：
Infinitesimal Length / 7.2.1：
Finite Length / 7.2.2：
Duality and Reciprocity / 7.3：
Antenna Types / 7.4：
Optics / 7.5：
Reflection and Refraction / 8.1：
Geometrical Optics / 8.2：
Ray Matrices / 8.2.1：
Optical Transforms / 8.2.2：
Beyond Geometrical Optics / 8.3：
Lensless Imaging and Inverse Problems / 8.4：
Matched Filters and Synthetic Lenses / 9.1：
Coherent Imaging / 9.2：
Computed Tomography / 9.3：
Magnetic Resonance Imaging / 9.4：
Inverse Problems / 9.5：
Semiconductor Materials and Devices / 9.6：
Quantum Statistical Mechanics / 10.1：
Electronic Structure / 10.2：
Junctions, Diodes, and Transistors / 10.3：
Logic / 10.4：
Limits / 10.5：
Generating, Detecting, and Modulating Light / 10.6：
Generation / 11.1：
Incandescence / 11.1.1：
Luminescence: LEDs, Lasers, and Flat Panels / 11.1.2：
Detection / 11.2：
Modulation / 11.3：
Polarization / 11.3.1：
Liquid Crystals / 11.3.2：
Smoke and Mirrors / 11.3.3：
Magnetic Storage / 11.4：
Magnetism / 12.1：
Diamagnetism / 12.1.1：
Paramagnetism / 12.1.2：
Ferro-, Antiferro-, and Ferri-magnetism / 12.1.3：
Magnetic Recording / 12.2：
Magnetic Media / 12.2.1：
Recording Systems / 12.2.2：
Measurement and Coding / 12.3：
Instrumentation / 13.1：
Amplifiers / 13.1.1：
Grounding, Shielding, and Leads / 13.1.2：
Bridges / 13.1.3：
Modulation and Detection / 13.2：
Synchronous Detection / 13.2.1：
Phase Detection and Encoding / 13.2.2：
Spread Spectrum / 13.2.3：
Digitization / 13.2.4：
Coding / 13.3：
Compression / 13.3.1：
Error Correction / 13.3.2：
Channel Coding / 13.3.3：
Cryptography / 13.3.4：
Transducers / 13.4：
Many-Body Effects / 14.1：
Superconductivity / 14.1.1：
SQUIDs / 14.1.2：
Non-Equilibrium Thermodynamics / 14.2：
Thermoelectricity / 14.2.1：
Piezoelectricity / 14.2.2：
Relativity / 14.3：
Clocks / 14.3.1：
Time / 14.3.2：
Position / 14.3.3：
Quantum Computing and Communications / 14.4：
Quantum Mechanics / 15.1：
States and Operators / 15.1.1：
Angular Momentum / 15.1.2：
Density Matrices / 15.1.3：
Communications / 15.2：
Teleportation / 15.3.1：
Computation / 15.3.4：
Searching / 15.4.1：
Transforms and Factoring / 15.4.2：
Simulation / 15.4.3：
Experimental Implementation / 15.4.4：
Problem Solutions / 15.5：
Circuits, Transmission Lines, and Wave Guides / A1.1：
Generating, Modulating, and Detecting Light / A1.7：
Quantum Computing and Communication / A1.12：
Bibliography
Index
Preface
Introduction / 1：
Interactions, Units, and Magnitudes / 2：
31.
図書
Alfredo H-S. Ang, Wilson H. Tang
目次情報:
続きを見る
Role of Probability in Engineering / 1：
Introduction / 1.1：
Uncertainty in Real-World Information / 1.2：
Uncertainty Associated with Randomness / 1.2.1：
Uncertainty Associated with Imperfect Modeling and Estimation / 1.2.2：
Design and Decision-Making Under Uncertainty / 1.3：
Planning and Design of Airport Pavement / 1.3.1：
Hydrologic Design / 1.3.2：
Design of Structures and Machines / 1.3.3：
Geotechnical Design / 1.3.4：
Construction Planning and Management / 1.3.5：
Photogrammetric, Geodetic, and Surveying Measurements / 1.3.6：
Control and Standards / 1.4：
Concluding Remarks / 1.5：
Basic Probability Concepts / 2：
Events and Probability / 2.1：
Characteristics of Probability Problems / 2.1.1：
Calculation of Probability / 2.1.2：
Elements of Set Theory / 2.2：
Definitions / 2.2.1：
Combination of Events / 2.2.2：
Operational Rules / 2.2.3：
Mathematics of Probability / 2.3：
Basic Axioms of Probability Addition Rule / 2.3.1：
Conditional Probability Multiplication Rule / 2.3.2：
Theorem of Total Probability / 2.3.3：
Bayes' Theorem / 2.3.4：
Concluding Remarks Problems / 2.4：
Analytical Models of Random Phenomena / 3：
Random Variables / 3.1：
Probability Distribution of a Random Variable / 3.1.1：
Main Descriptors of a Random Variable / 3.1.2：
Useful Probability Distributions / 3.2：
The Normal Distribution / 3.2.1：
The Logarithmic Normal Distribution / 3.2.2：
Bernoulli Sequence and the Binomial Distribution / 3.2.3：
The Geometric Distribution / 3.2.4：
The Negative Binomial Distribution / 3.2.5：
The Poisson Process and Poisson Distribution / 3.2.6：
The Exponential Distribution / 3.2.7：
The Gamma Distribution / 3.2.8：
The Hypergeometric Distribution / 3.2.9：
The Beta Distribution / 3.2.10：
Other Distributions / 3.2.11：
Multiple Random Variables / 3.3：
Joint and Conditional Probability Distributions / 3.3.1：
Covariance and Correlation / 3.3.2：
Conditional Mean and Variance / 3.3.3：
Functions of Random Variables / 3.4：
Derived Probability Distributions / 4.1：
Function of Single Random Variable / 4.2.1：
Function of Multiple Random Variables / 4.2.2：
Moments of Functions of Random Variables / 4.3：
Mean and Variance of a Linear Function / 4.3.1：
Product of Independent Variates / 4.3.3：
Mean and Variance of a General Function / 4.3.4：
Estimating Parameters from Observational Data / 4.4：
The Role of Statistical Inference in Engineering / 5.1：
Inherent Variability and Estimation Error / 5.1.1：
Classical Approach to Estimation of Parameters / 5.2：
Random Sampling and Point Estimation / 5.2.1：
Interval Estimation of the Mean / 5.2.2：
Problems of Measurement Theory / 5.2.3：
Interval Estimation of the Variance / 5.2.4：
Estimation of Proportion / 5.2.5：
Empirical Determination of Distribution Models / 5.3：
Probability Paper / 6.1：
The Normal Probability Paper / 6.2.1：
The Log-Normal Probability Paper / 6.2.2：
Construction of General Probability Paper / 6.2.3：
Testing Validity of Assumed Distribution / 6.3：
Chi-Square Test for Distribution / 6.3.1：
Kolmogorov-Smirnov Test for Distribution / 6.3.2：
Regression and Correlation Analyses / 6.4：
Basic Formulation of Linear Regression / 7.1：
Regression with Constant Variance / 7.1.1：
Regression with Nonconstant Variance / 7.1.2：
Multiple Linear Regression / 7.2：
Nonlinear Regression / 7.3：
Applications of Regression Analysis in Engineering / 7.4：
Correlation Analysis / 7.5：
Estimation of Correlation Coefficient / 7.5.1：
The Bayesian Approach / 7.6：
Basic Concepts-The Discrete Case / 8.1：
The Continuous Case / 8.3：
General Formulation / 8.3.1：
A Special Application of Bayesian Up-dating Process / 8.3.2：
Bayesian Concepts in Sampling Theory / 8.4：
Sampling from Normal Population / 8.4.1：
Error in Estimation / 8.4.3：
Use of Conjugate Distributions / 8.4.4：
Elements of Quality Assurance and Acceptance Sampling / 8.5：
Acceptance Sampling by Attributes / 9.1：
The Operating Characteristic (OC) Curve / 9.1.1：
The Success Run / 9.1.2：
The Average Outgoing Quality Curve / 9.1.3：
Acceptance Sampling by Variables / 9.2：
Average Quality Criterion, sigma Known / 9.2.1：
Average Quality Criterion, sigma Unknown / 9.2.2：
Fraction Defective Criterion / 9.2.3：
Multiple-Stage Sampling / 9.3：
Probability Tables / 9.4：
Table of Standard Normal Probability / Table A.1：
p-Percentile Values of the t-Distribution / Table A.2：
p-Percentile Values of the x 2 -Distribution / Table A.3：
Critical Values of D alpha; in the Kolmogorov-Smirnov Test / Table A.4：
Combinatorial Formulas / Appendix B：
Derivation of the Poisson Distribution / Appendix C：
References
Index
Role of Probability in Engineering / 1：
Introduction / 1.1：
Uncertainty in Real-World Information / 1.2：
32.
図書
Thomas Reinartz
目次情報:
続きを見る
Introduction / 1：
Knowledge Discovery in Databases and Data Mining / 1.1：
Focusing for Data Mining / 1.2：
Overview / 1.3：
Knowledge Discovery in Databases / 2：
Knowledge Discovery Process / 2.1：
Humans in the Loop / 2.1.1：
KDD Project Phases / 2.1.2：
Data Preparation / 2.2：
From Business Data to Data Mining Input / 2.2.1：
Data Selection and Focusing / 2.2.2：
Data Mining Goals / 2.3：
From Understanding to Predictive Modeling / 2.3.1：
Classification / 2.3.2：
Data Characteristics: Notations and Definitions / 2.4：
Database Tables / 2.4.1：
Statistical Values / 2.4.2：
Data Mining Algorithms / 2.5：
Classification Algorithms / 2.5.1：
Top Down Induction of Decision Trees / 2.5.2：
Nearest Neighbor Classifiers / 2.5.3：
Selecting the Focusing Context / 2.6：
Focusing Tasks / 3：
Focusing Concepts: An Overview / 3.1：
Focusing Specification / 3.2：
Focusing Input / 3.2.1：
Focusing Output / 3.2.2：
Focusing Criterion / 3.2.3：
Focusing Context / 3.3：
Data Characteristics / 3.3.1：
Focusing Success / 3.3.2：
Filter Evaluation / 3.4.1：
Wrapper Evaluation / 3.4.2：
Evaluation Criteria / 3.4.3：
Selecting the Focusing Task / 3.5：
Focusing Solutions / 4：
State of the Art: A Unifying View / 4.1：
The Unifying Framework of Existing Focusing Solutions / 4.1.1：
Sampling / 4.1.2：
Clustering / 4.1.3：
Prototyping / 4.1.4：
More Intelligent Sampling Techniques / 4.2：
Existing Reusable Components / 4.2.1：
Advanced Leader Sampling / 4.2.2：
Similarity-Driven Sampling / 4.2.3：
A Unified Approach to Focusing Solutions / 4.3：
Generic Sampling / 4.3.1：
Generic Sampling in a Commercial Data Mining System / 4.3.2：
Analytical Studies / 5：
An Average Case Analysis / 5.1：
Experimental Validation of Theoretical Claims / 5.2：
Experimental Results / 6：
Experimental Design / 6.1：
Experimental Procedure / 6.1.1：
Results and Evaluation / 6.1.2：
Wrapper Evaluation for C4.5 / 6.2.1：
Wrapper Evaluation for IB / 6.2.3：
Comparing Filter and Wrapper Evaluation for C4.5 / 6.2.4：
Comparing Filter and Wrapper Evaluation for IB / 6.2.5：
Comparing Wrapper Evaluation for C4.5 and IB / 6.2.6：
Focusing Advice / 6.3：
Sorting, Stratification, and Prototype Weighting / 6.3.1：
Focusing Solutions in Focusing Contexts / 6.3.2：
Conclusions / 7：
Summary and Contributions / 7.1：
More Related Work / 7.2：
Future Work / 7.3：
Closing Remarks / 7.4：
Bibliography
Acknowledgments
Notations / A：
Indices, Variables, and Functions / A.1：
Algorithms and Procedures / A.2：
More Evaluation Criteria / B：
Filter Evaluation Criteria / B.1：
Wrapper Evaluation Criteria / B.2：
Remaining Proofs / C：
Generic Sampling in GenSam / D：
More Experimental Results / E：
Index
Curriculum Vitae
Introduction / 1：
Knowledge Discovery in Databases and Data Mining / 1.1：
Focusing for Data Mining / 1.2：
33.
図書
Andrew S. Tanenbaum
出版情報:
Englewood Cliffs ; London : Prentice-Hall, 1984 xiii, 465 p. ; 24 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Introduction / 1：
Computer Systems Organization / 1.1：
Structured Computer Organization
The Digital Logic Level / 3：
Languages, Levels, and Virtual Machines / 4：
The Microarchitecture Level
The Instruction Set Architecture Level / 1.1.2：
Contemporary Multilevel Machines
The Operating System Machine Level / 6：
Evolution of Multilevel Machines / 7：
The Assembly Language Level
Parallel Computer Architectures / 1.2：
Milestones in Computer Architecture
Reading List and Bibliography / 9：
The Zeroth Generation-Mechanical Computers (1642-1945) / Appendix A：
Binary Numbers
Floating-Point Numbers / 1.2.2：
The First Generation-Vacuum Tubes (1945-1955)
The Second Generation-Transistors (1955-1965) / 1.2.3：
The Third Generation-Integrated Circuits (1965-1980) / 1.2.4：
The Fourth Generation-Very Large Scale Integration (1980-?) / 1.2.5：
The Fifth Generation-Invisible Computers / 1.2.6：
The Computer Zoo / 1.3：
Technological and Economic Forces / 1.3.1：
The Computer Spectrum / 1.3.2：
Disposable Computers / 1.3.3：
Microcontrollers / 1.3.4：
Game Computers / 1.3.5：
Personal Computers / 1.3.6：
Servers / 1.3.7：
Collections of Workstations / 1.3.8：
Mainframes / 1.3.9：
Example Computer Families / 1.4：
Introduction to the Pentium 4 / 1.4.1：
Introduction to the UltraSPARC III / 1.4.2：
Introduction to the 8051 / 1.4.3：
Metric Units / 1.5：
Outline of This Book / 1.6：
Processors / 2.1：
CPU Organization / 2.1.1：
Instruction Execution / 2.1.2：
RISC versus CISC / 2.1.3：
Design Principles for Modern Computers / 2.1.4：
Instruction-Level Parallelism / 2.1.5：
Processor-Level Parallelism / 2.1.6：
Primary Memory / 2.2：
Bits / 2.2.1：
Memory Addresses / 2.2.2：
Byte Ordering / 2.2.3：
Error-Correcting Codes / 2.2.4：
Cache Memory / 2.2.5：
Memory Packaging and Types / 2.2.6：
Secondary Memory / 2.3：
Memory Hierarchies / 2.3.1：
Magnetic Disks / 2.3.2：
Floppy Disks / 2.3.3：
IDE Disks / 2.3.4：
SCSI Disks / 2.3.5：
RAID / 2.3.6：
CD-ROMs / 2.3.7：
CD-Recordables / 2.3.8：
CD-Rewritables / 2.3.9：
DVD / 2.3.10：
Blu-Ray / 2.3.11：
Input/Output / 2.4：
Buses / 2.4.1：
Terminals / 2.4.2：
Mice / 2.4.3：
Printers / 2.4.4：
Telecommunications Equipment / 2.4.5：
Digital Cameras / 2.4.6：
Character Codes / 2.4.7：
Summary / 2.5：
Gates and Boolean Algebra / 3.1：
Gates / 3.1.1：
Boolean Algebra / 3.1.2：
Implementation of Boolean Functions / 3.1.3：
Circuit Equivalence / 3.1.4：
Basic Digital Logic Circuits / 3.2：
Integrated Circuits / 3.2.1：
Combinational Circuits / 3.2.2：
Arithmetic Circuits / 3.2.3：
Clocks / 3.2.4：
Memory / 3.3：
Latches / 3.3.1：
Flip-Flops / 3.3.2：
Registers / 3.3.3：
Memory Organization / 3.3.4：
Memory Chips / 3.3.5：
RAMs and ROMs / 3.3.6：
CPU Chips and Buses / 3.4：
CPU Chips / 3.4.1：
Computer Buses / 3.4.2：
Bus Width / 3.4.3：
Bus Clocking / 3.4.4：
Bus Arbitration / 3.4.5：
Bus Operations / 3.4.6：
Example CPU Chips / 3.5：
The Pentium 4 / 3.5.1：
The UltraSPARC III / 3.5.2：
The 8051 / 3.5.3：
Example Buses / 3.6：
The ISA Bus / 3.6.1：
The PCI Bus / 3.6.2：
PCI Express / 3.6.3：
The Universal Serial Bus / 3.6.4：
Interfacing / 3.7：
I/O Chips / 3.7.1：
Address Decoding / 3.7.2：
An Example Microarchitecture / 3.8：
The Data Path / 4.1.1：
Microinstructions / 4.1.2：
Microinstruction Control: The Mic-1 / 4.1.3：
An Example Isa: IJVM / 4.2：
Stacks / 4.2.1：
The IJVM Memory Model / 4.2.2：
The IJVM Instruction Set / 4.2.3：
Compiling Java to IJVM / 4.2.4：
An Example Implementation / 4.3：
Microinstructions and Notation / 4.3.1：
Implementation of IJVM Using the Mic-1 / 4.3.2：
Design of the Microarchitecture Level / 4.4：
Speed versus Cost / 4.4.1：
Reducing the Execution Path Length / 4.4.2：
A Design with Prefetching: The Mic-2 / 4.4.3：
A Pipelined Design: The Mic-3 / 4.4.4：
A Seven-Stage Pipeline: The Mic-4 / 4.4.5：
Improving Performance / 4.5：
Branch Prediction / 4.5.1：
Out-of-Order Execution and Register Renaming / 4.5.3：
Speculative Execution / 4.5.4：
Examples of the Microarchitecture Level / 4.6：
The Microarchitecture of the Pentium 4 CPU / 4.6.1：
The Microarchitecture of the UltraSPARC-III Cu CPU / 4.6.2：
The Microarchitecture of the 8051 CPU / 4.6.3：
Comparison of the Pentium, Ultrasparc, and 8051 / 4.7：
Overview of the ISA Level / 4.8：
Properties of the ISA Level / 5.1.1：
Memory Models / 5.1.2：
Instructions / 5.1.3：
Overview of the Pentium 4 ISA Level / 5.1.5：
Overview of the UltraSPARC III ISA Level / 5.1.6：
Overview of the 8051 ISA Level / 5.1.7：
Data Types / 5.2：
Numeric Data Types / 5.2.1：
Nonnumeric Data Types / 5.2.2：
Data Types on the Pentium 4 / 5.2.3：
Data Types on the UltraSPARC III / 5.2.4：
Data Types on the 8051 / 5.2.5：
Instruction Formats / 5.3：
Design Criteria for Instruction Formats / 5.3.1：
Expanding Opcodes / 5.3.2：
The Pentium 4 Instruction Formats / 5.3.3：
The UltraSPARC III Instruction Formats / 5.3.4：
The 8051 Instruction Formats / 5.3.5：
Addressing / 5.4：
Addressing Modes / 5.4.1：
Immediate Addressing / 5.4.2：
Direct Addressing / 5.4.3：
Register Addressing / 5.4.4：
Register Indirect Addressing / 5.4.5：
Indexed Addressing / 5.4.6：
Based-Indexed Addressing / 5.4.7：
Stack Addressing / 5.4.8：
Addressing Modes for Branch Instructions / 5.4.9：
Orthogonality of Opcodes and Addressing Modes / 5.4.10：
The Pentium 4 Addressing Modes / 5.4.11：
The UltraSPARC III Addressing Modes / 5.4.12：
The 8051 Addressing Modes / 5.4.13：
Discussion of Addressing Modes / 5.4.14：
Instruction Types / 5.5：
Data Movement Instructions / 5.5.1：
Dyadic Operations / 5.5.2：
Monadic Operations / 5.5.3：
Comparisons and Conditional Branches / 5.5.4：
Procedure Call Instructions / 5.5.5：
Loop Control / 5.5.6：
The Pentium 4 Instructions / 5.5.7：
The UltraSPARC III Instructions / 5.5.9：
The 8051 Instructions / 5.5.10：
Comparison of Instruction Sets / 5.5.11：
Flow of Control / 5.6：
Sequential Flow of Control and Branches / 5.6.1：
Procedures / 5.6.2：
Coroutines / 5.6.3：
Traps / 5.6.5：
Interrupts
A Detailed Example: The Towers of Hanoi / 5.7：
The Towers of Hanoi in Pentium 4 Assembly Language / 5.7.1：
The Towers of Hanoi in UltraSPARC III Assembly Language / 5.7.2：
The IA-64 Architecture and the Itanium 2 / 5.8：
The Problem with the Pentium 4 / 5.8.1：
The IA-64 Model: Explicitly Parallel Instruction Computing / 5.8.2：
Reducing Memory References / 5.8.3：
Instruction Scheduling / 5.8.4：
Reducing Conditional Branches: Predication / 5.8.5：
Speculative Loads / 5.8.6：
Virtual Memory / 5.9：
Paging / 6.1.1：
Implementation of Paging / 6.1.2：
Demand Paging and the Working Set Model / 6.1.3：
Page Replacement Policy / 6.1.4：
Page Size and Fragmentation / 6.1.5：
Segmentation / 6.1.6：
Implementation of Segmentation / 6.1.7：
Virtual Memory on the Pentium 4 / 6.1.8：
Virtual Memory on the UltraSPARC III / 6.1.9：
Virtual Memory and Caching / 6.1.10：
Virtual I/O Instructions / 6.2：
Files / 6.2.1：
Implementation of Virtual I/O Instructions / 6.2.2：
Directory Management Instructions / 6.2.3：
Virtual Instructions for Parallel Processing / 6.3：
Process Creation / 6.3.1：
Race Conditions / 6.3.2：
Process Synchronization Using Semaphores / 6.3.3：
Example Operating Systems / 6.4：
Examples of Virtual Memory / 6.4.1：
Examples of Virtual I/O / 6.4.3：
Examples of Process Management / 6.4.4：
Introduction to Assembly Language / 6.5：
What Is an Assembly Language? / 7.1.1：
Why Use Assembly Language? / 7.1.2：
Format of an Assembly Language Statement / 7.1.3：
Pseudoinstructions / 7.1.4：
Macros / 7.2：
Macro Definition, Call, and Expansion / 7.2.1：
Macros with Parameters / 7.2.2：
Advanced Features / 7.2.3：
Implementation of a Macro Facility in an Assembler / 7.2.4：
The Assembly Process / 7.3：
Two-Pass Assemblers / 7.3.1：
Pass One / 7.3.2：
Pass Two / 7.3.3：
The Symbol Table / 7.3.4：
Linking and Loading / 7.4：
Tasks Performed by the Linker / 7.4.1：
Structure of an Object Module / 7.4.2：
Binding Time and Dynamic Relocation / 7.4.3：
Dynamic Linking / 7.4.4：
On-Chip Paralellism / 7.5：
On-Chip Multithreading / 8.1.1：
Single-Chip Multiprocessors / 8.1.3：
Coprocessors / 8.2：
Network Processors / 8.2.1：
Media Processors / 8.2.2：
Cryptoprocessors / 8.2.3：
Shared-Memory Multiprocessors / 8.3：
Multiprocessors vs. Multicomputers / 8.3.1：
Memory Semantics / 8.3.2：
UMA Symmetric Multiprocessor Architectures / 8.3.3：
NUMA Multiprocessors / 8.3.4：
COMA Multiprocessors / 8.3.5：
Message-Passing Multicomputers / 8.4：
Interconnection Networks / 8.4.1：
MPPs-Massively Parallel Processors / 8.4.2：
Cluster Computing / 8.4.3：
Communication Software for Multicomputers / 8.4.4：
Scheduling / 8.4.5：
Application-Level Shared Memory / 8.4.6：
Performance / 8.4.7：
Grid Computing / 8.5：
Suggestions for Further Reading / 8.6：
Introduction and General Works / 9.1.1：
Binary and Floating-Point Numbers / 9.1.2：
Assembly Language Programming / 9.1.10：
Alphabetical Bibliography / 9.2：
Finte-Precision Numbers / A：
Radix Number Systems / A.2：
Conversion From One Radix to Another / A.3：
Negative Binary Numbers / A.4：
Binary Arithmetic / A.5：
Principles of Floating Point / B：
IEEE Floating-Point Standard 754 / B.2：
Overview / C：
Assembly Language / C.1.1：
A Small Assembly Language Program / C.1.2：
The 8088 Processor / C.2：
The Processor Cycle / C.2.1：
The General Registers / C.2.2：
Pointer Registers / C.2.3：
Memory and Addressing / C.3：
Memory Organization and Segments / C.3.1：
The 8088 Instruction Set / C.3.2：
Move, Copy and Arithmetic / C.4.1：
Logical, Bit and Shift Operations / C.4.2：
Loop and Repetitive String Operations / C.4.3：
Jump and Call Instructions / C.4.4：
Subroutine Calls / C.4.5：
System Calls and System Subroutines / C.4.6：
Final Remarks on the Instruction Set / C.4.7：
The Assembler / C.5：
The ACK-Based Tutorial Assembler as88 / C.5.1：
Some Differences with Other 8088 Assemblers / C.5.3：
The Tracer / C.6：
Tracer Commands / C.6.1：
Getting Started / C.7：
Examples / C.8：
Hello World Example / C.8.1：
General Registers Example / C.8.2：
Call Command and Pointer Registers / C.8.3：
Debugging an Array Print Program / C.8.4：
Preface
Introduction / 1：
Computer Systems Organization / 1.1：
34.
図書
Sven Behnke
目次情報:
続きを見る
Foreword
Preface
Introduction / 1：
Motivation / 1.1：
Importance of Visual Perception / 1.1.1：
Performance of the Human Visual System / 1.1.2：
Limitations of Current Computer Vision Systems / 1.1.3：
Iterative Interpretation - Local Interactions in a Hierarchy / 1.1.4：
Organization of the Thesis / 1.2：
Contributions / 1.3：
Theory / Part I：
Neurobiological Background / 2：
Visual Pathways / 2.1：
Feature Maps / 2.2：
Layers / 2.3：
Neurons / 2.4：
Synapses / 2.5：
Discussion / 2.6：
Conclusions / 2.7：
Related Work / 3：
Hierarchical Image Models / 3.1：
Generic Signal Decompositions / 3.1.1：
Neural Networks / 3.1.2：
Generative Statistical Models / 3.1.3：
Recurrent Models / 3.2：
Models with Lateral Interactions / 3.2.1：
Models with Vertical Feedback / 3.2.2：
Models with Lateral and Vertical Feedback / 3.2.3：
Neural Abstraction Pyramid Architecture / 3.3：
Overview / 4.1：
Hierarchical Network Structure / 4.1.1：
Distributed Representations / 4.1.2：
Local Recurrent Connectivity / 4.1.3：
Iterative Refinement / 4.1.4：
Formal Description / 4.2：
Simple Processing Elements / 4.2.1：
Shared Weights / 4.2.2：
Discrete-Time Computation / 4.2.3：
Various Transfer Functions / 4.2.4：
Example Networks / 4.3：
Local Contrast Normalization / 4.3.1：
Binarization of Handwriting / 4.3.2：
Activity-Driven Update / 4.3.3：
Invariant Feature Extraction / 4.3.4：
Unsupervised Learning / 4.4：
Learning a Hierarchy of Sparse Features / 5.1：
Network Architecture / 5.2.1：
Initialization / 5.2.2：
Hebbian Weight Update / 5.2.3：
Competition / 5.2.4：
Learning Hierarchical Digit Features / 5.3：
Digit Classification / 5.4：
Supervised Learning / 5.5：
Nearest Neighbor Classifier / 6.1：
Decision Trees / 6.1.2：
Bayesian Classifier / 6.1.3：
SupportVectorMachines / 6.1.4：
Bias/Variance Dilemma / 6.1.5：
Feed-Forward Neural Networks / 6.2：
Error Backpropagation / 6.2.1：
Improvements to Backpropagation / 6.2.2：
Regularization / 6.2.3：
Recurrent Neural Networks / 6.3：
Backpropagation through Time / 6.3.1：
Real-Time Recurrent Learning / 6.3.2：
Difficulty of Learning Long-Term Dependencies / 6.3.3：
Random Recurrent Networks with Fading Memories / 6.3.4：
Robust Gradient Descent / 6.3.5：
Applications / 6.4：
Recognition of Meter Values / 7：
Introduction to Meter Value Recognition / 7.1：
Swedish Post Database / 7.2：
Preprocessing / 7.3：
Filtering / 7.3.1：
Normalization / 7.3.2：
Block Classification / 7.4：
NetworkArchitectureandTraining / 7.4.1：
Experimental Results / 7.4.2：
Digit Recognition / 7.5：
Digit Preprocessing / 7.5.1：
Combination with Block Recognition / 7.5.2：
Binarization of Matrix Codes / 7.6：
Introduction to Two-Dimensional Codes / 8.1：
Canada Post Database / 8.2：
Adaptive Threshold Binarization / 8.3：
Image Degradation / 8.4：
Learning Binarization / 8.5：
Learning Iterative Image Reconstruction / 8.6：
Introduction to Image Reconstruction / 9.1：
Super-resolution / 9.2：
NIST Digits Dataset / 9.2.1：
Architecture for Super-resolution / 9.2.2：
Filling-in Occlusions / 9.2.3：
MNIST Dataset / 9.3.1：
Architecture for Filling-in of Occlusions / 9.3.2：
Noise Removal and Contrast Enhancement / 9.3.3：
Reconstruction from a Sequence of Degraded Digits / 9.4.1：
Face Localization / 9.5.1：
Introduction to Face Localization / 10.1：
Face Database and Preprocessing / 10.2：
conclusions / 10.3：
Summary and Conclusions / 11：
Short Summary of Contributions / 11.1：
Future Work / 11.2：
implementation Options / 11.3.1：
Using More Complex Processing Elements / 11.3.2：
Integration into Complete Systems / 11.3.3：
References
Index
Foreword
Preface
Introduction / 1：
35.
図書
Frédéric Geurts
目次情報:
続きを見る
Foreword / Michel Sintzoff
Preface
Prologue: Aims, Themes, and Motivations / 1：
Complex Relational Dynamical Systems / 1.1：
The Context: A First Contact with Dynamical Systems / 1.1.1：
Mutual Exclusion / 1.1.2：
Social Pressure / 1.1.3：
On the Chaotic Demography of Rabbits / 1.1.4：
Tools and Motivations / 1.2：
Overview of the Monograph / 1.3：
Mathematical Framework: Iterated Relations and Composition / Part I：
Dynamics of Relations / 2：
Functional Discrete-Time Dynamical Systems / 2.1：
Relational Dynamical Systems / 2.2：
Point-Level Nondeterministic Dynamics / 2.2.1：
Set-Level Deterministic Dynamics / 2.2.2：
Comparison / 2.2.3：
Preliminary Definitions and Properties / 2.3：
Basic Definitions About Relations / 2.3.1：
Notions from Topology / 2.3.2：
Monotonicity and General Junctivity Properties / 2.3.3：
Fixpoint Theorems / 2.3.4：
Elementary Properties / 2.3.5：
Metric Properties / 2.3.6：
Transfinite Iterations / 2.4：
Motivation / 2.4.1：
Transfinite Fixpoint Theorem / 2.4.2：
Transfinite Limits of Iterations / 2.4.3：
Discussion / 2.5：
Relations vs Functions / 2.5.1：
Set-Level Dynamics and Predicate-Transformers / 2.5.2：
Point-Level Dynamics and Trace Semantics / 2.5.3：
Nondeterminism and Probabilistic Choices / 2.5.4：
Time Structure / 2.5.5：
Dynamics of Composed Relations / 3：
Structural Composition / 3.1：
Composition of Relations / 3.2：
Unary Operators / 3.2.1：
N-Ary Operators / 3.2.2：
Composed Dynamical Systems / 3.2.3：
One-Step Set-Level Evolution of Composed Relations / 3.3：
Point-Level Dynamics of Composed Systems / 3.3.2：
Algebraic Properties of Composition Operators / 3.4：
Composition of Unary Operators / 3.4.1：
Composition of Unary and N-Ary Operators / 3.4.2：
Composition of N-Ary Operators / 3.4.3：
Fixpoint Theory for the Composition / 3.4.4：
Composition Operators / 3.5：
Nondeterminism and Probabilities Revisited / 3.5.2：
Fixpoint Operator and Composition / 3.5.3：
Abstract Complexity: Abstraction, Invariance, Attraction / Part II：
Abstract Observation of Dynamics / 4：
Observation of Systems / 4.1：
Trace-Based Dynamics / 4.2：
Symbolic Observation / 4.3：
Abstraction of Systems / 4.4：
Qualitative Abstract Verification / 4.5：
Observation as Abstraction / 4.6：
Observation and Abstraction: Related Work / 4.7：
Symbolic Dynamics vs Astract Observation / 4.7.2：
Invariance, Attraction, Complexity / 4.7.3：
Invariance / 5.1：
Forward and Backward Invariance / 5.1.1：
Global Invariance / 5.1.2：
Strong Invariance / 5.1.3：
Structure of Invariants / 5.2：
Trace-Parametrized Invariants / 5.2.1：
Fullness and Atomicity / 5.2.2：
Chaos / 5.2.3：
Fullness Implies Trace Chaos / 5.2.4：
Fullness and Atomicity Imply Knudsen Chaos / 5.2.5：
Devaney vs Trace vs Knudsen Chaos / 5.2.6：
Fullness and Atomicity Criteria / 5.3：
Criteria / 5.3.1：
Case Studies: Dyadic Map, Cantor Relation, Logistic Map / 5.3.2：
Attraction / 5.4：
Intuition: From Reachability to Attraction / 5.4.1：
From Weak to Full Attraction / 5.4.2：
A Taxonomy of Attraction / 5.4.3：
Attraction Criteria / 5.5：
Attraction by Invariants / 5.6：
Invariance and Attraction: Related Notions / 5.7：
Energy-Like Functions / 5.7.2：
Dynamical Complexity / 5.7.3：
Abstract Compositional Analysis of Systems: Dynamics and Computations / Part III：
Compositional Analysis of Dynamical Properties / 6：
Aims and Informal Results / 6.1：
Inversion / 6.2：
Restrictions / 6.3：
Domain Restriction / 6.3.1：
Range Restriction / 6.3.2：
Negation / 6.4：
Sequential Composition / 6.5：
Intersection / 6.6：
Union / 6.7：
Products / 6.8：
Free Product / 6.8.1：
Connected Product / 6.8.2：
Combining Union with Free Product / 6.9：
Compositionality: Summary / 6.10：
Limitations and Open Problems / 6.10.2：
Related Work / 6.10.3：
Emergence of Complexity by Structural Composition / 6.10.4：
Case Studies: Compositional Analysis of Dynamics / 7：
A Collection of Complex Behaviors / 7.1：
Smale Horseshoe Map / 7.2：
Cantor Relation / 7.3：
From Cantor Relation to Truncated Logistic Map / 7.4：
Paperfoldings / 7.5：
Introduction / 7.5.1：
Paperfolding Sequences / 7.5.2：
Dynamical Complexity of Paperfoldings / 7.5.3：
Partial Conclusions / 7.5.4：
Discussion: Compositional Dynamical Complexity / 7.6：
Experimental Compositional Analysis of Cellular Automata / 8：
Aims and Motivations: Attraction-Based Classification and Composition / 8.1：
Preliminary Notions / 8.2：
Cellular Automata / 8.2.1：
Transfinite Attraction / 8.2.2：
Shifted Hamming Distance / 8.2.3：
Experimental Classification / 8.3：
Formal Attraction-Based Classification / 8.4：
Type-<$>{\cal N}<$> Cellular Automata / 8.4.1：
Type-<$>{\cal F}<$> Cellular Automata / 8.4.3：
Type-<$>{\cal P}<$> Cellular Automata / 8.4.4：
Type-<$>{\cal S}<$> Cellular Automata / 8.4.5：
Type-<$>{\cal A}<$> Cellular Automata / 8.4.6：
Structural Organizations of CA Classes / 8.4.7：
Motivation: Simulation vs Theoretical Results / 8.5.1：
Linear Periodicity Hierarchy / 8.5.2：
Periodicity Clustering / 8.5.3：
Organization w.r.t. Shifted Hamming Distance / 8.5.4：
Dynamical Complexity in CA / 8.5.5：
Conjectures in CA Composition / 8.6：
Complexity by Composition of Shifts / 8.7：
Rules 2 and 16 / 8.7.1：
A More Precise Conjecture / 8.7.2：
Qualitative Analysis and Complexity Measures / 8.8：
Compositional Analysis of Complex CA / 8.9：
Local Disjunction, Local Union, and Global Union / 8.9.1：
Comparison and Summary of Results / 8.9.2：
Summary and Partial Conclusion / 8.10：
Open Questions / 8.10.2：
Classification: State-of-the-Art / 8.10.3：
Aperiodicity in Cellular Automata / 8.10.4：
Related Work in Composition / 8.10.5：
Compositional Analysis of Computational Properties / 9：
Automata as Dynamical Systems / 9.1：
Comparing Dynamical Systems / 9.2：
Extrinsic Method / 9.2.1：
Intrinsic Method / 9.2.2：
Our Comparison / 9.2.3：
From Locality to Globality / 9.3：
Turing Machines / 9.3.1：
Continuous Functions / 9.3.2：
General Model / 9.3.4：
Comparison Through Simulation / 9.4：
Simulation / 9.4.1：
Choice of Coding / 9.4.2：
From TM to CA / 9.4.3：
From CA to CF / 9.4.4：
Weak Hierarchy / 9.4.5：
Topological and Metric Properties / 9.5：
Continuity / 9.5.1：
Shift-Invariance / 9.5.2：
Lipschitz Property / 9.5.3：
Shift-Vanishing Effect / 9.5.4：
Nondeterminism / 9.5.5：
Summary / 9.5.6：
Computability of Initial Conditions / 9.6：
Hierarchy of Systems / 9.7：
Composition and Computation / 9.8：
Further Work / 9.8.2：
Epilogue: Conclusions and Directions for Future Work / 9.8.3：
Contributions and Related Work / 10.1：
Mathematical Framework / 10.1.1：
Compositional Analysis / 10.1.2：
Directions for Future Research / 10.2：
A Patchwork of Open Technical Issues / 10.2.1：
Fractal Image Compression / 10.2.2：
Distributed Dynamical Optimization / 10.2.3：
Distributed Systems and Self-Stabilization / 10.2.4：
Probabilistic Systems and Measures / 10.2.5：
Higher-Order Systems, Control, and Learning / 10.2.6：
Design of Attraction-Based Systems / 10.2.7：
The Garden of Structural Similarities / 10.3：
Coda: Compositional Complexity Revisited / 10.4：
Bibliography
Glossary of Symbols
Index
Foreword / Michel Sintzoff
Preface
Prologue: Aims, Themes, and Motivations / 1：
36.
図書
Richard Sharp
目次情報:
続きを見る
Introduction / 1：
Hardware Description Languages / 1.1：
Hardware Synthesis / 1.2：
High-Level Synthesis / 1.2.1：
Motivation for Higher Level Tools / 1.3：
Lack of Structuring Support / 1.3.1：
Limitations of Static Scheduling / 1.3.2：
Structure of the Monograph / 1.4：
Related Work / 2：
Verilog and VHDL / 2.1：
The Olympus Synthesis System / 2.2：
The HardwareC Language / 2.2.1：
Hercules / 2.2.2：
Hebe / 2.2.3：
Functional Languages / 2.3：
/?FP: An Algebra for VLSI Specification / 2.3.1：
Embedding HDLs in General-Purpose Functional Languages / 2.3.2：
Term Rewriting Systems / 2.4：
Occam/CSP-Based Approaches / 2.5：
Handel and Handel-C / 2.5.1：
Tangram and Balsa / 2.5.2：
Synchronous Languages / 2.6：
Summary / 2.7：
The SAFL Language / 3：
Motivation / 3.1：
Language Definition / 3.2：
Static Allocation / 3.2.1：
Integrating with External Hardware Components / 3.2.2：
Semantics / 3.2.3：
Concrete Syntax / 3.2.4：
Hardware Synthesis Using SAFL / 3.3：
Automatic Generation of Parallel Hardware / 3.3.1：
Resource Awareness / 3.3.2：
Source-Level Program Transformation / 3.3.3：
Static Analysis and Optimisation / 3.3.4：
Architecture Independence / 3.3.5：
Aside: Dealing with Mutual Recursion / 3.4：
Eliminating Mutual Recursion by Transformation / 3.4.1：
Soft Scheduling / 3.5：
Motivation and Related Work / 4.1：
Translating SAFL to Hardware / 4.1.1：
Soft Scheduling: Technical Details / 4.2：
Removing Redundant Arbiters / 4.2.1：
Parallel Conflict Analysis (PCA) / 4.2.2：
Integrating PCA into the FLaSH Compiler / 4.2.3：
Examples and Discussion / 4.3：
Parallel FIR Filter / 4.3.1：
Shared-Memory Multi-processor Architecture / 4.3.2：
Parallel Tasks Sharing Graphical Display / 4.3.3：
Program Transformation for Scheduling and Binding / 4.4：
High-Level Synthesis of SAFL / 4.5：
FLaSH Intermediate Code / 5.1：
The Structure of Intermediate Grap / 5.1.1：
Translation to Intermediate Code / 5.1.2：
Translation to Synchronous Hardware / 5.2：
Compiling Expressions / 5.2.1：
Compiling Functions / 5.2.2：
Generated Verilog / 5.2.3：
Compiling External Functions / 5.2.4：
Translation to GALS Hardware / 5.3：
A Brief Discussion of Metastability / 5.3.1：
Interfacing between Different Clock Domains / 5.3.2：
Modifying the Arbitration Circuitry / 5.3.3：
Analysis and Optimisation of Intermediate Code / 5.4：
Architecture-Neutral verses Architecture-Specific / 6.1：
Definitions and Terminology / 6.2：
Register Placement Analysis and Optimisation / 6.3：
Sharing Conflicts / 6.3.1：
Technical Details / 6.3.2：
Resource Dependency Analysis / 6.3.3：
Data Validity Analysis / 6.3.4：
Sequential Conflict Register Placement / 6.3.5：
Extending the Model: Calling Conventions / 6.4：
Caller-Save Resource Dependency Analysis / 6.4.1：
Caller-Save Permanisation Analysis / 6.4.2：
Synchronous Timing Analysis / 6.5：
Associated Optimisations / 6.5.1：
Results and Discussion / 6.6：
Register Placement Analysis: Results / 6.6.1：
Synchronous Timing Optimisations: Results / 6.6.2：
Dealing with I/O / 6.7：
SAFL+ Language Description / 7.1：
Channels and Channel Passing / 7.1.1：
The Motivation for Channel Passing / 7.1.3：
Translating SAFL+ to Hardware / 7.2：
Extending Analyses from SAFL to SAFL+ / 7.2.1：
Operational Semantics for SAFL+ / 7.3：
Transition Rules / 7.3.1：
Semantics for Channel Passing / 7.3.2：
Non-determinism / 7.3.3：
Combining Behaviour and Structure / 7.4：
Embedding Structural Expansion in SAFL / 8.1：
Building Combinatorial Hardware in Magma / 8.2.1：
Integrating SAFL and Magma / 8.2.2：
Aside: Embedding Magma in VHDL/Verilog / 8.3：
Transformation of SAFL Specifications / 8.4：
Hardware Software CoDesign / 9.1：
Comparison with Other Work / 9.1.1：
The Stack Machine Template / 9.2：
Stack Machine Instances / 9.2.2：
Compilation to Stack Code / 9.2.3：
The Partitioning Transformation / 9.2.4：
Validity of Partitioning Functions / 9.2.5：
Extensions / 9.2.6：
Transformations from SAFL to SAFL+ / 9.3：
Case Study / 9.4：
The SAFL to Silicon Tool Chain / 10.1：
DES Encrypter/Decrypter / 10.2：
Adding Hardware VGA Support / 10.2.1：
Conclusions and Further Work / 10.3：
Future Work / 11.1：
Appendix
DES Encryption/Decryption Circuit / A：
Transformations to Pipeline DES / B：
A Simple Stack Machine and Instruction Memory / C：
References
Index
Introduction / 1：
Hardware Description Languages / 1.1：
Hardware Synthesis / 1.2：
37.
図書
Gérard Lacoste ... [et al.] (eds.)
目次情報:
続きを見る
The Vision of SEMPER / Part I：
Secure Electronic Commerce / 1：
The Notion of "Electronic Commerce" / 1.1：
Example 1: Shopping over the Internet / 1.1.1：
Example 2: Business-to-Business Commerce / 1.1.2：
What's Special about Electronic Commerce? / 1.2：
Virtuality of Electronic Commerce / 1.2.1：
The Internet as a Hostile Environment / 1.2.2：
Insecure User Equipment / 1.2.3：
New Opportunities to Commit Fraud / 1.2.4：
Existing Approaches to Secure Electronic Commerce / 1.3：
Secure Channels / 1.3.1：
Trusted Market Provider / 1.3.2：
Digital Signatures and Public-Key Infrastructures / 1.3.3：
Payment Systems / 1.3.4：
The Whole Picture of Electronic Commerce / 1.4：
Resulting Goals of SEMPER / 1.5：
Security Requirements / 1.5.1：
The SEMPER Focus / 1.5.2：
Technical Framework / 2：
The SEMPER Model / 2.1：
Approach / 2.2：
Architecture / 2.3：
Protocols and Implementation / 2.4：
Legal Framework / 3：
Introduction / 3.1：
Predictable Liability for Signature Keys / 3.2：
Commitments without Online Third Party / 3.2.1：
Liability-Cover Service / 3.2.2：
Security and Market Effectiveness / 3.2.3：
The SEMPER Electronic-Commerce Agreement / 3.3：
Structure of SECA / 3.3.1：
Introducing Electronic-Commerce Agreements / 3.3.2：
Conclusions / 3.4：
Vision of Future Products / 4：
Four Facets of SEMPER as a Product / 4.1：
SEMPER-based Business Applications / 4.2：
Secure Internet Shopping / 4.2.1：
Person-to-Person Scenario: The Fair Internet Trader / 4.2.2：
Outlook / 4.3：
Project Achievements / Part II：
Organizational Overview / 5：
Structure of SEMPER / 5.1：
Lessons Learned / 5.2：
Initial Education / 5.2.1：
Common Understanding / 5.2.2：
Teams of Individuals, not Organizations / 5.2.3：
Important Concepts / 6：
The Model of Deals, Transfers, and Exchanges / 6.1.1：
Global Security Concepts / 6.1.2：
Security Attributes / 6.1.3：
Transactions, Sessions, Contexts / 6.1.4：
Service Architecture / 6.2：
Business Applications / 6.2.1：
Commerce Layer / 6.2.2：
Transfer-and-Exchange Layer / 6.2.3：
Business-Item Layer / 6.2.4：
Supporting Services / 6.2.5：
Implementation Architecture / 6.3：
Structure of a Block: Manager-Module Concept / 6.3.1：
Communication / 6.3.2：
Business Applications and Browser Integration / 6.3.3：
Prototype / 6.4：
Experiments / 6.5：
Trial Sites and Services / 7.1：
Internal SEMPER Trials / 7.2.1：
Freiburg Basic Trial / 7.2.2：
SME Trials / 7.2.3：
Freiburg SME Trial / 7.2.4：
MOMENTS Trial / 7.2.5：
Trial Implementations / 7.3：
Trial Services / 7.3.1：
Equipment and Set-Up / 7.3.2：
SME Business Applications / 7.3.3：
Trial Participants' Reactions / 7.3.4：
Initializing the SEMPER Software / 7.4.1：
Purse Creation and Management/Payment Options / 7.4.2：
TINGUIN (Trustworthy User Interface) / 7.4.3：
Secure Identification and Document Exchange / 7.4.4：
Service Providers' Reaction / 7.5：
Conclusion / 7.6：
The Fair Internet Trader / 8：
Vision of a Person-to-Person Electronic-Commerce Tool / 8.1：
A New Type of Electronic Commerce / 8.1.1：
The Role of a Tool / 8.1.2：
The FIT from a User Perspective / 8.2：
Overview / 8.2.1：
Negotiation Stage / 8.2.2：
Contract Signing Stage / 8.2.3：
Fulfillment Stage / 8.2.4：
Disputes / 8.2.5：
Internal Design / 8.3：
The Messages Subsystem / 8.3.1：
The Display Subsystem / 8.3.3：
The Flow Subsystem / 8.3.4：
Execution Model / 8.3.5：
The Commerce Layer: A Framework for Commercial Transactions / 8.4：
Technical Approach / 9.1：
The Challenge / 9.1.1：
The Generic Deal Approach / 9.1.2：
Concepts and Architecture / 9.2：
The Commerce-Transaction Service Model / 9.2.1：
Trust Relations / 9.2.2：
Commerce Transaction / 9.2.3：
Commerce Deal / 9.2.4：
The Commerce Service API Access Control / 9.2.5：
Authorization of Commerce Transactions / 9.2.6：
Service Quality Management / 9.2.7：
Design Overview / 9.3：
The Commerce-Layer Use Cases / 9.3.1：
Class Diagram / 9.3.2：
Commerce Transactions / 9.3.3：
Representation of a Commerce Transaction / 9.3.4：
The Downloader / 9.3.5：
Scenarios / 9.3.6：
Using the Commerce Transaction Service / 9.4：
Case Description / 9.4.1：
Definition of Transaction Classes / 9.4.2：
Activation of a Deal / 9.4.3：
Inspection of a Deal / 9.4.4：
Fair Exchange: A New Paradigm for Electronic Commerce / 9.4.5：
Introduction and Overview / 10.1：
Why "Generic" Fair Exchange? / 10.1.1：
Notation and Assumptions / 10.1.2：
Related Work / 10.2：
Certified Mail / 10.2.1：
Contract Signing / 10.2.2：
Fair Purchase / 10.2.3：
Using Transfers and Fair Exchanges / 10.3：
Transfers of Basic Business Items / 10.3.1：
Fair Exchange / 10.3.2：
A Model of Transfers Enabling Fair Exchange / 10.4：
External Verifiability / 10.4.1：
Generatability / 10.4.2：
Revocability / 10.4.3：
Examples / 10.4.4：
Transfer-based Generic Fair Exchange / 10.5：
Exchanging Externally Verifiable and Generatable Items / 10.5.1：
Exchanging Externally Verifiable and Revocable Items / 10.5.2：
Efficiency / 10.5.3：
The SEMPER Fair-Exchange Framework / 10.6：
Class Hierarchy / 10.6.1：
The Transfer-and-Exchange Framework in Action / 10.6.2：
Extending the Transfer-and-Exchange Layer / 10.6.3：
The Payment Framework / 11：
Models of Electronic Payment Systems / 11.1：
Players / 11.2.1：
Payment Models / 11.2.2：
Design of the Framework / 11.3：
Scope / 11.3.1：
Functional Architecture / 11.3.2：
Purses / 11.3.3：
Transactions and Transaction Records / 11.3.5：
Payment Manager / 11.3.6：
Adapting a Payment System / 11.4：
Using the Generic Payment Service Framework / 11.5：
Payment Transactions / 11.5.1：
Special Application Functionality / 11.5.2：
Token-based Interface Definition / 11.6：
Extending the Design / 11.7：
Dispute Management / 11.7.1：
Payment Security Policies / 11.7.2：
Summary / 11.8：
Trust Management in the Certificate Block / 12：
Public-Key Infrastructure / 12.1：
The Need for Trust Management / 12.2：
Specifying Trusted CAs and Acceptable Certificates / 12.2.1：
Selecting Certificates Automatically in a Business Session / 12.2.2：
Design of Policy Management / 12.3：
Maintaining Information about Policies / 12.3.1：
Using Policies / 12.3.2：
Negotiation of Certificates / 12.3.3：
Prototype Implementation / 12.4：
Public-Key Infrastructure in the SEMPER Trials / 12.4.1：
Trust Management / 12.4.2：
Netscape Communicator / 12.5：
Microsoft Internet Explorer / 12.5.2：
Policy Maker / 12.5.3：
Limiting Liability in Electronic Commerce / 13：
Necessity to Limit Liability / 13.1：
Separation Between Digital Signature and Undeniable Commitment / 13.1.2：
Principles and Achievements of the Solution Proposed / 13.1.3：
Description of the Commitment Service / 13.2：
What Exactly is an Undeniable Commitment? / 13.2.1：
Initialization of the Subscriber / 13.2.2：
Key Certificate / 13.2.3：
Key Revocation / 13.2.4：
Commitment Request and Response / 13.2.5：
Validity of the Commitment Certificates / 13.2.6：
Using the Commitment Service as Liability-Cover Service / 13.2.7：
Integration in a Legal Framework / 13.2.8：
Possible Variants and Supplements / 13.3：
Limits / 13.3.1：
Message Flow / 13.3.2：
Combination with "Solvency Service" / 13.3.3：
Recharging Liabilities / 13.3.4：
Several Relying Parties or Beneficiaries / 13.3.5：
Other Kinds of Authorization and Issuance of Commitment Certificates / 13.3.6：
Who is Liable for Failures at the CCA? / 13.4：
Reasons for Merchants to Use the Commitment Service / 13.5：
Chambers of Commerce to Provide the Commitment Service? / 13.5.2：
Reasons for Buyers to Use the Commitment Service / 13.5.3：
Legal Aspects / 14：
Legal Issues in Electronic Commerce / 14.1：
Applicable Law and Jurisdiction / 14.2.1：
Electronic Authentication-Validity of Digital Signatures / 14.2.2：
Proof of Digital Signatures / 14.2.3：
Regulations for Use and Export of Dual-Use Goods / 14.2.4：
Consumer-Protection Laws / 14.2.5：
Privacy and Data Protection / 14.2.6：
Advertising, Competition, Spamming / 14.2.7：
Content of Contracts and Internet Pages / 14.2.8：
Contract Law / 14.2.9：
Copyright and Trademark / 14.2.10：
Payment / 14.2.11：
Taxation / 14.2.12：
Selected Approaches at Legal Frameworks / 14.2.13：
UNCITRAL Model Law on Electronic Commerce / 14.3.1：
Approach of the Commission of the European Community (CEC) / 14.3.2：
OECD Guidelines / 14.3.3：
Utah Digital Signature Act (1996) / 14.3.4：
German Digital Signature Act (1997) / 14.3.5：
Electronic Data Interchange Agreements / 14.3.6：
General / 14.3.7：
SECA CAs / 14.4.2：
SECA Legal Body / 14.4.3：
Joining SECA / 14.4.4：
Liability-Limits in SECA / 14.4.5：
Blacklists of Players Claiming Compromised Keys and Signatures / 14.4.6：
Levels of Equipment / 14.4.7：
The Vision of SEMPER / Part I：
Secure Electronic Commerce / 1：
The Notion of "Electronic Commerce" / 1.1：
38.
図書
Ralf Küsters
目次情報:
続きを見る
Introduction / 1：
Description Logics / 2：
History / 2.1：
Syntax and Semantics of Description Logics / 2.2：
Concept Descriptions / 2.2.1：
Terminologies (TBoxes) / 2.2.2：
World Descriptions (ABoxes) / 2.2.3：
Standard Inferences / 2.3：
Decision Algorithms / 2.4：
Non-Standard Inferences / 3：
LCS and MSC / 3.1：
Definition of LCS and MSC / 3.1.1：
Applications of LCS and MSC / 3.1.2：
Previous Results / 3.1.3：
New Results / 3.1.4：
Matching / 3.2：
Definition of Matching Problems / 3.2.1：
Applications of Matching / 3.2.2：
Solutions of Matching Problems / 3.2.3：
The Underlying Techniques / 3.2.4：
Other Non-Standard Inferences / 3.4：
Characterizing Subsumption / 4：
Subsumption in ALNS / 4.1：
A Graph-Based Characterization of Subsumption / 4.1.1：
A Description-Based Characterization of Subsumption / 4.1.2：
Subsumption in ALE / 4.2：
A Tree-Based Characterization of Subsumption / 4.3.1：
LCS for ALNS-Concept Descriptions / 4.3.2：
The LCS in ALNS / 5.1.1：
The LCS in LS / 5.1.2：
LCS for ALE-Concept Descriptions / 5.2：
Matching in ALNS / 6：
Deciding the Solvability of Matching Problems / 6.1.1：
Computing Minimal i-Complete Sets / 6.1.2：
Computing Minimal d-Complete Sets / 6.1.3：
Deciding the Solvability of Matching / 6.2：
Matching in ALE / 6.2.2：
Matching in EL / 6.3.1：
Equivalence of ALE-Concept Descriptions / 6.3.2：
Deciding the Solvability of Matching in FLE / 6.3.3：
Deciding the Solvability of Matching in ALE / 6.3.4：
Computing i-Minimal Matchers in ALE / 6.3.5：
Computing d-Minimal Matchers in ALE / 6.3.6：
Conclusion / 7：
References
Index
Introduction / 1：
Description Logics / 2：
History / 2.1：
39.
図書
Ralph Bergmann
目次情報:
続きを見る
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：
40.
図書
edited by R. Hettich
目次情報:
続きを見る
Introduction to Microfluidics / Chapter 1：
Abstract
History of Microfluidics / 1.1：
The beginning: Gas chromatography and capillary electrophoresis / 1.2.1：
The microfluidic advantage / 1.2.2：
Modular separation, reaction and hybridization systems / 1.2.3：
Integrated systems / 1.2.4：
Fluidics and Transport Fundamentals / 1.3：
The continuum approximation / 1.3.1：
Laminar flow / 1.3.2：
Diffusion in microfluidic systems / 1.3.3：
Surface forces and droplets / 1.3.4：
Pumps and valves / 1.3.5：
Electrokinetics / 1.3.6：
Thermal management / 1.3.7：
Device Fabrication / 1.4：
Materials / 1.4.1：
Fabrication and assembly / 1.4.2：
Biological Applications / 1.5：
Genetic analysis (DNA/RNA) / 1.5.1：
Proteomics / 1.5.2：
Cellular assays / 1.5.3：
Drug delivery and compatibility / 1.5.4：
The Future / 1.6：
Potential demand/market for microfluidic devices / 1.6.1：
Current products / 1.6.2：
Challenges and the future / 1.6.3：
References
Materials and Microfabrication Processes for Microfluidic Devices / Chapter 2：
Introduction / 2.1：
Silicon Based Materials / 2.2：
Micromachining of silicon / 2.2.1：
Bulk micromachining / 2.2.2：
Surface micromachining / 2.2.3：
Glass Based Materials / 2.3：
Microfabrication in glass / 2.3.1：
Wafer Bonding / 2.4：
Fusion bonding / 2.4.1：
Anodic bonding / 2.4.2：
Adhesive bonding / 2.4.3：
Polymers / 2.5：
Microfabrication / 2.5.1：
Polymer materials / 2.5.2：
Conclusion / 2.6：
Interfacing Microfluidic Devices with the Macro World / Chapter 3：
Typical Requirements for Microfluidic Interfaces / 3.1：
Review of Microfluidic Interfaces / 3.3：
World-to-chip interfaces / 3.3.1：
Chip-to-world interfaces / 3.3.2：
Future Perspectives / 3.4：
Genetic Analysis in Miniaturized Electrophoresis Systems / Chapter 4：
Status of genetic analyses / 4.1：
Genetic analysis by miniaturized electrophoresis system / 4.1.2：
Microchip Electrophoresis for Genomic Analysis / 4.2：
Material and fabrication of electrophoresis microchips / 4.2.1：
Theory of gel electrophoresis of DNA / 4.2.2：
Gel matrices / 4.2.3：
Novel DNA separation strategies on microchips / 4.2.4：
Surface coating methods for microchannel walls / 4.2.5：
Parallelization in Microchip Electrophoresis / 4.3：
Integration in Microchip Electrophoresis for Genetic Analysis / 4.4：
Sample preparation on microchip / 4.4.1：
System integration / 4.4.2：
Commercial Microfluidic Instruments for Genetic Analyses / 4.5：
Commercial microchip electrophoresis instruments for genetic analysis / 4.5.1：
Integrated microfluidic instruments for genetic analyses / 4.5.2：
Microfluidic Markets and Future Perspectives / 4.6：
Microfluidic Systems for Protein Separations / Chapter 5：
Advantages of microfluidic chips for protein separations / 5.1：
Limitations of microfluidic chips in proteomics applications / 5.1.2：
Substrates used for proteomic analysis / 5.1.3：
Microfluidic Chips for Protein Separation / 5.2：
Microchip-based electrophoretic techniques / 5.2.1：
Microchip chromatography / 5.2.2：
Integrated Analysis in Microchips / 5.3：
Integration of sample preparation with analysis / 5.3.1：
Multi-dimensional separation in microchips / 5.3.2：
Chips integrated with mass spectrometry / 5.3.3：
Future Directions / 5.4：
Microfluidic Systems for Cellular Applications / Chapter 6：
Physiological advantages / 6.1：
Biological advantages / 6.1.2：
Economical advantages / 6.1.3：
Microfluidic Technology for Cellular Applications / 6.2：
Microfluidic cell isolation/separation / 6.2.1：
Microfluidic cell culture / 6.2.2：
Microfluidic cell analysis / 6.2.3：
Commercialization of Microfluidic Technology / 6.3：
Concluding Remarks / 6.4：
Microfluidic Systems for Engineering Vascularized Tissue Constructs / Chapter 7：
Generating 2D Vascularized Tissue Constructs Using Microfluidic Systems / 7.1：
Generating 3D Vascularized Tissue Constructs Using Microfluidic Systems / 7.3：
Hydrogel-based Microfluidic Systems for Generating Vascularized Tissue Constructs / 7.4：
Mathematical Modeling to Optimize the Microfluidic Systems for Generating Vascularized Tissue Constructs / 7.5：
Future Challenges / 7.6：
Conclusions / 7.7：
High Throughput Screening Using Microfluidics / Chapter 8：
Cell-Based Assays / 8.1：
High throughput cell culture / 8.2.1：
Cell sorting for high throughput applications / 8.2.2：
Biochemical Assays / 8.3：
PCR / 8.3.1：
Electrophoresis / 8.3.2：
Others / 8.3.3：
Drug Screening Applications / 8.4：
Users and Developers of [mu]F HTS Platforms / 8.5：
Users: Research labs, academic screening facilities, and pharmaceutical / 8.5.1：
Commercialized products in HTS / 8.5.2：
Acknowledgements / 8.6：
Microfluidic Diagnostic Systems for the Rapid Detection and Quantification of Pathogens / Chapter 9：
Infectious pathogens and their prevalence / 9.1：
Traditional pathogen detection methods / 9.1.2：
Microfluidic techniques / 9.1.3：
Review of Research / 9.2：
Pathogen detection/quantification techniques based on detecting whole cells / 9.2.1：
Pathogen detection/quantification techniques based on detecting metabolites released or consumed / 9.2.2：
Pathogen detection/quantification through microfluidic immunoassays and nucleic acid based detection platforms / 9.2.3：
Future Research Directions / 9.3：
Microfluidic Applications in Biodefense / Chapter 10：
Biodefense Monitoring / 10.1：
Civilian biodefense / 10.2.1：
Military biodefense / 10.2.2：
Current Biodefense Detection and Identification Methods / 10.3：
Laboratory detection / 10.3.1：
Field detection / 10.3.2：
Microfluidic Challenges for Advanced Biodefense Detection and Identification Methods / 10.4：
Microscale Sample Preparation Methods / 10.5：
Spore disruption / 10.5.1：
Pre-separations / 10.5.2：
Nucleic acid purifications / 10.5.3：
Immunomagnetic Separations and Immunoassays / 10.6：
Immunomagnetic separations / 10.6.1：
Immunoassays / 10.6.2：
Proteomic Approaches / 10.7：
Nucleic Acid Amplification and Detection Methods / 10.8：
PCR and qPCR detection of pathogens for biodefense / 10.8.1：
Miniaturized and Microfluidic PCR / 10.8.2：
Heating and cooling approaches / 10.8.3：
Miniaturized PCR and qPCR for biodefense / 10.8.4：
Other Nucleic acid amplification methods / 10.8.5：
Microarrays / 10.9：
Microarrays and microfluidics / 10.9.1：
Microelectrophoresis and Biodefense / 10.10：
Microelectrophoresis technologies / 10.10.1：
Integrated lab-on-a-chip systems and biodefense / 10.11：
Full microfluidic integration for biodefense / 10.11.1：
Summary and Perspectives / 10.12：
Current and Future Trends in Microfluidics within Biotechnology Research / Chapter 11：
The Past - Exciting Prospects / 11.1：
The Present - Kaleidoscope-like Trends / 11.2：
Droplet microfluidics / 11.2.1：
Integrating Active Components in Microfluidics / 11.2.2：
Third world - paper microfluidics - George Whitesides / 11.2.3：
Microfluidic solutions for enhancing existing biotechnology platforms / 11.2.4：
Microfluidics for cell biology - seeing inside the cell with molecular probes / 11.2.5：
Microfluidics for cell biology - high throughput platforms / 11.2.6：
The Future - Seamless and Ubiquitous MicroTAS / 11.3：
Index
Introduction to Microfluidics / Chapter 1：
Abstract
History of Microfluidics / 1.1：
41.
図書
Eleftherios Papantonopoulos, editor
目次情報:
続きを見る
Introduction to the AdS/CFT Correspondence / Part I：
Introduction to Anti de Sitter Black Holes / 1：
Spacetimes of Constant Curvature / 1.1：
Spaces of Maximal Symmetry and Constant Curvature / 1.1.1：
Flat Spacetime / 1.1.2：
Anti de Sitter Spacetime / 1.1.3：
Static Black Holes / 1.2：
Basic Properties / 1.2.1：
Thermodynamics / 1.2.2：
Beyond Static Black Holes / 1.3：
References
Perturbations of Anti de Sitter Black Holes / 2：
Introduction / 2.1：
Perturbations / 2.2：
Scalar Perturbations / 2.2.1：
Gravitational Perturbations / 2.2.2：
Electromagnetic Perturbations / 2.2.3：
Hydrodynamics / 2.3：
Vector Perturbations / 2.3.1：
Tensor Perturbations / 2.3.2：
Hydrodynamics on the AdS boundary / 2.3.4：
Conformal Soliton Flow / 2.3.5：
Phase Transitions / 2.4：
K = 0 / 2.4.1：
K = -1 / 2.4.2：
Conclusion / 2.5：
CFTs / 3：
Conformal Algebra / 3.2.1：
Local Field Operators / 3.2.2：
Conformal Correlators / 3.2.3：
AdS/CFT Correspondence / 3.3：
AdS Geometry / 3.3.1：
Partition Function / 3.3.2：
Semi-classical Gravity Limit / 3.3.3：
Large N / 3.4：
SYM from D-Branes / 3.5：
D3-Brane Near Horizon Geometry / 3.5.2：
Strong/Weak Duality / 3.5.3：
Extensions / 3.6：
Holography and the AdS/CFT Correspondence / Part II：
Improved Holographic QCD / 4：
The 5D Model / 4.1：
Scheme Dependence / 4.3：
The Potential and the Parameters of the Model / 4.4：
The Normalization of the Coupling Constant ? / 4.4.1：
The AdS Scale l / 4.4.2：
The UV Expansion Coefficients of V(?) / 4.4.3：
The String Length / 4.4.4：
Integration Constants / 4.4.6：
Latent Heat and Equation of State / 4.5：
Glueball Spectrum / 4.5.2：
Critical Temperature / 4.5.3：
String Tension / 4.5.4：
CP-odd Sector / 4.5.5：
Coupling Normalization / 4.5.6：
Bulk Viscosity / 4.6：
The Holographic Computation / 4.6.1：
The Adiabatic Approximation / 4.6.2：
Buchel's Bound / 4.6.4：
The Drag Force on Strings and Heavy Quarks / 4.7：
The Drag Force / 4.7.1：
The Relativistic Asymptotics / 4.7.2：
The Non-relativistic Asymptotics / 4.7.3：
The Diffusion Time / 4.7.4：
Including the Correction to the Quark Mass / 4.7.5：
Temperature Matching and Diffusion Time Estimates / 4.7.6：
Jet Quenching Parameter / 4.8：
Discussion and Outlook / 4.9：
Drag Force / 4.9.1：
Diffusion Time / 4.9.3：
Jet Quenching / 4.9.4：
The Dynamics of Quark-Gluon Plasma and AdS/CFT / 5：
The AdS/CFT Correspondence / 5.1：
Effective Degrees of Freedom at Strong Coupling / 5.2.1：
Why study N = 4 Plasma? / 5.3：
The AdS/CFT for Studying Real-Time Dynamics of Plasma / 5.4：
Exact Analytical Examples / 5.4.1：
A Case Study: Static Uniform Plasma / 5.5.1：
A Case Study: A Planar Shock Wave / 5.5.2：
Boost-Invariant Flow / 5.6：
Large Proper Time Behaviour / 5.7：
The AdS/CFT Analysis / 5.7.1：
Perfect Fluid Geometry / 5.7.2：
Plasma Dynamics Beyond Perfect Fluid / 5.8：
Interlude: Hydrodynamics Redux / 5.9：
Plasma Dynamics Beyond Hydrodynamics / 5.10：
Dynamics at Small Proper Time / 5.11：
The Absence of a Scaling Variable / 5.11.1：
The Existence of a Regular Initial Condition / 5.11.2：
The Classification of Possible Initial Conditions / 5.11.3：
An Analysis of Some Aspects of the Small Proper Time Behaviour of ?(?) / 5.11.4：
Conclusions / 5.12：
Appendix
Fluid Dynamics from Gravity / 6：
Quantum Gravity / 6.1：
Universal Implications / 6.1.2：
QCD / 6.1.3：
Fluid Dynamics / 6.1.4：
Background / 6.2：
Conformal Fluid Dynamics / 6.2.1：
Gravity in the Bulk / 6.2.2：
Fluid/Gravity Map / 6.2.3：
Construction of Bulk Metric and Boundary Stress Tensor / 6.3：
0th Order / 6.3.1：
1st Order / 6.3.2：
Solution to Second Order / 6.4：
The Spacetime Geometry Dual to Fluids / 6.4.1：
Summary / 6.5：
The Gauge-Gravity Duality and Heavy Ion Collisions / 7：
The Wake of a Quark / 7.1：
Jet Correlations at RHIC / 7.1.1：
A Holographic Computation / 7.1.2：
Entropy Production / 7.2：
AdS/CFT on the Brane / 8：
Braneworlds in AdS Spacetime / 8.1：
RS Models / 8.2.1：
Cosmology / 8.2.2：
View from the Brane / 8.3：
Geometrical Holography / 8.3.1：
Does AdS/CFT Play Any Role in Braneworld? / 8.4：
Single-Brane Model / 8.4.1：
Two-Brane Model / 8.4.2：
Gradient Expansion Method / 8.5：
Single Brane Model (RS2) / 8.6：
Einstein Gravity at Lowest Order / 8.6.1：
AdS/CFT Emerges / 8.6.2：
Two-Brane Model (RS1) / 8.7：
Scalar-Tensor Theory Emerges / 8.7.1：
AdS/CFT in Two-Brane System? / 8.7.2：
The Answers / 8.8：
AdS/CFT in Dilatonic Braneworld / 8.8.1：
Dilatonic Braneworld / 8.9.1：
AdS/Radion Correspondence / 8.9.2：
AdS/CFT and KK Corrections: Single-Brane Cases / 8.9.3：
Condensed Matter and the AdS/CFT Correspondence / 8.10：
Condensed Matter and AdS/CFT / 9：
Model Systems and Their Critical Theories / 9.1：
Coupled Dimer Antiferromagnets / 9.2.1：
Deconfined Criticality / 9.2.2：
Graphene / 9.2.3：
Finite Temperature Crossovers / 9.3：
Quantum Critical Transport / 9.4：
Exact Results for Quantum Critical Transport / 9.5：
Hydrodynamic Theory / 9.6：
Relativistic Magnetohydrodynamics / 9.6.1：
Dyonic Black Hole / 9.6.2：
Results / 9.6.3：
d-wave Superconductors / 9.7：
Dirac Fermions / 9.7.1：
Time-Reversal Symmetry Breaking / 9.7.2：
Nematic Ordering / 9.7.3：
Metals / 9.8：
Field Theories / 9.8.1：
Symmetries / 9.8.2：
Scaling Theory / 9.8.3：
Large N Expansion / 9.8.4：
Introduction to Holographic Superconductors / 9.8.5：
Superconductivity / 10.1：
A Gravitational Dual / 10.2：
Probe Limit / 10.3：
Condensate / 10.3.1：
Conductivity / 10.3.2：
Full Solution with Backreaction / 10.4：
Reformulation of the Conductivity / 10.4.1：
Zero Temperature Limit / 10.5：
Adding Magnetic Fields / 10.5.1：
London Equation / 10.6.1：
Correlation Length / 10.6.2：
Vortices / 10.6.3：
Recent Developments / 10.7：
Conclusions and Open Problems / 10.8：
Open Problems / 10.8.1：
Flavor Superconductivity and Superfluidity / 11：
String Motivation / 11.1：
Condensed Matter Motivation / 11.1.2：
Superconductivity and Holography / 11.2：
Basics of Superconductivity and Our Field Theory Idea / 11.2.1：
Holographic Realization / 11.2.2：
Holographic Setup / 11.3：
Flavor from Intersecting Branes / 11.3.1：
Background and Brane Configuration / 11.3.2：
DBI Action and Equations of Motion / 11.3.3：
D-Brane Thermodynamics and Spectrum / 11.4：
Baryon Chemical Potential / 11.4.1：
Isospin Chemical Potential / 11.4.2：
Instabilities and the New Phase / 11.4.3：
Signatures of Super-Something / 11.5：
Thermodynamics of the Broken Phase / 11.5.1：
Fluctuations in the Broken Phase / 11.5.2：
Conductivity and Spectrum / 11.5.3：
Meissner-Ochsenfeld-Effect / 11.5.4：
Interpretation and Conclusion / 11.6：
String Theory Picture / 11.6.1：
Outlook / 11.6.2：
Holographic Torsion and the Prelude to Kalb-Ramond Superconductivity / 12：
Introduction and Summary of the Results / 12.1：
Torsion as the Non-trivial Magnetic Field of Gravity / 12.2：
Details on the the 3 + 1-Split Formalism / 12.2.1：
The Analog of ?-Angle in Gravity / 12.3.1：
Torsion and the Magnetic Field of Gravity / 12.3.2：
The Nieh-Yan Models / 12.4：
General Aspects / 12.4.1：
The 3 + 1-Split of the Pseudoscalar Nieh-Yan Model / 12.4.2：
The Torsion Domain Wall / 12.5：
The Gravity Dual of Parity Symmetry Breaking / 12.6：
Physics in the Bulk: The Superconductor Analogy / 12.7：
Torsion Domain Wall Versus Abrikosov Vortex / 12.7.1：
Domain Wall Condensation / 12.7.2：
Index / 12.8：
Introduction to the AdS/CFT Correspondence / Part I：
Introduction to Anti de Sitter Black Holes / 1：
Spacetimes of Constant Curvature / 1.1：
42.
図書
edited by Martin Wirsing
出版情報:
Amsterdam ; Tokyo : North-Holland Pub. Co., 1987 xii, 453 p. ; 24 cm
子書誌情報:
loading…
所蔵情報:
loading…
43.
図書
Peter J. Blau
目次情報:
続きを見る
Foreword
Preface
Introduction / Chapter 1：
World of Frictional Phenomena: Great and Small / 1.1：
Historical Background / 1.2：
Traditional Introductions to Solid Friction / 1.3：
Approach of This Book / 1.4：
References
Introductory Mechanics Approaches to Solid Friction / Chapter 2：
Basic Definitions of Friction Quantities / 2.1：
Tipping and Onset of Slip / 2.2：
Introductory Friction Problems / 2.3：
Case 1. Ladder against a Wall / 2.3.1：
Case 2. Speed of a Skier / 2.3.2：
Case 3. Motorcycle Accident / 2.3.3：
Case 4. Angle of Bank to Prevent Sliding of an Automobile on a Curve under Wet or Dry Conditions / 2.3.4：
Case 5. Friction Coefficient Required to Avoid Sliding on an Unbanked Curve in the Road / 2.3.5：
Friction in Simple Machine Components / 2.4：
Wedge-Based Mechanisms / 2.4.1：
Pivots, Collars, and Disks / 2.4.2：
Belts and Ropes / 2.4.3：
Screws / 2.4.4：
Shafts and Journal Bearings / 2.4.5：
Rolling Friction / 2.5：
Friction in Gears / 2.6：
Further Reading
Measuring Friction in the Laboratory / Chapter 3：
Classification of Tribometers / 3.1：
Specimen Preparation and Cleaning / 3.2：
Design and Selection of Friction-Testing Methods / 3.3：
Static Friction / 3.3.1：
Sliding Friction / 3.3.2：
Tests of Flexible Surfaces / 3.3.3：
Standards / 3.3.5：
Specialized Friction Tests for Basic and Applied Research / 3.4：
Nanoscale Friction / 3.4.1：
Microscale Ball-on-Flat Tests / 3.4.2：
Friction of a Fiber within a Composite / 3.4.3：
Multidirectional Tribometers / 3.4.4：
Friction of Impacting Spheres / 3.4.5：
Pendulum-Based Devices / 3.4.6：
Friction Measurement Using Precision Chains / 3.4.7：
Piston Ring and Cylinder Bore Friction / 3.4.8：
Friction of Brake Linings / 3.4.9：
Tire/Road Surface Testing / 3.4.10：
Walkway Friction Testing / 3.4.11：
Metalworking / 3.4.12：
Friction of Rock / 3.4.13：
Friction of Currency / 3.4.14：
Friction Sensing and Recording / 3.5：
Designing Friction Experiments / 3.6：
Appendix
Fundamentals of Sliding Friction / Chapter 4：
Macrocontact, Microcontact, and Nanocontact / 4.1：
Static Friction and Stick-Slip / 4.2：
Models for Sliding Friction / 4.3：
Plowing Models / 4.3.1.1：
Adhesion, Junction Growth, and Shear Models / 4.3.1.2：
Plowing with Debris Generation / 4.3.1.3：
Plowing with Adhesion / 4.3.1.4：
Single-Layer Shear Models / 4.3.1.5：
Multiple-Layer Shear Models / 4.3.1.6：
Molecular Dynamics Models / 4.3.1.7：
Stimulus-Response Dynamical Friction Models / 4.3.1.8：
Ultralow Friction and "Superlubricity" / 4.3.1.9：
Selecting Friction Models / 4.3.1.10：
Phenomenological, Graphical, and Statistical Approaches / 4.3.2：
Friction Models That Include Wear / 4.3.3：
Frictional Heating / 4.4：
Solid Friction of Materials / Chapter 5：
Friction of Wood, Leather, and Stone / 5.1：
Friction of Metals and Alloys / 5.2：
Friction of Glasses and Ceramics / 5.3：
Friction of Polymers / 5.4：
Friction of Carbon Materials Including Diamond / 5.5：
Friction of Ice / 5.6：
Friction of Treated Surfaces / 5.7：
Friction of Particle Aggregates / 5.8：
Lubrication to Control Friction / Chapter 6：
Lubrication by Liquids and Greases / 6.1：
Liquid Lubrication / 6.1.1：
Composition of Liquid Lubricants / 6.1.2：
Friction Polymers / 6.1.2.1：
Lubricating Characteristics of Ultrathin Layers / 6.1.2.2：
Ionic Liquid Lubricants / 6.1.2.3：
Grease Lubrication / 6.1.3：
Liquid Crystal Lubricants / 6.1.3.1：
Lubrication by Solids / 6.2：
Role of Lamellar Crystal Structures / 6.2.1：
Simplified Models for Solid Lubrication / 6.2.2：
Graphite and Molybdenum Disulfide / 6.2.3：
Solid Lubrication by Powders / 6.2.4：
Engineered Self-Lubricating Materials / 6.3：
Effects of Tribosystem Variables on Friction / Chapter 7：
Effects of Surface Finish / 7.1：
Effects of Load and Contact Pressure / 7.2：
Effects of Sliding Velocity / 7.3：
Effects of Type of Sliding Motion / 7.4：
Effects of Temperature / 7.5：
Effects of Surface Films and Chemical Environments / 7.6：
Stiffness and Vibration / 7.7：
Combined Effects of Several Variables / 7.8：
Running-In and Other Friction Transitions / Chapter 8：
Understanding and Interpreting Friction Transitions / 8.1：
Friction Transitions during Running-In / 8.2：
Analysis of Running-In Behavior / 8.2.1：
Modeling of Running-In / 8.2.2：
Monitoring and Developing Running-In Procedures / 8.2.3：
Friction Process Diagrams / 8.2.4：
Fluctuations in Friction Force / 8.2.5：
Applications of Friction Technology / Chapter 9：
Applications in Transportation Systems / 9.1：
Friction in Brakes / 9.1.1：
Brake Materials / 9.1.1.1：
Brake Terminology and Jargon / 9.1.1.2：
Aircraft Brakes / 9.1.1.3：
Friction in Tires / 9.1.2：
Tire Rolling Resistance / 9.1.2.1：
Friction in Internal Combustion Engines / 9.1.3：
Friction in Bearings and Gears / 9.2：
Sliding Bearings / 9.2.1：
Gears / 9.2.2：
Friction in Sliding Seals / 9.3：
Friction in Manufacturing Processes / 9.4：
Friction Cutting / 9.4.1：
Machining of Metals / 9.4.2：
Drawing and Rolling / 9.4.3：
Friction Welding, Friction Stir Processing, and Friction Drilling / 9.4.4：
Friction Welding / 9.4.4.1：
Friction Stir Welding, Friction Stir Processing, and Friction Drilling / 9.4.4.2：
Friction in Biomedical Applications / 9.5：
Friction of Skin / 9.5.1：
Friction in Contact Lenses / 9.5.2：
Friction in Artificial Joints / 9.5.3：
Friction in Stents / 9.5.4：
Other Applications of Friction Science / 9.6：
Friction of Flooring / 9.6.1：
Friction in Cables / 9.6.2：
Friction in Fasteners, Joints, and Belts / 9.6.3：
Friction in Particle Assemblages / 9.6.4：
Friction in Microtribology and Nanotribology / 9.6.5：
Amusement Park Rides / 9.6.6：
Conclusion / 9.7：
Index to Static and Kinetic Friction Coefficients
Subject Index
Foreword
Preface
Introduction / Chapter 1：
44.
図書
von Gustav Ehrismann
45.
図書
Goos, Gerhard, 1937- ; Hartmanis, Juris ; Loeckx, Jacques, 1931-
46.
図書
David J. Duke, Ivan Herman, M. Scott Marshall
目次情報:
続きを見る
PREMO: A Standard for Distributed Multimedia
Introduction / 1.1：
What PREMO Is / 1.1.1：
What PREMO Isn't / 1.1.2：
Formal Description Techniques and PREMO / 1.2：
Structure of the Book / 1.3：
Typographical Conventions / 1.4：
Graphical Conventions / 1.5：
An Overview of PREMO
The Structure of PREMO / 2.1：
The PREMO Object Model / 2.3：
Overview / 2.3.1：
From Language Bindings to Environment Bindings / 2.3.2：
Object References / 2.3.3：
Active Objects / 2.3.4：
Operation Dispatching / 2.3.5：
Attributes / 2.3.6：
Non-object Data Types / 2.3.7：
The Foundation Component / 2.4：
Structures, Services, and Types / 2.4.1：
Inter-Object Communication / 2.4.2：
Synchronization / 2.4.3：
Time / 2.4.4：
Property Management / 2.4.5：
Object Factories / 2.4.6：
The Multimedia Systems Services Component / 2.5：
The Paradigm of Media Networks / 2.5.1：
Virtual Resources / 2.5.2：
Stream Control / 2.5.3：
Virtual Devices / 2.5.4：
Virtual Connections / 2.5.5：
Higher-Levels of Organization: Groups and Logical Devices / 2.5.6：
Working in Unison / 2.5.7：
The Modelling, Rendering, and Interaction Component / 2.6：
Object-Oriented Rendering / 2.6.1：
Primitives / 2.6.2：
Modelling and Rendering Devices / 2.6.3：
Coordination / 2.6.4：
Closing Remarks / 2.7：
The Fundamentals of PREMO
Basic Concepts / 3.1：
PREMO Objects and Object Types / 3.2.1：
Non-object Types / 3.2.2：
Object Identity and Object References / 3.2.4：
Operations / 3.3：
Subtyping / 3.4：
Inheritance / 3.5：
Protected Operations / 3.6：
Operation Selection, and Casting / 3.7：
Operation Request Modes / 3.8：
Exceptions / 3.9：
The Object and Object Reference Lifecycle / 3.10：
The Environment Binding / 3.11：
General Implementation Issues
Implementation Choices / 4.1：
Implementation Language / 4.1.1：
Implementation Environment / 4.1.2：
PREMO Specifications in Java and Java RMI / 4.2：
Constraints on the Specification Details / 4.2.1：
Registering Server Objects / 4.2.2：
PREMO Non-object Types / 5.1：
Basic Data Types / 5.2.1：
Constructed Data Types / 5.2.2：
Top Layer of the PREMO Object Hierarchy / 5.2.3：
The PREMOObject Interface / 5.3.1：
Simple PREMO Objects / 5.3.2：
Event Structures / 5.3.2.1：
Constraint Structures / 5.3.2.2：
Callbacks / 5.3.3：
Enhanced PREMO Objects / 5.3.4：
Enhanced PREMO Objects as Service Objects / 5.3.4.1：
Top Layer of PREMO / 5.3.4.2：
General Utility Objects / 5.4：
Event Management / 5.4.1：
The PREMO Event Model / 5.4.1.1：
The Event Handler Object / 5.4.1.2：
Synchronization Points / 5.4.1.3：
Finite State Machines: Controller Objects / 5.4.2：
Detailed Specification of a Controller / 5.4.2.1：
Activity of Controllers / 5.4.2.2：
Time Objects / 5.4.3：
General Notions / 5.4.3.1：
Specification of the PREMO Time Objects / 5.4.3.2：
Synchronization Facilities / 5.5：
Synchronizable Objects / 5.5.1：
Overview: Event-Based Synchronization / 5.5.1.1：
State Transition Monitoring / 5.5.1.2：
Detailed Specification of the Synchronizable Object / 5.5.1.3：
Synchronizable Objects as Callbacks / 5.5.1.4：
Time and Synchronizable Objects / 5.5.2：
Stop-Watch and Progression / 5.5.2.1：
Time and Progression Space / 5.5.2.2：
Reference Point Specifications in Time / 5.5.2.3：
Combining TimeSynchronizable Objects: Time Slaves / 5.5.3：
Time-Lines / 5.5.4：
Negotiation and Configuration Management / 5.6：
Property Inquiry Objects / 5.6.1：
Constraining Properties / 5.6.3：
Dynamic Change of Properties / 5.6.4：
Interaction among Properties / 5.6.5：
Some Conclusions on the Negotiation Facilities / 5.6.6：
Creation of Service Objects / 5.7：
Generic Factory Objects / 5.7.1：
Factory Finders / 5.7.2：
Use of Factories and Factory Finders / 5.7.3：
Multimedia Systems Services Component
Configuration Objects / 6.1：
Format Objects / 6.2.1：
Transport and Media Stream Protocol Objects / 6.2.2：
Quality of Service Descriptor Objects / 6.2.3：
The StreamControl Object / 6.3：
SyncStreamControl Objects / 6.3.2：
Property Control of Configurations / 6.4：
Resource and Configuration Management / 6.4.2：
Monitoring Resource Behaviour and Quality of Service Violations / 6.4.3：
Configuring Devices / 6.5：
Global Configuration / 6.5.1.1：
Port Configurations / 6.5.1.2：
Examples of Virtual Devices / 6.5.2：
Simple Media Devices / 6.5.2.1：
Transformer Devices / 6.5.2.2：
Detailed Specification of Virtual Connections / 6.6：
Examples of Virtual Connections / 6.6.3：
Multicast Connections / 6.6.4：
Groups / 6.7：
Logical Devices / 6.8：
The Role of Primitives in PREMO / 7.1：
The Hierarchy in Overview / 7.2.2：
Captured Primitives / 7.2.3：
Form Primitives / 7.2.4：
Tactile Primitives / 7.2.5：
Modifier Primitives / 7.2.6：
Wrapper Primitives / 7.2.7：
Tracer Primitives / 7.2.8：
Structured Primitives / 7.2.9：
Aggregate Primitives / 7.2.9.1：
TimeComposite / 7.2.9.2：
Reference Primitives / 7.2.10：
Coordinate Spaces / 7.3：
Coordinate / 7.3.1：
TimeLocation / 7.3.2：
Colour / 7.3.3：
Devices for Modelling, Rendering, and Interaction / 7.4：
MRI_Format / 7.4.1：
Efficiency Measures / 7.4.2：
MRI Device / 7.4.3：
Modeller / 7.4.4：
Renderer / 7.4.5：
MediaEngine / 7.4.6：
Input Devices, and Routing / 7.5：
InputDevice / 7.5.1：
Router / 7.5.2：
The Scene Database / 7.6：
Management / 7.7：
Allocation / 7.7.2：
Detailed Java Specifications of the PREMO Objects / 7.7.3：
Foundation Objects / 8.1：
Enumerations / 8.2.1：
Additional Data Types / 8.2.2：
Top Level of PREMO Hierarchy / 8.2.3：
Structures / 8.2.4：
Controllers / 8.2.5：
Sychronization Objects / 8.2.5.3：
Multimedia Systems Services / 8.2.7：
Structures and Additional Data Types / 8.3.1：
Virtual Resource / 8.3.3：
Virtual Device / 8.3.6：
Group / 8.3.7：
Logical Device / 8.3.9：
Objects for Coordinate Spaces / 8.4：
Coordinate Object / 8.4.1.1：
Colour Object / 8.4.1.2：
TimeLocation Object / 8.4.1.3：
Name Object / 8.4.2：
Objects for Media Primitives / 8.4.3：
Primitive Object / 8.4.3.1：
Captured Object / 8.4.3.2：
Primitives with Spatial and/or Temporal Form / 8.4.3.3：
Form Primitives for Audio Media Data / 8.4.3.4：
Form Primitives for Geometric Media Data / 8.4.3.5：
Primitives for the Modification of Media Data / 8.4.3.6：
Modifier Primitives for Audio Media Data / 8.4.3.7：
Modifier Primitives for Structural Aspects of Media Data / 8.4.3.8：
Modifier Primitives for Visual Aspects of Media Data / 8.4.3.9：
Organising Primitives into Structures / 8.4.3.10：
Organising Media Data within Time / 8.4.3.11：
Objects for Describing Properties of Devices / 8.4.4：
MRI_Format Object / 8.4.4.1：
EfficiencyMeasure Object / 8.4.4.2：
Processing Devices for Media Data / 8.4.5：
MRI_Device Object / 8.4.5.1：
Modeller Object / 8.4.5.2：
Renderer Object / 8.4.5.3：
MediaEngine Object / 8.4.5.4：
Scene Object / 8.4.6：
Objects for Supporting Interaction / 8.4.7：
InputDevice Object / 8.4.7.1：
Router Object / 8.4.7.2：
Coordinator Object / 8.4.8：
Selected Implementation Issues
The PREMO Environment / A.1：
Activity of Objects / A.1.1：
Top Level of the PREMO Hierarchy / A.1.2：
Distribution and the Creation of PREMO Objects / A.1.3：
Specific Part 3 Objects / A.2：
Virtual Connection Objects / A.2.1：
Devices on the Same JVM: Piped Streams / A.2.1.1：
Devices on Different JVM's: Sockets / A.2.1.2：
References / A.2.1.3：
Index
PREMO: A Standard for Distributed Multimedia
Introduction / 1.1：
What PREMO Is / 1.1.1：
47.
図書
Ramjee Prasad
目次情報:
続きを見る
Preface
Acknowledgments
Introduction / Chapter 1：
An Overview / 1.1：
Universal Wireless Personal Communications / 1.2：
UMTS Objectives and Challenges / 1.2.1：
ACTS Program / 1.2.2：
Standardization of UMTS / 1.2.3：
Wireless Broadband Communication Systems / 1.3：
Millimeter Waves / 1.3.1：
Preview of the Book / 1.4：
References
Radio Propagation Aspects / Chapter 2：
Large-Scale Propagation Model / 2.1：
Medium-Scale Propagation Model / 2.3：
Sum of Lognormal Signals / 2.3.1：
Small-Scale Propagation Model / 2.4：
Sum of Exponential Signals / 2.4.1：
Rician Distribution / 2.4.2：
Nakagami Distribution / 2.4.3：
Combined Rayleigh Fading and Lognormal Shadowing / 2.5：
Fading Envelope Statistics / 2.6：
LCR / 2.6.1：
Average Fade Duration / 2.6.2：
Wireless Channel Classification / 2.7：
Coherence Bandwidth and Delay Spread / 2.7.1：
Coherence Time and Doppler Spread / 2.7.2：
Wideband Characteristics / 2.8：
Conclusions / 2.9：
Random Variable Terms / 2.9.1：
Appendix 2A
Cellular Concepts / Chapter 3：
Frequency Reuse / 3.1：
Co-channel Interference / 3.3：
Carrier-to-Interference Ratio / 3.4：
Handover/Handoff Mechanism / 3.5：
Cell Splitting / 3.6：
Types of Cellular Networks / 3.7：
Macrocellular Radio Networks / 3.7.1：
Microcellular Radio Networks / 3.7.2：
Picocellular Radio Networks / 3.7.3：
Macrocellular Systems / Chapter 4：
Co-channel Interference Probability / 4.1：
Rayleigh Fading Only / 4.2.1：
Lognormal Shadowing Only / 4.2.2：
Rayleigh Fading Plus Lognormal Shadowing / 4.2.3：
Reuse Distance / 4.2.4：
Spectrum Efficiency / 4.2.5：
System Bandwidth / 4.2.6：
Correlated Shadowing Signals / 4.2.7：
Sectorized Cell Layouts / 4.3.1：
Co-channel Interference, Thermal, Narrowband and Broadband Man-made Noise / 4.3.2.：
Performance Model / 4.4.1：
Co-channel Interference Plus Narrowband Class A Noise / 4.4.2：
Co-channel Interference Plus Broadband Class B Noise / 4.4.3：
Co-channel Interference and Narrowband Plus Broadband Impulsive Class C Noise / 4.4.4：
Appendix 4A / 4.4.5：
Microcellular Systems / Chapter 5：
CIP / 5.1：
Propagation Model / 5.2.1：
Analytical Model / 5.2.2：
Co-channel Interference, Natural, and Man-made Noise Environment / 5.2.3：
Man-made Noise / 5.3.1：
Microcellular Mobile Radio Systems / 5.3.2：
DPSK Modulation Performance / 5.3.3：
Picocellular Systems / 5.3.4：
Propagation Measurements at 1.9 GHz for Wireless Communications / 6.1：
Propagation Measurements / 6.2.1：
Formulation of CIP / 6.2.2：
Computational Results / 6.2.3：
An Illustration to Evaluate a Picocell / 6.2.4：
Wideband Indoor Channel Measurements at 2.4, 4.75, and 11.5 GHz / 6.2.5：
The Indoor Radio Channel / 6.3.1：
Analytical Model for BEP Evaluation / 6.3.2：
Appendix 6A / 6.3.4：
Appendix 6B
Adaptive Equalization / Chapter 7：
Overview of Adaptive Equalization Techniques / 7.1：
DFE / 7.2.1：
Training Algorithms for Adaptive Equalization / 7.2.2：
Communication System Model / 7.3：
Transmitter / 7.3.1：
Multipath Channel Model / 7.3.2：
Receiver / 7.3.3：
Simulation Results / 7.4：
Description of Simulation / 7.4.1：
Numerical Results / 7.4.2：
Basic CDMA Concepts / 7.5：
Spread-Spectrum Multiple Access / 8.1：
DS / 8.2.1：
FH / 8.2.2：
TH / 8.2.3：
Chirp Spread Spectrum / 8.2.4：
Hybrid Systems / 8.2.5：
Design of Pseudonoise Sequences / 8.3：
Basics / 8.3.1：
PN Codes / 8.3.2：
Random Wave Approximation / 8.3.3：
Multiple Access Protocols / 8.3.4：
Classification of Multiple Access Protocols / 9.1：
Contentionless (Scheduling) Multiple Access Protocols / 9.2.1：
Contention (Random) Multiple Access Protocols / 9.2.2：
CDMA Protocols / 9.2.3：
Some Random Access Protocols / 9.3：
Slotted ALOHA / 9.3.1：
Unslotted Nonpersistent ISMA / 9.3.2：
Slotted Nonpersistent ISMA / 9.3.3：
Slotted 1-Persistent ISMA / 9.3.4：
Slotted ISMA With Collision Detection / 9.3.5：
Capture-Model / 9.4：
Slotted ALOHA With Capture / 9.4.1：
Unslotted Nonpersistent ISMA With Capture / 9.4.2：
Slotted Nonpersistent ISMA With Capture / 9.4.3：
Slotted 1-Persistent ISMA With Capture / 9.4.4：
Slotted Nonpersistent ISMA/CD With Capture / 9.4.5：
Slotted 1-Persistent ISMA/CD With Capture / 9.4.6：
Throughput Analysis Considering Rayleigh Fading, Lognormal Shadowing, and Near-Far Effect / 9.5：
Pure Rayleigh Fading / 9.5.1：
Pure Lognormal Shadowing / 9.5.2：
Combined Rayleigh Fading and Shadowing / 9.5.3：
Combined Shadowing and Near-Far Effect / 9.5.4：
Combined Rayleigh Fading, Shadowing, and Near-Far Effect / 9.5.5：
Comparison Between Slotted ALOHA, CSMA, and ISMA / 9.5.6：
Capture Probability and Throughput Analysis in a Rician/Rayleigh Environment Using BPSK Modulation / 9.6：
Channel Model / 9.6.1：
Capture Probability / 9.6.2：
Random Access Systems With Receiver Capture / 9.6.3：
Error Correction Coding / 9.6.4：
User Data Throughput / 9.6.5：
Cellular DS-CDMA System With Imperfect Power Control and Imperfect Sectorization / 9.6.6：
Cellular DS-CDMA / 9.7.1：
Capacity Analysis / 9.7.2：
Throughput and Delay Analysis / 9.7.3：
Results / 9.7.4：
Conclusions and Recommendations / 9.7.5：
OFDM / Chapter 10：
Concept of Parallel Transmission Scheme / 10.1：
History of OFDM Transmission / 10.3：
Configuration of OFDM Transmission System / 10.4：
Configuration of the Transmitter / 10.4.1：
Configuration of the Receiver / 10.4.2：
BEP / 10.5：
Multicarrier CDMA / 10.6：
DS-CDMA and MC-CDMA Systems / 11.1：
DS-CDMA System / 11.3.1：
MC-CDMA System / 11.3.2：
MC-CDMA System Design / 11.4：
BEP Lower Bound / 11.5：
BEP Lower Bound Equivalence / 11.5.1：
Combination of Time Domain and Multicarrier Modulation / 11.6：
Multicarrier DS-CDMA Scheme / 11.7.1：
MT-CDMA Scheme / 11.7.2：
System Features Comparison / 11.7.3：
Detection Strategies Comparison / 11.7.4：
BEP Comparison / 11.8：
Appendix 11A / 11.9：
Antenna Diversity / Chapter 12：
Antenna / 12.1：
BS Antennas / 12.2.1：
Antennas for Portables / 12.2.2：
Diversity and Combining Techniques / 12.3：
Diversity Techniques / 12.3.1：
Combining Techniques / 12.3.2：
Diversity in a Frequency Nonselective Fading Channel / 12.4：
Switched Diversity and Selection Diversity Output Signals / 12.4.1：
Two-Branch Diversity / 12.4.2：
Multiple Branch Diversity / 12.4.3：
Millimeter-Wave Communications / 12.5：
Frequency Nonselective Channel / 13.1：
Received Power Versus Distance / 13.2.1：
Outage Probability / 13.2.2：
Fade Duration / 13.2.3：
Discussion / 13.2.4：
Frequency Selective Channel / 13.3：
BEP Calculations / 13.3.1：
Influence of T[subscript RMS] on BEP / 13.3.2：
Comparison of PDP Types / 13.3.3：
Dynamic Channel Assignment and DECT / 13.4：
Channel Assignment / 14.1：
The Cellular Concept / 14.2.1：
Channel Allocation Schemes / 14.2.2：
DECT as a DCA-Based Mobile Radio System / 14.2.3：
The Influence of Delay in Channel Assignment Algorithms / 14.2.4：
Channel Scanning Method / 14.3：
Number of Free Channels at Setup / 14.3.2：
The Effect of Delay / 14.3.3：
Handovers / 14.3.4：
Air Interface Multiple Access Schemes for FPLMTS/IMT-2000/UMTS / 14.4：
Spectrum Issues / 15.1：
CDMA-Based Schemes / 15.2：
Carrier Spacing and Chip Rate / 15.2.1：
Modulation and Detection / 15.2.2：
Spreading and Scrambling Codes / 15.2.3：
Multirate / 15.2.4：
Power Control / 15.2.5：
Handover / 15.2.6：
Interfrequency Handover / 15.2.7：
Multiuser Detection and Other Interference Reduction Methods / 15.2.8：
Packet Data / 15.2.9：
TDMA-Based Schemes / 15.3：
Modulation / 15.3.1：
Carrier Spacing and Symbol Rate / 15.3.2：
Burst and Frame Structures / 15.3.3：
Training Sequence Design / 15.3.4：
Radio Resource Management / 15.3.5：
Hybrid CDMA/TDMA / 15.4：
OFDM-Based Schemes / 15.5：
Bandwidth / 15.5.1：
Frame Design / 15.5.2：
Coding, Interleaving, and Frequency Hopping / 15.5.3：
Uplink Synchronization / 15.5.4：
DCA / 15.5.6：
TDD / 15.6：
WBMC / 15.7：
Standardization and Frequency Bands / 16.1：
The Need for High Data Rates / 16.3：
Services and Applications / 16.4：
Antennas and Batteries / 16.5：
Safety Considerations / 16.6：
ATM-Based Wireless (Mobile) Broadband Multimedia Systems / 16.7：
Fragments / 16.7.1：
OFDM-Based Wireless ATM Transmission System / 16.8：
System Configuration / 17.1：
Transmitter Configuration / 17.2.1：
Receiver Configuration / 17.2.2：
SATCOM / 17.3：
Potential Benefits of ATM Over SATCOM / 18.1：
Key Issues With Respect to the Operation of ATM Over SATCOM / 18.1.2：
Understanding the Traffic Profile and Its Relationship to ATM-SATCOM Links / 18.1.3：
Conceptual Analysis of Broadband Networking Via IP/ATM Over EHF SATCOM Using CDMA / 18.2：
The ATM-SATCOM Protocol Stack / 18.2.1：
CDMA for ATM-SATCOM Links / 18.2.2：
Capacity as a Function of the User Service Distribution / 18.2.3：
Error Correction and Control for ATM-SATCOM Links / 18.3：
Performance of TCP/IP Over ATM-SATCOM and Importance of Error Control and Correction / 18.3.1：
A Concept for Error Control and Correction Tailored to Service Class / 18.3.2：
A CPCS-Based Truncated SRQ Protocol for AAL 5 / 18.3.3：
FEC Options for ATM Over SATCOM / 18.3.4：
SATCOM Efficiency / 18.4：
About the Author / 18.5：
Index
Preface
Acknowledgments
Introduction / Chapter 1：
48.
図書
出版情報:
London : Whitaker, c1965-c1986 v. ; 30 cm
子書誌情報:
loading…
所蔵情報:
loading…
49.
図書
Jürgen Lind
目次情報:
続きを見る
Foreword
List of Figures
List of Process Models
Introduction / 1：
Agents, Multiagent Systems and Software Engineering / 2：
Intelligent Agents / 2.1：
What's an Agent, anyway? / 2.1.1：
Roles / 2.1.2：
Architectures / 2.1.3：
Agents, Roles and Architectures / 2.1.4：
Systems of Agents / 2.2：
Interaction / 2.2.1：
The Social Dimension / 2.2.2：
Related Fields in Computer Science / 2.3：
Agent-Oriented Software Engineering / 2.4：
Aspects of Programming Paradigms / 2.4.1：
A Historic Perspective / 2.4.2：
The Bottom Line / 2.4.3：
Where Next? / 2.4.4：
Summary / 2.5：
Basic Concepts in Software Engineering / 3：
Cognitive Aspects of Software Engineering / 3.1：
Basic Human Information Processing / 3.1.1：
Software Engineering as a General Design Task / 3.1.2：
Designs and Models / 3.1.3：
A General Model of Engineering / 3.1.4：
The Basic Engineering Cycle / 3.1.5：
Basic Skills in Software Engineering / 3.1.6：
Requirements for Software Engineering Support / 3.2：
AGeneral Model of Software Engineering / 3.3：
Software Engineering Product Models / 3.4：
AGeneric Product Model / 3.4.1：
Software Blueprints: The Unified Modeling Language / 3.4.2：
Software Engineering Process Models / 3.5：
Classical Process Models / 3.5.1：
Novel Trends in Software Engineering / 3.5.2：
Development Methods for Multiagent Systems / 3.5.3：
Discussion / 3.5.4：
Quality Management and Systematic Learning / 3.6：
The Quality Improvement Paradigm / 3.6.1：
Experience Factory / 3.6.2：
The Conceptual Framework of Massive / 3.7：
The Foundations of Massive / 4.1：
Knowbbles / 4.2：
Views / 4.3：
What and Why? / 4.3.1：
View-Oriented Analysis / 4.3.2：
A View System for Multiagent Systems / 4.3.3：
Iterative View Engineering / 4.4：
Putting It All Together / 4.5：
Massive Views / 4.6：
A Brief Introduction to Train Coupling- and Sharing (TCS) / 5.1：
Environment View / 5.2：
Developers Perspective / 5.2.1：
Systems Perspective / 5.2.2：
Task View / 5.3：
Use Case Analysis / 5.3.1：
Functional Requirements / 5.3.2：
Non functional Requirements / 5.3.3：
Role View / 5.4：
Role Definition / 5.4.1：
Role Assignment / 5.4.2：
Interaction View / 5.5：
Intent Layer / 5.5.1：
Protocol Layer / 5.5.2：
Transport Layer / 5.5.3：
Society View / 5.6：
Characterization of Social Systems / 5.6.1：
Designing Social Systems / 5.6.2：
Architecture View / 5.7：
System Architecture / 5.7.1：
The Architectural Feature Space / 5.7.2：
Agent Architecture / 5.7.3：
System View / 5.8：
User Interface Design / 5.8.1：
Exception Handling / 5.8.2：
Performance Engineering / 5.8.3：
Deployment / 5.8.4：
Further Case Studies / 5.9：
The Teamwork Library / 6.1：
ArchitectureView / 6.1.1：
Personal Travel Assistant: Intermodal Route Planning / 6.1.7：
EnvironmentView / 6.2.1：
Conclusion / 6.2.2：
Toolkits for Agent-Based Applications / A：
SIF / A.1：
ZEUS / A.2：
Swarm / A.3：
Basic Problem Solving Capabilities of TCS Agents / A.4：
Planing Algorithm for a Single Task / B.1：
Plan Integration Operator / B.2：
Decision Functions / B.3：
Plan Execution Simulation / B.4：
Protoz Specification of the Contract-Net Protocol / C：
Bibliography
Glossary
Index
Foreword
List of Figures
List of Process Models
50.
図書
Michael Jaedicke
目次情報:
続きを見る
Introduction / Chapter 1：
ORDBMS: The Next Great Wave / 1.1：
Extensible DBMS / 1.2：
Overview / 1.3：
Background on User-Defined Routines / Chapter 2：
User-Defined Routines / 2.1：
Definition, Implementation, and Execution of New UDR / 2.2：
User-Defined Scalar Functions / 2.2.1：
User-Defined Aggregate Functions / 2.2.2：
User-Defined Table Functions / 2.2.3：
User-Defined Functions and Large Objects / 2.2.4：
Comparison with Stored Procedures / 2.3：
Optimization of Queries with UDF / 2.4：
Parallel Processing of User-Defined Functions / Chapter 3：
Limits of Current ORDBMS / 3.1：
Parallel Processing of UDF / 3.3：
Two Step Parallel Aggregation of UDAF / 3.3.1：
Partitioning Classes and Partitionable Functions / 3.3.2：
Parallel Sorting as a Preprocessing Step for UDAF / 3.3.3：
Extended Syntax for Function Registration / 3.3.4：
Example Applications / 3.4：
The UDAF Most_Frequent / 3.4.1：
The UDSF Running_Average / 3.4.2：
The UDAF Median / 3.4.3：
Further Applications / 3.4.4：
Plausibility Considerations Regarding Performance / 3.5：
Related Work / 3.6：
Summary / 3.7：
Intra-function Parallelism / Chapter 4：
Compose/Decompose Operators for Intra-function Parallelism / 4.1：
Compose/Decompose Operators / 4.2.1：
Extensibility of Compose Operators by Combine Functions / 4.2.2：
Application of Intra-function Parallelism / 4.2.3：
Intra-function Parallelism for Function Pipelines / 4.2.4：
Experimental Performance Study / 4.3：
Experimental Scenario and Implementation / 4.3.1：
Performance Results / 4.3.2：
The Multi-operator Method / 4.4：
Performance Problems with Complex UDF in Current ORDBMS / 5.1：
The PBSM Algorithm as a Sophisticated UDP Implementation / 5.2.1：
The Multi-operator Method as a New Technique to Implement Complex UDF / 5.3：
The Multi-operator Method and Its Benefits / 5.3.1：
A Multi-operator Implementation of the PBSM Algorithm / 5.3.2：
Supporting the Multi-operator Method / 5.4：
Executing Query Execution Plans / 5.4.1：
Example for a Textual Specification of Query Execution Plans / 5.4.2：
Parallel Evaluation / 5.4.3：
Performance Evaluation / 5.5：
Experimental Scenario / 5.5.1：
User-Defined Table Operators / 5.5.2：
A Generalization Relationship for Row Types / 6.1：
Defining and Implementing UDTO / 6.2.2：
The Different Usages of the UDTO Concept / 6.2.3：
Parallel Processing of Procedural UDTO / 6.2.4：
Extension to Multiple Output Tables / 6.2.5：
Example Applications for UDTO / 6.3：
Computing a Spatial Join / 6.3.1：
Different UDTO for the Same Predicate / 6.3.2：
Computing the Median: An Aggregation Operator / 6.3.3：
A UDTO for a Complex Aggregation / 6.3.4：
Association Rule Mining / 6.3.5：
Summary and Conclusions / 6.4：
Implementation of UDTO / Chapter 7：
The MIDAS Prototype / 7.1：
Architectural Overview / 7.2.1：
Query Compilation and Execution / 7.2.2：
The MIDAS System Tables / 7.2.3：
UDSF in MIDAS / 7.2.4：
Implementation of SQL Macros / 7.3：
DDL Statements / 7.3.1：
SQL Macro Expansion in DML Statements / 7.3.2：
Expanding SQL Macros in Preprocessors and Middleware / 7.3.3：
Implementation of Procedural UDTO / 7.4：
Extensions to the SQL Compiler / 7.4.1：
Extensions to the Optimizer and the Parallelizer / 7.4.2：
Extensions to the Scheduler / 7.4.3：
Extensions to the Execution Engine / 7.4.4：
Extensions to Transaction Management / 7.4.5：
Implementation of Input and Output Tables / 7.4.6：
Optimization Issues for UDTO / 7.5：
UDTO and Implied Predicates / 7.5.1：
Estimating Costs and Selectivity of UDTO / 7.5.2：
Application of Traditional Optimization Rules / 7.5.3：
Using UDTO to Generate Alternative Execution Plans for UDF / 7.6：
Evaluation of the Implementation / 7.7：
Evaluation of SQL Macros / 7.7.1：
Evaluation of Procedural UDTO / 7.7.2：
Summary, Conclusions, and Future Work / 7.8：
Conclusions / 8.1：
Future Work / 8.3：
References
Appendix A
The Program sequential_invert / A.1：
The Program parallel_invert / A.2：
The Query Execution Plan for the Spatial Join with SQL Macro / A.3：
Introduction / Chapter 1：
ORDBMS: The Next Great Wave / 1.1：
Extensible DBMS / 1.2：
51.
図書
edited with translation and explanatory notes by S.D. Joshi and J.A.F. Roodbergen
52.
図書
R. Blumenhagen, E. Plauschinn
目次情報:
続きを見る
Introduction / 1：
Basics in Conformal Field Theory / 2：
he Conformal Group / 2.1：
Conformal Invariance / 2.1.1：
Conformal Group in d ? 3 / 2.1.2：
Conformal Group in d ? 2 / 2.1.3：
Primary Fields / 2.2：
The Energy-Momentum Tensor / 2.3：
Radial Quantisation / 2.4：
The Operator Product Expansion / 2.5：
Operator Algebra of Chiral Quasi-Primary Fields / 2.6：
Conformal Ward Identity / 2.6.1：
Two- and Three-Point Functions / 2.6.2：
General Form of the OPE for Chiral Quasi-Primary Fields / 2.6.3：
Normal Ordered Products / 2.7：
The CFT Hilbert Space / 2.8：
Simple Examples of CFTs / 2.9：
The Free Boson / 2.9.1：
The Free Fermion / 2.9.2：
The (b,c) Ghost Systems / 2.9.3：
Highest Weight Representations of the Virasoro Algebra / 2.10：
Correlation Functions and Fusion Rules / 2.11：
Non-Holomorphic OPE and Crossing Symmetry / 2.12：
Fusing and Braiding Matrices / 2.13：
Further Reading
Symmetries of Conformal Field Theories / 3：
Ka?-Moody Algebras / 3.1：
The Sugawara Construction / 3.2：
Highest Weight Representations of Sû(2)k / 3.3：
The Sô(N)1 Current Algebra / 3.4：
The Knizhnik-Zamolodchikov Equation / 3.5：
Coset Construction / 3.6：
W Algebras / 3.7：
Conformal Field Theory on the Torus / 4：
The Modular Group of the Torus and the Partition Function / 4.1：
Examples for Partition Functions / 4.2：
The Free Boson on a circle / 4.2.1：
The Free Boson on a circle of Radius R=?2k / 4.2.3：
The Free Boson Orbifold / 4.2.4：
The Verlinde Formula / 4.3：
The Sû(2)k Partition Functions / 4.4：
Modular Invariants of Virc<1 / 4.5：
The Parafermions / 4.6：
Simple Currents / 4.7：
Additional Topics / 4.8：
Asymptotic Growth of States in RCFTs / 4.8.1：
Dilogarithm Identities / 4.8.2：
Supersymmetric Conformal Field Theory / 5：
N=1 Superconformal Models / 5.1：
N=2 Superconformal Models / 5.2：
Chiral Ring / 5.3：
Spectral Flow / 5.4：
Coset Construction for the N ? 2 Unitary Series / 5.5：
Gepner Models / 5.6：
Massless Models of Gepner Models / 5.7：
Boundary Conformal Field Theory / 6：
The Boson with Boundaries / 6.1：
Boundary Conditions / 6.1.1：
Partition Function / 6.1.2：
Boundary States for the Free Boson / 6.2：
Tree-Level Amplitudes / 6.2.1：
Boundary States for RCFTs / 6.3：
CFTs on Non-Orientable Sufraces / 6.4：
Crosscap States for the Free Boson / 6.5：
Crosscap States for RCFTs / 6.6：
he Orientifold of the Bosonic String / 6.7：
Concluding Remarks
General Books on CFT and String Theory|259
Index
Introduction / 1：
Basics in Conformal Field Theory / 2：
he Conformal Group / 2.1：
53.
図書
edited by Hermann A. Maurer
目次情報:
続きを見る
Preface
Fabrication / Part I：
Introduction / Chapter 1：
What are MEMS? / 1.1：
Why MEMS? / 1.2：
Low cost, redundancy and disposability / 1.2.1：
Favorable scalings / 1.2.2：
How are MEMS made? / 1.3：
Roadmap and perspective / 1.4：
Essay: The Role of Surface to Volume Atoms as Magnetic Devices Miniaturize
The substrate and adding material to it / Chapter 2：
The silicon substrate / 2.1：
Silicon growth / 2.2.1：
It's a crystal / 2.2.2：
Miller indices / 2.2.3：
It's a semiconductor / 2.2.4：
Additive technique: Oxidation / 2.3：
Growing an oxide layer / 2.3.1：
Oxidation kinetics / 2.3.2：
Additive technique: Physical vapor deposition / 2.4：
Vacuum fundamentals / 2.4.1：
Thermal evaporation / 2.4.2：
Sputtering / 2.4.3：
Other additive techniques / 2.5：
Chemical vapor deposition / 2.5.1：
Electrodeposition / 2.5.2：
Spin casting / 2.5.3：
Wafer bonding / 2.5.4：
Essay: Silicon Ingot Manufacturing
Creating and transferring patterns-Photolithography / Chapter 3：
Keeping it clean / 3.1：
Photoresist / 3.3：
Positive resist / 3.3.1：
Negative resist / 3.3.2：
Working with resist / 3.4：
Applying photoresist / 3.4.1：
Exposure and pattern transfer / 3.4.2：
Development and post-treatment / 3.4.3：
Masks / 3.5：
Resolution / 3.6：
Resolution in contact and proximity printing / 3.6.1：
Resolution in projection printing / 3.6.2：
Sensitivity and resist profiles / 3.6.3：
Modeling of resist profiles / 3.6.4：
Photolithography resolution enhancement technology / 3.6.5：
Mask alignment / 3.6.6：
Permanent resists / 3.7：
Essay: Photolithography-Past, Present and Future
Creating structures-Micromachining / Chapter 4：
Bulk micromachining processes / 4.1：
Wet chemical etching / 4.2.1：
Dry etching / 4.2.2：
Surface micromachining / 4.3：
Surface micromachining processes / 4.3.1：
Problems with surface micromachining / 4.3.2：
Lift-off / 4.3.3：
Process integration / 4.4：
A surface micromachining example / 4.4.1：
Designing a good MEMS process flow / 4.4.2：
Last thoughts / 4.4.3：
Essay: Introduction to MEMS Packaging
Solid mechanics / Chapter 5：
Fundamentals of solid mechanics / 5.1：
Stress / 5.2.1：
Strain / 5.2.2：
Elasticity / 5.2.3：
Special cases / 5.2.4：
Non-isotropic materials / 5.2.5：
Thermal strain / 5.2.6：
Properties of thin films / 5.3：
Adhesion / 5.3.1：
Stress in thin films / 5.3.2：
Peel forces / 5.3.3：
Applications / Part II：
Thinking about modeling / Chapter 6：
What is modeling? / 6.1：
Units / 6.2：
The input-output concept / 6.3：
Physical variables and notation / 6.4：
Preface to the modeling chapters / 6.5：
MEMS transducers-An overview of how they work / Chapter 7：
What is a transducer? / 7.1：
Distinguishing between sensors and actuators / 7.2：
Response characteristics of transducers / 7.3：
Static response characteristics / 7.3.1：
Dynamic performance characteristics / 7.3.2：
MEMS sensors: principles of operation / 7.4：
Resistive sensing / 7.4.1：
Capacitive sensing / 7.4.2：
Piezoelectric sensing / 7.4.3：
Resonant sensing / 7.4.4：
Thermoelectric sensing / 7.4.5：
Magnetic sensing / 7.4.6：
MEMS actuators: principles of operation / 7.5：
Capacitive actuation / 7.5.1：
Piezoelectric actuation / 7.5.2：
Thermo-mechanical actuation / 7.5.3：
Thermo-electric cooling / 7.5.4：
Magnetic actuation / 7.5.5：
Signal conditioning / 7.6：
A quick look at two applications / 7.7：
RF applications / 7.7.1：
Optical applications / 7.7.2：
Piezoresistive transducers / Chapter 8：
Modeling piezoresistive transducers / 8.1：
Bridge analysis / 8.2.1：
Relating electrical resistance to mechanical strain / 8.2.2：
Device case study: Piezoresistive pressure sensor / 8.3：
Capacitive transducers / Chapter 9：
Capacitor fundamentals / 9.1：
Fixed-capacitance capacitor / 9.2.1：
Variable-capacitance capacitor / 9.2.2：
An overview of capacitive sensors and actuators / 9.2.3：
Modeling a capacitive sensor / 9.3：
Capacitive half-bridge / 9.3.1：
Conditioning the signal from the half-bridge / 9.3.2：
Mechanical subsystem / 9.3.3：
Device case study: Capacitive accelerometer / 9.4：
Piezoelectric transducers / Chapter 10：
Modeling piezoelectric materials / 10.1：
Mechanical modeling of beams and plates / 10.3：
Distributed parameter modeling / 10.3.1：
Statics / 10.3.2：
Bending in beams / 10.3.3：
Bending in plates / 10.3.4：
Case study: Cantilever piezoelectric actuator / 10.4：
Thermal transducers / Chapter 11：
Basic heat transfer / 11.1：
Conduction / 11.2.1：
Convection / 11.2.2：
Radiation / 11.2.3：
Case study: Hot-arm actuator / 11.3：
Lumped element model / 11.3.1：
Distributed parameter model / 11.3.2：
FEA model / 11.3.3：
Essay: Effect of Scale on Thermal Properties
Introduction to microfluidics / Chapter 12：
Basics of fluid mechanics / 12.1：
Viscosity and flow regimes / 12.2.1：
Entrance lengths / 12.2.2：
Basic equations of fluid mechanics / 12.3：
Conservation of mass / 12.3.1：
Conservation of linear momentum / 12.3.2：
Conservation equations at a point: Continuity and Navier-Stokes equations / 12.3.3：
Some solutions to the Navier-Stokes equations / 12.4：
Couette flow / 12.4.1：
Poiseuille flow / 12.4.2：
Electro-osmotic flow / 12.5：
Electrostatics / 12.5.1：
Ionic double layers / 12.5.2：
Navier-Stokes with a constant electric field / 12.5.3：
Electrophoretic separation / 12.6：
Essay: Detection Schemes Employed in Microfluidic Devices for Chemical Analysis
Microfabrication laboratories / Part III：
Hot-arm actuator as a hands-on case study / Chapter 13：
Overview of fabrication of hot-arm actuators / 13.2：
Cleanroom safety and etiquette / 13.3：
Experiments / 13.4：
Wet oxidation of a silicon wafer / Experiment 1：
Photolithography of sacrificial layer / Experiment 2：
Depositing metal contacts with evaporation / Experiment 3：
Wet chemical etching of aluminum / Experiment 4：
Plasma ash release / Experiment 5：
Characterization of hot-arm actuators / Experiment 6：
Notation / Appendix A：
Periodic table of the elements / Appendix B：
The complimentary error function / Appendix C：
Color chart for thermally grown silicon dioxide / Appendix D：
Glossary
Subject Index
Preface
Fabrication / Part I：
Introduction / Chapter 1：
54.
図書
P.E. Conner
目次情報:
続きを見る
Fundamentals of Micromachined Vibratory Gyroscopes / Part I：
Introduction / 1：
The Coriolis Effect / 1.1：
Gyroscopes / 1.2：
The MEMS Technology / 1.3：
Micromachined Vibratory Rate Gyroscopes / 1.4：
Applications of MEMS Gyroscopes / 1.5：
Gyroscope Performance Specifications / 1.6：
A Survey of Prior Work on MEMS Gyroscopes / 1.7：
The Robustness Challenge / 1.8：
Inherently Robust Systems / 1.9：
Overview / 1.10：
Fundamentals of Micromachined Gyroscopes / 2：
Dynamics of Vibratory Rate Gyroscopes / 2.1：
Linear Gyroscope Dynamics / 2.1.1：
Torsional Gyroscope Dynamics / 2.1.2：
Resonance Characteristics / 2.2：
Drive-Mode Operation / 2.3：
The Coriolis Response / 2.4：
Mode-Matching and [delta]f / 2.4.1：
Phase Relations and Proof-Mass Trajectory / 2.4.2：
Summary / 2.5：
Fabrication Technologies / 3：
Microfabrication Techniques / 3.1：
Photolithography / 3.1.1：
Deposition / 3.1.2：
Etching / 3.1.3：
Wafer Bonding / 3.1.4：
Bulk Micromachining Processes / 3.2：
SOI-Based Bulk Micromachining / 3.2.1：
Silicon-on-Glass Bulk Micromachining / 3.2.2：
Surface-Micromachining Processes / 3.3：
Combined Surface-Bulk Micromachining / 3.4：
CMOS Integration / 3.5：
Hybrid Integration / 3.5.1：
Monolithic Integration / 3.5.2：
Packaging / 3.6：
Wafer-Level Packaging / 3.6.1：
Vacuum Packaging / 3.6.2：
Mechanical Design of MEMS Gyroscopes / 3.7：
Mechanical Structure Designs / 4.1：
Linear Vibratory Systems / 4.2：
Linear Suspension Systems / 4.2.1：
Linear Flexure Elements / 4.2.2：
Torsional Vibratory Systems / 4.3：
Torsional Suspension Systems / 4.3.1：
Torsional Flexure Elements / 4.3.2：
Anisoelasticity and Quadrature Error / 4.4：
Quadrature Compensation / 4.4.1：
Damping / 4.5：
Viscous Damping / 4.5.1：
Viscous Anisodamping / 4.5.2：
Intrinsic Structural Damping / 4.5.3：
Material Properties of Silicon / 4.6：
Design for Robustness / 4.7：
Yield / 4.7.1：
Vibration Immunity / 4.7.2：
Shock Resistance / 4.7.3：
Temperature Effects / 4.7.4：
Electrical Design of MEMS Gyroscopes / 4.8：
Basics of Capacitive Electrodes / 5.1：
Electrostatic Actuation / 5.3：
Variable-Gap Actuators / 5.3.1：
Variable-Area Actuators / 5.3.2：
Balanced Actuation / 5.3.3：
Capacitive Detection / 5.4：
Variable-Gap Capacitors / 5.4.1：
Variable-Area Capacitors / 5.4.2：
Differential Sensing / 5.4.3：
Capacitance Enhancement / 5.5：
Gap Reduction by Fabrication / 5.5.1：
Post-Fabrication Capacitance Enhancement / 5.5.2：
MEMS Gyroscope Testing and Characterization / 5.6：
Frequency Response Extraction / 5.6.1：
Capacitive Sense-Mode Detection Circuits / 5.6.2：
Rate-Table Characterization / 5.6.3：
Structural Approaches to Improve Robustness / 5.7：
Linear Multi-DOF Architecture / 6：
Fundamentals of 2-DOF Oscillators / 6.1：
The 2-DOF Sense-Mode Architecture / 6.3：
Gyroscope Dynamics / 6.3.1：
Coriolis Response / 6.3.2：
Illustrative Example / 6.3.3：
Conclusions on the 2-DOF Sense-Mode Architecture / 6.3.4：
The 2-DOF Drive-Mode Architecture / 6.4：
Dynamical Amplification in the Drive-Mode / 6.4.1：
Conclusions on the 2-DOF Drive-Mode Architecture / 6.4.3：
The 4-DOF System Architecture / 6.5：
Dynamics of the 4-DOF Gyroscope / 6.5.1：
Parameter Optimization / 6.5.3：
Conclusions on the 4-DOF System Architecture / 6.5.4：
Demonstration of 2-DOF Oscillator Robustness / 6.6：
Torsional Multi-DOF Architecture / 6.7：
Torsional 3-DOF Gyroscope Structure and Theory of Operation / 7.1：
Cross-Axis Sensitivity / 7.2.1：
Illustration of a MEMS Implementation / 7.3：
Suspension Design / 7.3.1：
Finite Element Analysis / 7.3.2：
Optimization of System Parameters / 7.3.3：
Sensitivity and Robustness Analyses / 7.3.5：
Experimental Characterization / 7.4：
Distributed-Mass Architecture / 7.5：
The Approach / 8.1：
Wide-Bandwidth Operation for Improving Robustness / 8.2.1：
Theoretical Analysis of the Trade-offs / 8.3：
Prototype Design / 8.4：
Experimental Characterization Results / 8.4.2：
Conclusions and Future Trends / 8.5：
Comparative Analysis of the Presented Concepts / 9.1：
2-DOF Oscillator in the Sense-Mode / 9.2.1：
2-DOF Oscillator in the Drive-Mode / 9.2.2：
Multiple Drive-Mode Oscillators / 9.2.3：
Demonstration of Improved Robustness / 9.3：
Temperature Dependence of Drive and Sense-Modes / 9.3.1：
Rate-Table Characterization Results / 9.3.2：
Comparison of Response with a Conventional Gyroscope / 9.3.3：
Scale Factor Trade-off Analysis / 9.4：
Future Trends / 9.5：
Anti-Phase 2-DOF Sense Mode Gyroscope / 9.5.1：
2-DOF Sense Mode Gyroscope with Scalable Peak Spacing / 9.5.2：
Conclusion / 9.6：
References
Index
Fundamentals of Micromachined Vibratory Gyroscopes / Part I：
Introduction / 1：
The Coriolis Effect / 1.1：
55.
図書
edited by D. F. Gray and J. L. Linsky
目次情報:
続きを見る
Introduction / 1：
Continuous-Rate Packet-Switched Networks / 1.1：
Tiered-Service Networks / 1.2：
Multi-Tiered Pricing Schemes / 1.3：
Theory / Part I：
The Directional p-Median Problem: Definition and Applications / 2：
The p-Median Problem / 2.1：
Continuous vs. Discrete Space / 2.1.1：
A New Notion of Distance: The Directional Distance Metric / 2.2：
Summary of Complexity Results / 2.3：
Applications / 2.4：
Bandwidth Tiered Service: Deterministic Demands / 3：
Bandwidth Tiered Service as a DPM1 Problem / 3.1：
A Linear Complexity Algorithm of DPM1 / 3.2：
Graph Representation of DPM1 / 3.2.1：
Monge Condition and Totally Monotone Matrices / 3.2.2：
Efficient Dynamic Programming Algorithm for DPM1 / 3.2.3：
Impact of Tiered Service on Network Resources / 3.3：
Joint Optimization of the Number and Magnitude of Service Tiers / 3.4：
Bandwidth Tiered Service: TDM Emulation / 4：
TDM Emulation As A Constrained DPM1 Problem / 4.1：
Optimal Solution to TDM-DPM1 for Fixed / 4.1.1：
The Behavior Of The TDM-DPM1 Objective Function / 4.1.2：
An Exhaustive Search Algorithm for TDM-DPM1 / 4.1.3：
Optimization Heuristics / 4.1.4：
Performance Evaluation / 4.2：
Algorithm Comparison / 4.2.1：
Impact on the Network Provider: Bandwidth Penalty Due to TDM Emulation / 4.2.2：
Impact on Users: Blocking Probability / 4.2.3：
Bandwidth Tiered Service: Stochastic Demands / 5：
The Stochastic Directional p-Median Problem / 5.1：
Optimal Solution Through Nonlinear Programming / 5.2：
Example: Solution for the Uniform Demand Distribution / 5.2.1：
Example: Solution for the Increasing Demand Distribution / 5.2.2：
An Efficient Approximate Solution / 5.3：
An Approximate Formulation of SDPM1 / 5.3.1：
Optimal Solution to Approximate-SDPM1 / 5.3.2：
Convergence of the Approximate Solution / 5.3.3：
Tiered Structures for Multiple Services / 6：
The Directional p-Median Problem on the Plane / 6.1：
Heuristic Algorithms for Discrete-PM2 / 6.2：
Effect of Distance Properties on Computational Effort / 6.2.1：
Teitz and Bart (TB) Vertex Substitution Heuristic / 6.2.2：
The Global/Regional Interchange Algorithm (GRIA) / 6.2.3：
Heuristic Concentration (HC) / 6.2.4：
A Decomposition Heuristic for DPM2 / 6.3：
Evaluation of the Decomposition Heuristic / 6.3.1：
The Class of Strictly Dominating Solutions for DPM2 / 6.4：
Economics / Part II：
Economic Model for Bandwidth Tiered Service / 7：
Pricing of Internet Services / 7.1：
The Network Context / 7.2：
Economic Model for Sizing of Service Tiers / 7.3：
Maximization of Expected Surplus / 7.3.1：
Solution Through Nonlinear Programming / 7.3.2：
Optimizing the Number of Service Tiers / 7.3.3：
Optimal Pricing Based on Nash Bargaining / 7.4：
The Single Tier Case / 7.4.1：
The Multiple Tier Case / 7.4.2：
Optimal Sizing of Service Tiers / 7.5：
Optimal Pricing of Service Tiers / 7.5.3：
Accounting for the Cost of Service Tiers / 7.5.4：
Service Tiering As A Market Segmentation Strategy / 8：
Economic Model of User Diversity / 8.1：
The Multiple Tier Case: Market Segmentation / 8.2：
The MAX-S Problem with Fixed Tiers / 8.3.1：
Approximate Solution to the MAX-S Problem / 8.3.2：
Tier Structure Comparison / 8.4：
Tiered Service Bundling Under Budget Constraints / 9：
Economic Model of Service Bundling / 9.1：
Approximate Solution to the MAX-ES-2D Problem / 9.2：
The Fixed Tier Case / 9.2.1：
Cost Minimization on an Indifference Curve / 9.2.2：
Joint Optimization of Service Tiers and Prices / 9.2.3：
Quality of Service (QoS) / 9.3：
Packet Scheduling / 10：
Scheduling Objectives and Requirements / 10.1：
Packet Scheduling Disciplines / 10.2：
Timestamp-Based Schedulers / 10.2.1：
Frame-Based Schedulers / 10.2.2：
Hybrid Schedulers / 10.2.3：
Tiered-Service Fair Queueing (TSFQ) / 11：
Logical Operation / 11.1：
Virtual Time Computation / 11.1.2：
Intra-Tier Scheduler: The Fixed-Size Packet Case / 11.2：
Queue Structure and Operation / 11.2.1：
Intra-Tier Scheduler: The Variable-Size Packet Case / 11.3：
Queue Structure and Operations / 11.3.1：
Packet Sorting Operations / 11.3.2：
Elimination of Packet Sorting Operations / 11.3.3：
Experimental Evaluation of TSFQ / 11.4：
Testbed and Experimental Setup / 11.4.1：
Performance Results / 11.4.2：
References
Index
Introduction / 1：
Continuous-Rate Packet-Switched Networks / 1.1：
Tiered-Service Networks / 1.2：
56.
図書
Michael Beetz
目次情報:
続きを見る
Introduction / 1：
The Challenges of Controlling Robot Office Couriers / 1.1：
The Control Problem / 1.2：
The Computational Model / 1.3：
An Adaptive Robotic Office Courier / 1.4：
Previous Work / 1.5：
Descriptive Models of Everyday Activity / 1.5.1：
Computational Models of Everyday Activity / 1.5.2：
Contributions / 1.6：
Overview / 1.7：
Overview of the Control System / 2：
Abstract Models of Robotic Agents / 2.1：
The Dynamic System Model / 2.1.1：
Autonomous Robots as Rational Agents / 2.1.2：
The BDI Model of Rational Agents / 2.1.3：
Discussion of Our Robotic Agent Model / 2.1.4：
The Environment Maps / 2.2：
The Computational Structure of the Control System / 2.3：
The Functional Layer / 2.3.1：
The "Robotic Agent" Abstract Machine / 2.3.2：
The Structured Reactive Controller / 2.3.3：
Plan Representation for Robotic Agents / 3：
Low -Level Integration of Mechanisms / 3.1：
Navigation / 3.1.1：
Communication Mechanisms / 3.1.2：
Execution Time Planning / 3.1.3：
Image Processing / 3.1.4：
Summary of Low -Level Integration / 3.1.5：
Low -Level Plans / 3.2：
Low -Level Navigation Plans / 3.2.1：
Low -Level Image Processing Plans / 3.2.2：
Low -Level Conversational Plans / 3.2.3：
Task-Specific Low -Level Plans / 3.2.4：
Summary of Low -Level Plans / 3.2.5：
Structured Reactive Plans / 3.3：
Properties of SRCs and Their Sub-plans / 3.3.1：
High-Level Navigation Plans / 3.3.2：
Structured Reactive Plans for Other Mechanisms / 3.3.3：
The Plan Adaptation Framew ork / 3.4：
Properties of Revision Rules and Revisable Plans / 3.4.1：
Revision Rules / 3.4.2：
Related Work on Plan Representation / 3.5：
Discussion / 3.6：
Probabilistic Hybrid Action Models / 4：
Projecting Delivery Tour Plans / 4.1：
Modeling Reactive Control Processes and Continuous Change / 4.2：
Probabilistic, Totally-Ordered Temporal Projection / 4.3：
Probabilistic Temporal Rules for PHAMs / 4.3.1：
Properties of PHAMs / 4.3.2：
The Implementation of PHAMs / 4.4：
Projection with Adaptive Causal Models / 4.4.1：
Endogenous Event Scheduler / 4.4.2：
Projecting Exogenous Events, Passive Sensors, and Obstacle Avoidance / 4.4.3：
Probabilistic Sampling-Based Projection / 4.4.4：
Evaluation / 4.5：
Generality / 4.5.1：
Scaling Up / 4.5.2：
Qualitatively Accurate Predictions / 4.5.3：
Related Work on Temporal Projection / 4.6：
LearningStructured Reactive Navigation Plans / 4.7：
Navigation Planning as a Markov Decision Problem / 5.1：
An Overviewon XfrmLearn / 5.2：
Structured Reactive Navigation Plans / 5.3：
XfrmLearn in Detail / 5.4：
The "Analyze" Step / 5.4.1：
The "Revise" Step / 5.4.2：
The "Test" Step / 5.4.3：
Experimental Results / 5.5：
The First Learning Experiment / 5.5.1：
The Second Learning Experiment / 5.5.2：
Discussion of the Experiments / 5.5.3：
Related Work on Learning Robot Plans / 5.6：
Plan-Based Robotic Agents / 5.7：
A Robot Office Courier / 6.1：
The Plans of the Robot Courier / 6.1.1：
Plan Adaptors of the Robot Courier / 6.1.2：
Probabilistic Prediction-Based Schedule Debugging / 6.1.3：
Demonstrations and Experiments / 6.1.4：
Prediction-Based Plan Management / 6.1.5：
A Robot Museums Tourguide / 6.2：
The Plans of the Tourguide Robot / 6.2.1：
Learning Tours and Tour Management / 6.2.2：
Demonstrations of the Tourguide Robot / 6.2.3：
A Robot Party Butler / 6.3：
Demonstrations of Integrated Mechanisms / 6.4：
Communication / 6.4.1：
Resource-Adaptive Search / 6.4.2：
Active Localization / 6.4.4：
Related Work on Plan-Based Robotic Agents / 6.5：
XAVIER / 6.5.1：
CHIP / 6.5.2：
Flakey / 6.5.3：
An Architecture for Autonomy / 6.5.4：
Remote Agent / 6.5.5：
Conclusions / 6.6：
Bibliography
Introduction / 1：
The Challenges of Controlling Robot Office Couriers / 1.1：
The Control Problem / 1.2：
57.
図書
O.I. Franksen, P. Falster, F.J. Evans
目次情報:
続きを見る
Introduction / 1：
Marginal Models for Categorical Data / 1.1：
Historical and Comparable Approaches / 1.2：
Coefficients for the Comparsion of Marginal Distributions / 1.3：
Measuring Differences in Location / 1.3.1：
Measuring Differences in Dispersion / 1.3.2：
Measuring Association / 1.3.3：
Measuring Agreement / 1.3.4：
Loglinear Marginal Models / 2：
Ordinary Loglinear Models / 2.1：
Basic Concepts and Notation / 2.1.1：
Modeling Association Among Three Variables / 2.1.2：
Applications of Loglinear Marginal Models / 2.2：
Research Questions and Designs Requiring Marginal Models / 2.2.1：
Comparing One Variable Distributions / 2.2.2：
More Complex Designs and Research Questions / 2.2.3：
Maximum Likelihood Inference for Loglinear Marginal Models / 2.3：
Sampling Methods / 2.3.1：
Specifying Loglinear Marginal Models by Constraining the Cell Probalities / 2.3.2：
Simultaneous Modeling of Joint and Marginal Distributions: Redundancy, Incompatibility and Other Issues / 2.3.3：
***Maximum Likelihood Estimates of Constrained Cell Probabilities / 2.3.4：
***A Numerical Algorithm for ML Estimation / 2.3.5：
***Efficient Computation of ML Estimates for Simultaneous Joint and Marginal Models / 2.3.6：
***Large Sample Distribution of ML estimates / 2.3.7：
Model Evaluation / 2.3.8：
Nonloglinear Marginal Models / 3：
Comparing Item Characteristics for Different Measurement Levels / 3.1：
Interval Level of Measurement / 3.1.1：
Ordinal Level of Measurement / 3.1.2：
Nominal Level of Measurement / 3.1.3：
Comparing Associations / 3.2：
Maximum Likelihood Estimation / 3.3：
Generalized exp-log Specification of Nonloglinear Marginal Models / 3.3.1：
Compatibility and Redundancy of Restrictions / 3.3.2：
Homogeneous Specification of Coefficients / 3.3.3：
***Algorithm for Maximum Likelihood Estimation / 3.3.4：
***Asymptotic Distribution of ML Estimates / 3.3.5：
Marginal Analysis of Longitudinal Data / 4：
Trend Data / 4.1：
Comparing Net Changes in More Than One Characteristic / 4.1.1：
Simultaneous Tests for Restrictions on Association and Net Change: Modeling Joint and Marginal Tables / 4.1.2：
Panel Data: Investigating Net Changes in One Characteristic / 4.2：
Overall Net Changes; Cumulative Proportions; Growth Curves / 4.2.1：
Subgroup Comparisons of Net Changes / 4.2.2：
Changes in Associations / 4.2.3：
Gross Changes in One Characteristic / 4.3：
Comparing Turnover Tables for Different Periods / 4.3.1：
Comparing Summary Measures of Gross Change / 4.3.2：
Extensions; Net Plus Gross Changes; Multiway Turnover Tables; Subgroup Comparisons / 4.3.3：
Net and Gross Changes in Two Related Characteristics / 4.4：
Net Changes in Two Characteristics / 4.4.1：
Changes in Association Between Two Changing Characteristics / 4.4.2：
Gross Changes in Two Characteristics / 4.4.3：
Combining Hypotheses about Net and Gross Changes / 4.4.4：
Minimally Specified Models for Comparing Tables with Overlapping Marginals; Detection of Problematic Models / 4.5：
Causal Analyses: Structural Equation Models and (Quasi-) Experimental Designs / 5：
SEMs - Structural Equation Models / 5.1：
SEMs for Categorical Data / 5.1.1：
An Example: Women's Role / 5.1.2：
Marginal Modeling and Categorical SEM / 5.1.3：
Analysis of (Quasi-)Experimental Data / 5.2：
The One-group Pretest-Posttest Design / 5.2.1：
The Nonequivalent Control Group Design / 5.2.2：
A Truly Experimental Design / 5.2.3：
Marginal Modeling with Latent Variables / 6：
Latent Class Models / 6.1：
Latent Marginal Homogeneity / 6.2：
Loglinear and Nonloglinear Latent Class Models: Equal Reliabilities / 6.3：
Restrictions on Conditional Responses Probabilities / 6.3.1：
Restrictions on Odds Ratios / 6.3.2：
Restrictions on Percentage Differences / 6.3.3：
Restrictions on Agreement / 6.3.4：
Marginal causal analyses / 6.4：
SEMs with latent marginal homogeneity / 6.4.1：
Latent Variable SEMs for Clustered Data / 6.4.2：
Estimation of Marginal Models with Latent Variables Using the EM Algorithm / 6.5：
Basic EM Algorithm / 6.5.1：
***General EM for Marginal Models / 6.5.2：
***Marginal Restrictions in Combination with a Loglinear Model for the Complete Table / 6.5.3：
***Speeding up of the EM Algorithm for Separable Models / 6.5.4：
Conclusions, Extensions, and Applications / 6.5.5：
Marginal Models for Continuous Variables / 7.1：
Changes in Means / 7.1.1：
Changes in Correlation and Regression Coefficients / 7.1.2：
Alternative Procedures and Models / 7.2：
Alternative Estimation Procedures: WLS and GEE / 7.2.1：
Modeling Dependent Observations: Marginal, Random Effects, and Fixed Effects Models / 7.2.2：
Specific Applications / 7.3：
Multiple Responses / 7.3.1：
Categorical Dyadic Data / 7.3.2：
Mokken Scale Analysis / 7.3.3：
Problems and Future Developments / 7.4：
Software, Generalized exp-log Routines, and Website / 7.5：
References
Author Index
Subject Index
Introduction / 1：
Marginal Models for Categorical Data / 1.1：
Historical and Comparable Approaches / 1.2：
58.
図書
introduction, text, translation and notes by S.D. Joshi and J.A.F. Roodbergen
59.
図書
introduction, text, translation and notes by S.D. Joshi and J.A.F. Roodbergen
60.
図書
introduction, text, translation and notes by S.D. Joshi and J.A.F. Roodbergen
61.
図書
herausgegeben von R. Abegg, Fr. Auerbach und I. Koppel
目次情報:
続きを見る
1. Teil: Die Edelgase / von Eugen Rabinowitsch
2. Teil, A: Eisen und seine Verbindungen / herausgegeben von I. Koppel
2. Teil, B: Verbindungen des Eisens / herausgegeben von I. Koppel
3. Teil: Kobalt und seine Verbindungen / herausgegeben von I. Koppel
4. Teil: Nickel und seine Verbindungen / bearbeitet von R. Burian ... [et al.]
1. Teil: Die Edelgase / von Eugen Rabinowitsch
2. Teil, A: Eisen und seine Verbindungen / herausgegeben von I. Koppel
2. Teil, B: Verbindungen des Eisens / herausgegeben von I. Koppel
62.
図書
Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
目次情報:
続きを見る
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：
63.
図書
Joachim Paul Walser ; foreword by Henry Kautz
目次情報:
続きを見る
Introduction / 1：
Integer Optimization and Heuristics / 1.1：
Integer Local Search / 1.2：
Experimental Results / 1.3：
Research Contributions / 1.4：
Frameworks for Combinatorial Optimization / 2：
Integer Programming Branch- and- Bound / 2.1：
Finite Domain Constraint Programming / 2.2：
Local Search / 2.3：
Meta- heuristics / 2.3.1：
RISC and CISC Local Search / 2.3.2：
Local Search for SAT / 2.3.3：
Application Domains of SAT Local Search / 2.3.4：
Modeling Languages / 2.4：
Search Relaxations and Integer Local Search / 2.5：
Local Search for Integer Constraints / 3：
Over- Constrained Integer Programs / 3.1：
Definition / 3.1.1：
Relation to Integer Linear Programs / 3.1.2：
Constraint-Bounds / 3.1.3：
Integer Local Search: Wsat(oip) / 3.2：
The Score / 3.2.1：
The Main Loop / 3.2.2：
Move Selection and Tabu Search Extensions / 3.2.3：
Combinations with Linear Programming / 3.3：
Bounds from LP Relaxations / 3.3.1：
Initialization by Rounding LP Solutions / 3.3.2：
Search Space Reduction Using LP Reduced Costs / 3.3.3：
Implementation Issues / 3.3.4：
A Graphical Interpretation / 3.4：
Related Work / 3.5：
Integer Programming Heuristics / 3.5.1：
Local Search in Constraint Satisfaction / 3.5.2：
Summary / 3.6：
Case Studies Methodology / 4：
Optimization in Practice: Criteria of Success / 4.1：
Scaling with Increasing Problem Size / 4.1.1：
Scaling with Increasing Constrainedness / 4.1.2：
Flexibility and Residual Robustness / 4.1.3：
The Problem Class Selection / 4.2：
The Empirical Comparisons / 4.3：
Time-Tabling and Sports Scheduling / 5：
The Progressive Party Problem / 5.1：
Problem Description and Formulation / 5.1.1：
Experimental Results and Comparison / 5.1.2：
The ACC Basketball Scheduling Problem / 5.2：
Double Round Robin Scheduling / 5.2.1：
Problem Specification of ACC97/98 / 5.2.2：
Integer Local Search Formulation / 5.2.3：
Redundant Constraints / 5.2.4：
Previous (Multi- stage) Approaches / 5.2.5：
Experimental Results under Varied Constrainedness / 5.2.6：
Minimal Distortion Mirroring / 5.2.7：
Conclusions / 5.3：
Covering and Assignment / 6：
Radar Surveillance Covering / 6.1：
Experimental Results under Varied Problem Size / 6.1.1：
Course Assignment / 6.2：
A Related Application: Reviewer Assignment / 6.2.1：
Capacitated Production Planning / 6.3：
Capacitated Lot- Sizing / 7.1：
Mixed Integer Programming Formulation / 7.2：
Lagrangean Relaxation Approach / 7.3.1：
Restricting the Problem / 7.3.2：
Comparison of Results / 7.4：
Lower Bounds / 7.4.2：
Extensions / 7.5：
Current Limitations / 8.1：
An Alternative Scoring Scheme / 8.2：
Future Research / 8.3：
A Complete AMPL Model for ACC97/98 / 8.4：
References
Index
Introduction / 1：
Integer Optimization and Heuristics / 1.1：
Integer Local Search / 1.2：
64.
図書
by Anna Nagurney
目次情報:
続きを見る
Preface
Acknowledgments
Glossary of Notation
Theory and Fundamentals / I：
Variational Inequality Theory / 1：
The Variational Inequality Problem / 1.1：
Basic Existence and Uniqueness Results / 1.2：
Partitionable Variational Inequalities / 1.3：
Sensitivity Analysis / 1.4：
Projected Dynamical Systems / 1.5：
Stability Results / 1.6：
Sources and Notes / 1.7：
Algorithms / 2：
VI General Iterative Scheme / 2.1：
The Projection Method / 2.1.1：
The Relaxation Method / 2.1.2：
The Modified Projection Method / 2.2：
Decomposition Algorithms / 2.3：
PDS General Iterative Scheme / 2.4：
Equilibration Algorithms / 2.5：
Demand Market Equilibration Algorithm / 2.5.1：
General Equilibration Algorithms / 2.5.2：
Partial Equilibrium-Perfect Competition / 2.6：
Spatial Price Equilibrium / 3：
Static Spatial Price Equilibrium Models / 3.1：
Quantity Formulation / 3.1.1：
Price Formulation / 3.1.2：
Policy Interventions / 3.2：
Algorithms and Computation / 3.3.1：
A Dynamic Spatial Price Model / 3.5：
Stability Analysis / 3.5.1：
Discrete Time Algorithm / 3.5.2：
Massively Parallel Results / 3.5.3：
Traffic Network Equilibrium / 3.6：
Traffic Network Equilibrium Models / 4.1：
Elastic Demand Model with Disutility Functions / 4.1.1：
Elastic Demand Model with Demand Functions / 4.1.2：
Fixed Demand Model / 4.1.3：
Toll Policies / 4.2：
Solution of the Link-Toll Collection Policy / 4.3.1：
Solution of the Path-Toll Collection Policy / 4.3.2：
Computation of Traffic Network Equilibria / 4.4：
Dynamic Traffic with Elastic Demands / 4.5：
Migration Equilibrium / 4.5.1：
Costless Migration / 5.1：
Migration with Migration Costs / 5.2：
Migration with Class Transformations / 5.3：
Computation of Migration Equilibria / 5.4：
Numerical Results / 5.5：
Partial Equilibrium-Imperfect Competition / 5.6：
Oligopolistic Market Equilibrium / 6：
Classical Oligopoly Problems / 6.1：
Computation of Classical Oligopoly Problems / 6.1.1：
A Spatial Oligopoly Model / 6.2：
Relationship Between Spatial Oligopolies and Spatial Price Equilibrium Problems / 6.2.1：
Computation of Oligopolistic Equilibria / 6.3：
Dynamic Spatial Oligopoly Model / 6.4.1：
Environmental Networks / 6.4.2：
The Spatial Oligopoly Model with Permits / 7.1：
Qualitative Properties / 7.2：
Knowledge Network Equilibrium / 7.3：
A Knowledge Network Equilibrium Model / 8.1：
A Tatonnement Process / 8.2：
A Discrete Time Algorithm / 8.2.1：
General Equilibrium / 8.4：
Walrasian Price Equilibrium / 9：
Network Equilibrium Equivalence / 9.1：
A General Walrasian Iterative Scheme / 9.2：
The Projection Method for Discontinuous Aggregate Excess Demand Functions / 9.3.1：
A Numerical Example / 9.4：
Financial Equilibrium / 9.5：
Quadratic Utility Functions / 10.1：
General Utility Functions / 10.2：
Computation of Financial Equilibria / 10.2.1：
A Dynamic Financial Model / 10.5：
Estimation / 10.6.1：
Constrained Matrix Problems / 11：
The General Constrained Matrix Problem / 11.1：
The Splitting Equilibration Algorithm / 11.2：
SEA for Diagonal Problems / 11.2.1：
Dual Interpretation and Theoretical Analysis / 11.2.2：
SEA for General Problems / 11.2.3：
Computation of Large-Scale Matrices / 11.3：
Serial Experiments for General Problems / 11.3.1：
Parallel Experiments for General Problems / 11.3.2：
Serial Experiments for Diagonal Problems / 11.3.3：
Parallel Experiments for Diagonal Problems / 11.3.4：
Massively Parallel Experiments / 11.3.5：
Financial Flow-of-Funds Estimation / 11.4：
Network Model of Financial Flow of Funds / 11.4.1：
SEA for Financial Flow of Funds / 11.4.2：
An Application / 11.4.3：
A Problems / 11.5：
Preface
Acknowledgments
Glossary of Notation
65.
図書
Elisa Quintarelli
目次情報:
続きを見る
Introduction / 1：
Motivations / 1.1：
Overview of the Book / 1.2：
Contributions / 1.3：
Semantics Based on Bisimulation / 2：
G-Log: a Language for Semistructured Data / 2.1：
An Informal Presentation / 2.1.1：
Syntax of G-Log / 2.1.2：
Bisimulation Semantics of G-Log / 2.2：
Semantics of Rules / 2.2.1：
Programming in G-Log / 2.2.2：
Basic Semantic Results / 2.3：
Applicability / 2.3.1：
Satisfiability / 2.3.2：
Simple Edge-Adding Rules / 2.3.3：
Very Simple Queries / 2.3.4：
Abstract Graphs and Semantics / 2.4：
Logical Semantics of G-Log / 2.5：
Formulae for G-Log Rules / 2.5.1：
Concrete Graphs as Models / 2.5.2：
Model Theoretic Semantics / 2.5.3：
Relationship with the Original G-Log Semantics / 2.6：
G-Log Graphs with Negation / 2.7：
Computational Issues / 2.8：
Other Languages for Semistructured Data / 2.9：
UnQL / 2.9.1：
GraphLog / 2.9.2：
Model-Checking Based Data Retrieval / 3：
An Introduction to Model-Checking / 3.1：
Transition Systems and CTL / 3.1.1：
A Linear Time Algorithm to Solve the Model-Checking Problem / 3.1.2：
Syntax of the Query Language W / 3.2：
W-Instances as KTS / 3.3：
CTL-Based Semantics of W-Queries / 3.4：
Technique Overview / 3.4.1：
Admitted Queries / 3.4.2：
Query Translation / 3.4.3：
Acyclic Graphs / 3.4.4：
Cyclic Queries / 3.4.5：
Complexity Issues / 3.5：
Implementation of the Method / 3.6：
Applications to Existing Languages / 3.7：
G-Log / 3.7.1：
Expressive Power of Temporal Logics / 3.8：
Temporal Aspects of Semistructured Data / 4：
An Introduction to Temporal Databases / 4.1：
A Graphical Temporal Data Model for Semistructured Data / 4.2：
Operations on Temporal Data / 4.3：
TSS-QL: Temporal Semistructured Query Language / 4.4：
Grammar of TSS-QL / 4.4.1：
Some Examples of TSS-QL Queries / 4.4.2：
A Graphical Model for User Navigation History / 4.5：
Analyzing User History Navigation / 4.5.1：
Using the Query Language TSS-QL to Obtain Relevance Information / 4.6：
Semistructured Temporal Graph as a KTS / 4.6.1：
Complexity Results on TSS-QL Fragments / 4.6.2：
Related Works / 5：
Semantics Aspects of Query Languages / 5.1：
Efficient Query Retrieval / 5.2：
Temporal Models and Query Languages for Semistructured Data / 5.3：
Comparison with the DOEM Model / 5.3.1：
Conclusion / 6：
References
Introduction / 1：
Motivations / 1.1：
Overview of the Book / 1.2：
66.
図書
Sławomir Stańczak, Marcin Wiczanowski, Holger Boche
目次情報:
続きを見る
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：
67.
図書
Jean-Claude Derniame, Badara Ali Kaba, David Wastell (eds.)
目次情報:
続きを見る
The Software Process: Modelling and Technology / 1：
Introduction / 1.1：
The Perspective of this Book / 1.2：
Processes and Process Models / 1.3：
A Simple Example: Software Change / 1.4：
Process Modelling / 1.5：
Basic Elements / 1.5.1：
Process Model Levels / 1.5.2：
Process Model Views / 1.5.3：
Process-sensitive Software Engineering Environments / 1.6：
Meta-Process / 1.7：
Conclusion / 1.8：
Software Process - Standards, Assessments and Improvement / 2：
Standard Processes / 2.1：
ISO 9000-3 / 2.2.1：
PSS-05 / 2.2.2：
ISO-12207 / 2.2.3：
Assessment Methods / 2.3：
The Capability Maturity Model / 2.3.1：
Bootstrap / 2.3.2：
SPICE / 2.3.3：
Summary / 2.3.4：
Improvement Methods / 2.4：
Quality Improvement Paradigm / 2.4.1：
The Personal Software Process / 2.4.2：
Total Quality Management / 2.4.3：
Standards and Software Process Technology / 2.5：
Process Modelling Languages / 3：
Requirements on Process Modelling Languages / 3.1：
Process Elements / 3.2.1：
PML Requirements and Meta-process Phases / 3.2.2：
Possible PML Technologies from Other Languages/Domains / 3.3：
Project Management / 3.3.1：
Formal Specification Languages / 3.3.2：
Informal Design Notations / 3.3.3：
Programming Languages / 3.3.4：
Database Languages / 3.3.5：
CASE Tools and Tool Integration Mechanisms / 3.3.6：
WorkFlow and Groupware / 3.3.7：
The PML Design Dilemma: One or Many PMLs? / 3.3.8：
Process Modelling Languages in the Promoter Context / 3.4：
The Survey Method / 3.4.1：
EPOS SPELL / 3.4.2：
SOCCA / 3.4.3：
Merlin / 3.4.4：
OIKOS / 3.4.5：
ALF / 3.4.6：
ADELE-TEMPO / 3.4.7：
SPADE / 3.4.8：
PEACE+ / 3.4.9：
E3 / 3.4.10：
PADM / 3.4.11：
Discussion / 3.4.12：
Other PMLs / 3.5：
APPL/A / 3.5.1：
MARVEL / 3.5.2：
Process Weaver / 3.5.3：
Possible Groups of PMLs and PSEEs / 3.6：
Overview / 3.7：
Meta-Process and Quality Improvement / 4.1.2：
Existing Meta-Processes / 4.1.3：
Requirements for a Meta-Process / 4.2：
A Model of the Meta-Process / 4.3：
Control and Problem Solving / 4.3.1：
Consistency Management / 4.3.3：
Task Decomposition / 4.3.4：
Method Specialisation / 4.3.5：
Remarks on the Model / 4.3.6：
PROMOTER Reference Model (PRM) / 4.4：
Model Structure / 4.4.1：
Validation of the PRM with Respect to Requirements / 4.4.2：
Empirical Justification of PRM / 4.6：
The Customisation of PRM as QIP / 4.6.1：
The Customisation of PRM as PRISM / 4.6.3：
The Customisation of PRM as "Process Life-cycle" / 4.6.4：
Experience from Empirical Justification / 4.6.5：
Validation with respect to CMM / 4.7：
Task Decomposition View / 4.7.1：
Method Specialisation View / 4.7.4：
Validation of PRM with respect to Implementation / 4.8：
Process Wise Integrator / 4.8.1：
The Model / 4.8.3：
The Scenario / 4.8.4：
Requirements / 4.9：
Managing the Process Improvement Process / 4.9.2：
Looking at other Meta-Processes / 4.9.3：
Why Use a PRM? / 4.9.4：
The Way Forward / 4.9.5：
Architectural Views and Alternatives / 5：
Basic Components / 5.1：
A Reference Model for Architectures in PSEEs / 5.1.1：
Dialog Management / 5.1.2：
Process Management / 5.1.3：
Workspace Management / 5.1.4：
Repository Management / 5.1.5：
Communication Management / 5.1.6：
Tools / 5.1.7：
Architectures for Distributed PSEEs / 5.2：
Determinant Requirements on Architectures for Distributed PSEEs / 5.2.1：
Architectural Alternatives for Distributed PSEEs / 5.2.2：
Example Architecture: The Distributed PSEE Merlin / 5.3：
Instance View on the Merlin Architecture / 5.3.1：
Type View on the Merlin Architecture / 5.3.2：
Cooperation Control in PSEE / 6：
Objective / 6.1：
An Illustrative Example / 6.1.2：
Organisation of the Chapter / 6.1.3：
Moving from Traditional to Advanced Applications / 6.2：
ACID Properties / 6.2.1：
From ACID to Non-ACID / 6.2.2：
From Flat to Nested / 6.2.3：
From Closed to Open / 6.2.4：
Hierarchical versus Layered / 6.2.5：
Homogeneous versus Heterogeneous / 6.2.6：
From Transient to Persistent / 6.2.7：
Available Advanced Transaction Models / 6.2.8：
Summary and Analysis / 6.2.9：
Impact of Cooperation Control on the Architecture of PSEE / 6.3：
Impact of the Repository on Consistency Maintenance / 6.3.1：
Workspaces: an Abstract Level to Support Flexibility / 6.3.2：
Predefined Synchronisation Strategies Layer / 6.3.3：
The Knowledge Management Layer / 6.3.4：
The Interface Layer / 6.3.5：
Current Work / 6.4：
The COO System / 6.4.1：
The MERLIN System / 6.4.2：
The ADELE System / 6.4.3：
The SPADE System / 6.4.4：
Other Facets of Cooperation / 6.4.5：
The Human Dimension of the Software Process / 6.5：
Three Organisational Contexts of Software Development / 7.1：
In-house Development in "ACME Stores": the Fetish of Methodology / 7.2.1：
Case B: Implementing Quality Management in a Software House (Columbine) / 7.2.2：
Case C: User Involvement in the Development of a Medical Workstation / 7.2.3：
General Remarks on the Cases / 7.2.4：
The Social Dynamics of the Software Process / 7.3：
MIS Research on the Software Process / 7.3.1：
The Contribution of Software Psychology / 7.3.2：
Process Modelling and Enactment: Some Practical Experiences / 7.3.3：
The Human Role in the Software Process: Dowson's framework / 7.4：
Dowson's Framework / 7.4.1：
User Interaction / 7.4.2：
User Interaction, Learning and the Meta-Process / 7.4.3：
Interpersonal Interaction / 7.4.4：
A Human-Centred Approach to Software Process Support / 7.5：
The Need for an "Ecological Approach" in Software Process Research / 7.5.1：
Synergy with Computer Supported Cooperative Work / 7.5.2：
The Limits of the Process Enactment Paradigm / 7.5.3：
The Software Process is a Learning Process / 7.5.4：
Software Process: Key Issues and Future Directions / 7.6：
Summary of Key Issues / 8.1：
The Meta-Process / 8.2.1：
PSEE Architecture / 8.2.3：
Cooperation Control / 8.2.4：
Social Aspects / 8.2.5：
Wider Applications / 8.3：
Future Trends / 8.4：
Evolution of Software Development Practice / 8.4.1：
Technology Evolution / 8.4.2：
Application Domain Evolution / 8.4.3：
Appendix
Lifecycle (Sub) Process Demonstration Scenario (ISPW 9) / A：
Background / A.1：
Problem Reporting and Change Process / A.2：
Sub-scenarios / A.4：
Annotated Bibliography on PSEE/PML / B：
PMLs / B.1：
Japanese and American PSEEs / B.1.1：
European PSEEs / B.1.2：
Case Study Demonstrating the Wider Applicability of the PSEE Paradigm / C：
Informal Formulation of the Example / C.1：
A Preliminary Discussion of the Example / C.3：
A First Level of Process Modelling / C.4：
A Top-Down LCPS Model for the Example Process / C.5：
Discussion of the Example Process Models / C.6：
Assessment Framework for PSEEs / C.7：
Product / D.1：
Activity / D.2：
Workspace / D.3：
Cooperation / D.4：
Process and Meta-process Support / D.5：
Process Tracking and Time Constraints / D.6：
Human and Social Aspects: Costs and Benefits / D.7：
Glossary
References
Index
The Software Process: Modelling and Technology / 1：
Introduction / 1.1：
The Perspective of this Book / 1.2：
68.
図書
edited by Ilpo Laine, Olli Lehto, and Tuomas Sorvali
目次情報:
続きを見る
Preface
Motivation
Purpose
Readers
Structure
Downloads
Acknowledgments
About the Author
Contents
List of Abbreviations
About Relationships and ORN / Part I：
Introduction Including a Brief History of Relationships / Chapter I：
Relationships / 1.1：
A Brief History of Relationships / 1.2：
The paper-based system / 1.2.1：
The computerized file-based system / 1.2.2：
Early data models and DBMSs / 1.2.3：
The relational model and RDBMS / 1.2.4：
The entity-relationship model and database / 1.2.5：
Semantic models, the object model, and the ODBMS / 1.2.6：
The object-relational DBMS / 1.2.7：
Problems in Modeling and Implementing Relationships / 1.3：
Preview of a Solution / 1.4：
Object Relationship Notation (ORN) / Chapter 2：
Syntax / 2.1：
Graphical Representation / 2.2：
Semantics / 2.3：
Examples / 2.4：
<*-to-*> / 2.4.1：
<1-to-*>|- / 2.4.2：
<0..1-to-*>|- / 2.4.3：
<0..1-to*>|-X- / 2.4.4：
<0..1-to-1..*>? / 2.4.5：
!<0..1-to-*> / 2.4.6：
'<*-to-1..*> / 2.4.7：
Flashback to the Company Database / 2.5：
ORN Simulator A Modeling Tool Where Associations Come Alive / Chapter 3：
Creating a Database Model and a Database / 3.1：
Verifying Association Semantics / 3.2：
Architecture / 3.3：
Benefits / 3.4：
Association Patterns Emerging from a Variety of Association Types / Chapter 4：
Context / 4.1：
Pattern Descriptions / 4.2：
"is defined by" pattern / 4.2.1：
"is recorded for" pattern / 4.2.2：
"is a realization of" pattern / 4.2.3：
"is associated by" pattern / 4.2.4：
"is an update of" pattern / 4.2.5：
"is a part of" pattern / 4.2.6：
"is a" pattern / 4.2.7：
Patterns in Database Modeling and Implementation / 4.3：
Associations That Don't Conform to a Pattern / 4.4：
Conclusion / 4.5：
Comparing ORN to Similar Declarative Schemes / Chapter 5：
Schemes for Relational Databases and Object Relations / 5.1：
Null constraint / 5.1.1：
Key constraints / 5.1.2：
Referential integrity rules / 5.1.3：
Subjectivity constraints / 5.1.4：
Additional relationship semantics / 5.1.5：
Schemes for the ER model / 5.2：
Schemes in ODBMSs / 5.3：
Whole-Part Properties and Dimensions for Class Diagrams / 5.4：
Proposed association dimensions for Class diagrams / 5.4.1：
Primary characteristics for whole-part relationships / 5.4.2：
Secondary characteristics for whole-part relationships / 5.4.3：
Using ORN to Develop a Database System / 5.5：
ORN Additive A Tool for Extending SQL Server with ORN / Chapter 6：
Capabilities, Operations, and Architecture / 6.1：
Capabilities / 6.1.1：
Operations and architecture / 6.1.2：
The +ornddl command / 6.1.3：
The +orndml command / 6.1.4：
ORN Additive DDL Statements / 6.2：
USE statement / 6.2.1：
Constraint statement / 6.2.2：
Delete statement / 6.2.3：
Set Orn_Message_Number_Base statement / 6.2.4：
Example of a query file with ORN Additive DDL statements / 6.2.5：
ORN Additive DML Statements / 6.3：
Use statement / 6.3.1：
Begin Transaction statement / 6.3.2：
Save Transaction statement / 6.3.3：
Commit Transaction statement / 6.3.4：
Rollback Transaction statement / 6.3.5：
Set Rxc_Mode statement / 6.3.6：
Enable/Disable Orn_Triggers statement / 6.3.7：
Example of query file with ORN Additive DML statements / 6.3.8：
Object Relater Plus (OR+) An ORN-extended Object DBMS / 6.4：
Capabilities and Compatibilities / 7.1：
ODDL / 7.2：
ODDL specification / 7.2.1：
/ 7.2.2：
Control commands / 7.2.3：
ODML / 7.3：
Architecture, Implementation, and Extensibility / 7.4：
Implementation / 7.4.1：
Extensibility / 7.4.3：
Mapping Database Models to DDLs From ORN-Extended Class Diagrams to ORN-Extended DBMSs / 7.5：
Mapping an ORN-Extended Model to an ORN-Extended SQL / 8.1：
Transformating the model for a relational database / 8.1.1：
Mapping classes to tables / 8.1.2：
Mapping associations to foreign keys / 8.1.3：
Mapping an ORN-Extended Model to an Object DDL / 8.2：
Transforming the model for an object database / 8.2.1：
Mapping classes to class definitions and extents / 8.2.2：
Mapping associations to object-based attributes / 8.2.3：
Association Semantics Dealing with the Subtleties, Inconsistencies, and Ambiguities / 8.3：
Inconsistencies / 9.1：
Within an / 9.1.1：
Involving combinations / 9.1.2：
Inconsistency Detection / 9.2：
Ambiguities / 9.3：
Associations as Functions / 9.4：
Adding ORN to a DBMS / 9.5：
A Conceptual Implementation of ORN Exploring Semantic Circularity and Ambiguity / Chapter 10：
Algorithms / 10.1：
Algorithm CreateObject / 10.1.1：
Transaction operations / 10.1.2：
Supporting pseudocode for complex object operations / 10.1.3：
Algorithm CreateLink / 10.1.4：
Algorithm DeleteObject / 10.1.5：
Algorithm DestroyLink / 10.1.6：
Algorithm ChangeLink / 10.1.7：
Link Cycles / 10.2：
Circularity / 10.2.1：
The Theorem for ORN Semantic Clarity and its proof / 10.2.2：
Adding ORN to the SQL Standard for RDBMSs / 10.3：
Overview of SQL Association Capabilities / 11.1：
Proposed ORN Extension to SQL / 11.3：
Adding ORN to the ODMG Standard for ODMSs / 11.4：
Adding ORN to ODL / 12.1：
Associations in ODL / 12.2.1：
Adding ORN syntax / 12.2.2：
Adapting ORN semantics to ODL / 12.2.3：
Class Transaction / 12.3：
Method new() / 12.3.2：
Method delete() / 12.3.3：
Method _enforce_binding() / 12.3.4：
Method form_tpR() / 12.3.5：
Method drop_tpR() / 12.3.6：
Method_enforce_explicit_binding() / 12.3.7：
Method change_tpR()
Example / 12.3.9：
Bibliography / 12.4：
Index
Preface
Motivation
Purpose
69.
図書
edited by Heinz Gerischer and Charles W. Tobias ; contributions from V. Brusic ... [et al.]
出版情報:
Weinheim ; New York : VCH, c1990- v. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Marcus Theory in the Qualitative and Quantitative Description of Electrochemiluminescence Phenomena / A. Kapturkiewicz
Electrochemistry of Oxide High-Temperature Superconductors / O. Petrii ; G. Tsirlina
Flow Rate Dependence of Localized Corrosion in Thermal Power Plant Materials / D. Macdonald ; L. Kriksunov
Polymer Electrolyte Fuel Cells / S. Gottesfeld
Graphite, Carbonaceous Materials and Organic Solids as Active Electrodes in Metal-Free Batteries / F. Beck
Index
Series Preface
Volume Preface
List of Contributors
In-situ X-ray Diffraction Studies of the Electrode/Solution Interface / Christopher A. Lucas ; Nenad M. Markovic1：
Introduction / 1.1：
Experimental / 1.2：
Adsorbate-induced Restructuring of Metal Substrates / 1.3：
Surface Relaxation / 1.3.1：
Pt Monometallic and Bimetallic Surfaces / 1.3.1.1：
Group IB Metals / 1.3.1.2：
Surface Reconstruction / 1.3.2：
Adlayer Structures / 1.4：
Anion Structures / 1.4.1：
CO Ordering on the Pt(111) Surface / 1.4.2：
Underpotential Deposition (UPD) / 1.4.3：
Reactive Metals and Oxides / 1.5：
Conclusions and Future Directions / 1.6：
Acknowledgments
References
UV-visible Reflectance Spectroscopy of Thin Organic Films at Electrode Surfaces / Takamasa Sagara2：
The Basis of UV-visible Reflection Measurement at an Electrode Surface / 2.1：
Absolute Reflection Spectrum versus Modulated Reflection Spectrum / 2.3：
Wavelength-modulated UV-visible Reflectance Spectroscopy / 2.4：
Potential-modulated UV-visible Reflectance Spectroscopy / 2.5：
Instrumentation of the Potential-modulated UV-visible Reflection Measurement / 2.6：
ER Measurements for Redox-active Thin Organic Films / 2.7：
Interpretation of the Reflection Spectrum / 2.8：
Reflection Measurement at Special Electrode Configurations / 2.9：
Estimation of the Molecular Orientation on the Electrode Surface / 2.10：
Estimation of the Molecular Orientation on the Electrode Surface using the Redox ER Signal / 2.10.1：
Estimation of the Molecular Orientation on the Electrode Surface using the Stark Effect ER Signal / 2.10.2：
Measurement of Electron Transfer Rate using ER Measurement / 2.11：
Redox ER Signal in Frequency Domain / 2.11.1：
Examples of Electron Transfer Rate Measurement using ER Signal / 2.11.2：
Improvement in Data Analysis / 2.11.3：
Combined Analysis of Impedance and Modulation Spectroscopic Signals / 2.11.4：
Upper Limit of Measurable Rate Constant / 2.11.5：
Rate Constant Measurement using an ER Voltammogram / 2.11.6：
ER Signal Originated from Non-Faradaic Processes - a Quick Overview / 2.12：
ER Signal with Harmonics Higher than the Fundamental Modulation Frequency / 2.13：
Distinguishing between Two Simultaneously Occurring Electrode Processes / 2.14：
Some Recent Examples of the Application of ER Measurement for a Functional Electrode / 2.15：
Scope for Future Development of UV-visible Reflection Measurements / 2.16：
New Techniques in UV-visible Reflection Measurements / 2.16.1：
Remarks on the Scope for Future Development of UV-visible Reflection Measurements / 2.16.2：
Epi-fluorescence Microscopy Studies of Potential Controlled Changes in Adsorbed Thin Organic Films at Electrode Surfaces / Dan Bizzotto ; Jeff L. Shepherd3：
Fluorescence Microscopy and Fluorescence Probes / 3.1：
Fluorescence near Metal Surfaces / 3.3：
Description of a Fluorescence Microscope for Electrochemical Studies / 3.4：
Microscope Resolution / 3.4.1：
Image Analysis / 3.4.2：
Electrochemical Systems Studied with Fluorescence Microscopy / 3.5：
Adsorption of C[subscript 18]OH on Au(111) / 3.5.1：
The Adsorption and Dimerization of 2-(2[prime]-Thienyl)pyridine (TP) on Au(111) / 3.5.2：
Fluorescence Microscopy of the Adsorption of DOPG onto an Hg Drop / 3.5.3：
Fluorescence Microscopy of Liposome Fusion onto a DOPC-coated Hg Interface / 3.5.4：
Fluorescence Imaging of the Reductive Desorption of an Alkylthiol SAM on Au / 3.5.5：
Conclusions and Future Considerations / 3.6：
Structures and Abbreviations
Linear and Non-linear Spectroscopy at the Electrified Liquid/Liquid Interface / David J. Fermin4：
Introductory Remarks and Scope of the Chapter / 4.1：
Linear Spectroscopy / 4.2：
Total Internal Reflection Absorption/Fluorescence Spectroscopy / 4.2.1：
Potential-modulated Reflectance/Fluorescence in TIR / 4.2.2：
Quasi-elastic Laser Scattering (QELS) / 4.2.3：
Other Linear Spectroscopic Studies at the Neat Liquid/Liquid Interface / 4.2.4：
Non-linear Spectroscopy / 4.3：
Second Harmonic Generation / 4.3.1：
Vibrational Sum Frequency Generation / 4.3.2：
Summary and Outlook / 4.4：
Symbols
Abbreviations
Sum Frequency Generation Studies of the Electrified Solid/Liquid Interface / Steven Baldelli ; Andrew A. Gewirth5：
Theoretical Background / 5.1：
SFG Intensities / 5.1.2：
Resonant Term / 5.1.3：
Non-resonant Term / 5.1.4：
Phase Interference / 5.1.5：
Orientation Information in SFG / 5.1.6：
Phase Matching / 5.1.7：
Surface Optics / 5.1.8：
Data Analysis Reference / 5.1.9：
Experimental Designs / 5.1.10：
Spectroscopy Cell / 5.1.11：
Applications of SFG to Electrochemistry / 5.2：
CO Adsorption / 5.2.1：
Polarization Studies / 5.2.1.1：
Potential Dependence / 5.2.1.2：
CO on Alloys / 5.2.1.3：
Solvent Effects / 5.2.1.4：
Adsorption of upd and opd H / 5.2.2：
CN on Pt and Au Electrodes / 5.2.3：
CN/Pt / 5.2.3.1：
CN/Au / 5.2.3.2：
OCN and SCN / 5.2.4：
Pyridine and Related Derivatives / 5.2.5：
Dynamics of CO and CN Vibrational Relaxation / 5.2.6：
Solvent Structure / 5.2.7：
Nonaqueous Solvents / 5.2.7.1：
Aqueous Solvents / 5.2.7.2：
Monolayers and Corrosion / 5.2.8：
Conclusion / 5.3：
IR Spectroscopy of the Semiconductor/Solution Interface / Jean-Noel Chazalviel ; Francois Ozanam6：
IR Spectroscopy at an Interface / 6.1：
Basic Principles of IR Spectroscopy / 6.2.1：
External versus Internal Reflection / 6.2.2：
Practical Aspects at an Electrochemical Interface / 6.3：
How Potential can Affect IR Absorption / 6.3.1：
How to Isolate Potential-sensitive IR Absorption / 6.3.2：
What can be Learnt from IR Spectroscopy at the Interface / 6.4：
Vibrational Absorption of Interfacial and Double-Layer Species / 6.4.1：
Vibrational Absorption of Species outside the Double-Layer / 6.4.2：
Electronic Absorption / 6.4.3：
Effect of Light Polarization in ATR Geometry / 6.5：
Selection Rules for a Polarized IR Beam / 6.5.1：
Case of Strongly Polar Species: LO-TO Splitting / 6.5.2：
Polarization Modulation / 6.5.3：
Dynamic Information from a Modulation Technique / 6.6：
Case of Rough or Complex Interfaces / 6.7：
Surface Roughness / 6.7.1：
Composite Interface Films / 6.7.2：
Recent Advances in in-situ Infrared Spectroscopy and Applications in Single-crystal Electrochemistry and Electrocatalysis / Carol Korzeniewski6.8：
Spectrometer Systems / 7.1：
Spectrometer Throughput Considerations / 7.2.2：
Detectors / 7.2.3：
Signal-to-Noise Ratio Considerations / 7.2.4：
Signal Digitization / 7.2.5：
Signal Modulation and Related Data Acquisition Methods / 7.2.6：
Applications / 7.3：
Adsorption and Reactivity at Well-defined Electrode Surfaces / 7.3.1：
Adsorption on Pure Metals / 7.3.1.1：
Electrochemistry at Well-defined Bimetallic Electrodes / 7.3.1.2：
SEIRAS / 7.3.2：
Infrared Spectroscopy as a Probe of Surface Electrochemistry at Metal Catalyst Particles / 7.3.3：
A Nanostructured Electrodes and Optical Considerations / 7.3.4：
Emerging Instrumental Methods and Quantitative Approaches / 7.3.5：
Step-scan Interferometry / 7.3.5.1：
Two-dimensional Infrared Correlation Analysis / 7.3.5.2：
Quantitation of Molecular Orientation / 7.3.5.3：
Summary / 7.4：
In-situ Surface-enhanced Infrared Spectroscopy of the Electrode/Solution Interface / Masatoshi Osawa8：
Electromagnetic Mechanism of SEIRA / 8.1：
Experimental Procedures / 8.3：
Electrochemical Cell and Optics / 8.3.1：
Preparation of Thin-film Electrodes / 8.3.2：
General Features of SEIRAS / 8.4：
Comparison of SEIRAS with IRAS / 8.4.1：
Surface Selection Rule and Molecular Orientation / 8.4.2：
Comparison of SEIRA and SERS / 8.4.3：
Baseline Shift by Adsorption of Molecules and Ions / 8.4.4：
Selected Examples / 8.5：
Reactions of a Triruthenium Complex Self-assembled on Au / 8.5.1：
Cytochrome c Electrochemistry on Self-assembled Monolayers / 8.5.2：
Molecular Recognition at the Electrochemical Interface / 8.5.3：
Hydrogen Adsorption and Evolution on Pt / 8.5.4：
Oxidation of C1 Molecules on Pt / 8.5.5：
Advanced Techniques for Studying Electrode Dynamics / 8.6：
Rapid-scan Millisecond Time-resolved FT-IR Measurements / 8.6.1：
Step-scan Microsecond Time-resolved FT-IR Measurements / 8.6.2：
Potential-modulated FT-IR Spectroscopy / 8.6.3：
Summary and Future Prospects / 8.7：
Acknowledgements
Quantitative SNIFTIRS and PM IRRAS of Organic Molecules at Electrode Surfaces / Vlad Zamlynny ; Jacek Lipkowski9：
Reflection of Light from Stratified Media / 9.1：
Reflection and Refraction of Electromagnetic Radiation at a Two-phase Boundary / 9.2.1：
Reflection and Refraction of Electromagnetic Radiation at a Multiple-phase Boundary / 9.2.2：
Optimization of Experimental Conditions / 9.3：
Optimization of the Angle of Incidence and the Thin-cavity Thickness / 9.3.1：
The Effect of Incident Beam Collimation / 9.3.2：
The Choice of the Optical Window Geometry and Material / 9.3.3：
Determination of the Angle of Incidence and the Thin-cavity Thickness / 9.4：
Determination of the Isotropic Optical Constants in Aqueous Solutions / 9.5：
Determination of the Orientation of Organic Molecules at the Electrode Surface / 9.6：
Development of Quantitative SNIFTIRS / 9.7：
Description of the Experimental Set-up / 9.7.1：
Fundamentals of SNIFTIRS / 9.7.2：
Calculation of the Tilt Angle from SNIFTIRS Spectra / 9.7.3：
Applications of Quantitative SNIFTIRS / 9.7.4：
Development of Quantitative in-situ PM IRRAS / 9.8：
Fundamentals of PM IRRAS and Experimental Set-up / 9.8.1：
Principles of Operation of a Photoelastic Modulator / 9.8.3：
Correction of PM IRRAS Spectra for the PEM Response Functions / 9.8.4：
Background Subtraction / 9.8.5：
Applications of Quantitative PM IRRAS / 9.8.6：
Summary and Future Directions / 9.9：
Tip-enhanced Raman Spectroscopy - Recent Developments and Future Prospects / Bruno Pettinger10：
General Introduction / 10.1：
SERS at Well-defined Surfaces / 10.2：
Single-molecule Raman Spectroscopy / 10.3：
Tip-enhanced Raman Spectroscopy (TERS) / 10.4：
Near-field Raman Spectroscopy with or without Apertures / 10.4.1：
First TERS Experiments / 10.4.2：
TERS on Single-crystalline Surfaces / 10.4.3：
Outlook / 10.5：
Recent Results / 10.5.1：
New Approaches on the Horizon / 10.5.2：
Acknowledgment
Subject Index
Microelectrodes in Solid State Ionics (J
Fleig)
Nonlinear Dynamics in Electrochemical Systems (K
Krischer)
The Electrochemistry of Diamond (Y
Pleskov)
Passivity of Metals (H
Strehblow)
Marcus Theory in the Qualitative and Quantitative Description of Electrochemiluminescence Phenomena / A. Kapturkiewicz
Electrochemistry of Oxide High-Temperature Superconductors / O. Petrii ; G. Tsirlina
Flow Rate Dependence of Localized Corrosion in Thermal Power Plant Materials / D. Macdonald ; L. Kriksunov
70.
図書
Zhuravlev, I. K. ; Shubinskiĭ, V. S. ; Skatkin, M. N.
出版情報:
Москва : "Педагогика", 1963-1990 v. ; 20-22 cm
子書誌情報:
loading…
所蔵情報:
loading…
71.
図書
Roland Tóth
目次情報:
続きを見る
Introduction / 1：
New Challenges for System Identification / 1.1：
The Birth of LPV Systems / 1.2：
The Present State of LPV Identification / 1.3：
The Identification Cycle / 1.3.1：
General Picture of LPV Identification / 1.3.2：
LPV-Io Representation Based Methods / 1.3.3：
LPV-SS Representation Based Methods / 1.3.4：
Similarity to Other System Classes / 1.3.5：
Challenges and Open Problems / 1.4：
Perspectives of Orthonormal Basis Function Models / 1.5：
The Gain-Scheduling Perspective / 1.5.1：
The Global Identification Perspective / 1.5.2：
Approximation via OBF Structures / 1.5.3：
The Goal of the Book / 1.6：
Overview of Contents / 1.7：
LTI System Identification and the Role of OBFs / 2：
The Concept of Orthonormal Basis Functions / 2.1：
Signal Spaces and Inner Functions / 2.2：
General Class of Orthonormal Basis Functions / 2.3：
Takenaka-Malmquist Basis / 2.3.1：
Hambo Basis / 2.3.2：
Kautz Basis / 2.3.3：
Laguerre Basis / 2.3.4：
Pulse Basis / 2.3.5：
Orthonormal Basis Functions of MIMO Systems / 2.3.6：
Basis Functions in Continuous-Time / 2.3.7：
Modeling and Identification of LTI Systems / 2.4：
The Identification Setting / 2.4.1：
Model Structures / 2.4.2：
Properties / 2.4.3：
Linear Regression / 2.4.4：
Identification with OBFs / 2.4.5：
Pole Uncertainty of Model Estimates / 2.4.6：
Validation in the Prediction-Error Setting / 2.4.7：
The Kolmogorov n-Width Theory / 2.5：
Conclusions / 2.6：
LPV Systems and Representations / 3：
General Class of LPV Systems / 3.1：
Parameter Varying Dynamical Systems / 3.1.1：
Representations of Continuous-Time LPV Systems / 3.1.2：
Representations of Discrete-Time LPV Systems / 3.1.3：
Equivalence Classes and Relations / 3.2：
Equivalent Kernel Representations / 3.2.1：
Equivalent IO Representations / 3.2.2：
Equivalent State-Space Representations / 3.2.3：
Properties of LPV Systems and Representations / 3.3：
State-Observability and Reachability / 3.3.1：
Stability of LPV Systems / 3.3.2：
Gramians of LPV State-Space Representations / 3.3.3：
LPV Equivalence Transformations / 3.4：
State-Space Canonical Forms / 4.1：
The Observability Canonical Form / 4.1.1：
Reachability Canonical Form / 4.1.2：
Companion Canonical Forms / 4.1.3：
Transpose of SS Representations / 4.1.4：
LTI vs. LPV State Transformation / 4.1.5：
From State-Space to the Input-Output Domain / 4.2：
From the Input-Output to the State-Space Domain / 4.3：
The Idea of Recursive State-Construction / 4.3.1：
Cut-and-Shift in Continuous-Time / 4.3.2：
Cut-and-Shift in Discrete-Time / 4.3.3：
State-Maps and Polynomial Modules / 4.3.4：
State-Maps Based on Kernel Representations / 4.3.5：
State-Maps Based on Image-Representations / 4.3.6：
State-Construction in the MIMO Case / 4.3.7：
LPV Series-Expansion Representations / 4.4：
Relevance of Series-Expansion Representations / 5.1：
Impulse Response Representation of LPV Systems / 5.2：
Filter Form of LPV-IO Representations / 5.2.1：
Series Expansion in the Pulse Basis / 5.2.2：
The Impulse Response Representation / 5.2.3：
LPV Series Expansion by OBFs / 5.3：
The OBF Expansion Representation / 5.4：
Series Expansions and Gain-Scheduling / 5.5：
The Role of Gain-Scheduling / 5.5.1：
Optimality of the Basis in the Frozen Sense / 5.5.2：
Optimality of the Basis in the Global Sense / 5.5.3：
Discretization of LPV Systems / 5.6：
The Importance of Discretization / 6.1：
Discretization of LPV System Representations / 6.2：
Discretization of State-Space Representations / 6.3：
Complete Method / 6.3.1：
Approximative State-Space Discretization Methods / 6.3.2：
Discretization Errors and Performance Criteria / 6.4：
Local Discretization Errors / 6.4.1：
Global Convergence and Preservation of Stability / 6.4.2：
Guaranteeing a Desired Level of Discretization Error / 6.4.3：
Switching Effects / 6.4.4：
Properties of the Discretization Approaches / 6.5：
Discretization and Dynamic Dependence / 6.6：
Numerical Example / 6.7：
LPV Modeling of Physical Systems / 6.8：
Towards Model Structure Selection / 7.1：
General Questions of LPV Modeling / 7.2：
Modeling of Nonlinear Systems in the LPV Framework / 7.3：
First Principle Models / 7.3.1：
Linearization Based Approximation Methods / 7.3.2：
Multiple Model Design Procedures / 7.3.3：
Substitution Based Transformation Methods / 7.3.4：
Automated Model Transformation / 7.3.5：
Summary of Existing Techniques / 7.3.6：
Translation of First Principle Models to LPV Systems / 7.4：
Problem Statement / 7.4.1：
The Transformation Algorithm / 7.4.2：
Handling Non-Factorizable Terms / 7.4.3：
Properties of the Transformation Procedure / 7.4.4：
Optimal Selection of OBFs / 7.5：
Perspectives of OBFs Selection / 8.1：
Kolmogorov n-Width Optimality in the Frozen Sense / 8.2：
The Fuzzy-Kolmogorov c-Max Clustering Approach / 8.3：
The Pole Clustering Algorithm / 8.3.1：
Properties of the FKcM / 8.3.2：
Simulation Example / 8.3.3：
Robust Extension of the FKcM Approach / 8.4：
Questions of Robustness / 8.4.1：
Basic Concepts of Hyperbolic Geometry / 8.4.2：
Pole Uncertainty Regions as Hyperbolic Objects / 8.4.3：
The Robust Pole Clustering Algorithm / 8.4.4：
Properties of the Robust FKcM / 8.4.5：
LPV Identification via OBFs / 8.4.6：
Aim and Motivation of an Alternative Approach / 9.1：
OBFs Based LPV Model Structures / 9.2：
The LPV Prediction-Error Framework / 9.2.1：
The Wiener and the Hammerstein OBF Models / 9.2.2：
Properties of Wiener and Hammerstein OBF Models / 9.2.3：
OBF Models vs. Other Model Structures / 9.2.4：
Identification of W-LPV and H-LPV OBF Models / 9.2.5：
Identification with Static Dependence / 9.3：
LPV Identification with Fixed OBFs / 9.3.1：
Local Approach / 9.3.3：
Global Approach / 9.3.4：
Examples / 9.3.5：
Approximation of Dynamic Dependence / 9.4：
Feedback-Based OBF Model Structures / 9.4.1：
Properties of Wiener and Hammerstein Feedback Models / 9.4.2：
Identification by Dynamic Dependence Approximation / 9.4.3：
Example / 9.4.4：
Extension towards MIMO Systems / 9.5：
Scalar Basis Functions / 9.5.1：
Multivariable Basis Functions / 9.5.2：
Multivariable Basis Functions in the Feedback Case / 9.5.3：
General Remarks on the MIMO Extension / 9.5.4：
Proofs / 9.6：
Proofs of Chapter 3 / A.1：
The Injective Cogenerator Property / A.1.1：
Existence of Full Row Rank KR Representation / A.1.2：
Elimination Property / A.1.3：
State-Kernel Form / A.1.4：
Left/Right-Side Unimodular Transformation / A.1.5：
Proofs of Chapter 5 / A.2：
LPV Series Expansion, Pulse Basis / A.2.1：
LPV Series Expansion, OBFs / A.2.2：
Proofs of Chapter 8 / A.3：
Optimal Partition / A.3.1：
h-Center Relation / A.3.2：
h-Segment Worst-Case Distance / A.3.4：
h-Disc Worst-Case Distance / A.3.6：
Convexity / A.3.7：
Optimal Robust Partition / A.3.8：
Proofs of Chapter 9 / A.4：
Representation of Dynamic Dependence / A.4.1：
References
Index
Introduction / 1：
New Challenges for System Identification / 1.1：
The Birth of LPV Systems / 1.2：
72.
図書
herausgeber Erich Rothacker ; im Auftrage der Kommission für Philosophie der Akademie der Wissenschaften und der Literatur zu Mainz
出版情報:
Bonn : Bouvier, 1955- v. ; 24-26 cm
子書誌情報:
loading…
所蔵情報:
loading…
73.
図書
Jan Willers Amtrup
目次情報:
続きを見る
Overview
Introduction / 1：
Incremental Natural Language Processing / 1.1：
Incremental Speech Understanding / 1.2：
Incremental Architectures and the Architecture of MILC / 1.3：
Summary / 1.4：
Graph Theory and Natural Language Processing / 2：
General Definitions / 2.1：
The Use of Word Graphs for Natural Language Processing Systems / 2.2：
Evaluation of Word Graphs: Size and Quality Measures / 2.3：
Evaluation of Word Graphs: Quality Measures / 2.4：
Further Operations on Word Graphs / 2.5：
Removing Isolated Silence / 2.5.1：
Removing Consecutive Silence / 2.5.2：
Removing All Silence Edges / 2.5.3：
Merging Mutually Unreachable Vertices / 2.5.4：
Hypergraphs / 2.6：
Formal Definition of Hypergraphs / 2.6.1：
Merging of Hyperedges / 2.6.2：
Combination of Hyperedges / 2.6.3：
Search in Graphs / 2.7：
Unification-Based Formalisms for Translation in Natural Language Processing / 2.8：
Unification-Based Formalisms for Natural Language Processing / 3.1：
Definition of Typed Feature Structures with Appropriateness / 3.1.1：
Type Lattices / 3.1.2：
Feature Structures / 3.1.3：
Functions as Values of Features / 3.1.4：
Unification-Based Machine Translation / 3.2：
Architecture and Implementation of the Formalism / 3.3：
Definition and Implementation of Type Lattices / 3.3.1：
Definition and Implementation of Feature Structures / 3.3.2：
MILC: Structure and Implementation / 3.4：
Layered Charts / 4.1：
Communication Within the Application / 4.2：
Communication Architecture of an Application / 4.2.1：
Channel Models / 4.2.2：
Information Service and Synchronization / 4.2.3：
Termination / 4.2.4：
Overview of the Architecture of MILC / 4.3：
Word Recognition / 4.4：
Idiom Processing / 4.5：
Parsing / 4.6：
Derivation of Verbal Complexes / 4.6.1：
Spontaneous Speech and Word Recognition / 4.6.2：
Structure and Processing Strategies / 4.6.3：
Utterance Integration / 4.7：
Transfer / 4.8：
Chart-Based Transfer / 4.8.1：
The Implementation of Transfer for MILC / 4.8.2：
Generation / 4.9：
Visualization / 4.10：
Extensions / 4.11：
Extension of the Architecture / 4.11.1：
Anytime Translation / 4.11.2：
System Size / 4.12：
Experiments and Results / 4.13：
Translation / 5.1：
Data Material / 5.2.1：
Linguistic Knowledge Sources / 5.2.2：
Experiments and System Parameters / 5.2.3：
Evaluation / 5.2.4：
Comparison With Non-incremental Methods / 5.2.5：
Conclusion and Outlook / 5.4：
Bibliography
Glossary
Index
Overview
Introduction / 1：
Incremental Natural Language Processing / 1.1：
74.
図書
Markus Schumacher
目次情報:
続きを見る
Introduction / 1：
Motivation / 1.1：
Problem Statement / 1.2：
Solution / 1.3：
Unaddressed Related Issues / 1.4：
Structural Overview / 1.5：
Patterns in Software Development / 2：
Pattern History / 2.1：
Basic Pattern Concepts / 2.3：
Collections of Patterns / 2.4：
Pattern Classification Approaches / 2.5：
Writing Patterns / 2.6：
Pattern Mining Approaches / 2.6.1：
Quality Assurance by Community Processes / 2.6.2：
Integration of Patterns / 2.6.3：
Problem Solving with Patterns / 2.7：
Summary / 2.8：
Ontologies / 3：
Security Knowledge Process / 3.1：
Knowledge Representation with Ontologies / 3.3：
Development of Ontologies / 3.4：
Design Criteria / 3.4.1：
Methodologies / 3.4.2：
Ontology Representation Languages / 3.4.3：
Tool Support / 3.4.4：
The Human Factor / 3.5：
CaseStudies / 4.1：
Internet/Telephony Integration / 4.2.1：
Instant Messaging / 4.2.2：
Findings / 4.2.3：
Why Security Fails / 4.3：
Related Work / 4.4：
Classifying Security Improvement Artifacts / 4.5：
Classification Framework / 5.1：
Security Engineering / 5.2.1：
System Engineering / 5.2.2：
The Zachman Framework / 5.2.3：
Classification Metrics / 5.2.4：
Requirements Definition / 5.3：
Evaluation Criteria / 5.3.1：
Security Management Standards / 5.3.2：
Security Policy / 5.3.3：
Analysis / 5.3.4：
Goal Trees / 5.4.1：
Risk Analysis / 5.4.2：
Work Factor Concept / 5.4.3：
Prioritization Schemes / 5.4.4：
Architecture and Design / 5.4.5：
Modeling Techniques / 5.5.1：
Formal Methods / 5.5.2：
Building / 5.5.3：
Secure Programming Guidelines / 5.6.1：
SecurityBuildingBlocks / 5.6.2：
Best Security Practices / 5.6.3：
Testing / 5.6.4：
Conceptual Testing / 5.7.1：
Runtime Testing / 5.7.2：
Summary and Conclusions / 5.7.3：
Conclusions / 5.8.1：
Toward a Security Core Ontology / 6：
Methodology / 6.1：
Definitions of Concepts / 6.4：
Relations between Concepts / 6.5：
Foundations of Security Patterns / 6.6：
Security Pattern Example / 7.1：
History of Security Patterns / 7.3：
PioneeringSecurityPatterns / 7.3.1：
Other Contributions / 7.3.2：
Security Pattern Community / 7.3.3：
What Is a Security Pattern? / 7.4：
Security Pattern Template / 7.4.1：
Application of Security Patterns / 7.4.2：
Forces Related to Security / 7.4.3：
Organizing Security Patterns / 7.4.4：
Mining Security Patterns / 7.5：
Completeness of Security Pattern Collections / 7.5.1：
Security Information Providers / 7.5.2：
Security Standards as Sources for Pattern Mining / 7.5.3：
A Theoretical Model for Security Patterns / 7.6：
Modeling Security Patterns / 8.1：
Core Definitions / 8.4：
Primary Security Pattern Relations / 8.5：
Internal and External Coverage / 8.6：
Why Coverage Implies a State of Security / 8.7：
New Applications of Security Patterns / 8.8：
A Security Pattern Search Engine / 9.1：
A Pattern-Based Expert System? / 9.2.1：
Use Cases / 9.2.2：
Prototype / 9.2.3：
Enhancing Security Patterns with Meta-information / 9.2.4：
Codifying the Knowledge Base and Inference Rules / 9.3.1：
Basic Applications / 9.3.2：
Advanced Techniques / 9.4：
Improvement of Search and Retrieval Capabilities / 9.4.1：
Considering Side-Effects / 9.4.2：
Maintaining Security Pattern Repositories / 9.4.3：
Summary and Outlook / 9.5：
Sources for Mining Security Patterns / A：
Example Security Patterns and Annotations / B：
Ontology Development / C：
Logic Primer / D：
Gaining Security Expertise / E：
References
Index
Introduction / 1：
Motivation / 1.1：
Problem Statement / 1.2：
75.
図書
edited by S.M. Rao
目次情報:
続きを見る
Preface
Acknowledgments
Contributors
Introduction / Miller1.：
An Initial Exploration of Time Domain Phenomena / 1.1：
The Infinite-Length Wire Antenna / 1.1.1：
The Finite-Length Wire Antenna / 1.1.2：
The Finite-Length Wire Scatterer / 1.1.3：
Late-Time Radiation from an Impulsively Excited Perfect Conductor / 1.1.4：
Some Special Capabilities of Time Domain Models / 1.1.5：
Modeling Chocies in CEM / 1.2：
Why Model in the Time Domain? / 1.2.1：
Evolution of Time Domain Modeling / 1.2.2：
Some General References / 1.2.3：
General Aspects of Time Domain Modeling / 1.3：
Model Development / 1.3.1：
Explicit vs Implicit Solution / 1.3.2：
Excitation Requirements / 1.3.3：
TD Solution / 1.3.4：
Time Domain Integral Equation Modeling / 1.4：
Some Representative TDIEs / 1.4.1：
A Prototype TDIE Model / 1.4.2：
Alternate Forms for a TDIE Solution / 1.4.3：
Excitation of a TDIE Model / 1.4.4：
Physical Implication of a TDIE Explicit Model / 1.4.5：
A Near-Neighbor TD Approximation / 1.4.6：
Time Domain Differential Equation Modeling / 1.5：
Space-Time Sampling of TDDE / 1.5.1：
Some Spatial-Mesh Alternatives / 1.5.2：
Mesh Closure Conditions / 1.5.3：
Handling Small Features in DE Models / 1.5.4：
Obtaining Far Fields from DE Models / 1.5.5：
Variations of TDDE Models / 1.5.6：
Comparison of TDDE and TDIE Models / 1.5.7：
Specific Issues Related to Time Domain Modeling / 1.6：
Increasing the Stability of the Time-Stepping Solution / 1.6.1：
Exploiting EM Singularities / 1.6.2：
Signal Processing as a Part of TD Modeling / 1.6.3：
Total-Field and Scattered-Field Formulations / 1.6.4：
Handling Frequency Dispersion and Loading in TD Models / 1.6.5：
Handling Medium and Component Nonlinearities or Time Variations in TD Models / 1.6.6：
Hybrid TD Models / 1.6.7：
The Concept of Pseudo-Time in Iterative FD Solutions / 1.6.8：
Exploiting Symmetries in TD Modeling / 1.6.9：
Concluding Remarks / 1.7：
Bibliography
Wire Structures: TDIE Solution / Rao ; Sarkar2.：
Basic Analysis / 2.1：
Analysis of a Straight Wire / 2.2：
Method of Moments Solution / 2.2.1：
Conjugate Gradient Method Solution / 2.2.2：
Numerical Example / 2.2.3：
Analysis of an Arbitrary Wire / 2.3：
Moment Method Solution / 2.3.1：
Conjugate Gradient Method / 2.3.2：
Numerical Examples / 2.3.3：
Implicit Solution Scheme / 2.4：
Application to Arbitrary Wire / 2.4.1：
Numerical Implementation / 2.4.2：
Analysis of Multiple Wires and Wire Junctions / 2.4.3：
Infinite Conducting Cylinders: TDIE Solution / Vechinski2.6：
Integral Equation Formulation / 3.1：
Discretization Scheme / 3.2：
TM Incidence: EFIE Formulation / 3.3：
Explicit Solution Procedure / 3.3.1：
Implicit Solution Procedure / 3.3.2：
TE Incidence: EFIE Formulation / 3.3.3：
TE Incidence: HFIE Formulation / 3.4.1：
Finite Conducting Bodies: TDIE Solution / 3.5.1：
Numerical Solution Scheme / 4.1：
Explicit Numerical Method / 4.2.1：
Implicit Numerical Method / 4.2.2：
Efficiency Considerations / 4.2.3：
Far-Scattered Fields / 4.2.4：
Near-Scattered Fields / 4.3.1：
Extrapolation of Time Domain Response / 4.5：
Matrix Pencil Method / 4.5.1：
Total Least Squares Matrix Pencil / 4.5.2：
Dielectric Bodies: TDIE Solution / 4.5.3：
Two-Dimensional Cylinders / 5.1：
Numerical Solution Procedure / 5.2.1：
Three-Dimensional Bodies / 5.2.2：
Finite-Difference Time Domain Method / Umashankar5.3.1：
Introduction to FDTD / 6.1：
Pulse Propagation in a Lossy, Inhomogeneous, Layered Medium / 6.2：
Propagation of Half-Sine Pulse / 6.2.1：
Remote Sensing of Inhomogeneous, Lossy, Layered Media / 6.3：
Profile Inversion Results / 6.3.1：
Key Elements of FDTD Modeling Theory / 6.4：
FDTD Formulation for Two-Dimensional Closed-Region Problems / 6.5：
FDTD Formulation for TM and TE Cases / 6.5.1：
Hollow Rectangular Waveguide / 6.5.2：
Dielectric Slab-Loaded Rectangular Waveguide / 6.5.3：
Shielded Microstrip Lines / 6.5.4：
FDTD Formulation for Two-Dimensional Open-Region Problems / 6.6：
Absorbing Radiation Boundary Condition / 6.6.1：
Second-Order Radiation Boundary Condition / 6.6.2：
Plane Wave Source Condition / 6.7：
Near- to Far-Field Transformation / 6.8：
FDTD Modeling of Curved Surfaces / 6.9：
Perfectly Conducting Object: The TE Case / 6.9.1：
Perfectly Conducting Object: The TM Case / 6.9.2：
Homogeneous Dielectric Object: The TE Case / 6.9.3：
FDTD Formulation for Three-Dimensional Closed-Region Problems / 6.10：
Three-Dimensional Full-Wave Analysis / 6.10.1：
Compact Two-Dimensional FDTD Algorithm / 6.10.2：
Evaluation of Dispersion Characteristics / 6.10.3：
FDTD Formulation for Three-Dimensional Open-Region Problems / 6.11：
Three-Dimensional Plane Wave Source Condition / 6.11.1：
Near- to Far-Field Transformation for the Three-Dimensional Case / 6.12：
RCS of a Flat-Plate Scatterer / 6.12.1：
Computer Resources and Modeling Implications / 6.13：
Transmission Line Modeling Method / Gothard ; German6.14：
The Two-Dimensional TLM / 7.1：
Time Domain Wave Equation / 7.1.1：
Time Domain Transmission Line Equation / 7.1.2：
Equating Maxwell's and the Circuit Equations / 7.1.3：
General Scattering Matrix Theory / 7.1.4：
Applying Scattering Theory to the Free-Space Shunt T-Line / 7.1.5：
Modeling Inhomogeneous Lossy Media / 7.1.6：
Excitation of the TLM Mesh and Metallic Boundaries / 7.1.7：
TLM Mesh Truncation Conditions / 7.1.8：
Discretization of the TLM Spatial Grid / 7.1.9：
TLM Output / 7.1.10：
The Series Node and Duality / 7.1.11：
Outline of the Algorithm for Two-Dimensional TLM Code / 7.1.12：
Three-Dimensional TLM / 7.2：
Special Features in TLM / 7.3：
Frequency-Dependent Material / 7.3.1：
Alternative Meshing Schemes / 7.3.2：
Antenna Array / 7.4：
Electromagnetic Scattering / 7.4.2：
Finite-Element Time Domain Method / Roy ; Salazar-Palma ; Djordjevic7.5：
Incident Field / 8.1：
Transverse Magnetic Case / 8.2：
Formulation / 8.2.1：
Finite-Element Procedure / 8.2.2：
Time-Stepping Procedure / 8.2.3：
Numerical Results / 8.2.4：
Transverse Electric Case / 8.3：
Finite-Volume Time Domain Method / Bonnet ; Ferrieres ; Michielsen ; Klotz ; Roumiguieres8.3.1：
Maxwell's Equations as a Hyperbolic Conservative System / 9.1：
The Conservative Form of Maxwell's Equations / 9.1.1：
Characteristics and Wavefront Propagation / 9.1.2：
An Elementary Form of the Finite-Volume Method / 9.1.3：
Finite-Volume Discretization of Maxwell's Equations / 9.2：
Spatial Discretizations / 9.2.1：
Temporal Discretization / 9.2.2：
Consistency and Stability / 9.2.3：
Hybridization of the FVTD Method with Other Models and Methods / 9.3：
Thin-Wire Models in the FVTD Method / 9.3.1：
Hybridization of the FVTD and the FDTD Methods / 9.3.2：
Another Approach of the Finite-Volume Approach / 9.3.3：
Dielectric Structures / 9.4：
Thin Screens with Finite Conductivity / 9.4.2：
Thin Wires / 9.4.3：
Index / 9.5：
Preface
Acknowledgments
Contributors
76.
図書
Hermann Hellwagner, Alexander Reinefeld (eds.)
目次情報:
続きを見る
SCI and Competitive Interconnects for Cluster Computing / Part I：
The SCI Standard and Applications of SCI / Hermann Hellwagner1：
Introduction / 1.1：
SCI Overview / 1.2：
Background / 1.2.1：
Goals / 1.2.2：
Concepts / 1.2.3：
Discussion / 1.2.4：
The SCI Standard and Some Extensions / 1.3：
Logical Layer / 1.3.1：
Cache Coherence Layer / 1.3.2：
Extensions / 1.3.3：
Applications of SCI / 1.4：
System Area Network for Clusters / 1.4.1：
Memory Interconnect for Cache-Coherent Multiprocessors / 1.4.2：
I/O Subsystem Interconnect / 1.4.3：
Large-Scale Data Acquisition System / 1.4.4：
Related Communication Networks and Concepts / 1.5：
Concluding Remarks / 1.6：
A Comparison of Three Gigabit Technologies: SCI, Myrinet and SGI/Cray T3D / Christian Kurmann ; Thomas Stricker2：
Levels of Comparison / 2.1：
Direct Deposit / 2.2.1：
Message Passing (MPI/PVM) / 2.2.2：
Protocol Emulation (TCP/IP) / 2.2.3：
Gigabit Network Technologies / 2.3：
The Intel 80686 Hardware Platform / 2.3.1：
Myricom Myrinet Technology / 2.3.2：
Dolphin PCI-SCI Technology / 2.3.3：
The SGI/Cray T3D - A Reference Point / 2.3.4：
ATM: QoS - But Still Short of a Gigabit/s / 2.3.5：
Gigabit Ethernet - An Outlook / 2.3.6：
Transfer Modes / 2.4：
Overview / 2.4.1：
"Native" and "Alternate" Transfer Modes in the Three Architectures / 2.4.2：
Performance Evaluation / 2.5：
Performance of Local Memory Copy / 2.5.1：
Performance of Direct Transfers to Remote Memory / 2.5.2：
Performance of MPI/PVM Transfers / 2.5.3：
Performance of TCP/IP Transfers / 2.5.4：
Discussion and Comparison / 2.5.5：
Summary / 2.6：
SCI Hardware / Part II：
Dolphin SCI Adapter Cards / Marius Christian Liaaen ; Hugo Kohmann3：
Overview of the Adapter Cards / 3.1：
Operating Modes of the SCI Cards / 3.3：
SCI Requester / 3.4：
Address Mapping / 3.4.1：
SCI Transaction Handling / 3.4.2：
SCI Packet Requester / 3.4.3：
SCI Responder / 3.5：
Mailbox / 3.5.1：
Access Protection / 3.5.2：
Atomic Access / 3.5.3：
Host Bridge Capabilities / 3.5.4：
DMA Transfers / 3.6：
DMA Transfers on the SBus Card / 3.6.1：
DMA Transfers on the PCI Card / 3.6.2：
Interrupter / 3.7：
Concurrency Issues / 3.8：
Write Assembly / 3.8.1：
Efficient Store Barrier / 3.8.2：
Performance / 3.9：
Applications and Topologies / 3.10：
SAN Interface Adapter / 3.10.1：
Remote I/O Connection and Data Acquisition / 3.10.2：
Switches and Topologies / 3.10.3：
Cluster Software / 3.11：
The TUM PCI/SCI Adapter / Georg Acher ; Wolfgang Karl ; Markus Leberecht4：
The PCI/SCI Adapter Architecture / 4.1：
SCI Packet Encoding and Decoding / 4.3：
Overview of Packet Processing / 4.3.1：
Choosing the Technology / 4.3.2：
Internal Structure of the FPGA / 4.3.3：
Structure of the Packet Manag er as a Microcode Sequencer / 4.3.4：
Microcode Examples / 4.3.5：
Benefits of the Micro Sequencer / 4.3.6：
The SCI Unit / 4.4：
Preliminary Results for the PCI/SCI Adapter / 4.5：
Related Work / 4.6：
Conclusion / 4.7：
Interconnection Networks with SCI / Part III：
Low-Level SCI Protocols and Their Application to Flexible Switches / Andreas C. Döring ; Wolfgang Obelöer ; Gunther Lustig ; Erik Maehle5：
Data Format of SCI Packets / 5.1：
Flow Control / 5.3：
Flow Control in Rings / 5.3.1：
Packet Sequence in SCI / 5.3.2：
Determination of State Transitions / 5.3.3：
Bandwidth Multiplexing / 5.4：
Bandwidth Management in One Ring / 5.4.1：
Idle Symbols / 5.4.2：
Time-Out Determination / 5.4.3：
Network Interface / 5.5：
Requirements / 5.5.1：
Products / 5.5.2：
Routers / 5.6：
Products and Challenges / 5.6.1：
Flexible Router / 5.6.3：
Strip-off Decision / 5.6.4：
Routing Decision and Topology / 5.6.5：
Rule-Based Routing / 5.7：
Conclusion and Outlook / 5.8：
SCI Rings, Switches, and Networks for Data Acquisition Systems / Harald Richter ; Richard Kleber ; Matthias Ohlenroth6：
SCI-based Data Acquisition Systems / 6.1：
SCINET Test Beds / 6.3：
Measurement Results / 6.4：
SCI Switches / 6.5：
Efficient Use of SCI Switches / 6.6：
Multistage SCI Networks / 6.7：
Simulation Results / 6.8：
Summary and Conclusions / 6.9：
Scalability of SCI Ringlets / Geir Horn7：
Do SCI Ringlets Scale in Number of Nodes? / 7.1：
Ringlet Bandwidth Model / 7.2：
Transaction Formats / 7.2.1：
Packet Generation / 7.2.2：
Address Distribution / 7.2.3：
Locality / 7.2.4：
Bypass Rate / 7.2.5：
Echo Packet Rate / 7.2.6：
Output Link Utilization Factor / 7.2.7：
Scalability Evaluation / 7.3：
Common Assumptions / 7.3.1：
Uniform Ringlet Traffic / 7.3.2：
Non-uniform Ringlet Traffic / 7.3.3：
Changing Packet Lengths / 7.3.4：
Affordable Scalability Using Multi-Cubes / HÃ¥kon Bugge ; Knut Omang7.4：
Interconnect Overview / 8.1：
Methodology / 8.3：
Analysis / 8.4：
"Hot-Link" Analysis / 8.4.1：
"Hot-B-Link" Analysis / 8.4.2：
Results / 8.5：
Conclusions / 8.6：
Device Driver Software and Low-Level APIs / Part IV：
Interfacing SCI Device Drivers to Linux / Roger Butenuth ; Hans-Ulrich Heiss9：
Layers of Functionality / 9.1：
Address Spaces / 9.2.1：
Levels of Hardware Abstraction / 9.2.2：
Resource Management / 9.2.3：
Virtual Mapping / 9.2.4：
Robustness / 9.2.5：
Why Linux? / 9.3：
Interfaces of the Driver / 9.4：
Hardware / 9.4.1：
Linux / 9.4.2：
User Processes / 9.4.3：
SCI Drivers on Other Nodes / 9.4.4：
SCI Physical Layer API / Volker Lindenstruth ; David B. Gustavson9.5：
Scope of the Standard / 10.1：
SCI Physical Layer API Architecture and Features / 10.2：
Exception Handling / 10.2.1：
Endianness / 10.2.2：
Supported Data Types / 10.3：
Miscellaneous Procedures / 10.4：
Address Translation Model / 10.5：
Global Object Identifier / 10.5.1：
SCI Global Address Resolution / 10.5.2：
Shared Memory Transactions / 10.6：
Packet Transactions / 10.7：
Block Transactions / 10.8：
Message Passing Transactions / 10.9：
Cache Transactions / 10.10：
Message Passing Libraries / 10.11：
SCI Sockets Library / Josef Weidendorfer11：
Rationale / 11.1：
Features and Design / 11.1.2：
Features / 11.2.1：
Components / 11.2.2：
Communication via the SSLib / 11.2.3：
Connection Setup / 11.2.4：
Handling Special System Calls / 11.2.5：
Other Calls Intercepted and Handled by the SSLib / 11.2.6：
Out of Band Data / 11.2.7：
Implementation Aspects / 11.3：
Communication Among Components / 11.3.1：
SSLib Layers / 11.3.2：
Choice of Most Efficient Communication Mechanism / 11.3.3：
SSLib Implementations / 11.3.4：
Control Transfers / 11.3.5：
Functional Tests and Performance / 11.4：
TCP/IP over SCI under Linux / Hüseyin Taskin11.5：
SCIP Structure / 12.1：
Packet Driver Interface / 12.2.1：
Hardware Address Resolution / 12.2.2：
Other Implementation Issues / 12.2.3：
Configuration / 12.3：
Latency / 12.3.2：
Throughput / 12.3.3：
PVM for SCI Clusters / Markus Fischer ; Alexander Reinefeld12.4：
Parallel Virtual Machine / 13.1：
PVM Implementations / 13.2.1：
Models for Zero-Memory-Copy Data Transfer / 13.2.2：
SCI Communication Model / 13.3：
PVM-SCI / 13.4：
System Architecture / 13.4.1：
Supporting Multiple Interconnects / 13.4.2：
Reducing Memory Copies / 13.4.3：
Ring Buffer Management / 13.4.4：
Performance Results / 13.4.5：
ScaMPI - Design and Implementation / L.P. Huse ; K. Omang ; H. Bugge ; H. Ry ; A.T. Haugsdal ; E. Rustad13.5：
Scali Systems / 14.1：
The SCI Memory Model / 14.3：
Coordinating Use of Shared Locations / 14.3.1：
Ensuring Safe Data Transport in SCI - Checkpointing / 14.3.2：
Shared Address Space Programming without the Drawbacks / 14.3.3：
ScaMPI Design Goals / 14.4：
ScaMPI Implementation / 14.5：
Fault Tolerance / 14.5.1：
User Friendliness / 14.5.2：
Third Party Software / 14.5.3：
Barrier / 14.6：
All-to-All Communication / 14.6.2：
Shared Memory Programming Models and Runtime Mechanisms / 14.7：
Shared Memory vs Message Passing on SCI: A CaseStudy Using Split-C / Max Ibel ; Michael Schmitt ; Klaus Schauser ; Anurag Acharya15：
Introduction to Split-C / 15.1：
Introduction to Active Messages / 15.1.2：
Message-Passing Implementation / 15.2：
Active Messages on Top of SCI / 15.2.1：
Split-C on Top of Active Messages / 15.2.2：
Shared Memory Implementation / 15.3：
Split-C on Top of SCI / 15.3.1：
Experimental Evaluation / 15.4：
Micro-benchmarks / 15.4.1：
SCI and Competitive Interconnects for Cluster Computing / Part I：
The SCI Standard and Applications of SCI / Hermann Hellwagner1：
Introduction / 1.1：
77.
図書
Patrick Lambrix
目次情報:
続きを見る
Background / Part I：
Introduction / 1：
Motivation / 1.1：
Outline / 1.2：
Conventions / 1.3：
Description Logics / 2：
Terminological Knowledge / 2.1：
Syntax / 2.1.1：
Semantics / 2.1.2：
Subsumption / 2.1.3：
Assertional Knowledge / 2.2：
CLASSIC / 2.3：
Composite Objects / 3：
Composite Objects in Different Areas / 3.1：
Mereology / 3.1.1：
Cognitive Science and Linguistics / 3.1.2：
Databases / 3.1.3：
Early Approaches in Knowledge Representation / 3.1.4：
Summary / 3.1.5：
A Basis for Part-Of Representation / 3.2：
Mereological Assumptions / 3.2.1：
Scope of the Framework / 3.2.2：
Part-Of in Description Logics / 4：
General Frameworks / 4.1：
A Framework for Physical Whole-Part Relations / 4.1.1：
A Framework with Specialized Role Constructors and Quantifiers / 4.1.2：
A Framework for Part-Of in Engineering Applications / 4.1.3：
Specific Issues / 4.2：
Composition Constructor / 4.2.1：
Transitivity Aspects / 4.2.2：
Part-Of in an Object-Based Framework / 4.2.3：
Theory / 4.3：
A Framework for Part-Of Reasoning in Description Logics / 5：
Part-Of Hierarchy for Individuals / 5.1：
Implemented Functionality / 5.5：
Extending the Framework / 5.6：
Extended Language / 6.1：
Compositional Inclusion for Individuals / 6.2.1：
Modules and Compositional Inclusion / 6.3.1：
Modules and Compositional Inclusion for Individuals / 6.3.2：
Compositional Inclusion for Concepts / 6.4：
Composes / 6.5：
Assembly / 6.6：
Compositional Assembly / 6.6.1：
Compositional Extension / 6.6.2：
Algorithm / 6.6.3：
Preference Relation for Compositional Extension / 6.6.4：
Completion / 6.7：
Preference Relation for Completion / 6.7.1：
Comparison of the Framework with Other Approaches / 6.8：
Model for Part-Of / 7.1：
Part-Of in the Description Logic / 7.2：
Subsumption Relationships / 7.3：
Specialized Inferences / 7.4：
Compositional Inclusion Hierarchy for Concepts / 7.5：
Application Areas / Part III：
Domain Modeling in an Agent-Oriented Application / 8：
dMARS / 8.1：
Reaction Control System / 8.3：
Modeling the Belief Knowledge Base / 8.4：
Advantages and Disadvantages / 8.5：
Advantages / 8.5.1：
Disadvantages / 8.5.2：
Conclusion / 8.6：
Document Management / 9：
Modeling the Document Management Domain / 9.1：
Useful Queries and Inferences / 9.3：
Top-Down Instantiation of Documents / 9.3.1：
Bottom-Up Instantiation of Documents / 9.3.2：
Inheritance via Part-Of / 9.3.3：
Recognition of Individuals / 9.3.4：
Retrieval / 9.3.5：
Learning Composite Concepts / 9.4：
Framework / 10.1：
Learning Task / 10.3：
Useful Operations / 10.4：
Least Common Subsumer / 10.4.1：
Specific Concepts / 10.4.2：
Learning by Using Concepts and Subsumption / 10.5：
Learning by Using Individuals / 10.5.2：
Learning by Using Concepts and Part-Of / 10.5.3：
Application / 10.6：
Document Search Using Content, Structure and Properties / 11：
Model / 11.1：
Query Language / 11.1.1：
Document Bases / 11.1.2：
Architecture / 11.2：
Knowledge Bases / 11.2.1：
Information Extractor / 11.2.2：
Kernel / 11.2.3：
User Interface / 11.2.4：
Prototype Implementation and Test Results / 11.3：
Related Work / 11.4：
Contributions / 11.5：
Future Work / 12.2：
References
Appendices / Part VI：
New User Functions / A：
Symbols / B：
Background / Part I：
Introduction / 1：
Motivation / 1.1：
78.
図書
Michael Schumacher
目次情報:
続きを見る
Introduction / 1：
Positioning / Part I：
Multi-Agent Systems / 2：
What Is an Autonomous Agent? / 2.1：
Definitions / 2.2.1：
Autonomyand Embodiment / 2.2.2：
Generic Agent Architectures / 2.2.3：
Characteristics of MASs / 2.3：
Modeling MASs / 2.4：
Objective Coordination / 2.4.1：
Subjective Coordination / 2.4.2：
Emergence / 2.4.3：
Our Target Class of MASs / 2.5：
A Generic Model for an Autonomous Agents' System / 2.5.1：
A Typical Application: Gathering Agents / 2.5.2：
Implementing MAS Applications / 2.6：
Languages for MAS Applications / 2.6.1：
Methodologies for MAS Applications / 2.6.2：
Using Coordination Models and Languages for DesigningandImplementingMASs / 2.6.3：
Coordination Models and Languages / 3：
What Is Coordination? / 3.1：
What Are Coordination Models and Languages? / 3.2：
Motivation / 3.2.1：
Key Elements / 3.2.2：
Data-Driven Coordination Models / 3.3：
Linda / 3.3.1：
Linda Based Models / 3.3.2：
Models Based on Multiset Rewriting / 3.3.3：
Process-Oriented Coordination Models / 3.4：
IWIM / 3.4.1：
Other Approaches / 3.4.2：
Hybrid Coordination Models / 3.5：
Prerequisites for a Coordination Model and Language / 3.6：
ECM and Its Instances / Part II：
The ECM Coordination Model / 4：
Blop / 4.1：
Process / 4.3：
Ports and Connections / 4.4：
Port Features / 4.4.1：
Connections / 4.4.2：
Port Matching / 4.5：
Events / 4.6：
ECM Instances / 4.7：
The STL Coordination Language / 5：
Blops / 5.1：
Processes / 5.3：
The STL+-+ Coordination Language / 5.4：
DesignDecisions / 6.1：
An Overview / 6.1.2：
Creationand Destruction ofPorts / 6.2：
Basic Port Types andTheir Connections / 6.4.3：
PortMatching / 6.5：
A Tutorial Example / 6.6：
The Restaurant of Dining Philosophers / 6.7.1：
General Description of the Implementation / 6.7.2：
The Restaurant Blop and the Waiter Agent / 6.7.3：
The Philosophers / 6.7.4：
Implementation of a Prototype / 6.8：
PT-PYM / 6.8.1：
Concurrency and Object-Orientation Integration / 6.8.3：
BlopsandAgents / 6.8.4：
Ports and Port Managers / 6.8.5：
Matching / 6.8.6：
Connection Setup / 6.8.7：
Discussion / 6.8.8：
STL+-+ as a Coordination Language / 6.9.1：
STL++ for MASs / 6.9.2：
The Agent&Co Coordination Language / 7：
Agents / 7.1：
Ports andConnections / 7.4：
Implementation / 7.5：
Case Studies in STL++ / Part III：
Collective Robotics Simulation / 8：
GlobalStructure / 8.1：
init Agent / 8.3：
Sub-environment Blops / 8.4：
init SimRobot Agent, New SimRobot_Evt Event / 8.5：
SimRobot Agent / 8.6：
subEnv Agent / 8.7：
taxi Agent / 8.8：
Trading System Simulation / 9：
The Trade World Blop / 9.1：
The Brokers and the Broker Assistants / 9.3：
The Trade Manager / 9.4：
Transactions / 9.5：
Conclusion / 10：
Core STL++ Interfaces / A：
World Class / A.1：
Blop Class / A.2：
Agent Class / A.3：
Port Template Classes / A.4：
KK Stream Ports / A.4.1：
S-Stream Ports / A.4.2：
Blackboard Ports / A.4.3：
Group Ports / A.4.4：
Event Class / A.5：
Condition Classes / A.6：
Macros and Miscellaneous Functions / A.7：
STL Code Example / B：
Linda, Gamma and Manifold Code Examples / C：
Bibliography
Introduction / 1：
Positioning / Part I：
Multi-Agent Systems / 2：
79.
図書
Xiaoyuan Tu
目次情報:
続きを見る
Introduction / 1：
Motivation / 1.1：
Challenges / 1.2：
Conventional Animation Techniques / 1.2.1：
Methodology: Artificial Life for Computer Animation / 1.3：
Criteria and Goals / 1.3.1：
Artificial Animals / 1.3.2：
From Physics to Realistic Locomotion / 1.3.3：
Realistic Perception / 1.3.4：
Realistic Behavior / 1.3.5：
Fidelity and Efficiency / 1.3.6：
Contributions and Results / 1.4：
Primary Contributions / 1.4.1：
Auxiliary Technical Contributions / 1.4.2：
Thesis Overview / 1.5：
Background / 2：
Physics-Based Modeling / 2.1：
Constraint-Based Approach / 2.1.1：
Motion Synthesis Approach / 2.1.2：
Behavioral Animation / 2.2：
Perception Modeling / 2.2.1：
Control of Behavior / 2.2.2：
The Modeling of Action Selection / 2.3：
Defining Action / 2.3.1：
Goals and Means / 2.3.2：
Previous Work / 2.3.3：
ITask Level Motion Planning
Summary / 2.4：
Functional Anatomy of an Artificial Fish / 3：
Motor System / 3.1：
Perception System / 3.2：
Behavior System / 3.3：
Biomechanical Fish Model and Locomotion / 4：
Discrete Physics-Based Models / 4.1：
Structure of the Dynamic Fish Model / 4.2：
Mechanics / 4.3：
Viscoelastic Units / 4.3.1：
Muscles and Hydrodynamics / 4.4：
Numerical Solution / 4.5：
System Matrix Assembling and the Skyline Storage Scheme / 4.5.1：
Algorithm Outline and Discussion / 4.5.2：
Motor Controllers / 4.6：
Muscle Motor Controllers / 4.6.1：
Pectoral Fin Motor Controllers / 4.6.2：
Modeling the Form and Appearance of Fishes / 5：
Constructing 3D Geometric Fish Models / 5.1：
Obtaining Texture Coordinates / 5.2：
Deformable Mesh / 5.2.1：
Texture-Mapped Models / 5.3：
Coupling the Dynamic and Display Models / 5.4：
Visualization of the Pectoral Motions / 5.5：
Perception Modeling for Animation / 6：
Overview of the Artificial Fish's Perception System / 6.2：
Vision Sensor Modeling / 6.3：
Perceptual Range / 6.3.1：
Occlusion / 6.3.2：
Functionality / 6.3.3：
Computing Visibility / 6.4：
Visibility of a Point / 6.4.1：
Visibility of Another Fish / 6.4.2：
Visibility of a Cylinder / 6.4.3：
Visibility of Seaweeds / 6.4.4：
Discussion / 6.4.5：
The Focusser / 6.5：
Focus of Attention in Animals / 6.5.1：
Design of the Focusser / 6.5.2：
From Perception to Behavior / 6.5.3：
An Example: Collision Detection / 6.6.1：
Synthetic Vision Models / 6.7：
The Behavior System / 7：
Effective Action Selection Mechanisms / 7.1：
Behavior Control and Ethology / 7.2：
The Intention Level / 7.2.1：
The Action Level / 7.2.2：
Habits / 7.2.3：
Mental State / 7.4：
Intention Generator / 7.5：
Why Hierarchy? / 7.5.1：
Intention-Guided Perception: Control of the Focusser / 7.6：
Persistence in Behavior / 7.7：
Behavior Memory / 7.7.1：
Inhibitory Gain and Fatigue / 7.7.2：
Persistence in Targeting / 7.7.3：
Behavior Routines / 7.8：
Primitive Behavior: Avoiding Potential Collisions / 7.8.1：
Primitive Behavior: Moving Target Pursuit / 7.8.2：
Artificial Fish Types / 7.9：
Predators / 7.9.1：
Prey / 7.9.2：
Pacifists / 7.9.3：
Analysis / 7.10：
Modeling the Marine Environment / 7.10.2：
Water Current / 8.1：
Seaweeds, Plankton and Air Bubbles / 8.2：
The Graphical User Interface / 9：
Initialization Panels / 9.1：
Manipulation Panels / 9.2：
Control Panels / 9.3：
Animation Results / 9.4：
"Go Fish!" / 10.1：
"The Undersea World of Jack Cousto" / 10.2：
Animation Short: Preying Behavior / 10.3：
Animation Short: Schooling Behavior / 10.4：
Animation Short: Mating Behavior / 10.5：
Conclusion and Future Work / 11：
Conclusion / 11.1：
Additional Impact in Animation and Artificial Life / 11.2：
Impact in Computer Vision and Robotics / 11.3：
Potential Applications in Ethology / 11.4：
Other Artificial Animals / 11.5：
Future Research Directions / 11.6：
Animation / 11.6.1：
Artificial Life / 11.6.2：
Epilogue / 12：
Deformable Contour Models / A：
Animating the Pectoral Flapping Motion / B：
Animating the Pectoral Oaring Motion / B.2：
Prior Action Selection Mechanisms / C：
Behavior Choice Network / C.1：
Free-Flow Hierarchy / C.2：
Color Images / D：
References
Index
Introduction / 1：
Motivation / 1.1：
Challenges / 1.2：
80.
図書
Edited by R. A. Ricci
81.
図書
К.А. Карпов
出版情報:
Москва : Изд-во Академии наук СССР, 1954 535 p. ; 27 cm
シリーズ名:
Математические таблицы
子書誌情報:
loading…
所蔵情報:
loading…
82.
図書
redigiert von H. Burkhardt, W. Wirtinger und R. Fricke
83.
図書
T.C. Hu
出版情報:
Reading, MA : Addison-Wesley Pub. Co., c1982 292 p. ; 24 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Shortest Paths / Chapter 1：
Graph terminology / 1.1：
Shortest path / 1.2：
Multiterminal shortest paths / 1.3：
Decomposition algorithm / 1.4：
Acyclic network / 1.5：
Shortest paths in a general network / 1.6：
Minimum spanning tree / 1.7：
Breadth-first-search and depth-first-search / 1.8：
Maximum flows / Chapter 2：
Maximum flow / 2.1：
Algorithms for max flows / 2.2：
Ford and Fulkerson / 2.2.1：
Karzanov's algorithm / 2.2.2：
MPM algorithms / 2.2.3：
Analysis of algorithms / 2.2.4：
Multi-terminal maximum flows / 2.3：
Realization / 2.3.1：
Analysis / 2.3.2：
Synthesis / 2.3.3：
Multi-commodity flows / 2.3.4：
Minimum cost flows / 2.4：
Applications / 2.5：
Sets of distinct representatives / 2.5.1：
PERT / 2.5.2：
Optimum communication spanning tree / 2.5.3：
Dynamic programming / Chapter 3：
Introduction / 3.1：
Knapsack problem / 3.2：
Two-dimensional knapsack problem / 3.3：
Minimum-cost alphabetic tree / 3.4：
Summary / 3.5：
Backtracking / Chapter 4：
Estimating the efficiency of backtracking / 4.1：
Branch and bound / 4.3：
Game-tree / 4.4：
Binary tree / Chapter 5：
Huffman's tree / 5.1：
Alphabetic tree / 5.3：
Hu-Tucker algorithm / 5.4：
Feasibility and optimality / 5.5：
Garsia and Wachs' algorithm / 5.6：
Regular cost function / 5.7：
T-ary tree and other results / 5.8：
Heuristic and near optimum / Chapter 6：
Greedy algorithm / 6.1：
Bin-packing / 6.2：
Job-scheduling / 6.3：
Job-scheduling (tree-constraints) / 6.4：
Matrix multiplication / Chapter 7：
Strassen's matrix multiplication / 7.1：
Optimum order of multiplying matrices / 7.2：
Partitioning a convex polygon / 7.3：
The heuristic algorithm / 7.4：
NP-complete / Chapter 8：
Polynomial algorithms / 8.1：
Nondeterministic algorithms / 8.3：
NP-complete problems / 8.4：
Facing a new problem / 8.5：
Local indexing algorithms / Chapter 9：
Mergers of algorithms / 9.1：
Maximum flows and minimum cuts / 9.2：
Maximum adjacency and minimum separation / 9.3：
Gomory-Hu tree / Chapter 10：
Tree edges and tree links / 10.1：
Contraction / 10.2：
Domination / 10.3：
Equivalent formulations / 10.4：
Optimum mergers of companies / 10.4.1：
Optimum circle partition / 10.4.2：
Extreme stars and host-feasible circles / 10.5：
The high-level approach / 10.6：
Chop-stick method / 10.7：
Relationship between phases / 10.8：
The staircase diagram / 10.9：
Complexity issues / 10.10：
Comments on Chapters 2, 5 & 6 / Appendix A：
Ancestor trees / A.1：
Minimum surface or plateau problem / A.2：
Comments on binary trees in chapter 5 / A.3：
A simple proof of the Hu-Tucker algorithm / A.3.1：
Binary search trees / A.3.2：
Binary search on a tape / A.3.3：
Comments on §6.2, bin-packing / A.4：
Network algebra / Appendix B：
Shortest Paths / Chapter 1：
Graph terminology / 1.1：
Shortest path / 1.2：
84.
図書
Cui Yu
目次情報:
続きを見る
Introduction / 1：
High-Dimensional Applications / 1.1：
Motivations / 1.2：
The Objectives and Contributions / 1.3：
Organization of the Monograph / 1.4：
High-Dimensional Indexing / 2：
Hierarchical Mu lti-dimensional Indexes / 2.1：
The R-tree / 2.2.1：
Use of Larger Fanouts / 2.2.2：
Use of Bounding Spheres / 2.2.3：
The kd-tree / 2.2.4：
Dimensionality Reduction / 2.3：
Indexing Based on Important Attributes / 2.3.1：
Dimensionality Reduction Based on Clustering / 2.3.2：
Mapping from Higher to Lower Dimension / 2.3.3：
Indexing Based on Single Attribu te Values / 2.3.4：
Filtering and Refining / 2.4：
Multi-step Processing / 2.4.1：
Quantization / 2.4.2：
Indexing Based on Metric Distance / 2.5：
Approximate Nearest Neighbor Search / 2.6：
Summary / 2.7：
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Range Search / 3：
Basic Concept of iMinMax / 3.1：
Sequential Scan / 3.2.1：
Indexing Based on Max/Min / 3.2.2：
Indexing Based on iMax / 3.2.3：
Preliminary Empirical Study / 3.2.4：
The iMinMax Method / 3.3：
Indexing Based on iMinMax / 3.4：
The iMinMax(?) / 3.5：
Processing of Range Queries / 3.6：
iMinMax(?) Search Algorithms / 3.7：
Point Search Algorithm / 3.7.1：
Range Search Algorithm / 3.7.2：
Discu ssion on Update Algorithms / 3.7.3：
Generating the Index Key / 3.8：
Performance Study of Window Queries / 3.9：
Implementation / 4.1：
Generation of Data Sets and Window Queries / 4.3：
Experiment Setup / 4.4：
Effect of the Number of Dimensions / 4.5：
Effect of Data Size / 4.6：
Effect of Skewed Data Distributions / 4.7：
Effect of Buffer Space / 4.8：
CPU Cost / 4.9：
Effect of Quantization on Feature Vectors / 4.10：
Indexing the Relative Distance - An Efficient Approach to KNN Search / 4.12：
Background and Notations / 5.1：
The iDistance / 5.3：
The Big Picture / 5.3.1：
The Data Structure / 5.3.2：
KNN Search in iDistance / 5.3.3：
Selection of Reference Points and Data Space Partitioning / 5.4：
Space-Based Partitioning / 5.4.1：
Data-Based Partitioning / 5.4.2：
Exploiting iDistance in Similarity Joins / 5.5：
Join Strategies / 5.5.1：
Similarity Join Strategies Based on iDistance / 5.5.2：
Similarity Range and Approximate KNN Searches with iMinMax / 5.6：
A Quick Review of iMinMax(?) / 6.1：
Approximate KNN Processing with iMinMax / 6.3：
Qu ality of KNN Answers Using iMinMax / 6.4：
Accu racy of KNN Search / 6.4.1：
Bounding Box Vs. Bounding Sphere / 6.4.2：
Effect of Search Radius / 6.4.3：
Performance Study of Similarity Queries / 6.5：
Effect of Search Radius on Query Accuracy / 7.1：
Effect of Reference Points on Space-Based Partitioning Schemes / 7.4：
Effect of Reference Points on Cluster-Based Partitioning Schemes / 7.5：
Comparative Study of iDistance and iMinMax / 7.6：
Comparative Stu dy of iDistance and A-tree / 7.8：
Comparative Study of the iDistance and M-tree / 7.9：
iDistance - A Good Candidate for Main Memory Indexing? / 7.10：
Conclusions / 7.11：
Contributions / 8.1：
Single-Dimensional Attribute Value Based Indexing / 8.2：
Metric-Based Indexing / 8.3：
Discussion on Future Work / 8.4：
References
Introduction / 1：
High-Dimensional Applications / 1.1：
Motivations / 1.2：
85.
図書
in Zusammenarbeit mit Gerda Grober-Glück und Günter Wiegelmann ; herausgegeben von Matthias Zender
出版情報:
Marburg : N.G. Elwert, 1966- v. ; 31 cm
子書誌情報:
loading…
所蔵情報:
loading…
86.
図書
Holger Hermanns
目次情報:
続きを見る
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：
87.
図書
Isaac S. Kohane, Alvin T. Kho, and Atul J. Butte
目次情報:
続きを見る
Foreword
Preface
Acknowledgments
Introduction / 1：
The Future Is So Bright... / 1.1：
Functional Genomics / 1.2：
Informatics and advances in enabling technology / 1.2.1：
Why do we need new techniques? / 1.2.2：
Missing the Forest for the Dendrograms / 1.3：
Sociology of a functional genomics pipeline / 1.3.1：
Functional Genomics, Not Genetics / 1.4：
In silico analysis will never substitute for in vitro and in vivo / 1.4.1：
Basic Biology / 1.5：
Biological caveats in mRNA measurements / 1.5.1：
Sequence-level genomics / 1.5.2：
Proteomics / 1.5.3：
Experimental Design / 2：
The Safe Conception of a Functional Genomic Experiment / 2.1：
Experiment design space / 2.1.1：
Expression space / 2.1.2：
Exercising the expression space / 2.1.3：
Discarding data and low-hanging fruit / 2.1.4：
Gene-Clustering Dogma / 2.2：
Supervised versus unsupervised learning / 2.2.1：
Figure of merit: The elusive gold standard in functional genomics / 2.2.2：
Microarray Measurements to Analyses / 3：
Generic Features of Microarray Technologies / 3.1：
Robotically spotted microarrays / 3.1.1：
Oligonucleotide microarrays / 3.1.2：
Replicate Experiments, Reproducibility, and Noise / 3.2：
What is a replicate experiment? A reproducible experimental outcome? / 3.2.1：
Reproducibility across repeated microarray experiments: Absolute expression level and fold difference / 3.2.2：
Cross-platform (technology) reproducibility / 3.2.3：
Pooling sample probes and PCR for replicate experiments / 3.2.4：
What is noise? / 3.2.5：
Sources and examples of noise in the generic microarray experiment / 3.2.6：
Biological variation as noise: The Human Genome Project and irreproducibility of expression measurements / 3.2.7：
Managing noise / 3.2.8：
Prototypical Objectives and Questions / 3.3：
Two examples: Inter-array and intra-array / 3.3.1：
Preprocessing: Filters and Normalization / 3.4：
Normalization / 3.4.1：
Background on Fold / 3.5：
Fold calculation and significance / 3.5.1：
Fold change may not mean the same thing in different expression measurement technologies / 3.5.2：
Dissimilarity and Similarity Measures / 3.6：
Linear correlation / 3.6.1：
Entropy and mutual information / 3.6.2：
Dynamics / 3.6.3：
Genomic Data-Mining Techniques / 4：
What Can Be Clustered in Functional Genomics? / 4.1：
What Does it Mean to Cluster? / 4.3：
Hierarchy of Bioinformatics Algorithms / 4.4：
Data Reduction and Filtering / 4.5：
Variation filter / 4.5.1：
Low entropy filter / 4.5.2：
Minimum expression level filter / 4.5.3：
Target ambiguity filter / 4.5.4：
Self-Organizing Maps / 4.6：
K-means clustering / 4.6.1：
Finding Genes That Split Sets / 4.7：
Phylogenetic-Type Trees / 4.8：
Two-dimensional dendrograms / 4.8.1：
Relevance Networks / 4.9：
Other Methods / 4.10：
Which Technique Should I Use? / 4.11：
Determining the Significance of Findings / 4.12：
Permutation testing / 4.12.1：
Testing and training sets / 4.12.2：
Performance metrics / 4.12.3：
Receiver operating characteristic curves / 4.12.4：
Genetic Networks / 4.13：
What is a genetic network? / 4.13.1：
Reverse-engineering and modeling a genetic network using limited data / 4.13.2：
Bayesian networks for functional genomics / 4.13.3：
Bio-Ontologies, Data Models, Nomenclature / 5：
Ontologies / 5.1：
Bio-ontology projects / 5.1.1：
Advanced knowledge representation systems for bio-ontology / 5.1.2：
Expressivity versus Computability / 5.2：
Ontology versus Data Model versus Nomenclature / 5.3：
Exploiting the explicit and implicit ontologies of the biomedical literature / 5.3.1：
Data Model Introduction / 5.4：
Nomenclature / 5.5：
The unique gene identifier / 5.5.1：
Postanalysis Challenges / 5.6：
Linking to downstream biological validation / 5.6.1：
Problems in determining the results / 5.6.2：
From Functional Genomics to Clinical Relevance / 6：
Electronic Medical Records / 6.1：
Standardized Vocabularies for Clinical Phenotypes / 6.2：
Privacy of Clinical Data / 6.3：
Anonymization / 6.3.1：
Privacy rules / 6.3.2：
Costs of Clinical Data Acquisition / 6.4：
The Near Future / 7：
New Methods for Gene Expression Profiling / 7.1：
Electronic positioning of molecules: Nanogen / 7.1.1：
Ink-jet spotting of arrays: Agilent / 7.1.2：
Coded microbeads bound to oligonucleotides: Illumina / 7.1.3：
Serial Analysis of Gene Expression (SAGE) / 7.1.4：
Parallel signature sequencing on microbead arrays: Lynx / 7.1.5：
Gel pad technology: Motorola / 7.1.6：
Respecting the Older Generation / 7.2：
The generation gap / 7.2.1：
Separating the wheat from the chaff / 7.2.2：
A persistent problem / 7.2.3：
Selecting Software / 7.3：
Investing in the Future of the Genomic Enterprise / 7.4：
Glossary
Foreword
Preface
Acknowledgments
88.
図書
Warren L. Stutzman
目次情報:
続きを見る
Preface
Acknowledgments
Introduction / Chapter 1：
Wave Polarization Principles / Chapter 2：
Plane Waves / 2.1：
The Concept and Visualization of Polarized Waves / 2.2：
Quantifying Polarization States / 2.3：
Decomposition of Waves / 2.4：
Problems
References
Polarization State Representations / Chapter 3：
The Polarization Ellipse / 3.1：
The Poincare Sphere / 3.3：
Complex Vector Representation / 3.4：
Stokes Parameters / 3.5：
Polarization Ratio / 3.6：
Polarization Ratio for LP / 3.6.1：
Polarization Ratio for CP / 3.6.2：
Determination of Orthogonal Polarization States / 3.7：
The Complex Vector Representation / 3.7.1：
Examples / 3.7.4：
Antenna Polarization and Polarization Measurements / Chapter 4：
Antenna Polarization and Generation of Polarized Waves / 4.1：
Linearly Polarized Antennas / 4.1.1：
Circularly Polarized Antennas / 4.1.2：
Polarization Measurements / 4.2：
Copolarized and Cross-Polarized Radiation Patterns / 4.2.1：
General Definitions of Copolarization and Cross Polarization / 4.2.2：
Polarization Pattern Measurement / 4.2.3：
The Spinning Linear and Dual-Linear Pattern Methods / 4.2.4：
Complete Polarization State Measurement / 4.3：
Phase-Amplitude Method / 4.3.1：
Multiple Amplitude-Component Methods / 4.3.2：
Measurement of the Polarization of Large Antennas / 4.3.3：
Gain Measurement / 4.4：
Gain Measurement of LP Antennas / 4.4.1：
Gain Measurement of CP Antennas / 4.4.2：
Absolute Gain Measurement / 4.4.3：
Antenna Polarization Properties / 4.5：
Broad-Beam Antennas / 4.5.1：
Narrow-Beam Antennas / 4.5.2：
Partially Polarized Waves / Chapter 5：
Stokes Parameter Representation for Partially Polarized Waves / 5.1：
Other Representations for Partially Polarized Waves / 5.2：
Measurement of Partially Polarized Waves / 5.3：
Antenna-Wave Interaction / Chapter 6：
Polarization Efficiency / 6.1：
Polarization Efficiency Evaluation Using the Poincare Sphere / 6.1.1：
Polarization Efficiency Evaluation Using Stokes Parameters / 6.1.2：
Polarization Efficiency Expressed in Axial Ratios / 6.1.3：
Polarization Efficiency Expressed in Terms of Polarization Ratios / 6.1.4：
Polarization Efficiency Expressed in Complex Vector Form / 6.1.5：
Decomposition of Polarization Efficiency into Unpolarized and Completely Polarized Parts and into Copolarized and Cross-Polarized Parts / 6.1.6：
Vector Effective Length of an Antenna / 6.2：
Complex Voltage / 6.3：
Dual-Polarized Systems / Chapter 7：
Cross-Polarization Ratio / 7.1：
Cross-Polarization Discrimination and Cross-Polarization Isolation / 7.2：
Definitions / 7.2.1：
Dual Decomposition / 7.2.2：
Evaluation of XPD / 7.2.3：
Performance Evaluation of Dual-Polarized Systems / 7.3：
Isolation Degradation from Imperfect Antennas / 7.3.1：
Isolation in System Performance Evaluation / 7.3.2：
Polarization Control Devices / 7.4：
Polarizers / 7.4.1：
Orthomode Transducers / 7.4.2：
Depolarization Compensation Systems / 7.5：
Depolarizing Media and System Applications / Chapter 8：
Principles of Depolarizing Media / 8.1：
Depolarization at Interfaces / 8.2：
General Formulation / 8.2.1：
Reflection from a Plane, Perfect Conductor / 8.2.2：
Reflection from the Ground / 8.2.3：
Dual-Polarized Systems with a Depolarizing Medium in the Path / 8.3：
A Depolarizing Medium Along the Path / 8.3.1：
Rain on a Radio Path / 8.3.2：
Inclusion of Antenna Effects / 8.3.3：
Faraday Rotation / 8.3.4：
Polarization in Radar and Radiometry / 8.4：
Polarimetric Radar / 8.4.1：
Radiometry / 8.4.2：
Frequency Bands / Appendix A：
Useful Mathematical Relations / Appendix B：
Unit Vector Representations / B.1：
Trigonometric Identities / B.2：
Symbols / Appendix C：
Bibliography
Index
Preface
Acknowledgments
Introduction / Chapter 1：
89.
図書
Pierre Deransart, Manuel V. Hermenegildo, Jan Małuszyński (eds.)
目次情報:
続きを見る
Introduction
Correctness Debugging / Part I：
An Assertion Language for Constraint Logic Programs / Germán Puebla ; Francisco Bueno ; Manuel Hermenegildo1：
Assertions in Program Validation and Debugging / 1.1：
Assertion Schemas for Execution States / 1.3：
An Assertion Schema for Success States / 1.3.1：
Adding Preconditions to the Success Schema / 1.3.2：
An Assertion Schema for Call States / 1.3.3：
An Assertion Schema for Query States / 1.3.4：
Program-Point Assertions / 1.3.5：
Logic Formulae about Execution States / 1.4：
An Assertion Schema for Declarative Semantics / 1.5：
Assertion Schemas for Program Completeness / 1.6：
Status of Assertions / 1.7：
An Assertion Schema for Computations / 1.8：
Logic Formulae about Computations / 1.8.1：
Defining Property Predicates / 1.9：
Declaring Property Predicates / 1.9.1：
Defining Property Predicates for Execution States / 1.9.2：
Defining Property Predicates for Computations / 1.9.3：
Approximating Property Predicates / 1.9.4：
Syntax of and Extensions to the Assertion Language / 1.10：
Syntax of the Assertion Language / 1.10.1：
Grouping Assertions: Compound Assertions / 1.10.2：
Some Additional Syntactic Sugar / 1.10.3：
Discussion / 1.11：
References
A Generic Preprocessor for Program Validation and Debugging / 2：
Design of the Preprocessor / 2.1：
Chapter Outline / 2.1.2：
Architecture and Operation of the Preprocessor / 2.2：
The Syntax Checker / 2.2.1：
The Static Analysers / 2.2.2：
Consistency of the Analysis Results / 2.2.3：
The Assertion Normaliser / 2.2.4：
The Assertion Comparator / 2.2.5：
Assertions for System Predicates / 2.2.6：
Assertions for User-Defined Predicates / 2.2.7：
Compile-Time Checking / 2.3：
Run-Time Checking / 2.4：
Evaluating Atomic Logic Formulae / 2.4.1：
A Program Transformation for Assertion Checking 89 / 2.4.2：
Customising the Preprocessor for a CLP System: The CiaoPP and CHIPRE Tools / 2.5：
Describing Built-Ins Using Assertions / 2.5.1：
System Dependent Code for Run-Time Checking / 2.5.2：
A Sample Debugging Session with the Ciao System / 2.6：
Some Practical Hints on Debugging with Assertions / 2.7：
Assertions with Constraints for CLP Debugging / Claude Laï3：
Form of Assertions / 3.1：
Syntax and Meaning of Assertions / 3.2.1：
The Basic Constructs / 3.2.2：
Correctness Proofs / 3.3：
Implementation / 3.3.1：
Example of a Verification / 3.3.2：
Incompleteness Introduced by the Solvers / 3.3.3：
Full Example / 3.3.4：
Samples of Compilations / 3.3.5：
Conclusion / 3.4：
Locating Type Errors in Untyped CLP Programs / Wlodzimierz Drabent ; Jan Maluszyński ; Pawel Pietrzak4：
The Specification Language / 4.1：
Calls and Successes of a CLP Program / 4.2.1：
Describing Sets of Constrained Atoms / 4.2.2：
An Example Diagnosis Session / 4.3：
The Diagnosis Method / 4.4：
Correct and Incorrect Clauses / 4.4.1：
Incorrectness Diagnosis / 4.4.2：
Delays / 4.5：
The Diagnosis Tool / 4.6：
Limitations of the Approach / 4.7：
Related Work / 4.8：
Conclusions and Future Work / 4.9：
Declarative Diagnosis in the CLP Scheme / Alexandre Tessier ; Gérard Ferrand5：
Basic Notions of Symptom and Error / 5.1：
Connection between Symptom and Error via Proof-Trees / 5.3：
Diagnosis Algorithm / 5.4：
Abstract Proof-Trees / 5.5：
A Diagnosis Session / 5.6：
Performance Debugging / 5.8：
Visual Tools to Debug Prolog IV Programs / Pascal Bouvier6：
Presentation of the Execution Tree Viewer / 6.1：
The Box Model / 6.2.1：
Execution Trees / 6.2.2：
The Prolog IV Execution Tree Viewer / 6.2.3：
Textual Information in the Canvas / 6.2.4：
Viewer Functions Description / 6.3：
Colouring Boxes / 6.3.1：
Replay Mode / 6.3.2：
"Replay-Left Mode" Option / 6.3.3：
"Show all Tries" Option / 6.3.4：
Miscellaneous / 6.3.5：
Working with the Debugger / 6.4：
Setting a Temporary Break-Point / 6.4.1：
Replaying the Execution / 6.4.2：
About Implementation / 6.5：
Search-Tree Visualisation / Helmut Simonis ; Abder Aggoun6.6：
Principles of Operation / 7.1：
Program Structure / 7.3.1：
Symptoms / 7.3.2：
Operating Mode / 7.3.3：
System Requirements / 7.3.4：
Interface / 7.4：
Views / 7.5：
Types of Views / 7.5.1：
Tree View / 7.5.2：
Variable Views / 7.5.3：
Constraint Views / 7.5.4：
Propagation View / 7.5.5：
Current State and Further Development / 7.6：
Towards a Language for CLP Choice-Tree Visualisation / Christophe Aillaud ; Pierre Deransart7.7：
CLP: Syntax, Semantics and State Properties / 8.1：
Syntax / 8.2.1：
Constraint Domains / 8.2.2：
Constrained Predication and D-Atom / 8.2.3：
Operational Semantics / 8.2.4：
CLP Search-Tree / 8.2.5：
Labelling / 8.2.6：
State Properties / 8.2.7：
Tree Pruning and CLP Choice-Tree / 8.3：
Unique Minimal Pruned Tree / 8.3.1：
Minimal Pruned Tree Construction / 8.3.2：
CLP Choice-Tree / 8.3.3：
A Language to Specify Views / 8.4：
Node Selection / 8.4.1：
Arc Selection / 8.4.2：
Node and Arc Selection Using Differential Information / 8.4.3：
View Specification / 8.4.4：
Implementation and Examples / 8.5：
Displaying the Full Concrete Choice-Tree / 8.5.1：
A General Criterion for a More Synthetic View / 8.5.2：
View of the Labelling / 8.5.3：
Use of State Properties / 8.5.4：
Comparison of Labelling Strategies / 8.5.5：
Tools for Search-Tree Visualisation: The APT Tool / Manuel Carro8.6：
Visualising Control / 9.1：
The Programmed Search as a Search Tree / 9.3：
Representing the Enumeration Process / 9.4：
Coupling Control Visualisation with Assertions / 9.5：
The APT Tool / 9.6：
Event-Based and Time-Based Depiction of Control / 9.7：
Abstracting Control / 9.8：
Conclusions / 9.9：
Tools for Constraint Visualisation: The VIFID/TRIFID Tool / 10：
Displaying Variables / 10.1：
Depicting Finite Domain Variables / 10.2.1：
Depicting Herbrand Terms / 10.2.2：
Depicting Intervals or Reals / 10.2.3：
Representing Constraints / 10.3：
Abstraction / 10.4：
Abstracting Values / 10.4.1：
Domain Compaction and New Dimensions / 10.4.2：
Abstracting Constraints / 10.4.3：
Debugging Constraint Programs by Store Inspection / Frédéric Goualard ; Frédéric Benhamou10.5：
Constraint Logic Programming in a Nutshell / 11.1：
Arising Difficulties when Debugging Constraint Programs / 11.3：
Constraint Programming Efficiency / 11.3.1：
Drawbacks of CP Expressiveness / 11.3.2：
Visualising the Store / 11.4：
Structuring the Store / 11.4.1：
S-Boxes / 11.4.2：
Presentation of the Debugger Prototype / 11.5：
Implementation of the S-Box Based Debugger / 11.6：
Modification of the Backtracking Process / 11.6.1：
Modification of the Propagation Process / 11.6.2：
Handling the S-Boxes / 11.6.3：
Complex Constraint Abstraction: Global Constraint Visualisation / Nicolas Beldiceanu ; Eric Bourreau11.7：
Global Constraint Concepts / 12.1：
Cumulative / 12.2.1：
Diffn / 12.2.2：
Cycle / 12.2.3：
Among / 12.2.4：
Class Structure / 12.3：
Callbacks / 12.3.2：
API / 12.3.3：
Interface to Search-Tree Tool / 12.4：
Use Outside Search-Tree Tool / 12.5：
Cumulative Visualisers / 12.6：
Cumulative Resource / 12.6.1：
Bin Packing / 12.6.2：
Diffn Visualisers / 12.7：
Placement 2D / 12.7.1：
Placement Remains / 12.7.2：
Cycle Visualiser / 12.8：
Geographical Tour / 12.8.1：
Graph Lines / 12.8.2：
Interaction between Visualisers / 12.9：
Test Cases / 12.10：
Using Constraint Visualisation Tools|CHelmut Simonis / Trijntje Cornelissens ; Véronique Dumortier ; Giovanni Fabris ; F. Nanni ; Adriano Tirabosco13：
Debugging Scenarios / 13.1：
Finding New Variable/Value Orderings / 13.2.1：
Comparing Two Heuristics / 13.2.2：
Adding Redundant Constraints / 13.2.3：
Discovering Structure in the Problem / 13.2.4：
Identifying Weak Propagation / 13.2.5：
Case Studies from Industry / 13.3：
Scheduling Application Involving Setup Cost / 13.3.1：
Tank Scheduling Application / 13.3.2：
Layout of Mechanical Objects: Graph Colouring / 13.3.3：
Layout of Mechanical Objects: Physical Layout / 13.3.4：
Analysis and Possible Improvements / 13.4：
Need for a Debugging Methodology / 13.4.1：
Program Improvement Due to the Use of Debugging Tools / 13.4.2：
General Conclusions on the CHIP Graphical Debugging Tools / 13.4.3：
Suggestions for Extensions to the CHIP Debugging Tools / 13.4.4：
Author Index / 13.5：
Subject Index
Introduction
Correctness Debugging / Part I：
An Assertion Language for Constraint Logic Programs / Germán Puebla ; Francisco Bueno ; Manuel Hermenegildo1：
90.
図書
Chengqi Zhang, Shichao Zhang
目次情報:
続きを見る
Introduction / 1：
What Is Data Mining? / 1.1：
Why Do We Need Data Mining? / 1.2：
Knowledge Discovery in Databases (KDD) / 1.3：
Processing Steps of KDD / 1.3.1：
Feature Selection / 1.3.2：
Applications of Knowledge Discovery in Databases / 1.3.3：
Data Mining Task / 1.4：
Data Mining Techniques / 1.5：
Clustering / 1.5.1：
Classification / 1.5.2：
Conceptual Clustering and Classification / 1.5.3：
Dependency Modeling / 1.5.4：
Summarization / 1.5.5：
Regression / 1.5.6：
Case-Based Learning / 1.5.7：
Mining Time-Series Data / 1.5.8：
Data Mining and Marketing / 1.6：
Solving Real-World Problems by Data Mining / 1.7：
Summary / 1.8：
Trends of Data Mining / 1.8.1：
Outline / 1.8.2：
Association Rule / 2：
Basic Concepts / 2.1：
Measurement of Association Rules / 2.2：
Support-Confidence Framework / 2.2.1：
Three Established Measurements / 2.2.2：
Searching Frequent Itemsets / 2.3：
The Apriori Algorithm / 2.3.1：
Identifying Itemsets of Interest / 2.3.2：
Research into Mining Association Rules / 2.4：
Chi-squared Test Method / 2.4.1：
The FP-tree Based Model / 2.4.2：
OPUS Based Algorithm / 2.4.3：
Negative Association Rule / 2.5：
Focusing on Itemsets of Interest / 3.1：
Effectiveness of Focusing on Infrequent Itemsets of Interest / 3.3：
Itemsets of Interest / 3.4：
Positive Itemsets of Interest / 3.4.1：
Negative Itemsets of Interest / 3.4.2：
Searching Interesting Itemsets / 3.5：
Procedure / 3.5.1：
An Example / 3.5.2：
A Twice-Pruning Approach / 3.5.3：
Negative Association Rules of Interest / 3.6：
Measurement / 3.6.1：
Examples / 3.6.2：
Algorithms Design / 3.7：
Identifying Reliable Exceptions / 3.8：
Confidence Based Interestingness / 3.8.1：
Support Based Interestingness / 3.8.2：
Searching Reliable Exceptions / 3.8.3：
Comparisons / 3.9：
Comparison with Support-Confidence Framework / 3.9.1：
Comparison with Interest Models / 3.9.2：
Comparison with Exception Mining Model / 3.9.3：
Comparison with Strong Negative Association Model / 3.9.4：
Causality in Databases / 3.10：
Basic Definitions / 4.1：
Data Partitioning / 4.3：
Partitioning Domains of Attributes / 4.3.1：
Quantitative Items / 4.3.2：
Decomposition and Composition of Quantitative Items / 4.3.3：
Item Variables / 4.3.4：
Decomposition and Composition for Item Variables / 4.3.5：
Procedure of Partitioning / 4.3.6：
Dependency among Variables / 4.4：
Conditional Probabilities / 4.4.1：
Causal Rules of Interest / 4.4.2：
Algorithm Design / 4.4.3：
Causality in Probabilistic Databases / 4.5：
Problem Statement / 4.5.1：
Required Concepts / 4.5.2：
Preprocess of Data / 4.5.3：
Probabilistic Dependency / 4.5.4：
Improvements / 4.5.5：
Causal Rule Analysis / 4.6：
Related Concepts / 5.1：
Optimizing Causal Rules / 5.3：
Unnecessary Information / 5.3.1：
Merging Unnecessary Information / 5.3.2：
Merging Items with Identical Properties / 5.3.3：
Polynomial Function for Causality / 5.4：
Causal Relationship / 5.4.1：
Binary Linear Causality / 5.4.2：
N-ary Linear Propagating Model / 5.4.3：
Functions for General Causality / 5.4.4：
Approximating Causality by Fitting / 5.6：
Preprocessing of Data / 5.6.1：
Constructing the Polynomial Function / 5.6.2：
Association Rules in Very Large Databases / 5.6.3：
Instance Selection / 6.1：
Evaluating the Size of Instance Sets / 6.2.1：
Generating Instance Set / 6.2.2：
Estimation of Association Rules / 6.3：
Identifying Approximate Frequent Itemsets / 6.3.1：
Measuring Association Rules of Interest / 6.3.2：
Algorithm Designing / 6.3.3：
Searching True Association Rules Based on Approximations / 6.4：
Incremental Mining / 6.5：
Promising Itemsets / 6.5.1：
Searching Procedure / 6.5.2：
Competitive Set Method / 6.5.3：
Assigning Weights / 6.5.4：
Algorithm of Incremental Mining / 6.5.5：
Improvement of Incremental Mining / 6.6：
Conditions of Termination / 6.6.1：
Anytime Search Algorithm / 6.6.2：
Association Rules in Small Databases / 6.7：
Problems Faced by Utilizing External Data / 7.1：
Our Approach / 7.2.2：
External Data Collecting / 7.3：
Available Tools / 7.3.1：
Indexing by a Conditional Associated Semantic / 7.3.2：
Procedures for Similarity / 7.3.3：
A Data Preprocessing Framework / 7.4：
Pre-analysis: Selecting Relevant and Uncontradictable Collected Data-Sources / 7.4.1：
Post-analysis: Summarizing Historical Data / 7.4.2：
Synthesizing Selected Rules / 7.4.3：
Refining Rules Mined in Small Databases / 7.5.1：
Conclusion and Future Work / 7.7：
Conclusion / 8.1：
Future Work / 8.2：
References
Subject Index
Introduction / 1：
What Is Data Mining? / 1.1：
Why Do We Need Data Mining? / 1.2：
91.
図書
出版情報:
Detroit : American Data Processing, [1961]- v. ; 28 cm
子書誌情報:
loading…
所蔵情報:
loading…
92.
図書
John B. Parkinson, Damian J.J. Farnell
目次情報:
続きを見る
Introduction / 1：
References
Spin Models / 2：
Spin Angular Momentum / 2.1：
Coupled Spins / 2.2：
Two Interacting Spin-1/2's / 2.3：
Commutators and Quantum Numbers / 2.4：
Physical Picture / 2.5：
Infinite Arrays of Spins / 2.6：
1D Heisenberg Chain with S = 1/2 and Nearest-Neighbour Interaction / 2.7：
Quantum Treatment of the Spin-1/2 Chain / 3：
General Remarks / 3.1：
Aligned State / 3.2：
Single Deviation States / 3.3：
Two Deviation States / 3.4：
Form of the States / 3.4.1：
Three Deviation States / 3.5：
States with an Arbitrary Number of Deviations / 3.5.1：
Reference
The Antiferromagnetic Ground State / 4：
The Fundamental Integral Equation / 4.1：
Solution of the Fundamental Integral Equation / 4.2：
The Ground State Energy / 4.3：
Antiferromagnetic Spin Waves / 5：
The Basic Formalism / 5.1：
Magnetic Field Behaviour / 5.2：
The XY Model / 6：
Change from Spin Operators to Fermion Operators / 6.1：
Fourier Transform / 6.3：
Quasiparticle Operators / 6.4：
Quasiparticle Energies / 6.5：
Ground State Energy of the XY-Model / 6.6：
Spin-Wave Theory / 7：
Ferromagnetic Spin-Wave Theory / 7.1：
Antiferromagnetic Spin-Wave Theory / 7.3：
Numerical Finite-Size Calculations / 8：
A Simple Example / 8.1：
Results in 1D / 8.3：
Results in 2D / 8.4：
Other Approximate Methods / 9：
Variational Method / 9.1：
Variational Monte Carlo Method / 9.3：
The Green Function Monte Carlo Method / 9.4：
Pertubation Theory / 9.5：
The Coupled Cluster Method / 10：
The CCM Formalism / 10.1：
The XXZ-Model / 10.3：
The LSUB2 Approximation for the Spin-Half, Square-Lattice XXZ-Model for the z-Aligned Model State / 10.3.1：
The SUB2 Approximation for the Spin-Half, Square-Lattice XXZ-Model of the z-Aligned Model State / 10.3.2：
High-Order CCM Calculations Using a Computational Approach / 10.3.3：
Excitation Spectrum of the Spin-Half Square-Lattice XXZ-Model for the z-Aligned Model State / 10.3.4：
The Lattice Magnetisation / 10.4：
Quantum Magnetism / 11：
One-Dimensional Models / 11.1：
The s = 1 Heisenberg Model on the Linear Chain / 11.2.1：
The s = 1 Heisenberg-Biquadratic Model on the Linear Chain / 11.2.3：
The s = 1/2 Heisenberg Model for Archimedean Lattices / 11.3：
Spin Plateaux / 11.4：
The Shastry-Sutherland Antiferromagnet / 11.5：
Conclusions / 11.7：
Index
Introduction / 1：
References
Spin Models / 2：
93.
図書
Christian Schulte
目次情報:
続きを見る
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：
94.
図書
[ред. Ю. С. Постнов ... [и др.]]
出版情報:
Новосибирск : Изд-во "Наука" Сибирское отд-ние, 1982 2 v. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
1. Дореволюционный период
1. Dorevoli︠u︡t︠s︡ionnyĭ period
2. Советский период
2. Sovetskiĭ period
1. Дореволюционный период
1. Dorevoli︠u︡t︠s︡ionnyĭ period
2. Советский период
95.
図書
Serge Abiteboul, Peter Buneman and Dan Suciu
出版情報:
San Francisco, Calif : Morgan Kaufmann, c2000 xiii, 258 p. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Foreword
Acknowledgments
Introduction / 1：
Audience / 1.1：
Web Data and the Two Cultures / 1.2：
Organization / 1.3：
Data Model / I：
A Syntax for Data / 2：
Base Types / 2.1：
Representing Relational Databases / 2.2：
Representing Object Databases / 2.3：
Specification of Syntax / 2.4：
The Object Exchange Model (OEM) / 2.5：
Object Databases / 2.6：
Other Representations / 2.7：
ACeDB / 2.7.1：
Terminology / 2.8：
Bibliographic Remarks / 2.9：
XML / 3：
Basic Syntax / 3.1：
XML Elements / 3.1.1：
XML Attributes / 3.1.2：
Well-Formed XML Documents / 3.1.3：
XML and Semistructured Data / 3.2：
XML Graph Model / 3.2.1：
XML References / 3.2.2：
Order / 3.2.3：
Mixing Elements and Text / 3.2.4：
Other XML Constructs / 3.2.5：
Document Type Definitions / 3.3：
A Simple DTD / 3.3.1：
DTDs as Grammars / 3.3.2：
DTDs as Schemas / 3.3.3：
Declaring Attributes in DTDs / 3.3.4：
Valid XML Documents / 3.3.5：
Limitations of DTDs as Schemas / 3.3.6：
Document Navigation / 3.4：
DCD / 3.5：
Paraphernalia / 3.6：
RDF / 3.6.1：
Stylesheets / 3.6.2：
SAX and DOM / 3.6.3：
Queries / 3.7：
Query Languages / 4：
Path Expressions / 4.1：
A Core Language / 4.2：
The Basic Syntax / 4.2.1：
More on Lorel / 4.3：
Less Essential Syntactic Sugaring / 4.3.1：
UnQL / 4.4：
Label and Path Variables / 4.5：
Paths as Data / 4.5.1：
Mixing with Structured Data / 4.6：
Query Languages for XML / 4.7：
XML-QL / 5.1：
Constructing New XML Data / 5.1.1：
Processing Optional Elements with Nested Queries / 5.1.2：
Grouping with Nested Queries / 5.1.3：
Binding Elements and Contents / 5.1.4：
Querying Attributes / 5.1.5：
Joining Elements by Value / 5.1.6：
Tag Variables / 5.1.7：
Regular Path Expressions / 5.1.8：
XSL / 5.1.9：
Interpretation and Advanced Features / 5.3：
First-Order Interpretation / 6.1：
Object Creation / 6.2：
Graphical Languages / 6.3：
Structural Recursion / 6.4：
Structural Recursion on Trees / 6.4.1：
XSL and Structural Recursion / 6.4.2：
Bisimulation in Semistructured Data / 6.4.3：
Structural Recursion on Cyclic Data / 6.4.4：
StruQL / 6.5：
Types / 6.6：
Typing Semistructured Data / 7：
What Is Typing Good For? / 7.1：
Browsing and Querying Data / 7.1.1：
Optimizing Query Evaluation / 7.1.2：
Improving Storage / 7.1.3：
Analyzing the Problem / 7.2：
Schema Formalisms / 7.3：
Logic / 7.3.1：
Datalog / 7.3.2：
Simulation / 7.3.3：
Comparison between Datalog Rules and Simulation / 7.3.4：
Extracting Schemas from Data / 7.4：
Data Guides / 7.4.1：
Extracting Datalog Rules from Data / 7.4.2：
Inferring Schemas from Queries / 7.5：
Sharing, Multiplicity, and Order / 7.6：
Sharing / 7.6.1：
Attribute Multiplicity / 7.6.2：
Path Constraints / 7.6.3：
Constraints in Relational Databases / 7.7.1：
Constraints in Object-Oriented Databases / 7.7.2：
Path Constraints in Semistructured Data / 7.7.3：
The Constraint Inference Problem / 7.7.4：
Constraints in XML / 7.7.5：
Systems / 7.8：
Query Processing / 8：
Architecture / 8.1：
Semistructured Data Servers / 8.2：
Storage / 8.2.1：
Indexing / 8.2.2：
Distributed Evaluation / 8.2.3：
Mediators for Semistructured Data / 8.3：
A Simple Mediator: Converting Relational Data to XML / 8.3.1：
Mediators for Data Integration / 8.3.2：
Incremental Maintenance / 8.4：
The Lore System / 8.5：
Query Processing and Indexes / 9.1：
Other Aspects of Lore / 9.3：
The Data Guide / 9.3.1：
Managing External Data / 9.3.2：
Proximity Search / 9.3.3：
Views / 9.3.4：
Dynamic OEM and Chorel / 9.3.5：
Mixing Structured and Semistructured in Ozone / 9.3.6：
Strudel / 9.4：
An Example / 10.1：
Data Management / 10.1.1：
Structure Management / 10.1.2：
Management of the Graphical Presentation / 10.1.3：
Advantages of Declarative Web Site Design / 10.2：
Database Products Supporting XML / 10.3：
Application Programming Interface / 11.1：
Query language / 11.4：
Scalability / 11.5：
Bibliography / 11.6：
Index
About the Authors
Foreword
Acknowledgments
Introduction / 1：
96.
図書
Alessandro Pasetti
目次情報:
続きを見る
Introduction and Context / 1：
The Embedded Software Problem / 1.1：
Empowering Application Specialists / 1.2：
The Component Software Challenge / 1.3：
Objectives and Contributions / 1.4：
Attitude and Orbit Control Systems (AOCS) / 2：
AOCS Systems / 2.1：
AOCS Functions / 2.1.1：
AOCS Operational Modes / 2.1.2：
AOCS Units / 2.1.3：
The AOCS Software / 2.1.4：
The AOCS and Other Control Systems / 2.2：
Software Frameworks / 3：
Frameworks, Components, and Inheritance / 3.1：
A More Complete View of Software Frameworks / 3.2：
Frameworks and Autocoding Tools / 3.3：
The Methodological Problem / 3.4：
Design Patterns and Abstract Interfaces Vs. Concrete Objects / 3.4.1：
Support for Design Patterns and Hot-Spots / 3.4.2：
Iterative System Specification / 3.4.3：
Design and Architecture / 3.4.4：
A Methodology for Frameworks / 3.4.5：
Framelets and Implementation Cases / 4：
The Framelet Concept / 4.1：
Implications for the Design Process / 4.1.1：
Framelets, Design, and Architecture / 4.1.2：
Framelets and Aspect-Oriented Programming / 4.1.3：
Framelet Features / 4.1.4：
Framelet Constructs / 4.1.5：
Framelet Heuristics / 4.1.6：
Framelets in the AOCS Framework / 4.1.7：
Related Approaches / 4.1.8：
The Implementation Case Concept / 4.2：
The Three Roles of Implementation Cases / 4.2.1：
Implementation Case Scenarios and Extensions / 4.2.2：
Description of Implementation Cases / 4.2.3：
Framework Specification / 5：
How Important Is Specification? / 5.1：
An Alternative Specification Approach / 5.2：
An Example from the AOCS Case Study / 5.3：
Framework Design / 6：
Overall Approach / 6.1：
Alternative Approaches / 6.2：
The Framework Concept Definition Phase / 6.3：
Definition of General Design Principles / 6.3.1：
Identification of Domain Abstractions / 6.3.2：
Construction of the Framework Domain Model / 6.3.3：
Identification of Framework Hot-Spots / 6.3.4：
Identification of Framework Design Patterns / 6.3.5：
Framelet Identification / 6.3.6：
Identification of Implementation Cases / 6.3.7：
Identification of Alternative Solutions / 6.3.8：
Framelet Concept Definition / 6.4：
Identification of Exported Interfaces and Implementations / 6.4.1：
Identification of Framelet Hot-Spots / 6.4.2：
Definition of Applicable Design Patterns / 6.4.3：
Definition of Framelet Contribution to the Framework / 6.4.4：
Definition of Framelet Contribution to Reusability / 6.4.5：
Framelet Architectural Definition / 6.5：
Definition of Framelet Constructs / 6.5.1：
Definition of Framelet Hot-Spots / 6.5.2：
Definition of Framelet Functionalities / 6.5.3：
Framework Design Description / 6.6：
Framework Concept Definition / 6.6.1：
Overview of Design Description Techniques / 6.6.2：
Framelet Interactions / 6.6.5：
Examples from AOCS Case Study / 6.6.6：
The User's Perspective / 7：
A Reuse-Driven Development Process / 7.1：
The Functionality Concept / 7.2：
Functionality Types / 7.2.1：
Mapping Functionalities to Architectural Constructs / 7.2.2：
Completeness of Description / 7.2.3：
Mapping Requirements to Functionalities / 7.2.4：
Functionalities in the AOCS Framework / 7.2.5：
General Structure of the AOCS Framework / 7.2.6：
The RTOS Example / 8.1：
The Lesson for the AOCS / 8.2：
Telemetry Management in the AOCS Framework / 8.3：
Controller Management in the AOCS Framework / 8.4：
The Manager Meta-pattern / 8.5：
Overall Structure / 8.6：
Architectural Infrastructure / 8.7：
Hierarchies of Design Patterns / 8.8：
The Framework Design Process / 8.9：
From Design to Architecture / 8.10：
Related Work / 8.11：
General Design Principles / 9：
Boundary Conditions / 9.1：
An Object-Oriented Framework / 9.2：
A Component-Based Framework / 9.3：
Delegation of Responsibility / 9.4：
Multiple Implementation Inheritance / 9.5：
External Interfaces / 9.6：
Basic Classes / 9.7：
Time Management / 9.8：
Language Selection / 9.9：
Execution Time Predictability / 9.10：
Scheduling / 9.11：
A Framelet-Based Framework / 9.12：
The System Management Framelet / 10：
The System Management Design Pattern / 10.1：
The System Reset Function / 10.2：
The System Configuration Check Function / 10.3：
Storage of Configuration Data / 10.4：
Reusability / 10.5：
The Object Monitoring Framelet / 11：
Properties and Property Objects / 11.1：
Change Objects / 11.2：
The Monitoring Design Patterns
The Direct Monitoring Design Pattern / 11.3.1：
The Monitoring through Change Notification Design Pattern / 11.3.2：
Implementation Case Example-1 / 11.4：
Implementation Case Example-2 / 11.5：
Alternative Solutions / 11.6：
The Operational Mode Management Framelet / 11.7：
The Mode Management Design Pattern / 12.1：
Mode Change Actions / 12.2：
Coordination of Operational Mode Changes / 12.3：
AOCS Mission Mode Manager / 12.4：
The Intercomponent Communication Framelet / 12.5：
The Shared Event Design Pattern / 13.1：
The Shared Data Design Pattern / 13.2：
AOCS Data / 13.3：
Data Pools / 13.4：
Implementation Case Example-3 / 13.5：
Alternative Implementations / 13.8：
The Sequential Data Processing Framelet / 13.9：
Control Channels / 14.1：
The Control Channel Design Pattern / 14.2：
Implementation Case Example / 14.3：
The AOCS Unit Framelet / 14.4：
Abstract Unit Model / 15.1：
The AocsUnit Class / 15.2：
The AOCS Unit Housekeeping and Functional Interfaces / 15.2.1：
Unit Triggers / 15.3：
Hardware Unit Components / 15.4：
Fictitious AOCS Units / 15.5：
The Fictitious Unit Design Pattern / 15.5.1：
The Reconfiguration Management Framelet / 15.6：
Some Definitions / 16.1：
The Reconfiguration Management Design Pattern / 16.2：
Intersection and Nesting of Reconfiguration Groups / 16.2.1：
Direct Access to Redundant Components / 16.2.2：
Preservation of Configuration Data / 16.2.3：
The Manoeuvre Management Framelet / 16.3：
Manoeuvre Components / 17.1：
The Manoeuvre Design Pattern / 17.2：
Manoeuvre Initiation / 17.3：
Alternative Solution / 17.4：
The Failure Detection Management Framelet / 17.5：
Failure Detection Checks / 18.1：
Consistency Checks / 18.2.1：
Property Monitoring / 18.2.2：
The Failure Detection Design Pattern / 18.3：
Failure Isolation / 18.4：
The Failure Recovery Management Framelet / 18.6：
Failure Recovery Actions / 19.1：
Failure Recovery Strategy / 19.2：
Failure Recovery Design Pattern / 19.3：
Alternative Implementation / 19.4：
The Telecommand Management Framelet / 19.7：
The Telecommand Management Design Pattern / 20.1：
The Telecommand Transaction Design Pattern / 20.2：
Telecommand Loading / 20.3：
Implementation Considerations / 20.3.1：
The Telemetry Management Framelet / 20.4：
The Telemetry Management Design Pattern / 21.1：
Functionality List Example / 21.2：
The Controller Management Framelet / 21.4：
The Controller Design Pattern / 22.1：
The Controller Abstraction / 22.2：
The Framework Instantiation Process / 22.3：
Step-by-Step Instantiation / 23.1：
Framework Overheads / 23.2：
Appendix
References
Index
Introduction and Context / 1：
The Embedded Software Problem / 1.1：
Empowering Application Specialists / 1.2：
97.
図書
by A. Fletcher ... [et al.]
出版情報:
Reading, Mass. : For Scientific Computing Service, Addison-Wesley Pub. Co., 1962 2 v. (xi, 994 p.) ; 26 cm
子書誌情報:
loading…
所蔵情報:
loading…
98.
図書
edited by Gerhart K. Gaulé
出版情報:
New York : Plenum Press, c1965- v. <2- > ; 24 cm
子書誌情報:
loading…
所蔵情報:
loading…
99.
図書
Silke Goronzy
目次情報:
続きを見る
Introduction / 1：
Outline of This Book / 1.1：
ASR: An Overview / 2：
General Overview / 2.1：
Automatic Processing of Speech / 2.2：
Evaluation of ASR Systems / 2.3：
Adaptation in ASR Systems / 2.4：
Pre-processing of the Speech Data / 3：
A/D Conversion / 3.1：
Windowing / 3.2：
Filter Bank Analysis / 3.3：
Stochastic Modelling of Speech / 4：
Hidden Markov Models (HMMs) / 4.1：
Solving the Three HMM Problems / 4.2：
Recognition / 4.2.1：
Finding the Optimal State Sequence / 4.2.2：
Training / 4.2.3：
Knowledge Bases of an ASR System / 5：
Acoustic Models / 5.1：
Pronunciation Dictionary / 5.2：
Language Models (LMs) / 5.3：
Speaker Adaptation / 6：
The State of the Art in Speaker Adaptation / 6.1：
Feature-Based Approaches / 6.1.1：
Model-Based Approaches / 6.1.2：
Maximum Likelihood Linear Regression / 6.2：
MLLR for Small Amounts of Adaptation Data / 6.2.1：
The Weighted MLLR Approach / 6.2.2：
Implementation Issues / 6.2.3：
Experiments and Results / 6.2.4：
Summary / 6.3：
Confidence Measures / 7：
The State of the Art in Confidence Measures / 7.1：
Statistical Hypothesis Testing / 7.1.1：
Using a Set of Features / 7.1.2：
Neural Networks / 7.2：
Activation Function / 7.2.1：
Output Function / 7.2.2：
Learning in NNs / 7.2.3：
Evaluating Confidence Measures / 7.3：
CM Features / 7.4：
Phone-Duration Based Features / 7.4.1：
Additional Features / 7.4.2：
Combining the NN Classifier with Speaker Adaptation / 7.4.3：
Evaluation of the NN Classifier / 7.5：
Semi-supervised Adaptation / 7.5.2：
Pronunciation Adaptation / 7.6：
The State of the Art in Pronunciation Modelling / 8.1：
Rule-Based Approaches / 8.1.1：
Data-Driven Approaches / 8.1.2：
Combined Approaches / 8.1.3：
Miscellaneous Approaches / 8.1.4：
Re-training the Acoustic Models / 8.1.5：
Pronunciation Modelling of Accented and Dialect Speech / 8.2：
Recognising Non-native Speech / 8.3：
Generating Non-native Pronunciation Variants / 8.4：
Classification Trees / 8.4.1：
Future Work / 8.4.2：
Dynamic Selection of Pronunciation Rules / 9.1：
Bibliography / 10：
Index
Glossary
Databases and ExperimentalSettings / A：
The German Database / A.1：
Settings for NN Training and Testing / A.1.1：
The British English WSJ Database / A.3：
ISLE Database / A.4：
MLLR Results / B：
Phoneme Inventory / C：
German Symbol Inventory / C.1：
English Symbol Inventory / C.2：
Manually Derived Pronunciation Rules for the ISLE Corpus / C.3：
Introduction / 1：
Outline of This Book / 1.1：
ASR: An Overview / 2：
100.
図書
Hermann Ley
出版情報:
Berlin : VEB Deutscher Verlag der Wissenschaften, 1966-1989 v. ; 24 cm
子書誌情報:
loading…
所蔵情報:
loading…
図書
