close
1.

図書
図書
1. Analytical electrochemistry
Joseph Wang
出版情報: New York, N.Y. : VCH, c1994  xi, 198 p. ; 25 cm
所蔵情報: 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：
2.

図書
図書
2. Models and tools for managing development processes
Bernhard Westfechtel
出版情報: Berlin ; Tokyo : Springer, c1999  xiv, 418 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1646
所蔵情報: loading…
目次情報: 続きを見る
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：
3.

図書
図書
3. Computer networks : a systems approach
Larry L. Peterson & Bruce S. Davie
出版情報: San Francisco, Calif. : Morgan Kaufmann Publishers, c1996  xxiii, 552 p. ; 25 cm
所蔵情報: 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：
4.

図書
図書
4. View synthesis using stereo vision
Daniel Scharstein
出版情報: Berlin ; New York : Springer, c1999  xv, 163 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1583
所蔵情報: loading…
目次情報: 続きを見る
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：
5.

図書
図書
5. Grading knowledge : extracting degree information from texts
Steffen Staab
出版情報: Berlin ; Tokyo : Springer, c1999  xiv, 187 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1744 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
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：
6.

図書
図書
6. Fundamentals of semiconductors : physics and materials properties. 2nd updated ed (hardcover)
Peter Y. Yu, Manuel Cardona
出版情報: New York ; Tokyo : Springer Verlag, 1999  xvi, 620 p. ; 25 cm
所蔵情報: 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：
7.

図書
図書
7. Compiling natural semantics
Mikael Pettersson
出版情報: Berlin ; Tokyo ; New York : Springer, c1999  xvi, 240 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1549
所蔵情報: loading…
目次情報: 続きを見る
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：
8.

図書
図書
8. Automatic verification of sequential infinite-state processes
Olaf Burkart
出版情報: Berlin : Springer, c1997  x, 163 p.; 24 cm
シリーズ名: Lecture notes in computer science ; 1354
所蔵情報: loading…
目次情報: 続きを見る
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：
9.

図書
図書
9. Focusing solutions for data mining : analytical studies and experimental results in real-world domains
Thomas Reinartz
出版情報: Berlin ; Tokyo : Springer, c1999  xiv, 307 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1623 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
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：
10.

図書
図書
10. Abstract compositional analysis of iterated relations : a structural approach to complex state transition systems
Frédéric Geurts
出版情報: Berlin : Springer, c1998  xiv, 280 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1426
所蔵情報: loading…
目次情報: 続きを見る
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：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼