close
1.

電子ブック
ＥＢ
1. Secure Key Establishment
Kim-Kwang Raymond Choo
出版情報: Springer eBooks Computer Science , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
The Key Distribution Problem / 1.1：
Solution: Key Establishment Protocols / 1.2：
Computer Security Approach / 1.2.1：
Computational Complexity Approach / 1.2.2：
Research Objectives and Deliverables / 1.2.3：
Structure of Book and Contributions to Knowledge / 1.3：
References
Background Materials / 2：
Mathematical Background / 2.1：
Abstract Algebra and the Main Groups / 2.1.1：
Bilinear Maps from Elliptic Curve Pairings / 2.1.2：
Computational Problems and Assumptions / 2.1.3：
Cryptographic Tools / 2.1.4：
Encryption Schemes: Asymmetric Setting / 2.1.4.1：
Encryption Schemes: Symmetric Setting / 2.1.4.2：
Digital Signature Schemes / 2.1.4.3：
Message Authentication Codes / 2.1.4.4：
Cryptographic Hash Functions / 2.1.4.5：
Random Oracles / 2.1.4.6：
Key Establishment Protocols and their Basis / 2.2：
Protocol Architectures / 2.2.1：
Existing Cryptographic Keys / 2.2.1.1：
Method of Session Key Generation / 2.2.1.2：
Number of Entities / 2.2.1.3：
Protocol Goals and Attacks / 2.2.2：
Protocol Goals / 2.2.2.1：
Additional Security Attributes / 2.2.2.2：
Types of Attacks / 2.2.2.3：
A Need for Rigorous Treatment / 2.2.2.4：
The Computational Complexity Approach / 2.3：
Adversarial Powers / 2.3.1：
Definition of Freshness / 2.3.2：
Definition of Security / 2.3.3：
The Bellare-Rogaway Models / 2.3.4：
The BR93 Model / 2.3.4.1：
The BR95 Model / 2.3.4.2：
The BPR2000 Model / 2.3.4.3：
The Canetti-Krawczyk Model / 2.3.5：
Protocol Security / 2.3.6：
Summary / 2.4：
A Flawed BR95 Partnership Function / 3：
A Flaw in the Security Proof for 3PKD Protocol / 3.1：
The 3PKD Protocol / 3.1.1：
Key Replicating Attack on 3PKD Protocol / 3.1.2：
The Partner Function used in the BR95 Proof / 3.1.3：
A Revised 3PKD Protocol in Bellare-Rogaway Model / 3.2：
Defining SIDs in the 3PKD Protocol / 3.2.1：
An Improved Provably Secure 3PKD Protocol / 3.2.2：
Security Proof for the Improved 3PKD Protocol / 3.2.3：
Adaptive MAC Forger F / 3.2.3.1：
Multiple Eavesdropper Attacker ME / 3.2.3.2：
Conclusion of Proof / 3.2.3.3：
On The Key Sharing Requirement / 3.3：
Bellare-Rogaway 3PKD Protocol in CK2001 Model / 4.1：
New Attack on 3PKD Protocol / 4.1.1：
A New Provably-Secure 3PKD Protocol in CK2001 Model / 4.1.3：
Jeong-Katz-Lee Protocol JP2 / 4.2：
Protocol JP2 / 4.2.1：
New Attack on Protocol JP2 / 4.2.2：
An Improved Protocol JP2 / 4.2.3：
The Key Sharing Requirement / 4.3：
Comparison of Bellare-Rogaway and Canetti-Krawczyk Models / 4.4：
Relating The Notions of Security / 5.1：
Proving BR93 (EA+KE) to BPR2000 (EA+KE) / 5.1.1：
Proof for the key establishment goal / 5.1.1.1：
Proof for the entity authentication goal / 5.1.1.2：
Proving CK2001 to BPR2000 (KE) / 5.1.2：
Proving CK2001 to BR93 (KE) / 5.1.3：
BR93 (KE) to BR95 and BR93 (KE), CK2001 [not left arrow] BR95 / 5.1.4：
BR93 (KE)/CK2001 [not left arrow] BPR2000 (KE) / 5.1.5：
CK2001 [not left arrow] BR93 (EA+KE) / 5.1.6：
BR93 (KE) [not left arrow] CK2001 / 5.1.7：
BPR200 (KE) [not left arrow] BR95 / 5.1.8：
A Drawback in the BPR2000 Model / 5.2：
Case Study: Abdalla-Pointcheval 3PAKE / 5.2.1：
Unknown Key Share Attack on 3PAKE / 5.2.2：
An Extension to the Bellare-Rogaway Model / 5.3：
A Provably-Secure Revised Protocol of Boyd / 6.1：
Secure Authenticated Encryption Schemes / 6.1.1：
Revised Protocol of Boyd / 6.1.2：
Security Proof / 6.1.3：
Integrity attacker / 6.1.3.1：
Confidentiality attacker / 6.1.3.2：
Conclusion of Security Proof / 6.1.3.3：
An Extension to the BR93 Model / 6.2：
An Efficient Protocol in Extended Model / 6.3：
An Efficient Protocol / 6.3.1：
Integrity Breaker / 6.3.2：
Confidentiality Breaker / 6.3.2.2：
Comparative Security and Efficiency / 6.3.2.3：
A Proof of Revised Yahalom Protocol / 6.5：
The Yahalom Protocol and its Simplified Version / 7.1：
A New Provably-Secure Protocol / 7.2：
Proof for Protocol 7.2 / 7.2.1：
Conclusion of Proof for Theorem 7.2.1 / 7.2.1.1：
An Extension to Protocol 7.2 / 7.2.2：
Partnering Mechanism: A Brief Discussion / 7.3：
Errors in Computational Complexity Proofs for Protocols / 7.4：
Boyd-Gonzalez Nieto Protocol / 8.1：
Unknown Key Share Attack on Protocol / 8.1.1：
An Improved Conference Key Agreement Protocol / 8.1.2：
Limitations of Existing Proof / 8.1.3：
Jakobsson-Pointcheval MAKEP / 8.2：
Unknown Key Share Attack on JP-MAKEP / 8.2.1：
Flaws in Existing Security Proof for JP-MAKEP / 8.2.2：
Wong-Chan MAKEP / 8.3：
A New Attack on WC-MAKEP / 8.3.1：
Preventing the Attack / 8.3.2：
Flaws in Existing Security Proof for WC-MAKEP / 8.3.3：
An MT-Authenticator / 8.4：
Encryption-Based MT-Authenticator / 8.4.1：
Flaw in Existing Security Proof Revealed / 8.4.2：
Addressing the Flaw / 8.4.3：
An Example Protocol as a Case Study / 8.4.4：
On Session Key Construction / 8.5：
Chen-Kudla ID-Based Protocol / 9.1：
The ID-Based Protocol / 9.1.1：
Existing Arguments on Restriction of Reveal Query / 9.1.2：
Improved Chen-Kudla Protocol / 9.1.3：
Security Proof for Improved Chen-Kudla Protocol / 9.1.4：
McCullagh-Barreto 2P-IDAKA Protocol / 9.2：
The 2P-IDAKA Protocol / 9.2.1：
Why Reveal Query is Restricted / 9.2.2：
Errors in Existing Proof for 2P-IDAKA Protocol / 9.2.3：
Error 1 / 9.2.3.1：
Error 2 / 9.2.3.2：
Improved 2P-IDAKA Protocol / 9.2.4：
A Proposal for Session Key Construction / 9.3：
Another Case Study / 9.4：
Reflection Attack on Lee-Kim-Yoo Protocol / 9.4.1：
Complementing Computational Protocol Analysis / 9.4.2：
The Formal Framework / 10.1：
Analysing a Provably-Secure Protocol / 10.2：
Protocol Specification / 10.2.1：
Initial State of Protocol 10.1 / 10.2.1.1：
Step 1 of Protocol 10.1 / 10.2.1.2：
A Malicious State Transition / 10.2.1.3：
Protocol Analysis / 10.2.2：
Hijacking Attack / 10.2.2.1：
New Attack 1 / 10.2.2.2：
New Attack 2 / 10.2.2.3：
Analysing Another Two Protocols With Claimed Proofs of Security / 10.3：
Analysis of Protocol 10.2 / 10.3.1：
Analysis of Protocol 10.3 / 10.3.1.2：
Flaws in Refuted Proofs / 10.3.2：
A Possible Fix / 10.3.3：
Analysing Protocols with Heuristic Security Arguments / 10.4：
Case Studies / 10.4.1：
Jan-Chen Mutual Protocol / 10.4.1.1：
Yang-Shen-Shieh Protocol / 10.4.1.2：
Kim-Huh-Hwang-Lee Protocol / 10.4.1.3：
Lin-Sun-Hwang Key Protocols MDHEKE I and II / 10.4.1.4：
Yeh-Sun Key Protocol / 10.4.1.5：
Protocol Analyses / 10.4.2：
Protocol Analysis 1 / 10.4.2.1：
Protocol Analysis 2 / 10.4.2.2：
Protocol Analysis 3 / 10.4.2.3：
Protocol Analysis 4 / 10.4.2.4：
Protocol Analysis 5 / 10.4.2.5：
Protocol Analysis 6 / 10.4.2.6：
Protocol Analysis 7 / 10.4.2.7：
An Integrative Framework to Protocol Analysis and Repair / 10.5：
Case Study Protocol / 11.1：
Proposed Integrative Framework / 11.2：
Protocols Specification / 11.2.1：
Defining SIDs in Protocol 11.1 / 11.2.1.1：
Description of Goal State / 11.2.1.2：
Description of Possible Actions / 11.2.1.3：
Protocols Analysis / 11.2.2：
Protocol Repair / 11.2.3：
Conclusion and Future Work / 11.3：
Research Summary / 12.1：
Open Problems and Future Directions / 12.2：
Index
Introduction / 1：
The Key Distribution Problem / 1.1：
Solution: Key Establishment Protocols / 1.2：
2.

電子ブック
ＥＢ
2. Secure Key Establishment
Kim-Kwang Raymond Choo
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
The Key Distribution Problem / 1.1：
Solution: Key Establishment Protocols / 1.2：
Computer Security Approach / 1.2.1：
Computational Complexity Approach / 1.2.2：
Research Objectives and Deliverables / 1.2.3：
Structure of Book and Contributions to Knowledge / 1.3：
References
Background Materials / 2：
Mathematical Background / 2.1：
Abstract Algebra and the Main Groups / 2.1.1：
Bilinear Maps from Elliptic Curve Pairings / 2.1.2：
Computational Problems and Assumptions / 2.1.3：
Cryptographic Tools / 2.1.4：
Encryption Schemes: Asymmetric Setting / 2.1.4.1：
Encryption Schemes: Symmetric Setting / 2.1.4.2：
Digital Signature Schemes / 2.1.4.3：
Message Authentication Codes / 2.1.4.4：
Cryptographic Hash Functions / 2.1.4.5：
Random Oracles / 2.1.4.6：
Key Establishment Protocols and their Basis / 2.2：
Protocol Architectures / 2.2.1：
Existing Cryptographic Keys / 2.2.1.1：
Method of Session Key Generation / 2.2.1.2：
Number of Entities / 2.2.1.3：
Protocol Goals and Attacks / 2.2.2：
Protocol Goals / 2.2.2.1：
Additional Security Attributes / 2.2.2.2：
Types of Attacks / 2.2.2.3：
A Need for Rigorous Treatment / 2.2.2.4：
The Computational Complexity Approach / 2.3：
Adversarial Powers / 2.3.1：
Definition of Freshness / 2.3.2：
Definition of Security / 2.3.3：
The Bellare-Rogaway Models / 2.3.4：
The BR93 Model / 2.3.4.1：
The BR95 Model / 2.3.4.2：
The BPR2000 Model / 2.3.4.3：
The Canetti-Krawczyk Model / 2.3.5：
Protocol Security / 2.3.6：
Summary / 2.4：
A Flawed BR95 Partnership Function / 3：
A Flaw in the Security Proof for 3PKD Protocol / 3.1：
The 3PKD Protocol / 3.1.1：
Key Replicating Attack on 3PKD Protocol / 3.1.2：
The Partner Function used in the BR95 Proof / 3.1.3：
A Revised 3PKD Protocol in Bellare-Rogaway Model / 3.2：
Defining SIDs in the 3PKD Protocol / 3.2.1：
An Improved Provably Secure 3PKD Protocol / 3.2.2：
Security Proof for the Improved 3PKD Protocol / 3.2.3：
Adaptive MAC Forger F / 3.2.3.1：
Multiple Eavesdropper Attacker ME / 3.2.3.2：
Conclusion of Proof / 3.2.3.3：
On The Key Sharing Requirement / 3.3：
Bellare-Rogaway 3PKD Protocol in CK2001 Model / 4.1：
New Attack on 3PKD Protocol / 4.1.1：
A New Provably-Secure 3PKD Protocol in CK2001 Model / 4.1.3：
Jeong-Katz-Lee Protocol JP2 / 4.2：
Protocol JP2 / 4.2.1：
New Attack on Protocol JP2 / 4.2.2：
An Improved Protocol JP2 / 4.2.3：
The Key Sharing Requirement / 4.3：
Comparison of Bellare-Rogaway and Canetti-Krawczyk Models / 4.4：
Relating The Notions of Security / 5.1：
Proving BR93 (EA+KE) to BPR2000 (EA+KE) / 5.1.1：
Proof for the key establishment goal / 5.1.1.1：
Proof for the entity authentication goal / 5.1.1.2：
Proving CK2001 to BPR2000 (KE) / 5.1.2：
Proving CK2001 to BR93 (KE) / 5.1.3：
BR93 (KE) to BR95 and BR93 (KE), CK2001 [not left arrow] BR95 / 5.1.4：
BR93 (KE)/CK2001 [not left arrow] BPR2000 (KE) / 5.1.5：
CK2001 [not left arrow] BR93 (EA+KE) / 5.1.6：
BR93 (KE) [not left arrow] CK2001 / 5.1.7：
BPR200 (KE) [not left arrow] BR95 / 5.1.8：
A Drawback in the BPR2000 Model / 5.2：
Case Study: Abdalla-Pointcheval 3PAKE / 5.2.1：
Unknown Key Share Attack on 3PAKE / 5.2.2：
An Extension to the Bellare-Rogaway Model / 5.3：
A Provably-Secure Revised Protocol of Boyd / 6.1：
Secure Authenticated Encryption Schemes / 6.1.1：
Revised Protocol of Boyd / 6.1.2：
Security Proof / 6.1.3：
Integrity attacker / 6.1.3.1：
Confidentiality attacker / 6.1.3.2：
Conclusion of Security Proof / 6.1.3.3：
An Extension to the BR93 Model / 6.2：
An Efficient Protocol in Extended Model / 6.3：
An Efficient Protocol / 6.3.1：
Integrity Breaker / 6.3.2：
Confidentiality Breaker / 6.3.2.2：
Comparative Security and Efficiency / 6.3.2.3：
A Proof of Revised Yahalom Protocol / 6.5：
The Yahalom Protocol and its Simplified Version / 7.1：
A New Provably-Secure Protocol / 7.2：
Proof for Protocol 7.2 / 7.2.1：
Conclusion of Proof for Theorem 7.2.1 / 7.2.1.1：
An Extension to Protocol 7.2 / 7.2.2：
Partnering Mechanism: A Brief Discussion / 7.3：
Errors in Computational Complexity Proofs for Protocols / 7.4：
Boyd-Gonzalez Nieto Protocol / 8.1：
Unknown Key Share Attack on Protocol / 8.1.1：
An Improved Conference Key Agreement Protocol / 8.1.2：
Limitations of Existing Proof / 8.1.3：
Jakobsson-Pointcheval MAKEP / 8.2：
Unknown Key Share Attack on JP-MAKEP / 8.2.1：
Flaws in Existing Security Proof for JP-MAKEP / 8.2.2：
Wong-Chan MAKEP / 8.3：
A New Attack on WC-MAKEP / 8.3.1：
Preventing the Attack / 8.3.2：
Flaws in Existing Security Proof for WC-MAKEP / 8.3.3：
An MT-Authenticator / 8.4：
Encryption-Based MT-Authenticator / 8.4.1：
Flaw in Existing Security Proof Revealed / 8.4.2：
Addressing the Flaw / 8.4.3：
An Example Protocol as a Case Study / 8.4.4：
On Session Key Construction / 8.5：
Chen-Kudla ID-Based Protocol / 9.1：
The ID-Based Protocol / 9.1.1：
Existing Arguments on Restriction of Reveal Query / 9.1.2：
Improved Chen-Kudla Protocol / 9.1.3：
Security Proof for Improved Chen-Kudla Protocol / 9.1.4：
McCullagh-Barreto 2P-IDAKA Protocol / 9.2：
The 2P-IDAKA Protocol / 9.2.1：
Why Reveal Query is Restricted / 9.2.2：
Errors in Existing Proof for 2P-IDAKA Protocol / 9.2.3：
Error 1 / 9.2.3.1：
Error 2 / 9.2.3.2：
Improved 2P-IDAKA Protocol / 9.2.4：
A Proposal for Session Key Construction / 9.3：
Another Case Study / 9.4：
Reflection Attack on Lee-Kim-Yoo Protocol / 9.4.1：
Complementing Computational Protocol Analysis / 9.4.2：
The Formal Framework / 10.1：
Analysing a Provably-Secure Protocol / 10.2：
Protocol Specification / 10.2.1：
Initial State of Protocol 10.1 / 10.2.1.1：
Step 1 of Protocol 10.1 / 10.2.1.2：
A Malicious State Transition / 10.2.1.3：
Protocol Analysis / 10.2.2：
Hijacking Attack / 10.2.2.1：
New Attack 1 / 10.2.2.2：
New Attack 2 / 10.2.2.3：
Analysing Another Two Protocols With Claimed Proofs of Security / 10.3：
Analysis of Protocol 10.2 / 10.3.1：
Analysis of Protocol 10.3 / 10.3.1.2：
Flaws in Refuted Proofs / 10.3.2：
A Possible Fix / 10.3.3：
Analysing Protocols with Heuristic Security Arguments / 10.4：
Case Studies / 10.4.1：
Jan-Chen Mutual Protocol / 10.4.1.1：
Yang-Shen-Shieh Protocol / 10.4.1.2：
Kim-Huh-Hwang-Lee Protocol / 10.4.1.3：
Lin-Sun-Hwang Key Protocols MDHEKE I and II / 10.4.1.4：
Yeh-Sun Key Protocol / 10.4.1.5：
Protocol Analyses / 10.4.2：
Protocol Analysis 1 / 10.4.2.1：
Protocol Analysis 2 / 10.4.2.2：
Protocol Analysis 3 / 10.4.2.3：
Protocol Analysis 4 / 10.4.2.4：
Protocol Analysis 5 / 10.4.2.5：
Protocol Analysis 6 / 10.4.2.6：
Protocol Analysis 7 / 10.4.2.7：
An Integrative Framework to Protocol Analysis and Repair / 10.5：
Case Study Protocol / 11.1：
Proposed Integrative Framework / 11.2：
Protocols Specification / 11.2.1：
Defining SIDs in Protocol 11.1 / 11.2.1.1：
Description of Goal State / 11.2.1.2：
Description of Possible Actions / 11.2.1.3：
Protocols Analysis / 11.2.2：
Protocol Repair / 11.2.3：
Conclusion and Future Work / 11.3：
Research Summary / 12.1：
Open Problems and Future Directions / 12.2：
Index
Introduction / 1：
The Key Distribution Problem / 1.1：
Solution: Key Establishment Protocols / 1.2：
3.

電子ブック
ＥＢ
3. Two-Dimensional Correlation Spectroscopy - Applications in Vibrational and Optical Spectroscopy
Isao Noda, Yukihiro Ozaki, Y Ozaki
出版情報: Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Inc., 2004
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Introduction / 1：
Two-dimensional Spectroscopy / 1.1：
Overview of the Field / 1.2：
Generalized Two-dimensional Correlation / 1.3：
Types of Spectroscopic Probes / 1.3.1：
External Perturbations / 1.3.2：
Heterospectral Correlation / 1.4：
Universal Applicability / 1.5：
Principle of Two-dimensional Correlation Spectroscopy / 2：
Two-dimensional Correlation Spectroscopy / 2.1：
General Scheme / 2.1.1：
Type of External Perturbations / 2.1.2：
Dynamic Spectrum / 2.2：
Two-dimensional Correlation Concept / 2.2.2：
Generalized Two-dimensional Correlation Function / 2.2.3：
Properties of 2D Correlation Spectra / 2.2.4：
Synchronous 2D Correlation Spectrum / 2.3.1：
Asynchronous 2D Correlation Spectrum / 2.3.2：
Special Cases and Exceptions / 2.3.3：
Analytical Expressions for Certain 2D Spectra / 2.4：
Comparison of Linear Functions / 2.4.1：
2D Spectra Based on Sinusoidal Signals / 2.4.2：
Exponentially Decaying Intensities / 2.4.3：
Distributed Lorentzian Peaks / 2.4.4：
Signals with more Complex Waveforms / 2.4.5：
Cross-correlation Analysis and 2D Spectroscopy / 2.5：
Cross-correlation Function and Cross Spectrum / 2.5.1：
Cross-correlation Function and Synchronous Spectrum / 2.5.2：
Hilbert Transform / 2.5.3：
Orthogonal Correlation Function and Asynchronous Spectrum / 2.5.4：
Disrelation Spectrum / 2.5.5：
Practical Computation of Two-dimensional Correlation Spectra / 3：
Computation of 2D Spectra from Discrete Data / 3.1：
Synchronous Spectrum / 3.1.1：
Asynchronous Spectrum / 3.1.2：
Unevenly Spaced Data / 3.2：
Computational Efficiency / 3.3：
Generalized Two-dimensional Correlation Spectroscopy in Practice / 4：
Practical Example / 4.1：
Solvent Evaporation Study / 4.1.1：
2D Spectra Generated from Experimental Data / 4.1.2：
Sequential Order Analysis by Cross Peak Signs / 4.1.3：
Pretreatment of Data / 4.2：
Noise Reduction Methods / 4.2.1：
Baseline Correction Methods / 4.2.2：
Other Pretreatment Methods / 4.2.3：
Features Arising from Factors other than Band Intensity Changes / 4.3：
Effect of Band Position Shift and Line Shape Change / 4.3.1：
Simulation Studies / 4.3.2：
2D Spectral Features from Band Shift and Line Broadening / 4.3.3：
Further Expansion of Generalized Two-dimensional Correlation Spectroscopy - Sample-Sample Correlation and Hybrid Correlation / 5：
Sample-Sample Correlation Spectroscopy / 5.1：
Correlation in another Dimension / 5.1.1：
Matrix Algebra Outlook of 2D Correlation / 5.1.2：
Sample-Sample Correlation Spectra / 5.1.3：
Application of Sample-Sample Correlation / 5.1.4：
Hybrid 2D Correlation Spectroscopy / 5.2：
Multiple Perturbations / 5.2.1：
Correlation between Data Matrices / 5.2.2：
Case Studies / 5.2.3：
Additional Remarks / 5.3：
Additional Developments in Two-dimensional Correlation Spectroscopy - Statistical Treatments, Global Phase Maps, and Chemometrics / 6：
Classical Statistical Treatments and 2D Spectroscopy / 6.1：
Variance, Covariance, and Correlation Coefficient / 6.1.1：
Interpretation of 2D Disrelation Spectrum / 6.1.2：
Coherence and Correlation Phase Angle / 6.1.3：
Correlation Enhancement / 6.1.4：
Global 2D Phase Maps / 6.2：
Further Discussion on Global Phase / 6.2.1：
Phase Map with a Blinding Filter / 6.2.2：
Simulation Study / 6.2.3：
Chemometrics and 2D Correlation Spectroscopy / 6.3：
Comparison between Chemometrics and 2D Correlation / 6.3.1：
Factor Analysis / 6.3.2：
Principal Component Analysis (PCA) / 6.3.3：
Number of Principal Factors / 6.3.4：
PCA-reconstructed Spectra / 6.3.5：
Eigenvalue Manipulating Transformation (EMT) / 6.3.6：
Other Types of Two-dimensional Spectroscopy / 7：
Nonlinear Optical 2D Spectroscopy / 7.1：
Ultrafast Laser Pulses / 7.1.1：
Comparison with Generalized 2D Correlation Spectroscopy / 7.1.2：
Overlap Between Generalized 2D Correlation and Nonlinear Spectroscopy / 7.1.3：
Statistical 2D Correlation Spectroscopy / 7.2：
Statistical 2D Correlation by Barton II et al. / 7.2.1：
Statistical 2D Correlation by &Sa&sic and Ozaki / 7.2.2：
Other Statistical 2D Spectra / 7.2.3：
Link to Chemometrics / 7.2.4：
Other Developments in 2D Correlation Spectroscopy / 7.3：
Moving-window Correlation / 7.3.1：
Model-based 2D Correlation Spectroscopy / 7.3.2：
Dynamic Two-di / 8：
Preface
Acknowledgements
Introduction / 1：
4.

電子ブック
ＥＢ
4. Peer-to-Peer Video Streaming
Eric Setton, Bernd Girod
出版情報: Springer eBooks Computer Science , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Background / 2：
Video Compression / 2.1：
H.264 Video Coding / 2.1.1：
Distortion Models / 2.1.2：
Video Streaming / 2.2：
Error Resilience / 2.2.1：
Congestion Control / 2.2.2：
Path Diversity / 2.2.3：
Multicast Architectures / 2.3：
IP Multicast / 2.3.1：
Content Delivery Networks / 2.3.2：
Peer-to-Peer Systems / 2.4：
Peer-to-Peer File Transfer, the Example of BitTorrent / 2.4.1：
Peer-to-Peer Streaming / 2.4.2：
Streaming over Throughput-Limited Paths / 3：
Video Encoding for Throughput-Limited Paths / 3.1：
End-to-End Rate-Distortion Performance Model / 3.1.1：
Experimental Results / 3.1.2：
Congestion-Distortion Optimized Scheduling / 3.2：
Channel Model / 3.2.1：
Evaluating a Schedule / 3.2.2：
Randomized Schedule Search / 3.2.3：
CoDiO Light / 3.2.4：
Chapter Summary / 3.2.5：
Peer-to-Peer Control Protocol / 4：
Protocol Description / 4.1：
Different Peer States / 4.1.1：
Different Tree Connection States / 4.1.2：
Multicast Source / 4.1.3：
Protocol Settings / 4.1.4：
Experimental Protocol Evaluation / 4.2：
Experimental Setup / 4.2.1：
Control Protocol Traffic Distribution / 4.2.2：
Join and Rejoin Latency / 4.2.3：
Scalability / 4.2.4：
Limiting Throughput / 4.2.5：
Video Streaming over a Peer-to-Peer Network / 4.3：
Video Streaming Protocol / 5.1：
Video Packet Transmission / 5.1.1：
Retransmissions / 5.1.2：
Peer-to-Peer CoDiO Scheduling / 5.2：
Sender-Driven Prioritization / 5.2.1：
Distortion-Optimized Retransmission Scheduling / 5.2.2：
Scheduler Evaluation / 5.2.3：
Video Sessions / 5.3：
Diversity / 5.3.2：
CoDiO P2P / 5.3.3：
Conclusions and Future Work / 5.4：
Conclusions / 6.1：
Future Work / 6.2：
Video Experiments / A：
Encoding Structures / A.1：
Latency-Constrained Video Streaming / A.1.2：
Error-Resilient Decoding / A.1.3：
Quality Metric / A.1.4：
Video Sequences / A.2：
Container / A.2.1：
Foreman / A.2.2：
Mobile / A.2.3：
Mother & Daughter / A.2.4：
News / A.2.5：
Salesman / A.2.6：
References
Index
Introduction / 1：
Background / 2：
Video Compression / 2.1：
5.

電子ブック
ＥＢ
5. Peer-to-Peer Video Streaming
Eric Setton, Bernd Girod
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Background / 2：
Video Compression / 2.1：
H.264 Video Coding / 2.1.1：
Distortion Models / 2.1.2：
Video Streaming / 2.2：
Error Resilience / 2.2.1：
Congestion Control / 2.2.2：
Path Diversity / 2.2.3：
Multicast Architectures / 2.3：
IP Multicast / 2.3.1：
Content Delivery Networks / 2.3.2：
Peer-to-Peer Systems / 2.4：
Peer-to-Peer File Transfer, the Example of BitTorrent / 2.4.1：
Peer-to-Peer Streaming / 2.4.2：
Streaming over Throughput-Limited Paths / 3：
Video Encoding for Throughput-Limited Paths / 3.1：
End-to-End Rate-Distortion Performance Model / 3.1.1：
Experimental Results / 3.1.2：
Congestion-Distortion Optimized Scheduling / 3.2：
Channel Model / 3.2.1：
Evaluating a Schedule / 3.2.2：
Randomized Schedule Search / 3.2.3：
CoDiO Light / 3.2.4：
Chapter Summary / 3.2.5：
Peer-to-Peer Control Protocol / 4：
Protocol Description / 4.1：
Different Peer States / 4.1.1：
Different Tree Connection States / 4.1.2：
Multicast Source / 4.1.3：
Protocol Settings / 4.1.4：
Experimental Protocol Evaluation / 4.2：
Experimental Setup / 4.2.1：
Control Protocol Traffic Distribution / 4.2.2：
Join and Rejoin Latency / 4.2.3：
Scalability / 4.2.4：
Limiting Throughput / 4.2.5：
Video Streaming over a Peer-to-Peer Network / 4.3：
Video Streaming Protocol / 5.1：
Video Packet Transmission / 5.1.1：
Retransmissions / 5.1.2：
Peer-to-Peer CoDiO Scheduling / 5.2：
Sender-Driven Prioritization / 5.2.1：
Distortion-Optimized Retransmission Scheduling / 5.2.2：
Scheduler Evaluation / 5.2.3：
Video Sessions / 5.3：
Diversity / 5.3.2：
CoDiO P2P / 5.3.3：
Conclusions and Future Work / 5.4：
Conclusions / 6.1：
Future Work / 6.2：
Video Experiments / A：
Encoding Structures / A.1：
Latency-Constrained Video Streaming / A.1.2：
Error-Resilient Decoding / A.1.3：
Quality Metric / A.1.4：
Video Sequences / A.2：
Container / A.2.1：
Foreman / A.2.2：
Mobile / A.2.3：
Mother & Daughter / A.2.4：
News / A.2.5：
Salesman / A.2.6：
References
Index
Introduction / 1：
Background / 2：
Video Compression / 2.1：
6.

電子ブック
ＥＢ
6. History of Computing and Education 2 (HCE2)
John Impagliazzo
出版情報: Springer eBooks Computer Science , Springer US, 2006
所蔵情報: loading…
7.

電子ブック
ＥＢ
7. History of Computing and Education 2 (HCE2)
John Impagliazzo
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2006
所蔵情報: loading…
8.

電子ブック
ＥＢ
8. Mental Representation and Processing of Geographic Knowledge
Thomas Barkowsky
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2002
所蔵情報: loading…
目次情報: 続きを見る
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：
9.

電子ブック
ＥＢ
9. Identifying Malicious Code Through Reverse Engineering
Abhishek Singh., Abhishek Singh, Baibhav Singh
出版情報: Springer eBooks Computer Science , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Assembly Language
Introduction / 1.0：
Registers / 1.1：
General Purpose Register / 1.1.1：
FLAGS Register / 1.1.2：
80x86 Instruction Format / 1.2：
Instruction Prefix / 1.2.1：
Lock and Repeat Prefixes / 1.2.2：
Segment Override Prefixes / 1.2.3：
Opcode / 1.2.4：
Instructions / 1.3：
Basic Instructions / 1.3.1：
Floating Point Instruction / 1.3.2：
Stack Setup / 1.4：
Passing Parameters in C to the Procedure / 1.4.1：
Local Data Space on the Stack / 1.4.2：
Calling Conventions / 1.5：
cdecl calling convention / 1.5.1：
fastcall calling convention / 1.5.2：
stdcall calling convention / 1.5.3：
thiscall / 1.5.4：
Data Constructs / 1.6：
Global Variables / 1.6.1：
Local Variables / 1.6.2：
Imported Variables / 1.6.3：
Thread Local Storage (TLS) / 1.6.5：
Executable Data Section / 1.6.6：
Representation of Arithmetic Operations in Assembly / 1.7：
Multiplication / 1.7.1：
Division / 1.7.2：
Modulo / 1.7.3：
Representation of Data Structure in Assembly / 1.8：
Representation of Array in Assembly / 1.8.1：
Representation of Linked List in Assembly / 1.8.2：
Virtual Function Call in Assembly / 1.9：
Representation of classes in Assembly / 1.9.1：
Conclusion / 1.10：
Fundamental of Windows
Memory Management / 2.0：
Virtual Memory Management / 2.1.1：
Virtual Memory Management in Windows NT / 2.1.1.1：
Impact of Hooking / 2.1.1.2：
Segmented Memory Management / 2.1.2：
Paged Memory Management / 2.1.3：
Kernel Memory and User Memory / 2.2：
Kernel Memory Space / 2.2.1：
Section Object / 2.2.2：
Virtual Address Descriptor / 2.3：
User Mode Address Space / 2.3.1：
Memory Management in Windows / 2.3.2：
Objects and Handles / 2.3.3：
Named Objects / 2.3.4：
Processes and Threads / 2.4：
Context Switching / 2.4.1：
Context Switches and Mode Switches / 2.4.1.1：
Synchronization Objects / 2.4.2：
Critical Section / 2.4.2.1：
Mutex / 2.4.2.2：
Semaphore / 2.4.2.3：
Event / 2.4.2.4：
Metered Section / 2.4.2.5：
Process Initialization Sequence / 2.5：
Application Programming Interface / 2.5.1：
Reversing Windows NT / 2.6：
ExpEchoPoolCalls / 2.6.1：
ObpShowAllocAndFree / 2.6.2：
LpcpTraceMessages / 2.6.3：
MmDebug / 2.6.4：
NtGlobalFlag / 2.6.5：
SepDumpSD / 2.6.6：
CmLogLevel and CmLogSelect / 2.6.7：
Security Features in Vista / 2.7：
Address Space Layout Randomization (ASLR) / 2.7.1：
Stack Randomization / 2.7.2：
Heap Defenses / 2.7.3：
NX / 2.7.4：
/GS / 2.7.5：
Pointer Encoding / 2.7.6：
Cryptographic API in Windows Vista / 2.7.7：
Crypto-Agility / 2.7.8：
CryptoAgility in CNG / 2.7.9：
Algorithm Providers / 2.7.10：
Random Number Generator / 2.7.11：
Hash Functions / 2.7.12：
Symmetric Encryption / 2.7.13：
Asymmetric Encryption / 2.7.14：
Signatures and Verification / 2.7.15：
Portable Executable File Format / 2.8：
PE file Format / 3.0：
Import Address Table / 3.2：
Executable and Linking Format / 3.3：
ELF Header / 3.3.1：
The Program Header Table / 3.3.2：
Reversing Binaries for Identifying Vulnerabilities / 3.4：
Stack Overflow / 4.0：
CAN-2002-1123 Microsoft SQL Server 'Hello' Authentication Buffer Overflow" / 4.1.1：
CAN-2004-0399 Exim Buffer Overflow / 4.1.2：
Stack Checking / 4.1.3：
Off-by-One Overflow / 4.2：
OpenBSD 2.7 FTP Daemon Off-by-One / 4.2.1：
Non-Executable Memory / 4.2.3：
Heap Overflows / 4.3：
Heap Based Overflows / 4.3.1：
Integer Overflows / 4.4：
Types Integer Overflow / 4.4.1：
CAN-2004-0417 CVS Max dotdot Protocol Command Integer Overflow / 4.4.2：
Format String / 4.5：
Format String Vulnerability / 4.5.1：
Format String Denial of Service Attack / 4.5.2：
Format String Vulnerability Reading Attack / 4.5.3：
SEH Structure Exception Handler / 4.6：
Exploiting the SEH / 4.6.1：
Writing Exploits General Concepts / 4.7：
Stack Overflow Exploits / 4.7.1：
Injection Techniques / 4.7.2：
Optimizing the Injection Vector / 4.7.3：
The Location of the Payload / 4.8：
Direct Jump (Guessing Offsets) / 4.8.1：
Blind Return / 4.8.2：
Pop Return / 4.8.3：
No Operation Sled / 4.8.4：
Call Register / 4.8.5：
Push Return / 4.8.6：
Calculating Offset / 4.8.7：
Fundamental of Reverse Engineering / 4.9：
Anti-Reversing Method / 5.0：
Anti Disassembly / 5.2.1：
Linear Sweep Disassembler / 5.2.1.1：
Recursive Traversal Disassembler / 5.2.1.2：
Evasion of Disassemble / 5.2.1.3：
Self Modifying Code / 5.2.2：
Virtual Machine Obfuscation / 5.2.3：
Anti Debugging Techniques / 5.3：
BreakPoints / 5.3.1：
Software Breakpoint / 5.3.1.1：
Hardware Breakpoint / 5.3.1.2：
Detecting Hardware BreakPoint / 5.3.1.3：
Virtual Machine Detection / 5.4：
Checking Fingerprint Inside Memory, File System and Registry / 5.4.1：
Checking System Tables / 5.4.2：
Checking Processor Instruction Set / 5.4.3：
Unpacking / 5.5：
Manual Unpacking of Software / 5.5.1：
Finding an Original Entry Point of an Executable / 5.5.1.1：
Taking Memory Dump / 5.5.1.2：
Import Table Reconstruction / 5.5.1.3：
Import Redirection and Code emulation / 5.5.1.4：
Appendix / 5.6：
Index
Assembly Language
Introduction / 1.0：
Registers / 1.1：
10.

電子ブック
ＥＢ
10. Identifying Malicious Code Through Reverse Engineering
Abhishek Singh., Abhishek Singh, Baibhav Singh
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Assembly Language
Introduction / 1.0：
Registers / 1.1：
General Purpose Register / 1.1.1：
FLAGS Register / 1.1.2：
80x86 Instruction Format / 1.2：
Instruction Prefix / 1.2.1：
Lock and Repeat Prefixes / 1.2.2：
Segment Override Prefixes / 1.2.3：
Opcode / 1.2.4：
Instructions / 1.3：
Basic Instructions / 1.3.1：
Floating Point Instruction / 1.3.2：
Stack Setup / 1.4：
Passing Parameters in C to the Procedure / 1.4.1：
Local Data Space on the Stack / 1.4.2：
Calling Conventions / 1.5：
cdecl calling convention / 1.5.1：
fastcall calling convention / 1.5.2：
stdcall calling convention / 1.5.3：
thiscall / 1.5.4：
Data Constructs / 1.6：
Global Variables / 1.6.1：
Local Variables / 1.6.2：
Imported Variables / 1.6.3：
Thread Local Storage (TLS) / 1.6.5：
Executable Data Section / 1.6.6：
Representation of Arithmetic Operations in Assembly / 1.7：
Multiplication / 1.7.1：
Division / 1.7.2：
Modulo / 1.7.3：
Representation of Data Structure in Assembly / 1.8：
Representation of Array in Assembly / 1.8.1：
Representation of Linked List in Assembly / 1.8.2：
Virtual Function Call in Assembly / 1.9：
Representation of classes in Assembly / 1.9.1：
Conclusion / 1.10：
Fundamental of Windows
Memory Management / 2.0：
Virtual Memory Management / 2.1.1：
Virtual Memory Management in Windows NT / 2.1.1.1：
Impact of Hooking / 2.1.1.2：
Segmented Memory Management / 2.1.2：
Paged Memory Management / 2.1.3：
Kernel Memory and User Memory / 2.2：
Kernel Memory Space / 2.2.1：
Section Object / 2.2.2：
Virtual Address Descriptor / 2.3：
User Mode Address Space / 2.3.1：
Memory Management in Windows / 2.3.2：
Objects and Handles / 2.3.3：
Named Objects / 2.3.4：
Processes and Threads / 2.4：
Context Switching / 2.4.1：
Context Switches and Mode Switches / 2.4.1.1：
Synchronization Objects / 2.4.2：
Critical Section / 2.4.2.1：
Mutex / 2.4.2.2：
Semaphore / 2.4.2.3：
Event / 2.4.2.4：
Metered Section / 2.4.2.5：
Process Initialization Sequence / 2.5：
Application Programming Interface / 2.5.1：
Reversing Windows NT / 2.6：
ExpEchoPoolCalls / 2.6.1：
ObpShowAllocAndFree / 2.6.2：
LpcpTraceMessages / 2.6.3：
MmDebug / 2.6.4：
NtGlobalFlag / 2.6.5：
SepDumpSD / 2.6.6：
CmLogLevel and CmLogSelect / 2.6.7：
Security Features in Vista / 2.7：
Address Space Layout Randomization (ASLR) / 2.7.1：
Stack Randomization / 2.7.2：
Heap Defenses / 2.7.3：
NX / 2.7.4：
/GS / 2.7.5：
Pointer Encoding / 2.7.6：
Cryptographic API in Windows Vista / 2.7.7：
Crypto-Agility / 2.7.8：
CryptoAgility in CNG / 2.7.9：
Algorithm Providers / 2.7.10：
Random Number Generator / 2.7.11：
Hash Functions / 2.7.12：
Symmetric Encryption / 2.7.13：
Asymmetric Encryption / 2.7.14：
Signatures and Verification / 2.7.15：
Portable Executable File Format / 2.8：
PE file Format / 3.0：
Import Address Table / 3.2：
Executable and Linking Format / 3.3：
ELF Header / 3.3.1：
The Program Header Table / 3.3.2：
Reversing Binaries for Identifying Vulnerabilities / 3.4：
Stack Overflow / 4.0：
CAN-2002-1123 Microsoft SQL Server 'Hello' Authentication Buffer Overflow" / 4.1.1：
CAN-2004-0399 Exim Buffer Overflow / 4.1.2：
Stack Checking / 4.1.3：
Off-by-One Overflow / 4.2：
OpenBSD 2.7 FTP Daemon Off-by-One / 4.2.1：
Non-Executable Memory / 4.2.3：
Heap Overflows / 4.3：
Heap Based Overflows / 4.3.1：
Integer Overflows / 4.4：
Types Integer Overflow / 4.4.1：
CAN-2004-0417 CVS Max dotdot Protocol Command Integer Overflow / 4.4.2：
Format String / 4.5：
Format String Vulnerability / 4.5.1：
Format String Denial of Service Attack / 4.5.2：
Format String Vulnerability Reading Attack / 4.5.3：
SEH Structure Exception Handler / 4.6：
Exploiting the SEH / 4.6.1：
Writing Exploits General Concepts / 4.7：
Stack Overflow Exploits / 4.7.1：
Injection Techniques / 4.7.2：
Optimizing the Injection Vector / 4.7.3：
The Location of the Payload / 4.8：
Direct Jump (Guessing Offsets) / 4.8.1：
Blind Return / 4.8.2：
Pop Return / 4.8.3：
No Operation Sled / 4.8.4：
Call Register / 4.8.5：
Push Return / 4.8.6：
Calculating Offset / 4.8.7：
Fundamental of Reverse Engineering / 4.9：
Anti-Reversing Method / 5.0：
Anti Disassembly / 5.2.1：
Linear Sweep Disassembler / 5.2.1.1：
Recursive Traversal Disassembler / 5.2.1.2：
Evasion of Disassemble / 5.2.1.3：
Self Modifying Code / 5.2.2：
Virtual Machine Obfuscation / 5.2.3：
Anti Debugging Techniques / 5.3：
BreakPoints / 5.3.1：
Software Breakpoint / 5.3.1.1：
Hardware Breakpoint / 5.3.1.2：
Detecting Hardware BreakPoint / 5.3.1.3：
Virtual Machine Detection / 5.4：
Checking Fingerprint Inside Memory, File System and Registry / 5.4.1：
Checking System Tables / 5.4.2：
Checking Processor Instruction Set / 5.4.3：
Unpacking / 5.5：
Manual Unpacking of Software / 5.5.1：
Finding an Original Entry Point of an Executable / 5.5.1.1：
Taking Memory Dump / 5.5.1.2：
Import Table Reconstruction / 5.5.1.3：
Import Redirection and Code emulation / 5.5.1.4：
Appendix / 5.6：
Index
Assembly Language
Introduction / 1.0：
Registers / 1.1：
11.

電子ブック
ＥＢ
11. Inductive Dependency Parsing
Joakim Nivre
出版情報: SpringerLink Books - AutoHoldings , Springer Netherlands, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Inductive Dependency Parsing / 1.1：
The Need for Robust Disambiguation / 1.2：
Outline of the Book / 1.3：
Natural Language Parsing / 2：
Syntactic Representations / 2.1：
Two Notions of Parsing / 2.2：
Grammar Parsing / 2.2.1：
Text Parsing / 2.2.2：
Competence and Performance / 2.2.3：
Methods for Text Parsing / 2.3：
Grammar-Driven Text Parsing / 2.3.1：
Data-Driven Text Parsing / 2.3.2：
Converging Approaches / 2.3.3：
Evaluation Criteria / 2.3.4：
Robustness / 2.4.1：
Disambiguation / 2.4.2：
Accuracy / 2.4.3：
Efficiency / 2.4.4：
Dependency Parsing / 3：
Dependency Grammar / 3.1：
The Notion of Dependency / 3.1.1：
Varieties of Dependency Grammar / 3.1.2：
Parsing with Dependency Representations / 3.2：
Grammar-Driven Dependency Parsing / 3.2.1：
Data-Driven Dependency Parsing / 3.2.2：
The Case for Dependency Parsing / 3.2.3：
A Framework for Dependency Parsing / 3.3：
Texts, Sentences and Tokens / 3.3.1：
Dependency Graphs / 3.3.2：
Parsing Algorithm / 3.3.3：
Configurations / 3.4.1：
Transitions / 3.4.2：
Deterministic Parsing / 3.4.3：
Algorithm Analysis / 3.4.4：
Evaluation Criteria Revisited / 3.4.5：
A Framework for Inductive Dependency Parsing / 4：
Inductive Inference / 4.1.1：
History-Based Models / 4.1.3：
Parsing Methods / 4.1.4：
Learning Methods / 4.1.5：
Oracle Parsing / 4.1.6：
Features and Models / 4.2：
Feature Functions / 4.2.1：
Static Features / 4.2.2：
Dynamic Features / 4.2.3：
Feature Models / 4.2.4：
Memory-Based Learning / 4.3：
Memory-Based Learning and Classification / 4.3.1：
Learning Algorithm Parameters / 4.3.2：
Memory-Based Language Processing / 4.3.3：
MaltParser / 4.4：
Architecture / 4.4.1：
Implementation / 4.4.2：
Treebank Parsing / 5：
Treebanks and Parsing / 5.1：
Treebank Evaluation / 5.1.1：
Treebank Learning / 5.1.2：
Treebanks for Dependency Parsing / 5.1.3：
Experimental Methodology / 5.2：
Treebank Data / 5.2.1：
Models and Algorithms / 5.2.2：
Evaluation / 5.2.3：
Feature Model Parameters / 5.3：
Part-of-Speech Context / 5.3.1：
Dependency Structure / 5.3.2：
Lexicalization / 5.3.3：
Learning Curves / 5.3.4：
Neighbor Space and Distance Metric / 5.4：
Weighting Schemes / 5.4.2：
Final Evaluation / 5.5：
Accuracy and Efficiency / 5.5.1：
Related Work / 5.5.2：
Error Analysis / 5.5.3：
Conclusion / 6：
Main Contributions / 6.1：
Future Directions / 6.2：
References
Index
Introduction / 1：
Inductive Dependency Parsing / 1.1：
The Need for Robust Disambiguation / 1.2：
12.

電子ブック
ＥＢ
12. Visualization for Information Retrieval
Jin Zhang
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Information Retrieval and Visualization / Chapter 1：
Visualization / 1.1：
Definition / 1.1.1：
Scientific visualization and information visualization / 1.1.2：
Information retrieval / 1.2：
Browsing vs. query searching / 1.2.1：
Information at micro-level and macro-level / 1.2.2：
Spatial Characteristics of information space / 1.2.3：
Spatial characteristics of browsing / 1.2.4：
Perceptual and cognitive perspectives of visualization / 1.3：
Perceptual perspective / 1.3.1：
Cognitive perspective / 1.3.2：
Visualization for information retrieval / 1.4：
Rationale / 1.4.1：
Three information retrieval visualization paradigms / 1.4.2：
Procedures of establishing an information retrieval visualization model / 1.4.3：
Summary / 1.5：
Information Retrieval Preliminaries / Chapter 2：
Vector space model / 2.1：
Term weighting methods / 2.2：
Stop words / 2.2.1：
Inverse document frequency / 2.2.2：
The Salton term weighting method / 2.2.3：
Another term weighting method / 2.2.4：
Probability term weighting method / 2.2.5：
Similarity measures / 2.3：
Inner product similarity measure / 2.3.1：
Dice co-efficient similarity measure / 2.3.2：
The Jaccard co-efficient similarity measure / 2.3.3：
Overlap co-efficient similarity measure / 2.3.4：
Cosine similarity measure / 2.3.5：
Distance similarity measure / 2.3.6：
Angle-distance integrated similarity measure / 2.3.7：
The Pearson r correlation measure / 2.3.8：
Information retrieval (evaluation) models / 2.4：
Direction-based retrieval (evaluation) model / 2.4.1：
Distance-based retrieval (evaluation) model / 2.4.2：
Ellipse retrieval (evaluation) model / 2.4.3：
Conjunction retrieval (evaluation) model / 2.4.4：
Disjunction evaluation model / 2.4.5：
The Cassini oval retrieval (evaluation) model / 2.4.6：
Clustering algorithms / 2.5：
Non-hierarchical clustering algorithm / 2.5.1：
Hierarchical clustering algorithm / 2.5.2：
Evaluation of retrieval results / 2.6：
Visualization Models for Multiple Reference Points / 2.7：
Multiple references points / 3.1：
Model for fixed multiple reference points / 3.2：
Models for movable multiple reference points / 3.3：
Description of the original VIBE algorithm / 3.3.1：
Discussions about the model / 3.3.2：
Model for automatic reference point rotation / 3.4：
Definition of the visual space / 3.4.1：
Rotation of a reference point / 3.4.2：
Implication of information retrieval / 3.5：
Euclidean Spatial Characteristic Based Visualization Models / 3.6：
Euclidean space and its characteristics / 4.1：
Introduction to the information retrieval evaluation models / 4.2：
The distance-angel-based visualization model / 4.3：
The visual space definition / 4.3.1：
Visualization for information retrieval evaluation models / 4.3.2：
The angle-angle-based visualization model / 4.4：
The distance-distance-based visualization model / 4.4.1：
Kohonen Self-Organizing Map-An Artificial Neural Network / 4.5.1：
Introduction to neural networks / 5.1：
Definition of neural network / 5.1.1：
Characteristics and structures of neuron network / 5.1.2：
Kohonen self-organizing maps / 5.2：
Kohonen self-organizing map structures / 5.2.1：
Learning processing of the SOM algorithm / 5.2.2：
Feature map labeling / 5.2.3：
The SOM algorithm description / 5.2.4：
Implication of the SOM in information retrieval / 5.3：
Pathfinder Associative Network / 5.4：
Pathfinder associative network properties and descriptions / 6.1：
Definitions of concepts and explanations / 6.1.1：
The algorithm description / 6.1.2：
Graph layout method / 6.1.3：
Implications on information retrieval / 6.2：
Author co-citation analysis / 6.2.1：
Term associative network / 6.2.2：
Hyperlink / 6.2.3：
Search in Pathfinder associative networks / 6.2.4：
Multidimensional Scaling / 6.3：
MDS analysis method descriptions / 7.1：
Classical MDS / 7.1.1：
Non-metric MDS / 7.1.2：
Metric MDS / 7.1.3：
Implications of MDS techniques for information retrieval / 7.2：
Definitions of displayed objects and proximity between objects / 7.2.1：
Exploration in a MDS display space / 7.2.2：
Discussion / 7.2.3：
Internet Information Visualization / 7.3：
Introduction / 8.1：
Internet characteristics / 8.1.1：
Internet information organization and presentation methods / 8.1.2：
Internet information utilization / 8.1.3：
Challenges of the internet / 8.1.4：
Internet information visualization / 8.2：
Visualization of internet information structure / 8.2.1：
Internet information seeking visualization / 8.2.2：
Visualization of web traffic information / 8.2.3：
Discussion history visualization / 8.2.4：
Ambiguity in Information Visualization / 8.3：
Ambiguity and its implication in information visualization / 9.1：
Reason of ambiguity in information visualization / 9.1.1：
Implication of ambiguity for information visualization / 9.1.2：
Ambiguity analysis in information retrieval visualization models / 9.2：
Ambiguity in the Euclidean spatial characteristic based information models / 9.2.1：
Ambiguity in the multiple reference point based information visualization models / 9.2.2：
Ambiguity in the Pathfinder network / 9.2.3：
Ambiguity in SOM / 9.2.4：
Ambiguity in MDS / 9.2.5：
The Implication of Metaphors in Information Visualization / 9.3：
Definition, basic elements, and characteristics of a metaphor / 10.1：
Cognitive foundation of metaphors / 10.2：
Mental models, metaphors, and human computer interaction / 10.3：
Metaphors in human computer interaction / 10.3.1：
Mental models / 10.3.2：
Mental models in HCI / 10.3.3：
Metaphors in information visualization retrieval / 10.4：
Rationales for using metaphors / 10.4.1：
Metaphorical information retrieval visualization environments / 10.4.2：
Procedures and principles for metaphor application / 10.5：
Procedure for metaphor application / 10.5.1：
Guides for designing a good metaphorical visual information retrieval environment / 10.5.2：
Benchmarks and Evaluation Criteria for Information Retrieval Visualization / 10.6：
Information retrieval visualization evaluation / 11.1：
Benchmarks and evaluation standards / 11.2：
Factors affecting evaluation standards / 11.2.1：
Principles for developing evaluation benchmarks / 11.2.2：
Four proposed categories for evaluation criteria / 11.2.3：
Descriptions of proposed benchmarks / 11.2.4：
Afterthoughts / 11.3：
Comparisons of the introduced visualization models / 12.1：
Issues and challenges / 12.3：
Bibliography / 12.4：
Index
Information Retrieval and Visualization / Chapter 1：
Visualization / 1.1：
Definition / 1.1.1：
13.

電子ブック
ＥＢ
13. Visualization for Information Retrieval
Jin Zhang
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Information Retrieval and Visualization / Chapter 1：
Visualization / 1.1：
Definition / 1.1.1：
Scientific visualization and information visualization / 1.1.2：
Information retrieval / 1.2：
Browsing vs. query searching / 1.2.1：
Information at micro-level and macro-level / 1.2.2：
Spatial Characteristics of information space / 1.2.3：
Spatial characteristics of browsing / 1.2.4：
Perceptual and cognitive perspectives of visualization / 1.3：
Perceptual perspective / 1.3.1：
Cognitive perspective / 1.3.2：
Visualization for information retrieval / 1.4：
Rationale / 1.4.1：
Three information retrieval visualization paradigms / 1.4.2：
Procedures of establishing an information retrieval visualization model / 1.4.3：
Summary / 1.5：
Information Retrieval Preliminaries / Chapter 2：
Vector space model / 2.1：
Term weighting methods / 2.2：
Stop words / 2.2.1：
Inverse document frequency / 2.2.2：
The Salton term weighting method / 2.2.3：
Another term weighting method / 2.2.4：
Probability term weighting method / 2.2.5：
Similarity measures / 2.3：
Inner product similarity measure / 2.3.1：
Dice co-efficient similarity measure / 2.3.2：
The Jaccard co-efficient similarity measure / 2.3.3：
Overlap co-efficient similarity measure / 2.3.4：
Cosine similarity measure / 2.3.5：
Distance similarity measure / 2.3.6：
Angle-distance integrated similarity measure / 2.3.7：
The Pearson r correlation measure / 2.3.8：
Information retrieval (evaluation) models / 2.4：
Direction-based retrieval (evaluation) model / 2.4.1：
Distance-based retrieval (evaluation) model / 2.4.2：
Ellipse retrieval (evaluation) model / 2.4.3：
Conjunction retrieval (evaluation) model / 2.4.4：
Disjunction evaluation model / 2.4.5：
The Cassini oval retrieval (evaluation) model / 2.4.6：
Clustering algorithms / 2.5：
Non-hierarchical clustering algorithm / 2.5.1：
Hierarchical clustering algorithm / 2.5.2：
Evaluation of retrieval results / 2.6：
Visualization Models for Multiple Reference Points / 2.7：
Multiple references points / 3.1：
Model for fixed multiple reference points / 3.2：
Models for movable multiple reference points / 3.3：
Description of the original VIBE algorithm / 3.3.1：
Discussions about the model / 3.3.2：
Model for automatic reference point rotation / 3.4：
Definition of the visual space / 3.4.1：
Rotation of a reference point / 3.4.2：
Implication of information retrieval / 3.5：
Euclidean Spatial Characteristic Based Visualization Models / 3.6：
Euclidean space and its characteristics / 4.1：
Introduction to the information retrieval evaluation models / 4.2：
The distance-angel-based visualization model / 4.3：
The visual space definition / 4.3.1：
Visualization for information retrieval evaluation models / 4.3.2：
The angle-angle-based visualization model / 4.4：
The distance-distance-based visualization model / 4.4.1：
Kohonen Self-Organizing Map-An Artificial Neural Network / 4.5.1：
Introduction to neural networks / 5.1：
Definition of neural network / 5.1.1：
Characteristics and structures of neuron network / 5.1.2：
Kohonen self-organizing maps / 5.2：
Kohonen self-organizing map structures / 5.2.1：
Learning processing of the SOM algorithm / 5.2.2：
Feature map labeling / 5.2.3：
The SOM algorithm description / 5.2.4：
Implication of the SOM in information retrieval / 5.3：
Pathfinder Associative Network / 5.4：
Pathfinder associative network properties and descriptions / 6.1：
Definitions of concepts and explanations / 6.1.1：
The algorithm description / 6.1.2：
Graph layout method / 6.1.3：
Implications on information retrieval / 6.2：
Author co-citation analysis / 6.2.1：
Term associative network / 6.2.2：
Hyperlink / 6.2.3：
Search in Pathfinder associative networks / 6.2.4：
Multidimensional Scaling / 6.3：
MDS analysis method descriptions / 7.1：
Classical MDS / 7.1.1：
Non-metric MDS / 7.1.2：
Metric MDS / 7.1.3：
Implications of MDS techniques for information retrieval / 7.2：
Definitions of displayed objects and proximity between objects / 7.2.1：
Exploration in a MDS display space / 7.2.2：
Discussion / 7.2.3：
Internet Information Visualization / 7.3：
Introduction / 8.1：
Internet characteristics / 8.1.1：
Internet information organization and presentation methods / 8.1.2：
Internet information utilization / 8.1.3：
Challenges of the internet / 8.1.4：
Internet information visualization / 8.2：
Visualization of internet information structure / 8.2.1：
Internet information seeking visualization / 8.2.2：
Visualization of web traffic information / 8.2.3：
Discussion history visualization / 8.2.4：
Ambiguity in Information Visualization / 8.3：
Ambiguity and its implication in information visualization / 9.1：
Reason of ambiguity in information visualization / 9.1.1：
Implication of ambiguity for information visualization / 9.1.2：
Ambiguity analysis in information retrieval visualization models / 9.2：
Ambiguity in the Euclidean spatial characteristic based information models / 9.2.1：
Ambiguity in the multiple reference point based information visualization models / 9.2.2：
Ambiguity in the Pathfinder network / 9.2.3：
Ambiguity in SOM / 9.2.4：
Ambiguity in MDS / 9.2.5：
The Implication of Metaphors in Information Visualization / 9.3：
Definition, basic elements, and characteristics of a metaphor / 10.1：
Cognitive foundation of metaphors / 10.2：
Mental models, metaphors, and human computer interaction / 10.3：
Metaphors in human computer interaction / 10.3.1：
Mental models / 10.3.2：
Mental models in HCI / 10.3.3：
Metaphors in information visualization retrieval / 10.4：
Rationales for using metaphors / 10.4.1：
Metaphorical information retrieval visualization environments / 10.4.2：
Procedures and principles for metaphor application / 10.5：
Procedure for metaphor application / 10.5.1：
Guides for designing a good metaphorical visual information retrieval environment / 10.5.2：
Benchmarks and Evaluation Criteria for Information Retrieval Visualization / 10.6：
Information retrieval visualization evaluation / 11.1：
Benchmarks and evaluation standards / 11.2：
Factors affecting evaluation standards / 11.2.1：
Principles for developing evaluation benchmarks / 11.2.2：
Four proposed categories for evaluation criteria / 11.2.3：
Descriptions of proposed benchmarks / 11.2.4：
Afterthoughts / 11.3：
Comparisons of the introduced visualization models / 12.1：
Issues and challenges / 12.3：
Bibliography / 12.4：
Index
Information Retrieval and Visualization / Chapter 1：
Visualization / 1.1：
Definition / 1.1.1：
14.

電子ブック
ＥＢ
14. Foundations of Systems Biology
Masao Nagasaki, Atsushi Doi, Andreas Dress, Hiroshi Matsuno, Satoru Miyano, Ayumu Saito, Martin Vingron, Martin Vingron, Gene Myers, Robert Giegerich, Walter Fitch, Pavel A. Pevzner. edited by Andreas Dress
出版情報: Springer eBooks Computer Science , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Introduction / 1：
Intracellular Events / 1.1：
Transcription, Translation, and Regulation / 1.1.1：
Signaling Pathways and Proteins / 1.1.2：
Metabolism and Genes / 1.1.3：
Intracellular Reactions and Pathways / 1.2：
Pathway Databases / 2：
Major Pathway Databases / 2.1：
KEGG / 2.1.1：
BioCyc / 2.1.2：
Ingenuity Pathways Knowledge Base / 2.1.3：
TRANSPATH / 2.1.4：
ResNet / 2.1.5：
Signal Transduction Knowledge Environment (STKE): Database of Cell Signaling / 2.1.6：
Reactome / 2.1.7：
Metabolome.jp / 2.1.8：
Summary and Conclusion / 2.1.9：
Software for Pathway Display / 2.2：
Ingenuity Pathway Analysis (IPA) / 2.2.1：
Pathway Builder / 2.2.2：
Pathway Studio / 2.2.3：
Connections Maps / 2.2.4：
Cytoscape / 2.2.5：
File Formats for Pathways / 2.3：
Gene Ontology / 2.3.1：
PSI MI / 2.3.2：
CellML / 2.3.3：
SBML / 2.3.4：
BioPAX / 2.3.5：
CSML/CSO / 2.3.6：
Pathway Simulation Software / 3：
Simulation Software Backend / 3.1：
Architecture: Deterministic, Probabilistic, or Hybrid? / 3.1.1：
Methods of Pathway Modeling / 3.1.2：
Major Simulation Software Tools / 3.2：
Gepasi/COPASI / 3.2.1：
Virtual Cell / 3.2.2：
Systems Biology Workbench (SBW), Cell Designer, JDesigner / 3.2.3：
Dizzy / 3.2.4：
E-Cell / 3.2.5：
Cell Illustrator / 3.2.6：
Summary / 3.2.7：
Starting Cell Illustrator / 4：
Installing Cell Illustrator / 4.1：
Operating Systems and Hardware Requirements / 4.1.1：
Cell Illustrator Lineup / 4.1.2：
Installing and Running Cell Illustrator / 4.1.3：
License Install / 4.1.4：
Basic Concepts in Cell Illustrator / 4.2：
Basic Concepts / 4.2.1：
Entity / 4.2.2：
Process / 4.2.3：
Connector / 4.2.4：
Rules for Connecting Elements / 4.2.5：
Icons for Elements / 4.2.6：
Editing a Model on Cell Illustrator / 4.3：
Adding Elements / 4.3.1：
Model Editing and Canvas Controls / 4.3.2：
Simulating Models / 4.4：
Simulation Settings / 4.4.1：
Graph Settings / 4.4.2：
Executing Simulation / 4.4.3：
Simulation Parameters and Rules / 4.5：
Creating a Model with Discrete Entity and Process / 4.5.1：
Creating a Model with Continuous Entity and Process / 4.5.2：
Concepts of Discrete and Continuous / 4.5.3：
Pathway Modeling Using Illustrated Elements / 4.6：
Creating Pathway Models Using Cell Illustrator / 4.7：
Degradation / 4.7.1：
Translocation / 4.7.2：
Transcription / 4.7.3：
Binding / 4.7.4：
Dissociation / 4.7.5：
Inhibition / 4.7.6：
Phosphorylation by Enzyme Reaction / 4.7.7：
Conclusion / 4.8：
Pathway Modeling and Simulation / 5：
Modeling Signaling Pathway / 5.1：
Main Players: Ligand and Receptor / 5.1.1：
Modeling EGFR Signaling with EGF Stimulation / 5.1.2：
Modeling Metabolic Pathways / 5.2：
Chemical Equations and Pathway Representations / 5.2.1：
Michaelis-Menten Kinetics and Cell Illustrator Pathway Representation / 5.2.2：
Creating Glycolysis Pathway Model / 5.2.3：
Simulation of Glycolysis Pathway / 5.2.4：
Improving the Model / 5.2.5：
Modeling Gene Regulatory Networks / 5.3：
Biological Clocks and Circadian Rhythms / 5.3.1：
Gene Regulatory Network for Circadian Rhythms in Mice / 5.3.2：
Modeling Circadian Rhythms in Mice / 5.3.3：
Creating Hypothesis by Simulation / 5.3.4：
Computational Platform for Systems Biology / 5.4：
Gene Network of Yeast / 6.1：
Computational Analysis of Gene Network / 6.2：
Displaying Gene Network / 6.2.1：
Layout of Gene Networks / 6.2.2：
Pathway Search Function / 6.2.3：
Extracting Subnetworks / 6.2.4：
Comparing Two Subnetworks / 6.2.5：
Further Functionalities for Systems Biology / 6.3：
Languages for Pathways: CSML 3.0 and CSO / 6.3.1：
SaaS Technology / 6.3.2：
Pathway Parameter Search / 6.3.3：
Much Faster Simulation / 6.3.4：
Exporting Pathway Models to Programming Languages / 6.3.5：
Pathway Layout Algorithms / 6.3.6：
Pathway Database Management System / 6.3.7：
More Visually: Automatic Generation of Icons / 6.3.8：
Bibliographic Notes
Index
Foreword
Preface
Introduction / 1：
15.

電子ブック
ＥＢ
15. Foundations of Systems Biology
Masao Nagasaki, Atsushi Doi, Andreas Dress, Hiroshi Matsuno, Satoru Miyano, Ayumu Saito, Martin Vingron, Martin Vingron, Gene Myers, Robert Giegerich, Walter Fitch, Pavel A. Pevzner. edited by Andreas Dress, Gene Myers
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Introduction / 1：
Intracellular Events / 1.1：
Transcription, Translation, and Regulation / 1.1.1：
Signaling Pathways and Proteins / 1.1.2：
Metabolism and Genes / 1.1.3：
Intracellular Reactions and Pathways / 1.2：
Pathway Databases / 2：
Major Pathway Databases / 2.1：
KEGG / 2.1.1：
BioCyc / 2.1.2：
Ingenuity Pathways Knowledge Base / 2.1.3：
TRANSPATH / 2.1.4：
ResNet / 2.1.5：
Signal Transduction Knowledge Environment (STKE): Database of Cell Signaling / 2.1.6：
Reactome / 2.1.7：
Metabolome.jp / 2.1.8：
Summary and Conclusion / 2.1.9：
Software for Pathway Display / 2.2：
Ingenuity Pathway Analysis (IPA) / 2.2.1：
Pathway Builder / 2.2.2：
Pathway Studio / 2.2.3：
Connections Maps / 2.2.4：
Cytoscape / 2.2.5：
File Formats for Pathways / 2.3：
Gene Ontology / 2.3.1：
PSI MI / 2.3.2：
CellML / 2.3.3：
SBML / 2.3.4：
BioPAX / 2.3.5：
CSML/CSO / 2.3.6：
Pathway Simulation Software / 3：
Simulation Software Backend / 3.1：
Architecture: Deterministic, Probabilistic, or Hybrid? / 3.1.1：
Methods of Pathway Modeling / 3.1.2：
Major Simulation Software Tools / 3.2：
Gepasi/COPASI / 3.2.1：
Virtual Cell / 3.2.2：
Systems Biology Workbench (SBW), Cell Designer, JDesigner / 3.2.3：
Dizzy / 3.2.4：
E-Cell / 3.2.5：
Cell Illustrator / 3.2.6：
Summary / 3.2.7：
Starting Cell Illustrator / 4：
Installing Cell Illustrator / 4.1：
Operating Systems and Hardware Requirements / 4.1.1：
Cell Illustrator Lineup / 4.1.2：
Installing and Running Cell Illustrator / 4.1.3：
License Install / 4.1.4：
Basic Concepts in Cell Illustrator / 4.2：
Basic Concepts / 4.2.1：
Entity / 4.2.2：
Process / 4.2.3：
Connector / 4.2.4：
Rules for Connecting Elements / 4.2.5：
Icons for Elements / 4.2.6：
Editing a Model on Cell Illustrator / 4.3：
Adding Elements / 4.3.1：
Model Editing and Canvas Controls / 4.3.2：
Simulating Models / 4.4：
Simulation Settings / 4.4.1：
Graph Settings / 4.4.2：
Executing Simulation / 4.4.3：
Simulation Parameters and Rules / 4.5：
Creating a Model with Discrete Entity and Process / 4.5.1：
Creating a Model with Continuous Entity and Process / 4.5.2：
Concepts of Discrete and Continuous / 4.5.3：
Pathway Modeling Using Illustrated Elements / 4.6：
Creating Pathway Models Using Cell Illustrator / 4.7：
Degradation / 4.7.1：
Translocation / 4.7.2：
Transcription / 4.7.3：
Binding / 4.7.4：
Dissociation / 4.7.5：
Inhibition / 4.7.6：
Phosphorylation by Enzyme Reaction / 4.7.7：
Conclusion / 4.8：
Pathway Modeling and Simulation / 5：
Modeling Signaling Pathway / 5.1：
Main Players: Ligand and Receptor / 5.1.1：
Modeling EGFR Signaling with EGF Stimulation / 5.1.2：
Modeling Metabolic Pathways / 5.2：
Chemical Equations and Pathway Representations / 5.2.1：
Michaelis-Menten Kinetics and Cell Illustrator Pathway Representation / 5.2.2：
Creating Glycolysis Pathway Model / 5.2.3：
Simulation of Glycolysis Pathway / 5.2.4：
Improving the Model / 5.2.5：
Modeling Gene Regulatory Networks / 5.3：
Biological Clocks and Circadian Rhythms / 5.3.1：
Gene Regulatory Network for Circadian Rhythms in Mice / 5.3.2：
Modeling Circadian Rhythms in Mice / 5.3.3：
Creating Hypothesis by Simulation / 5.3.4：
Computational Platform for Systems Biology / 5.4：
Gene Network of Yeast / 6.1：
Computational Analysis of Gene Network / 6.2：
Displaying Gene Network / 6.2.1：
Layout of Gene Networks / 6.2.2：
Pathway Search Function / 6.2.3：
Extracting Subnetworks / 6.2.4：
Comparing Two Subnetworks / 6.2.5：
Further Functionalities for Systems Biology / 6.3：
Languages for Pathways: CSML 3.0 and CSO / 6.3.1：
SaaS Technology / 6.3.2：
Pathway Parameter Search / 6.3.3：
Much Faster Simulation / 6.3.4：
Exporting Pathway Models to Programming Languages / 6.3.5：
Pathway Layout Algorithms / 6.3.6：
Pathway Database Management System / 6.3.7：
More Visually: Automatic Generation of Icons / 6.3.8：
Bibliographic Notes
Index
Foreword
Preface
Introduction / 1：
16.

電子ブック
ＥＢ
16. Cooperative Bug Isolation
Ben Liblit, David Hutchison, Takeo Kanade, Association for Computing Machinery.
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
The Next Step Forward / 1.3：
Cooperative Bug Isolation / 1.4：
Instrumentation Framework / 2：
Basic Instrumentation Strategy / 2.1：
Sampling the Bernoulli Way / 2.1.1：
From Blocks to Functions / 2.1.2：
Interprocedural Issues / 2.1.3：
Instrumentation Schemes for Distributed Debugging / 2.2：
Issues in Remote Sampling / 2.2.1：
Counter-Based Instrumentation Schemes / 2.2.2：
Additional Instrumentation Schemes / 2.2.3：
Performance and Optimizations / 2.3：
Static Branch Prediction / 2.3.1：
Weightless Functions / 2.3.2：
Empty and Singleton Regions / 2.3.3：
Local Countdown Caching / 2.3.4：
Random Countdown Generation / 2.3.5：
Path Balancing / 2.3.6：
Statically Selective Sampling / 2.3.7：
Optimization Recap / 2.3.8：
Adaptive Sampling / 2.4：
Nonuniformity Via Multiple Countdowns / 2.4.1：
Nonuniformity Via Non-Unit Site Weights / 2.4.2：
Policy Notes / 2.4.3：
Realistic Sampling Rates / 2.5：
Practical Considerations / 3：
Native Compiler Integration / 3.1：
Static Site Information / 3.1.1：
Libraries and Plugins / 3.2：
Threads / 3.3：
Next-Sample Countdown / 3.3.1：
Predicate Counters / 3.3.2：
Compilation Unit Registry and Report File / 3.3.3：
Time Stamp Clock / 3.3.4：
Performance Evaluation / 3.3.5：
Privacy and Security / 3.4：
User Interaction / 3.5：
Status of the Public Deployment / 3.6：
Resource Requirements / 3.6.1：
Reporting Trends / 3.6.2：
Techniques for Statistical Debugging / 4：
Notation and Terminology / 4.1：
Predicate Elimination / 4.2：
Instrumentation Strategy / 4.2.1：
Elimination Strategies / 4.2.2：
Data Collection and Analysis / 4.2.3：
Refinement over time / 4.2.4：
Performance Impact / 4.2.5：
Limitations and Insights / 4.2.6：
Regularized Logistic Regression / 4.3：
Crash Prediction Using Logistic Regression / 4.3.1：
Moss: A Multiple-Bug Challenge / 4.3.2：
Nonuniform Sampling / 4.4.1：
Analysis Results / 4.4.2：
Iterative Bug Isolation and Elimination / 4.5：
Increase Scores / 4.5.1：
Statistical Interpretation / 4.5.2：
Balancing Specificity and Sensitivity / 4.5.3：
Redundancy Elimination / 4.5.4：
Case Studies / 4.6：
Moss / 4.6.1：
CCRYPT / 4.6.2：
BC / 4.6.3：
EXIF / 4.6.4：
Rhythmbox / 4.6.5：
Related Work / 5：
Static Analysis / 5.1：
Profiling and Tracing / 5.2：
Dynamic Analysis / 5.3：
Conclusion / 6：
References
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
17.

電子ブック
ＥＢ
17. Cooperative Bug Isolation
Ben Liblit, David Hutchison, Takeo Kanade, Association for Computing Machinery.
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
The Next Step Forward / 1.3：
Cooperative Bug Isolation / 1.4：
Instrumentation Framework / 2：
Basic Instrumentation Strategy / 2.1：
Sampling the Bernoulli Way / 2.1.1：
From Blocks to Functions / 2.1.2：
Interprocedural Issues / 2.1.3：
Instrumentation Schemes for Distributed Debugging / 2.2：
Issues in Remote Sampling / 2.2.1：
Counter-Based Instrumentation Schemes / 2.2.2：
Additional Instrumentation Schemes / 2.2.3：
Performance and Optimizations / 2.3：
Static Branch Prediction / 2.3.1：
Weightless Functions / 2.3.2：
Empty and Singleton Regions / 2.3.3：
Local Countdown Caching / 2.3.4：
Random Countdown Generation / 2.3.5：
Path Balancing / 2.3.6：
Statically Selective Sampling / 2.3.7：
Optimization Recap / 2.3.8：
Adaptive Sampling / 2.4：
Nonuniformity Via Multiple Countdowns / 2.4.1：
Nonuniformity Via Non-Unit Site Weights / 2.4.2：
Policy Notes / 2.4.3：
Realistic Sampling Rates / 2.5：
Practical Considerations / 3：
Native Compiler Integration / 3.1：
Static Site Information / 3.1.1：
Libraries and Plugins / 3.2：
Threads / 3.3：
Next-Sample Countdown / 3.3.1：
Predicate Counters / 3.3.2：
Compilation Unit Registry and Report File / 3.3.3：
Time Stamp Clock / 3.3.4：
Performance Evaluation / 3.3.5：
Privacy and Security / 3.4：
User Interaction / 3.5：
Status of the Public Deployment / 3.6：
Resource Requirements / 3.6.1：
Reporting Trends / 3.6.2：
Techniques for Statistical Debugging / 4：
Notation and Terminology / 4.1：
Predicate Elimination / 4.2：
Instrumentation Strategy / 4.2.1：
Elimination Strategies / 4.2.2：
Data Collection and Analysis / 4.2.3：
Refinement over time / 4.2.4：
Performance Impact / 4.2.5：
Limitations and Insights / 4.2.6：
Regularized Logistic Regression / 4.3：
Crash Prediction Using Logistic Regression / 4.3.1：
Moss: A Multiple-Bug Challenge / 4.3.2：
Nonuniform Sampling / 4.4.1：
Analysis Results / 4.4.2：
Iterative Bug Isolation and Elimination / 4.5：
Increase Scores / 4.5.1：
Statistical Interpretation / 4.5.2：
Balancing Specificity and Sensitivity / 4.5.3：
Redundancy Elimination / 4.5.4：
Case Studies / 4.6：
Moss / 4.6.1：
CCRYPT / 4.6.2：
BC / 4.6.3：
EXIF / 4.6.4：
Rhythmbox / 4.6.5：
Related Work / 5：
Static Analysis / 5.1：
Profiling and Tracing / 5.2：
Dynamic Analysis / 5.3：
Conclusion / 6：
References
Introduction / 1：
Perfect, or Close Enough / 1.1：
Automatic Failure Reporting / 1.2：
18.

電子ブック
ＥＢ
18. Representation and Management of Narrative Information
Gian Piero Zarri
出版情報: Springer eBooks Computer Science , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Basic Principles / 1：
Narrative Information in an NKRL Context / 1.1：
Narratology and NKRL / 1.1.1：
The Notion of "Event" in an NKRL Context / 1.1.2：
Knowledge Representation and NKRL / 1.2：
"Standard" Ontologies and the "n-ary" Problem / 1.2.1：
A Plain "n-ary" Solution and Some Related Problems / 1.2.2：
In the Guise of Winding Up / 1.3：
The Knowledge Representation Strategy / 2：
Architecture of NKRL: the Four "Components" / 2.1：
The Data Structures of the Four Components / 2.2：
Definitional/Enumerative Data Structures / 2.2.1：
Descriptive/Factual Data Structures / 2.2.2：
Second-order Structures / 2.3：
The Completive Construction / 2.3.1：
Binding Occurrences / 2.3.2：
The Semantic and Ontological Contents / 2.4：
The Organization of the HClass Hierarchy / 3.1：
General Notions about Ontologies / 3.1.1：
HClass Architecture / 3.1.2：
The Organization of the HTemp Hierarchy / 3.2：
Recent Examples of "Structured" Ontological Systems / 3.2.1：
Main Features of Some Specific HTemp Structures / 3.2.2：
The Query and Inference Procedures / 3.3：
"Search Patterns" and Low-level Inferences / 4.1：
The Algorithmic Structure of Fum / 4.1.1：
Temporal Information and Indexing / 4.1.2：
High-level Inference Procedures / 4.2：
General Remarks about Some Reasoning Paradigms / 4.2.1：
Hypothesis Rules / 4.2.2：
Transformation Rules / 4.2.3：
Integrating the Two Main Inferencing Modes of NKRL / 4.2.4：
Inference Rules and Internet Filtering / 4.2.5：
Conclusion / 4.3：
Technological Enhancements / 5.1：
Theoretical Enhancements / 5.2：
Appendix A
Appendix B
References
Index
Basic Principles / 1：
Narrative Information in an NKRL Context / 1.1：
Narratology and NKRL / 1.1.1：
19.

電子ブック
ＥＢ
19. Representation and Management of Narrative Information
Gian Piero Zarri
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Basic Principles / 1：
Narrative Information in an NKRL Context / 1.1：
Narratology and NKRL / 1.1.1：
The Notion of "Event" in an NKRL Context / 1.1.2：
Knowledge Representation and NKRL / 1.2：
"Standard" Ontologies and the "n-ary" Problem / 1.2.1：
A Plain "n-ary" Solution and Some Related Problems / 1.2.2：
In the Guise of Winding Up / 1.3：
The Knowledge Representation Strategy / 2：
Architecture of NKRL: the Four "Components" / 2.1：
The Data Structures of the Four Components / 2.2：
Definitional/Enumerative Data Structures / 2.2.1：
Descriptive/Factual Data Structures / 2.2.2：
Second-order Structures / 2.3：
The Completive Construction / 2.3.1：
Binding Occurrences / 2.3.2：
The Semantic and Ontological Contents / 2.4：
The Organization of the HClass Hierarchy / 3.1：
General Notions about Ontologies / 3.1.1：
HClass Architecture / 3.1.2：
The Organization of the HTemp Hierarchy / 3.2：
Recent Examples of "Structured" Ontological Systems / 3.2.1：
Main Features of Some Specific HTemp Structures / 3.2.2：
The Query and Inference Procedures / 3.3：
"Search Patterns" and Low-level Inferences / 4.1：
The Algorithmic Structure of Fum / 4.1.1：
Temporal Information and Indexing / 4.1.2：
High-level Inference Procedures / 4.2：
General Remarks about Some Reasoning Paradigms / 4.2.1：
Hypothesis Rules / 4.2.2：
Transformation Rules / 4.2.3：
Integrating the Two Main Inferencing Modes of NKRL / 4.2.4：
Inference Rules and Internet Filtering / 4.2.5：
Conclusion / 4.3：
Technological Enhancements / 5.1：
Theoretical Enhancements / 5.2：
Appendix A
Appendix B
References
Index
Basic Principles / 1：
Narrative Information in an NKRL Context / 1.1：
Narratology and NKRL / 1.1.1：
20.

電子ブック
ＥＢ
20. Motivated Reinforcement Learning
Kathryn E. Merrick, Mary Lou Maher
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Non-Player Characters and Reinforcement Learning / Part I：
Non-Player Characters in Multiuser Games / 1：
Types of Multiuser Games / 1.1：
Massively Multiplayer Online Role-Playing Games / 1.1.1：
Multiuser Simulation Games / 1.1.2：
Open-Ended Virtual Worlds / 1.1.3：
Character Roles in Multiuser Games / 1.2：
Existing Artificial Intelligence Techniques for Non-Player Characters in Multiuser Games / 1.3：
Reflexive Agents / 1.3.1：
Learning Agents / 1.3.2：
Evolutionary Agents / 1.3.3：
Smart Terrain / 1.3.4：
Summary / 1.4：
References / 1.5：
Motivation in Natural and Artificial Agents / 2：
Defining Motivation / 2.1：
Biological Theories of Motivation / 2.2：
Drive Theory / 2.2.1：
Motivational State Theory / 2.2.2：
Arousal / 2.2.3：
Cognitive Theories of Motivation / 2.3：
Curiosity / 2.3.1：
Operant Theory / 2.3.2：
Incentive / 2.3.3：
Achievement Motivation / 2.3.4：
Attribution Theory / 2.3.5：
Intrinsic Motivation / 2.3.6：
Social Theories of Motivation / 2.4：
Conformity / 2.4.1：
Cultural Effect / 2.4.2：
Evolution / 2.4.3：
Combined Motivation Theories / 2.5：
Maslow's Hierarchy of Needs / 2.5.1：
Existence Relatedness Growth Theory / 2.5.2：
Towards Motivated Reinforcement Learning / 2.6：
Defining Reinforcement Learning / 3.1：
Dynamic Programming / 3.1.1：
Monte Carlo Methods / 3.1.2：
Temporal Difference Learning / 3.1.3：
Reinforcement Learning in Complex Environments / 3.2：
Partially Observable Environments / 3.2.1：
Function Approximation / 3.2.2：
Hierarchical Reinforcement Learning / 3.2.3：
Motivated Reinforcement Learning / 3.3：
Using a Motivation Signal in Addition to a Reward Signal / 3.3.1：
Using a Motivation Signal Instead of a Reward Signal / 3.3.2：
Comparing the Behaviour of Learning Agents / 3.4：
Player Satisfaction / 4.1：
Psychological Flow / 4.1.1：
Structural Flow / 4.1.2：
Formalising Non-Player Character Behaviour / 4.2：
Models of Optimality for Reinforcement Learning / 4.2.1：
Characteristics of Motivated Reinforcement Learning / 4.2.2：
Comparing Motivated Reinforcement Learning Agents / 4.3：
Statistical Model for Identifying Learned Tasks / 4.3.1：
Behavioural Variety / 4.3.2：
Behavioural Complexity / 4.3.3：
Developing Curious Characters Using Motivated Reinforcement Learning / 4.4：
Curiosity, Motivation and Attention Focus / 5：
Agents in Complex, Dynamic Environments / 5.1：
States / 5.1.1：
Actions / 5.1.2：
Reward and Motivation / 5.1.3：
Motivation and Attention Focus / 5.2：
Observations / 5.2.1：
Events / 5.2.2：
Tasks and Task Selection / 5.2.3：
Experience-Based Reward as Cognitive Motivation / 5.2.4：
Arbitration Functions / 5.2.5：
A General Experience-Based Motivation Function / 5.2.6：
Curiosity as Motivation for Support Characters / 5.3：
Curiosity as Interesting Events / 5.3.1：
Curiosity as Interesting and Competence / 5.3.2：
Motivated Reinforcement Learning Agents / 5.4：
A General Motivated Reinforcement Learning Model / 6.1：
Algorithms for Motivated Reinforcement Learning / 6.2：
Motivated Flat Reinforcement Learning / 6.2.1：
Motivated Multioption Reinforcement Learning / 6.2.2：
Motivated Hierarchical Reinforcement Learning / 6.2.3：
Curious Characters in Games / 6.3：
Curious Characters for Multiuser Games / 7：
Motivated Reinforcement Learning for Support Characters in Massively Multiplayer Online Role-Playing Games / 7.1：
Character Behaviour in Small-Scale, Isolated Games Locations / 7.2：
Case Studies of Individual Characters / 7.2.1：
General Trends in Character Behaviour / 7.2.2：
Curious Characters for Games in Complex, Dynamic Environments / 7.3：
Designing Characters That Can Multitask / 8.1：
Designing Characters for Complex Tasks / 8.1.1：
Games That Change While Characters Are Learning / 8.2.1：
Curious Characters for Games in Second Life / 8.3.1：
Motivated Reinforcement Learning in Open-Ended Simulation Games / 9.1：
Game Design / 9.1.1：
Character Design / 9.1.2：
Evaluating Character Behaviour in Response to Game Play Sequences / 9.2：
Discussion / 9.2.1：
Future / 9.3：
Towards the Future / 10：
Using Motivated Reinforcement Learning in Non-Player Characters / 10.1：
Other Gaming Applications for Motivated Reinforcement Learning / 10.2：
Dynamic Difficulty Adjustment / 10.2.1：
Procedural Content Generation / 10.2.2：
Beyond Curiosity / 10.3：
Biological Models of Motivation / 10.3.1：
Cognitive Models of Motivation / 10.3.2：
Social Models of Motivation / 10.3.3：
Combined Models of Motivation / 10.3.4：
New Models of Motivated Learning / 10.4：
Motivated Supervised Learning / 10.4.1：
Motivated Unsupervised Learning / 10.4.2：
Evaluating the Behaviour of Motivated Learning Agents / 10.5：
Concluding Remarks / 10.6：
Index / 10.7：
Non-Player Characters and Reinforcement Learning / Part I：
Non-Player Characters in Multiuser Games / 1：
Types of Multiuser Games / 1.1：
21.

電子ブック
ＥＢ
21. Motivated Reinforcement Learning
Kathryn E. Merrick, Mary Lou Maher
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Non-Player Characters and Reinforcement Learning / Part I：
Non-Player Characters in Multiuser Games / 1：
Types of Multiuser Games / 1.1：
Massively Multiplayer Online Role-Playing Games / 1.1.1：
Multiuser Simulation Games / 1.1.2：
Open-Ended Virtual Worlds / 1.1.3：
Character Roles in Multiuser Games / 1.2：
Existing Artificial Intelligence Techniques for Non-Player Characters in Multiuser Games / 1.3：
Reflexive Agents / 1.3.1：
Learning Agents / 1.3.2：
Evolutionary Agents / 1.3.3：
Smart Terrain / 1.3.4：
Summary / 1.4：
References / 1.5：
Motivation in Natural and Artificial Agents / 2：
Defining Motivation / 2.1：
Biological Theories of Motivation / 2.2：
Drive Theory / 2.2.1：
Motivational State Theory / 2.2.2：
Arousal / 2.2.3：
Cognitive Theories of Motivation / 2.3：
Curiosity / 2.3.1：
Operant Theory / 2.3.2：
Incentive / 2.3.3：
Achievement Motivation / 2.3.4：
Attribution Theory / 2.3.5：
Intrinsic Motivation / 2.3.6：
Social Theories of Motivation / 2.4：
Conformity / 2.4.1：
Cultural Effect / 2.4.2：
Evolution / 2.4.3：
Combined Motivation Theories / 2.5：
Maslow's Hierarchy of Needs / 2.5.1：
Existence Relatedness Growth Theory / 2.5.2：
Towards Motivated Reinforcement Learning / 2.6：
Defining Reinforcement Learning / 3.1：
Dynamic Programming / 3.1.1：
Monte Carlo Methods / 3.1.2：
Temporal Difference Learning / 3.1.3：
Reinforcement Learning in Complex Environments / 3.2：
Partially Observable Environments / 3.2.1：
Function Approximation / 3.2.2：
Hierarchical Reinforcement Learning / 3.2.3：
Motivated Reinforcement Learning / 3.3：
Using a Motivation Signal in Addition to a Reward Signal / 3.3.1：
Using a Motivation Signal Instead of a Reward Signal / 3.3.2：
Comparing the Behaviour of Learning Agents / 3.4：
Player Satisfaction / 4.1：
Psychological Flow / 4.1.1：
Structural Flow / 4.1.2：
Formalising Non-Player Character Behaviour / 4.2：
Models of Optimality for Reinforcement Learning / 4.2.1：
Characteristics of Motivated Reinforcement Learning / 4.2.2：
Comparing Motivated Reinforcement Learning Agents / 4.3：
Statistical Model for Identifying Learned Tasks / 4.3.1：
Behavioural Variety / 4.3.2：
Behavioural Complexity / 4.3.3：
Developing Curious Characters Using Motivated Reinforcement Learning / 4.4：
Curiosity, Motivation and Attention Focus / 5：
Agents in Complex, Dynamic Environments / 5.1：
States / 5.1.1：
Actions / 5.1.2：
Reward and Motivation / 5.1.3：
Motivation and Attention Focus / 5.2：
Observations / 5.2.1：
Events / 5.2.2：
Tasks and Task Selection / 5.2.3：
Experience-Based Reward as Cognitive Motivation / 5.2.4：
Arbitration Functions / 5.2.5：
A General Experience-Based Motivation Function / 5.2.6：
Curiosity as Motivation for Support Characters / 5.3：
Curiosity as Interesting Events / 5.3.1：
Curiosity as Interesting and Competence / 5.3.2：
Motivated Reinforcement Learning Agents / 5.4：
A General Motivated Reinforcement Learning Model / 6.1：
Algorithms for Motivated Reinforcement Learning / 6.2：
Motivated Flat Reinforcement Learning / 6.2.1：
Motivated Multioption Reinforcement Learning / 6.2.2：
Motivated Hierarchical Reinforcement Learning / 6.2.3：
Curious Characters in Games / 6.3：
Curious Characters for Multiuser Games / 7：
Motivated Reinforcement Learning for Support Characters in Massively Multiplayer Online Role-Playing Games / 7.1：
Character Behaviour in Small-Scale, Isolated Games Locations / 7.2：
Case Studies of Individual Characters / 7.2.1：
General Trends in Character Behaviour / 7.2.2：
Curious Characters for Games in Complex, Dynamic Environments / 7.3：
Designing Characters That Can Multitask / 8.1：
Designing Characters for Complex Tasks / 8.1.1：
Games That Change While Characters Are Learning / 8.2.1：
Curious Characters for Games in Second Life / 8.3.1：
Motivated Reinforcement Learning in Open-Ended Simulation Games / 9.1：
Game Design / 9.1.1：
Character Design / 9.1.2：
Evaluating Character Behaviour in Response to Game Play Sequences / 9.2：
Discussion / 9.2.1：
Future / 9.3：
Towards the Future / 10：
Using Motivated Reinforcement Learning in Non-Player Characters / 10.1：
Other Gaming Applications for Motivated Reinforcement Learning / 10.2：
Dynamic Difficulty Adjustment / 10.2.1：
Procedural Content Generation / 10.2.2：
Beyond Curiosity / 10.3：
Biological Models of Motivation / 10.3.1：
Cognitive Models of Motivation / 10.3.2：
Social Models of Motivation / 10.3.3：
Combined Models of Motivation / 10.3.4：
New Models of Motivated Learning / 10.4：
Motivated Supervised Learning / 10.4.1：
Motivated Unsupervised Learning / 10.4.2：
Evaluating the Behaviour of Motivated Learning Agents / 10.5：
Concluding Remarks / 10.6：
Index / 10.7：
Non-Player Characters and Reinforcement Learning / Part I：
Non-Player Characters in Multiuser Games / 1：
Types of Multiuser Games / 1.1：
22.

電子ブック
ＥＢ
22. Software Verification and Validation
Marcus S. Fisher
出版情報: Springer eBooks Computer Science , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Chapter 1：
Managing Verification and Validation / Chapter 2：
The Axioms of Leadership / Section 2.1：
Planning / Section 2.2：
Establishing the V&V Requirements / Section 2.2.1：
Establishing the V&V Plan / Section 2.2.2：
Managing the Plan / Section 2.3：
Effectiveness Measures / Section 2.3.2：
Control Gates / Section 2.3.3：
Risk Management / Section 2.4：
Identify / Section 2.4.1：
Analyze / Section 2.4.2：
Plan / Section 2.4.3：
Track / Section 2.4.4：
Control / Section 2.4.5：
Risk Management Plan / Section 2.4.6：
Communication Structures / Section 2.5：
References
The Verification and Validation Life Cycle / Chapter 3：
Traceability Analysis / Section 3.1：
Interface Analysis / Section 3.2：
Phase Dependent Analysis / Section 3.3：
Requirements Analysis / Section 3.3.1：
Design Analysis / Section 3.3.2：
Code Analysis / Section 3.3.3：
Test Analysis / Section 3.3.4：
V&V Testing / Section 3.4：
Systems V&V / Chapter 4：
Appendix A
Index
Introduction / Chapter 1：
Managing Verification and Validation / Chapter 2：
The Axioms of Leadership / Section 2.1：
23.

電子ブック
ＥＢ
23. Statistical Models of Shape
Rhodri H. Davies, Chris Taylor, Christopher J. Taylor, Carole Twining
出版情報: Springer eBooks Computer Science , Springer, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Example Applications of Statistical Models / 1.1：
Detecting Osteoporosis Using Dental Radiographs / 1.1.1：
Detecting Vertebral Fractures / 1.1.2：
Face Identification, Tracking, and Simulation of Ageing / 1.1.3：
Overview / 1.2：
Statistical Models of Shape and Appearance / 2：
Finite-Dimensional Representations of Shape / 2.1：
Shape Alignment / 2.1.1：
Statistics of Shapes / 2.1.2：
Principal Component Analysis / 2.1.3：
Modelling Distributions of Sets of Shapes / 2.2：
Gaussian Models / 2.2.1：
Kernel Density Estimation / 2.2.2：
Kernel Principal Component Analysis / 2.2.3：
Using Principal Components to Constrain Shape / 2.2.4：
Infinite-Dimensional Representations of Shape / 2.3：
Parameterised Representations of Shape / 2.3.1：
Applications of Shape Models / 2.4：
Active Shape Models / 2.4.1：
Active Appearance Models / 2.4.2：
Establishing Correspondence / 3：
The Correspondence Problem / 3.1：
Approaches to Establishing Correspondence / 3.2：
Manual Landmarking / 3.2.1：
Automatic Methods of Establishing Correspondence / 3.2.2：
Correspondence by Parameterisation / 3.2.2.1：
Distance-Based Correspondence / 3.2.2.2：
Feature-Based Correspondence / 3.2.2.3：
Correspondence Based on Physical Properties / 3.2.2.4：
Image-Based Correspondence / 3.2.2.5：
Summary / 3.2.3：
Correspondence by Optimisation / 3.3：
Objective Function / 3.3.1：
Manipulating Correspondence / 3.3.2：
Optimisation / 3.3.3：
Objective Functions / 4：
Shape-Based Objective Functions / 4.1：
Euclidian Distance and the Trace of the Model Covariance / 4.1.1：
Bending Energy / 4.1.2：
Curvature / 4.1.3：
Shape Context / 4.1.4：
Model-Based Objective Functions / 4.2：
The Determinant of the Model Covariance / 4.2.1：
Measuring Model Properties by Bootstrapping / 4.2.2：
Specificity / 4.2.2.1：
Generalization Ability / 4.2.2.2：
An Information Theoretic Objective Function / 4.3：
Shannon Codeword Length and Shannon Entropy / 4.3.1：
Description Length for a Multivariate Gaussian Model / 4.3.2：
Approximations to MDL / 4.3.3：
Gradient of Simplified MDL Objective Functions / 4.3.4：
Concluding Remarks / 4.4：
Re-parameterisation of Open and Closed Curves / 5：
Open Curves / 5.1：
Piecewise-Linear Re-parameterisation / 5.1.1：
Recursive Piecewise-Linear Re-parameterisation / 5.1.2：
Localized Re-parameterisation / 5.1.3：
Kernel-Based Representation of Re-parameterisation / 5.1.4：
Cauchy Kernels / 5.1.4.1：
Polynomial Re-parameterisation / 5.1.4.2：
Differentiable Re-parameterisations for Closed Curves / 5.2：
Wrapped Kernel Re-parameterisation for Closed Curves / 5.2.1：
Use in Optimisation / 5.3：
Parameterisation and Re-parameterisation of Surfaces / 6：
Surface Parameterisation / 6.1：
Initial Parameterisation for Open Surfaces / 6.1.1：
Initial Parameterisation for Closed Surfaces / 6.1.2：
Defining a Continuous Parameterisation / 6.1.3：
Removing Area Distortion / 6.1.4：
Consistent Parameterisation / 6.1.5：
Re-parameterisation of Surfaces / 6.2：
Re-parameterisation of Open Surfaces / 6.2.1：
Recursive Piecewise Linear Re-parameterisation / 6.2.1.1：
Re-parameterisation of Closed Surfaces / 6.2.1.2：
Recursive Piecewise-Linear Reparameterisation / 6.2.2.1：
Cauchy Kernel Re-parameterisation / 6.2.2.2：
Symmetric Theta Transformation / 6.2.2.4：
Asymmetric Theta Transformations / 6.2.2.5：
Shear Transformations / 6.2.2.6：
Re-parameterisation of Other Topologies / 6.2.3：
A Tractable Optimisation Approach / 6.3：
Optimising One Example at a Time / 7.1.1：
Stochastic Selection of Values for Auxiliary Parameters / 7.1.2：
Gradient Descent Optimisation / 7.1.3：
Optimising Pose / 7.1.4：
Tailoring Optimisation / 7.2：
Closed Curves and Surfaces / 7.2.1：
Open Surfaces / 7.2.2：
Multi-part Objects / 7.2.3：
Implementation Issues / 7.3：
Calculating the Covariance Matrix by Numerical Integration / 7.3.1：
Numerical Estimation of the Gradient / 7.3.2：
Sampling the Set of Shapes / 7.3.3：
Detecting Singularities in the Re-parameterisations / 7.3.4：
Example Optimisation Routines / 7.4：
Example 1: Open Curves / 7.4.1：
Example 2: Open Surfaces / 7.4.2：
Non-parametric Regularization / 8：
Regularization / 8.1：
Fluid Regularization / 8.1.1：
The Shape Manifold / 8.3：
The Induced Metric / 8.3.1：
Tangent Space / 8.3.2：
Covariant Derivatives / 8.3.3：
Shape Images / 8.4：
Iterative Updating of Shape Images / 8.5：
Dealing with Shapes with Spherical Topology / 8.5.2：
Avoiding Singularities by Re-gridding / 8.5.3：
Example Implementation of Non-parametric Regularization / 8.6：
Example Optimisation Routines Using Iterative Updating of Shape Images / 8.7：
Example 3: Open Surfaces Using Shape Images / 8.7.1：
Example 4: Optimisation of Closed Surfaces Using Shape Images / 8.7.2：
Evaluation of Statistical Models / 9：
Evaluation Using Ground Truth / 9.1：
Evaluation in the Absence of Ground Truth / 9.2：
Specificity and Generalization: Quantitative Measures / 9.2.1：
Specificity and Generalization as Graph-Based Estimators / 9.3：
Evaluating the Coefficients [beta subscript n, gamma] / 9.3.1：
Generalized Specificity / 9.3.2：
Specificity and Generalization in Practice / 9.4：
Discussion / 9.5：
Thin-Plate and Clamped-Plate Splines / Appendix A：
Curvature and Bending Energy / A.1：
Variational Formulation / A.2：
Green's Functions / A.3：
Green's Functions for the Thin-Plate Spline / A.3.1：
Green's Functions for the Clamped-Plate Spline / A.3.2：
Differentiating the Objective Function / Appendix B：
Finite-Dimensional Shape Representations / B.1：
The Pseudo-Inverse / B.1.1：
Varying the Shape / B.1.2：
From PCA to Singular Value Decomposition / B.1.3：
Infinite Dimensional Shape Representations / B.2：
Glossary
References
Index
Introduction / 1：
Example Applications of Statistical Models / 1.1：
Detecting Osteoporosis Using Dental Radiographs / 1.1.1：
24.

電子ブック
ＥＢ
24. Statistical Models of Shape
Rhodri H. Davies, Chris Taylor, Christopher J. Taylor, Carole Twining
出版情報: SpringerLink Books - AutoHoldings , Springer, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Example Applications of Statistical Models / 1.1：
Detecting Osteoporosis Using Dental Radiographs / 1.1.1：
Detecting Vertebral Fractures / 1.1.2：
Face Identification, Tracking, and Simulation of Ageing / 1.1.3：
Overview / 1.2：
Statistical Models of Shape and Appearance / 2：
Finite-Dimensional Representations of Shape / 2.1：
Shape Alignment / 2.1.1：
Statistics of Shapes / 2.1.2：
Principal Component Analysis / 2.1.3：
Modelling Distributions of Sets of Shapes / 2.2：
Gaussian Models / 2.2.1：
Kernel Density Estimation / 2.2.2：
Kernel Principal Component Analysis / 2.2.3：
Using Principal Components to Constrain Shape / 2.2.4：
Infinite-Dimensional Representations of Shape / 2.3：
Parameterised Representations of Shape / 2.3.1：
Applications of Shape Models / 2.4：
Active Shape Models / 2.4.1：
Active Appearance Models / 2.4.2：
Establishing Correspondence / 3：
The Correspondence Problem / 3.1：
Approaches to Establishing Correspondence / 3.2：
Manual Landmarking / 3.2.1：
Automatic Methods of Establishing Correspondence / 3.2.2：
Correspondence by Parameterisation / 3.2.2.1：
Distance-Based Correspondence / 3.2.2.2：
Feature-Based Correspondence / 3.2.2.3：
Correspondence Based on Physical Properties / 3.2.2.4：
Image-Based Correspondence / 3.2.2.5：
Summary / 3.2.3：
Correspondence by Optimisation / 3.3：
Objective Function / 3.3.1：
Manipulating Correspondence / 3.3.2：
Optimisation / 3.3.3：
Objective Functions / 4：
Shape-Based Objective Functions / 4.1：
Euclidian Distance and the Trace of the Model Covariance / 4.1.1：
Bending Energy / 4.1.2：
Curvature / 4.1.3：
Shape Context / 4.1.4：
Model-Based Objective Functions / 4.2：
The Determinant of the Model Covariance / 4.2.1：
Measuring Model Properties by Bootstrapping / 4.2.2：
Specificity / 4.2.2.1：
Generalization Ability / 4.2.2.2：
An Information Theoretic Objective Function / 4.3：
Shannon Codeword Length and Shannon Entropy / 4.3.1：
Description Length for a Multivariate Gaussian Model / 4.3.2：
Approximations to MDL / 4.3.3：
Gradient of Simplified MDL Objective Functions / 4.3.4：
Concluding Remarks / 4.4：
Re-parameterisation of Open and Closed Curves / 5：
Open Curves / 5.1：
Piecewise-Linear Re-parameterisation / 5.1.1：
Recursive Piecewise-Linear Re-parameterisation / 5.1.2：
Localized Re-parameterisation / 5.1.3：
Kernel-Based Representation of Re-parameterisation / 5.1.4：
Cauchy Kernels / 5.1.4.1：
Polynomial Re-parameterisation / 5.1.4.2：
Differentiable Re-parameterisations for Closed Curves / 5.2：
Wrapped Kernel Re-parameterisation for Closed Curves / 5.2.1：
Use in Optimisation / 5.3：
Parameterisation and Re-parameterisation of Surfaces / 6：
Surface Parameterisation / 6.1：
Initial Parameterisation for Open Surfaces / 6.1.1：
Initial Parameterisation for Closed Surfaces / 6.1.2：
Defining a Continuous Parameterisation / 6.1.3：
Removing Area Distortion / 6.1.4：
Consistent Parameterisation / 6.1.5：
Re-parameterisation of Surfaces / 6.2：
Re-parameterisation of Open Surfaces / 6.2.1：
Recursive Piecewise Linear Re-parameterisation / 6.2.1.1：
Re-parameterisation of Closed Surfaces / 6.2.1.2：
Recursive Piecewise-Linear Reparameterisation / 6.2.2.1：
Cauchy Kernel Re-parameterisation / 6.2.2.2：
Symmetric Theta Transformation / 6.2.2.4：
Asymmetric Theta Transformations / 6.2.2.5：
Shear Transformations / 6.2.2.6：
Re-parameterisation of Other Topologies / 6.2.3：
A Tractable Optimisation Approach / 6.3：
Optimising One Example at a Time / 7.1.1：
Stochastic Selection of Values for Auxiliary Parameters / 7.1.2：
Gradient Descent Optimisation / 7.1.3：
Optimising Pose / 7.1.4：
Tailoring Optimisation / 7.2：
Closed Curves and Surfaces / 7.2.1：
Open Surfaces / 7.2.2：
Multi-part Objects / 7.2.3：
Implementation Issues / 7.3：
Calculating the Covariance Matrix by Numerical Integration / 7.3.1：
Numerical Estimation of the Gradient / 7.3.2：
Sampling the Set of Shapes / 7.3.3：
Detecting Singularities in the Re-parameterisations / 7.3.4：
Example Optimisation Routines / 7.4：
Example 1: Open Curves / 7.4.1：
Example 2: Open Surfaces / 7.4.2：
Non-parametric Regularization / 8：
Regularization / 8.1：
Fluid Regularization / 8.1.1：
The Shape Manifold / 8.3：
The Induced Metric / 8.3.1：
Tangent Space / 8.3.2：
Covariant Derivatives / 8.3.3：
Shape Images / 8.4：
Iterative Updating of Shape Images / 8.5：
Dealing with Shapes with Spherical Topology / 8.5.2：
Avoiding Singularities by Re-gridding / 8.5.3：
Example Implementation of Non-parametric Regularization / 8.6：
Example Optimisation Routines Using Iterative Updating of Shape Images / 8.7：
Example 3: Open Surfaces Using Shape Images / 8.7.1：
Example 4: Optimisation of Closed Surfaces Using Shape Images / 8.7.2：
Evaluation of Statistical Models / 9：
Evaluation Using Ground Truth / 9.1：
Evaluation in the Absence of Ground Truth / 9.2：
Specificity and Generalization: Quantitative Measures / 9.2.1：
Specificity and Generalization as Graph-Based Estimators / 9.3：
Evaluating the Coefficients [beta subscript n, gamma] / 9.3.1：
Generalized Specificity / 9.3.2：
Specificity and Generalization in Practice / 9.4：
Discussion / 9.5：
Thin-Plate and Clamped-Plate Splines / Appendix A：
Curvature and Bending Energy / A.1：
Variational Formulation / A.2：
Green's Functions / A.3：
Green's Functions for the Thin-Plate Spline / A.3.1：
Green's Functions for the Clamped-Plate Spline / A.3.2：
Differentiating the Objective Function / Appendix B：
Finite-Dimensional Shape Representations / B.1：
The Pseudo-Inverse / B.1.1：
Varying the Shape / B.1.2：
From PCA to Singular Value Decomposition / B.1.3：
Infinite Dimensional Shape Representations / B.2：
Glossary
References
Index
Introduction / 1：
Example Applications of Statistical Models / 1.1：
Detecting Osteoporosis Using Dental Radiographs / 1.1.1：
25.

電子ブック
ＥＢ
25. Nonlinear Dimensionality Reduction
John Aldo Lee, M. Jordan, John A. Lee, Michel Verleysen
出版情報: Springer eBooks Computer Science , Springer New York, 2007
所蔵情報: loading…
目次情報: 続きを見る
Notations
Acronyms
High-Dimensional Data / 1：
Practical motivations / 1.1：
Fields of application / 1.1.1：
The goals to be reached / 1.1.2：
Theoretical motivations / 1.2：
How can we visualize high-dimensional spaces? / 1.2.1：
Curse of dimensionality and empty space phenomenon / 1.2.2：
Some directions to be explored / 1.3：
Relevance of the variables / 1.3.1：
Dependencies between the variables / 1.3.2：
About topology, spaces, and manifolds / 1.4：
Two benchmark manifolds / 1.5：
Overview of the next chapters / 1.6：
Characteristics of an Analysis Method / 2：
Purpose / 2.1：
Expected functionalities / 2.2：
Estimation of the number of latent variables / 2.2.1：
Embedding for dimensionality reduction / 2.2.2：
Embedding for latent variable separation / 2.2.3：
Internal characteristics / 2.3：
Underlying model / 2.3.1：
Algorithm / 2.3.2：
Criterion / 2.3.3：
Example: Principal component analysis / 2.4：
Data model of PCA / 2.4.1：
Criteria leading to PCA / 2.4.2：
Functionalities of PCA / 2.4.3：
Algorithms / 2.4.4：
Examples and limitations of PCA / 2.4.5：
Toward a categorization of DR methods / 2.5：
Hard vs. soft dimensionality reduction / 2.5.1：
Traditional vs. generative model / 2.5.2：
Linear vs. nonlinear model / 2.5.3：
Continuous vs. discrete model / 2.5.4：
Implicit vs. explicit mapping / 2.5.5：
Integrated vs. external estimation of the dimensionality / 2.5.6：
Layered vs. standalone embeddings / 2.5.7：
Single vs. multiple coordinate systems / 2.5.8：
Optional vs. mandatory vector quantization / 2.5.9：
Batch vs. online algorithm / 2.5.10：
Exact vs. approximate optimization / 2.5.11：
The type of criterion to be optimized / 2.5.12：
Estimation of the Intrinsic Dimension / 3：
Definition of the intrinsic dimension / 3.1：
Fractal dimensions / 3.2：
The q-dimension / 3.2.1：
Capacity dimension / 3.2.2：
Information dimension / 3.2.3：
Correlation dimension / 3.2.4：
Some inequalities / 3.2.5：
Practical estimation / 3.2.6：
Other dimension estimators / 3.3：
Local methods / 3.3.1：
Trial and error / 3.3.2：
Comparisons / 3.4：
Data Sets / 3.4.1：
PCA estimator / 3.4.2：
Local PCA estimator / 3.4.3：
Concluding remarks / 3.4.5：
Distance Preservation / 4：
State-of-the-art / 4.1：
Spatial distances / 4.2：
Metric space, distances, norms and scalar product / 4.2.1：
Multidimensional scaling / 4.2.2：
Sammon's nonlinear mapping / 4.2.3：
Curvilinear component analysis / 4.2.4：
Graph distances / 4.3：
Geodesic distance and graph distance / 4.3.1：
Isomap / 4.3.2：
Geodesic NLM / 4.3.3：
Curvilinear distance analysis / 4.3.4：
Other distances / 4.4：
Kernel PC A / 4.4.1：
Semidefinite embedding / 4.4.2：
Topology Preservation / 5：
State of the art / 5.1：
Predefined lattice / 5.2：
Self-Organizing Maps / 5.2.1：
Generative Topographic Mapping / 5.2.2：
Data-driven lattice / 5.3：
Locally linear embedding / 5.3.1：
Laplacian eigenmaps / 5.3.2：
Isotop / 5.3.3：
Method comparisons / 6：
Toy examples / 6.1：
The Swiss roll / 6.1.1：
Manifolds having essential loops or spheres / 6.1.2：
Cortex unfolding / 6.2：
Image processing / 6.3：
Artificial faces / 6.3.1：
Real faces / 6.3.2：
Conclusions / 7：
Summary of the book / 7.1：
The problem / 7.1.1：
A basic solution / 7.1.2：
Dimensionality reduction / 7.1.3：
Latent variable separation / 7.1.4：
Intrinsic dimensionality estimation / 7.1.5：
Data flow / 7.2：
Variable Selection / 7.2.1：
Calibration / 7.2.2：
Linear dimensionality reduction / 7.2.3：
Nonlinear dimensionality reduction / 7.2.4：
Further processing / 7.2.5：
Model complexity / 7.3：
Taxonomy / 7.4：
Distance preservation / 7.4.1：
Topology preservation / 7.4.2：
Spectral methods / 7.5：
Nonspectral methods / 7.6：
Tentative methodology / 7.7：
Perspectives / 7.8：
Matrix Calculus / A：
Singular value decomposition / A.1：
Eigenvalue decomposition / A.2：
Square root of a square matrix / A.3：
Gaussian Variables / B：
One-dimensional Gaussian distribution / B.1：
Multidimensional Gaussian distribution / B.2：
Uncorrelated Gaussian variables / B.2.1：
Isotropic multivariate Gaussian distribution / B.2.2：
Linearly mixed Gaussian variables / B.2.3：
Optimization / C：
Newton's method / C.1：
Finding extrema / C.1.1：
Multivariate version / C.1.2：
Gradient ascent/descent / C.2：
Stochastic gradient descent / C.2.1：
Vector quantization / D：
Classical techniques / D.1：
Competitive learning / D.2：
Initialization and ""dead units"" / D.3：
Graph Building / E：
Without vector quantization / E.1：
K-rule / E.1.1：
e-rule / E.1.2：
r-rule / E.1.3：
With vector quantization / E.2：
Data rule / E.2.1：
Histogram rule / E.2.2：
Implementation Issues / F：
Dimension estimation / F.1：
Computation of the closest point(s) / F.1.1：
References / F.3：
Index
Notations
Acronyms
High-Dimensional Data / 1：
26.

電子ブック
ＥＢ
26. Nonlinear Dimensionality Reduction
John Aldo Lee, M. Jordan, John A. Lee, Michel Verleysen, B. Schölkopf
出版情報: SpringerLink Books - AutoHoldings , Springer New York, 2007
所蔵情報: loading…
目次情報: 続きを見る
Notations
Acronyms
High-Dimensional Data / 1：
Practical motivations / 1.1：
Fields of application / 1.1.1：
The goals to be reached / 1.1.2：
Theoretical motivations / 1.2：
How can we visualize high-dimensional spaces? / 1.2.1：
Curse of dimensionality and empty space phenomenon / 1.2.2：
Some directions to be explored / 1.3：
Relevance of the variables / 1.3.1：
Dependencies between the variables / 1.3.2：
About topology, spaces, and manifolds / 1.4：
Two benchmark manifolds / 1.5：
Overview of the next chapters / 1.6：
Characteristics of an Analysis Method / 2：
Purpose / 2.1：
Expected functionalities / 2.2：
Estimation of the number of latent variables / 2.2.1：
Embedding for dimensionality reduction / 2.2.2：
Embedding for latent variable separation / 2.2.3：
Internal characteristics / 2.3：
Underlying model / 2.3.1：
Algorithm / 2.3.2：
Criterion / 2.3.3：
Example: Principal component analysis / 2.4：
Data model of PCA / 2.4.1：
Criteria leading to PCA / 2.4.2：
Functionalities of PCA / 2.4.3：
Algorithms / 2.4.4：
Examples and limitations of PCA / 2.4.5：
Toward a categorization of DR methods / 2.5：
Hard vs. soft dimensionality reduction / 2.5.1：
Traditional vs. generative model / 2.5.2：
Linear vs. nonlinear model / 2.5.3：
Continuous vs. discrete model / 2.5.4：
Implicit vs. explicit mapping / 2.5.5：
Integrated vs. external estimation of the dimensionality / 2.5.6：
Layered vs. standalone embeddings / 2.5.7：
Single vs. multiple coordinate systems / 2.5.8：
Optional vs. mandatory vector quantization / 2.5.9：
Batch vs. online algorithm / 2.5.10：
Exact vs. approximate optimization / 2.5.11：
The type of criterion to be optimized / 2.5.12：
Estimation of the Intrinsic Dimension / 3：
Definition of the intrinsic dimension / 3.1：
Fractal dimensions / 3.2：
The q-dimension / 3.2.1：
Capacity dimension / 3.2.2：
Information dimension / 3.2.3：
Correlation dimension / 3.2.4：
Some inequalities / 3.2.5：
Practical estimation / 3.2.6：
Other dimension estimators / 3.3：
Local methods / 3.3.1：
Trial and error / 3.3.2：
Comparisons / 3.4：
Data Sets / 3.4.1：
PCA estimator / 3.4.2：
Local PCA estimator / 3.4.3：
Concluding remarks / 3.4.5：
Distance Preservation / 4：
State-of-the-art / 4.1：
Spatial distances / 4.2：
Metric space, distances, norms and scalar product / 4.2.1：
Multidimensional scaling / 4.2.2：
Sammon's nonlinear mapping / 4.2.3：
Curvilinear component analysis / 4.2.4：
Graph distances / 4.3：
Geodesic distance and graph distance / 4.3.1：
Isomap / 4.3.2：
Geodesic NLM / 4.3.3：
Curvilinear distance analysis / 4.3.4：
Other distances / 4.4：
Kernel PC A / 4.4.1：
Semidefinite embedding / 4.4.2：
Topology Preservation / 5：
State of the art / 5.1：
Predefined lattice / 5.2：
Self-Organizing Maps / 5.2.1：
Generative Topographic Mapping / 5.2.2：
Data-driven lattice / 5.3：
Locally linear embedding / 5.3.1：
Laplacian eigenmaps / 5.3.2：
Isotop / 5.3.3：
Method comparisons / 6：
Toy examples / 6.1：
The Swiss roll / 6.1.1：
Manifolds having essential loops or spheres / 6.1.2：
Cortex unfolding / 6.2：
Image processing / 6.3：
Artificial faces / 6.3.1：
Real faces / 6.3.2：
Conclusions / 7：
Summary of the book / 7.1：
The problem / 7.1.1：
A basic solution / 7.1.2：
Dimensionality reduction / 7.1.3：
Latent variable separation / 7.1.4：
Intrinsic dimensionality estimation / 7.1.5：
Data flow / 7.2：
Variable Selection / 7.2.1：
Calibration / 7.2.2：
Linear dimensionality reduction / 7.2.3：
Nonlinear dimensionality reduction / 7.2.4：
Further processing / 7.2.5：
Model complexity / 7.3：
Taxonomy / 7.4：
Distance preservation / 7.4.1：
Topology preservation / 7.4.2：
Spectral methods / 7.5：
Nonspectral methods / 7.6：
Tentative methodology / 7.7：
Perspectives / 7.8：
Matrix Calculus / A：
Singular value decomposition / A.1：
Eigenvalue decomposition / A.2：
Square root of a square matrix / A.3：
Gaussian Variables / B：
One-dimensional Gaussian distribution / B.1：
Multidimensional Gaussian distribution / B.2：
Uncorrelated Gaussian variables / B.2.1：
Isotropic multivariate Gaussian distribution / B.2.2：
Linearly mixed Gaussian variables / B.2.3：
Optimization / C：
Newton's method / C.1：
Finding extrema / C.1.1：
Multivariate version / C.1.2：
Gradient ascent/descent / C.2：
Stochastic gradient descent / C.2.1：
Vector quantization / D：
Classical techniques / D.1：
Competitive learning / D.2：
Initialization and ""dead units"" / D.3：
Graph Building / E：
Without vector quantization / E.1：
K-rule / E.1.1：
e-rule / E.1.2：
r-rule / E.1.3：
With vector quantization / E.2：
Data rule / E.2.1：
Histogram rule / E.2.2：
Implementation Issues / F：
Dimension estimation / F.1：
Computation of the closest point(s) / F.1.1：
References / F.3：
Index
Notations
Acronyms
High-Dimensional Data / 1：
27.

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

電子ブック
ＥＢ
28. Vulnerability Analysis and Defense for the Internet
Sushil Jajodia, Hirosh Joseph, Abhishek Singh, Baibhav Singh
出版情報: Springer eBooks Computer Science , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
Wireless Security / 1.0：
Introduction / 1.1：
Wired Equivalent Privacy protocol / 1.2：
Analysis of WEP flaws / 1.2.1：
Key Stream Reuse / 1.2.2：
Message Modification / 1.2.3：
Message Injection / 1.2.4：
Authentication Spoofing / 1.2.5：
IP Redirection / 1.2.6：
Wireless Frame Generation / 1.2.7：
AirJack / 1.2.7.1：
Wavesec / 1.2.7.2：
Libwlan / 1.2.7.3：
FakeAP / 1.2.7.4：
Wnet / 1.2.7.5：
Scapy / 1.2.7.7：
Encryption Cracking Tools / 1.2.8：
Wepcrack / 1.2.8.1：
Dweputils / 1.2.8.2：
Wep tools / 1.2.8.3：
Wep Attack / 1.2.8.4：
Retrieving the WEP keys from Client Host / 1.2.9：
Traffic Inection Tools / 1.2.10：
802.1x Cracking Tools / 1.2.11：
Asleap-imp and Leap / 1.2.11.1：
Wireless DoS Attacks / 1.2.12：
Physical Layer Attack or Jamming / 1.2.12.1：
Signal Strength / 1.2.12.1.1：
Carrier Sensing Time / 1.2.12.1.2：
Packet Delivery Ratio / 1.2.12.1.3：
Signal Strength Consistency check / 1.2.12.1.4：
Spoofed Dessociation and Deauthentication Frames / 1.2.12.2：
Spoofed Malformed Authentication Frames / 1.2.12.3：
Flooding the Access Point Association and Authentication Buffer / 1.2.12.4：
Frame Deletion Attack / 1.2.12.5：
DoS attack dependent upon specific Wireless Setting / 1.2.12.6：
Attack against the 802.11i implementations / 1.2.13：
Authentication Mechanism Attacks / 1.2.13.1：
Prevention and Modifications / 1.3：
TKIP: temporal Key Integrity Protocol / 1.3.1：
TKIP Implementation / 1.3.1.1：
Message Integrity / 1.3.1.1.1：
Initialization Vector / 1.3.1.1.2：
Prevention against the FMS Attack / 1.3.1.1.3：
Per Packet key Mixing / 1.3.1.1.4：
Implementation Details of TKIP / 1.3.1.1.5：
Details of Per Packet Key mixing / 1.3.1.1.6：
Attack on TKIP / 1.3.1.2：
AES - CCMP / 1.3.2：
CCMP Header / 1.3.2.1：
Implementation / 1.3.2.2：
Encryption Process in MPDU / 1.3.2.2.1：
Decrypting MPDU / 1.3.2.2.2：
Prevention Method using Detection Devices / 1.4：
Conclusion / 1.5：
Vulnerability Analysis for Mail Protocols / 2.0：
Format String Specifiers / 2.1：
Format String Vulnerability / 2.2.1：
Format String Denial of Service Attack / 2.2.1.1：
Format String Vulnerability Reading Attack / 2.2.1.2：
Format String Vulnerability Writing Attack / 2.2.1.3：
Preventive Measures for Format String vulnerability / 2.2.1.4：
Buffer Overflow Attack / 2.3：
Buffer Overflow Prevention / 2.3.1：
Directory Traversal Attacks / 2.4：
Remote Detection / 2.4.1：
False Positive in Remote Detection for Mail Traffic / 2.5：
False Positive in case of SMTP Traffic / 2.5.1：
False Positive in case of IMAP Traffic / 2.5.2：
Vulnerability Analysis for FTP and TFTP / 2.6：
Buffer Overflow in FTP / 3.1：
Directory Traversal Attack in FTP / 3.1.2：
TFTP Vulnerability Analysis / 3.2：
Vulnerability Analysis / 3.2.1：
Vulnerability Analysis for HTTP / 3.3：
XSS Attack / 4.1：
Prevention against Cross Site Scripting Attacks / 4.2.1：
Vulnerability Protection / 4.2.1.1：
SQL Injection Attacks / 4.3：
SQL Injection Case Study / 4.3.1：
Preventive Measures / 4.3.2：
SQL injection in Oracle Data base / 4.3.2.1：
Stored Procedures / 4.3.2.2.1：
Remote Detection for Oracle Database / 4.3.2.2.2：
Other Preventive Measures / 4.3.3：
Preventive Measures by developers / 4.3.3.1：
MS DoS Device Name Vulnerability / 4.4：
Prevention from DoS Device Name Vulnerability / 4.4.1：
False Positive in HTTP / 4.5：
Evasion of HTTP Signatures / 4.6：
Vulnerability Analysis for DNS and DHCP / 4.7：
Introduction of DNS Protocol / 5.1：
Vulnerabilities in a DNS Protocol / 5.1.1：
DNS Cache Poisoning / 5.1.1.1：
Redirection Attack / 5.1.1.2：
Buffer Overflow Vulnerability / 5.1.1.3：
DNS Man in the Middle Attack or DNS Hijacking / 5.1.1.4：
DNS Amplification Attack / 5.1.1.5：
False Positives in a DNS Protocol / 5.1.2：
Introduction of DHCP / 5.2：
Vulnerabilities in DHCP / 5.2.1：
Client Masquerading / 5.2.1.1：
Flooding / 5.2.1.2：
Client Misconfiguration / 5.2.1.3：
Theft of Service / 5.2.1.4：
Packet Altercation / 5.2.1.5：
Key Exposure / 5.2.1.6：
Key Distribution / 5.2.1.7：
Protocol Agreement Issues / 5.2.1.8：
False Positive in DHCP / 5.2.2：
Vulnerability Analysis for LDAP and SNMP / 5.3：
ASN and BER Encoding / 6.1：
BER implementation for LDAP / 6.3：
Threat Analysis for Directory Services / 6.3.1：
SNMP / 6.4：
Vulnerability Analysis for SNMP / 6.4.1：
Vulnerability Analysis for RPC / 6.5：
RPC Message Protocol / 7.1：
NDR Format / 7.3：
Port Mapper / 7.4：
False Positive for SMB RPC Protocol / 7.5：
Evasion in RPC / 7.6：
Multiple Binding UUID / 7.6.1：
Fragment Data across many Requests / 7.6.2：
Bind to one UUID then alter Context / 7.6.3：
Prepend an ObjectID / 7.6.4：
Bind with an authentication field / 7.6.5：
One packet UDP function call / 7.6.6：
Endianess Selection / 7.6.7：
Chaining SMB commands / 7.6.8：
Out of order chaining / 7.6.9：
Chaining with random data in between commands / 7.6.10：
Unicode and non-Unicode evasion / 7.6.11：
SMB CreateAndX Path Names / 7.6.12：
Malware / 7.7：
Malware Naming Convention / 8.1：
Worms / 8.2.1：
Trojans / 8.2.2：
Spyware & Adware / 8.2.3：
Malware Threat Analysis / 8.3：
Creating controlled Environment / 8.3.1：
Confinement with the Hard Virtual Machines / 8.3.1.1：
Confinement with the Soft Virtual Machines / 8.3.1.2：
Confinement with Jails and Chroot / 8.3.1.3：
Confinement with System call Sensors / 8.3.1.4：
Confinement with System call Spoofing / 8.3.1.5：
Behavioral Analysis / 8.3.2：
Code Analysis / 8.3.3：
Root Kits / 8.4：
User and Kernel Mode Communication / 8.4.1：
I/O Request Packets (IRP) / 8.4.2：
Interrupt Descriptor Table / 8.4.3：
Service Descriptor Table / 8.4.4：
Direct Kernel Object Manipulation / 8.4.5：
Detection of Rootkits / 8.4.6：
Spyware / 8.5：
Methods of Spyware installation and propagation / 8.5.1：
Drive- By- Downloads / 8.5.1.1：
Bundling / 8.5.1.2：
From Other Spyware / 8.5.1.3：
Security Holes / 8.5.1.4：
Iframe Exploit / 8.5.2：
IE .chm File processing Vulnerability / 8.5.2.2：
Internet Code Download Link / 8.5.2.3：
Anti Spyware Signature Development / 8.5.3：
Vulnerability Signature / 8.5.3.1：
CLSID Data base / 8.5.3.2：
Spyware Specific Signature / 8.5.3.3：
Information Stealing / 8.5.3.4：
Preventing Information from being sent as emails / 8.5.3.5：
Reverse Engineering / 8.6：
Anti Reversing Technique / 9.1：
Anti Disassembly / 9.2.1：
Linear Sweep Disassembler / 9.2.1.1：
Recursive Traversal Disassembler / 9.2.1.2：
Evasion Technique for Disasembler / 9.2.1.3：
Self-Modifying Code / 9.2.2：
Virtual Machine Obfuscation / 9.2.3：
Anti Debugging Technique / 9.3：
Break Points / 9.3.1：
Software break point / 9.3.1.1：
Hardware break point / 9.3.1.2：
Detection of Breakpoint / 9.3.1.3：
Virtual Machine Detection / 9.4：
Checking finger print / 9.4.1：
Checking system tables / 9.4.2：
Checking processor instruction set / 9.4.3：
Unpacking / 9.5：
Manual unpacking of malware / 9.5.1：
Finding an original entry point of an executable / 9.5.1.1：
Taking memory Dump / 9.5.1.2：
Import Table Reconstruction / 9.5.1.3：
Import redirection and code emulation / 9.5.1.4：
Index / 9.6：
Wireless Security / 1.0：
Introduction / 1.1：
Wired Equivalent Privacy protocol / 1.2：
29.

電子ブック
ＥＢ
29. Vulnerability Analysis and Defense for the Internet
Sushil Jajodia, Hirosh Joseph, Abhishek Singh, Baibhav Singh, H. Joseph, B. Singh
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
Wireless Security / 1.0：
Introduction / 1.1：
Wired Equivalent Privacy protocol / 1.2：
Analysis of WEP flaws / 1.2.1：
Key Stream Reuse / 1.2.2：
Message Modification / 1.2.3：
Message Injection / 1.2.4：
Authentication Spoofing / 1.2.5：
IP Redirection / 1.2.6：
Wireless Frame Generation / 1.2.7：
AirJack / 1.2.7.1：
Wavesec / 1.2.7.2：
Libwlan / 1.2.7.3：
FakeAP / 1.2.7.4：
Wnet / 1.2.7.5：
Scapy / 1.2.7.7：
Encryption Cracking Tools / 1.2.8：
Wepcrack / 1.2.8.1：
Dweputils / 1.2.8.2：
Wep tools / 1.2.8.3：
Wep Attack / 1.2.8.4：
Retrieving the WEP keys from Client Host / 1.2.9：
Traffic Inection Tools / 1.2.10：
802.1x Cracking Tools / 1.2.11：
Asleap-imp and Leap / 1.2.11.1：
Wireless DoS Attacks / 1.2.12：
Physical Layer Attack or Jamming / 1.2.12.1：
Signal Strength / 1.2.12.1.1：
Carrier Sensing Time / 1.2.12.1.2：
Packet Delivery Ratio / 1.2.12.1.3：
Signal Strength Consistency check / 1.2.12.1.4：
Spoofed Dessociation and Deauthentication Frames / 1.2.12.2：
Spoofed Malformed Authentication Frames / 1.2.12.3：
Flooding the Access Point Association and Authentication Buffer / 1.2.12.4：
Frame Deletion Attack / 1.2.12.5：
DoS attack dependent upon specific Wireless Setting / 1.2.12.6：
Attack against the 802.11i implementations / 1.2.13：
Authentication Mechanism Attacks / 1.2.13.1：
Prevention and Modifications / 1.3：
TKIP: temporal Key Integrity Protocol / 1.3.1：
TKIP Implementation / 1.3.1.1：
Message Integrity / 1.3.1.1.1：
Initialization Vector / 1.3.1.1.2：
Prevention against the FMS Attack / 1.3.1.1.3：
Per Packet key Mixing / 1.3.1.1.4：
Implementation Details of TKIP / 1.3.1.1.5：
Details of Per Packet Key mixing / 1.3.1.1.6：
Attack on TKIP / 1.3.1.2：
AES - CCMP / 1.3.2：
CCMP Header / 1.3.2.1：
Implementation / 1.3.2.2：
Encryption Process in MPDU / 1.3.2.2.1：
Decrypting MPDU / 1.3.2.2.2：
Prevention Method using Detection Devices / 1.4：
Conclusion / 1.5：
Vulnerability Analysis for Mail Protocols / 2.0：
Format String Specifiers / 2.1：
Format String Vulnerability / 2.2.1：
Format String Denial of Service Attack / 2.2.1.1：
Format String Vulnerability Reading Attack / 2.2.1.2：
Format String Vulnerability Writing Attack / 2.2.1.3：
Preventive Measures for Format String vulnerability / 2.2.1.4：
Buffer Overflow Attack / 2.3：
Buffer Overflow Prevention / 2.3.1：
Directory Traversal Attacks / 2.4：
Remote Detection / 2.4.1：
False Positive in Remote Detection for Mail Traffic / 2.5：
False Positive in case of SMTP Traffic / 2.5.1：
False Positive in case of IMAP Traffic / 2.5.2：
Vulnerability Analysis for FTP and TFTP / 2.6：
Buffer Overflow in FTP / 3.1：
Directory Traversal Attack in FTP / 3.1.2：
TFTP Vulnerability Analysis / 3.2：
Vulnerability Analysis / 3.2.1：
Vulnerability Analysis for HTTP / 3.3：
XSS Attack / 4.1：
Prevention against Cross Site Scripting Attacks / 4.2.1：
Vulnerability Protection / 4.2.1.1：
SQL Injection Attacks / 4.3：
SQL Injection Case Study / 4.3.1：
Preventive Measures / 4.3.2：
SQL injection in Oracle Data base / 4.3.2.1：
Stored Procedures / 4.3.2.2.1：
Remote Detection for Oracle Database / 4.3.2.2.2：
Other Preventive Measures / 4.3.3：
Preventive Measures by developers / 4.3.3.1：
MS DoS Device Name Vulnerability / 4.4：
Prevention from DoS Device Name Vulnerability / 4.4.1：
False Positive in HTTP / 4.5：
Evasion of HTTP Signatures / 4.6：
Vulnerability Analysis for DNS and DHCP / 4.7：
Introduction of DNS Protocol / 5.1：
Vulnerabilities in a DNS Protocol / 5.1.1：
DNS Cache Poisoning / 5.1.1.1：
Redirection Attack / 5.1.1.2：
Buffer Overflow Vulnerability / 5.1.1.3：
DNS Man in the Middle Attack or DNS Hijacking / 5.1.1.4：
DNS Amplification Attack / 5.1.1.5：
False Positives in a DNS Protocol / 5.1.2：
Introduction of DHCP / 5.2：
Vulnerabilities in DHCP / 5.2.1：
Client Masquerading / 5.2.1.1：
Flooding / 5.2.1.2：
Client Misconfiguration / 5.2.1.3：
Theft of Service / 5.2.1.4：
Packet Altercation / 5.2.1.5：
Key Exposure / 5.2.1.6：
Key Distribution / 5.2.1.7：
Protocol Agreement Issues / 5.2.1.8：
False Positive in DHCP / 5.2.2：
Vulnerability Analysis for LDAP and SNMP / 5.3：
ASN and BER Encoding / 6.1：
BER implementation for LDAP / 6.3：
Threat Analysis for Directory Services / 6.3.1：
SNMP / 6.4：
Vulnerability Analysis for SNMP / 6.4.1：
Vulnerability Analysis for RPC / 6.5：
RPC Message Protocol / 7.1：
NDR Format / 7.3：
Port Mapper / 7.4：
False Positive for SMB RPC Protocol / 7.5：
Evasion in RPC / 7.6：
Multiple Binding UUID / 7.6.1：
Fragment Data across many Requests / 7.6.2：
Bind to one UUID then alter Context / 7.6.3：
Prepend an ObjectID / 7.6.4：
Bind with an authentication field / 7.6.5：
One packet UDP function call / 7.6.6：
Endianess Selection / 7.6.7：
Chaining SMB commands / 7.6.8：
Out of order chaining / 7.6.9：
Chaining with random data in between commands / 7.6.10：
Unicode and non-Unicode evasion / 7.6.11：
SMB CreateAndX Path Names / 7.6.12：
Malware / 7.7：
Malware Naming Convention / 8.1：
Worms / 8.2.1：
Trojans / 8.2.2：
Spyware & Adware / 8.2.3：
Malware Threat Analysis / 8.3：
Creating controlled Environment / 8.3.1：
Confinement with the Hard Virtual Machines / 8.3.1.1：
Confinement with the Soft Virtual Machines / 8.3.1.2：
Confinement with Jails and Chroot / 8.3.1.3：
Confinement with System call Sensors / 8.3.1.4：
Confinement with System call Spoofing / 8.3.1.5：
Behavioral Analysis / 8.3.2：
Code Analysis / 8.3.3：
Root Kits / 8.4：
User and Kernel Mode Communication / 8.4.1：
I/O Request Packets (IRP) / 8.4.2：
Interrupt Descriptor Table / 8.4.3：
Service Descriptor Table / 8.4.4：
Direct Kernel Object Manipulation / 8.4.5：
Detection of Rootkits / 8.4.6：
Spyware / 8.5：
Methods of Spyware installation and propagation / 8.5.1：
Drive- By- Downloads / 8.5.1.1：
Bundling / 8.5.1.2：
From Other Spyware / 8.5.1.3：
Security Holes / 8.5.1.4：
Iframe Exploit / 8.5.2：
IE .chm File processing Vulnerability / 8.5.2.2：
Internet Code Download Link / 8.5.2.3：
Anti Spyware Signature Development / 8.5.3：
Vulnerability Signature / 8.5.3.1：
CLSID Data base / 8.5.3.2：
Spyware Specific Signature / 8.5.3.3：
Information Stealing / 8.5.3.4：
Preventing Information from being sent as emails / 8.5.3.5：
Reverse Engineering / 8.6：
Anti Reversing Technique / 9.1：
Anti Disassembly / 9.2.1：
Linear Sweep Disassembler / 9.2.1.1：
Recursive Traversal Disassembler / 9.2.1.2：
Evasion Technique for Disasembler / 9.2.1.3：
Self-Modifying Code / 9.2.2：
Virtual Machine Obfuscation / 9.2.3：
Anti Debugging Technique / 9.3：
Break Points / 9.3.1：
Software break point / 9.3.1.1：
Hardware break point / 9.3.1.2：
Detection of Breakpoint / 9.3.1.3：
Virtual Machine Detection / 9.4：
Checking finger print / 9.4.1：
Checking system tables / 9.4.2：
Checking processor instruction set / 9.4.3：
Unpacking / 9.5：
Manual unpacking of malware / 9.5.1：
Finding an original entry point of an executable / 9.5.1.1：
Taking memory Dump / 9.5.1.2：
Import Table Reconstruction / 9.5.1.3：
Import redirection and code emulation / 9.5.1.4：
Index / 9.6：
Wireless Security / 1.0：
Introduction / 1.1：
Wired Equivalent Privacy protocol / 1.2：
30.

電子ブック
ＥＢ
30. DNA Computing Models
Zoya Ignatova, Israel Mart?nez-P?rez
出版情報: Springer eBooks Computer Science , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
References
Theoretical Computer Science / 2：
Graphs / 2.1：
Basic Notions / 2.1.1：
Paths and Cycles / 2.1.2：
Closures and Paths / 2.1.3：
Trees / 2.1.4：
Bipartite Graphs / 2.1.5：
Finite State Automata / 2.2：
Strings and Languages / 2.2.1：
Deterministic Finite State Automata / 2.2.2：
Non-Deterministic Finite State Automata / 2.2.3：
Regular Expressions / 2.2.4：
Stochastic Finite State Automata / 2.2.5：
Computability / 2.3：
Turing Machines / 2.3.1：
Universal Turing Machines / 2.3.2：
Church's Thesis / 2.3.3：
Register Machines / 2.3.4：
Cellular Automata / 2.3.5：
Formal Grammars / 2.4：
Grammars and Languages / 2.4.1：
Chomsky's Hierarchy / 2.4.2：
Grammars and Machines / 2.4.3：
Undecidability / 2.4.4：
Combinatorial Logic / 2.5：
Boolean Circuits / 2.5.1：
Compound Circuits / 2.5.2：
Minterms and Maxterms / 2.5.3：
Canonical Circuits / 2.5.4：
Adder Circuits / 2.5.5：
Computational Complexity / 2.6：
Time Complexity / 2.6.1：
Infinite Asymptotics / 2.6.2：
Decision Problems / 2.6.3：
Optimization Problems / 2.6.4：
Molecular Biology / 3：
DNA / 3.1：
Molecular Structure / 3.1.1：
Manipulation of DNA / 3.1.2：
Physical Chemistry / 3.2：
Thermodynamics / 3.2.1：
Chemical Kinetics / 3.2.2：
DNA Annealing Kinetics / 3.2.3：
Strand Displacement Kinetics / 3.2.4：
Stochastic Chemical Kinetics / 3.2.5：
Genes / 3.3：
Structure and Biosynthesis / 3.3.1：
DNA Recombination / 3.3.2：
Genomes / 3.3.3：
Gene Expression / 3.4：
Protein Biosynthesis / 3.4.1：
Proteins - Molecular Structure / 3.4.2：
Enzymes / 3.4.3：
Cells and Organisms / 3.5：
Eukaryotes and Prokaryotes / 3.5.1：
Viruses / 3.6：
General Structure and Classification / 3.6.1：
Applications / 3.6.2：
Word Design for DNA Computing / 4：
Constraints / 4.1：
Free Energy and Melting Temperature / 4.1.1：
Distance / 4.1.2：
Similarity / 4.1.3：
DNA Languages / 4.2：
Bond-Free Languages / 4.2.1：
Hybridization Properties / 4.2.2：
Small DNA Languages / 4.2.3：
DNA Code Constructions and Bounds / 4.3：
Reverse and Reverse-Complement Codes / 4.3.1：
Constant GC-Content Codes / 4.3.2：
Similarity-Based Codes / 4.3.3：
In Vitro Random Selection / 4.4：
General Selection Model / 4.4.1：
Selective Word Design / 4.4.2：
Concluding Remarks
Non-Autonomous DNA Models / 5：
Seminal Work / 5.1：
Adleman's First Experiment / 5.1.1：
Lipton's First Paper / 5.1.2：
Filtering Models / 5.2：
Memory-Less Filtering / 5.2.1：
Memory-Based Filtering / 5.2.2：
Mark-and-Destroy Filtering / 5.2.3：
Split-and-Merge Filtering / 5.2.4：
Filtering by Blocking / 5.2.5：
Surface-Based Filtering / 5.2.6：
Sticker Systems / 5.3：
Sticker Machines / 5.3.1：
Combinatorial Libraries / 5.3.2：
Useful Subroutines / 5.3.3：
NP-Complete Problems / 5.3.4：
Splicing Systems / 5.4：
Basic Splicing Systems / 5.4.1：
Recursively Enumerable Splicing Systems / 5.4.2：
Universal Splicing Systems / 5.4.3：
Recombinant Systems / 5.4.4：
Autonomous DNA Models / 6：
Algorithmic Self-Assembly / 6.1：
Self-Assembly / 6.1.1：
DNA Graphs / 6.1.2：
Linear Self-Assembly / 6.1.3：
Tile Assembly / 6.1.4：
Finite State Automaton Models / 6.2：
Two-State Two-Symbol Automata / 6.2.1：
Length-Encoding Automata / 6.2.2：
Sticker Automata / 6.2.3：
Stochastic Automata / 6.2.4：
DNA Hairpin Model / 6.3：
Whiplash PCR / 6.3.1：
Satisfiability / 6.3.2：
Hamiltonian Paths / 6.3.3：
Maximum Cliques / 6.3.4：
Hairpin Structures / 6.3.5：
Computational Models / 6.4：
Neural Networks / 6.4.1：
Tic-Tac-Toe Networks / 6.4.2：
Logic Circuits / 6.4.3：
Cellular DNA Computing / 6.4.4：
Ciliate Computing / 7.1：
Ciliates / 7.1.1：
Models of Gene Assembly / 7.1.2：
Intramolecular String Model / 7.1.3：
Intramolecular Graph Model / 7.1.4：
Intermolecular String Model / 7.1.5：
Biomolecular Computing / 7.2：
Gene Therapy / 7.2.1：
Anti-Sense Technology / 7.2.2：
Cell-Based Finite State Automata / 7.3：
Anti-Sense Finite State Automata / 7.4：
Basic Model / 7.4.1：
Diagnostic Rules / 7.4.2：
Diagnosis and Therapy / 7.4.3：
Computational Genes / 7.5：
Index / 7.5.1：
Introduction / 1：
References
Theoretical Computer Science / 2：
31.

電子ブック
ＥＢ
31. DNA Computing Models
Zoya Ignatova, Israel Martínez-Pérez, Karl-Heinz Zimmermann
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
References
Theoretical Computer Science / 2：
Graphs / 2.1：
Basic Notions / 2.1.1：
Paths and Cycles / 2.1.2：
Closures and Paths / 2.1.3：
Trees / 2.1.4：
Bipartite Graphs / 2.1.5：
Finite State Automata / 2.2：
Strings and Languages / 2.2.1：
Deterministic Finite State Automata / 2.2.2：
Non-Deterministic Finite State Automata / 2.2.3：
Regular Expressions / 2.2.4：
Stochastic Finite State Automata / 2.2.5：
Computability / 2.3：
Turing Machines / 2.3.1：
Universal Turing Machines / 2.3.2：
Church's Thesis / 2.3.3：
Register Machines / 2.3.4：
Cellular Automata / 2.3.5：
Formal Grammars / 2.4：
Grammars and Languages / 2.4.1：
Chomsky's Hierarchy / 2.4.2：
Grammars and Machines / 2.4.3：
Undecidability / 2.4.4：
Combinatorial Logic / 2.5：
Boolean Circuits / 2.5.1：
Compound Circuits / 2.5.2：
Minterms and Maxterms / 2.5.3：
Canonical Circuits / 2.5.4：
Adder Circuits / 2.5.5：
Computational Complexity / 2.6：
Time Complexity / 2.6.1：
Infinite Asymptotics / 2.6.2：
Decision Problems / 2.6.3：
Optimization Problems / 2.6.4：
Molecular Biology / 3：
DNA / 3.1：
Molecular Structure / 3.1.1：
Manipulation of DNA / 3.1.2：
Physical Chemistry / 3.2：
Thermodynamics / 3.2.1：
Chemical Kinetics / 3.2.2：
DNA Annealing Kinetics / 3.2.3：
Strand Displacement Kinetics / 3.2.4：
Stochastic Chemical Kinetics / 3.2.5：
Genes / 3.3：
Structure and Biosynthesis / 3.3.1：
DNA Recombination / 3.3.2：
Genomes / 3.3.3：
Gene Expression / 3.4：
Protein Biosynthesis / 3.4.1：
Proteins - Molecular Structure / 3.4.2：
Enzymes / 3.4.3：
Cells and Organisms / 3.5：
Eukaryotes and Prokaryotes / 3.5.1：
Viruses / 3.6：
General Structure and Classification / 3.6.1：
Applications / 3.6.2：
Word Design for DNA Computing / 4：
Constraints / 4.1：
Free Energy and Melting Temperature / 4.1.1：
Distance / 4.1.2：
Similarity / 4.1.3：
DNA Languages / 4.2：
Bond-Free Languages / 4.2.1：
Hybridization Properties / 4.2.2：
Small DNA Languages / 4.2.3：
DNA Code Constructions and Bounds / 4.3：
Reverse and Reverse-Complement Codes / 4.3.1：
Constant GC-Content Codes / 4.3.2：
Similarity-Based Codes / 4.3.3：
In Vitro Random Selection / 4.4：
General Selection Model / 4.4.1：
Selective Word Design / 4.4.2：
Concluding Remarks
Non-Autonomous DNA Models / 5：
Seminal Work / 5.1：
Adleman's First Experiment / 5.1.1：
Lipton's First Paper / 5.1.2：
Filtering Models / 5.2：
Memory-Less Filtering / 5.2.1：
Memory-Based Filtering / 5.2.2：
Mark-and-Destroy Filtering / 5.2.3：
Split-and-Merge Filtering / 5.2.4：
Filtering by Blocking / 5.2.5：
Surface-Based Filtering / 5.2.6：
Sticker Systems / 5.3：
Sticker Machines / 5.3.1：
Combinatorial Libraries / 5.3.2：
Useful Subroutines / 5.3.3：
NP-Complete Problems / 5.3.4：
Splicing Systems / 5.4：
Basic Splicing Systems / 5.4.1：
Recursively Enumerable Splicing Systems / 5.4.2：
Universal Splicing Systems / 5.4.3：
Recombinant Systems / 5.4.4：
Autonomous DNA Models / 6：
Algorithmic Self-Assembly / 6.1：
Self-Assembly / 6.1.1：
DNA Graphs / 6.1.2：
Linear Self-Assembly / 6.1.3：
Tile Assembly / 6.1.4：
Finite State Automaton Models / 6.2：
Two-State Two-Symbol Automata / 6.2.1：
Length-Encoding Automata / 6.2.2：
Sticker Automata / 6.2.3：
Stochastic Automata / 6.2.4：
DNA Hairpin Model / 6.3：
Whiplash PCR / 6.3.1：
Satisfiability / 6.3.2：
Hamiltonian Paths / 6.3.3：
Maximum Cliques / 6.3.4：
Hairpin Structures / 6.3.5：
Computational Models / 6.4：
Neural Networks / 6.4.1：
Tic-Tac-Toe Networks / 6.4.2：
Logic Circuits / 6.4.3：
Cellular DNA Computing / 6.4.4：
Ciliate Computing / 7.1：
Ciliates / 7.1.1：
Models of Gene Assembly / 7.1.2：
Intramolecular String Model / 7.1.3：
Intramolecular Graph Model / 7.1.4：
Intermolecular String Model / 7.1.5：
Biomolecular Computing / 7.2：
Gene Therapy / 7.2.1：
Anti-Sense Technology / 7.2.2：
Cell-Based Finite State Automata / 7.3：
Anti-Sense Finite State Automata / 7.4：
Basic Model / 7.4.1：
Diagnostic Rules / 7.4.2：
Diagnosis and Therapy / 7.4.3：
Computational Genes / 7.5：
Index / 7.5.1：
Introduction / 1：
References
Theoretical Computer Science / 2：
32.

電子ブック
ＥＢ
32. Agent-based Supply Network Event Management
Roland Zimmermann, Monique Calisti, Marius Walliser
出版情報: Springer eBooks Computer Science , Dordrecht : Birkh?user Basel, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Event Management in Supply Networks / 2：
Problem / 2.1：
Event-related Information Logistics / 2.1.1：
Supply Networks / 2.1.2：
Formal Specification of the Problem / 2.1.3：
Requirements of an Event Management Solution / 2.2：
General Requirements / 2.2.1：
Functional Requirements / 2.2.2：
Data Requirements / 2.2.3：
Implications / 2.2.4：
Potential Benefits / 2.3：
Benefits for Single Enterprises / 2.3.1：
Analysis of Supply Network Effects / 2.3.2：
Benefits for Supply Networks / 2.3.3：
Summary on Potential Benefits / 2.3.4：
Existing Approaches / 2.4：
Tracking Systems / 2.4.1：
SCEM Software / 2.4.2：
Conclusion on Existing Approaches / 2.4.3：
Information Base for Event Management / 3：
Data Model / 3.1：
Representation of the Supply Network Domain / 3.1.1：
Aggregation and Refinement of Status Data / 3.1.2：
Disruptive Event Data for Decision Support / 3.1.3：
Extendable Data Structures / 3.1.4：
Semantic Interoperability / 3.2：
Requirements for Semantic Interoperability / 3.2.1：
Ontology for Supply Network Event Management / 3.2.2：
Data Sources / 3.3：
Data Bases / 3.3.1：
Internet Sources and Web Services / 3.3.2：
Radio Frequency Identification Technologies / 3.3.3：
Event Management Functions / 4：
Information Gathering in Supply Networks / 4.1：
Trigger Events / 4.1.1：
Inter-organizational Information Gathering / 4.1.2：
Proactive and Flexible Monitoring / 4.2：
Critical Profiles / 4.2.1：
Discovery of Critical Profiles / 4.2.2：
Continuous Assessment of Critical Profiles / 4.2.3：
Analysis and Interpretation of Event Data / 4.3：
Basic Approach / 4.3.1：
Data Interpretation with Fuzzy Logic / 4.3.2：
Aggregated Order Status / 4.3.3：
Assessment of Disruptive Events / 4.3.4：
Adjustment of Milestone Plans / 4.3.5：
Distribution of Event Data / 4.4：
Alert Management Process / 4.4.1：
Alert Decision Management / 4.4.2：
Escalation Management / 4.4.3：
Selection of Recipient and Media Type / 4.4.4：
Selection of Content / 4.4.5：
Event Management Process / 4.5：
Distributed Event Management in Supply Networks / 4.5.1：
Agent-based Concept / 5：
Software Agents and Supply Network Event Management / 5.1：
Introduction to Software Agents / 5.1.1：
Benefits of Agent Technology for Event Management / 5.1.2：
Related Work in Agent Technologies / 5.1.3：
Agent Oriented Software Engineering / 5.2：
Approaches / 5.2.1：
AUML for Supply Network Event Management / 5.2.2：
Agent Society for Supply Network Event Management / 5.3：
Roles and Agent Types / 5.3.1：
Agent Interactions / 5.3.2：
Institutional Agreements / 5.3.3：
Coordination Agent / 5.4：
Structure / 5.4.1：
Behaviors / 5.4.2：
Interactions / 5.4.3：
Surveillance Agent / 5.5：
Discourse Agent / 5.5.1：
Wrapper Agent / 5.6.1：
Prototype Implementations / 5.7.1：
Generic Prototype / 6.1：
Overview / 6.1.1：
Ontology Integration / 6.1.2：
Supply Network Testbed / 6.1.3：
Simulated Enterprise Data Base / 6.2.1：
Simulator / 6.2.2：
Industry Showcase / 6.3：
Evaluation / 6.3.1：
Concept / 7.1：
Constraints to an Evaluation / 7.1.1：
Multi-dimensional Evaluation / 7.1.2：
Analytical Evaluation / 7.2：
Effects of SNEM Cycles / 7.2.1：
Costs of Event Management / 7.2.2：
Cost-Benefit-Model and Benchmarks / 7.2.3：
Supply Network Effects / 7.2.4：
Event Management with Profiles / 7.2.5：
Conclusions / 7.2.6：
Experimental Evaluation / 7.3：
Reaction Function / 7.3.1：
Experimental Results / 7.3.2：
Cost-Benefit Analysis / 7.3.3：
Showcase Evaluation / 7.3.4：
Prototype Assessment / 7.4.1：
Analysis of Follow-up Costs / 7.4.2：
Summary - Benefits and Constraints / 7.4.3：
Conclusions and Outlook / 8：
Supply Network Event Management / 8.1：
Further Research Opportunities / 8.2：
Object Chips for Supply Network Event Management / 8.2.1：
Event Management in other Domains / 8.2.2：
Integration and Acceptance Issues / 8.2.3：
Appendices
References
Introduction / 1：
Event Management in Supply Networks / 2：
Problem / 2.1：
33.

電子ブック
ＥＢ
33. Agent-based Supply Network Event Management
Roland Zimmermann, Monique Calisti, Marius Walliser, Thomas Hempfling
出版情報: SpringerLink Books - AutoHoldings , Dordrecht : Birkhäuser Basel, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Event Management in Supply Networks / 2：
Problem / 2.1：
Event-related Information Logistics / 2.1.1：
Supply Networks / 2.1.2：
Formal Specification of the Problem / 2.1.3：
Requirements of an Event Management Solution / 2.2：
General Requirements / 2.2.1：
Functional Requirements / 2.2.2：
Data Requirements / 2.2.3：
Implications / 2.2.4：
Potential Benefits / 2.3：
Benefits for Single Enterprises / 2.3.1：
Analysis of Supply Network Effects / 2.3.2：
Benefits for Supply Networks / 2.3.3：
Summary on Potential Benefits / 2.3.4：
Existing Approaches / 2.4：
Tracking Systems / 2.4.1：
SCEM Software / 2.4.2：
Conclusion on Existing Approaches / 2.4.3：
Information Base for Event Management / 3：
Data Model / 3.1：
Representation of the Supply Network Domain / 3.1.1：
Aggregation and Refinement of Status Data / 3.1.2：
Disruptive Event Data for Decision Support / 3.1.3：
Extendable Data Structures / 3.1.4：
Semantic Interoperability / 3.2：
Requirements for Semantic Interoperability / 3.2.1：
Ontology for Supply Network Event Management / 3.2.2：
Data Sources / 3.3：
Data Bases / 3.3.1：
Internet Sources and Web Services / 3.3.2：
Radio Frequency Identification Technologies / 3.3.3：
Event Management Functions / 4：
Information Gathering in Supply Networks / 4.1：
Trigger Events / 4.1.1：
Inter-organizational Information Gathering / 4.1.2：
Proactive and Flexible Monitoring / 4.2：
Critical Profiles / 4.2.1：
Discovery of Critical Profiles / 4.2.2：
Continuous Assessment of Critical Profiles / 4.2.3：
Analysis and Interpretation of Event Data / 4.3：
Basic Approach / 4.3.1：
Data Interpretation with Fuzzy Logic / 4.3.2：
Aggregated Order Status / 4.3.3：
Assessment of Disruptive Events / 4.3.4：
Adjustment of Milestone Plans / 4.3.5：
Distribution of Event Data / 4.4：
Alert Management Process / 4.4.1：
Alert Decision Management / 4.4.2：
Escalation Management / 4.4.3：
Selection of Recipient and Media Type / 4.4.4：
Selection of Content / 4.4.5：
Event Management Process / 4.5：
Distributed Event Management in Supply Networks / 4.5.1：
Agent-based Concept / 5：
Software Agents and Supply Network Event Management / 5.1：
Introduction to Software Agents / 5.1.1：
Benefits of Agent Technology for Event Management / 5.1.2：
Related Work in Agent Technologies / 5.1.3：
Agent Oriented Software Engineering / 5.2：
Approaches / 5.2.1：
AUML for Supply Network Event Management / 5.2.2：
Agent Society for Supply Network Event Management / 5.3：
Roles and Agent Types / 5.3.1：
Agent Interactions / 5.3.2：
Institutional Agreements / 5.3.3：
Coordination Agent / 5.4：
Structure / 5.4.1：
Behaviors / 5.4.2：
Interactions / 5.4.3：
Surveillance Agent / 5.5：
Discourse Agent / 5.5.1：
Wrapper Agent / 5.6.1：
Prototype Implementations / 5.7.1：
Generic Prototype / 6.1：
Overview / 6.1.1：
Ontology Integration / 6.1.2：
Supply Network Testbed / 6.1.3：
Simulated Enterprise Data Base / 6.2.1：
Simulator / 6.2.2：
Industry Showcase / 6.3：
Evaluation / 6.3.1：
Concept / 7.1：
Constraints to an Evaluation / 7.1.1：
Multi-dimensional Evaluation / 7.1.2：
Analytical Evaluation / 7.2：
Effects of SNEM Cycles / 7.2.1：
Costs of Event Management / 7.2.2：
Cost-Benefit-Model and Benchmarks / 7.2.3：
Supply Network Effects / 7.2.4：
Event Management with Profiles / 7.2.5：
Conclusions / 7.2.6：
Experimental Evaluation / 7.3：
Reaction Function / 7.3.1：
Experimental Results / 7.3.2：
Cost-Benefit Analysis / 7.3.3：
Showcase Evaluation / 7.3.4：
Prototype Assessment / 7.4.1：
Analysis of Follow-up Costs / 7.4.2：
Summary - Benefits and Constraints / 7.4.3：
Conclusions and Outlook / 8：
Supply Network Event Management / 8.1：
Further Research Opportunities / 8.2：
Object Chips for Supply Network Event Management / 8.2.1：
Event Management in other Domains / 8.2.2：
Integration and Acceptance Issues / 8.2.3：
Appendices
References
Introduction / 1：
Event Management in Supply Networks / 2：
Problem / 2.1：
34.

電子ブック
ＥＢ
34. Non-Standard Inferences in Description Logics
Ralf Küsters
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2001
所蔵情報: loading…
目次情報: 続きを見る
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：
35.

電子ブック
ＥＢ
35. Constructing Correct Software
John Cooke
出版情報: Springer eBooks Computer Science , Springer London, 2005
所蔵情報: loading…
目次情報: 続きを見る
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
What Is this Book About? / 0.1：
Some Terminology / 0.2：
How Might Programs Fail? / 0.3：
A Way Forward / 0.4：
On Mathematics / 0.5：
Linking Paradigms / 0.6：
Problem Solving / 0.7：
The Book Plan / 0.8：
Preliminaries / Part A：
The Technical Background / 1：
Functions, Relations and Specifications / 1.0：
Summary of Features / 1.1.1：
Guidelines for Specifications / 1.1.2：
Equational Reasoning and Types / 1.2：
The Origin and Application of Rules / 1.3：
Data Types / 1.4：
A Glimpse at the Integers / 1.4.1：
Logical Types / 1.4.2：
The Boolean Type, IB / 1.4.2.1：
Implication and Deduction / 1.4.2.2：
Boolean Quantifiers / 1.4.2.3：
Extended (3-valued) Logic / 1.4.2.4：
Sets / 1.4.3：
Integers / 1.4.4：
Inequalities / 1.4.4.1：
Bags / 1.4.5：
Lists / 1.4.6：
Records and n-tuples / 1.4.7：
Union Types / 1.4.8：
Sub-types and Sub-ranges / 1.4.9：
Type Transfer Functions and Casts / 1.4.10：
Data Types and Transformations / 1.4.11：
On Quantification / 1.4.12：
Applying Unfold/Fold Transformations / 1.5：
On Programming / 2：
Overview / 2.0：
Procedural Programming / 2.1：
'Good' Programming / 2.2：
Structuring and (control) Flowcharts / 2.3：
PDL Overview / 2.4：
"Let" and "Where" / 2.4.1：
Scope and Parameters / 2.4.2：
Comments and Assertions / 2.5：
Verification of Procedural Programs / 2.6：
Sequencing / 2.6.1：
Alternation / 2.6.2：
Iteration / 2.6.3：
Program Derivation / 2.7：
Fundamentals / Part B：
Algorithm Extraction / 3：
On Converging Recursion / 3.0：
Design Tactics / 3.2：
Checking Perceived Answers / 3.2.1：
Problem Reduction / 3.2.2：
Problem Decomposition / 3.2.3：
Structural Splitting / 3.2.3.1：
Predicated Splitting / 3.2.3.2：
Mixed Strategies / 3.2.3.3：
Domain Partitioning / 3.2.3.4：
The Use of Analogy / 3.2.4：
'Eureka' Processes / 3.3：
Summary
Recursion Removal / 4：
Tail Recursion / 4.1：
Associative Recursion / 4.2：
Up and Down Iteration / 4.3：
Speeding up Iteratons / 4.4：
Recursive Procedures / 4.5：
Quantifications / 5：
Defining Composite Values / 5.0：
Derived Composite Values / 5.2：
1-place Functions / 5.2.1：
2-place Functions / 5.2.2：
Application to Program Development / 5.3：
An Extended Example: The Factorial Function / 5.3.1：
Some Rules for Quantifications / 5.4：
General Rules / 5.4.1：
Special Rules for Logical Quantifiers / 5.4.2：
Refinement and Re-use / 6：
Operational Refinement / 6.1：
On Correctness / 6.1.1：
Some Properties of Design Refinement / 6.1.2：
An Alternative View / 6.1.3：
Re-using Designs / 6.2：
Developments / Part C：
Sorting / 7：
Specification and Initial Discussion / 7.1：
Initial Designs / 7.2：
Predicated Splitting (Partitioning) / 7.2.1：
Complete Designs / 7.3：
Exchange Sorts / 7.3.1：
Merge Sorts / 7.3.2：
The Basic Merge Sort / 7.3.2.1：
Partition Sorts / 7.3.3：
Simple Partition Sort / 7.3.3.1：
A Quick Design / 7.4：
Data Refinement / 8：
On 'Internal' Data Types / 8.1：
Changing Data Types / 8.2：
Where to next? / 8.3：
Sorting Revisited / 9：
Variants of the Merge Sort / 9.1：
Failures and Fixes / 9.3：
Inadequate Pre-Conditions / 10.1：
Failures in Structural Splitting / 10.2：
Loss of Vital Information / 10.2.1：
Further Examples / 11：
The 2-D Convex Hull / 11.1：
Topological Sort / 11.2：
Experimentation / 11.2.1：
A Proper Formulation / 11.2.2：
Some 'Extremal' Problems / 11.3：
On Interactive Software / 12：
Specifications Involving Change / 12.1：
Specifications of Input/Output / 12.1.1：
Conventional Communications / 12.1.2：
The Enabling of Computations / 12.1.3：
Pertaining to (Software) Systems / 12.2：
System Requirements / 12.2.1：
Specifying Systems / 12.2.2：
Transformation Digest / Appendix：
Re-write Rule Conventions / A.0：
Data Manipulation Rules / A.1：
The Type IB / A.1.1：
Extended Logic and Conditional Expressions / A.1.2：
Common Conversion Functions / A.1.3：
Quantifier Rules / A.1.8：
Quantifier Properties / A.2：
'Not Occurs in' / A.3：
On PDL Structure / A.4：
PDL Transformation Rules / A.4.1：
Bibliography
Index
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
36.

電子ブック
ＥＢ
36. Constructing Correct Software
John Cooke
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2005
所蔵情報: loading…
目次情報: 続きを見る
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
What Is this Book About? / 0.1：
Some Terminology / 0.2：
How Might Programs Fail? / 0.3：
A Way Forward / 0.4：
On Mathematics / 0.5：
Linking Paradigms / 0.6：
Problem Solving / 0.7：
The Book Plan / 0.8：
Preliminaries / Part A：
The Technical Background / 1：
Functions, Relations and Specifications / 1.0：
Summary of Features / 1.1.1：
Guidelines for Specifications / 1.1.2：
Equational Reasoning and Types / 1.2：
The Origin and Application of Rules / 1.3：
Data Types / 1.4：
A Glimpse at the Integers / 1.4.1：
Logical Types / 1.4.2：
The Boolean Type, IB / 1.4.2.1：
Implication and Deduction / 1.4.2.2：
Boolean Quantifiers / 1.4.2.3：
Extended (3-valued) Logic / 1.4.2.4：
Sets / 1.4.3：
Integers / 1.4.4：
Inequalities / 1.4.4.1：
Bags / 1.4.5：
Lists / 1.4.6：
Records and n-tuples / 1.4.7：
Union Types / 1.4.8：
Sub-types and Sub-ranges / 1.4.9：
Type Transfer Functions and Casts / 1.4.10：
Data Types and Transformations / 1.4.11：
On Quantification / 1.4.12：
Applying Unfold/Fold Transformations / 1.5：
On Programming / 2：
Overview / 2.0：
Procedural Programming / 2.1：
'Good' Programming / 2.2：
Structuring and (control) Flowcharts / 2.3：
PDL Overview / 2.4：
"Let" and "Where" / 2.4.1：
Scope and Parameters / 2.4.2：
Comments and Assertions / 2.5：
Verification of Procedural Programs / 2.6：
Sequencing / 2.6.1：
Alternation / 2.6.2：
Iteration / 2.6.3：
Program Derivation / 2.7：
Fundamentals / Part B：
Algorithm Extraction / 3：
On Converging Recursion / 3.0：
Design Tactics / 3.2：
Checking Perceived Answers / 3.2.1：
Problem Reduction / 3.2.2：
Problem Decomposition / 3.2.3：
Structural Splitting / 3.2.3.1：
Predicated Splitting / 3.2.3.2：
Mixed Strategies / 3.2.3.3：
Domain Partitioning / 3.2.3.4：
The Use of Analogy / 3.2.4：
'Eureka' Processes / 3.3：
Summary
Recursion Removal / 4：
Tail Recursion / 4.1：
Associative Recursion / 4.2：
Up and Down Iteration / 4.3：
Speeding up Iteratons / 4.4：
Recursive Procedures / 4.5：
Quantifications / 5：
Defining Composite Values / 5.0：
Derived Composite Values / 5.2：
1-place Functions / 5.2.1：
2-place Functions / 5.2.2：
Application to Program Development / 5.3：
An Extended Example: The Factorial Function / 5.3.1：
Some Rules for Quantifications / 5.4：
General Rules / 5.4.1：
Special Rules for Logical Quantifiers / 5.4.2：
Refinement and Re-use / 6：
Operational Refinement / 6.1：
On Correctness / 6.1.1：
Some Properties of Design Refinement / 6.1.2：
An Alternative View / 6.1.3：
Re-using Designs / 6.2：
Developments / Part C：
Sorting / 7：
Specification and Initial Discussion / 7.1：
Initial Designs / 7.2：
Predicated Splitting (Partitioning) / 7.2.1：
Complete Designs / 7.3：
Exchange Sorts / 7.3.1：
Merge Sorts / 7.3.2：
The Basic Merge Sort / 7.3.2.1：
Partition Sorts / 7.3.3：
Simple Partition Sort / 7.3.3.1：
A Quick Design / 7.4：
Data Refinement / 8：
On 'Internal' Data Types / 8.1：
Changing Data Types / 8.2：
Where to next? / 8.3：
Sorting Revisited / 9：
Variants of the Merge Sort / 9.1：
Failures and Fixes / 9.3：
Inadequate Pre-Conditions / 10.1：
Failures in Structural Splitting / 10.2：
Loss of Vital Information / 10.2.1：
Further Examples / 11：
The 2-D Convex Hull / 11.1：
Topological Sort / 11.2：
Experimentation / 11.2.1：
A Proper Formulation / 11.2.2：
Some 'Extremal' Problems / 11.3：
On Interactive Software / 12：
Specifications Involving Change / 12.1：
Specifications of Input/Output / 12.1.1：
Conventional Communications / 12.1.2：
The Enabling of Computations / 12.1.3：
Pertaining to (Software) Systems / 12.2：
System Requirements / 12.2.1：
Specifying Systems / 12.2.2：
Transformation Digest / Appendix：
Re-write Rule Conventions / A.0：
Data Manipulation Rules / A.1：
The Type IB / A.1.1：
Extended Logic and Conditional Expressions / A.1.2：
Common Conversion Functions / A.1.3：
Quantifier Rules / A.1.8：
Quantifier Properties / A.2：
'Not Occurs in' / A.3：
On PDL Structure / A.4：
PDL Transformation Rules / A.4.1：
Bibliography
Index
Abridged Preface to First Edition
Preface to Second Edition
Introduction / 0：
37.

電子ブック
ＥＢ
37. Higher-Level Hardware Synthesis
Richard William Sharp
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2004
所蔵情報: loading…
目次情報: 続きを見る
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：
38.

電子ブック
ＥＢ
38. Differential Evolution
Kenneth V. Price, Th B?ck, Jouni A. Lampinen, Rainer M. Storn
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2005
所蔵情報: loading…
目次情報: 続きを見る
Preface
Table of Contents
The Motivation for Differential Evolution / 1：
Introduction to Parameter Optimization / 1.1：
Overview / 1.1.1：
Single-Point, Derivative-Based Optimization / 1.1.2：
One-Point, Derivative-Free Optimization and the Step Size Problem / 1.1.3：
Local Versus Global Optimization / 1.2：
Simulated Annealing / 1.2.1：
Multi-Point, Derivative-Based Methods / 1.2.2：
Multi-Point, Derivative-Free Methods / 1.2.3：
Differential Evolution - A First Impression / 1.2.4：
References
The Differential Evolution Algorithm / 2：
Population Structure / 2.1：
Initialization / 2.1.2：
Mutation / 2.1.3：
Crossover / 2.1.4：
Selection / 2.1.5：
DE at a Glance / 2.1.6：
Visualizing DE / 2.1.7：
Notation / 2.1.8：
Parameter Representation / 2.2：
Bit Strings / 2.2.1：
Floating-Point / 2.2.2：
Floating-Point Constraints / 2.2.3：
Initial Bounds / 2.3：
Initial Distributions / 2.3.2：
Base Vector Selection / 2.4：
Choosing the Base Vector Index, r0 / 2.4.1：
One-to-One Base Vector Selection / 2.4.2：
A Comparison of Random Base Index Selection Methods / 2.4.3：
Degenerate Vector Combinations / 2.4.4：
Implementing Mutually Exclusive Indices / 2.4.5：
Gauging the Effects of Degenerate Combinations: The Sphere / 2.4.6：
Biased Base Vector Selection Schemes / 2.4.7：
Differential Mutation / 2.5：
The Mutation Scale Factor: F / 2.5.1：
Randomizing the Scale Factor / 2.5.2：
Recombination / 2.6：
The Role of Cr in Optimization / 2.6.1：
Arithmetic Recombination / 2.6.3：
Phase Portraits / 2.6.4：
The Either/Or Algorithm / 2.6.5：
Survival Criteria / 2.7：
Tournament Selection / 2.7.2：
One-to-One Survivor Selection / 2.7.3：
Local Versus Global Selection / 2.7.4：
Permutation Selection Invariance / 2.7.5：
Crossover-Dependent Selection Pressure / 2.7.6：
Parallel Performance / 2.7.7：
Extensions / 2.7.8：
Termination Criteria / 2.8：
Objective Met / 2.8.1：
Limit the Number of Generations / 2.8.2：
Population Statistics / 2.8.3：
Limited Time / 2.8.4：
Human Monitoring / 2.8.5：
Application Specific / 2.8.6：
Benchmarking Differential Evolution / 3：
About Testing / 3.1：
Performance Measures / 3.2：
DE Versus DE / 3.3：
The Algorithms / 3.3.1：
The Test Bed / 3.3.2：
Summary / 3.3.3：
DE Versus Other Optimizers / 3.4：
Comparative Performance: Thirty-Dimensional Functions / 3.4.1：
Comparative Studies: Unconstrained Optimization / 3.4.2：
Performance Comparisons from Other Problem Domains / 3.4.3：
Application-Based Performance Comparisons / 3.4.4：
Problem Domains / 3.5：
Function and Parameter Quantization / 4.1：
Uniform Quantization / 4.2.1：
Non-Uniform Quantization / 4.2.2：
Objective Function Quantization / 4.2.3：
Parameter Quantization / 4.2.4：
Mixed Variables / 4.2.5：
Optimization with Constraints / 4.3：
Boundary Constraints / 4.3.1：
Inequality Constraints / 4.3.2：
Equality Constraints / 4.3.3：
Combinatorial Problems / 4.4：
The Traveling Salesman Problem / 4.4.1：
The Permutation Matrix Approach / 4.4.2：
Relative Position Indexing / 4.4.3：
Onwubolu's Approach / 4.4.4：
Adjacency Matrix Approach / 4.4.5：
Design Centering / 4.4.6：
Divergence, Self-Steering and Pooling / 4.5.1：
Computing a Design Center / 4.5.2：
Multi-Objective Optimization / 4.6：
Weighted Sum of Objective Functions / 4.6.1：
Pareto Optimality / 4.6.2：
The Pareto-Front: Two Examples / 4.6.3：
Adapting DE for Multi-Objective Optimization / 4.6.4：
Dynamic Objective Functions / 4.7：
Stationary Optima / 4.7.1：
Non-Stationary Optima / 4.7.2：
Architectural Aspects and Computing Environments / 5：
DE on Parallel Processors / 5.1：
Background / 5.1.1：
Related Work / 5.1.2：
Drawbacks of the Standard Model / 5.1.3：
Modifying the Standard Model / 5.1.4：
The Master Process / 5.1.5：
DE on Limited Resource Devices / 5.2：
Random Numbers / 5.2.1：
Permutation Generators / 5.2.2：
Efficient Sorting / 5.2.3：
Memory-Saving DE Variants / 5.2.4：
Computer Code / 6：
DeMat - Differential Evolution for MATLAB / 6.1：
General Structure of DeMat / 6.1.1：
Naming and Coding Conventions / 6.1.2：
Data Flow Diagram / 6.1.3：
How to Use the Graphics / 6.1.4：
DeWin - DE for MS Windows: An Application in C / 6.2：
General Structure of DeWin / 6.2.1：
How To Use the Graphics / 6.2.2：
Functions of graphics.h / 6.2.5：
Software on the Accompanying CD / 6.3：
Applications / 7：
Genetic Algorithms and Related Techniques for Optimizing Si-H Clusters: A Merit Analysis for Differential Evolution / 7.1：
Introduction / 7.1.1：
The System Model / 7.1.2：
Computational Details / 7.1.3：
Results and Discussion / 7.1.4：
Concluding Remarks / 7.1.5：
Non-Imaging Optical Design Using Differential Evolution / 7.2：
Objective Function / 7.2.1：
A Reverse Engineering Approach to Testing / 7.2.3：
A More Difficult Problem: An Extended Source / 7.2.4：
Conclusion / 7.2.5：
Optimization of an Industrial Compressor Supply System / 7.3：
Background Information on the Test Problem / 7.3.1：
System Optimization / 7.3.3：
Demand Profiles / 7.3.4：
Modified Differential Evolution; Extending the Generality of DE / 7.3.5：
Component Selection from the Database / 7.3.6：
Crossover Approaches / 7.3.7：
Testing Procedures / 7.3.8：
Obtaining 100% Certainty of the Results / 7.3.9：
Results / 7.3.10：
Minimal Representation Multi-Sensor Fusion Using Differential Evolution / 7.3.11：
Minimal Representation Multi-Sensor Fusion / 7.4.1：
Differential Evolution for Multi-Sensor Fusion / 7.4.3：
Experimental Results / 7.4.4：
Comparison with a Binary Genetic Algorithm / 7.4.5：
Determination of the Earthquake Hypocenter: A Challenge for the Differential Evolution Algorithm / 7.4.6：
Brief Outline of Direct Problem Solution / 7.5.1：
Synthetic Location Test / 7.5.3：
Convergence Properties / 7.5.4：
Conclusions / 7.5.5：
Parallel Differential Evolution: Application to 3-D Medical Image Registration / 7.6：
Medical Image Registration Using Similarity Measures / 7.6.1：
Optimization by Differential Evolution / 7.6.3：
Parallelization of Differential Evolution / 7.6.4：
Acknowledgments / 7.6.5：
Design of Efficient Erasure Codes with Differential Evolution / 7.7：
Codes from Bipartite Graphs / 7.7.1：
Code Design / 7.7.3：
Differential Evolution / 7.7.4：
FIWIZ - A Versatile Program for the Design of Digital Filters Using Differential Evolution / 7.7.5：
Unconventional Design Tasks / 7.8.1：
Approach / 7.8.3：
Examples / 7.8.4：
Optimization of Radial Active Magnetic Bearings by Using Differential Evolution and the Finite Element Method / 7.8.5：
Radial Active Magnetic Bearings / 7.9.1：
Magnetic Field Distribution and Force Computed by the Two-Dimensional FEM / 7.9.3：
RAMB Design Optimized by DE and the FEM / 7.9.4：
Application of Differential Evolution to the Analysis of X-Ray Reflectivity Data / 7.9.5：
The Data-Fitting Procedure / 7.10.1：
The Model and Simulation / 7.10.3：
Inverse Fractal Problem / 7.10.4：
General Introduction / 7.11.1：
Active Compensation in RF-Driven Plasmas by Means of Differential Evolution / 7.11.2：
RF-Driven Plasmas / 7.12.1：
Langmuir Probes / 7.12.3：
Active Compensation in RF-Driven Plasmas / 7.12.4：
Automated Control System Structure and Fitness Function / 7.12.5：
Experimental Setup / 7.12.6：
Parameters and Experimental Design / 7.12.7：
Appendix / 7.12.8：
Unconstrained Uni-Modal Test Functions / A.1：
Sphere / A.1.1：
Hyper-Ellipsoid / A.1.2：
Generalized Rosenbrock / A.1.3：
Schwefel's Ridge / A.1.4：
Neumaier #3 / A.1.5：
Unconstrained Multi-Modal Test Functions / A.2：
Ackley / A.2.1：
Griewangk / A.2.2：
Rastrigin / A.2.3：
Salomon / A.2.4：
Whitley / A.2.5：
Storn's Chebyshev / A.2.6：
Lennard-Jones / A.2.7：
Hilbert / A.2.8：
Modified Langerman / A.2.9：
Shekel's Foxholes / A.2.10：
Odd Square / A.2.11：
Katsuura / A.2.12：
Bound-Constrained Test Functions / A.3：
Schwefel / A.3.1：
Epistatic Michalewicz / A.3.2：
Rana / A.3.3：
Index
Preface
Table of Contents
The Motivation for Differential Evolution / 1：
39.

電子ブック
ＥＢ
39. Differential Evolution
Kenneth V. Price, Th Bäck, Jouni A. Lampinen, Rainer M. Storn
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2005
所蔵情報: loading…
目次情報: 続きを見る
Preface
Table of Contents
The Motivation for Differential Evolution / 1：
Introduction to Parameter Optimization / 1.1：
Overview / 1.1.1：
Single-Point, Derivative-Based Optimization / 1.1.2：
One-Point, Derivative-Free Optimization and the Step Size Problem / 1.1.3：
Local Versus Global Optimization / 1.2：
Simulated Annealing / 1.2.1：
Multi-Point, Derivative-Based Methods / 1.2.2：
Multi-Point, Derivative-Free Methods / 1.2.3：
Differential Evolution - A First Impression / 1.2.4：
References
The Differential Evolution Algorithm / 2：
Population Structure / 2.1：
Initialization / 2.1.2：
Mutation / 2.1.3：
Crossover / 2.1.4：
Selection / 2.1.5：
DE at a Glance / 2.1.6：
Visualizing DE / 2.1.7：
Notation / 2.1.8：
Parameter Representation / 2.2：
Bit Strings / 2.2.1：
Floating-Point / 2.2.2：
Floating-Point Constraints / 2.2.3：
Initial Bounds / 2.3：
Initial Distributions / 2.3.2：
Base Vector Selection / 2.4：
Choosing the Base Vector Index, r0 / 2.4.1：
One-to-One Base Vector Selection / 2.4.2：
A Comparison of Random Base Index Selection Methods / 2.4.3：
Degenerate Vector Combinations / 2.4.4：
Implementing Mutually Exclusive Indices / 2.4.5：
Gauging the Effects of Degenerate Combinations: The Sphere / 2.4.6：
Biased Base Vector Selection Schemes / 2.4.7：
Differential Mutation / 2.5：
The Mutation Scale Factor: F / 2.5.1：
Randomizing the Scale Factor / 2.5.2：
Recombination / 2.6：
The Role of Cr in Optimization / 2.6.1：
Arithmetic Recombination / 2.6.3：
Phase Portraits / 2.6.4：
The Either/Or Algorithm / 2.6.5：
Survival Criteria / 2.7：
Tournament Selection / 2.7.2：
One-to-One Survivor Selection / 2.7.3：
Local Versus Global Selection / 2.7.4：
Permutation Selection Invariance / 2.7.5：
Crossover-Dependent Selection Pressure / 2.7.6：
Parallel Performance / 2.7.7：
Extensions / 2.7.8：
Termination Criteria / 2.8：
Objective Met / 2.8.1：
Limit the Number of Generations / 2.8.2：
Population Statistics / 2.8.3：
Limited Time / 2.8.4：
Human Monitoring / 2.8.5：
Application Specific / 2.8.6：
Benchmarking Differential Evolution / 3：
About Testing / 3.1：
Performance Measures / 3.2：
DE Versus DE / 3.3：
The Algorithms / 3.3.1：
The Test Bed / 3.3.2：
Summary / 3.3.3：
DE Versus Other Optimizers / 3.4：
Comparative Performance: Thirty-Dimensional Functions / 3.4.1：
Comparative Studies: Unconstrained Optimization / 3.4.2：
Performance Comparisons from Other Problem Domains / 3.4.3：
Application-Based Performance Comparisons / 3.4.4：
Problem Domains / 3.5：
Function and Parameter Quantization / 4.1：
Uniform Quantization / 4.2.1：
Non-Uniform Quantization / 4.2.2：
Objective Function Quantization / 4.2.3：
Parameter Quantization / 4.2.4：
Mixed Variables / 4.2.5：
Optimization with Constraints / 4.3：
Boundary Constraints / 4.3.1：
Inequality Constraints / 4.3.2：
Equality Constraints / 4.3.3：
Combinatorial Problems / 4.4：
The Traveling Salesman Problem / 4.4.1：
The Permutation Matrix Approach / 4.4.2：
Relative Position Indexing / 4.4.3：
Onwubolu's Approach / 4.4.4：
Adjacency Matrix Approach / 4.4.5：
Design Centering / 4.4.6：
Divergence, Self-Steering and Pooling / 4.5.1：
Computing a Design Center / 4.5.2：
Multi-Objective Optimization / 4.6：
Weighted Sum of Objective Functions / 4.6.1：
Pareto Optimality / 4.6.2：
The Pareto-Front: Two Examples / 4.6.3：
Adapting DE for Multi-Objective Optimization / 4.6.4：
Dynamic Objective Functions / 4.7：
Stationary Optima / 4.7.1：
Non-Stationary Optima / 4.7.2：
Architectural Aspects and Computing Environments / 5：
DE on Parallel Processors / 5.1：
Background / 5.1.1：
Related Work / 5.1.2：
Drawbacks of the Standard Model / 5.1.3：
Modifying the Standard Model / 5.1.4：
The Master Process / 5.1.5：
DE on Limited Resource Devices / 5.2：
Random Numbers / 5.2.1：
Permutation Generators / 5.2.2：
Efficient Sorting / 5.2.3：
Memory-Saving DE Variants / 5.2.4：
Computer Code / 6：
DeMat - Differential Evolution for MATLAB / 6.1：
General Structure of DeMat / 6.1.1：
Naming and Coding Conventions / 6.1.2：
Data Flow Diagram / 6.1.3：
How to Use the Graphics / 6.1.4：
DeWin - DE for MS Windows: An Application in C / 6.2：
General Structure of DeWin / 6.2.1：
How To Use the Graphics / 6.2.2：
Functions of graphics.h / 6.2.5：
Software on the Accompanying CD / 6.3：
Applications / 7：
Genetic Algorithms and Related Techniques for Optimizing Si-H Clusters: A Merit Analysis for Differential Evolution / 7.1：
Introduction / 7.1.1：
The System Model / 7.1.2：
Computational Details / 7.1.3：
Results and Discussion / 7.1.4：
Concluding Remarks / 7.1.5：
Non-Imaging Optical Design Using Differential Evolution / 7.2：
Objective Function / 7.2.1：
A Reverse Engineering Approach to Testing / 7.2.3：
A More Difficult Problem: An Extended Source / 7.2.4：
Conclusion / 7.2.5：
Optimization of an Industrial Compressor Supply System / 7.3：
Background Information on the Test Problem / 7.3.1：
System Optimization / 7.3.3：
Demand Profiles / 7.3.4：
Modified Differential Evolution; Extending the Generality of DE / 7.3.5：
Component Selection from the Database / 7.3.6：
Crossover Approaches / 7.3.7：
Testing Procedures / 7.3.8：
Obtaining 100% Certainty of the Results / 7.3.9：
Results / 7.3.10：
Minimal Representation Multi-Sensor Fusion Using Differential Evolution / 7.3.11：
Minimal Representation Multi-Sensor Fusion / 7.4.1：
Differential Evolution for Multi-Sensor Fusion / 7.4.3：
Experimental Results / 7.4.4：
Comparison with a Binary Genetic Algorithm / 7.4.5：
Determination of the Earthquake Hypocenter: A Challenge for the Differential Evolution Algorithm / 7.4.6：
Brief Outline of Direct Problem Solution / 7.5.1：
Synthetic Location Test / 7.5.3：
Convergence Properties / 7.5.4：
Conclusions / 7.5.5：
Parallel Differential Evolution: Application to 3-D Medical Image Registration / 7.6：
Medical Image Registration Using Similarity Measures / 7.6.1：
Optimization by Differential Evolution / 7.6.3：
Parallelization of Differential Evolution / 7.6.4：
Acknowledgments / 7.6.5：
Design of Efficient Erasure Codes with Differential Evolution / 7.7：
Codes from Bipartite Graphs / 7.7.1：
Code Design / 7.7.3：
Differential Evolution / 7.7.4：
FIWIZ - A Versatile Program for the Design of Digital Filters Using Differential Evolution / 7.7.5：
Unconventional Design Tasks / 7.8.1：
Approach / 7.8.3：
Examples / 7.8.4：
Optimization of Radial Active Magnetic Bearings by Using Differential Evolution and the Finite Element Method / 7.8.5：
Radial Active Magnetic Bearings / 7.9.1：
Magnetic Field Distribution and Force Computed by the Two-Dimensional FEM / 7.9.3：
RAMB Design Optimized by DE and the FEM / 7.9.4：
Application of Differential Evolution to the Analysis of X-Ray Reflectivity Data / 7.9.5：
The Data-Fitting Procedure / 7.10.1：
The Model and Simulation / 7.10.3：
Inverse Fractal Problem / 7.10.4：
General Introduction / 7.11.1：
Active Compensation in RF-Driven Plasmas by Means of Differential Evolution / 7.11.2：
RF-Driven Plasmas / 7.12.1：
Langmuir Probes / 7.12.3：
Active Compensation in RF-Driven Plasmas / 7.12.4：
Automated Control System Structure and Fitness Function / 7.12.5：
Experimental Setup / 7.12.6：
Parameters and Experimental Design / 7.12.7：
Appendix / 7.12.8：
Unconstrained Uni-Modal Test Functions / A.1：
Sphere / A.1.1：
Hyper-Ellipsoid / A.1.2：
Generalized Rosenbrock / A.1.3：
Schwefel's Ridge / A.1.4：
Neumaier #3 / A.1.5：
Unconstrained Multi-Modal Test Functions / A.2：
Ackley / A.2.1：
Griewangk / A.2.2：
Rastrigin / A.2.3：
Salomon / A.2.4：
Whitley / A.2.5：
Storn's Chebyshev / A.2.6：
Lennard-Jones / A.2.7：
Hilbert / A.2.8：
Modified Langerman / A.2.9：
Shekel's Foxholes / A.2.10：
Odd Square / A.2.11：
Katsuura / A.2.12：
Bound-Constrained Test Functions / A.3：
Schwefel / A.3.1：
Epistatic Michalewicz / A.3.2：
Rana / A.3.3：
Index
Preface
Table of Contents
The Motivation for Differential Evolution / 1：
40.

電子ブック
ＥＢ
40. Stepping into Virtual Reality
Mario A. A. Guti?rrez, Mario A. A. Guti?rrez, Daniel Thalmann, Fr?d?ric Vexo, Fr?d?ric Vexo
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
List of Figures
Introduction / 1：
Virtual Reality: The Science of Illusion / 1.1：
Basic Concepts / 1.2：
Immersion / 1.2.1：
Presence / 1.2.2：
A Brief History of Virtual Reality / 1.3：
Reality-Virtuality Continuum / 1.4：
Fundamentals / Part I：
Computer Graphics / 2：
Mathematics / 2.1：
Coordinate Systems / 2.1.1：
Vectors, Transformations and Matrices / 2.1.2：
Angular Representations / 2.1.3：
Projections / 2.1.4：
3D Modeling / 2.2：
Geometric Representations / 2.2.1：
Curves / 2.2.2：
Surfaces / 2.2.3：
3D Rendering / 2.3：
Local Illumination Model / 2.3.1：
Global Illumination Model / 2.3.2：
Textures / 2.3.3：
Rendering Pipeline / 2.3.4：
Computer Animation / 3：
Animation Types: Real Time and Image by Image / 3.1：
Articulated Bodies and Virtual Characters / 3.1.2：
Motion Control Methods / 3.2：
Motion Capture and Performance Animation / 3.3：
Optical Motion Capture Systems / 3.3.1：
Magnetic Trackers and Systems / 3.3.2：
Motion Capture Advantages and Disadvantages / 3.3.3：
Key-Frame Animation / 3.4：
Shape Interpolation and Parametric Keyframe Animation / 3.4.1：
Kochanek-Bartels Spline Interpolation / 3.4.2：
Inverse Kinematics / 3.5：
Motion Retargeting / 3.6：
Procedural Animation / 3.7：
Physics-Based Animation / 3.8：
Behavioral Animation / 3.9：
Virtual Worlds / Part II：
Virtual Characters / 4：
Virtual Humans in Virtual Environments / 4.1：
Character Skinning / 4.2：
Skeleton-Based Deformations / 4.2.1：
Data-Driven Methods / 4.2.2：
Physics-Based Approaches / 4.2.3：
Locomotion / 4.3：
Locomotion Generation / 4.3.1：
PCA-Based Locomotion / 4.3.2：
Virtual Human-Object interaction / 4.4：
Feature Modeling and Smart Objects / 4.4.1：
Grasping / 4.4.2：
Motion Planning / 4.4.3：
Facial Animation / 4.5：
Autonomous Characters / 4.6：
Why Autonomous Virtual Characters? / 4.6.1：
Properties of Autonomous Virtual Characters / 4.6.2：
Behaviors for Autonomous Virtual Characters / 4.6.3：
Crowd Simulation / 4.7：
Architecture of Virtual Reality Systems / 5：
Scene Graph-Based Systems / 5.1：
Semantic Virtual Environments / 5.2：
Generic System Architecture for VR Systems / 5.3：
Distributed Virtual Environments / 5.4：
Communication Architecture / 5.4.1：
Interest Management / 5.4.2：
Concurrency Control / 5.4.3：
Data Replication / 5.4.4：
Load Distribution / 5.4.5：
Mixed Realities / 6：
Augmented Reality and Augmented Virtuality / 6.1：
Tracking Techniques / 6.2：
Markers-Based Tracking / 6.2.1：
Marker-Less Tracking / 6.2.2：
Mixed Reality Tool Kits / 6.3：
Perceiving Virtual Worlds / Part III：
Vision / 7：
Graphical Display Technologies / 7.1：
Cathode-Ray Tubes / 7.1.1：
Liquid Crystal Displays / 7.1.2：
Plasma Displays / 7.1.3：
Virtual Reality Displays / 7.2：
Head-Mounted Displays / 7.2.1：
Fish Tank VR / 7.2.2：
Handheld Displays / 7.2.3：
Large Projection Screens / 7.2.4：
CAVE Systems / 7.2.5：
Audition / 8：
The Need for Sound in VR / 8.1：
Recording and Reproduction of Spatial Sound / 8.2：
Synthesis of Spatial Sound / 8.3：
Sound Rendering / 8.3.1：
Head-Related Transfer Function / 8.3.2：
3D Sound Imaging / 8.3.3：
Utilization of Loudspeaker Location / 8.3.4：
Sound Systems for VR / 8.4：
Sound Hardware / 8.4.1：
Sound Engines / 8.4.2：
Touch / 9：
The Need for Touch in VR / 9.1：
Data Gloves / 9.2：
Haptic Rendering / 9.3：
History of Haptic Rendering / 9.3.1：
Haptic Interfaces / 9.4：
Vibrotactile Displays / 9.4.1：
Tactile Displays / 9.4.2：
Kinesthetic Displays / 9.4.3：
Smell and Taste / 10：
The Need for Smells and Tastes in VR / 10.1：
Smell Interfaces / 10.2：
Taste interfaces / 10.3：
Applications / Part IV：
Health Sciences / 11：
Virtual Surgery / 11.1：
Virtual Rehabilitation and Therapy / 11.2：
Physiotherapy / 11.2.1：
Psychological Therapy / 11.2.2：
Virtual Anatomy / 11.3：
Cultural Heritage / 12：
Virtual Campeche and Calakmul / 12.1：
Virtual Dunhuang / 12.2：
Terracotta Soldiers / 12.3：
EU-INCO CAHRISMA and ERATO / 12.4：
EU-IST Archeoguide / 12.5：
EU-IST Lifeplus / 12.6：
Other VR Applications / 13：
Vehicle Simulators / 13.1：
Manufacturing / 13.2：
Entertainment / 13.3：
References
Index
List of Figures
Introduction / 1：
Virtual Reality: The Science of Illusion / 1.1：
41.

電子ブック
ＥＢ
41. Stepping into Virtual Reality
Mario A. A. Gutiérrez, Mario A. A. Gutiérrez, Daniel Thalmann, Frédéric Vexo, Frédéric Vexo, F. Vexo
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
List of Figures
Introduction / 1：
Virtual Reality: The Science of Illusion / 1.1：
Basic Concepts / 1.2：
Immersion / 1.2.1：
Presence / 1.2.2：
A Brief History of Virtual Reality / 1.3：
Reality-Virtuality Continuum / 1.4：
Fundamentals / Part I：
Computer Graphics / 2：
Mathematics / 2.1：
Coordinate Systems / 2.1.1：
Vectors, Transformations and Matrices / 2.1.2：
Angular Representations / 2.1.3：
Projections / 2.1.4：
3D Modeling / 2.2：
Geometric Representations / 2.2.1：
Curves / 2.2.2：
Surfaces / 2.2.3：
3D Rendering / 2.3：
Local Illumination Model / 2.3.1：
Global Illumination Model / 2.3.2：
Textures / 2.3.3：
Rendering Pipeline / 2.3.4：
Computer Animation / 3：
Animation Types: Real Time and Image by Image / 3.1：
Articulated Bodies and Virtual Characters / 3.1.2：
Motion Control Methods / 3.2：
Motion Capture and Performance Animation / 3.3：
Optical Motion Capture Systems / 3.3.1：
Magnetic Trackers and Systems / 3.3.2：
Motion Capture Advantages and Disadvantages / 3.3.3：
Key-Frame Animation / 3.4：
Shape Interpolation and Parametric Keyframe Animation / 3.4.1：
Kochanek-Bartels Spline Interpolation / 3.4.2：
Inverse Kinematics / 3.5：
Motion Retargeting / 3.6：
Procedural Animation / 3.7：
Physics-Based Animation / 3.8：
Behavioral Animation / 3.9：
Virtual Worlds / Part II：
Virtual Characters / 4：
Virtual Humans in Virtual Environments / 4.1：
Character Skinning / 4.2：
Skeleton-Based Deformations / 4.2.1：
Data-Driven Methods / 4.2.2：
Physics-Based Approaches / 4.2.3：
Locomotion / 4.3：
Locomotion Generation / 4.3.1：
PCA-Based Locomotion / 4.3.2：
Virtual Human-Object interaction / 4.4：
Feature Modeling and Smart Objects / 4.4.1：
Grasping / 4.4.2：
Motion Planning / 4.4.3：
Facial Animation / 4.5：
Autonomous Characters / 4.6：
Why Autonomous Virtual Characters? / 4.6.1：
Properties of Autonomous Virtual Characters / 4.6.2：
Behaviors for Autonomous Virtual Characters / 4.6.3：
Crowd Simulation / 4.7：
Architecture of Virtual Reality Systems / 5：
Scene Graph-Based Systems / 5.1：
Semantic Virtual Environments / 5.2：
Generic System Architecture for VR Systems / 5.3：
Distributed Virtual Environments / 5.4：
Communication Architecture / 5.4.1：
Interest Management / 5.4.2：
Concurrency Control / 5.4.3：
Data Replication / 5.4.4：
Load Distribution / 5.4.5：
Mixed Realities / 6：
Augmented Reality and Augmented Virtuality / 6.1：
Tracking Techniques / 6.2：
Markers-Based Tracking / 6.2.1：
Marker-Less Tracking / 6.2.2：
Mixed Reality Tool Kits / 6.3：
Perceiving Virtual Worlds / Part III：
Vision / 7：
Graphical Display Technologies / 7.1：
Cathode-Ray Tubes / 7.1.1：
Liquid Crystal Displays / 7.1.2：
Plasma Displays / 7.1.3：
Virtual Reality Displays / 7.2：
Head-Mounted Displays / 7.2.1：
Fish Tank VR / 7.2.2：
Handheld Displays / 7.2.3：
Large Projection Screens / 7.2.4：
CAVE Systems / 7.2.5：
Audition / 8：
The Need for Sound in VR / 8.1：
Recording and Reproduction of Spatial Sound / 8.2：
Synthesis of Spatial Sound / 8.3：
Sound Rendering / 8.3.1：
Head-Related Transfer Function / 8.3.2：
3D Sound Imaging / 8.3.3：
Utilization of Loudspeaker Location / 8.3.4：
Sound Systems for VR / 8.4：
Sound Hardware / 8.4.1：
Sound Engines / 8.4.2：
Touch / 9：
The Need for Touch in VR / 9.1：
Data Gloves / 9.2：
Haptic Rendering / 9.3：
History of Haptic Rendering / 9.3.1：
Haptic Interfaces / 9.4：
Vibrotactile Displays / 9.4.1：
Tactile Displays / 9.4.2：
Kinesthetic Displays / 9.4.3：
Smell and Taste / 10：
The Need for Smells and Tastes in VR / 10.1：
Smell Interfaces / 10.2：
Taste interfaces / 10.3：
Applications / Part IV：
Health Sciences / 11：
Virtual Surgery / 11.1：
Virtual Rehabilitation and Therapy / 11.2：
Physiotherapy / 11.2.1：
Psychological Therapy / 11.2.2：
Virtual Anatomy / 11.3：
Cultural Heritage / 12：
Virtual Campeche and Calakmul / 12.1：
Virtual Dunhuang / 12.2：
Terracotta Soldiers / 12.3：
EU-INCO CAHRISMA and ERATO / 12.4：
EU-IST Archeoguide / 12.5：
EU-IST Lifeplus / 12.6：
Other VR Applications / 13：
Vehicle Simulators / 13.1：
Manufacturing / 13.2：
Entertainment / 13.3：
References
Index
List of Figures
Introduction / 1：
Virtual Reality: The Science of Illusion / 1.1：
42.

電子ブック
ＥＢ
42. Zeta Functions of Groups and Rings
Marcus du Sautoy, F. Takens, Luke Woodward
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
A Brief History of Zeta Functions / 1.1：
Euler, Riemann / 1.1.1：
Dirichlet / 1.1.2：
Dedekind / 1.1.3：
Artin, Weil / 1.1.4：
Birch, Swinnerton-Dyer / 1.1.5：
Zeta Functions of Groups / 1.2：
Zeta Functions of Algebraic Groups / 1.2.1：
Zeta Functions of Rings / 1.2.2：
Local Functional Equations / 1.2.3：
Uniformity / 1.2.4：
Analytic Properties / 1.2.5：
p-Adic Integrals / 1.3：
Natural Boundaries of Euler Products / 1.4：
Nilpotent Groups: Explicit Examples / 2：
Calculating Zeta Functions of Groups / 2.1：
Calculating Zeta Functions of Lie Rings / 2.2：
Constructing the Cone Integral / 2.2.1：
Resolution / 2.2.2：
Evaluating Monomial Integrals / 2.2.3：
Summing the Rational Functions / 2.2.4：
Explicit Examples / 2.3：
Free Abelian Lie Rings / 2.4：
Heisenberg Lie Ring and Variants / 2.5：
Grenham's Lie Rings / 2.6：
Free Class-2 Nilpotent Lie Rings / 2.7：
Three Generators / 2.7.1：
n Generators / 2.7.2：
The 'Elliptic Curve Example' / 2.8：
Other Class Two Examples / 2.9：
The Maximal Class Lie Ring M[subscript 3] and Variants / 2.10：
Lie Rings with Large Abelian Ideals / 2.11：
F[subscript 3,2] / 2.12：
The Maximal Class Lie Rings M[subscript 4] and Fil[subscript 4] / 2.13：
Nilpotent Lie Algebras of Dimension [less than or equal] 6 / 2.14：
Nilpotent Lie Algebras of Dimension 7 / 2.15：
Soluble Lie Rings / 3：
Proof of Theorem 3.1 / 3.1：
Choosing a Basis for tr[subscript n](Z) / 3.2.1：
Determining the Conditions / 3.2.2：
Constructing the Zeta Function / 3.2.3：
Transforming the Conditions / 3.2.4：
Deducing the Functional Equation / 3.2.5：
Variations / 3.3：
Quotients of tr[subscript n](Z) / 3.4.1：
Counting All Subrings / 3.4.2：
Algebraic Groups / 4：
Nilpotent Groups and Lie Rings / 4.3：
The Conjecture / 4.4：
Special Cases Known to Hold / 4.5：
A Special Case of the Conjecture / 4.6：
Projectivisation / 4.6.1：
Manipulating the Cone Sums / 4.6.2：
Cones and Schemes / 4.6.4：
Quasi-Good Sets / 4.6.5：
Quasi-Good Sets: The Monomial Case / 4.6.6：
Applications of Conjecture 4.5 / 4.7：
Counting Subrings and p-Subrings / 4.8：
Counting Ideals and p-Ideals / 4.9：
Heights, Cocentral Bases and the [pi]-Map / 4.9.1：
Property ([dagger]) / 4.9.2：
Lie Rings Without ([dagger]) / 4.9.3：
Natural Boundaries I: Theory / 5：
A Natural Boundary for [zeta]GSp[subscript 6] (s) / 5.1：
Natural Boundaries for Euler Products / 5.2：
Practicalities / 5.2.1：
Distinguishing Types I, II and III / 5.2.2：
Avoiding the Riemann Hypothesis / 5.3：
All Local Zeros on or to the Left of R(s) = [beta] / 5.4：
Using Riemann Zeros / 5.4.1：
Avoiding Rational Independence of Riemann Zeros / 5.4.2：
Continuation with Finitely Many Riemann Zeta Functions / 5.4.3：
Infinite Products of Riemann Zeta Functions / 5.4.4：
Natural Boundaries II: Algebraic Groups / 6：
G = GO[subscript 2l+1] of Type B[subscript l] / 6.1：
G = GSp[subscript 2l] of Type C[subscript l] or G = GO[superscript +][subscript 2l] of Type D[subscript l] / 6.3：
G = GSp[subscript 2l] of Type C[subscript l] / 6.3.1：
G = GO[superscript + subscript 2l] of Type D[subscript l] / 6.3.2：
Natural Boundaries III: Nilpotent Groups / 7：
Zeta Functions with Meromorphic Continuation / 7.1：
Zeta Functions with Natural Boundaries / 7.3：
Type I / 7.3.1：
Type II / 7.3.2：
Type III / 7.3.3：
Other Types / 7.4：
Types IIIa and IIIb / 7.4.1：
Types IV, V and VI / 7.4.2：
Large Polynomials / A：
H[superscript 4], Counting Ideals / A.1：
g[subscript 6,4], Counting All Subrings / A.2：
T[subscript 4], Counting All Subrings / A.3：
L[subscript (3,2,2)], Counting Ideals / A.4：
G[subscript 3] x g[subscript 5,3], Counting Ideals / A.5：
g[subscript 6,12], Counting All Subrings / A.6：
g[subscript 1357G], Counting Ideals / A.7：
g[subscript 1457A], Counting Ideals / A.8：
g[subscript 1457B], Counting Ideals / A.9：
tr[subscript 6](Z), Counting Ideals / A.10：
tr[subscript 7](Z), Counting Ideals / A.11：
Factorisation of Polynomials Associated to Classical Groups / B：
References
Index
Index of Notation
Introduction / 1：
A Brief History of Zeta Functions / 1.1：
Euler, Riemann / 1.1.1：
43.

電子ブック
ＥＢ
43. The Testing Network
Pierre Henry
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
The Project / 1：
Purpose and Contents of This Book / 1.1：
The Signs / 1.1.1：
Testing Revisited / 1.1.2：
Introduction to Testing / 2：
Testing Challenges / 2.1：
Business and IT / 2.1.1：
The Human Factor / 2.1.2：
Old and New Worlds / 2.1.3：
Banking Platform Renewal / 2.1.4：
Complex Testing / 2.1.5：
Global Testing / 2.1.6：
The Value of Testing / 2.1.7：
The Significance of Requirements / 2.2：
What is a Requirement? / 2.2.1：
Meeting the Unknown / 2.2.2：
Characteristics of Requirements / 2.2.3：
Requirements Elicitation / 2.2.4：
Main Problems with Requirements / 2.2.5：
Risks Associated with Requirements / 2.2.6：
Recommendations / 2.2.7：
The Nonconformity Problem / 2.3：
How Defects are Born / 2.3.1：
Nonconformity to Standards and Rules / 2.3.2：
Aging of Product Components / 2.3.3：
Environmental Changes / 2.3.4：
Outdated Tests / 2.3.5：
Conformity Assessment / 2.3.6：
The Costs of the Nonconformity / 2.3.7：
Mission Impossible? / 2.3.8：
Complexity / 2.3.9：
Test Artifacts / 2.4：
Classification of Test Artifacts / 2.4.1：
Information Life Cycle / 2.4.2：
Data Life Cycle / 2.4.3：
Testing Predictability / 2.5：
Business Rules / 2.5.1：
Business Rules Management (BRM) / 2.5.2：
Software Reliability / 2.5.3：
Software Quality Criteria [ISO 9126] / 2.5.4：
Software Development Methods / 2.6：
V-Model / 2.6.1：
Agile Software Development / 2.6.2：
What is Agility? / 2.6.3：
Iterative Development / 2.6.4：
Waterfall and Agile Methods Compared / 2.6.5：
Staged Delivery Method / 2.6.6：
Selection of the Right Development Method / 2.6.7：
The Testing Value Chain (TVC) / 2.7：
The SO Organization / 2.7.1：
Quality Gates / 2.7.2：
Test Methods and Technology / 3：
Different Views of Testing / 3.1：
Test Methods - Overview / 3.1.1：
Dynamic Test Methods / 3.2：
Structural Testing (White Box) / 3.2.1：
Functional Testing (Black Box) / 3.2.2：
Para-Functional Testing / 3.2.3：
Static Test Methods / 3.3：
Inspections / 3.3.1：
Reviews / 3.3.2：
Static Analysis (SA) / 3.3.3：
Design Verification (DV) / 3.3.4：
Ways to Test / 3.4：
Planned Testing (PT) / 3.4.1：
Exploratory Testing (ET) / 3.4.2：
Performance Testing (PT) / 3.4.3：
Rapid Testing / 3.4.4：
Regression Testing (RT) / 3.4.5：
Extended Random Regression Testing (ERRT) / 3.4.6：
Scenario Testing / 3.4.7：
SOA Testing / 3.4.8：
Test Technology / 3.4.9：
Model-Based Testing (MBT) / 3.5.1：
Model-Based Integration and Testing (MBI&T) / 3.5.2：
Model Checking / 3.5.3：
Test Automation / 3.5.4：
The Test Domain / 4：
Topology of the Test Domain / 4.1：
Environmental Factors / 4.1.1：
Business Pressure on IT / 4.1.2：
IT Technology / 4.1.3：
Mainframe as the Foundation of the IT Infrastructure / 4.1.4：
A Complex Network / 4.1.5：
Multi-Tier Architecture / 4.1.6：
Backward and Lateral Compatibility / 4.1.7：
Multi-Layered Test Domain / 4.1.8：
SOA / 4.1.9：
Data and Time Aspects / 4.2：
Master Data Management (MDM) / 4.2.1：
Business Data Categorization / 4.2.2：
Business Data Growth / 4.2.3：
Test Data Management (TDM) / 4.2.4：
Business Data Lifecycle / 4.2.5：
Bi-Temporality / 4.2.7：
Causality Violation / 4.2.8：
Other Time Aspects / 4.2.9：
Table-Driven Systems (TDS) / 4.3：
Tabular Representation of Data / 4.3.1：
Characteristics of Tables / 4.3.2：
Usage of Tables / 4.3.3：
Specification Tables / 4.3.4：
Transient Tables and Data / 4.3.5：
Relational Databases / 4.3.6：
TDS Testing / 4.3.7：
Critical Technical Parameters / 4.4：
Definition / 4.4.1：
Examples of CTPs / 4.4.2：
Test Processes / 5：
The Testing Network - Process Technology / 5.1：
What is a Process? / 5.1.1：
Process Networks / 5.1.2：
Test Process Landscape / 5.1.3：
Core Testing Processes / 5.2：
Overview / 5.2.1：
Test Strategy Elaboration / 5.2.2：
Test Planning / 5.2.3：
Test Objectives Definition / 5.2.4：
Test Design Techniques / 5.2.5：
Test Artifacts Management / 5.2.6：
TC Design / 5.2.7：
TC Review / 5.2.8：
TC Implementation / 5.2.9：
TC Archiving / 5.2.10：
Test Set Build / 5.2.11：
Test Runs / 5.2.12：
Test Results Analysis / 5.2.13：
Incident and Problem Management (IPM) / 5.2.14：
Incident Tracking and Channeling (ITC) / 5.2.15：
Compliance Testing Process (CTP) / 5.2.16：
Distributed Testing / 5.2.17：
Test Support Processes / 5.3：
Document Management / 5.3.1：
Information Channeling / 5.3.2：
Training/Skills Improvement / 5.3.3：
Software Testing Certification / 5.3.4：
Test Neighbor Processes / 5.4：
Specifications Review / 5.4.1：
Software Package Build / 5.4.2：
Software Build Manager Role / 5.4.3：
Software Package Installation / 5.4.4：
Release Management / 5.4.5：
Test Data Management / 5.4.6：
Risk Management / 5.4.7：
Test Platforms and Tools / 6：
The Integrated Test Platform / 6.1：
Benefits of an ITP / 6.1.1：
Test Platform Management / 6.1.2：
TD for QC / 6.2：
TD Staffing / 6.2.1：
TD Administration / 6.2.2：
TD Modules / 6.2.3：
Requirements Module / 6.2.4：
TestPlan Module / 6.2.5：
TestLab Module / 6.2.6：
Defect Module / 6.2.7：
Analysis Function / 6.2.8：
Export Function / 6.2.9：
Traceability Function / 6.2.10：
Email and Workflow / 6.2.11：
Document Generator / 6.2.12：
Other Functions / 6.2.13：
Dashboard / 6.2.14：
The Leading Commercial SA Tools / 6.3：
The Leading Commercial Testing Tools / 6.4：
The Analysis of Defect Root Causes / 7：
The Methodological Approach / 7.1：
Defect Classification Schemes / 7.1.1：
Orthogonal Default Classification (ODC) / 7.1.2：
Situational Analysis / 7.1.3：
Ishikawa Diagram / 7.1.4：
Limitations of Cause and Effect Models / 7.1.5：
Causal Chains Explained / 7.2：
Identifying Problem Sources / 7.2.1：
Test Perimeter / 7.2.2：
Causal Chain Examples / 7.2.3：
Data-Dependent Testing / 7.3：
Database Testing / 7.3.1：
SQL Tuning Sets (STSs) / 7.3.2：
Bi-temporality Issues / 7.3.3：
Data State / 7.3.4：
Frequent Causes of Problems / 7.3.6：
Deadlock / 7.4.1：
Fixes / 7.4.2：
Interfaces / 7.4.3：
Memory Leaks / 7.4.4：
Metadata / 7.4.5：
Network-Centric Applications / 7.4.6：
Network problems / 7.4.7：
SW Package Build / 7.4.8：
Wrong Parameters / 7.4.9：
Software Aging / 7.5：
Causes of Software Decay / 7.5.1：
Symptoms of Code Decay / 7.5.2：
Risk factors Related to Software Aging / 7.5.3：
The Cost of Software Aging / 7.5.4：
An Analysis Tool for Aging Software / 7.5.5：
The Investigation of a Technical Problem / 7.6：
Technical Processes (TPs) / 7.6.1：
Measuring Test Efforts / 8：
Overall Project Progress Measurement / 8.1：
EVA's Power / 8.1.1：
EVA's Benefits / 8.1.2：
Test Progress Reporting (TPR) / 8.2：
Technical Measurement / 8.2.1：
Test Monitoring / 8.2.2：
Implementing TPR / 8.2.3：
Test Quality Measurement / 8.2.4：
Test Progress Measurement / 8.2.5：
Test Progress Horizon / 8.2.6：
Test Progress Prediction / 8.2.7：
Test Progress Reporting with TD/QC / 8.2.8：
Central Reporting with TD/QC / 8.2.9：
Test Issues / 9：
Risk Management in the Enterprise IT Project / 9.1：
The Scope of IT Risk Management / 9.1.2：
Risk-Based Testing / 9.1.3：
Limitations on Risk Management / 9.1.4：
Risks Related to Compliance / 9.1.5：
Implementing Sarbanes-Oxley in TestDirector / 9.1.6：
The Impact of International Regulations on IT / 9.1.7：
Recommended Lectures / 9.1.8：
IPC Management / 9.2：
Detecting Danger Areas in the Project / 9.2.1：
Crisis Management / 9.2.2：
Conclusion
Appendices
Useful Aids / A：
Templates / A.1：
Data Profile / A.1.1：
Project Status / A.1.2：
Release Flash / A.1.3：
Top-Down Process Modelling / A.1.4：
Software Test Documentation (IEEE Standard) / A.1.5：
Checklists / A.2：
Cause-Effect Checklist / A.2.1：
Code Review Checklist / A.2.2：
Functionality Checklist / A.2.3：
How to Create Component Test Cases / A.2.4：
Investigation of a Technical Problem / A.2.5：
ODC Triggers Usage / A.2.6：
Process Design Parameters / A.2.7：
Requirements Definition / A.2.8：
Test Case Conformity Checklist / A.2.9：
Test Case Review Checklist / A.2.10：
Test Findings / A.2.11：
Sarbanes-Oxley Compliance / B：
Test Platforms and Tool Providers / C：
Acronyms / D：
Glossary
Bibliography
Links
Index
Acknowledgements
Copyrights and Trademarks
The Project / 1：
Purpose and Contents of This Book / 1.1：
The Signs / 1.1.1：
44.

電子ブック
ＥＢ
44. The Testing Network
Pierre Henry
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
The Project / 1：
Purpose and Contents of This Book / 1.1：
The Signs / 1.1.1：
Testing Revisited / 1.1.2：
Introduction to Testing / 2：
Testing Challenges / 2.1：
Business and IT / 2.1.1：
The Human Factor / 2.1.2：
Old and New Worlds / 2.1.3：
Banking Platform Renewal / 2.1.4：
Complex Testing / 2.1.5：
Global Testing / 2.1.6：
The Value of Testing / 2.1.7：
The Significance of Requirements / 2.2：
What is a Requirement? / 2.2.1：
Meeting the Unknown / 2.2.2：
Characteristics of Requirements / 2.2.3：
Requirements Elicitation / 2.2.4：
Main Problems with Requirements / 2.2.5：
Risks Associated with Requirements / 2.2.6：
Recommendations / 2.2.7：
The Nonconformity Problem / 2.3：
How Defects are Born / 2.3.1：
Nonconformity to Standards and Rules / 2.3.2：
Aging of Product Components / 2.3.3：
Environmental Changes / 2.3.4：
Outdated Tests / 2.3.5：
Conformity Assessment / 2.3.6：
The Costs of the Nonconformity / 2.3.7：
Mission Impossible? / 2.3.8：
Complexity / 2.3.9：
Test Artifacts / 2.4：
Classification of Test Artifacts / 2.4.1：
Information Life Cycle / 2.4.2：
Data Life Cycle / 2.4.3：
Testing Predictability / 2.5：
Business Rules / 2.5.1：
Business Rules Management (BRM) / 2.5.2：
Software Reliability / 2.5.3：
Software Quality Criteria [ISO 9126] / 2.5.4：
Software Development Methods / 2.6：
V-Model / 2.6.1：
Agile Software Development / 2.6.2：
What is Agility? / 2.6.3：
Iterative Development / 2.6.4：
Waterfall and Agile Methods Compared / 2.6.5：
Staged Delivery Method / 2.6.6：
Selection of the Right Development Method / 2.6.7：
The Testing Value Chain (TVC) / 2.7：
The SO Organization / 2.7.1：
Quality Gates / 2.7.2：
Test Methods and Technology / 3：
Different Views of Testing / 3.1：
Test Methods - Overview / 3.1.1：
Dynamic Test Methods / 3.2：
Structural Testing (White Box) / 3.2.1：
Functional Testing (Black Box) / 3.2.2：
Para-Functional Testing / 3.2.3：
Static Test Methods / 3.3：
Inspections / 3.3.1：
Reviews / 3.3.2：
Static Analysis (SA) / 3.3.3：
Design Verification (DV) / 3.3.4：
Ways to Test / 3.4：
Planned Testing (PT) / 3.4.1：
Exploratory Testing (ET) / 3.4.2：
Performance Testing (PT) / 3.4.3：
Rapid Testing / 3.4.4：
Regression Testing (RT) / 3.4.5：
Extended Random Regression Testing (ERRT) / 3.4.6：
Scenario Testing / 3.4.7：
SOA Testing / 3.4.8：
Test Technology / 3.4.9：
Model-Based Testing (MBT) / 3.5.1：
Model-Based Integration and Testing (MBI&T) / 3.5.2：
Model Checking / 3.5.3：
Test Automation / 3.5.4：
The Test Domain / 4：
Topology of the Test Domain / 4.1：
Environmental Factors / 4.1.1：
Business Pressure on IT / 4.1.2：
IT Technology / 4.1.3：
Mainframe as the Foundation of the IT Infrastructure / 4.1.4：
A Complex Network / 4.1.5：
Multi-Tier Architecture / 4.1.6：
Backward and Lateral Compatibility / 4.1.7：
Multi-Layered Test Domain / 4.1.8：
SOA / 4.1.9：
Data and Time Aspects / 4.2：
Master Data Management (MDM) / 4.2.1：
Business Data Categorization / 4.2.2：
Business Data Growth / 4.2.3：
Test Data Management (TDM) / 4.2.4：
Business Data Lifecycle / 4.2.5：
Bi-Temporality / 4.2.7：
Causality Violation / 4.2.8：
Other Time Aspects / 4.2.9：
Table-Driven Systems (TDS) / 4.3：
Tabular Representation of Data / 4.3.1：
Characteristics of Tables / 4.3.2：
Usage of Tables / 4.3.3：
Specification Tables / 4.3.4：
Transient Tables and Data / 4.3.5：
Relational Databases / 4.3.6：
TDS Testing / 4.3.7：
Critical Technical Parameters / 4.4：
Definition / 4.4.1：
Examples of CTPs / 4.4.2：
Test Processes / 5：
The Testing Network - Process Technology / 5.1：
What is a Process? / 5.1.1：
Process Networks / 5.1.2：
Test Process Landscape / 5.1.3：
Core Testing Processes / 5.2：
Overview / 5.2.1：
Test Strategy Elaboration / 5.2.2：
Test Planning / 5.2.3：
Test Objectives Definition / 5.2.4：
Test Design Techniques / 5.2.5：
Test Artifacts Management / 5.2.6：
TC Design / 5.2.7：
TC Review / 5.2.8：
TC Implementation / 5.2.9：
TC Archiving / 5.2.10：
Test Set Build / 5.2.11：
Test Runs / 5.2.12：
Test Results Analysis / 5.2.13：
Incident and Problem Management (IPM) / 5.2.14：
Incident Tracking and Channeling (ITC) / 5.2.15：
Compliance Testing Process (CTP) / 5.2.16：
Distributed Testing / 5.2.17：
Test Support Processes / 5.3：
Document Management / 5.3.1：
Information Channeling / 5.3.2：
Training/Skills Improvement / 5.3.3：
Software Testing Certification / 5.3.4：
Test Neighbor Processes / 5.4：
Specifications Review / 5.4.1：
Software Package Build / 5.4.2：
Software Build Manager Role / 5.4.3：
Software Package Installation / 5.4.4：
Release Management / 5.4.5：
Test Data Management / 5.4.6：
Risk Management / 5.4.7：
Test Platforms and Tools / 6：
The Integrated Test Platform / 6.1：
Benefits of an ITP / 6.1.1：
Test Platform Management / 6.1.2：
TD for QC / 6.2：
TD Staffing / 6.2.1：
TD Administration / 6.2.2：
TD Modules / 6.2.3：
Requirements Module / 6.2.4：
TestPlan Module / 6.2.5：
TestLab Module / 6.2.6：
Defect Module / 6.2.7：
Analysis Function / 6.2.8：
Export Function / 6.2.9：
Traceability Function / 6.2.10：
Email and Workflow / 6.2.11：
Document Generator / 6.2.12：
Other Functions / 6.2.13：
Dashboard / 6.2.14：
The Leading Commercial SA Tools / 6.3：
The Leading Commercial Testing Tools / 6.4：
The Analysis of Defect Root Causes / 7：
The Methodological Approach / 7.1：
Defect Classification Schemes / 7.1.1：
Orthogonal Default Classification (ODC) / 7.1.2：
Situational Analysis / 7.1.3：
Ishikawa Diagram / 7.1.4：
Limitations of Cause and Effect Models / 7.1.5：
Causal Chains Explained / 7.2：
Identifying Problem Sources / 7.2.1：
Test Perimeter / 7.2.2：
Causal Chain Examples / 7.2.3：
Data-Dependent Testing / 7.3：
Database Testing / 7.3.1：
SQL Tuning Sets (STSs) / 7.3.2：
Bi-temporality Issues / 7.3.3：
Data State / 7.3.4：
Frequent Causes of Problems / 7.3.6：
Deadlock / 7.4.1：
Fixes / 7.4.2：
Interfaces / 7.4.3：
Memory Leaks / 7.4.4：
Metadata / 7.4.5：
Network-Centric Applications / 7.4.6：
Network problems / 7.4.7：
SW Package Build / 7.4.8：
Wrong Parameters / 7.4.9：
Software Aging / 7.5：
Causes of Software Decay / 7.5.1：
Symptoms of Code Decay / 7.5.2：
Risk factors Related to Software Aging / 7.5.3：
The Cost of Software Aging / 7.5.4：
An Analysis Tool for Aging Software / 7.5.5：
The Investigation of a Technical Problem / 7.6：
Technical Processes (TPs) / 7.6.1：
Measuring Test Efforts / 8：
Overall Project Progress Measurement / 8.1：
EVA's Power / 8.1.1：
EVA's Benefits / 8.1.2：
Test Progress Reporting (TPR) / 8.2：
Technical Measurement / 8.2.1：
Test Monitoring / 8.2.2：
Implementing TPR / 8.2.3：
Test Quality Measurement / 8.2.4：
Test Progress Measurement / 8.2.5：
Test Progress Horizon / 8.2.6：
Test Progress Prediction / 8.2.7：
Test Progress Reporting with TD/QC / 8.2.8：
Central Reporting with TD/QC / 8.2.9：
Test Issues / 9：
Risk Management in the Enterprise IT Project / 9.1：
The Scope of IT Risk Management / 9.1.2：
Risk-Based Testing / 9.1.3：
Limitations on Risk Management / 9.1.4：
Risks Related to Compliance / 9.1.5：
Implementing Sarbanes-Oxley in TestDirector / 9.1.6：
The Impact of International Regulations on IT / 9.1.7：
Recommended Lectures / 9.1.8：
IPC Management / 9.2：
Detecting Danger Areas in the Project / 9.2.1：
Crisis Management / 9.2.2：
Conclusion
Appendices
Useful Aids / A：
Templates / A.1：
Data Profile / A.1.1：
Project Status / A.1.2：
Release Flash / A.1.3：
Top-Down Process Modelling / A.1.4：
Software Test Documentation (IEEE Standard) / A.1.5：
Checklists / A.2：
Cause-Effect Checklist / A.2.1：
Code Review Checklist / A.2.2：
Functionality Checklist / A.2.3：
How to Create Component Test Cases / A.2.4：
Investigation of a Technical Problem / A.2.5：
ODC Triggers Usage / A.2.6：
Process Design Parameters / A.2.7：
Requirements Definition / A.2.8：
Test Case Conformity Checklist / A.2.9：
Test Case Review Checklist / A.2.10：
Test Findings / A.2.11：
Sarbanes-Oxley Compliance / B：
Test Platforms and Tool Providers / C：
Acronyms / D：
Glossary
Bibliography
Links
Index
Acknowledgements
Copyrights and Trademarks
The Project / 1：
Purpose and Contents of This Book / 1.1：
The Signs / 1.1.1：
45.

電子ブック
ＥＢ
45. FinFETs and other multi-gate transistors (: electronic bk)
Jean-Pierre Colinge, editor
出版情報: [New York] : Springer, [20--]  1 online resource (xiii, 339 p.)
シリーズ名: Series on Integrated Circuits and Systems
所蔵情報: loading…
目次情報: 続きを見る
Preface
Table of Content
Contributors
The SOI MOSFET: from Single Gate to Multigate / 1：
MOSFET scaling and Moore's law / 1.1：
Short-Channel Effects / 1.2：
Gate Geometry and Electrostatic Integrity / 1.3：
A Brief History of Multiple-Gate MOSFETs / 1.4：
Single-gate SOI MOSFETs / 1.4.1：
Double-gate SOI MOSFETs / 1.4.2：
Triple-gate SOI MOSFETs / 1.4.3：
Surrounding-gate (quadruple-gate) SOI MOSFETs / 1.4.4：
Other multigate MOSFET structures / 1.4.5：
Multigate MOSFET memory devices / 1.4.6：
Multigate MOSFET Physics / 1.5：
Classical physics / 1.5.1：
Natural length and short-channel effects / 1.5.1.1：
Current drive / 1.5.1.2：
Corner effect / 1.5.1.3：
Quantum effects / 1.5.2：
Volume inversion / 1.5.2.1：
Mobility effects / 1.5.2.2：
Threshold voltage / 1.5.2.3：
Inter-subband scattering / 1.5.2.4：
References
Multigate MOSFET Technology / 2：
Introduction / 2.1：
Active Area: Fins / 2.2：
Fin Width / 2.2.1：
Fin Height and Fin Pitch / 2.2.2：
Fin Surface Crystal Orientation / 2.2.3：
Fin Surface Preparation / 2.2.4：
Fins on Bulk Silicon / 2.2.5：
Nano-wires and Self-Assembled Wires / 2.2.6：
Gate Stack / 2.3：
Gate Patterning / 2.3.1：
Threshold Voltage and Gate Workfunction Requirements / 2.3.2：
Polysilicon Gate / 2.3.2.1：
Metal Gate / 2.3.2.2：
Tunable Workfunction Metal Gate / 2.3.2.3：
Gate EWF and Gate Induced Drain Leakage (GIDL) / 2.3.3：
Independently Controlled Gates / 2.3.4：
Source/Drain Resistance and Capacitance / 2.4：
Doping the Thin Fins / 2.4.1：
Junction Depth / 2.4.2：
Parasitic Resistance/Capacitance and Raised Source and Drain Structure / 2.4.3：
Mobility and Strain Engineering / 2.5：
Wafer Bending Experiment / 2.5.1：
Nitride Stress Liners / 2.5.3：
Embedded SiGe and SiC Source and Drain / 2.5.4：
Local Strain from Gate Electrode / 2.5.5：
Substrate Strain: Strained Silicon on Insulator / 2.5.6：
Contacts to the Fins / 2.6：
Dumbbell source and drain contact / 2.6.1：
Saddle contact / 2.6.2：
Contact to merged fins / 2.6.3：
Acknowledgments
BSIM-CMG: A Compact Model for Multi-Gate Transistors / 3：
Framework for Multigate FET Modeling / 3.1：
Multigate Models: BSIM-CMG and BSIM-IMG / 3.3：
The BSIM-CMG Model / 3.3.1：
The BSIM-IMG Model / 3.3.2：
BSIM-CMG / 3.4：
Core Model / 3.4.1：
Surface Potential Model / 3.4.1.1：
I-V Model / 3.4.1.2：
C-V Model / 3.4.1.3：
Modeling Physical Effects of Real Devices / 3.4.2：
Quantum Mechanical Effects (QME) / 3.4.2.1：
Short-channel Effects (SCE) / 3.4.2.2：
Experimental Verification / 3.4.3：
Surface Potential of independent DG-FET / 3.5：
BSIM-IMG features / 3.5.2：
Summary / 3.6：
Physics of the Multigate MOS System / 4：
Device electrostatics / 4.1：
Double gate MOS system / 4.2：
Modeling assumptions / 4.2.1：
Gate voltage effect / 4.2.2：
Semiconductor thickness effect / 4.2.3：
Asymmetry effects / 4.2.4：
Oxide thickness effect / 4.2.5：
Electron tunnel current / 4.2.6：
Two-dimensional confinement / 4.3：
Mobility in Multigate MOSFETs / 5：
Double-Gate MOSFETs and FinFETs / 5.1：
Phonon-limited mobility / 5.2.1：
Confinement of acoustic phonons / 5.2.2：
Interface roughness scattering / 5.2.3：
Coulomb scattering / 5.2.4：
Temperature Dependence of Mobility / 5.2.5：
Symmetrical and Asymmetrical Operation of DGSOI FETs / 5.2.6：
Crystallographic orientation / 5.2.7：
High-k dielectrics / 5.2.8：
Strained DGSOI devices / 5.2.9：
Silicon multiple-gate nanowires / 5.2.10：
Electrostatic description of Si nanowires / 5.3.1：
Electron transport in Si nanowires / 5.3.3：
Surface roughness / 5.3.4：
Experimental results and conclusions / 5.3.5：
Radiation Effects in Advanced Single- and Multi-Gate SOI MOSFETs / 6：
A brief history of radiation effects in SOI / 6.1：
Total Ionizing Dose Effects / 6.2：
A brief overview of Total Ionizing Dose effects / 6.2.1：
Advanced Single-Gate FDSOI devices / 6.2.2：
Description of Advanced FDSOI Devices / 6.2.2.1：
Front-gate threshold voltage shift / 6.2.2.2：
Single-transistor latch / 6.2.2.3：
Advanced Multi-Gate devices / 6.2.3：
Devices and process description / 6.2.3.1：
Single-Event Effects / 6.2.3.2：
Background / 6.3.1：
Effect of ion track diameter in nanoscale devices / 6.3.2：
Transient measurements on single-gate and FinFET SOI transistors / 6.3.3：
Scaling effects / 6.3.4：
Multi-Gate MOSFET Circuit Design / 7：
Digital Circuit Design / 7.1：
Impact of device performance on digital circuit design / 7.2.1：
Large-scale digital circuits / 7.2.2：
Leakage-performance trade off and energy dissipation / 7.2.3：
Multi-V[subscript T] devices and mixed-V[subscript T] circuits / 7.2.4：
High-temperature circuit operation / 7.2.5：
SRAM design / 7.2.6：
Analog Circuit Design / 7.3：
Device figures of merit and technology related design issues / 7.3.1：
Transconductance / 7.3.1.1：
Intrinsic transistor gain / 7.3.1.2：
Matching behavior / 7.3.1.3：
Flicker noise / 7.3.1.4：
Transit and maximum oscillation frequency / 7.3.1.5：
Self-heating / 7.3.1.6：
Charge trapping in high-k dielectrics / 7.3.1.7：
Design of analog building blocks / 7.3.2：
V-[subscript T]-based current reference circuit / 7.3.2.1：
Bandgap voltage reference / 7.3.2.2：
Operational amplifier / 7.3.2.3：
Comparator / 7.3.2.4：
Mixed-signal aspects / 7.3.3：
Current steering DAC / 7.3.3.1：
Successive approximation ADC / 7.3.3.2：
RF circuit design / 7.3.4：
SoC Design and Technology Aspects / 7.4：
Index
Preface
Table of Content
Contributors
46.

電子ブック
ＥＢ
46. Minimalism
Hartmut Obendorf
出版情報: Springer eBooks Computer Science , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
Machine Beauty = Power + Simplicity / 1.1.1：
Reduction-Give Up or Gain? / 1.1.2：
Minimalism: Borrowing the Extreme from the Arts / 1.1.3：
Minimalism in a Nutshell / 1.2：
Four Notions of Minimalism, Their Relationship, and Design / 1.2.1：
An Example Analysis Using Notions of Minimalism / 1.2.2：
Minimalism, Products, and Processes / 1.2.3：
Defining the Scope of Minimalist Terminology / 1.3：
Minimalism-Mathematic Minimalism / 1.3.1：
Minimalism-Linguistic Minimalism / 1.3.2：
Minimalism-Documentation Minimalism / 1.3.3：
Minimalism-Folk Minimalism / 1.3.4：
Finding a Minimalism for Interaction Design / 1.4：
References
Defining Minimalism / Part II：
In Search of "Minimalism"-Roving in Art, Music and Elsewhere / 2：
Minimalism in the Arts / 2.1：
Rauschenberg, Klein and Newman: Birth of Minimal Painting / 2.1.1：
Reinhardt: Art-as-Art / 2.1.2：
Stella: To See What Is There / 2.1.3：
Radical Minimalism and Post-Minimalist Painting / 2.1.4：
Judd, Andre, Flavin, and Morris: Minimal Objects / 2.1.5：
LeWitt: Minimal Structure in Minimalist Sculpture / 2.1.6：
Post-Minimalist Sculpture / 2.1.7：
Minimal Art: Art as Art or Cooperative Sense-Building? / 2.1.8：
Minimalism in Music / 2.2：
The Origins of Minimal Music / 2.2.1：
Terry Riley / 2.2.2：
La Monte Young / 2.2.3：
Philip Glass / 2.2.4：
Steve Reich / 2.2.5：
Summarizing Minimalism in Music / 2.2.6：
Minimalism Found Elsewhere / 2.3：
Literary Minimalism: Roots in Hemingway, Archetype in Carver / 2.3.1：
Minimalism in Architecture / 2.3.2：
Minimalism in Typography / 2.3.3：
Homing in on Minimalism: Summarizing the Art perspective / 2.4：
Minimality of Means / 2.4.1：
Minimality of Meaning / 2.4.2：
Minimality of Structure / 2.4.3：
Use of Patterns / 2.4.4：
Involvement of the recipient / 2.4.5：
The Minimalist Perspective and Criticism / 2.4.6：
Minimalism for Interaction Design: a Proposal / 3：
Meanings of Minimalism in HCI-A Transfer from the Arts / 3.1：
Defining Four Notions of the Minimal for Interaction Design / 3.2：
Minimal Functionality for User Interfaces / 3.2.1：
Minimal Structure for User Interfaces / 3.2.2：
Minimal Architecture for User Interfaces / 3.2.3：
Minimal Composition for User Interfaces / 3.2.4：
A Minimalist Terminology for the Design of Interactive Systems / 3.2.5：
Summary / 3.3：
Rethinking Minimalism / Part III：
Minimalism, Industrial Design and HCI / 4：
Following the Roots in Industrial Design / 4.1：
Standards in Interaction Design and Minimalism / 4.2：
HCI Lore and Minimalism / 4.3：
Rules of Noble Metal and Minimalism / 4.3.1：
Interface Guidelines and Minimalism / 4.3.2：
Discussion / 4.3.3：
Minimalism, Simplicity and Rules of Design / 4.4：
Deep Design: Causes of Clutter and Excise / 5.1：
Visibility of Interface Elements / 5.2：
Access Structure / 5.3：
Minimalism and Consistency / 5.4：
Minimalism and Conceptions of Design / 5.5：
Minimalism and Simplicity / 5.6：
Limits of the Notion of Simplicity / 5.6.1：
Revisiting the Four Notions of Minimalism / 5.7：
Applying Minimalism / Part IV：
Detecting the Minimal / 6：
Functional Minimalism / 6.1：
Cutting Edges / 6.1.1：
Apple GarageBand (i-Series 1) / 6.1.2：
The CommSy Community System / 6.1.3：
Word Processing / 6.1.4：
Refining the Notion of Functional Minimalism / 6.1.5：
Structural Minimalism / 6.2：
Remote Controls / 6.2.1：
The Palm Handheld / 6.2.2：
Minimal Access Structures for Mobile Communication / 6.2.3：
HyperScout: Enhancing Link Preview in the World Wide Web / 6.2.4：
World Processing / 6.2.5：
Refining the Notion of Structural Minimalism / 6.2.6：
Architectural Minimalism / 6.3：
Building Blocks / 6.3.1：
Apple Automator (i-Series 2) / 6.3.2：
Sketch Up / 6.3.3：
Apple iPod / 6.3.4：
Web 2.0 / 6.3.5：
Refining the Notion of Architectural Minimalism / 6.3.6：
Compositional Minimalism / 6.4：
Old Buildings Learn / 6.4.1：
A Sticky Story: The Post-it Note / 6.4.2：
E-mail / 6.4.3：
PowerPoint / 6.4.4：
WikiWikiWebs / 6.4.5：
Refining the Notion of Compositional Minimalism / 6.4.6：
Reflections on the Four Notions of Minimalism / 6.5：
A First Assessment of Suitability for the Analysis of Products / 6.5.1：
Design Advice / 6.5.2：
Designing the Minimal / 7：
Process Matters / 7.1：
A Direct Approach: Reduction as a Design Activity / 7.2：
The Minimal Design Game / 7.2.1：
First Experiences / 7.2.2：
The Indirect Approach: Changing the Process / 7.2.3：
Scoping Reduction / 7.3.1：
Defining Scope: Using Personas / 7.4：
Personas and Notions of Minimalism / 7.4.1：
Reduction and the Use of Personas / 7.4.2：
Defining Use: Scenario Techniques / 7.5：
Scenarios and Notions of Minimalism / 7.5.1：
Scenario-Based Design / 7.5.2：
Reduction and the Use of Scenarios / 7.5.3：
Defining Architecture: Small Steps and Agile Methods / 7.6：
Simplicity in Software Engineering / 7.6.1：
Minimalism in Agile Development / 7.6.2：
Reduction in Agile Methods / 7.6.3：
Defining Growth: Using Values in Design / 7.7：
Values in Software / 7.7.1：
Case Study: CommSy-Designing with Values / 7.7.2：
Sharing Explicit Values in Communities of Interest / 7.7.3：
Reduction in Value-Based Development / 7.7.4：
Engineering Simplicity? A Reality Check / 7.8：
Reflections on Minimalism / Part V：
Minimalism Revisited / 8：
The Minimal Perspective on Design / 8.1：
Minimalism as an Analytic Tool / 8.2：
Minimalism as a Constructive Tool / 8.3：
A Minimalist Design Method: The Minimal Design Game / 8.3.1：
Indirect Minimalism in Existing Methods / 8.3.2：
Refining the Definition of Minimalism / 8.4：
Functional Minimalism Revisited / 8.4.1：
Structural Minimalism Revisited / 8.4.2：
Architectural Minimalism Revisited / 8.4.3：
Compositional Minimalism Revisited / 8.4.4：
Implications of a Minimalist Standpoint for Design / 8.5：
Minimal Aesthetics / 9：
Unconnected Ends / 10：
Conclusion / 11：
Index
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
47.

電子ブック
ＥＢ
47. Minimalism
Hartmut Obendorf
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
Machine Beauty = Power + Simplicity / 1.1.1：
Reduction-Give Up or Gain? / 1.1.2：
Minimalism: Borrowing the Extreme from the Arts / 1.1.3：
Minimalism in a Nutshell / 1.2：
Four Notions of Minimalism, Their Relationship, and Design / 1.2.1：
An Example Analysis Using Notions of Minimalism / 1.2.2：
Minimalism, Products, and Processes / 1.2.3：
Defining the Scope of Minimalist Terminology / 1.3：
Minimalism-Mathematic Minimalism / 1.3.1：
Minimalism-Linguistic Minimalism / 1.3.2：
Minimalism-Documentation Minimalism / 1.3.3：
Minimalism-Folk Minimalism / 1.3.4：
Finding a Minimalism for Interaction Design / 1.4：
References
Defining Minimalism / Part II：
In Search of "Minimalism"-Roving in Art, Music and Elsewhere / 2：
Minimalism in the Arts / 2.1：
Rauschenberg, Klein and Newman: Birth of Minimal Painting / 2.1.1：
Reinhardt: Art-as-Art / 2.1.2：
Stella: To See What Is There / 2.1.3：
Radical Minimalism and Post-Minimalist Painting / 2.1.4：
Judd, Andre, Flavin, and Morris: Minimal Objects / 2.1.5：
LeWitt: Minimal Structure in Minimalist Sculpture / 2.1.6：
Post-Minimalist Sculpture / 2.1.7：
Minimal Art: Art as Art or Cooperative Sense-Building? / 2.1.8：
Minimalism in Music / 2.2：
The Origins of Minimal Music / 2.2.1：
Terry Riley / 2.2.2：
La Monte Young / 2.2.3：
Philip Glass / 2.2.4：
Steve Reich / 2.2.5：
Summarizing Minimalism in Music / 2.2.6：
Minimalism Found Elsewhere / 2.3：
Literary Minimalism: Roots in Hemingway, Archetype in Carver / 2.3.1：
Minimalism in Architecture / 2.3.2：
Minimalism in Typography / 2.3.3：
Homing in on Minimalism: Summarizing the Art perspective / 2.4：
Minimality of Means / 2.4.1：
Minimality of Meaning / 2.4.2：
Minimality of Structure / 2.4.3：
Use of Patterns / 2.4.4：
Involvement of the recipient / 2.4.5：
The Minimalist Perspective and Criticism / 2.4.6：
Minimalism for Interaction Design: a Proposal / 3：
Meanings of Minimalism in HCI-A Transfer from the Arts / 3.1：
Defining Four Notions of the Minimal for Interaction Design / 3.2：
Minimal Functionality for User Interfaces / 3.2.1：
Minimal Structure for User Interfaces / 3.2.2：
Minimal Architecture for User Interfaces / 3.2.3：
Minimal Composition for User Interfaces / 3.2.4：
A Minimalist Terminology for the Design of Interactive Systems / 3.2.5：
Summary / 3.3：
Rethinking Minimalism / Part III：
Minimalism, Industrial Design and HCI / 4：
Following the Roots in Industrial Design / 4.1：
Standards in Interaction Design and Minimalism / 4.2：
HCI Lore and Minimalism / 4.3：
Rules of Noble Metal and Minimalism / 4.3.1：
Interface Guidelines and Minimalism / 4.3.2：
Discussion / 4.3.3：
Minimalism, Simplicity and Rules of Design / 4.4：
Deep Design: Causes of Clutter and Excise / 5.1：
Visibility of Interface Elements / 5.2：
Access Structure / 5.3：
Minimalism and Consistency / 5.4：
Minimalism and Conceptions of Design / 5.5：
Minimalism and Simplicity / 5.6：
Limits of the Notion of Simplicity / 5.6.1：
Revisiting the Four Notions of Minimalism / 5.7：
Applying Minimalism / Part IV：
Detecting the Minimal / 6：
Functional Minimalism / 6.1：
Cutting Edges / 6.1.1：
Apple GarageBand (i-Series 1) / 6.1.2：
The CommSy Community System / 6.1.3：
Word Processing / 6.1.4：
Refining the Notion of Functional Minimalism / 6.1.5：
Structural Minimalism / 6.2：
Remote Controls / 6.2.1：
The Palm Handheld / 6.2.2：
Minimal Access Structures for Mobile Communication / 6.2.3：
HyperScout: Enhancing Link Preview in the World Wide Web / 6.2.4：
World Processing / 6.2.5：
Refining the Notion of Structural Minimalism / 6.2.6：
Architectural Minimalism / 6.3：
Building Blocks / 6.3.1：
Apple Automator (i-Series 2) / 6.3.2：
Sketch Up / 6.3.3：
Apple iPod / 6.3.4：
Web 2.0 / 6.3.5：
Refining the Notion of Architectural Minimalism / 6.3.6：
Compositional Minimalism / 6.4：
Old Buildings Learn / 6.4.1：
A Sticky Story: The Post-it Note / 6.4.2：
E-mail / 6.4.3：
PowerPoint / 6.4.4：
WikiWikiWebs / 6.4.5：
Refining the Notion of Compositional Minimalism / 6.4.6：
Reflections on the Four Notions of Minimalism / 6.5：
A First Assessment of Suitability for the Analysis of Products / 6.5.1：
Design Advice / 6.5.2：
Designing the Minimal / 7：
Process Matters / 7.1：
A Direct Approach: Reduction as a Design Activity / 7.2：
The Minimal Design Game / 7.2.1：
First Experiences / 7.2.2：
The Indirect Approach: Changing the Process / 7.2.3：
Scoping Reduction / 7.3.1：
Defining Scope: Using Personas / 7.4：
Personas and Notions of Minimalism / 7.4.1：
Reduction and the Use of Personas / 7.4.2：
Defining Use: Scenario Techniques / 7.5：
Scenarios and Notions of Minimalism / 7.5.1：
Scenario-Based Design / 7.5.2：
Reduction and the Use of Scenarios / 7.5.3：
Defining Architecture: Small Steps and Agile Methods / 7.6：
Simplicity in Software Engineering / 7.6.1：
Minimalism in Agile Development / 7.6.2：
Reduction in Agile Methods / 7.6.3：
Defining Growth: Using Values in Design / 7.7：
Values in Software / 7.7.1：
Case Study: CommSy-Designing with Values / 7.7.2：
Sharing Explicit Values in Communities of Interest / 7.7.3：
Reduction in Value-Based Development / 7.7.4：
Engineering Simplicity? A Reality Check / 7.8：
Reflections on Minimalism / Part V：
Minimalism Revisited / 8：
The Minimal Perspective on Design / 8.1：
Minimalism as an Analytic Tool / 8.2：
Minimalism as a Constructive Tool / 8.3：
A Minimalist Design Method: The Minimal Design Game / 8.3.1：
Indirect Minimalism in Existing Methods / 8.3.2：
Refining the Definition of Minimalism / 8.4：
Functional Minimalism Revisited / 8.4.1：
Structural Minimalism Revisited / 8.4.2：
Architectural Minimalism Revisited / 8.4.3：
Compositional Minimalism Revisited / 8.4.4：
Implications of a Minimalist Standpoint for Design / 8.5：
Minimal Aesthetics / 9：
Unconnected Ends / 10：
Conclusion / 11：
Index
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
48.

電子ブック
ＥＢ
48. Spectroscopic Ellipsometry: Principles and Applications
Hiroyuki Fujiwara
出版情報: Wiley Online Library - AutoHoldings Books , Chichester : John Wiley & Sons, Inc., 2007
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Acknowledgments
Introduction to Spectroscopic Ellipsometry / 1：
Features of Spectroscopic Ellipsometry / 1.1：
Applications of Spectroscopic Ellipsometry / 1.2：
Data Analysis / 1.3：
History of Development / 1.4：
Future Prospects / 1.5：
References
Principles of Optics / 2：
Propagation of Light / 2.1：
Propagation of One-Dimensional Waves / 2.1.1：
Electromagnetic Waves / 2.1.2：
Refractive Index / 2.1.3：
Dielectrics / 2.2：
Dielectric Polarization / 2.2.1：
Dielectric Constant / 2.2.2：
Dielectric Function / 2.2.3：
Reflection and Transmission of Light / 2.3：
Refraction of Light / 2.3.1：
p- and s-Polarized Light Waves / 2.3.2：
Reflectance and Transmittance / 2.3.3：
Brewster Angle / 2.3.4：
Total Reflection / 2.3.5：
Optical Interference / 2.4：
Optical Interference in Thin Films / 2.4.1：
Multilayers / 2.4.2：
Polarization of Light / 3：
Representation of Polarized Light / 3.1：
Phase of Light / 3.1.1：
Polarization States of Light Waves / 3.1.2：
Optical Elements / 3.2：
Polarizer (Analyzer) / 3.2.1：
Compensator (Retarder) / 3.2.2：
Photoelastic Modulator / 3.2.3：
Depolarizer / 3.2.4：
Jones Matrix / 3.3：
Jones Vector / 3.3.1：
Transformation of Coordinate Systems / 3.3.2：
Jones Matrices of Optical Elements / 3.3.3：
Representation of Optical Measurement / Jones Matrices3.3.4：
Stokes Parameters / 3.4：
Definition of Stokes Parameters / 3.4.1：
Poincare Sphere / 3.4.2：
Partially Polarized Light / 3.4.3：
Mueller Matrix / 3.4.4：
Principles of Spectroscopic Ellipsometry / 4：
Principles of Ellipsometry Measurement / 4.1：
Measured Values in Ellipsometry / 4.1.1：
Coordinate System in Ellipsometry / 4.1.2：
Jones and Mueller Matrices of Samples / 4.1.3：
Ellipsometry Measurement / 4.2：
Measurement Methods of Ellipsometry / 4.2.1：
Rotating-Analyzer Ellipsometry (RAE) / 4.2.2：
Rotating-Analyzer Ellipsometry with Compensator / 4.2.3：
Rotating-Compensator Ellipsometry (RCE) / 4.2.4：
Phase-Modulation Ellipsometry (PME) / 4.2.5：
Infrared Spectroscopic Ellipsometry / 4.2.6：
Mueller Matrix Ellipsometry / 4.2.7：
Null Ellipsometry and Imaging Ellipsometry / 4.2.8：
Instrumentation for Ellipsometry / 4.3：
Installation of Ellipsometry System / 4.3.1：
Fourier Analysis / 4.3.2：
Calibration of Optical Elements / 4.3.3：
Correction of Measurement Errors / 4.3.4：
Precision and Error of Measurement / 4.4：
Variation of Precision and Error with Measurement Method / 4.4.1：
Precision of ([psi], [Delta]) / 4.4.2：
Precision of Film Thickness and Absorption Coefficient / 4.4.3：
Depolarization Effect of Samples / 4.4.4：
Interpretation of ([psi], [Delta]) / 5：
Variations of ([psi], [Delta]) with Optical Constants / 5.1.1：
Variations of ([psi], [Delta]) in Transparent Films / 5.1.2：
Variations of ([psi], [Delta]) in Absorbing Films / 5.1.3：
Dielectric Function Models / 5.2：
Lorentz Model / 5.2.1：
Interpretation of the Lorentz Model / 5.2.2：
Sellmeier and Cauchy Models / 5.2.3：
Tauc-Lorentz Model / 5.2.4：
Drude Model / 5.2.5：
Kramers-Kronig Relations / 5.2.6：
Effective Medium Approximation / 5.3：
Effective Medium Theories / 5.3.1：
Modeling of Surface Roughness / 5.3.2：
Limitations of Effective Medium Theories / 5.3.3：
Optical Models / 5.4：
Construction of Optical Models / 5.4.1：
Pseudo-Dielectric Function / 5.4.2：
Optimization of Sample Structures / 5.4.3：
Optical Models for Depolarizing Samples / 5.4.4：
Data Analysis Procedure / 5.5：
Linear Regression Analysis / 5.5.1：
Fitting Error Function / 5.5.2：
Mathematical Inversion / 5.5.3：
Ellipsometry of Anisotropic Materials / 6：
Reflection and Transmission of Light by Anisotropic Materials / 6.1：
Light Propagation in Anisotropic Media / 6.1.1：
Index Ellipsoid / 6.1.2：
Dielectric Tensor / 6.1.3：
Jones Matrix of Anisotropic Samples / 6.1.4：
Fresnel Equations for Anisotropic Materials / 6.2：
Anisotropic Substrate / 6.2.1：
Anisotropic Thin Film on Isotropic Substrate / 6.2.2：
4 x 4 Matrix Method / 6.3：
Principles of the 4 x 4 Matrix Method / 6.3.1：
Calculation Method of Partial Transfer Matrix / 6.3.2：
Calculation Methods of Incident and Exit Matrices / 6.3.3：
Calculation Procedure of the 4 x 4 Matrix Method / 6.3.4：
Interpretation of ([psi], [Delta]) for Anisotropic Materials / 6.4：
Variations of ([psi], [Delta]) in Anisotropic Substrates / 6.4.1：
Variations of ([psi], [Delta]) in Anisotropic Thin Films / 6.4.2：
Measurement and Data Analysis of Anisotropic Materials / 6.5：
Measurement Methods / 6.5.1：
Data Analysis Methods / 6.5.2：
Data Analysis Examples / 7：
Insulators / 7.1：
Analysis Examples / 7.1.1：
Advanced Analysis / 7.1.2：
Semiconductors / 7.2：
Optical Transitions in Semiconductors / 7.2.1：
Modeling of Dielectric Functions / 7.2.2：
Analysis of Dielectric Functions / 7.2.3：
Metals/Semiconductors / 7.3：
Dielectric Function of Metals / 7.3.1：
Analysis of Free-Carrier Absorption / 7.3.2：
Organic Materials/Biomaterials / 7.3.3：
Analysis of Organic Materials / 7.4.1：
Analysis of Biomaterials / 7.4.2：
Anisotropic Materials / 7.5：
Analysis of Anisotropic Insulators / 7.5.1：
Analysis of Anisotropic Semiconductors / 7.5.2：
Analysis of Anisotropic Organic Materials / 7.5.3：
Real-Time Monitoring by Spectroscopic Ellipsometry / 8：
Data Analysis in Real-Time Monitoring / 8.1：
Procedures for Real-Time Data Analysis / 8.1.1：
Linear Regression Analysis (LRA) / 8.1.2：
Global Error Minimization (GEM) / 8.1.3：
Virtual Substrate Approximation (VSA) / 8.1.4：
Observation of Thin-Film Growth by Real-Time Monitoring / 8.2：
Process Control by Real-Time Monitoring / 8.2.1：
Data Analysis in Process Control / 8.3.1：
Process Control by Linear Regression Analysis (LRA) / 8.3.2：
Process Control by Virtual Substrate Approximation (VSA) / 8.3.3：
Appendices
Trigonometric Functions
Definitions of Optical Constants
Maxwell's Equations for Conductors
Jones-Mueller Matrix Conversion
Index
Foreword
Preface
Acknowledgments
49.

電子ブック
ＥＢ
49. Introduction to Scientific Visualization
Helen Wright
出版情報: Springer eBooks Computer Science , Springer London, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
About This Book
Acknowledgments
Introduction / 1：
Potential and Pitfalls / 2：
Understanding Data / 2.1：
Using Space / 2.1.1：
Using Colour / 2.1.2：
Using Animation / 2.1.3：
Misunderstanding Data / 2.2：
Using the Right Tool for the Right Job / 2.2.1：
The Perils of Interpolation / 2.2.2：
Problems
Models and Software / 3：
A Dataflow Model of Visualization / 3.1：
Visualization Scenarios / 3.2：
Computational Steering / 3.2.1：
Distributed and Collaborative Visualization / 3.2.2：
Visualization Software / 3.3：
Historical Context / 3.3.1：
Current Approaches / 3.3.2：
Colour in Scientific Visualization / 4：
The Electromagnetic Spectrum / 4.1：
Colour Perception / 4.2：
Modelling Colour / 4.3：
RGB Colour Model / 4.3.1：
HSV Colour Model / 4.3.2：
Relating RGB and HSV / 4.3.3：
Mapping Data to Colours / 4.4：
Nonlinear Colour Mapping / 4.4.1：
'Linear' Colour Mapping / 4.4.2：
Perceptual Effects and Colour Vision Deficiency / 4.4.3：
Choosing Techniques / 5：
Classifying Data / 5.1：
Dependent and Independent Variables / 5.1.1：
Data Domain / 5.1.2：
Scalar and Vector Types / 5.1.3：
Taxonomy of Visualization Techniques / 5.2：
Visualizing Scalars / 6：
1D Data / 6.1：
Bar Chart, Pie Chart, and Scatterplot / 6.1.1：
Histogram and Line Graph / 6.1.2：
2D Data / 6.2：
2D Bar Chart / 6.2.1：
2D Histogram / 6.2.2：
Bounded Region Plot / 6.2.3：
Image Display / 6.2.4：
Making a Framework / 6.2.5：
Contour Plot / 6.2.6：
Surface View / 6.2.7：
Height-field Plot / 6.2.8：
3D Data / 6.3：
Reduction to 2D / 6.3.1：
Isosurface / 6.3.2：
Volume Render / 6.3.3：
Visualizing Vectors / 7：
Arrow Plot / 7.1：
Streamline and Timeline / 7.2：
Streamribbon, Streamsurface, and Streamtube / 7.3：
Time Surface / 7.4：
Flow Texture / 7.5：
Unsteady Flow / 7.6：
Bibliography and Further Reading / 8：
References
Solutions
Useful Information
Web Sites
Abbreviations
Definitions
Index
Preface
About This Book
Acknowledgments
50.

電子ブック
ＥＢ
50. Introduction to Scientific Visualization
Helen Wright
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
About This Book
Acknowledgments
Introduction / 1：
Potential and Pitfalls / 2：
Understanding Data / 2.1：
Using Space / 2.1.1：
Using Colour / 2.1.2：
Using Animation / 2.1.3：
Misunderstanding Data / 2.2：
Using the Right Tool for the Right Job / 2.2.1：
The Perils of Interpolation / 2.2.2：
Problems
Models and Software / 3：
A Dataflow Model of Visualization / 3.1：
Visualization Scenarios / 3.2：
Computational Steering / 3.2.1：
Distributed and Collaborative Visualization / 3.2.2：
Visualization Software / 3.3：
Historical Context / 3.3.1：
Current Approaches / 3.3.2：
Colour in Scientific Visualization / 4：
The Electromagnetic Spectrum / 4.1：
Colour Perception / 4.2：
Modelling Colour / 4.3：
RGB Colour Model / 4.3.1：
HSV Colour Model / 4.3.2：
Relating RGB and HSV / 4.3.3：
Mapping Data to Colours / 4.4：
Nonlinear Colour Mapping / 4.4.1：
'Linear' Colour Mapping / 4.4.2：
Perceptual Effects and Colour Vision Deficiency / 4.4.3：
Choosing Techniques / 5：
Classifying Data / 5.1：
Dependent and Independent Variables / 5.1.1：
Data Domain / 5.1.2：
Scalar and Vector Types / 5.1.3：
Taxonomy of Visualization Techniques / 5.2：
Visualizing Scalars / 6：
1D Data / 6.1：
Bar Chart, Pie Chart, and Scatterplot / 6.1.1：
Histogram and Line Graph / 6.1.2：
2D Data / 6.2：
2D Bar Chart / 6.2.1：
2D Histogram / 6.2.2：
Bounded Region Plot / 6.2.3：
Image Display / 6.2.4：
Making a Framework / 6.2.5：
Contour Plot / 6.2.6：
Surface View / 6.2.7：
Height-field Plot / 6.2.8：
3D Data / 6.3：
Reduction to 2D / 6.3.1：
Isosurface / 6.3.2：
Volume Render / 6.3.3：
Visualizing Vectors / 7：
Arrow Plot / 7.1：
Streamline and Timeline / 7.2：
Streamribbon, Streamsurface, and Streamtube / 7.3：
Time Surface / 7.4：
Flow Texture / 7.5：
Unsteady Flow / 7.6：
Bibliography and Further Reading / 8：
References
Solutions
Useful Information
Web Sites
Abbreviations
Definitions
Index
Preface
About This Book
Acknowledgments
51.

電子ブック
ＥＢ
51. Ontology Alignment
Marc Ehrig, Ramesh Jain, Amit Sheth
出版情報: Springer eBooks Computer Science , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Introduction and Overview / 1：
Motivation / 1.1：
Contribution / 1.2：
Problem Outline / 1.2.1：
Solution Pathway / 1.2.2：
Overview / 1.3：
Structure / 1.3.1：
Reader's Guide / 1.3.2：
Foundations / Part I：
Definitions / 2：
Ontology / 2.1：
Ontology Definition / 2.1.1：
Semantic Web and Web Ontology Language (OWL) / 2.1.2：
Ontology Example / 2.1.3：
Ontology Alignment / 2.2：
Ontology Alignment Definition / 2.2.1：
Ontology Alignment Representation / 2.2.2：
Ontology Alignment Example / 2.2.3：
Related Terms / 2.3：
Ontology Similarity / 2.4：
Ontology Similarity Definition / 2.4.1：
Similarity Layers / 2.4.2：
Specific Similarity Measures / 2.4.3：
Similarity in Related Work / 2.4.4：
Heuristic Definition / 2.4.5：
Scenarios / 3：
Use Cases / 3.1：
Alignment Discovery / 3.1.1：
Agent Negotiation / Web Service Composition / 3.1.2：
Data Integration / 3.1.3：
Ontology Evolution / Versioning / 3.1.4：
Ontology Merging / 3.1.5：
Query and Answer Rewriting / Mapping / 3.1.6：
Reasoning / 3.1.7：
Requirements / 3.2：
Related Work / 4：
Theory of Alignment / 4.1：
Algebraic Approach / 4.1.1：
Information-Flow-based Approach / 4.1.2：
Translation Framework / 4.1.3：
Existing Alignment Approaches / 4.2：
Classification Guidelines for Alignment Approaches / 4.2.1：
Ontology Alignment Approaches / 4.2.2：
Schema Alignment Approaches / 4.2.3：
Global as View / Local as View / 4.2.4：
Ontology Alignment Approach / Part II：
Process / 5：
General Process / 5.1：
Alignment Approach / 5.2：
Input / 5.2.0：
Feature Engineering / 5.2.1：
Search Step Selection / 5.2.2：
Similarity Computation / 5.2.3：
Similarity Aggregation / 5.2.4：
Interpretation / 5.2.5：
Iteration / 5.2.6：
Output / 5.2.7：
Process Description of Related Approaches / 5.3：
Prompt, Anchor-Prompt / 5.3.1：
Glue / 5.3.2：
Ola / 5.3.3：
Evaluation of Alignment Approach / 5.4：
Evaluation Scenario / 5.4.1：
Evaluation Measures / 5.4.2：
Absolute Quality / 5.4.3：
Data Sets / 5.4.4：
Strategies / 5.4.5：
Results / 5.4.6：
Discussion and Lessons Learned / 5.4.7：
Advanced Methods / 6：
Efficiency / 6.1：
Challenge / 6.1.1：
Complexity / 6.1.2：
An Efficient Approach / 6.1.3：
Evaluation / 6.1.4：
Machine Learning / 6.1.5：
Machine Learning for Ontology Alignment / 6.2.1：
Runtime Alignment / 6.2.3：
Explanatory Component of Decision Trees / 6.2.4：
Active Alignment / 6.2.5：
Ontology Alignment with User Interaction / 6.3.1：
Adaptive Alignment / 6.3.3：
Create Utility Function / 6.4.1：
Derive Requirements for Result Dimensions / 6.4.4：
Derive Parameters / 6.4.5：
Example / 6.4.6：
Integrated Approach / 6.4.7：
Integrating the Individual Approaches / 6.5.1：
Summary of Ontology Alignment Approaches / 6.5.2：
Implementation and Application / 6.5.3：
Tools / 7：
Basic Infrastructure for Ontology Alignment and Mapping-Foam / 7.1：
User Example / 7.1.1：
Process Implementation / 7.1.2：
Underlying Software / 7.1.3：
Availability and Open Usage / 7.1.4：
Summary / 7.1.5：
Ontology Mapping Based on Axioms / 7.2：
Logics and Inferencing / 7.2.1：
Formalization of Similarity Rules as Logical Axioms / 7.2.2：
Integration into Ontology Engineering Platform / 7.2.3：
OntoStudio / 7.3.1：
OntoMap / 7.3.2：
Foam in OntoMap / 7.3.3：
Semantic Web and Peer-to-Peer - SWAP / 8：
Project Description / 8.1：
Core Technologies / 8.1.1：
Case Studies / 8.1.2：
Bibster / 8.2：
Scenario / 8.2.1：
Design / 8.2.2：
Ontology Alignment / Duplicate Detection / 8.2.3：
Application / 8.2.4：
Xarop / 8.3：
Semantically Enabled Knowledge Technologies - SEKT / 8.3.1：
Intelligent Integrated Decision Support for Legal Professionals / 9.1：
Retrieving and Sharing Knowledge in a Digital Library / 9.2.1：
Heterogeneous Groups in Consulting / 9.3.1：
Towards Next Generation Semantic Alignment / 9.4.1：
Next Steps / 10：
Generalization / 10.1：
Situation / 10.1.1：
Generalized Process / 10.1.2：
Alignment of Petri Nets / 10.1.3：
Complex Alignments / 10.1.4：
Types of Complex Alignments / 10.2.1：
Extended Process for Complex Alignments / 10.2.3：
Implementation and Discussion / 10.2.4：
Future / 11：
Outlook / 11.1：
Limits for Alignment / 11.2：
Errors / 11.2.1：
Points of Mismatch / 11.2.2：
Implications / 11.2.3：
Conclusion / 12：
Content Summary / 12.1：
Assessment of Contribution / 12.2：
Final Statements / 12.3：
Appendix / Part V：
Ontologies / A：
Complete Evaluation Results / B：
Foam Tool Details / C：
Short description / C.1：
Download and Installation / C.2：
Usage / C.3：
Web Service / C.4：
Parameters / C.5：
Additional features of the tool / C.6：
References
Index
Preface
Acknowledgements
Introduction and Overview / 1：
52.

電子ブック
ＥＢ
52. Formal Languages and Compilation
Stefano Crespi Reghizzi
出版情報: Springer eBooks Computer Science , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
Syntax / 2：
Artificial and Formal Languages / 2.1：
Language Types / 2.1.2：
Chapter Outline / 2.1.3：
Formal Language Theory / 2.2：
Alphabet and Language / 2.2.1：
Language Operations / 2.2.2：
Set Operations / 2.2.3：
Star and Cross / 2.2.4：
Quotient / 2.2.5：
Regular Expressions and Languages / 2.3：
Definition of Regular Expression / 2.3.1：
Derivation and Language / 2.3.2：
Other Operators / 2.3.3：
Closure Properties of REG Family / 2.3.4：
Linguistic Abstraction / 2.4：
Abstract and Concrete Lists / 2.4.1：
Context-Free Generative Grammars / 2.5：
Limits of Regular Languages / 2.5.1：
Introduction to Context-Free Grammars / 2.5.2：
Conventional Grammar Representations / 2.5.3：
Derivation and Language Generation / 2.5.4：
Erroneous Grammars and Useless Rules / 2.5.5：
Recursion and Language Infinity / 2.5.6：
Syntax Trees and Canonical Derivations / 2.5.7：
Parenthesis Languages / 2.5.8：
Regular Composition of Context-Free Languages / 2.5.9：
Ambiguity / 2.5.10：
Catalogue of Ambiguous Forms and Remedies / 2.5.11：
Weak and Structural Equivalence / 2.5.12：
Grammar Transformations and Normal Forms / 2.5.13：
Grammars of Regular Languages / 2.6：
From Regular Expressions to Context-Free Grammars / 2.6.1：
Linear Grammars / 2.6.2：
Linear Language Equations / 2.6.3：
Comparison of Regular and Context-Free Languages / 2.7：
Limits of Context-Free Languages / 2.7.1：
Closure Properties of REG and CF / 2.7.2：
Alphabetic Transformations / 2.7.3：
Grammars with Regular Expressions / 2.7.4：
More General Grammars and Language Families / 2.8：
Chomsky Classification / 2.8.1：
Finite Automata as Regular Language Recognizers / 3：
Recognition Algorithms and Automata / 3.1：
A General Automation / 3.2.1：
Introduction to Finite Automata / 3.3：
Deterministic Finite Automata / 3.4：
Error State and Total Automata / 3.4.1：
Clean Automata / 3.4.2：
Minimal Automata / 3.4.3：
From Automata to Grammars / 3.4.4：
Nondeterministic Automata / 3.5：
Motivation of Nondeterminism / 3.5.1：
Nondeterministic Recognizers / 3.5.2：
Automata with Spontaneous Moves / 3.5.3：
Correspondence between Automata and Grammars / 3.5.4：
Ambiguity of Automata / 3.5.5：
Left-Linear Grammars and Automata / 3.5.6：
Directly from Automata to Regular Expressions: BMC Method / 3.6：
Elimination of Nondeterminism / 3.7：
Construction of Accessible Subsets / 3.7.1：
From Regular Expression to Recognizer / 3.8：
Thompson Structural Method / 3.8.1：
Algorithm of Glushkov, McNaughton and Yamada / 3.8.2：
Deterministic Recognizer by Berry and Sethi Algorithm / 3.8.3：
Regular Expressions with Complement and Intersection / 3.9：
Product of Automata / 3.9.1：
Summary of Relations between Regular Languages, Grammars, and Automata / 3.10：
Pushdown Automata and Top-down Parsing / 4：
Pushdown Automaton / 4.1：
From Grammar to Pushdown Automaton / 4.1.2：
Definition of Pushdown Automaton / 4.1.3：
One Family for Context-Free Languages and Pushdown Automata / 4.2：
Intersection of Regular and Context-Free Languages / 4.2.1：
Deterministic Pushdown Automata and Languages / 4.2.2：
Syntax Analysis / 4.3：
Top-Down and Bottom-Up Analysis / 4.3.1：
Grammar as Network of Finite Automata / 4.3.2：
Nondeterministic Recognition Algorithm / 4.3.3：
Top-Down Deterministic Syntax Analysis / 4.4：
Condition for LL(1) Parsing / 4.4.1：
How to Obtain LL(1) Grammars / 4.4.2：
Increasing Look-ahead / 4.4.3：
Bottom-Up and General Parsing / 5：
Bottom-Up Deterministic Syntax Analysis / 5.1：
LR(0) Method / 5.2.1：
LR(0) Grammars / 5.2.2：
Shift-Reduce Parser / 5.2.3：
Syntax Analysis with LR(k) Look-Ahead / 5.2.4：
LR(1) Parsing Algorithm / 5.2.5：
Properties of LR(k) Language and Grammar Families / 5.2.6：
How to Obtain LR(1) Grammars / 5.2.7：
LR(1) Parsing with Extended Context-Free Grammars / 5.2.8：
Comparison of Deterministic Families REG, LL(k), and LR(k) / 5.2.9：
A General Parsing Algorithm / 5.3：
Introductory Example / 5.3.1：
Earley Algorithm / 5.3.2：
Computational Complexity / 5.3.3：
Handling of Empty Rules / 5.3.4：
Further Developments / 5.3.5：
How to Choose a Parser / 5.4：
Translation Semantics and Static Analysis / 6：
Translation Relation and Function / 6.1：
Transliteration / 6.3：
Regular Translations / 6.4：
Two-Input Automaton / 6.4.1：
Translation Functions and Finite Transducers / 6.4.2：
Purely Syntactic Translation / 6.5：
Infix and Polish Notations / 6.5.1：
Ambiguity of Source Grammar and Translation / 6.5.2：
Translation Grammars and Pushdown Transducers / 6.5.3：
Syntax Analysis with Online Translation / 6.5.4：
Top-Down Deterministic Translation / 6.5.5：
Bottom-Up Deterministic Translation / 6.5.6：
Comparisons / 6.5.7：
Closure Properties of Translations / 6.5.8：
Semantic Translations / 6.6：
Attribute Grammars / 6.6.1：
Left and Right Attributes / 6.6.2：
Definition of Attribute Grammar / 6.6.3：
Dependence Graph and Attribute Evaluation / 6.6.4：
One Sweep Semantic Evaluation / 6.6.5：
Other Evaluation Methods / 6.6.6：
Combined Syntax and Semantic Analysis / 6.6.7：
Typical Applications of Attribute Grammars / 6.6.8：
Static Program Analysis / 6.7：
A Program as an Automaton / 6.7.1：
Liveness Intervals of Variables / 6.7.2：
Reaching Definitions / 6.7.3：
References
Index
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
53.

電子ブック
ＥＢ
53. Formal Languages and Compilation
Stefano Crespi Reghizzi, Stefano Crespi Reghizzi
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
Syntax / 2：
Artificial and Formal Languages / 2.1：
Language Types / 2.1.2：
Chapter Outline / 2.1.3：
Formal Language Theory / 2.2：
Alphabet and Language / 2.2.1：
Language Operations / 2.2.2：
Set Operations / 2.2.3：
Star and Cross / 2.2.4：
Quotient / 2.2.5：
Regular Expressions and Languages / 2.3：
Definition of Regular Expression / 2.3.1：
Derivation and Language / 2.3.2：
Other Operators / 2.3.3：
Closure Properties of REG Family / 2.3.4：
Linguistic Abstraction / 2.4：
Abstract and Concrete Lists / 2.4.1：
Context-Free Generative Grammars / 2.5：
Limits of Regular Languages / 2.5.1：
Introduction to Context-Free Grammars / 2.5.2：
Conventional Grammar Representations / 2.5.3：
Derivation and Language Generation / 2.5.4：
Erroneous Grammars and Useless Rules / 2.5.5：
Recursion and Language Infinity / 2.5.6：
Syntax Trees and Canonical Derivations / 2.5.7：
Parenthesis Languages / 2.5.8：
Regular Composition of Context-Free Languages / 2.5.9：
Ambiguity / 2.5.10：
Catalogue of Ambiguous Forms and Remedies / 2.5.11：
Weak and Structural Equivalence / 2.5.12：
Grammar Transformations and Normal Forms / 2.5.13：
Grammars of Regular Languages / 2.6：
From Regular Expressions to Context-Free Grammars / 2.6.1：
Linear Grammars / 2.6.2：
Linear Language Equations / 2.6.3：
Comparison of Regular and Context-Free Languages / 2.7：
Limits of Context-Free Languages / 2.7.1：
Closure Properties of REG and CF / 2.7.2：
Alphabetic Transformations / 2.7.3：
Grammars with Regular Expressions / 2.7.4：
More General Grammars and Language Families / 2.8：
Chomsky Classification / 2.8.1：
Finite Automata as Regular Language Recognizers / 3：
Recognition Algorithms and Automata / 3.1：
A General Automation / 3.2.1：
Introduction to Finite Automata / 3.3：
Deterministic Finite Automata / 3.4：
Error State and Total Automata / 3.4.1：
Clean Automata / 3.4.2：
Minimal Automata / 3.4.3：
From Automata to Grammars / 3.4.4：
Nondeterministic Automata / 3.5：
Motivation of Nondeterminism / 3.5.1：
Nondeterministic Recognizers / 3.5.2：
Automata with Spontaneous Moves / 3.5.3：
Correspondence between Automata and Grammars / 3.5.4：
Ambiguity of Automata / 3.5.5：
Left-Linear Grammars and Automata / 3.5.6：
Directly from Automata to Regular Expressions: BMC Method / 3.6：
Elimination of Nondeterminism / 3.7：
Construction of Accessible Subsets / 3.7.1：
From Regular Expression to Recognizer / 3.8：
Thompson Structural Method / 3.8.1：
Algorithm of Glushkov, McNaughton and Yamada / 3.8.2：
Deterministic Recognizer by Berry and Sethi Algorithm / 3.8.3：
Regular Expressions with Complement and Intersection / 3.9：
Product of Automata / 3.9.1：
Summary of Relations between Regular Languages, Grammars, and Automata / 3.10：
Pushdown Automata and Top-down Parsing / 4：
Pushdown Automaton / 4.1：
From Grammar to Pushdown Automaton / 4.1.2：
Definition of Pushdown Automaton / 4.1.3：
One Family for Context-Free Languages and Pushdown Automata / 4.2：
Intersection of Regular and Context-Free Languages / 4.2.1：
Deterministic Pushdown Automata and Languages / 4.2.2：
Syntax Analysis / 4.3：
Top-Down and Bottom-Up Analysis / 4.3.1：
Grammar as Network of Finite Automata / 4.3.2：
Nondeterministic Recognition Algorithm / 4.3.3：
Top-Down Deterministic Syntax Analysis / 4.4：
Condition for LL(1) Parsing / 4.4.1：
How to Obtain LL(1) Grammars / 4.4.2：
Increasing Look-ahead / 4.4.3：
Bottom-Up and General Parsing / 5：
Bottom-Up Deterministic Syntax Analysis / 5.1：
LR(0) Method / 5.2.1：
LR(0) Grammars / 5.2.2：
Shift-Reduce Parser / 5.2.3：
Syntax Analysis with LR(k) Look-Ahead / 5.2.4：
LR(1) Parsing Algorithm / 5.2.5：
Properties of LR(k) Language and Grammar Families / 5.2.6：
How to Obtain LR(1) Grammars / 5.2.7：
LR(1) Parsing with Extended Context-Free Grammars / 5.2.8：
Comparison of Deterministic Families REG, LL(k), and LR(k) / 5.2.9：
A General Parsing Algorithm / 5.3：
Introductory Example / 5.3.1：
Earley Algorithm / 5.3.2：
Computational Complexity / 5.3.3：
Handling of Empty Rules / 5.3.4：
Further Developments / 5.3.5：
How to Choose a Parser / 5.4：
Translation Semantics and Static Analysis / 6：
Translation Relation and Function / 6.1：
Transliteration / 6.3：
Regular Translations / 6.4：
Two-Input Automaton / 6.4.1：
Translation Functions and Finite Transducers / 6.4.2：
Purely Syntactic Translation / 6.5：
Infix and Polish Notations / 6.5.1：
Ambiguity of Source Grammar and Translation / 6.5.2：
Translation Grammars and Pushdown Transducers / 6.5.3：
Syntax Analysis with Online Translation / 6.5.4：
Top-Down Deterministic Translation / 6.5.5：
Bottom-Up Deterministic Translation / 6.5.6：
Comparisons / 6.5.7：
Closure Properties of Translations / 6.5.8：
Semantic Translations / 6.6：
Attribute Grammars / 6.6.1：
Left and Right Attributes / 6.6.2：
Definition of Attribute Grammar / 6.6.3：
Dependence Graph and Attribute Evaluation / 6.6.4：
One Sweep Semantic Evaluation / 6.6.5：
Other Evaluation Methods / 6.6.6：
Combined Syntax and Semantic Analysis / 6.6.7：
Typical Applications of Attribute Grammars / 6.6.8：
Static Program Analysis / 6.7：
A Program as an Automaton / 6.7.1：
Liveness Intervals of Variables / 6.7.2：
Reaching Definitions / 6.7.3：
References
Index
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
54.

電子ブック
ＥＢ
54. Ontology Alignment
Marc Ehrig, Ramesh Jain, Amit Sheth
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Introduction and Overview / 1：
Motivation / 1.1：
Contribution / 1.2：
Problem Outline / 1.2.1：
Solution Pathway / 1.2.2：
Overview / 1.3：
Structure / 1.3.1：
Reader's Guide / 1.3.2：
Foundations / Part I：
Definitions / 2：
Ontology / 2.1：
Ontology Definition / 2.1.1：
Semantic Web and Web Ontology Language (OWL) / 2.1.2：
Ontology Example / 2.1.3：
Ontology Alignment / 2.2：
Ontology Alignment Definition / 2.2.1：
Ontology Alignment Representation / 2.2.2：
Ontology Alignment Example / 2.2.3：
Related Terms / 2.3：
Ontology Similarity / 2.4：
Ontology Similarity Definition / 2.4.1：
Similarity Layers / 2.4.2：
Specific Similarity Measures / 2.4.3：
Similarity in Related Work / 2.4.4：
Heuristic Definition / 2.4.5：
Scenarios / 3：
Use Cases / 3.1：
Alignment Discovery / 3.1.1：
Agent Negotiation / Web Service Composition / 3.1.2：
Data Integration / 3.1.3：
Ontology Evolution / Versioning / 3.1.4：
Ontology Merging / 3.1.5：
Query and Answer Rewriting / Mapping / 3.1.6：
Reasoning / 3.1.7：
Requirements / 3.2：
Related Work / 4：
Theory of Alignment / 4.1：
Algebraic Approach / 4.1.1：
Information-Flow-based Approach / 4.1.2：
Translation Framework / 4.1.3：
Existing Alignment Approaches / 4.2：
Classification Guidelines for Alignment Approaches / 4.2.1：
Ontology Alignment Approaches / 4.2.2：
Schema Alignment Approaches / 4.2.3：
Global as View / Local as View / 4.2.4：
Ontology Alignment Approach / Part II：
Process / 5：
General Process / 5.1：
Alignment Approach / 5.2：
Input / 5.2.0：
Feature Engineering / 5.2.1：
Search Step Selection / 5.2.2：
Similarity Computation / 5.2.3：
Similarity Aggregation / 5.2.4：
Interpretation / 5.2.5：
Iteration / 5.2.6：
Output / 5.2.7：
Process Description of Related Approaches / 5.3：
Prompt, Anchor-Prompt / 5.3.1：
Glue / 5.3.2：
Ola / 5.3.3：
Evaluation of Alignment Approach / 5.4：
Evaluation Scenario / 5.4.1：
Evaluation Measures / 5.4.2：
Absolute Quality / 5.4.3：
Data Sets / 5.4.4：
Strategies / 5.4.5：
Results / 5.4.6：
Discussion and Lessons Learned / 5.4.7：
Advanced Methods / 6：
Efficiency / 6.1：
Challenge / 6.1.1：
Complexity / 6.1.2：
An Efficient Approach / 6.1.3：
Evaluation / 6.1.4：
Machine Learning / 6.1.5：
Machine Learning for Ontology Alignment / 6.2.1：
Runtime Alignment / 6.2.3：
Explanatory Component of Decision Trees / 6.2.4：
Active Alignment / 6.2.5：
Ontology Alignment with User Interaction / 6.3.1：
Adaptive Alignment / 6.3.3：
Create Utility Function / 6.4.1：
Derive Requirements for Result Dimensions / 6.4.4：
Derive Parameters / 6.4.5：
Example / 6.4.6：
Integrated Approach / 6.4.7：
Integrating the Individual Approaches / 6.5.1：
Summary of Ontology Alignment Approaches / 6.5.2：
Implementation and Application / 6.5.3：
Tools / 7：
Basic Infrastructure for Ontology Alignment and Mapping-Foam / 7.1：
User Example / 7.1.1：
Process Implementation / 7.1.2：
Underlying Software / 7.1.3：
Availability and Open Usage / 7.1.4：
Summary / 7.1.5：
Ontology Mapping Based on Axioms / 7.2：
Logics and Inferencing / 7.2.1：
Formalization of Similarity Rules as Logical Axioms / 7.2.2：
Integration into Ontology Engineering Platform / 7.2.3：
OntoStudio / 7.3.1：
OntoMap / 7.3.2：
Foam in OntoMap / 7.3.3：
Semantic Web and Peer-to-Peer - SWAP / 8：
Project Description / 8.1：
Core Technologies / 8.1.1：
Case Studies / 8.1.2：
Bibster / 8.2：
Scenario / 8.2.1：
Design / 8.2.2：
Ontology Alignment / Duplicate Detection / 8.2.3：
Application / 8.2.4：
Xarop / 8.3：
Semantically Enabled Knowledge Technologies - SEKT / 8.3.1：
Intelligent Integrated Decision Support for Legal Professionals / 9.1：
Retrieving and Sharing Knowledge in a Digital Library / 9.2.1：
Heterogeneous Groups in Consulting / 9.3.1：
Towards Next Generation Semantic Alignment / 9.4.1：
Next Steps / 10：
Generalization / 10.1：
Situation / 10.1.1：
Generalized Process / 10.1.2：
Alignment of Petri Nets / 10.1.3：
Complex Alignments / 10.1.4：
Types of Complex Alignments / 10.2.1：
Extended Process for Complex Alignments / 10.2.3：
Implementation and Discussion / 10.2.4：
Future / 11：
Outlook / 11.1：
Limits for Alignment / 11.2：
Errors / 11.2.1：
Points of Mismatch / 11.2.2：
Implications / 11.2.3：
Conclusion / 12：
Content Summary / 12.1：
Assessment of Contribution / 12.2：
Final Statements / 12.3：
Appendix / Part V：
Ontologies / A：
Complete Evaluation Results / B：
Foam Tool Details / C：
Short description / C.1：
Download and Installation / C.2：
Usage / C.3：
Web Service / C.4：
Parameters / C.5：
Additional features of the tool / C.6：
References
Index
Preface
Acknowledgements
Introduction and Overview / 1：
55.

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

電子ブック
ＥＢ
56. Sets, Logic and Maths for Computing
David Makinson
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Collecting Things Together: Sets / 1：
The Intuitive Concept of a Set / 1.1：
Basic Relations between Sets / 1.2：
Inclusion / 1.2.1：
Identity / 1.2.2：
Proper Inclusion / 1.2.3：
Euler Diagrams / 1.2.4：
Venn Diagrams / 1.2.5：
Ways of Defining a Set / 1.2.6：
The Empty Set / 1.3：
Emptiness / 1.3.1：
Disjoint Sets / 1.3.2：
Boolean Operations on Sets / 1.4：
Intersection / 1.4.1：
Union / 1.4.2：
Difference and Complement / 1.4.3：
Generalised Union and Intersection / 1.5：
Power Sets / 1.6：
Some Important Sets of Numbers / 1.7：
Comparing Things: Relations / 2：
Ordered Tuples, Cartesian Products, Relations / 2.1：
Ordered Tuples / 2.1.1：
Cartesian Products / 2.1.2：
Relations / 2.1.3：
Tables and Digraphs for Relations / 2.2：
Tables for Relations / 2.2.1：
Digraphs for Relations / 2.2.2：
Operations on Relations / 2.3：
Converse / 2.3.1：
Join of Relations / 2.3.2：
Composition of Relations / 2.3.3：
Image / 2.3.4：
Reflexivity and Transitivity / 2.4：
Reflexivity / 2.4.1：
Transitivity / 2.4.2：
Equivalence Relations and Partitions / 2.5：
Symmetry / 2.5.1：
Equivalence Relations / 2.5.2：
Partitions / 2.5.3：
The Correspondence between Partitions and Equivalence Relations / 2.5.4：
Relations for Ordering / 2.6：
Partial Order / 2.6.1：
Linear Orderings / 2.6.2：
Strict Orderings / 2.6.3：
Closing with Relations / 2.7：
Transitive Closure of a Relation / 2.7.1：
Closure of a Set under a Relation / 2.7.2：
Associating One Item with Another: Functions / 3：
What is a Function? / 3.1：
Operations on Functions / 3.2：
Domain and Range / 3.2.1：
Image, Restriction, Closure / 3.2.2：
Composition / 3.2.3：
Inverse / 3.2.4：
Injections, Surjections, Bijections / 3.3：
Injectivity / 3.3.1：
Surjectivity / 3.3.2：
Bijective Functions / 3.3.3：
Using Functions to Compare Size / 3.4：
The Equinumerosity Principle / 3.4.1：
The Principle of Comparison / 3.4.2：
The Pigeonhole Principle / 3.4.3：
Some Handy Functions / 3.5：
Identity Functions / 3.5.1：
Constant Functions / 3.5.2：
Projection Functions / 3.5.3：
Characteristic Functions / 3.5.4：
Families of Sets / 3.5.5：
Sequences / 3.5.6：
Recycling Outputs as Inputs: Induction and Recursion / 4：
What are Induction and Recursion? / 4.1：
Proof by Simple Induction on the Positive Integers / 4.2：
An Example / 4.2.1：
The Principle behind the Example / 4.2.2：
Definition by Simple Recursion on the Natural Numbers / 4.3：
Evaluating Functions Defined by Recursion / 4.4：
Cumulative Induction and Recursion / 4.5：
Recursive Definitions Reaching Back more than One Unit / 4.5.1：
Proof by Cumulative Induction / 4.5.2：
Simultaneous Recursion and Induction / 4.5.3：
Structural Recursion and Induction / 4.6：
Defining Sets by Structural Recursion / 4.6.1：
Proof by Structural Induction / 4.6.2：
Defining Functions by Structural Recursion on their Domains / 4.6.3：
Condition for Defining a Function by Structural Recursion / 4.6.4：
When the Unique Decomposition Condition Fails? / 4.6.5：
Recursion and Induction on Well-Founded Sets / 4.7：
Well-Founded Sets / 4.7.1：
The Principle of Proof by Well-Founded Induction / 4.7.2：
Definition of a Function by Well-Founded Recursion on its Domain / 4.7.3：
Recursive Programs / 4.8：
Counting Things: Combinatorics / 5：
Two Basic Principles: Addition and Multiplication / 5.1：
Using the Two Basic Principles Together / 5.2：
Four Ways of Selecting k Items out of n / 5.3：
Counting Formulae: Permutations and Combinations / 5.4：
The Formula for Permutations (O+R-) / 5.4.1：
The Formula for Combinations (O-R-) / 5.4.2：
Counting Formulae: Perms and Coms with Repetition / 5.5：
The Formula for Permutations with Repetition Allowed (O+R+) / 5.5.1：
The Formula for Combinations with Repetition Allowed (O-R+) / 5.5.2：
Rearrangements and Partitions / 5.6：
Rearrangements / 5.6.1：
Counting Partitions with a Given Numerical Configuration / 5.6.2：
Weighing the Odds: Probability / 6：
Finite Probability Spaces / 6.1：
Basic Definitions / 6.1.1：
Properties of Probability Functions / 6.1.2：
Philosophy and Applications / 6.2：
Some Simple Problems / 6.3：
Conditional Probability / 6.4：
Interlude: Simpson's Paradox / 6.5：
Independence / 6.6：
Bayes' Theorem / 6.7：
Random Variables and Expected Values / 6.8：
Random Variables / 6.8.1：
Expectation / 6.8.2：
Induced Probability Distributions / 6.8.3：
Expectation Expressed using Induced Probability Functions / 6.8.4：
Squirrel Math: Trees / 7：
My First Tree / 7.1：
Rooted Trees / 7.2：
Labelled Trees / 7.3：
Interlude: Parenthesis-Free Notation / 7.4：
Binary Search Trees / 7.5：
Unrooted Trees / 7.6：
Definition of Unrooted Tree / 7.6.1：
Properties of Unrooted Trees / 7.6.2：
Finding Spanning Trees / 7.6.3：
Yea and Nay: Propositional Logic / 8：
What is Logic? / 8.1：
Structural Features of Consequence / 8.2：
Truth-Functional Connectives / 8.3：
Tautologicality / 8.4：
The Language of Propositional Logic / 8.4.1：
Assignments and Valuations / 8.4.2：
Tautological Implication / 8.4.3：
Tautological Equivalence / 8.4.4：
Tautologies and Contradictions / 8.4.5：
Normal Forms, Least letter-Sets, Greatest Modularity / 8.5：
Disjunctive Normal Form / 8.5.1：
Conjunctive Normal Form / 8.5.2：
Eliminating Redundant Letters / 8.5.3：
Most Modular Representation / 8.5.4：
Semantic Decomposition Trees / 8.6：
Natural Deduction / 8.7：
Enchainment / 8.7.1：
Second-Level (alias Indirect) Inference / 8.7.2：
Something about Everything: Quantificational Logic / 9：
The Language of Quantifiers / 9.1：
Some Examples / 9.1.1：
Systematic Presentation of the Language / 9.1.2：
Freedom and Bondage / 9.1.3：
Some Basic Logical Equivalences / 9.2：
Semantics for Quantificational Logic / 9.3：
Interpretations / 9.3.1：
Valuating Terms under an Interpretation / 9.3.2：
Valuating Formulae under an Interpretation: Basis / 9.3.3：
Valuating Formulae under an Interpretation: Recursion Step / 9.3.4：
The x-Variant Reading of the Quantifiers / 9.3.5：
The Substitutional Reading of the Quantifiers / 9.3.6：
Logical Consequence etc / 9.4：
Natural Deduction with Quantifiers / 9.5：
Index
Collecting Things Together: Sets / 1：
The Intuitive Concept of a Set / 1.1：
Basic Relations between Sets / 1.2：
57.

電子ブック
ＥＢ
57. Virtual Reality Technology
Burdea
出版情報: EBSCOhost Academic Search Premier , John Wiley & Sons, Inc. / Engineering, 2003
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Introduction / 1：
The Three I's of Virtual Reality / 1.1：
A Short History of Early Virtual Reality / 1.2：
Early Commercial VR Technology / 1.3：
VR Becomes an Industry / 1.4：
The Five Classic Components of a VR System / 1.5：
Review Questions / 1.6：
References
Input Devices: Trackers, Navigation, and Gesture Interfaces / 2：
Three-Dimensional Position Trackers / 2.1：
Tracker Performance Parameters / 2.1.1：
Mechanical Trackers / 2.1.2：
Magnetic Trackers / 2.1.3：
Ultrasonic Trackers / 2.1.4：
Optical Trackers / 2.1.5：
Hybrid Intertial Trackers / 2.1.6：
Navigation and Manipulation Interfaces / 2.2：
Tracker-Based Navigation/Manipulation Interfaces / 2.2.1：
Trackballs / 2.2.2：
Three-Dimensional Probes / 2.2.3：
Gesture Interfaces / 2.3：
The Pinch Glove / 2.3.1：
The 5DT Data Glove / 2.3.2：
The Didjiglove / 2.3.3：
The CyberGlove / 2.3.4：
Conclusion / 2.4：
Output Devices: Graphics, Three-Dimensional Sound, and Haptic Displays / 2.5：
Graphics Displays / 3.1：
The Human Visual System / 3.1.1：
Personal Graphics Displays / 3.1.2：
Large-Volume Displays / 3.1.3：
Sound Displays / 3.2：
The Human Auditory System / 3.2.1：
The Convolvotron / 3.2.2：
Speaker-Based Three-Dimensional Sound / 3.2.3：
Haptic Feedback / 3.3：
The Human Haptic System / 3.3.1：
Tactile Feedback Interfaces / 3.3.2：
Force Feedback Interfaces / 3.3.3：
Computing Architectures for VR / 3.4：
The Rendering Pipeline / 4.1：
The Graphics Rendering Pipeline / 4.1.1：
The Haptics Rendering Pipeline / 4.1.2：
PC Graphics Architecture / 4.2：
PC Graphics Accelerators / 4.2.1：
Graphics Benchmarks / 4.2.2：
Workstation-Based Architectures / 4.3：
The Sun Blade 1000 Architecture / 4.3.1：
The SGI Infinite Reality Architecture / 4.3.2：
Distributed VR Architectures / 4.4：
Multipipeline Synchronization / 4.4.1：
Colocated Rendering Pipelines / 4.4.2：
Distributed Virtual Environments / 4.4.3：
Modeling / 4.5：
Geometric Modeling / 5.1：
Virtual Object Shape / 5.1.1：
Object Visual Appearance / 5.1.2：
Kinematics Modeling / 5.2：
Homogeneous Transformation Matrices / 5.2.1：
Object Position / 5.2.2：
Transformation Invariants / 5.2.3：
Object Hierarchies / 5.2.4：
Viewing the Three-Dimensional World / 5.2.5：
Physical Modeling / 5.3：
Collision Detection / 5.3.1：
Surface Deformation / 5.3.2：
Force Computation / 5.3.3：
Force Smoothing and Mapping / 5.3.4：
Haptic Texturing / 5.3.5：
Behavior Modeling / 5.4：
Model Management / 5.5：
Level-of-Detail Management / 5.5.1：
Cell Segmentation / 5.5.2：
VR Programming / 5.6：
Toolkits and Scene Graphs / 6.1：
WorldToolKit / 6.2：
Model Geometry and Appearance / 6.2.1：
The WTK Scene Graph / 6.2.2：
Sensors and Action Functions / 6.2.3：
WTK Networking / 6.2.4：
Java 3D / 6.3：
Java 3D Scene Graph / 6.3.1：
Sensors and Behaviors / 6.3.3：
Java 3D Networking / 6.3.4：
WTK and Java 3D Performance Comparison / 6.3.5：
General Haptics Open Software Toolkit / 6.4：
GHOST Integration with the Graphics Pipeline / 6.4.1：
The GHOST Haptics Scene Graph / 6.4.2：
Collision Detection and Response / 6.4.3：
Graphics and PHANToM Calibration / 6.4.4：
PeopleShop / 6.5：
DI-Guy Geometry and Path / 6.5.1：
PeopleShop Networking / 6.5.2：
Human Factors in VR / 6.6：
Methodology and Terminology / 7.1：
Data Collection and Analysis / 7.1.1：
Usability Engineering Methodology / 7.1.2：
User Performance Studies / 7.2：
Testbed Evaluation of Universal VR Tasks / 7.2.1：
Influence of System Responsiveness on User Performance / 7.2.2：
Influence of Feedback Multimodality / 7.2.3：
VR Health and Safety Issues / 7.3：
Direct Effects of VR Simulations on Users / 7.3.1：
Cybersickness / 7.3.2：
Adaptation and Aftereffects / 7.3.3：
Guidelines for Proper VR Usage / 7.3.4：
VR and Society / 7.4：
Impact on Professional Life / 7.4.1：
Impact on Private Life / 7.4.2：
Impact on Public Life / 7.4.3：
Traditional VR Applications / 7.5：
Medical Applications of VR / 8.1：
Virtual Anatomy / 8.1.1：
Triage and Diagnostic / 8.1.2：
Surgery / 8.1.3：
Rehabilitation / 8.1.4：
Education, Arts, and Entertainment / 8.2：
VR in Education / 8.2.1：
VR and the Arts / 8.2.2：
Entertainment Applications of VR / 8.2.3：
Military VR Applications / 8.3：
Army Use of VR / 8.3.1：
VR Applications in the Navy / 8.3.2：
Air Force Use of VR / 8.3.3：
Emerging Applications of VR / 8.4：
VR Applications in Manufacturing / 9.1：
Virtual Prototyping / 9.1.1：
Other VR Applications in Manufacturing / 9.1.2：
Applications of VR in Robotics / 9.2：
Robot Programming / 9.2.1：
Robot Teleoperation / 9.2.2：
Information Visualization / 9.3：
Oil Exploration and Well Management / 9.3.1：
Volumetric Data Visualization / 9.3.2：
Index / 9.4：
Foreword
Preface
Introduction / 1：
58.

電子ブック
ＥＢ
58. Sets, Logic and Maths for Computing
David Makinson
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Collecting Things Together: Sets / 1：
The Intuitive Concept of a Set / 1.1：
Basic Relations between Sets / 1.2：
Inclusion / 1.2.1：
Identity / 1.2.2：
Proper Inclusion / 1.2.3：
Euler Diagrams / 1.2.4：
Venn Diagrams / 1.2.5：
Ways of Defining a Set / 1.2.6：
The Empty Set / 1.3：
Emptiness / 1.3.1：
Disjoint Sets / 1.3.2：
Boolean Operations on Sets / 1.4：
Intersection / 1.4.1：
Union / 1.4.2：
Difference and Complement / 1.4.3：
Generalised Union and Intersection / 1.5：
Power Sets / 1.6：
Some Important Sets of Numbers / 1.7：
Comparing Things: Relations / 2：
Ordered Tuples, Cartesian Products, Relations / 2.1：
Ordered Tuples / 2.1.1：
Cartesian Products / 2.1.2：
Relations / 2.1.3：
Tables and Digraphs for Relations / 2.2：
Tables for Relations / 2.2.1：
Digraphs for Relations / 2.2.2：
Operations on Relations / 2.3：
Converse / 2.3.1：
Join of Relations / 2.3.2：
Composition of Relations / 2.3.3：
Image / 2.3.4：
Reflexivity and Transitivity / 2.4：
Reflexivity / 2.4.1：
Transitivity / 2.4.2：
Equivalence Relations and Partitions / 2.5：
Symmetry / 2.5.1：
Equivalence Relations / 2.5.2：
Partitions / 2.5.3：
The Correspondence between Partitions and Equivalence Relations / 2.5.4：
Relations for Ordering / 2.6：
Partial Order / 2.6.1：
Linear Orderings / 2.6.2：
Strict Orderings / 2.6.3：
Closing with Relations / 2.7：
Transitive Closure of a Relation / 2.7.1：
Closure of a Set under a Relation / 2.7.2：
Associating One Item with Another: Functions / 3：
What is a Function? / 3.1：
Operations on Functions / 3.2：
Domain and Range / 3.2.1：
Image, Restriction, Closure / 3.2.2：
Composition / 3.2.3：
Inverse / 3.2.4：
Injections, Surjections, Bijections / 3.3：
Injectivity / 3.3.1：
Surjectivity / 3.3.2：
Bijective Functions / 3.3.3：
Using Functions to Compare Size / 3.4：
The Equinumerosity Principle / 3.4.1：
The Principle of Comparison / 3.4.2：
The Pigeonhole Principle / 3.4.3：
Some Handy Functions / 3.5：
Identity Functions / 3.5.1：
Constant Functions / 3.5.2：
Projection Functions / 3.5.3：
Characteristic Functions / 3.5.4：
Families of Sets / 3.5.5：
Sequences / 3.5.6：
Recycling Outputs as Inputs: Induction and Recursion / 4：
What are Induction and Recursion? / 4.1：
Proof by Simple Induction on the Positive Integers / 4.2：
An Example / 4.2.1：
The Principle behind the Example / 4.2.2：
Definition by Simple Recursion on the Natural Numbers / 4.3：
Evaluating Functions Defined by Recursion / 4.4：
Cumulative Induction and Recursion / 4.5：
Recursive Definitions Reaching Back more than One Unit / 4.5.1：
Proof by Cumulative Induction / 4.5.2：
Simultaneous Recursion and Induction / 4.5.3：
Structural Recursion and Induction / 4.6：
Defining Sets by Structural Recursion / 4.6.1：
Proof by Structural Induction / 4.6.2：
Defining Functions by Structural Recursion on their Domains / 4.6.3：
Condition for Defining a Function by Structural Recursion / 4.6.4：
When the Unique Decomposition Condition Fails? / 4.6.5：
Recursion and Induction on Well-Founded Sets / 4.7：
Well-Founded Sets / 4.7.1：
The Principle of Proof by Well-Founded Induction / 4.7.2：
Definition of a Function by Well-Founded Recursion on its Domain / 4.7.3：
Recursive Programs / 4.8：
Counting Things: Combinatorics / 5：
Two Basic Principles: Addition and Multiplication / 5.1：
Using the Two Basic Principles Together / 5.2：
Four Ways of Selecting k Items out of n / 5.3：
Counting Formulae: Permutations and Combinations / 5.4：
The Formula for Permutations (O+R-) / 5.4.1：
The Formula for Combinations (O-R-) / 5.4.2：
Counting Formulae: Perms and Coms with Repetition / 5.5：
The Formula for Permutations with Repetition Allowed (O+R+) / 5.5.1：
The Formula for Combinations with Repetition Allowed (O-R+) / 5.5.2：
Rearrangements and Partitions / 5.6：
Rearrangements / 5.6.1：
Counting Partitions with a Given Numerical Configuration / 5.6.2：
Weighing the Odds: Probability / 6：
Finite Probability Spaces / 6.1：
Basic Definitions / 6.1.1：
Properties of Probability Functions / 6.1.2：
Philosophy and Applications / 6.2：
Some Simple Problems / 6.3：
Conditional Probability / 6.4：
Interlude: Simpson's Paradox / 6.5：
Independence / 6.6：
Bayes' Theorem / 6.7：
Random Variables and Expected Values / 6.8：
Random Variables / 6.8.1：
Expectation / 6.8.2：
Induced Probability Distributions / 6.8.3：
Expectation Expressed using Induced Probability Functions / 6.8.4：
Squirrel Math: Trees / 7：
My First Tree / 7.1：
Rooted Trees / 7.2：
Labelled Trees / 7.3：
Interlude: Parenthesis-Free Notation / 7.4：
Binary Search Trees / 7.5：
Unrooted Trees / 7.6：
Definition of Unrooted Tree / 7.6.1：
Properties of Unrooted Trees / 7.6.2：
Finding Spanning Trees / 7.6.3：
Yea and Nay: Propositional Logic / 8：
What is Logic? / 8.1：
Structural Features of Consequence / 8.2：
Truth-Functional Connectives / 8.3：
Tautologicality / 8.4：
The Language of Propositional Logic / 8.4.1：
Assignments and Valuations / 8.4.2：
Tautological Implication / 8.4.3：
Tautological Equivalence / 8.4.4：
Tautologies and Contradictions / 8.4.5：
Normal Forms, Least letter-Sets, Greatest Modularity / 8.5：
Disjunctive Normal Form / 8.5.1：
Conjunctive Normal Form / 8.5.2：
Eliminating Redundant Letters / 8.5.3：
Most Modular Representation / 8.5.4：
Semantic Decomposition Trees / 8.6：
Natural Deduction / 8.7：
Enchainment / 8.7.1：
Second-Level (alias Indirect) Inference / 8.7.2：
Something about Everything: Quantificational Logic / 9：
The Language of Quantifiers / 9.1：
Some Examples / 9.1.1：
Systematic Presentation of the Language / 9.1.2：
Freedom and Bondage / 9.1.3：
Some Basic Logical Equivalences / 9.2：
Semantics for Quantificational Logic / 9.3：
Interpretations / 9.3.1：
Valuating Terms under an Interpretation / 9.3.2：
Valuating Formulae under an Interpretation: Basis / 9.3.3：
Valuating Formulae under an Interpretation: Recursion Step / 9.3.4：
The x-Variant Reading of the Quantifiers / 9.3.5：
The Substitutional Reading of the Quantifiers / 9.3.6：
Logical Consequence etc / 9.4：
Natural Deduction with Quantifiers / 9.5：
Index
Collecting Things Together: Sets / 1：
The Intuitive Concept of a Set / 1.1：
Basic Relations between Sets / 1.2：
59.

電子ブック
ＥＢ
59. Computer Viruses and Malware
John Daniel Aycock
出版情報: Springer eBooks Computer Science , Springer US, 2006
所蔵情報: loading…
目次情報: 続きを見る
Dedication
List of Figures
Preface
We've Got Problems / 1：
Dramatis Personae / 1.1：
The Myth of Absolute Security / 1.2：
The Cost of Malware / 1.3：
The Number of Threats / 1.4：
Speed of Propagation / 1.5：
People / 1.6：
About this Book / 1.7：
Some Words of Warning / 1.8：
Definitions and Timeline / 2：
Malware Types / 2.1：
Logic Bomb / 2.1.1：
Trojan Horse / 2.1.2：
Back Door / 2.1.3：
Virus / 2.1.4：
Worm / 2.1.5：
Rabbit / 2.1.6：
Spyware / 2.1.7：
Adware / 2.1.8：
Hybrids, Droppers, and Blended Threats / 2.1.9：
Zombies / 2.1.10：
Naming / 2.2：
Authorship / 2.3：
Timeline / 2.4：
Viruses / 3：
Classification by Target / 3.1：
Boot-Sector Infectors / 3.1.1：
File Infectors / 3.1.2：
Macro Viruses / 3.1.3：
Classification by Concealment Strategy / 3.2：
No Concealment / 3.2.1：
Encryption / 3.2.2：
Stealth / 3.2.3：
Oligomorphism / 3.2.4：
Polymorphism / 3.2.5：
Metamorphism / 3.2.6：
Strong Encryption / 3.2.7：
Virus Kits / 3.3：
Anti-Virus Techniques / 4：
Detection: Static Methods / 4.1：
Scanners / 4.1.1：
Static Heuristics / 4.1.2：
Integrity Checkers / 4.1.3：
Detection: Dynamic Methods / 4.2：
Behavior Monitors/Blockers / 4.2.1：
Emulation / 4.2.2：
Comparison of Anti-Virus Detection Techniques / 4.3：
Verification, Quarantine, and Disinfection / 4.4：
Verification / 4.4.1：
Quarantine / 4.4.2：
Disinfection / 4.4.3：
Virus Databases and Virus Description Languages / 4.5：
Short Subjects / 4.6：
Anti-Stealth Techniques / 4.6.1：
Macro Virus Detection / 4.6.2：
Compiler Optimization / 4.6.3：
Anti-Anti-Virus Techniques / 5：
Retroviruses / 5.1：
Entry Point Obfuscation / 5.2：
Anti-Emulation / 5.3：
Outlast / 5.3.1：
Outsmart / 5.3.2：
Overextend / 5.3.3：
Armoring / 5.4：
Anti-Debugging / 5.4.1：
Anti-Disassembly / 5.4.2：
Tunneling / 5.5：
Integrity Checker Attacks / 5.6：
Avoidance / 5.7：
Weaknesses Exploited / 6：
Technical Weaknesses / 6.1：
Background / 6.1.1：
Buffer Overflows / 6.1.2：
Integer Overflows / 6.1.3：
Format String Vulnerabilities / 6.1.4：
Defenses / 6.1.5：
Finding Weaknesses / 6.1.6：
Human Weaknesses / 6.2：
Virus Hoaxes / 6.2.1：
Worms / 7：
Worm History / 7.1：
Xerox PARC, c. 1982 / 7.1.1：
The Internet Worm, November 1988 / 7.1.2：
Propagation / 7.2：
Initial Seeding / 7.2.1：
Finding Targets / 7.2.2：
Deworming / 8：
Defense / 8.1：
User / 8.1.1：
Host / 8.1.2：
Perimeter / 8.1.3：
Capture and Containment / 8.2：
Honeypots / 8.2.1：
Reverse Firewalls / 8.2.2：
Throttling / 8.2.3：
Automatic Countermeasures / 8.3：
"Applications" / 9：
Benevolent Malware / 9.1：
Spam / 9.2：
Access-for-Sale Worms / 9.3：
Cryptovirology / 9.4：
Information Warfare / 9.5：
Cyberterrorism / 9.6：
People and Communities / 10：
Malware Authors / 10.1：
Who? / 10.1.1：
Why? / 10.1.2：
The Anti-Virus Community / 10.2：
Perceptions / 10.2.1：
Another Day in Paradise / 10.2.2：
Customer Demands / 10.2.3：
Engineering / 10.2.4：
Open Questions / 10.2.5：
What Should We Do? / 11：
References
Index
Dedication
List of Figures
Preface
60.

電子ブック
ＥＢ
60. Computer Viruses and Malware
John Daniel Aycock
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2006
所蔵情報: loading…
目次情報: 続きを見る
Dedication
List of Figures
Preface
We've Got Problems / 1：
Dramatis Personae / 1.1：
The Myth of Absolute Security / 1.2：
The Cost of Malware / 1.3：
The Number of Threats / 1.4：
Speed of Propagation / 1.5：
People / 1.6：
About this Book / 1.7：
Some Words of Warning / 1.8：
Definitions and Timeline / 2：
Malware Types / 2.1：
Logic Bomb / 2.1.1：
Trojan Horse / 2.1.2：
Back Door / 2.1.3：
Virus / 2.1.4：
Worm / 2.1.5：
Rabbit / 2.1.6：
Spyware / 2.1.7：
Adware / 2.1.8：
Hybrids, Droppers, and Blended Threats / 2.1.9：
Zombies / 2.1.10：
Naming / 2.2：
Authorship / 2.3：
Timeline / 2.4：
Viruses / 3：
Classification by Target / 3.1：
Boot-Sector Infectors / 3.1.1：
File Infectors / 3.1.2：
Macro Viruses / 3.1.3：
Classification by Concealment Strategy / 3.2：
No Concealment / 3.2.1：
Encryption / 3.2.2：
Stealth / 3.2.3：
Oligomorphism / 3.2.4：
Polymorphism / 3.2.5：
Metamorphism / 3.2.6：
Strong Encryption / 3.2.7：
Virus Kits / 3.3：
Anti-Virus Techniques / 4：
Detection: Static Methods / 4.1：
Scanners / 4.1.1：
Static Heuristics / 4.1.2：
Integrity Checkers / 4.1.3：
Detection: Dynamic Methods / 4.2：
Behavior Monitors/Blockers / 4.2.1：
Emulation / 4.2.2：
Comparison of Anti-Virus Detection Techniques / 4.3：
Verification, Quarantine, and Disinfection / 4.4：
Verification / 4.4.1：
Quarantine / 4.4.2：
Disinfection / 4.4.3：
Virus Databases and Virus Description Languages / 4.5：
Short Subjects / 4.6：
Anti-Stealth Techniques / 4.6.1：
Macro Virus Detection / 4.6.2：
Compiler Optimization / 4.6.3：
Anti-Anti-Virus Techniques / 5：
Retroviruses / 5.1：
Entry Point Obfuscation / 5.2：
Anti-Emulation / 5.3：
Outlast / 5.3.1：
Outsmart / 5.3.2：
Overextend / 5.3.3：
Armoring / 5.4：
Anti-Debugging / 5.4.1：
Anti-Disassembly / 5.4.2：
Tunneling / 5.5：
Integrity Checker Attacks / 5.6：
Avoidance / 5.7：
Weaknesses Exploited / 6：
Technical Weaknesses / 6.1：
Background / 6.1.1：
Buffer Overflows / 6.1.2：
Integer Overflows / 6.1.3：
Format String Vulnerabilities / 6.1.4：
Defenses / 6.1.5：
Finding Weaknesses / 6.1.6：
Human Weaknesses / 6.2：
Virus Hoaxes / 6.2.1：
Worms / 7：
Worm History / 7.1：
Xerox PARC, c. 1982 / 7.1.1：
The Internet Worm, November 1988 / 7.1.2：
Propagation / 7.2：
Initial Seeding / 7.2.1：
Finding Targets / 7.2.2：
Deworming / 8：
Defense / 8.1：
User / 8.1.1：
Host / 8.1.2：
Perimeter / 8.1.3：
Capture and Containment / 8.2：
Honeypots / 8.2.1：
Reverse Firewalls / 8.2.2：
Throttling / 8.2.3：
Automatic Countermeasures / 8.3：
"Applications" / 9：
Benevolent Malware / 9.1：
Spam / 9.2：
Access-for-Sale Worms / 9.3：
Cryptovirology / 9.4：
Information Warfare / 9.5：
Cyberterrorism / 9.6：
People and Communities / 10：
Malware Authors / 10.1：
Who? / 10.1.1：
Why? / 10.1.2：
The Anti-Virus Community / 10.2：
Perceptions / 10.2.1：
Another Day in Paradise / 10.2.2：
Customer Demands / 10.2.3：
Engineering / 10.2.4：
Open Questions / 10.2.5：
What Should We Do? / 11：
References
Index
Dedication
List of Figures
Preface
61.

電子ブック
ＥＢ
61. Model-Checking Based Data Retrieval
Elisa Quintarelli
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2004
所蔵情報: loading…
目次情報: 続きを見る
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：
62.

電子ブック
ＥＢ
62. The Calculus of Computation
Aaron R. Bradley, Zohar Manna
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Foundations / Part I：
Propositional Logic / 1：
Syntax / 1.1：
Semantics / 1.2：
Satisfiability and Validity / 1.3：
Truth Tables / 1.3.1：
Semantic Arguments / 1.3.2：
Equivalence and Implication / 1.4：
Substitution / 1.5：
Normal Forms / 1.6：
Decision Procedures for Satisfiability / 1.7：
Simple Decision Procedures / 1.7.1：
Reconsidering the Truth-Table Method / 1.7.2：
Conversion to an Equisatisfiable Formula in CNF / 1.7.3：
The Resolution Procedure / 1.7.4：
DPLL / 1.7.5：
Summary / 1.8：
Bibliographic Remarks
Exercises
First-Order Logic / 2：
Safe Substitution / 2.1：
Schema Substitution / 2.4.2：
Decidability and Complexity / 2.5：
Satisfiability as a Formal Language / 2.6.1：
Decidability / 2.6.2：
Complexity / 2.6.3：
Meta-Theorems of First-Order Logic / 2.7：
Simplifying the Language of FOL / 2.7.1：
Semantic Argument Proof Rules / 2.7.2：
Soundness and Completeness / 2.7.3：
Additional Theorems / 2.7.4：
First-Order Theories / 2.8：
Equality / 3.1：
Natural Numbers and Integers / 3.3：
Peano Arithmetic / 3.3.1：
Presburger Arithmetic / 3.3.2：
Theory of Integers / 3.3.3：
Rationals and Reals / 3.4：
Theory of Reals / 3.4.1：
Theory of Rationals / 3.4.2：
Recursive Data Structures / 3.5：
Arrays / 3.6：
Survey of Decidability and Complexity / 3.7：
Combination Theories / 3.8：
Induction / 3.9：
Stepwise Induction / 4.1：
Complete Induction / 4.2：
Well-Founded Induction / 4.3：
Structural Induction / 4.4：
Program Correctness: Mechanics / 4.5：
pi: A Simple Imperative Language / 5.1：
The Language / 5.1.1：
Program Annotations / 5.1.2：
Partial Correctness / 5.2：
Basic Paths: Loops / 5.2.1：
Basic Paths: Function Calls / 5.2.2：
Program States / 5.2.3：
Verification Conditions / 5.2.4：
P-Invariant and P-Inductive / 5.2.5：
Total Correctness / 5.3：
Program Correctness: Strategies / 5.4：
Developing Inductive Annotations / 6.1：
Basic Facts / 6.1.1：
The Precondition Method / 6.1.2：
A Strategy / 6.1.3：
Extended Example: QuickSort / 6.2：
Algorithmic Reasoning / 6.2.1：
Quantified Linear Arithmetic / 7：
Quantifier Elimination / 7.1：
A Simplification / 7.1.1：
Quantifier Elimination over Integers / 7.2：
Augmented Theory of Integers / 7.2.1：
Cooper's Method / 7.2.2：
A Symmetric Elimination / 7.2.3：
Eliminating Blocks of Quantifiers / 7.2.4：
Solving Divides Constraints / 7.2.5：
Quantifier Elimination over Rationals / 7.3：
Ferrante and Rackoff's Method / 7.3.1：
Quantifier-Free Linear Arithmetic / 7.4：
Decision Procedures for Quantifier-Free Fragments / 8.1：
Preliminary Concepts and Notation / 8.2：
Linear Programs / 8.3：
The Simplex Method / 8.4：
From M to M[subscript 0] / 8.4.1：
Vertex Traversal / 8.4.2：
Quantifier-Free Equality and Data Structures / 8.4.3：
Theory of Equality / 9.1：
Congruence Closure Algorithm / 9.2：
Relations / 9.2.1：
Congruence Closure with DAGs / 9.2.2：
Directed Acyclic Graphs / 9.3.1：
Basic Operations / 9.3.2：
Decision Procedure for T[subscript E]-Satisfiability / 9.3.3：
Combining Decision Procedures / 9.3.5：
Nelson-Oppen Method: Nondeterministic Version / 10.1：
Phase 1: Variable Abstraction / 10.2.1：
Phase 2: Guess and Check / 10.2.2：
Practical Efficiency / 10.2.3：
Nelson-Oppen Method: Deterministic Version / 10.3：
Convex Theories / 10.3.1：
Phase 2: Equality Propagation / 10.3.2：
Equality Propagation: Implementation / 10.3.3：
Correctness of the Nelson-Oppen Method / 10.4：
Arrays with Uninterpreted Indices / 10.5：
Array Property Fragment / 11.1.1：
Decision Procedure / 11.1.2：
Integer-Indexed Arrays / 11.2：
Hashtables / 11.2.1：
Hashtable Property Fragment / 11.3.1：
Larger Fragments / 11.3.2：
Invariant Generation / 11.5：
Weakest Precondition and Strongest Postcondition / 12.1：
General Definitions of wp and sp / 12.1.2：
Static Analysis / 12.1.3：
Abstraction / 12.1.4：
Interval Analysis / 12.2：
Karr's Analysis / 12.3：
Standard Notation and Concepts / 12.4：
Further Reading / 12.5：
References
Index
Foundations / Part I：
Propositional Logic / 1：
Syntax / 1.1：
63.

電子ブック
ＥＢ
63. ASME 2008 2nd International Conference on Energy Sustainability collocated with the Heat Transfer, Fluids Engineering, and 3rd Energy Nanotechnology Conferences - ASME 2008 2nd International Conference on Energy Sustainability, Volume 2
出版情報: ASME Digital Collection Conference Proceedings , ASME, 2008
所蔵情報: loading…
64.

電子ブック
ＥＢ
64. Evolution Algebras and their Applications
Jianjun Paul Tian, F. Takens
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Motivations / 2：
Examples from Biology / 2.1：
Asexual propagation / 2.1.1：
Gametic algebras in asexual inheritance / 2.1.2：
The Wright-Fisher model / 2.1.3：
Examples from Physics / 2.2：
Particles moving in a discrete space / 2.2.1：
Flows in a discrete space (networks) / 2.2.2：
Feynman graphs / 2.2.3：
Examples from Topology / 2.3：
Motions of particles in a 3-manifold / 2.3.1：
Random walks on braids with negative probabilities / 2.3.2：
Examples from Probability Theory / 2.4：
Stochastic processes / 2.4.1：
Evolution Algebras / 3：
Definitions and Basic Properties / 3.1：
Departure point / 3.1.1：
Existence of unity elements / 3.1.2：
Basic definitions / 3.1.3：
Ideals of an evolution algebra / 3.1.4：
Quotients of an evolution algebra / 3.1.5：
Occurrence relations / 3.1.6：
Several interesting identities / 3.1.7：
Evolution Operators and Multiplication Algebras / 3.2：
Evolution operators / 3.2.1：
Changes of generator sets (Transformations of natural bases) / 3.2.2：
"Rigidness" of generator sets of an evolution algebra / 3.2.3：
The automorphism group of an evolution algebra / 3.2.4：
The multiplication algebra of an evolution algebra / 3.2.5：
The derived Lie algebra of an evolution algebra / 3.2.6：
The centroid of an evolution algebra / 3.2.7：
Nonassociative Banach Algebras / 3.3：
Definition of a norm over an evolution algebra / 3.3.1：
An evolution algebra as a Banach space / 3.3.2：
Periodicity and Algebraic Persistency / 3.4：
Periodicity of a generator in an evolution algebra / 3.4.1：
Algebraic persistency and algebraic transiency / 3.4.2：
Hierarchy of an Evolution Algebra / 3.5：
Periodicity of a simple evolution algebra / 3.5.1：
Semidirect-sum decomposition of an evolution algebra / 3.5.2：
Hierarchy of an evolution algebra / 3.5.3：
Reducibility of an evolution algebra / 3.5.4：
Evolution Algebras and Markov Chains / 4：
A Markov Chain and Its Evolution Algebra / 4.1：
Markov chains (discrete time) / 4.1.1：
The evolution algebra determined by a Markov chain / 4.1.2：
The Chapman-Kolmogorov equation / 4.1.3：
Concepts related to evolution operators / 4.1.4：
Basic algebraic properties of Markov chains / 4.1.5：
Algebraic Persistency and Probabilistic Persistency / 4.2：
Destination operator of evolution algebra M[subscript X] / 4.2.1：
On the loss of coefficients (probabilities) / 4.2.2：
On the conservation of coefficients (probabilities) / 4.2.3：
Certain interpretations / 4.2.4：
Algebraic periodicity and probabilistic periodicity / 4.2.5：
Spectrum Theory of Evolution Algebras / 4.3：
Invariance of a probability flow / 4.3.1：
Spectrum of a simple evolution algebra / 4.3.2：
Spectrum of an evolution algebra at zeroth level / 4.3.3：
Hierarchies of General Markov Chains and Beyond / 4.4：
Hierarchy of a general Markov chain / 4.4.1：
Structure at the 0th level in a hierarchy / 4.4.2：
1st structure of a hierarchy / 4.4.3：
kth structure of a hierarchy / 4.4.4：
Regular evolution algebras / 4.4.5：
Reduced structure of evolution algebra M[subscript X] / 4.4.6：
Examples and applications / 4.4.7：
Evolution Algebras and Non-Mendelian Genetics / 5：
History of General Genetic Algebras / 5.1：
Non-Mendelian Genetics and Its Algebraic Formulation / 5.2：
Some terms in population genetics / 5.2.1：
Mendelian vs. non-Mendelian genetics / 5.2.2：
Algebraic formulation of non-Mendelian genetics / 5.2.3：
Algebras of Organelle Population Genetics / 5.3：
Heteroplasmy and homoplasmy / 5.3.1：
Coexistence of triplasmy / 5.3.2：
Algebraic Structures of Asexual Progenies of Phytophthora infestans / 5.4：
Basic biology of Phytophthora infestans / 5.4.1：
Algebras of progenies of Phytophthora infestans / 5.4.2：
Further Results and Research Topics / 6：
Beginning of Evolution Algebras and Graph Theory / 6.1：
Further Research Topics / 6.2：
Evolution algebras and graph theory / 6.2.1：
Evolution algebras and group theory, knot theory / 6.2.2：
Evolution algebras and Ihara-Selberg zeta function / 6.2.3：
Continuous evolution algebras / 6.2.4：
Algebraic statistical physics models and applications / 6.2.5：
Evolution algebras and 3-manifolds / 6.2.6：
Evolution algebras and phylogenetic trees, coalescent theory / 6.2.7：
Background Literature / 6.3：
References
Index
Introduction / 1：
Motivations / 2：
Examples from Biology / 2.1：
65.

電子ブック
ＥＢ
65. The Calculus of Computation
Aaron R. Bradley, Zohar Manna
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Foundations / Part I：
Propositional Logic / 1：
Syntax / 1.1：
Semantics / 1.2：
Satisfiability and Validity / 1.3：
Truth Tables / 1.3.1：
Semantic Arguments / 1.3.2：
Equivalence and Implication / 1.4：
Substitution / 1.5：
Normal Forms / 1.6：
Decision Procedures for Satisfiability / 1.7：
Simple Decision Procedures / 1.7.1：
Reconsidering the Truth-Table Method / 1.7.2：
Conversion to an Equisatisfiable Formula in CNF / 1.7.3：
The Resolution Procedure / 1.7.4：
DPLL / 1.7.5：
Summary / 1.8：
Bibliographic Remarks
Exercises
First-Order Logic / 2：
Safe Substitution / 2.1：
Schema Substitution / 2.4.2：
Decidability and Complexity / 2.5：
Satisfiability as a Formal Language / 2.6.1：
Decidability / 2.6.2：
Complexity / 2.6.3：
Meta-Theorems of First-Order Logic / 2.7：
Simplifying the Language of FOL / 2.7.1：
Semantic Argument Proof Rules / 2.7.2：
Soundness and Completeness / 2.7.3：
Additional Theorems / 2.7.4：
First-Order Theories / 2.8：
Equality / 3.1：
Natural Numbers and Integers / 3.3：
Peano Arithmetic / 3.3.1：
Presburger Arithmetic / 3.3.2：
Theory of Integers / 3.3.3：
Rationals and Reals / 3.4：
Theory of Reals / 3.4.1：
Theory of Rationals / 3.4.2：
Recursive Data Structures / 3.5：
Arrays / 3.6：
Survey of Decidability and Complexity / 3.7：
Combination Theories / 3.8：
Induction / 3.9：
Stepwise Induction / 4.1：
Complete Induction / 4.2：
Well-Founded Induction / 4.3：
Structural Induction / 4.4：
Program Correctness: Mechanics / 4.5：
pi: A Simple Imperative Language / 5.1：
The Language / 5.1.1：
Program Annotations / 5.1.2：
Partial Correctness / 5.2：
Basic Paths: Loops / 5.2.1：
Basic Paths: Function Calls / 5.2.2：
Program States / 5.2.3：
Verification Conditions / 5.2.4：
P-Invariant and P-Inductive / 5.2.5：
Total Correctness / 5.3：
Program Correctness: Strategies / 5.4：
Developing Inductive Annotations / 6.1：
Basic Facts / 6.1.1：
The Precondition Method / 6.1.2：
A Strategy / 6.1.3：
Extended Example: QuickSort / 6.2：
Algorithmic Reasoning / 6.2.1：
Quantified Linear Arithmetic / 7：
Quantifier Elimination / 7.1：
A Simplification / 7.1.1：
Quantifier Elimination over Integers / 7.2：
Augmented Theory of Integers / 7.2.1：
Cooper's Method / 7.2.2：
A Symmetric Elimination / 7.2.3：
Eliminating Blocks of Quantifiers / 7.2.4：
Solving Divides Constraints / 7.2.5：
Quantifier Elimination over Rationals / 7.3：
Ferrante and Rackoff's Method / 7.3.1：
Quantifier-Free Linear Arithmetic / 7.4：
Decision Procedures for Quantifier-Free Fragments / 8.1：
Preliminary Concepts and Notation / 8.2：
Linear Programs / 8.3：
The Simplex Method / 8.4：
From M to M[subscript 0] / 8.4.1：
Vertex Traversal / 8.4.2：
Quantifier-Free Equality and Data Structures / 8.4.3：
Theory of Equality / 9.1：
Congruence Closure Algorithm / 9.2：
Relations / 9.2.1：
Congruence Closure with DAGs / 9.2.2：
Directed Acyclic Graphs / 9.3.1：
Basic Operations / 9.3.2：
Decision Procedure for T[subscript E]-Satisfiability / 9.3.3：
Combining Decision Procedures / 9.3.5：
Nelson-Oppen Method: Nondeterministic Version / 10.1：
Phase 1: Variable Abstraction / 10.2.1：
Phase 2: Guess and Check / 10.2.2：
Practical Efficiency / 10.2.3：
Nelson-Oppen Method: Deterministic Version / 10.3：
Convex Theories / 10.3.1：
Phase 2: Equality Propagation / 10.3.2：
Equality Propagation: Implementation / 10.3.3：
Correctness of the Nelson-Oppen Method / 10.4：
Arrays with Uninterpreted Indices / 10.5：
Array Property Fragment / 11.1.1：
Decision Procedure / 11.1.2：
Integer-Indexed Arrays / 11.2：
Hashtables / 11.2.1：
Hashtable Property Fragment / 11.3.1：
Larger Fragments / 11.3.2：
Invariant Generation / 11.5：
Weakest Precondition and Strongest Postcondition / 12.1：
General Definitions of wp and sp / 12.1.2：
Static Analysis / 12.1.3：
Abstraction / 12.1.4：
Interval Analysis / 12.2：
Karr's Analysis / 12.3：
Standard Notation and Concepts / 12.4：
Further Reading / 12.5：
References
Index
Foundations / Part I：
Propositional Logic / 1：
Syntax / 1.1：
66.

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

電子ブック
ＥＢ
67. Moduli of Families of Curves for Conformal and Quasiconformal Mappings
Alexander VasilÊ〓ev
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2002
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Moduli of Families of Curves and Extremal Partitions / 2：
Simple definition and properties of the modulus / 2.1：
Definition / 2.1.1：
Properties / 2.1.2：
Examples / 2.1.3：
Grötzsch lemmas / 2.1.4：
Exercises / 2.1.5：
Reduced moduli and capacity / 2.2：
Reduced modulus / 2.2.1：
Capacity and transfinite diameter / 2.2.2：
Digons, triangles and their reduced moduli / 2.2.3：
Elliptic functions and integrals / 2.3：
Elliptic functions / 2.3.1：
Elliptic integrals and JacobiÆs functions / 2.3.2：
Some frequently used moduli / 2.4：
Moduli of doubly connected domains / 2.4.1：
Moduli of quadrilaterals / 2.4.2：
Reduced moduli / 2.4.3：
Reduced moduli of digons / 2.4.4：
Symmetrization and polarization / 2.5：
Circular symmetrization / 2.5.1：
Polarization / 2.5.2：
Quadratic differentials on Riemann surfaces / 2.6：
Riemann surfaces / 2.6.1：
Quadratic differentials / 2.6.2：
Local trajectory structure / 2.6.3：
Trajectory structure in the large / 2.6.4：
Free families of homotopy classes of curves and extremal par- titions / 2.7：
The case of ring domains and quadrangles / 2.7.1：
The case of circular, strip domains, and triangles / 2.7.2：
Continuous and differentiable moduli / 2.7.3：
Moduli in Extremal Problems for Conformal Mapping / 3：
Classical extremal problems for univalent functions / 3.1：
Koebe set, growth, distortion / 3.1.1：
Lower boundary curve for the range of ( / 3.1.2：
Special moduli / 3.1.3：
Upper boundary curve for the range of ( / 3.1.4：
Two-point distortion for univalent functions / 3.2：
Bounded univalent functions / 3.2.1：
Elementary estimates / 3.3.1：
Boundary curve for the range of ( / 3.3.2：
Montel functions / 3.4：
Covering theorems / 3.4.1：
Distortion at the points of normalization / 3.4.2：
The range of ( / 3.4.3：
Univalent functions with the angular derivatives / 3.5：
Estimates of the angular derivatives / 3.5.1：
Moduli in Extremal Problems for Quasiconformal Mapping / 3.5.2：
General information and simple extremal problems / 4.1：
Quasiconformal mappings of Riemann surfaces / 4.1.1：
Growth and Hölder continuity / 4.1.2：
Quasiconformal motion of a quadruple of points / 4.1.3：
Two-point distortion for quasiconformal maps of the plane / 4.2：
Special differentials and extremal partitions / 4.2.1：
Quasisymmetric functions and the extremal maps / 4.2.2：
Boundary parameterization / 4.2.3：
The class QK. Estimations of functionals / 4.2.4：
Conclusions and unsolved problems / 4.2.5：
Two-point distortion for quasiconformal maps of the unit disk / 4.3：
Extremal problems / 4.3.1：
Moduli on Teichmüller Spaces / 5：
Some information on Teichmüller spaces / 5.1：
Moduli on Teichmüller spaces / 5.2：
Variational formulae / 5.2.1：
Three lemmas / 5.2.2：
Harmonic properties of the moduli / 5.3：
Descriptions of the Teichmüller metric / 5.4：
Invariant metrics / 5.5：
References
List of symbols
Index
Introduction / 1：
Moduli of Families of Curves and Extremal Partitions / 2：
Simple definition and properties of the modulus / 2.1：
68.

電子ブック
ＥＢ
68. Spatio-Temporal Databases
Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Theodoulidis, Babis ; Tryfona, Nectaria ; Grumbach, Stephane ; Guting, Ralf Hartmut Goos, Manolis Koubarakis, Andrew U. Frank, Stéphane Grumbach, Ralf Hartmut Güting, Christian S. Jensen, Nikos Lorentzos, Yannis Manolopoulos, Enrico Nardelli, Barbara Pernici, Timos Sellis
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2003
所蔵情報: loading…
目次情報: 続きを見る
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：
69.

電子ブック
ＥＢ
69. Interactive Media: The Semiotics of Embodied Interaction
Shaleph O'Neill, Shaleph O�fNeill
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Brave New Media World / 1.1：
McLuhan and the Environmental Thesis / 1.2：
The Anti-Determinist View / 1.3：
On-line Social Networks / 1.4：
The Need for New Theory / 1.5：
The Aim of this Book / 1.6：
References
Media, Mediation and Interactive Media / 2：
The Root of Media? / 2.1：
Two Different Ways to Think about Media / 2.2：
Artistic and Creative Media / 2.2.1：
Communications Media / 2.2.2：
The Rise of Interactive Media / 2.3：
Remediation / 2.4：
Immediacy / 2.4.1：
Hypermedia / 2.4.2：
The Essential Characteristics of Interactive Media / 2.5：
The Technological Convergence of Multiple Media Forms / 2.5.1：
The Digitization, Abstraction and Simulation of Old Media / 2.5.2：
The Interactive Authoring and Interpretation of Meaning / 2.5.3：
Summary / 2.6：
Approaching Interaction / 3：
Interactive Media Today / 3.1：
Human Computer Interaction / 3.2：
The Conventional View of Perception and Cognition / 3.2.1：
Mental Modeling / 3.2.2：
The Human Processor Model / 3.2.3：
Execution and Evaluation / 3.2.4：
The Changing Face of HCI / 3.2.5：
Phenomenology and HCI / 3.3：
Being-In-The-World / 3.3.1：
Ready-To-Hand Vs Present-At-Hand / 3.3.2：
Computers and Cognition / 3.3.3：
Embodiment / 3.3.4：
Semiotics and HCI / 3.4：
Computer Semiotics / 3.4.1：
Semiotic Engineering Research Group (Serg) / 3.4.2：
Current Semiotic Approaches in HCI / 3.4.3：
Affordance: A Case of Confusion / 3.5：
The Many Faces of Affordance / 4.1：
Gibson's Original Concept of Affordance / 4.1.1：
Norman's Concept of Affordance / 4.1.2：
Affordance in Technology Design / 4.1.3：
Clarification Or Further Confusion? / 4.1.4：
Affordance in Information Systems / 4.1.5：
Re-Evaluating Gibson's Original Concept of Affordance / 4.2：
Saving Gibson from 'The Argument from Illusion' / 4.2.1：
Distinguishing between Direct and Mediated Perception / 4.2.2：
Providing an Adequate Theory of Knowledge as Skill Acquisition / 4.2.3：
Semiotic Theory / 4.3：
Signs and Signification / 5.1：
Peircean Semiotics / 5.1.1：
Context and Cultural Codes / 5.2：
The Structure of Texts / 5.3：
Layers of Meaning / 5.3.1：
Communication / 5.4：
Semiotics and Interactive Media / 5.5：
Semiotics and Screen Based Interaction / 5.6：
The Semiotic Screen / 6.1：
Screen-based Media / 6.1.1：
Graphics, Symbols, and Pictograms / 6.1.2：
Visual Grammar / 6.1.3：
Moving Images / 6.1.4：
Case Study: Remediating Creativity / 6.2：
Painting as Interaction / 6.2.1：
Interaction as Painting / 6.2.2：
Zones of Interaction / 6.2.3：
Sense Making During Interaction / 6.2.4：
Discussion / 6.2.5：
Semiotics and Interactive Environments / 6.3：
Products and Spaces / 7.1：
Product Semiotics / 7.1.1：
Architectural Semiotics / 7.1.2：
Wayfinding / 7.1.3：
Wayfinding, Architecture, and Interactive Media / 7.1.4：
Case Study: The BENOGO Project / 7.2：
Recreating a Botanic Garden / 7.2.1：
In Relation to Presence / 7.2.2：
Immediacy and Zones of Interaction / 7.2.4：
Being-with-Media / 7.3：
Preparing the Ground for Developing a Theory / 8.1：
The Problem of Reality / 8.1.1：
Clearing the Conceptual Ground / 8.1.2：
Bringing It All Together / 8.2：
Thrownness and the Mediating Environment / 8.3：
Authenticity and Mediation / 8.4：
Being, Affordance and Mediation / 8.5：
Embodied Semiotics / 8.6：
Non-representational Interaction in a Thoughtless World / 9.1：
The Problem of the Semiotic Threshold / 9.2：
Semiosic Primitives and Embodied Schemas / 9.2.1：
Semiotics and Embodied Cognition / 9.2.2：
A Motor Theory of Language / 9.2.3：
Semiosis, Embodied Cognition, and Conceptual Blending / 9.3：
Blending as Semiosis / 9.3.1：
The Spectrum of Embodied Semiotics / 9.4：
Towards Understanding Interactive Media / 9.5：
Understanding Interactive Media / 10：
Interactive Media Design / 10.1：
Emotional Text / 10.2：
Do Not Disturb / 10.3：
Kensho / 10.4：
Tactophonics / 10.5：
Concluding Thoughts / 11：
Signing Off / 11.1：
Introduction / 1：
Brave New Media World / 1.1：
McLuhan and the Environmental Thesis / 1.2：
70.

電子ブック
ＥＢ
70. Interactive Media: The Semiotics of Embodied Interaction
Shaleph O'Neill, Shaleph O’Neill
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Brave New Media World / 1.1：
McLuhan and the Environmental Thesis / 1.2：
The Anti-Determinist View / 1.3：
On-line Social Networks / 1.4：
The Need for New Theory / 1.5：
The Aim of this Book / 1.6：
References
Media, Mediation and Interactive Media / 2：
The Root of Media? / 2.1：
Two Different Ways to Think about Media / 2.2：
Artistic and Creative Media / 2.2.1：
Communications Media / 2.2.2：
The Rise of Interactive Media / 2.3：
Remediation / 2.4：
Immediacy / 2.4.1：
Hypermedia / 2.4.2：
The Essential Characteristics of Interactive Media / 2.5：
The Technological Convergence of Multiple Media Forms / 2.5.1：
The Digitization, Abstraction and Simulation of Old Media / 2.5.2：
The Interactive Authoring and Interpretation of Meaning / 2.5.3：
Summary / 2.6：
Approaching Interaction / 3：
Interactive Media Today / 3.1：
Human Computer Interaction / 3.2：
The Conventional View of Perception and Cognition / 3.2.1：
Mental Modeling / 3.2.2：
The Human Processor Model / 3.2.3：
Execution and Evaluation / 3.2.4：
The Changing Face of HCI / 3.2.5：
Phenomenology and HCI / 3.3：
Being-In-The-World / 3.3.1：
Ready-To-Hand Vs Present-At-Hand / 3.3.2：
Computers and Cognition / 3.3.3：
Embodiment / 3.3.4：
Semiotics and HCI / 3.4：
Computer Semiotics / 3.4.1：
Semiotic Engineering Research Group (Serg) / 3.4.2：
Current Semiotic Approaches in HCI / 3.4.3：
Affordance: A Case of Confusion / 3.5：
The Many Faces of Affordance / 4.1：
Gibson's Original Concept of Affordance / 4.1.1：
Norman's Concept of Affordance / 4.1.2：
Affordance in Technology Design / 4.1.3：
Clarification Or Further Confusion? / 4.1.4：
Affordance in Information Systems / 4.1.5：
Re-Evaluating Gibson's Original Concept of Affordance / 4.2：
Saving Gibson from 'The Argument from Illusion' / 4.2.1：
Distinguishing between Direct and Mediated Perception / 4.2.2：
Providing an Adequate Theory of Knowledge as Skill Acquisition / 4.2.3：
Semiotic Theory / 4.3：
Signs and Signification / 5.1：
Peircean Semiotics / 5.1.1：
Context and Cultural Codes / 5.2：
The Structure of Texts / 5.3：
Layers of Meaning / 5.3.1：
Communication / 5.4：
Semiotics and Interactive Media / 5.5：
Semiotics and Screen Based Interaction / 5.6：
The Semiotic Screen / 6.1：
Screen-based Media / 6.1.1：
Graphics, Symbols, and Pictograms / 6.1.2：
Visual Grammar / 6.1.3：
Moving Images / 6.1.4：
Case Study: Remediating Creativity / 6.2：
Painting as Interaction / 6.2.1：
Interaction as Painting / 6.2.2：
Zones of Interaction / 6.2.3：
Sense Making During Interaction / 6.2.4：
Discussion / 6.2.5：
Semiotics and Interactive Environments / 6.3：
Products and Spaces / 7.1：
Product Semiotics / 7.1.1：
Architectural Semiotics / 7.1.2：
Wayfinding / 7.1.3：
Wayfinding, Architecture, and Interactive Media / 7.1.4：
Case Study: The BENOGO Project / 7.2：
Recreating a Botanic Garden / 7.2.1：
In Relation to Presence / 7.2.2：
Immediacy and Zones of Interaction / 7.2.4：
Being-with-Media / 7.3：
Preparing the Ground for Developing a Theory / 8.1：
The Problem of Reality / 8.1.1：
Clearing the Conceptual Ground / 8.1.2：
Bringing It All Together / 8.2：
Thrownness and the Mediating Environment / 8.3：
Authenticity and Mediation / 8.4：
Being, Affordance and Mediation / 8.5：
Embodied Semiotics / 8.6：
Non-representational Interaction in a Thoughtless World / 9.1：
The Problem of the Semiotic Threshold / 9.2：
Semiosic Primitives and Embodied Schemas / 9.2.1：
Semiotics and Embodied Cognition / 9.2.2：
A Motor Theory of Language / 9.2.3：
Semiosis, Embodied Cognition, and Conceptual Blending / 9.3：
Blending as Semiosis / 9.3.1：
The Spectrum of Embodied Semiotics / 9.4：
Towards Understanding Interactive Media / 9.5：
Understanding Interactive Media / 10：
Interactive Media Design / 10.1：
Emotional Text / 10.2：
Do Not Disturb / 10.3：
Kensho / 10.4：
Tactophonics / 10.5：
Concluding Thoughts / 11：
Signing Off / 11.1：
Introduction / 1：
Brave New Media World / 1.1：
McLuhan and the Environmental Thesis / 1.2：
71.

電子ブック
ＥＢ
71. Compilation Techniques for Reconfigurable Architectures
Jo?o M.P Cardoso, Jo?o M.P Cardoso, Pedro C. Diniz, F. Melchers, M. Potter
出版情報: Springer eBooks Computer Science , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
This Book: Key Techniques when Compiling to Reconfigurable Architecture / 1.3：
Organization of this Book / 1.4：
Overview of Reconfigurable Architectures / 2：
Evolution of Reconfigurable Architectures / 2.1：
Reconfigurable Architectures: Key Characteristics / 2.2：
Granularity / 2.3：
Fine-Grained Reconfigurable Architectures / 2.3.1：
Coarse-Grained Reconfigurable Architectures / 2.3.2：
Hybrid Reconfigurable Architectures / 2.3.3：
Granularity and Mapping / 2.3.4：
Interconnection Topologies / 2.4：
System-Level Integration / 2.5：
Dynamic Reconfiguration / 2.6：
Computational and Execution Models / 2.7：
Streaming Data Input and Output / 2.8：
Summary / 2.9：
Compilation and Synthesis Flows / 3：
Overview / 3.1：
Front-End / 3.1.1：
Middle-End / 3.1.2：
Back-End / 3.1.3：
Hardware Compilation and High-Level Synthesis / 3.2：
Generic High-Level Synthesis / 3.2.1：
Customized High-Level Synthesis for Fine-Grained Reconfigurable Architectures / 3.2.2：
Register-Transfer-Level/Logic Synthesis / 3.2.3：
High-Level Compilation for Coarse-Grained Reconfigurable Architectures / 3.2.4：
Placement and Routing / 3.2.5：
Illustrative Example / 3.3：
High-Level Source Code Example / 3.3.1：
Data-Flow Representation / 3.3.2：
Computation-Oriented Mapping and Scheduling / 3.3.3：
Data-Oriented Mapping and Transformations / 3.3.4：
Translation to Hardware / 3.3.5：
Reconfigurable Computing Issues and Their Impact on Compilation / 3.4：
Programming Languages and Execution Models / 3.4.1：
Intermediate Representations / 3.4.2：
Target Reconfigurable Architecture Features / 3.4.3：
Code Transformations / 3.5：
Bit-Level Transformations / 4.1：
Bit-Width Narrowing / 4.1.1：
Bit-Level Optimizations / 4.1.2：
Conversion from Floating- to Fixed-Point Representations / 4.1.3：
Nonstandard Floating-Point Formats / 4.1.4：
Instruction-Level Transformations / 4.2：
Operator Strength Reduction / 4.2.1：
Height Reduction / 4.2.2：
Code Motion / 4.2.3：
Loop-Level Transformations / 4.3：
Loop Unrolling / 4.3.1：
Loop Tiling and Loop Strip-Mining / 4.3.2：
Loop Merging and Loop Distribution / 4.3.3：
Data-Oriented Transformations / 4.4：
Data Distribution / 4.4.1：
Data Replication / 4.4.2：
Data Reuse and Scalar Replacement in Registers and Internal RAMs / 4.4.3：
Other Data-Oriented Transformations / 4.4.4：
Function-Oriented Transformations / 4.5：
Function Inlining and Outlining / 4.5.1：
Recursive Functions / 4.5.2：
Which Code Transformations to Choose? / 4.6：
Mapping and Execution Optimizations / 4.7：
Hardware Execution Techniques / 5.1：
Instruction-Level Parallelism / 5.1.1：
Speculative Execution / 5.1.2：
Predication and if-conversion / 5.1.3：
Multi Tasking / 5.1.4：
Partitioning / 5.2：
Temporal Partitioning / 5.2.1：
Spatial Partitioning / 5.2.2：
Mapping Program Constructs to Resources / 5.2.3：
Mapping Scalar Variables to Registers / 5.3.1：
Mapping of Operations to FUs / 5.3.2：
Mapping of Selection Structures / 5.3.3：
Sharing Functional Units FUs / 5.3.4：
Combining Instructions for RFUs / 5.3.5：
Pipelining / 5.4：
Pipelined Functional and Execution Units / 5.4.1：
Pipelining Memory Accesses / 5.4.2：
Loop Pipelining / 5.4.3：
Coarse-Grained Pipelining / 5.4.4：
Pipelining Configuration-Computation Sequences / 5.4.5：
Memory Accesses / 5.5：
Partitioning and Mapping of Arrays to Memory Resources / 5.5.1：
Improving Memory Accesses / 5.5.2：
Back-End Support / 5.6：
Allocation, Scheduling, and Binding / 5.6.1：
Module Generation / 5.6.2：
Mapping, Placement, and Routing / 5.6.3：
Compilers for Reconfigurable Architectures / 5.7：
Early Compilation Efforts / 6.1：
Compilers for FPGA-Based Systems / 6.2：
The SPC Compiler / 6.2.1：
A C to Fine-Grained Pipelining Compiler / 6.2.2：
The DeepC Silicon Compiler / 6.2.3：
The COBRA-ABS Tool / 6.2.4：
The DEFACTO Compiler / 6.2.5：
The Streams-C Compiler / 6.2.6：
The Cameron Compiler / 6.2.7：
The MATCH Compiler / 6.2.8：
The Galadriel and Nenya Compilers / 6.2.9：
The Sea Cucumber Compiler / 6.2.10：
The Abstract-Machines Compiler / 6.2.11：
The CHAMPION Software Design Environment / 6.2.12：
The SPARCS Tool / 6.2.13：
The ROCCC Compiler / 6.2.14：
The DWARV Compiler / 6.2.15：
Compilers for Coarse-Grained Reconfigurable Architectures / 6.3：
The DIL Compiler / 6.3.1：
The RaPiD-C Compiler / 6.3.2：
The CoDe-X Compiler / 6.3.3：
The XPP-VC Compiler / 6.3.4：
The DRESC Compiler / 6.3.5：
Compilers for Hybrid Reconfigurable Architectures / 6.4：
The Chimaera-C Compiler / 6.4.1：
The Garp and the Nimble C Compilers / 6.4.2：
The NAPA-C Compiler / 6.4.3：
Compilation Efforts Summary / 6.5：
Perspectives on Programming Reconfigurable Computing Platforms / 7：
How to Make Reconfigurable Computing a Reality? / 7.1：
Easy of Programming / 7.1.1：
Program Portability and Legacy Code Migration / 7.1.2：
Performance Portability / 7.1.3：
Research Directions in Compilation for Reconfigurable Architectures / 7.2：
Programming Language Design / 7.2.1：
Intermediate Representation / 7.2.2：
Mapping to Multiple Computing Engines / 7.2.3：
Design-Space Exploration and Compilation Time / 7.2.4：
Pipelined Execution / 7.2.6：
Memory Mapping Optimizations / 7.2.7：
Application-Specific Compilers and Cores / 7.2.8：
Resource Virtualization / 7.2.9：
Dynamic and Incremental Compilation / 7.2.10：
Tackling the Compilation Challenge for Reconfigurable Architectures / 7.3：
Reconfigurable Architectures and Nanotechnology / 7.4：
Final Remarks / 7.5：
References
List of Acronyms
Index
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
72.

電子ブック
ＥＢ
72. Compilation Techniques for Reconfigurable Architectures
João M.P Cardoso, João M.P Cardoso, Pedro C. Diniz, F. Melchers, M. Potter
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
This Book: Key Techniques when Compiling to Reconfigurable Architecture / 1.3：
Organization of this Book / 1.4：
Overview of Reconfigurable Architectures / 2：
Evolution of Reconfigurable Architectures / 2.1：
Reconfigurable Architectures: Key Characteristics / 2.2：
Granularity / 2.3：
Fine-Grained Reconfigurable Architectures / 2.3.1：
Coarse-Grained Reconfigurable Architectures / 2.3.2：
Hybrid Reconfigurable Architectures / 2.3.3：
Granularity and Mapping / 2.3.4：
Interconnection Topologies / 2.4：
System-Level Integration / 2.5：
Dynamic Reconfiguration / 2.6：
Computational and Execution Models / 2.7：
Streaming Data Input and Output / 2.8：
Summary / 2.9：
Compilation and Synthesis Flows / 3：
Overview / 3.1：
Front-End / 3.1.1：
Middle-End / 3.1.2：
Back-End / 3.1.3：
Hardware Compilation and High-Level Synthesis / 3.2：
Generic High-Level Synthesis / 3.2.1：
Customized High-Level Synthesis for Fine-Grained Reconfigurable Architectures / 3.2.2：
Register-Transfer-Level/Logic Synthesis / 3.2.3：
High-Level Compilation for Coarse-Grained Reconfigurable Architectures / 3.2.4：
Placement and Routing / 3.2.5：
Illustrative Example / 3.3：
High-Level Source Code Example / 3.3.1：
Data-Flow Representation / 3.3.2：
Computation-Oriented Mapping and Scheduling / 3.3.3：
Data-Oriented Mapping and Transformations / 3.3.4：
Translation to Hardware / 3.3.5：
Reconfigurable Computing Issues and Their Impact on Compilation / 3.4：
Programming Languages and Execution Models / 3.4.1：
Intermediate Representations / 3.4.2：
Target Reconfigurable Architecture Features / 3.4.3：
Code Transformations / 3.5：
Bit-Level Transformations / 4.1：
Bit-Width Narrowing / 4.1.1：
Bit-Level Optimizations / 4.1.2：
Conversion from Floating- to Fixed-Point Representations / 4.1.3：
Nonstandard Floating-Point Formats / 4.1.4：
Instruction-Level Transformations / 4.2：
Operator Strength Reduction / 4.2.1：
Height Reduction / 4.2.2：
Code Motion / 4.2.3：
Loop-Level Transformations / 4.3：
Loop Unrolling / 4.3.1：
Loop Tiling and Loop Strip-Mining / 4.3.2：
Loop Merging and Loop Distribution / 4.3.3：
Data-Oriented Transformations / 4.4：
Data Distribution / 4.4.1：
Data Replication / 4.4.2：
Data Reuse and Scalar Replacement in Registers and Internal RAMs / 4.4.3：
Other Data-Oriented Transformations / 4.4.4：
Function-Oriented Transformations / 4.5：
Function Inlining and Outlining / 4.5.1：
Recursive Functions / 4.5.2：
Which Code Transformations to Choose? / 4.6：
Mapping and Execution Optimizations / 4.7：
Hardware Execution Techniques / 5.1：
Instruction-Level Parallelism / 5.1.1：
Speculative Execution / 5.1.2：
Predication and if-conversion / 5.1.3：
Multi Tasking / 5.1.4：
Partitioning / 5.2：
Temporal Partitioning / 5.2.1：
Spatial Partitioning / 5.2.2：
Mapping Program Constructs to Resources / 5.2.3：
Mapping Scalar Variables to Registers / 5.3.1：
Mapping of Operations to FUs / 5.3.2：
Mapping of Selection Structures / 5.3.3：
Sharing Functional Units FUs / 5.3.4：
Combining Instructions for RFUs / 5.3.5：
Pipelining / 5.4：
Pipelined Functional and Execution Units / 5.4.1：
Pipelining Memory Accesses / 5.4.2：
Loop Pipelining / 5.4.3：
Coarse-Grained Pipelining / 5.4.4：
Pipelining Configuration-Computation Sequences / 5.4.5：
Memory Accesses / 5.5：
Partitioning and Mapping of Arrays to Memory Resources / 5.5.1：
Improving Memory Accesses / 5.5.2：
Back-End Support / 5.6：
Allocation, Scheduling, and Binding / 5.6.1：
Module Generation / 5.6.2：
Mapping, Placement, and Routing / 5.6.3：
Compilers for Reconfigurable Architectures / 5.7：
Early Compilation Efforts / 6.1：
Compilers for FPGA-Based Systems / 6.2：
The SPC Compiler / 6.2.1：
A C to Fine-Grained Pipelining Compiler / 6.2.2：
The DeepC Silicon Compiler / 6.2.3：
The COBRA-ABS Tool / 6.2.4：
The DEFACTO Compiler / 6.2.5：
The Streams-C Compiler / 6.2.6：
The Cameron Compiler / 6.2.7：
The MATCH Compiler / 6.2.8：
The Galadriel and Nenya Compilers / 6.2.9：
The Sea Cucumber Compiler / 6.2.10：
The Abstract-Machines Compiler / 6.2.11：
The CHAMPION Software Design Environment / 6.2.12：
The SPARCS Tool / 6.2.13：
The ROCCC Compiler / 6.2.14：
The DWARV Compiler / 6.2.15：
Compilers for Coarse-Grained Reconfigurable Architectures / 6.3：
The DIL Compiler / 6.3.1：
The RaPiD-C Compiler / 6.3.2：
The CoDe-X Compiler / 6.3.3：
The XPP-VC Compiler / 6.3.4：
The DRESC Compiler / 6.3.5：
Compilers for Hybrid Reconfigurable Architectures / 6.4：
The Chimaera-C Compiler / 6.4.1：
The Garp and the Nimble C Compilers / 6.4.2：
The NAPA-C Compiler / 6.4.3：
Compilation Efforts Summary / 6.5：
Perspectives on Programming Reconfigurable Computing Platforms / 7：
How to Make Reconfigurable Computing a Reality? / 7.1：
Easy of Programming / 7.1.1：
Program Portability and Legacy Code Migration / 7.1.2：
Performance Portability / 7.1.3：
Research Directions in Compilation for Reconfigurable Architectures / 7.2：
Programming Language Design / 7.2.1：
Intermediate Representation / 7.2.2：
Mapping to Multiple Computing Engines / 7.2.3：
Design-Space Exploration and Compilation Time / 7.2.4：
Pipelined Execution / 7.2.6：
Memory Mapping Optimizations / 7.2.7：
Application-Specific Compilers and Cores / 7.2.8：
Resource Virtualization / 7.2.9：
Dynamic and Incremental Compilation / 7.2.10：
Tackling the Compilation Challenge for Reconfigurable Architectures / 7.3：
Reconfigurable Architectures and Nanotechnology / 7.4：
Final Remarks / 7.5：
References
List of Acronyms
Index
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
73.

電子ブック
ＥＢ
73. Panel data econometrics with R (: electronic bk)
Yves Croissant, Giovanni Millo
出版情報: [S.l.] : Wiley Online Library, [20--]  1 online resource (xix, 301 p.)
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
About the Companion Website
Introduction / 1：
Panel Data Econometrics: A Gentle Introduction / 1.1：
Eliminating Unobserved Components / 1.1.1：
Differencing Methods / 1.1.1.1：
LSDV Methods / 1.1.1.2：
Fixed Effects Methods / 1.1.1.3：
R for Econometric Computing / 1.2：
The Modus Operandi of R / 1.2.1：
Data Management / 1.2.2：
Outsourcing to Other Software / 1.2.2.1：
Data Management Through Formulae / 1.2.2.2：
plm for the Casual R User / 1.3：
R for the Matrix Language User / 1.3.1：
R for the User of Econometric Packages / 1.3.2：
plm for the Proficient R User / 1.4：
Reproducible Econometric Work / 1.4.1：
Object-orientation for the User / 1.4.2：
plm for the R Developer / 1.5：
Object-orientation for Development / 1.5.1：
Notations / 1.6：
General Notation / 1.6.1：
Maximum Likelihood Notations / 1.6.2：
Index / 1.6.3：
The Two-way Error Component Model / 1.6.4：
Transformation for the One-way Error Component Model / 1.6.5：
Transformation for the Two-ways Error Component Model / 1.6.6：
Groups and Nested Models / 1.6.7：
Instrumental Variables / 1.6.8：
Systems of Equations / 1.6.9：
Time Series / 1.6.10：
Limited Dependent and Count Variables / 1.6.11：
Spatial Panels / 1.6.12：
The Error Component Model / 2：
Notations and Hypotheses / 2.1：
Some Useful Transformations / 2.11：
Hypotheses Concerning the Errors / 2.1.3：
Ordinary Least Squares Estimators / 2.2：
Ordinary Least Squares on the Raw Data: The Pooling Model / 2.2.1：
The between Estimator / 2.2.2：
The within Estimator / 2.2.3：
The Generalized Least Squares Estimator / 2.3：
Presentation of the GLS Estimator / 2.3.1：
Estimation of the Variances of the Components of the Error / 2.3.2：
Comparison of the Estimators / 2.4：
Relations between the Estimators / 2.4.1：
Comparison of the Variances / 2.4.2：
Fixed vs Random Effects / 2.4.3：
Some Simple Linear Model Examples / 2.4.4：
The Two-ways Error Components Model / 2.5：
Error Components in the Two-ways Model / 2.5.1：
Fixed and Random Effects Models / 2.5.2：
Estimation of a Wage Equation / 2.6：
Advanced Error Components Models / 3：
Unbalanced Panels / 3.1：
Individual Effects Model / 3.1.1：
Two-ways Error Component Model / 3.1.2：
Fixed Effects Model / 3.1.2.1：
Random Effects Model / 3.1.2.2：
Estimation of the Components of the Error Variance / 3.1.3：
Seemingly Unrelated Regression / 3.2：
Constrained Least Squares / 3.2.1：
Inter-equations Correlation / 3.2.3：
Sur With Panel Data / 3.2.4：
The Maximum Likelihood Estimator / 3.3：
Derivation of the Likelihood Function / 3.3.1：
Computation of the Estimator / 3.3.2：
The Nested Error Components Model / 3.4：
Presentation of the Model / 3.4.1：
Estimation of the Variance of the Error Components / 3.4.2：
Tests on Error Component Models / 4：
Tests on Individual and/or Time Effects / 4.1：
F Tests / 4.1.1：
Breusch-Pagan Tests / 4.1.2：
Tests for Correlated Effects / 4.2：
The Mundlak Approach / 4.2.1：
Hausman Test / 4.2.2：
Chamberlain's Approach / 4.2.3：
Unconstrained Estimator / 4.2.3.1：
Constrained Estimator / 4.2.3.2：
Fixed Effects Models / 4.2.3.3：
Tests for Serial Correlation / 4.3：
Unobserved Effects Test / 4.3.1：
Score Test of Serial Correlation and/or Individual Effects / 4.3.2：
Likelihood Ratio Tests for AR(1) and Individual Effects / 4.3.3：
Applying Traditional Serial Correlation Tests to Panel Data / 4.3.4：
Wald Tests for Serial Correlation using within and First-differenced Estimators / 4.3.5：
Wooldridge's within-based Test / 4.3.5.1：
Wooldridge's First-difference-based Test / 4.3.5.2：
Tests for Cross-sectional Dependence / 4.4：
Pairwise Correlation Coefficients / 4.4.1：
CD-type Tests for Cross-sectional Dependence / 4.4.2：
Testing Cross-sectional Dependence in a pseries / 4.4.3：
Robust Inference and Estimation for Non-spherical Errors / 5：
Robust Inference / 5.1：
Robust Covariance Estimators / 5.1.1：
Cluster-robust Estimation in a Panel Setting / 5.1.1.1：
Double Clustering / 5.1.1.2：
Panel Newey-west and SCC / 5.1.1.3：
Generic Sandwich Estimators and Panel Models / 5.1.2：
Panel Corrected Standard Errors / 5.1.2.1：
Robust Testing of Linear Hypotheses / 5.1.3：
An Application: Robust Hausman Testing / 5.1.3.1：
Unrestricted Generalized Least Squares / 5.2：
General Feasible Generalized Least Squares / 5.2.1：
Pooled GGLS / 5.2.11：
Fixed Effects GLS / 5.2.12：
First Difference GLS / 5.2.13：
Applied Examples / 5.2.2：
Endogeneity / 6：
The Instrumental Variables Estimator / 6.1：
Generalities about the Instrumental Variables Estimator / 6.2.1：
The within Instrumental Variables Estimator / 6.2.2：
Error Components Instrumental Variables Estimator / 6.3：
The General Model / 6.3.1：
Special Cases of the General Model / 6.3.2：
The within Model / 6.3.2.1：
Error Components Two Stage Least Squares / 6.3.2.2：
The Hausman and Taylor Model / 6.3.2.3：
The Amemiya-Macurdy Estimator / 6.3.2.4：
The Breusch, Mizon and Schmidt's Estimator / 6.3.2.5：
Balestra and Varadharajan-Krishnakumar Estimator / 6.3.2.6：
Estimation of a System of Equations / 6.4：
The Three Stage Least Squares Estimator / 6.4.1：
The Error Components Three Stage Least Squares Estimator / 6.4.2：
More Empirical Examples / 6.5：
Estimation of a Dynamic Model / 7：
Dynamic Model and Endogeneity / 7.1：
The Bias of the OLS Estimator / 7.1.1：
Consistent Estimation Methods for Dynamic Models / 7.1.2：
GMM Estimation of the Differenced Model / 7.2：
Instrumental Variables and Generalized Method of Moments / 7.2.1：
One-step Estimator / 7.2.2：
Two-steps Estimator / 7.2.3：
The Proliferation of Instruments in the Generalized Method of Moments Difference Estimator / 7.2.4：
Generalized Method of Moments Estimator in Differences and Levels / 7.3：
Weak Instruments / 7.3.1：
Moment Conditions on the Levels Model / 7.3.2：
The System GMM Estimator / 7.3.3：
Inference / 7.4：
Robust Estimation of the Coefficients' Covariance / 7.4.1：
Overidentification Tests / 7.4.2：
Error Serial Correlation Test / 7.4.3：
Panel Time Series / 7.5：
Heterogeneous Coefficients / 8.1：
Fixed Coefficients / 8.2.1：
Random Coefficients / 8.2.2：
The Swamy Estimator / 8.2.2.1：
The Mean Groups Estimator / 8.2.2.2：
Testing for Poolability / 8.2.3：
Cross-sectional Dependence and Common Factors / 8.3：
The Common Factor Model / 8.3.1：
Common Correlated Effects Augmentation / 8.3.2：
CCE Mean Groups vs. CCE Pooled / 8.3.2.1：
Computing the CCEP Variance / 8.3.2.2：
Nonstationarity and Cointegration / 8.4：
Unit Root Testing: Generalities / 8.4.1：
First Generation Unit Root Testing / 8.4.2：
Preliminary Results / 8.4.2.1：
Levin-Lin-Chu Test / 8.4.2.2：
Im, Pesaran and Shin Test / 8.4.2.3：
The Maddala and Wu Test / 8.4.2.4：
Second Generation Unit Root Testing / 8.4.3：
Count Data and Limited Dependent Variables / 9：
Binomial and Ordinal Models / 9.1：
The Binomial Model / 9.1.1：
Ordered Models / 9.1.1.2：
The Random Effects Model / 9.1.2：
The Conditional Logit Model / 9.1.2.1：
Censored or Truncated Dependent Variable / 9.2：
The Ordinary Least Squares Estimator / 9.2.1：
The Symmetrical Trimmed Estimator / 9.2.3：
Truncated Sample / 9.2.3.1：
Censored Sample / 9.2.3.2：
Count Data / 9.2.4：
The Poisson Model / 9.3.1：
The NegBin Model / 9.3.1.2：
Negbin Model / 9.3.2：
Random Effects Models / 9.3.3：
Spatial Correlation / 9.3.3.1：
Visual Assessment / 10.1.1：
Testing for Spatial Dependence / 10.1.2：
CD P Tests for Local Cross-sectional Dependence / 10.1.2.1：
The Randomized W Test / 10.1.2.2：
Spatial Lags / 10.2：
Spatially Lagged Regressors / 10.2.1：
Spatially Lagged Dependent Variables / 10.2.2：
Spatial OLS / 10.2.2.1：
ML Estimation of the SAR Model / 10.2.2.2：
Spatially Correlated Errors / 10.2.3：
Individual Heterogeneity in Spatial Panels / 10.3：
Random versus Fixed Effects / 10.3.1：
Spatial Panel Models with Error Components / 10.3.2：
Spatial Panels with Independent Random Effects / 10.3.2.1：
Spatially Correlated Random Effects / 10.3.2.2：
Estimation / 10.3.3：
Spatial Models with a General Error Covariance / 10.3.3.1：
General Maximum Likelihood Framework / 10.3.3.2：
Generalized Moments Estimation / 10.3.3.3：
Testing / 10.3.4：
LM Tests for Random Effects and Spatial Errors / 10.3.4.1：
Testing for Spatial Lag vs Error / 10.3.4.2：
Serial and Spatial Correlation / 10.4：
Maximum Likelihood Estimation / 10.4.1：
Serial and Spatial Correlation in the Random Effects Model / 10.4.1.1：
Serial and Spatial Correlation with KKP-Type Effects / 10.4.1.2：
Tests for Random Effects, Spatial, and Serial Error Correlation / 10.4.2：
Spatial Lag vs Error in the Serially Correlated Model / 10.4.2.2：
Bibliography
Preface
Acknowledgments
About the Companion Website
74.

電子ブック
ＥＢ
74. Electronic Postage Systems
Gerrit Bleumer
出版情報: Springer eBooks Computer Science , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
List of Figures
List of Tables
Foreword
Preface
Acknowledgements
Introduction / 1：
What is Electronic Postage / 1.1：
Short History of Postage / 1.2：
Fraud, Meter Manipulation and Countermeasures / 1.3：
The Rise of Electronic Postage / 1.4：
Advancing Postal Markets / 1.5：
Postal Security / 1.5.1：
Postal Liberalization / 1.5.2：
Competitive Postal Operators / 1.5.3：
Postal Presorters / 1.5.4：
International Mail / 1.5.5：
Outlook / 1.6：
Electronic Postage Systems / 2：
General Model of E-Postage Systems / 2.1：
E-Postage Devices / 2.1.1：
E-Postage Minting System / 2.1.2：
Indicia / 2.1.3：
Mail Processing and Verification / 2.1.4：
Multi-Carrier Capabilities / 2.1.5：
Interface to E-Postage Provider / 2.2：
Storing Electronic Postage / 2.2.2：
Computing Secure Indicia / 2.2.3：
Postal Security Devices / 2.2.4：
Value Added Services / 2.3：
Postage Rate Tables / 2.3.1：
Acquiring Usage Data from E-postage Devices / 2.3.2：
Preparing Traceable Mail / 2.3.3：
Postage or Date Correction / 2.3.4：
Reply Mail / 2.3.5：
Commercial Metering Services / 2.3.6：
Addressing, Mail Forwarding and Return Services / 2.3.7：
General Architecture of E-Postage Systems / 3：
Closed Offline E-Postage Devices / 3.1：
Open Offline E-Postage Devices / 3.1.2：
Open Online E-postage Devices / 3.1.3：
E-Postage Provider System / 3.2：
Local and Remote State of an E-Postage Device / 3.2.1：
Offline E-Postage Device Interface / 3.2.2：
Online E-Postage Device Interface / 3.2.3：
Database of Remote States / 3.2.4：
System Operator Interface / 3.2.5：
Financial Interface / 3.2.6：
Postal Interface / 3.2.7：
Postal Registration Interface / 3.2.8：
Post Backoffice / 3.3：
Link to Bank / 3.3.1：
Link to E-Postage Provider / 3.3.2：
Link to Mail Processing Center / 3.3.3：
Mail Processing Centers / 3.4：
Processing Mail / 3.4.1：
Postage Verification at Mail Processing Centers / 3.4.2：
Cryptography Primer / 4：
Basic Cryptographic Mechanisms / 4.1：
Confidentiality and Privacy / 4.2：
Symmetric Encryption / 4.2.1：
Asymmetric Encryption / 4.2.2：
Constructions / 4.2.3：
Security of Encryption Mechanisms / 4.2.4：
Hash Functions / 4.3：
Message Authentication / 4.3.1：
Message Authentication Codes / 4.4.1：
Digital Signatures / 4.4.2：
Security of Message Authentication Mechanisms / 4.4.3：
Key Management / 4.5：
Key Management Life Cycle / 4.5.1：
Random Bit Generators / 4.5.2：
Session Key Establishment / 4.5.3：
Public Key Certificates / 4.5.4：
Security Domains / 4.5.5：
Security Architecture / 4.5.6：
General Security Architecture / 5：
What is a Security Architecture / 5.1：
Offline E-Postage Systems / 5.2：
Mail Processing Domain (A) / 5.2.1：
Refill Domain (B) / 5.2.2：
Online E-Postage Systems / 5.3：
Online E-Postage Domain (C) / 5.3.1：
Backoffice Security Domains / 5.4：
Provider Post Backoffice Domain (D) / 5.4.1：
Provider Bank Backoffice Domain (E) / 5.4.2：
Post Bank Backoffice Domain (F) / 5.4.3：
Summary of Cryptographic Keys / 5.5：
Industrial Offline E-Postage Systems / 6：
Industrial Offline E-Postage / 6.1：
The Closed Offline E-Postage Market / 6.2：
United States Postal Services / 6.3：
IBIP for Closed Systems / 6.3.1：
Postal Value Added Services / 6.3.2：
IBI-Lite for Closed Systems / 6.3.3：
Canada Post Corporation / 6.4：
Digital Meter Indicia Specification (DMIS) / 6.4.1：
Deutsche Post / 6.4.2：
Frankit / 6.5.1：
Netherlands Post (TPG Post) / 6.5.2：
Other Postal Markets / 6.7：
Preliminary Appraisal / 6.8：
Industrial Online E-Postage Systems / 7：
Industrial Online E-Postage / 7.1：
The Online E-Postage Market / 7.2：
IBIP for Open Online E-Postage Systems / 7.3：
IBI-Lite for Online E-Postage Systems / 7.3.2：
Stampit for Open Online E-Postage Systems / 7.4：
Security Risks in E-Postage Systems / 7.4.2：
Risk Management / 8.1：
Attacker Model / 8.2：
Backoffice Domains / 8.2.1：
Refill, Online E-Postage and Mail Delivery Domain / 8.2.2：
Threats to E-Postage Systems / 8.3：
Social Engineering / 8.3.1：
Refill Domain and Online E-Postage Domain / 8.3.2：
Mail Processing Domain / 8.3.4：
Algorithmic Level / 8.3.5：
Security Safeguards / 8.4：
Revenue Reconciliation / 8.4.1：
Privacy in E-Postage Systems / 8.4.2：
Anonymous Mail / 9.1：
R-Anonymous Mail / 9.1.1：
P-Anonymous Mail / 9.1.2：
Fully-Anonymous Mail / 9.1.3：
Anonymous Postmarks / 9.2：
Pseudonymity and Unlinkability / 9.2.1：
Anonymous Electronic Postmarks / 9.2.2：
Availability / 9.3：
Evaluation, Assurance and Postal Approval / 10：
Terminology / 10.1：
The Postal Approval Process / 10.2：
The Security Evaluation Process / 10.2.1：
Security Compliance Testing / 10.3：
FIPS 140 / 10.3.1：
International Postage Meter Approval Requirements / 10.3.2：
Security Model of Digital Postage Meters / 10.3.3：
FIPS 140 vs. Common Criteria / 10.3.4：
Integration Testing of E-Postage Provider System / 10.4：
Readability Testing / 10.5：
Postal Standardization Bodies / 10.6：
CEN TC 331 Postal Services / 10.6.1：
Universal Postal Union (UPU) / 10.6.2：
The Future of Electronic Postage / 11：
References
List of Acronyms / Appendix A：
About the Author / Appendix B：
Index
List of Figures
List of Tables
Foreword
75.

電子ブック
ＥＢ
75. Semantic Grid: Model, Methodology, and Applications
Zhaohui Wu, Hua-jun Chen, Huajun Chen, Zhao-hui Wu
出版情報: Springer eBooks Computer Science , Springer, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Background / 1.1：
Grid Computing / 1.1.1：
Semantic Web / 1.1.2：
Semantic Grid / 1.2：
Basic Concepts / 1.2.1：
Brief History / 1.2.2：
Basic Issues / 1.3：
Knowledge Representation for the Semantic Grid / 1.3.1：
Semantic Data Integration / 1.3.2：
Semantic Service Composition and Process Coordination / 1.3.3：
Semantic Mining and Knowledge Discovery in the Semantic Grid / 1.3.4：
Trust and Security / 1.3.5：
Case Studies / 1.4：
myGrid / 1.4.1：
CombeChem / 1.4.2：
CoAKTinG / 1.4.3：
K-WF Grid / 1.4.4：
Semantic Grid Research and Development in China / 1.4.5：
Summary and Conclusion / 1.5：
References
Knowledge Representation / 2：
Mathematical Logic / 2.2.1：
Semantic Network / 2.2.2：
Frames / 2.2.3：
Ontology / 2.2.4：
Description Logic / 2.3：
Knowledge Representation Framework for the Semantic Grid / 2.4：
XML and XML Schema / 2.4.1：
RDF and RDF Schema / 2.4.2：
Web Ontology Language / 2.4.3：
Ontology Development and Application for TCM / 2.5：
Ontology Design and Development for UTCMLS / 2.5.1：
TCM Ontology / 2.5.2：
Dynamic Problem Solving in the Semantic Grid / 2.6：
Problem Solving / 3.1：
Cooperative Distributed Problem Solving / 3.1.2：
Multi-Agent System / 3.1.3：
Grid-based Problem Solving / 3.2：
Grid and Problem Solving / 3.2.1：
Problem Solving in the Semantic Grid / 3.2.2：
Ontology Management for Grid-based Problem Solving / 3.3：
Grid-based Ontology Management / 3.3.1：
Ontology Grid Node / 3.3.2：
Semantic View / 3.3.3：
Ontology Reuse for Grid-based Problem Solving / 3.4：
Dynamic Memory Model / 3.4.1：
Case-based Ontology Repository / 3.4.2：
Dynamic Problem Solving Based on SubO Evolution / 3.5：
Sub-Ontology Manipulations / 3.5.1：
Terminology / 3.5.2：
Problem-Solving Environment / 3.5.3：
Sub-Ontology Based Problem Solving / 3.5.4：
The Relationship between Problem Solving and the Semantic Grid / 3.6：
Related Works / 3.7：
Trust Computing in the Semantic Grid / 3.8：
Trust for the Semantic Grid / 4.1：
Characteristic Features of Trust / 4.2.1：
Cost and Utility / 4.2.2：
Distributed vs. Centralized / 4.2.3：
Semantics of Information / 4.2.4：
Closed Trust Model / 4.3：
Open Trust Model / 4.4：
Experiments / 4.5：
Related Work / 4.6：
Data Integration in the Semantic Grid / 4.7：
Preliminaries / 5.1：
Semantic Mapping in the Semantic Grid / 5.2：
The Mapping Issue / 5.2.1：
Basic Mapping System / 5.2.2：
Constraint Mapping / 5.2.3：
Semantic Query Processing in the Semantic Grid / 5.3：
Answering Queries Using SHIQ-RDM Views / 5.3.1：
Rewriting SPARQL Queries Using SHIQ-RDM Views / 5.3.2：
Service Flow Management in the Semantic Grid / 5.4：
Research Framework of Service Flow Management / 6.1：
Service Matchmaking and Discovery / 6.2.1：
Service Composition / 6.2.2：
Service Composition Verification / 6.2.3：
Service Matchmaking in DartFlow / 6.3：
An Extended Service Model / 6.3.1：
Service Matchmaking / 6.3.2：
Performance Evaluation / 6.3.3：
Service Composition in DartFlow / 6.4：
Service Composition Framework / 6.4.1：
Rules Types and Definitions / 6.4.2：
Automatic Service Composition Based on Rules / 6.4.3：
Service Flow Verification in DartFlow / 6.5：
Overview of [pi]-Calculus / 6.5.1：
Modeling Service Behavior Using [pi]-Calculus / 6.5.2：
Verification of Service Compatibility / 6.5.3：
Data Mining and Knowledge Discovery in the Semantic Grid / 6.6：
Development of KDD System Architecture / 7.1：
Single-computer-based Architecture / 7.2.1：
Parallelized Architecture / 7.2.2：
Distributed Architecture / 7.2.3：
Grid-based Architecture / 7.2.4：
A Summary of the Development of KDD System Architecture / 7.2.5：
Knowledge Discovery Based on the Semantic Grid / 7.3：
Virtual Organizations of Knowledge Discovery in the Semantic Grid / 7.3.1：
Architecture and Components of Knowledge Discovery in the Semantic Grid / 7.3.2：
Characteristics of Knowledge Discovery in the Semantic Grid / 7.3.3：
Drug Community Discovery Utilizing TCM Semantic Grid / 7.4：
Semantic Graph Mining Methodology / 7.4.1：
Use Case: TCM Formulae Interpretation and Herb-Drug Interaction Analysis / 7.4.2：
DartGrid: A Semantic Grid Implementation / 7.5：
DartDB-A Semantic Data Integration Toolkit / 8.1：
Overview / 8.2.1：
System Features / 8.2.2：
System Architecture / 8.2.3：
Mapping from Relational Data to Semantic Web Ontology / 8.2.4：
Semantic Browser and Query Tool / 8.2.5：
Semantic Search Engine / 8.2.6：
DartFlow-A Service Flow Management Prototype / 8.3：
Main Functions / 8.3.1：
Semantic Grid Applications for Traditional Chinese Medicine / 8.4：
Background, Status, and Problems of TCM Informatics / 9.1：
Background of TCM Informatics / 9.1.1：
Status of TCM Informatics / 9.1.2：
Problems of TCM Informatics / 9.1.3：
The Architecture of TCM e-Science Semantic Grid / 9.2：
Three Layers of TCM e-Science Environment / 9.2.1：
Application Platforms in TCM e-Science Environment / 9.2.3：
Collaborative TCM Ontology Engineering / 9.3：
Creating a Semantic Grid of TCM Databases / 9.4：
A Semantic Grid Environment for Database Construction / 9.5：
TCM Knowledge Discovery Platform / 9.6：
Summary / 9.7：
Semantic Grid Applications in Intelligent Transportation Systems / 10：
ITS System and Grid Computing / 10.1：
ITS System and Ontology / 10.1.2：
Layered Architecture for ITS-Grid / 10.2：
ITS Semantic Grid / 10.3：
The Development of an ITS Ontology / 10.3.1：
ITS-Grid Applications / 10.3.2：
Case Study / 10.4：
Index / 10.5：
Introduction / 1：
Background / 1.1：
Grid Computing / 1.1.1：
76.

電子ブック
ＥＢ
76. Human-Centered Visualization Environments
Andreas Kerren, Achim Ebert, Takeo Kanade, J?rg Meyer
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
List of Contributors
Introduction to Human-Centered Visualization Environments / A. Kerren ; A. Ebert ; J. Meyer1：
Fundamental Principles and Methods / Part I：
Human-Centered Aspects / O. Kulyk ; R. Kosara ; J. Urquiza ; I. Wassink2：
Human-Centered Approach / 2.1：
Usability in Human-Centered Design / 2.2：
Defining Usability / 2.2.1：
Evaluating Usability / 2.2.2：
Improving Usability / 2.2.3：
Usability and Information Overload / 2.2.4：
User Aims and Requirements / 2.3：
Characteristics of Good Visualizations and User Interfaces / 2.3.1：
Essential Elements of Successful Visualization / 2.3.2：
Dimensions in Visualization / 2.3.3：
Steps in Visualization Design / 2.3.4：
The Design Cycle / 2.3.5：
User Analysis / 2.3.6：
User Requirements / 2.3.7：
Task Analysis / 2.3.8：
Task Modeling / 2.3.9：
Designing for and with Users / 2.3.10：
Evaluation of Visualization Environments / 2.4：
Human-Centered Evaluation in Visualization Practice / 2.4.1：
Evaluation Methods / 2.4.2：
Designing Experiments / 2.4.3：
Challenges in Evaluation of Collaborative Visualization Environments / 2.4.4：
User Studies and a Science of Visualization / 2.5：
Survey of Information Visualization Studies / 2.5.1：
The Future of User Studies / 2.5.2：
Chapter Notes / 2.6：
Interacting with Visualizations / W. Fikkert ; M. D'Ambros ; T. Bierz ; T.J. Jankun-Kelly3：
Interaction / 3.1：
Describing Interaction / 3.1.1：
Defining Interaction / 3.1.2：
Influences of Display Technologies / 3.2：
Survey of Display Technologies / 3.2.1：
Scales of Interaction / 3.2.2：
Display Interaction Modalities and Media / 3.2.3：
Interfaces and Usability for Novel Displays / 3.2.4：
Display Device Challenges in Visualization / 3.2.5：
Multimodal Interaction / 3.3：
Unimodality Versus Multimodality / 3.3.1：
Issues to Deal with in Multimodal Interaction / 3.3.2：
Myths of Multimodality / 3.3.3：
Survey of Enabling Technologies / 3.3.4：
Overview of Approaches to Multimodal Interaction / 3.3.5：
Enabling Multimodal Interaction / 3.3.6：
Visualizations in Multi-party Environments / 3.4：
Collaborating with Visualizations / 3.4.1：
Models for Distributed Collaborative Visualization / 3.4.2：
Evaluation Criteria / 3.4.3：
Survey of Collaborative Visualization Systems / 3.4.4：
Challenges for Multi-party Visualizations / 3.4.5：
Visual Representations / C. Gorg ; M. Pohl ; E. Qeli ; K. Xu3.5：
Perceptual and Cognitive Issues / 4.1：
The Visualization Process / 4.1.1：
Types of Data / 4.1.2：
Preattentive Processing / 4.1.3：
Information Visualization Criteria and Metaphors / 4.2：
Information Visualization Criteria / 4.2.1：
Metaphors / 4.2.2：
Multivariate Visualization Techniques / 4.3：
Low-Dimensional Data Visualization / 4.3.1：
Multidimensional Data Visualization / 4.3.2：
Usability Issues on Multidimensional Data Visualization / 4.3.3：
Graphs and Trees / 4.4：
Applications / 4.4.1：
Background / 4.4.2：
Aesthetics vs. Graph Readability / 4.4.3：
Layout vs. Graph Readability / 4.4.4：
Large Graphs / 4.4.5：
Integrated Graph Drawing / 4.4.6：
Labeling of Graphs / 4.4.7：
Multiple Views / 4.5：
Classification / 4.5.1：
The Design of Multiple Views / 4.5.2：
Comparison with Integrated Views / 4.5.3：
Challenges and Unsolved Problems / R.S. Laramee4.6：
Classification of Future Challenges and Unsolved Problems in Human-Centered Visualization / 5.1：
Human-Centered Challenges / 5.1.1：
Technical Challenges / 5.1.2：
Financial Challenges / 5.1.3：
Domain-Specific Visualization / 5.2：
Geographic Visualization / M. Nollenburg6：
Goals of Geovisualization / 6.1：
Driving Forces of Geovisualization / 6.2：
Cognitive Aspects / 6.3：
Visual Thinking / 6.3.1：
Graphic Variables / 6.3.2：
Visualization Methods and Techniques / 6.4：
Geospatial Data / 6.4.1：
2D Cartographic Visualization / G.4.2：
3D Cartographic Visualization / 6.4.3：
Visual Data Mining Tools / 6.4.4：
Animation / 6.4.5：
Spatio-Temporal Visualization / 6.4.6：
Interactive User Interfaces / 6.4.7：
Combining Visual and Computational Exploration / 6.4.8：
Geovisualization Tools / 6.5：
Usability of Geovisualization Systems / 6.6：
Involving Users in the Design of Geovisualizations / 6.6.1：
Results from User Studies / 6.6.2：
Geovisualization to Support Group Work / 6.6.3：
Algorithm Animation / A. Moreno6.7：
Overview / 7.1：
Users of Algorithm Animation / 7.2：
Taxonomies for Algorithm Animation Tools / 7.3：
Review of Tools and Their Evaluations / 7.4：
Concept Keyboards for Algorithm Visualization / 7.4.1：
Matrix and MatrixPro / 7.4.2：
Alvis and Alvis Live! / 7.4.3：
Alice / 7.4.4：
Jeliot 3/Jeliot 2000 / 7.4.5：
JHAVE / 7.4.6：
WinHipe / 7.4.7：
User Studies Compilation / 7.4.8：
Biomedical Information Visualization / M. Lungu7.5：
Phylogenetic Tree Visualization / 8.1：
Small Trees - Working in Euclidean Space / 8.1.1：
Large Trees - Using Focus and Context / 8.1.2：
Very Large Trees - Hyperbolic 3D Space / 8.1.3：
Discussion and Further Reading / 8.1.4：
Sequence Alignment / 8.2：
Sequence Logos / 8.2.1：
Editing and Visualizing Sequence Alignment: Jalview / 8.2.2：
Vista: Online Visualization of DNA Alignment / 8.2.3：
Sequence Walkers / 8.2.4：
Dot Plots / 8.2.5：
Arc Diagrams / 8.2.6：
Biochemical Network Analysis / 8.2.7：
Cytoscape / 8.3.1：
Biochemical Pathway Analysis / 8.3.2：
Layout for Large Biochemical Networks: LGL / 8.3.3：
Microarray Data Visualization / 8.3.4：
Tree View / 8.4.1：
Hierarchical Clustering Explorer / 8.4.2：
Evaluation of Microarray Visualization Tools / 8.4.3：
Medical Records Visualization / 8.5：
LifeLines: Visualizing Patient Temporal Data / 8.5.1：
The Cube: Multidimensional Analysis of Medical Records / 8.5.2：
Visualizing Medical Practice Guidelines and Protocols / 8.5.3：
Bibliography / 8.6：
Author Index
Index
Preface
List of Contributors
Introduction to Human-Centered Visualization Environments / A. Kerren ; A. Ebert ; J. Meyer1：
77.

電子ブック
ＥＢ
77. Electronic Postage Systems
Gerrit Bleumer
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
List of Figures
List of Tables
Foreword
Preface
Acknowledgements
Introduction / 1：
What is Electronic Postage / 1.1：
Short History of Postage / 1.2：
Fraud, Meter Manipulation and Countermeasures / 1.3：
The Rise of Electronic Postage / 1.4：
Advancing Postal Markets / 1.5：
Postal Security / 1.5.1：
Postal Liberalization / 1.5.2：
Competitive Postal Operators / 1.5.3：
Postal Presorters / 1.5.4：
International Mail / 1.5.5：
Outlook / 1.6：
Electronic Postage Systems / 2：
General Model of E-Postage Systems / 2.1：
E-Postage Devices / 2.1.1：
E-Postage Minting System / 2.1.2：
Indicia / 2.1.3：
Mail Processing and Verification / 2.1.4：
Multi-Carrier Capabilities / 2.1.5：
Interface to E-Postage Provider / 2.2：
Storing Electronic Postage / 2.2.2：
Computing Secure Indicia / 2.2.3：
Postal Security Devices / 2.2.4：
Value Added Services / 2.3：
Postage Rate Tables / 2.3.1：
Acquiring Usage Data from E-postage Devices / 2.3.2：
Preparing Traceable Mail / 2.3.3：
Postage or Date Correction / 2.3.4：
Reply Mail / 2.3.5：
Commercial Metering Services / 2.3.6：
Addressing, Mail Forwarding and Return Services / 2.3.7：
General Architecture of E-Postage Systems / 3：
Closed Offline E-Postage Devices / 3.1：
Open Offline E-Postage Devices / 3.1.2：
Open Online E-postage Devices / 3.1.3：
E-Postage Provider System / 3.2：
Local and Remote State of an E-Postage Device / 3.2.1：
Offline E-Postage Device Interface / 3.2.2：
Online E-Postage Device Interface / 3.2.3：
Database of Remote States / 3.2.4：
System Operator Interface / 3.2.5：
Financial Interface / 3.2.6：
Postal Interface / 3.2.7：
Postal Registration Interface / 3.2.8：
Post Backoffice / 3.3：
Link to Bank / 3.3.1：
Link to E-Postage Provider / 3.3.2：
Link to Mail Processing Center / 3.3.3：
Mail Processing Centers / 3.4：
Processing Mail / 3.4.1：
Postage Verification at Mail Processing Centers / 3.4.2：
Cryptography Primer / 4：
Basic Cryptographic Mechanisms / 4.1：
Confidentiality and Privacy / 4.2：
Symmetric Encryption / 4.2.1：
Asymmetric Encryption / 4.2.2：
Constructions / 4.2.3：
Security of Encryption Mechanisms / 4.2.4：
Hash Functions / 4.3：
Message Authentication / 4.3.1：
Message Authentication Codes / 4.4.1：
Digital Signatures / 4.4.2：
Security of Message Authentication Mechanisms / 4.4.3：
Key Management / 4.5：
Key Management Life Cycle / 4.5.1：
Random Bit Generators / 4.5.2：
Session Key Establishment / 4.5.3：
Public Key Certificates / 4.5.4：
Security Domains / 4.5.5：
Security Architecture / 4.5.6：
General Security Architecture / 5：
What is a Security Architecture / 5.1：
Offline E-Postage Systems / 5.2：
Mail Processing Domain (A) / 5.2.1：
Refill Domain (B) / 5.2.2：
Online E-Postage Systems / 5.3：
Online E-Postage Domain (C) / 5.3.1：
Backoffice Security Domains / 5.4：
Provider Post Backoffice Domain (D) / 5.4.1：
Provider Bank Backoffice Domain (E) / 5.4.2：
Post Bank Backoffice Domain (F) / 5.4.3：
Summary of Cryptographic Keys / 5.5：
Industrial Offline E-Postage Systems / 6：
Industrial Offline E-Postage / 6.1：
The Closed Offline E-Postage Market / 6.2：
United States Postal Services / 6.3：
IBIP for Closed Systems / 6.3.1：
Postal Value Added Services / 6.3.2：
IBI-Lite for Closed Systems / 6.3.3：
Canada Post Corporation / 6.4：
Digital Meter Indicia Specification (DMIS) / 6.4.1：
Deutsche Post / 6.4.2：
Frankit / 6.5.1：
Netherlands Post (TPG Post) / 6.5.2：
Other Postal Markets / 6.7：
Preliminary Appraisal / 6.8：
Industrial Online E-Postage Systems / 7：
Industrial Online E-Postage / 7.1：
The Online E-Postage Market / 7.2：
IBIP for Open Online E-Postage Systems / 7.3：
IBI-Lite for Online E-Postage Systems / 7.3.2：
Stampit for Open Online E-Postage Systems / 7.4：
Security Risks in E-Postage Systems / 7.4.2：
Risk Management / 8.1：
Attacker Model / 8.2：
Backoffice Domains / 8.2.1：
Refill, Online E-Postage and Mail Delivery Domain / 8.2.2：
Threats to E-Postage Systems / 8.3：
Social Engineering / 8.3.1：
Refill Domain and Online E-Postage Domain / 8.3.2：
Mail Processing Domain / 8.3.4：
Algorithmic Level / 8.3.5：
Security Safeguards / 8.4：
Revenue Reconciliation / 8.4.1：
Privacy in E-Postage Systems / 8.4.2：
Anonymous Mail / 9.1：
R-Anonymous Mail / 9.1.1：
P-Anonymous Mail / 9.1.2：
Fully-Anonymous Mail / 9.1.3：
Anonymous Postmarks / 9.2：
Pseudonymity and Unlinkability / 9.2.1：
Anonymous Electronic Postmarks / 9.2.2：
Availability / 9.3：
Evaluation, Assurance and Postal Approval / 10：
Terminology / 10.1：
The Postal Approval Process / 10.2：
The Security Evaluation Process / 10.2.1：
Security Compliance Testing / 10.3：
FIPS 140 / 10.3.1：
International Postage Meter Approval Requirements / 10.3.2：
Security Model of Digital Postage Meters / 10.3.3：
FIPS 140 vs. Common Criteria / 10.3.4：
Integration Testing of E-Postage Provider System / 10.4：
Readability Testing / 10.5：
Postal Standardization Bodies / 10.6：
CEN TC 331 Postal Services / 10.6.1：
Universal Postal Union (UPU) / 10.6.2：
The Future of Electronic Postage / 11：
References
List of Acronyms / Appendix A：
About the Author / Appendix B：
Index
List of Figures
List of Tables
Foreword
78.

電子ブック
ＥＢ
78. Semantic Grid: Model, Methodology, and Applications
Zhaohui Wu, Hua-jun Chen, Huajun Chen, Zhao-hui Wu
出版情報: SpringerLink Books - AutoHoldings , Springer, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Background / 1.1：
Grid Computing / 1.1.1：
Semantic Web / 1.1.2：
Semantic Grid / 1.2：
Basic Concepts / 1.2.1：
Brief History / 1.2.2：
Basic Issues / 1.3：
Knowledge Representation for the Semantic Grid / 1.3.1：
Semantic Data Integration / 1.3.2：
Semantic Service Composition and Process Coordination / 1.3.3：
Semantic Mining and Knowledge Discovery in the Semantic Grid / 1.3.4：
Trust and Security / 1.3.5：
Case Studies / 1.4：
myGrid / 1.4.1：
CombeChem / 1.4.2：
CoAKTinG / 1.4.3：
K-WF Grid / 1.4.4：
Semantic Grid Research and Development in China / 1.4.5：
Summary and Conclusion / 1.5：
References
Knowledge Representation / 2：
Mathematical Logic / 2.2.1：
Semantic Network / 2.2.2：
Frames / 2.2.3：
Ontology / 2.2.4：
Description Logic / 2.3：
Knowledge Representation Framework for the Semantic Grid / 2.4：
XML and XML Schema / 2.4.1：
RDF and RDF Schema / 2.4.2：
Web Ontology Language / 2.4.3：
Ontology Development and Application for TCM / 2.5：
Ontology Design and Development for UTCMLS / 2.5.1：
TCM Ontology / 2.5.2：
Dynamic Problem Solving in the Semantic Grid / 2.6：
Problem Solving / 3.1：
Cooperative Distributed Problem Solving / 3.1.2：
Multi-Agent System / 3.1.3：
Grid-based Problem Solving / 3.2：
Grid and Problem Solving / 3.2.1：
Problem Solving in the Semantic Grid / 3.2.2：
Ontology Management for Grid-based Problem Solving / 3.3：
Grid-based Ontology Management / 3.3.1：
Ontology Grid Node / 3.3.2：
Semantic View / 3.3.3：
Ontology Reuse for Grid-based Problem Solving / 3.4：
Dynamic Memory Model / 3.4.1：
Case-based Ontology Repository / 3.4.2：
Dynamic Problem Solving Based on SubO Evolution / 3.5：
Sub-Ontology Manipulations / 3.5.1：
Terminology / 3.5.2：
Problem-Solving Environment / 3.5.3：
Sub-Ontology Based Problem Solving / 3.5.4：
The Relationship between Problem Solving and the Semantic Grid / 3.6：
Related Works / 3.7：
Trust Computing in the Semantic Grid / 3.8：
Trust for the Semantic Grid / 4.1：
Characteristic Features of Trust / 4.2.1：
Cost and Utility / 4.2.2：
Distributed vs. Centralized / 4.2.3：
Semantics of Information / 4.2.4：
Closed Trust Model / 4.3：
Open Trust Model / 4.4：
Experiments / 4.5：
Related Work / 4.6：
Data Integration in the Semantic Grid / 4.7：
Preliminaries / 5.1：
Semantic Mapping in the Semantic Grid / 5.2：
The Mapping Issue / 5.2.1：
Basic Mapping System / 5.2.2：
Constraint Mapping / 5.2.3：
Semantic Query Processing in the Semantic Grid / 5.3：
Answering Queries Using SHIQ-RDM Views / 5.3.1：
Rewriting SPARQL Queries Using SHIQ-RDM Views / 5.3.2：
Service Flow Management in the Semantic Grid / 5.4：
Research Framework of Service Flow Management / 6.1：
Service Matchmaking and Discovery / 6.2.1：
Service Composition / 6.2.2：
Service Composition Verification / 6.2.3：
Service Matchmaking in DartFlow / 6.3：
An Extended Service Model / 6.3.1：
Service Matchmaking / 6.3.2：
Performance Evaluation / 6.3.3：
Service Composition in DartFlow / 6.4：
Service Composition Framework / 6.4.1：
Rules Types and Definitions / 6.4.2：
Automatic Service Composition Based on Rules / 6.4.3：
Service Flow Verification in DartFlow / 6.5：
Overview of [pi]-Calculus / 6.5.1：
Modeling Service Behavior Using [pi]-Calculus / 6.5.2：
Verification of Service Compatibility / 6.5.3：
Data Mining and Knowledge Discovery in the Semantic Grid / 6.6：
Development of KDD System Architecture / 7.1：
Single-computer-based Architecture / 7.2.1：
Parallelized Architecture / 7.2.2：
Distributed Architecture / 7.2.3：
Grid-based Architecture / 7.2.4：
A Summary of the Development of KDD System Architecture / 7.2.5：
Knowledge Discovery Based on the Semantic Grid / 7.3：
Virtual Organizations of Knowledge Discovery in the Semantic Grid / 7.3.1：
Architecture and Components of Knowledge Discovery in the Semantic Grid / 7.3.2：
Characteristics of Knowledge Discovery in the Semantic Grid / 7.3.3：
Drug Community Discovery Utilizing TCM Semantic Grid / 7.4：
Semantic Graph Mining Methodology / 7.4.1：
Use Case: TCM Formulae Interpretation and Herb-Drug Interaction Analysis / 7.4.2：
DartGrid: A Semantic Grid Implementation / 7.5：
DartDB-A Semantic Data Integration Toolkit / 8.1：
Overview / 8.2.1：
System Features / 8.2.2：
System Architecture / 8.2.3：
Mapping from Relational Data to Semantic Web Ontology / 8.2.4：
Semantic Browser and Query Tool / 8.2.5：
Semantic Search Engine / 8.2.6：
DartFlow-A Service Flow Management Prototype / 8.3：
Main Functions / 8.3.1：
Semantic Grid Applications for Traditional Chinese Medicine / 8.4：
Background, Status, and Problems of TCM Informatics / 9.1：
Background of TCM Informatics / 9.1.1：
Status of TCM Informatics / 9.1.2：
Problems of TCM Informatics / 9.1.3：
The Architecture of TCM e-Science Semantic Grid / 9.2：
Three Layers of TCM e-Science Environment / 9.2.1：
Application Platforms in TCM e-Science Environment / 9.2.3：
Collaborative TCM Ontology Engineering / 9.3：
Creating a Semantic Grid of TCM Databases / 9.4：
A Semantic Grid Environment for Database Construction / 9.5：
TCM Knowledge Discovery Platform / 9.6：
Summary / 9.7：
Semantic Grid Applications in Intelligent Transportation Systems / 10：
ITS System and Grid Computing / 10.1：
ITS System and Ontology / 10.1.2：
Layered Architecture for ITS-Grid / 10.2：
ITS Semantic Grid / 10.3：
The Development of an ITS Ontology / 10.3.1：
ITS-Grid Applications / 10.3.2：
Case Study / 10.4：
Index / 10.5：
Introduction / 1：
Background / 1.1：
Grid Computing / 1.1.1：
79.

電子ブック
ＥＢ
79. Human-Centered Visualization Environments
Andreas Kerren, Achim Ebert, Takeo Kanade, Jörg Meyer, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
List of Contributors
Introduction to Human-Centered Visualization Environments / A. Kerren ; A. Ebert ; J. Meyer1：
Fundamental Principles and Methods / Part I：
Human-Centered Aspects / O. Kulyk ; R. Kosara ; J. Urquiza ; I. Wassink2：
Human-Centered Approach / 2.1：
Usability in Human-Centered Design / 2.2：
Defining Usability / 2.2.1：
Evaluating Usability / 2.2.2：
Improving Usability / 2.2.3：
Usability and Information Overload / 2.2.4：
User Aims and Requirements / 2.3：
Characteristics of Good Visualizations and User Interfaces / 2.3.1：
Essential Elements of Successful Visualization / 2.3.2：
Dimensions in Visualization / 2.3.3：
Steps in Visualization Design / 2.3.4：
The Design Cycle / 2.3.5：
User Analysis / 2.3.6：
User Requirements / 2.3.7：
Task Analysis / 2.3.8：
Task Modeling / 2.3.9：
Designing for and with Users / 2.3.10：
Evaluation of Visualization Environments / 2.4：
Human-Centered Evaluation in Visualization Practice / 2.4.1：
Evaluation Methods / 2.4.2：
Designing Experiments / 2.4.3：
Challenges in Evaluation of Collaborative Visualization Environments / 2.4.4：
User Studies and a Science of Visualization / 2.5：
Survey of Information Visualization Studies / 2.5.1：
The Future of User Studies / 2.5.2：
Chapter Notes / 2.6：
Interacting with Visualizations / W. Fikkert ; M. D'Ambros ; T. Bierz ; T.J. Jankun-Kelly3：
Interaction / 3.1：
Describing Interaction / 3.1.1：
Defining Interaction / 3.1.2：
Influences of Display Technologies / 3.2：
Survey of Display Technologies / 3.2.1：
Scales of Interaction / 3.2.2：
Display Interaction Modalities and Media / 3.2.3：
Interfaces and Usability for Novel Displays / 3.2.4：
Display Device Challenges in Visualization / 3.2.5：
Multimodal Interaction / 3.3：
Unimodality Versus Multimodality / 3.3.1：
Issues to Deal with in Multimodal Interaction / 3.3.2：
Myths of Multimodality / 3.3.3：
Survey of Enabling Technologies / 3.3.4：
Overview of Approaches to Multimodal Interaction / 3.3.5：
Enabling Multimodal Interaction / 3.3.6：
Visualizations in Multi-party Environments / 3.4：
Collaborating with Visualizations / 3.4.1：
Models for Distributed Collaborative Visualization / 3.4.2：
Evaluation Criteria / 3.4.3：
Survey of Collaborative Visualization Systems / 3.4.4：
Challenges for Multi-party Visualizations / 3.4.5：
Visual Representations / C. Gorg ; M. Pohl ; E. Qeli ; K. Xu3.5：
Perceptual and Cognitive Issues / 4.1：
The Visualization Process / 4.1.1：
Types of Data / 4.1.2：
Preattentive Processing / 4.1.3：
Information Visualization Criteria and Metaphors / 4.2：
Information Visualization Criteria / 4.2.1：
Metaphors / 4.2.2：
Multivariate Visualization Techniques / 4.3：
Low-Dimensional Data Visualization / 4.3.1：
Multidimensional Data Visualization / 4.3.2：
Usability Issues on Multidimensional Data Visualization / 4.3.3：
Graphs and Trees / 4.4：
Applications / 4.4.1：
Background / 4.4.2：
Aesthetics vs. Graph Readability / 4.4.3：
Layout vs. Graph Readability / 4.4.4：
Large Graphs / 4.4.5：
Integrated Graph Drawing / 4.4.6：
Labeling of Graphs / 4.4.7：
Multiple Views / 4.5：
Classification / 4.5.1：
The Design of Multiple Views / 4.5.2：
Comparison with Integrated Views / 4.5.3：
Challenges and Unsolved Problems / R.S. Laramee4.6：
Classification of Future Challenges and Unsolved Problems in Human-Centered Visualization / 5.1：
Human-Centered Challenges / 5.1.1：
Technical Challenges / 5.1.2：
Financial Challenges / 5.1.3：
Domain-Specific Visualization / 5.2：
Geographic Visualization / M. Nollenburg6：
Goals of Geovisualization / 6.1：
Driving Forces of Geovisualization / 6.2：
Cognitive Aspects / 6.3：
Visual Thinking / 6.3.1：
Graphic Variables / 6.3.2：
Visualization Methods and Techniques / 6.4：
Geospatial Data / 6.4.1：
2D Cartographic Visualization / G.4.2：
3D Cartographic Visualization / 6.4.3：
Visual Data Mining Tools / 6.4.4：
Animation / 6.4.5：
Spatio-Temporal Visualization / 6.4.6：
Interactive User Interfaces / 6.4.7：
Combining Visual and Computational Exploration / 6.4.8：
Geovisualization Tools / 6.5：
Usability of Geovisualization Systems / 6.6：
Involving Users in the Design of Geovisualizations / 6.6.1：
Results from User Studies / 6.6.2：
Geovisualization to Support Group Work / 6.6.3：
Algorithm Animation / A. Moreno6.7：
Overview / 7.1：
Users of Algorithm Animation / 7.2：
Taxonomies for Algorithm Animation Tools / 7.3：
Review of Tools and Their Evaluations / 7.4：
Concept Keyboards for Algorithm Visualization / 7.4.1：
Matrix and MatrixPro / 7.4.2：
Alvis and Alvis Live! / 7.4.3：
Alice / 7.4.4：
Jeliot 3/Jeliot 2000 / 7.4.5：
JHAVE / 7.4.6：
WinHipe / 7.4.7：
User Studies Compilation / 7.4.8：
Biomedical Information Visualization / M. Lungu7.5：
Phylogenetic Tree Visualization / 8.1：
Small Trees - Working in Euclidean Space / 8.1.1：
Large Trees - Using Focus and Context / 8.1.2：
Very Large Trees - Hyperbolic 3D Space / 8.1.3：
Discussion and Further Reading / 8.1.4：
Sequence Alignment / 8.2：
Sequence Logos / 8.2.1：
Editing and Visualizing Sequence Alignment: Jalview / 8.2.2：
Vista: Online Visualization of DNA Alignment / 8.2.3：
Sequence Walkers / 8.2.4：
Dot Plots / 8.2.5：
Arc Diagrams / 8.2.6：
Biochemical Network Analysis / 8.2.7：
Cytoscape / 8.3.1：
Biochemical Pathway Analysis / 8.3.2：
Layout for Large Biochemical Networks: LGL / 8.3.3：
Microarray Data Visualization / 8.3.4：
Tree View / 8.4.1：
Hierarchical Clustering Explorer / 8.4.2：
Evaluation of Microarray Visualization Tools / 8.4.3：
Medical Records Visualization / 8.5：
LifeLines: Visualizing Patient Temporal Data / 8.5.1：
The Cube: Multidimensional Analysis of Medical Records / 8.5.2：
Visualizing Medical Practice Guidelines and Protocols / 8.5.3：
Bibliography / 8.6：
Author Index
Index
Preface
List of Contributors
Introduction to Human-Centered Visualization Environments / A. Kerren ; A. Ebert ; J. Meyer1：
80.

電子ブック
ＥＢ
80. Finite Element Analysis of Antennas and Arrays
Jin, Jianming Jin, Douglas J. Riley
出版情報: Wiley Online Library - AutoHoldings Books , Wiley-IEEE Press, 2009
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introduction / 1：
Numerical Simulation of Antennas / 1.1：
Finite Element Analysis Versus Other Numerical Methods / 1.2：
Frequency-Versus Time-Domain Simulations / 1.3：
Brief Review of Past Work / 1.4：
Overview of the Book / 1.5：
References
Finite Element Formulation / 2：
Finite Element Formulation in the Frequency Domain / 2.1：
Finite Element Formulation in the Time Domain / 2.2：
Modeling of Complex Materials / 2.3：
Modeling of Electrically and Magnetically Lossy Materials / 2.3.1：
Modeling of Electrically Dispersive Materials / 2.3.2：
Modeling of Magnetically Dispersive Materials / 2.3.3：
Modeling of Doubly Dispersive Lossy Materials / 2.3.4：
Validation Examples / 2.3.5：
Solution of the Finite Element Equations / 2.4：
Higher-Order and Curvilinear Finite Elements / 2.5：
Summary / 2.6：
Finite Element Mesh Truncation / 3：
Absorbing Boundary Conditions / 3.1：
First-Order Absorbing Boundary Condition / 3.1.1：
Second-Order Absorbing Boundary Condition / 3.1.2：
Perfectly Matched Layers / 3.2：
PML in Terms of Stretched Coordinates / 3.2.1：
PML as an Anisotropic Material Absorber / 3.2.2：
PML for Truncating the Computational Domain / 3.2.3：
Finite Element Implementation of PML / 3.2.4：
ABC-Backed, Complementary, CFS, and Second-Order PMLs / 3.2.5：
Boundary Integral Equations / 3.3：
Frequency-Domain Formulations / 3.3.1：
Time-Domain Formulations / 3.3.2：
Treatment of the Infinite Ground Plane / 3.3.3：
Hybrid FETD-FDTD Technique / 3.4：
FDTD Method / 4.1：
PML Implementation in FDTD / 4.2：
FDTD Stretched-Coordinate PML / 4.2.1：
FDTD Anisotropic-Medium PML / 4.2.2：
Near-to-Far-Field Transformation in FDTD / 4.3：
Alternative FETD Formulation / 4.4：
Equivalence Between FETD and FDTD / 4.5：
Stable FETD-FDTD Interface / 4.6：
Initial Approaches / 4.6.1：
Stable Formulation / 4.6.2：
Building Hybrid Meshes / 4.7：
Wave-Equation Stabilization / 4.8：
Antenna Source Modeling and Parameter Calculation / 4.9：
Antenna Feed Modeling / 5.1：
Current Probe / 5.1.1：
Voltage Gap Generator / 5.1.2：
Waveguide Feed Model / 5.1.3：
Plane-Wave Excitation / 5.2：
Total-Field Formulation / 5.2.1：
Scattered-Field Formulation / 5.2.2：
Total-and Scattered-Field Decomposition Approach / 5.2.3：
Far-Field Pattern Computation / 5.3：
Near-Field Visualization / 5.4：
Modeling of Complex Structures / 5.5：
Thin-Material Layers and Sheets / 6.1：
Impedance Boundary Conditions / 6.1.1：
Shell Element Formulation / 6.1.2：
Thin Wires and Slots / 6.2：
Thin Wires / 6.2.1：
Thin Slots / 6.2.2：
Lumped-Circuit Elements / 6.3：
Coupled First-Order Equations / 6.3.1：
Wave Equation / 6.3.2：
Example / 6.3.3：
Distributed Feed Network / 6.4：
System-Level Coupling Example / 6.5：
Internal Dispersive Material Calibration / 6.5.1：
External Illumination and Aperture Coupling / 6.5.2：
Antenna Simulation Examples / 6.6：
Narrowband Antennas / 7.1：
Coaxial-Fed Monopole Antenna / 7.1.1：
Monopole Antennas on a Plate / 7.1.2：
Patch Antennas on a Plate / 7.1.3：
Conformal Patch Antenna Array / 7.1.4：
Broadband Antennas / 7.2：
Ridged Horn Antenna / 7.2.1：
Sinuous Antenna / 7.2.2：
Logarithmic Spiral Antenna / 7.2.3：
Inverted Conical Spiral Antenna / 7.2.4：
Antipodal Vivaldi Antenna / 7.2.5：
Vlasov Antenna / 7.2.6：
Antenna RCS Simulations / 7.3：
Microstrip Patch Antenna / 7.3.1：
Standard Gain Horn Antenna / 7.3.2：
Axisymmetric Antenna Modeling / 7.4：
Method of Analysis / 8.1：
Mesh Truncation Using Perfectly Matched Layers / 8.1.1：
Mesh Truncation Using Boundary Integral Equations / 8.1.3：
Far-Field Computation / 8.1.4：
Application Examples / 8.2：
Luneburg Lens / 8.2.1：
Corrugated Horn / 8.2.2：
Current Loop Inside a Radome / 8.2.3：
Infinite Phased-Array Modeling / 8.3：
Frequency-Domain Modeling / 9.1：
Periodic Boundary Conditions / 9.1.1：
Mesh Truncation Techniques / 9.1.2：
Extension to Skew Arrays / 9.1.3：
Extension to Scattering Analysis / 9.1.4：
Time-Domain Modeling / 9.1.5：
Transformed Field Variable / 9.2.1：
General Material Modeling / 9.2.2：
Approximation to Finite Arrays / 9.2.4：
Finite Phased-Array Modeling / 9.4：
FETI-DPEM1 Formulation / 10.1：
FETI-DPEM2 Formulation / 10.1.2：
Nonconforming Domain Decomposition / 10.1.3：
Dual-Field Domain-Decomposition Method / 10.1.4：
Domain Decomposition for Iterative Solutions / 10.2.2：
Antenna-Platform Interaction Modeling / 10.2.3：
Coupled Analysis / 11.1：
FETI-DPEM with Domain Decomposition / 11.1.1：
Hybrid FETD-FDTD with Domain Decomposition / 11.1.2：
Hybrid FE-BI Method with FMM Acceleration / 11.1.3：
Decoupled Analysis / 11.2：
Near-Field Calculation / 11.2.1：
Far-Field Evaluation by Numerical Methods / 11.2.2：
Far-Field Evaluation by Asymptotic Techniques / 11.2.3：
Direct and Interative Improvements / 11.2.4：
Numerical and Practical Considerations / 11.3：
Choice of Simulation Technologies / 12.1：
Frequency-Versus Time-Domain Simulation Tools / 12.2：
Fast Frequency Sweep / 12.3：
Numerical Convergence / 12.4：
Domain Decomposition and Parallel Computing / 12.5：
Verification and Validation of Predictions / 12.6：
Index / 12.7：
Acknowledgments
Finite Element Analysis vs. Other Numerical Methods / Chapter 1：
Frequency- vs. Time-Domain Simulations
Overview of This Book
PML for Truncating Computational Domain / Chapter 2：
Treatment of Infinite Ground Plane
The FDTD Method / Chapter 4：
FDTD Anisotropic PML
Equivalence between FETD and FDTD
Wave-Equation Stablization
Total- and Scattered-Field Decomposition Approach / Chapter 5：
Thin Material Layers and Sheets / Chapter 6：
Lumped Circuit Elements
Coaxial-fed Monopole Antenna / Chapter 7：
Axisymmetric Ant / Chapter 8：
Preface
Introduction / 1：
Numerical Simulation of Antennas / 1.1：
81.

電子ブック
ＥＢ
81. Hydrodynamic Limits of the Boltzmann Equation
Laure Saint-Raymond
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
The Sixth Problem of Hilbert / 1.1：
The Mathematical Treatment of the Axioms of Physics / 1.1.1：
From Microscopic to Macroscopic Equations / 1.1.2：
Formal Study of the Transitions / 1.2：
Scalings / 1.2.1：
Hydrodynamic Limits / 1.2.2：
The Probabilistic Approach / 1.3：
The Euler Limit / 1.3.1：
The Incompressible Navier-Stokes Equations / 1.3.2：
The Analytic Approach / 1.4：
Formal Derivations / 1.4.1：
Convergence Proofs Based on Asymptotic Expansions / 1.4.2：
Convergence Proofs Based on Spectral Results / 1.4.3：
A Program of Deriving Weak Solutions / 1.4.4：
The Boltzmann Equation and its Formal Hydrodynamic Limits / 2：
Formulation and Fundamental Properties of the Boltzmann Equation / 2.1：
The Boltzmann Collision Integral / 2.1.1：
Local Conservation Laws / 2.1.2：
Boltzmann's H Theorem / 2.1.3：
Orders of Magnitude and Qualitative Behaviour of the Boltzmann Equation / 2.2：
Nondimensional Form of the Boltzmann Equation / 2.2.1：
Hydrodynamic Regimes / 2.2.2：
Corrections to Hydrodynamic Approximations / 2.2.3：
Taking into Account the Boundary / 2.2.4：
Mathematical Theories for the Boltzmann Equation / 2.3：
Perturbative Framework: Global Existence of Smooth Solutions / 2.3.1：
Physical Framework : Global Existence of Renormalized Solutions / 2.3.2：
Further Results in One Space Dimension / 2.3.3：
Mathematical Tools for the Derivation of Hydrodynamic Limits / 3：
Physical a Priori Estimates : Definition of Suitable Functional Spaces / 3.1：
The Entropy Bound / 3.1.1：
The Darrozès-Guiraud Information / 3.1.2：
The Entropy Dissipation Bound / 3.1.3：
Properties of the Collision Operator : Relaxation Towards Equilibrium and Regularization in ? Variables / 3.2：
Some Results in the Non Perturbative Framework / 3.2.1：
Coercivity of the Linearized Collision Operator / 3.2.2：
Improving Integrability with Respect to the ? Variables / 3.2.3：
Properties of the Free Transport Operator: Dispersion and Averaging Lemmas / 3.3：
Dispersive Properties of the Free-Transport Operator / 3.3.1：
The Case of a Spatial Domain with Boundaries / 3.3.3：
The Incompressible Navier-Stokes Limit / 4：
Convergence Result : From the Boltzmann Equation to the Incompressible Navier-Stokes-Fourier System / 4.1：
Mathematical Theories for the Incompressible Navier-Stokes Equations / 4.1.1：
Analogies with the Scaled Boltzmann Equation / 4.1.2：
Statement of the Result / 4.1.3：
The Moment Method / 4.2：
Description of the Strategy / 4.2.1：
Convergence of the Conservation Defects / 4.2.2：
Decomposition of the Flux Term / 4.2.3：
Study of the Convection and Diffusion Terms / 4.3：
Spatial Regularity Coming from Averaging Lemmas / 4.3.1：
Filtering of Acoustic Waves / 4.3.2：
Convergence of the Nonlinear Convection Term / 4.3.3：
Convergence of the Diffusion Term / 4.3.4：
Taking into Account Boundary Conditions / 4.4：
A Priori Estimates Coming from the Inside / 4.4.1：
A Priori Estimates Coming from the Boundary / 4.4.2：
The Limiting Boundary Conditions / 4.4.3：
The Incompressible Euler Limit / 5：
Convergence Result : From the Boltzmann Equation to the Incompressible Euler System / 5.1：
Mathematical Theories for the Incompressible Euler Equations / 5.1.1：
The Convergence Results for "Well-Prepared" Initial Data / 5.1.2：
The Convergence Result for General Initial Data / 5.1.4：
The Relative Entropy Method / 5.2：
The Stability Inequality in the Framework of Renormalized Solutions / 5.2.1：
The Stability Inequality Under the Additional Integrability Assumption / 5.2.3：
The Case of "Well-Prepared" Initial Data / 5.3：
Control of the Flux Term / 5.3.1：
Proof of Theorem 5.1.8 and Corollary 5.1.9 / 5.3.2：
Taking into Account Acoustic Waves / 5.4：
Construction of Approximate Solutions by a Filtering Method / 5.4.1：
Control of the Flux Term and Proof of Convergence / 5.4.2：
Taking into Account the Knudsen Layer / 5.5：
The Refined Stability Inequality / 5.5.1：
Construction of An Approximate Solution / 5.5.2：
The Compressible Euler Limit / 5.5.3：
Mathematical Theories for the Compressible Euler System / 6.1：
Local Smooth Solutions / 6.1.1：
Weak and Entropic Solutions / 6.1.2：
Global Entropic Solutions in One Spatial Dimension / 6.1.3：
Some Perspectives / 6.2：
Convergence Towards Smooth Solutions / 6.2.1：
Convergence Towards Weak Solutions in One Space Dimension / 6.2.2：
Appendix
Some Consequences of Egorov's Theorem / A：
The Product Limit Theorem / A.1：
An Asymptotic Result of Variables Separating / A.2：
Classical Trace Results on the Solutions of Transport Equations / B：
Definition of the Trace / B.1：
Free Transport with Reflection at the Boundary / B.2：
Some Consequences of Chacon's Biting Lemma / C：
From Renormalized Convergence to Chacon's Convergence / C.1：
A Result of Partial Equiintegrability / C.2：
References
Index
Introduction / 1：
The Sixth Problem of Hilbert / 1.1：
The Mathematical Treatment of the Axioms of Physics / 1.1.1：
82.

電子ブック
ＥＢ
82. Construction of Global Lyapunov Functions Using Radial Basis Functions
Peter Giesl, J.M Morel, F. Takens
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
An Example: Chemostat / 1.1：
Lyapunov Functions and Radial Basis Functions / 1.2：
Overview / 1.3：
Lyapunov Functions / 2：
Introduction to Dynamical Systems / 2.1：
Basic Definitions and Concepts / 2.1.1：
Local Lyapunov Functions / 2.1.2：
The Function [characters not reproducible] (Jordan Normal Form) / 2.2.1：
The Function [characters not reproducible] (Matrix Equation) / 2.2.2：
Summary and Example / 2.2.3：
Global Lyapunov Functions / 2.3：
The Lyapunov Function T with Constant Orbital Derivative / 2.3.1：
Level Sets of Lyapunov Functions / 2.3.2：
The Lyapunov Function V Defined in A(x[subscript 0]) / 2.3.3：
Taylor Polynomial of V / 2.3.4：
Summary and Examples / 2.3.5：
Radial Basis Functions / 3：
Approximation / 3.1：
Approximation via Function Values / 3.1.1：
Approximation via Orbital Derivatives / 3.1.2：
Mixed Approximation / 3.1.3：
Wendland Functions / 3.1.4：
Native Space / 3.2：
Characterization of the Native Space / 3.2.1：
Positive Definiteness of the Interpolation Matrices / 3.2.2：
Error Estimates / 3.2.3：
Construction of Lyapunov Functions / 4：
Non-Local Part / 4.1：
Local Part / 4.2：
Local Lyapunov Basin / 4.2.1：
Local Lyapunov Function / 4.2.2：
Taylor Polynomial / 4.2.3：
Global Determination of the Basin of Attraction / 5：
Approximation via a Single Operator / 5.1：
Approximation via Orbital Derivatives and Function Values / 5.1.1：
Stepwise Exhaustion of the Basin of Attraction / 5.2.2：
Application of the Method: Examples / 6：
Combination of a Local and Non-Local Lyapunov Function / 6.1：
Description / 6.1.1：
Examples / 6.1.2：
Approximation via Taylor Polynomial / 6.2：
Stepwise Exhaustion Using Mixed Approximation / 6.2.1：
Example / 6.3.1：
Conclusion / 6.4：
Appendices
Distributions and Fourier Transformation / A：
Distributions / A.1：
Fourier Transformation / A.2：
Data / B：
Figures / B.1：
Notations / C：
References
Index
Introduction / 1：
An Example: Chemostat / 1.1：
Lyapunov Functions and Radial Basis Functions / 1.2：
83.

電子ブック
ＥＢ
83. A Modern Approach to Intelligent Animation
Yueting Zhuang, Yunhe Pan, Jun Xiao
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Traditional Computer Animation Techniques / 1.1：
Key-frame Animation / 1.1.1：
Articulated Animation / 1.1.2：
Facial Expression Animation / 1.1.3：
Motion Capture Based Animation Techniques / 1.2：
Definition of Motion Capture / 1.2.1：
Introduction of Motion Capture Techniques / 1.2.2：
Summarization / 1.2.3：
Motion Editing and Reuse Techniques / 1.3：
Key-frame Editing / 1.3.1：
Motion Warping / 1.3.2：
Per-frame Editing / 1.3.3：
Per-frame Motion Editing Combing Filters / 1.3.4：
Spatio-temporal Constraint Based Motion Editing / 1.3.5：
Physical Property Based Motion Editing / 1.3.6：
Data-driven Animation Techniques / 1.4：
Data Synthesis Oriented Character Animation / 1.4.1：
Environment Sensitive Character Animation / 1.4.2：
Intelligent Animation / 1.5：
Characteristics and Requirements of Intelligent Animation / 1.5.1：
Overview of Video-based Intelligent Animation Techniques / 1.5.2：
References
Natural Video-based Human Motion Capture / 2：
Human Motion Capture Based on Feature Tracking / 2.1：
Human Skeleton Model / 2.1.1：
Feature Tracking in 2D Image Sequence / 2.1.2：
Reconstruction of 3D Human Motion Sequence / 2.1.3：
VBHAS V1.0 / 2.1.4：
Discussions / 2.1.5：
Human Motion Capture Based on Silhouette / 2.2：
Overview / 2.2.1：
Silhouette Extraction and Analysis / 2.2.2：
Pose Recovery / 2.2.3：
Motion Recovery / 2.2.4：
Results / 2.2.5：
Human Motion Capture Using Color Markers / 2.2.6：
Tracking Color Markers / 3.1：
Human Model and Color Space / 3.1.1：
Kalman Filter / 3.1.2：
Edge Detection and Edge Extraction / 3.1.3：
Rectangle Construction / 3.1.4：
Block Matching Algorithm / 3.1.5：
3D Recovery of Human Motion Data / 3.2：
Two-step Calibration / 3.2.1：
Selection of Start Points / 3.2.2：
Solving for Other Joints / 3.2.3：
Case Studies: VBHAS V2.0 / 3.3：
Results of Human Motion Tracking / 3.3.1：
Results of Human Motion 3D Reconstruction / 3.3.2：
Two-camera-based Human Motion Capture / 4：
Human Model / 4.1：
Human Motion Feature Tracking / 4.2：
Feature Tracking Algorithms Based on Kalman Filter and Epipolar Constraint / 4.2.1：
Feature Tracking Based on Attribute Quantification / 4.2.2：
Incomplete Motion Feature Tracking Algorithm in Video Sequences / 4.2.3：
Human Motion Tracking in Video via HMM / 4.2.4：
3D Motion Reconstruction / 4.3：
Tsai Single Camera Linear Calibration Algorithm / 4.3.1：
Nonlinear and Non-coplanar Calibration Model / 4.3.2：
3D Reconstruction of Motion Sequences / 4.3.3：
Case Studies: VBHAS V3.0 / 4.4：
Camera Calibration / 4.4.1：
Feature Tracking / 4.4.2：
3D Reconstruction / 4.4.3：
Video-based Facial Animation Techniques / 5：
Facial Expression Hallucination / 5.1：
Image-based Facial Expression Hallucination / 5.1.1：
Video-based Facial Expression Hallucination / 5.1.2：
Video-based Facial Expression Capture / 5.2：
Multiple Facial Feature Tracking Based on Bayesian Network Enhanced Prediction Model / 5.2.1：
Multiple Facial Feature Tracking Based on Probability Graph Model / 5.2.2：
3D Facial Expression Reconstruction / 5.2.3：
Video-based Human Face Modeling Techniques / 5.3：
Dimensionality Reduction by LLE / 5.3.1：
Active Shape Model (ASM) and Active Appearance Model (AAM) / 5.3.2：
3D Face Modeling / 5.3.3：
Constraint-based Texture Mapping / 5.3.4：
Results and Discussions / 5.3.5：
Facial Expression Driven Technique / 5.4：
Data Driven Facial Animation / 5.4.1：
Bayesian Regression / 5.4.2：
Intelligent Techniques for Processing and Management of Motion Data / 5.4.3：
Automatic Segmentation of 3D Human Motion Data into Primitive Actions / 6.1：
Overview of Motion Data Segmentation / 6.1.1：
An Automatic 3D Human Motion Data Segmentation Approach Based on Non-linear Dimensionality Reduction / 6.1.2：
Motion Data Abstraction / 6.1.3：
Overview of Motion Key-frame Extraction / 6.2.1：
Key-frame Extraction from MoCap Data Based on Layered Curve Simplification Algorithm / 6.2.2：
Motion Data Retrieval / 6.2.3：
Motion Index Tree / 6.3.1：
Content-based Motion Retrieval / 6.3.2：
Intelligent Motion Data Reusing Techniques / 6.3.3：
3D Motion Editing and Synthesis Based on Wavelet Transform / 7.1：
Hierarchical Motion Description / 7.1.1：
Motion Signal Analysis by Wavelet / 7.1.2：
3D Motion Analysis and Synthesis Based on Wavelet Transform / 7.1.3：
Management of Motion Reality / 7.1.4：
Motion Graph Modeling Based on Markov Chain / 7.1.5：
Motion Graph Building / 7.2.1：
3D Motion Generation Based on Motion Graph / 7.2.2：
Automatic Synthesis and Editing of Motion Styles / 7.2.3：
Motion Data Preprocessing / 7.3.1：
Motion Synthesis and Editing Algorithm for Single Style Component / 7.3.2：
Motion Synthesis and Editing Algorithm for Multiple Style Components / 7.3.3：
Intelligent Techniques for Character Animation / 7.3.4：
Multiple Animated Characters Motion Fusion / 8.1：
Architecture of Multiple Animated Characters Motion Fusion / 8.1.1：
Collaboration of Multiple Animated Characters / 8.1.2：
Solving Continuous Motions / 8.1.3：
Motion Rectification / 8.1.4：
A Script Engine for Realistic Human Motion Generation / 8.1.5：
Motion Database Setup / 8.2.1：
Motion Script / 8.2.2：
Motion Generation / 8.2.3：
Automatic Generation of Human Animation Based on Motion Programming / 8.2.4：
Roadmap Generation / 8.3.1：
Route Planning / 8.3.3：
Interaction and Optimization / 8.3.4：
Motion Acquisition / 8.3.5：
Animation Generation / 8.3.6：
Index / 8.3.7：
Introduction / 1：
Traditional Computer Animation Techniques / 1.1：
Key-frame Animation / 1.1.1：
84.

電子ブック
ＥＢ
84. Software Architecture
Zheng Qin, Jiankuan Xing, Xiang Zheng
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
The Evolution of Software Development-Concerns / 1.1.2：
The Origin and Growth of Software Architecture / 1.1.3：
Basic Terminologies / 1.2：
Understanding IEEE 1471-2000 / 1.2.2：
Views Used in Software Architecture / 1.2.3：
Why We Need Software Architecture / 1.2.4：
Where Is Software Architecture in Software Life Cycle / 1.2.5：
Summary / 1.3：
References
Architectural Styles and Patterns / 2：
Fundamentals of Architectural Styles and Patterns / 2.1：
Pipes Filters / 2.2：
Style Description / 2.2.1：
Study Case / 2.2.2：
Object-oriented / 2.3：
Event-driven / 2.3.1：
Hierarchical Layer / 2.4.1：
Data Sharing / 2.5.1：
Virtual Machine / 2.6.1：
Feedback Loop / 2.7.1：
Comparison among Styles / 2.8.1：
Integration of Heterogeneous Styles / 2.10：
Application and Analysis of Architectural Styles / 2.11：
Introduction to SMCSP / 3.1：
Program Background / 3.1.1：
Technical Routes / 3.1.2：
Function Design / 3.1.3：
System Realization / 3.2：
The Pattern Choice / 3.2.1：
Interaction Mechanism / 3.2.2：
Realization of Mobile Collaboration / 3.2.3：
Knowledge-based Design / 3.2.4：
Software Architecture Description / 3.3：
Formal Description of Software Architecture / 4.1：
Problems in Informal Description / 4.1.1：
Why Are Formal Methods Necessary / 4.1.2：
Architectural Description Language / 4.2：
Introduction to ADL / 4.2.1：
Comparing among Typical ADLs / 4.2.2：
Describing Architectural Behaviors / 4.2.3：
Study Case: WRIGHT System / 4.3：
Description of Component and Connector / 4.3.1：
Description of Configuration / 4.3.2：
Description of Style / 4.3.3：
CSP-Semantic Basis of Formal Behavior Description / 4.3.4：
FEAL: An Infrastructure to Construct ADLs / 4.4：
Design Purpose / 4.4.1：
FEC / 4.4.2：
FEAL Structure / 4.4.3：
FEAL Mapper / 4.4.4：
Examples of FEAL Application / 4.4.5：
Design Strategies in Architecture Level / 4.5：
From Reuse to Architecture Design / 5.1：
Architectural Design Space and Rules / 5.2：
SADPBA / 5.3：
Overview / 5.3.1：
Split Design Process with Design Space / 5.3.2：
Trace Mechanism in SADPBA / 5.3.3：
Life Cycle Model of Software Architecture / 5.3.4：
SADPBA in Practice / 5.3.5：
Study Case: MEECS / 5.4：
Introduction to MEECS / 5.4.1：
Applying SADPBA in MEECS / 5.4.2：
Software Architecture IDE / 5.5：
What Can Software Architecture IDE Do / 6.1：
A Comparison with Formalized Description Approach / 6.1.1：
Important Roles of Architecture IDE / 6.1.2：
Prototype / 6.2：
User Interface Layer / 6.2.1：
Model Layer / 6.2.2：
Foundational Layer / 6.2.3：
IDE Design Tactics / 6.2.4：
ArchStudio 4 System / 6.3：
Introduction / 6.3.1：
Installing ArchStudio 4 / 6.3.2：
ArchStudio 4 Overview / 6.3.3：
Using ArchStudio 4 / 6.3.4：
Evaluating Software Architecture / 6.4：
What Is Software Architecture Evaluation / 7.1：
Quality Attribute / 7.1.1：
Why Is Evaluation Necessary / 7.1.2：
Scenario-based Evaluation Methods / 7.1.3：
SAAM / 7.2：
General Steps of SAAM / 7.2.1：
Scenario Development / 7.2.2：
Architecture Description / 7.2.3：
Scenario Classification and Prioritization / 7.2.4：
Individual Evaluation of Indirect Scenarios / 7.2.5：
Assessment of Scenario Interaction / 7.2.6：
Creation of Overall Evaluation / 7.2.7：
ATAM / 7.3：
Initial ATAM / 7.3.1：
ATAM Improvement / 7.3.2：
General Process of ATAM / 7.3.3：
Presentation / 7.3.4：
Investigation and Analysis / 7.3.5：
Testing / 7.3.6：
Present the Results / 7.3.7：
Comparison among Evaluation Methods / 7.4：
Comparison Framework / 7.4.1：
Overview and Comparison of Evaluation Methods / 7.4.2：
Flexible Software Architecture / 7.5：
What Is Flexibility for / 8.1：
Dynamic Software Architecture / 8.2：
[pi]-ADL: A Behavior Perspective / 8.2.1：
MARMOL: A Reflection Perspective / 8.2.2：
LIME: A Coordination Perspective / 8.2.3：
Flexibility: Beyond the Dynamism / 8.3：
Concept of Flexible Software Architecture / 8.3.1：
Trade-off of Flexibility / 8.3.2：
Study Cases / 8.4：
Rainbow / 8.4.1：
MADAM / 8.4.2：
A Vision on Software Architecture / 8.5：
Software Architecture in Modern Software Industry / 9.1：
Categorizing Software / 9.1.1：
Software Product Line / 9.1.2：
Software Architecture Used in Other Fields / 9.2：
The Outline of Software Architecture Application Practice / 9.2.1：
The Development Trends of Domain-Specific Software / 9.2.2：
Software Architecture's Future Research / 9.3：
Index / 9.4：
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
85.

電子ブック
ＥＢ
85. A Modern Approach to Intelligent Animation
Yueting Zhuang, Yunhe Pan, Jun Xiao
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Traditional Computer Animation Techniques / 1.1：
Key-frame Animation / 1.1.1：
Articulated Animation / 1.1.2：
Facial Expression Animation / 1.1.3：
Motion Capture Based Animation Techniques / 1.2：
Definition of Motion Capture / 1.2.1：
Introduction of Motion Capture Techniques / 1.2.2：
Summarization / 1.2.3：
Motion Editing and Reuse Techniques / 1.3：
Key-frame Editing / 1.3.1：
Motion Warping / 1.3.2：
Per-frame Editing / 1.3.3：
Per-frame Motion Editing Combing Filters / 1.3.4：
Spatio-temporal Constraint Based Motion Editing / 1.3.5：
Physical Property Based Motion Editing / 1.3.6：
Data-driven Animation Techniques / 1.4：
Data Synthesis Oriented Character Animation / 1.4.1：
Environment Sensitive Character Animation / 1.4.2：
Intelligent Animation / 1.5：
Characteristics and Requirements of Intelligent Animation / 1.5.1：
Overview of Video-based Intelligent Animation Techniques / 1.5.2：
References
Natural Video-based Human Motion Capture / 2：
Human Motion Capture Based on Feature Tracking / 2.1：
Human Skeleton Model / 2.1.1：
Feature Tracking in 2D Image Sequence / 2.1.2：
Reconstruction of 3D Human Motion Sequence / 2.1.3：
VBHAS V1.0 / 2.1.4：
Discussions / 2.1.5：
Human Motion Capture Based on Silhouette / 2.2：
Overview / 2.2.1：
Silhouette Extraction and Analysis / 2.2.2：
Pose Recovery / 2.2.3：
Motion Recovery / 2.2.4：
Results / 2.2.5：
Human Motion Capture Using Color Markers / 2.2.6：
Tracking Color Markers / 3.1：
Human Model and Color Space / 3.1.1：
Kalman Filter / 3.1.2：
Edge Detection and Edge Extraction / 3.1.3：
Rectangle Construction / 3.1.4：
Block Matching Algorithm / 3.1.5：
3D Recovery of Human Motion Data / 3.2：
Two-step Calibration / 3.2.1：
Selection of Start Points / 3.2.2：
Solving for Other Joints / 3.2.3：
Case Studies: VBHAS V2.0 / 3.3：
Results of Human Motion Tracking / 3.3.1：
Results of Human Motion 3D Reconstruction / 3.3.2：
Two-camera-based Human Motion Capture / 4：
Human Model / 4.1：
Human Motion Feature Tracking / 4.2：
Feature Tracking Algorithms Based on Kalman Filter and Epipolar Constraint / 4.2.1：
Feature Tracking Based on Attribute Quantification / 4.2.2：
Incomplete Motion Feature Tracking Algorithm in Video Sequences / 4.2.3：
Human Motion Tracking in Video via HMM / 4.2.4：
3D Motion Reconstruction / 4.3：
Tsai Single Camera Linear Calibration Algorithm / 4.3.1：
Nonlinear and Non-coplanar Calibration Model / 4.3.2：
3D Reconstruction of Motion Sequences / 4.3.3：
Case Studies: VBHAS V3.0 / 4.4：
Camera Calibration / 4.4.1：
Feature Tracking / 4.4.2：
3D Reconstruction / 4.4.3：
Video-based Facial Animation Techniques / 5：
Facial Expression Hallucination / 5.1：
Image-based Facial Expression Hallucination / 5.1.1：
Video-based Facial Expression Hallucination / 5.1.2：
Video-based Facial Expression Capture / 5.2：
Multiple Facial Feature Tracking Based on Bayesian Network Enhanced Prediction Model / 5.2.1：
Multiple Facial Feature Tracking Based on Probability Graph Model / 5.2.2：
3D Facial Expression Reconstruction / 5.2.3：
Video-based Human Face Modeling Techniques / 5.3：
Dimensionality Reduction by LLE / 5.3.1：
Active Shape Model (ASM) and Active Appearance Model (AAM) / 5.3.2：
3D Face Modeling / 5.3.3：
Constraint-based Texture Mapping / 5.3.4：
Results and Discussions / 5.3.5：
Facial Expression Driven Technique / 5.4：
Data Driven Facial Animation / 5.4.1：
Bayesian Regression / 5.4.2：
Intelligent Techniques for Processing and Management of Motion Data / 5.4.3：
Automatic Segmentation of 3D Human Motion Data into Primitive Actions / 6.1：
Overview of Motion Data Segmentation / 6.1.1：
An Automatic 3D Human Motion Data Segmentation Approach Based on Non-linear Dimensionality Reduction / 6.1.2：
Motion Data Abstraction / 6.1.3：
Overview of Motion Key-frame Extraction / 6.2.1：
Key-frame Extraction from MoCap Data Based on Layered Curve Simplification Algorithm / 6.2.2：
Motion Data Retrieval / 6.2.3：
Motion Index Tree / 6.3.1：
Content-based Motion Retrieval / 6.3.2：
Intelligent Motion Data Reusing Techniques / 6.3.3：
3D Motion Editing and Synthesis Based on Wavelet Transform / 7.1：
Hierarchical Motion Description / 7.1.1：
Motion Signal Analysis by Wavelet / 7.1.2：
3D Motion Analysis and Synthesis Based on Wavelet Transform / 7.1.3：
Management of Motion Reality / 7.1.4：
Motion Graph Modeling Based on Markov Chain / 7.1.5：
Motion Graph Building / 7.2.1：
3D Motion Generation Based on Motion Graph / 7.2.2：
Automatic Synthesis and Editing of Motion Styles / 7.2.3：
Motion Data Preprocessing / 7.3.1：
Motion Synthesis and Editing Algorithm for Single Style Component / 7.3.2：
Motion Synthesis and Editing Algorithm for Multiple Style Components / 7.3.3：
Intelligent Techniques for Character Animation / 7.3.4：
Multiple Animated Characters Motion Fusion / 8.1：
Architecture of Multiple Animated Characters Motion Fusion / 8.1.1：
Collaboration of Multiple Animated Characters / 8.1.2：
Solving Continuous Motions / 8.1.3：
Motion Rectification / 8.1.4：
A Script Engine for Realistic Human Motion Generation / 8.1.5：
Motion Database Setup / 8.2.1：
Motion Script / 8.2.2：
Motion Generation / 8.2.3：
Automatic Generation of Human Animation Based on Motion Programming / 8.2.4：
Roadmap Generation / 8.3.1：
Route Planning / 8.3.3：
Interaction and Optimization / 8.3.4：
Motion Acquisition / 8.3.5：
Animation Generation / 8.3.6：
Index / 8.3.7：
Introduction / 1：
Traditional Computer Animation Techniques / 1.1：
Key-frame Animation / 1.1.1：
86.

電子ブック
ＥＢ
86. Software Architecture
Zheng Qin, Jiankuan Xing, Xiang Zheng, Jian-Kuan Xing
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
The Evolution of Software Development-Concerns / 1.1.2：
The Origin and Growth of Software Architecture / 1.1.3：
Basic Terminologies / 1.2：
Understanding IEEE 1471-2000 / 1.2.2：
Views Used in Software Architecture / 1.2.3：
Why We Need Software Architecture / 1.2.4：
Where Is Software Architecture in Software Life Cycle / 1.2.5：
Summary / 1.3：
References
Architectural Styles and Patterns / 2：
Fundamentals of Architectural Styles and Patterns / 2.1：
Pipes Filters / 2.2：
Style Description / 2.2.1：
Study Case / 2.2.2：
Object-oriented / 2.3：
Event-driven / 2.3.1：
Hierarchical Layer / 2.4.1：
Data Sharing / 2.5.1：
Virtual Machine / 2.6.1：
Feedback Loop / 2.7.1：
Comparison among Styles / 2.8.1：
Integration of Heterogeneous Styles / 2.10：
Application and Analysis of Architectural Styles / 2.11：
Introduction to SMCSP / 3.1：
Program Background / 3.1.1：
Technical Routes / 3.1.2：
Function Design / 3.1.3：
System Realization / 3.2：
The Pattern Choice / 3.2.1：
Interaction Mechanism / 3.2.2：
Realization of Mobile Collaboration / 3.2.3：
Knowledge-based Design / 3.2.4：
Software Architecture Description / 3.3：
Formal Description of Software Architecture / 4.1：
Problems in Informal Description / 4.1.1：
Why Are Formal Methods Necessary / 4.1.2：
Architectural Description Language / 4.2：
Introduction to ADL / 4.2.1：
Comparing among Typical ADLs / 4.2.2：
Describing Architectural Behaviors / 4.2.3：
Study Case: WRIGHT System / 4.3：
Description of Component and Connector / 4.3.1：
Description of Configuration / 4.3.2：
Description of Style / 4.3.3：
CSP-Semantic Basis of Formal Behavior Description / 4.3.4：
FEAL: An Infrastructure to Construct ADLs / 4.4：
Design Purpose / 4.4.1：
FEC / 4.4.2：
FEAL Structure / 4.4.3：
FEAL Mapper / 4.4.4：
Examples of FEAL Application / 4.4.5：
Design Strategies in Architecture Level / 4.5：
From Reuse to Architecture Design / 5.1：
Architectural Design Space and Rules / 5.2：
SADPBA / 5.3：
Overview / 5.3.1：
Split Design Process with Design Space / 5.3.2：
Trace Mechanism in SADPBA / 5.3.3：
Life Cycle Model of Software Architecture / 5.3.4：
SADPBA in Practice / 5.3.5：
Study Case: MEECS / 5.4：
Introduction to MEECS / 5.4.1：
Applying SADPBA in MEECS / 5.4.2：
Software Architecture IDE / 5.5：
What Can Software Architecture IDE Do / 6.1：
A Comparison with Formalized Description Approach / 6.1.1：
Important Roles of Architecture IDE / 6.1.2：
Prototype / 6.2：
User Interface Layer / 6.2.1：
Model Layer / 6.2.2：
Foundational Layer / 6.2.3：
IDE Design Tactics / 6.2.4：
ArchStudio 4 System / 6.3：
Introduction / 6.3.1：
Installing ArchStudio 4 / 6.3.2：
ArchStudio 4 Overview / 6.3.3：
Using ArchStudio 4 / 6.3.4：
Evaluating Software Architecture / 6.4：
What Is Software Architecture Evaluation / 7.1：
Quality Attribute / 7.1.1：
Why Is Evaluation Necessary / 7.1.2：
Scenario-based Evaluation Methods / 7.1.3：
SAAM / 7.2：
General Steps of SAAM / 7.2.1：
Scenario Development / 7.2.2：
Architecture Description / 7.2.3：
Scenario Classification and Prioritization / 7.2.4：
Individual Evaluation of Indirect Scenarios / 7.2.5：
Assessment of Scenario Interaction / 7.2.6：
Creation of Overall Evaluation / 7.2.7：
ATAM / 7.3：
Initial ATAM / 7.3.1：
ATAM Improvement / 7.3.2：
General Process of ATAM / 7.3.3：
Presentation / 7.3.4：
Investigation and Analysis / 7.3.5：
Testing / 7.3.6：
Present the Results / 7.3.7：
Comparison among Evaluation Methods / 7.4：
Comparison Framework / 7.4.1：
Overview and Comparison of Evaluation Methods / 7.4.2：
Flexible Software Architecture / 7.5：
What Is Flexibility for / 8.1：
Dynamic Software Architecture / 8.2：
[pi]-ADL: A Behavior Perspective / 8.2.1：
MARMOL: A Reflection Perspective / 8.2.2：
LIME: A Coordination Perspective / 8.2.3：
Flexibility: Beyond the Dynamism / 8.3：
Concept of Flexible Software Architecture / 8.3.1：
Trade-off of Flexibility / 8.3.2：
Study Cases / 8.4：
Rainbow / 8.4.1：
MADAM / 8.4.2：
A Vision on Software Architecture / 8.5：
Software Architecture in Modern Software Industry / 9.1：
Categorizing Software / 9.1.1：
Software Product Line / 9.1.2：
Software Architecture Used in Other Fields / 9.2：
The Outline of Software Architecture Application Practice / 9.2.1：
The Development Trends of Domain-Specific Software / 9.2.2：
Software Architecture's Future Research / 9.3：
Index / 9.4：
Introduction to Software Architecture / 1：
A Brief History of Software Development / 1.1：
The Evolution of Programming Language-Abstract Level / 1.1.1：
87.

電子ブック
ＥＢ
87. OPC Unified Architecture
Wolfgang Mahnke, Matthias Damm, Stefan-Helmut Leitner
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
Acknowledgements
Introduction / 1：
OPC Foundation / 1.1：
Classic OPC / 1.2：
OPC Data Access / 1.2.1：
OPC Alarm and Events / 1.2.2：
OPC Historical Data Access / 1.2.3：
Other OPC Interface Standards / 1.2.4：
OPC XML-DA / 1.2.5：
Motivation for OPC UA / 1.3：
OPC UA Overview / 1.4：
OPC UA Specifications / 1.5：
OPC UA Software Layers / 1.6：
Evolution Not Revolution / 1.7：
Summary / 1.8：
Key Messages / 1.8.1：
Where to Find More Information? / 1.8.2：
What's Next? / 1.8.3：
Information Modeling: Concepts / 2：
Why Information Modeling? / 2.1：
Nodes and References / 2.2：
Reference Types / 2.3：
Objects, Variables and Methods / 2.4：
Types for Objects and Variables / 2.5：
Simple Object Types / 2.5.1：
Simple Variable Types / 2.5.2：
Complex Object Types / 2.5.3：
Instance Declarations / 2.5.4：
Complex Variable Types / 2.5.5：
Modelling Rules / 2.5.6：
Subtyping of Complex Types / 2.5.7：
Data Variables and Properties / 2.6：
Model Parent for Objects, Variables and Methods / 2.7：
Data Types / 2.8：
Data Type Node Class / 2.8.1：
Built-in and Simple Data Types / 2.8.2：
Enumeration Data Types / 2.8.3：
Structured Data Types / 2.8.4：
Specific Built-in Data Types / 2.8.5：
Summary on Data Types / 2.8.6：
Views / 2.9：
Events / 2.10：
Historical Access / 2.11：
Historical Data / 2.11.1：
Historical Events / 2.11.2：
Historical Address Space / 2.11.3：
Address Space Model and Information Models / 2.12：
Information Modeling: Example and Best Practice / 2.13：
Overview / 3.1：
Example / 3.2：
Application Scenario / 3.2.1：
Simple Scenario - Similar to Classic OPC / 3.2.2：
Advanced Scenario - Providing Full Power of OPC UA / 3.2.3：
Best Practices / 3.3：
Structuring with Objects, Reference Types and Views / 3.3.1：
Type Definitions (Object Types and Variable Types) / 3.3.2：
Providing Complex Data Structures / 3.3.3：
Providing User-Defined Data Types / 3.3.4：
Properties / 3.3.5：
Methods / 3.3.6：
Proxy Objects (Properties on References) / 3.3.7：
Standard Information Models / 3.4：
Handling Information Models / 4.1：
What is Specified by an Information Model? / 4.2.1：
How is an Information Model Specified? / 4.2.2：
How are Multiple Information Models Supported? / 4.2.3：
Base OPC UA Information Model / 4.3：
Capabilities and Diagnostics / 4.4：
Data Access / 4.5：
Historical Access and Aggregates / 4.6：
State Machine / 4.7：
Programs / 4.8：
Alarms and Conditions / 4.9：
Domain-Specific Information Models / 4.10：
Devices Information Model / 4.10.1：
Services / 4.11：
General Service Concepts / 5.1：
Timeout Handling / 5.2.1：
Request and Response Headers / 5.2.2：
Error Handling / 5.2.3：
Extensible Parameters / 5.2.4：
Communication Context / 5.2.5：
Convention for Describing Services in this Chapter / 5.2.6：
Finding Servers / 5.3：
Service Find Servers / 5.3.1：
Service Get Endpoints / 5.3.2：
Service Register Server / 5.3.3：
Connection Management Between Clients and Servers / 5.4：
Secure Channel Establishment / 5.4.1：
Creating an Application Session / 5.4.2：
Closing an Application Session / 5.4.3：
Cancel Outstanding Service Requests / 5.4.4：
Find Information in the Address Space / 5.5：
Services Used for Discovering the Address Space / 5.5.1：
Use Cases for Finding Information in the Address Space / 5.5.2：
Read and Write Data and Metadata / 5.6：
Reading Data / 5.6.1：
Writing Data / 5.6.2：
Subscribe for Data Changes and Events / 5.7：
Delivery of Changed Data and Events / 5.7.1：
Create and Manage Subscriptions / 5.7.2：
Create and Manage Monitored Items / 5.7.3：
Monitor Data Changes / 5.7.4：
Monitor Events / 5.7.5：
Monitor Aggregated Data / 5.7.6：
Calling Methods Defined by the Server / 5.8：
Access History of Data and Events / 5.9：
History Read Service / 5.9.1：
History Update Service / 5.9.2：
Find Information in Complex Address Space / 5.10：
Modify the Address Space / 5.11：
Adding Nodes / 5.11.1：
Creating References Between Nodes / 5.11.2：
Removing Nodes / 5.11.3：
Delete References Between Nodes / 5.11.4：
Technology Mapping / 5.12：
Data Encodings / 6.1：
OPC UA Binary / 6.2.1：
XML / 6.2.2：
Security Protocols / 6.3：
WS-Secure Conversation / 6.3.1：
UA-Secure Conversation / 6.3.2：
Transport Protocols / 6.4：
UA TCP / 6.4.1：
SOAP/HTTP / 6.4.2：
Available Mapping Implementations / 6.5：
Security / 6.6：
Why is Security so Important? / 7.1：
Organizational Perspective of Security / 7.2：
Technical Perspective of Security / 7.3：
Determining The Appropriate Level of Security / 7.4：
Security Assessments / 7.4.1：
The OPC UA Security Assessment / 7.4.2：
The OPC UA Security Model / 7.5：
Security Architecture / 7.5.1：
Securing the Communication Channel / 7.5.2：
Authentication and Authorization / 7.5.3：
Security Policies and Profiles / 7.5.4：
Certificates / 7.6：
What is a Certificate? / 7.6.1：
OPC UA Certificates / 7.6.2：
Public Key Infrastructure for OPC UA / 7.7：
What is a PKI? / 7.7.1：
Trust Models / 7.7.2：
Certificate Lifecycle Management / 7.7.3：
Available PKI Frameworks / 7.7.4：
PKI for Industrial Applications / 7.7.5：
Application Architecture / 7.8：
Architectural Overview / 8.1：
Stack / 8.3：
Interface / 8.3.1：
Encoding Layer / 8.3.2：
Security Layer / 8.3.3：
Transport Layer / 8.3.4：
Platform Layer / 8.3.5：
Software Development Toolkit / 8.4：
UA-Specific Functionality / 8.4.1：
Common Functionality / 8.4.2：
Interfaces / 8.4.3：
Application / 8.5：
Client / 8.5.1：
Server / 8.5.2：
Deliverables Provided by the OPC Foundation / 8.6：
Stacks / 8.6.1：
SDKs / 8.6.2：
Applications / 8.6.3：
System Architecture / 8.7：
System Environment / 9.1：
Basic Architecture Patterns / 9.2：
Client-Server / 9.2.1：
Chained Server / 9.2.2：
Server-to-Server Communication / 9.2.3：
Aggregating Server / 9.2.4：
Redundancy / 9.3：
Client Redundancy / 9.3.1：
Server Redundancy / 9.3.2：
Discovery / 9.4：
Why discovery? / 9.4.1：
Discovery Entities / 9.4.2：
Discovery Process / 9.4.3：
Auditing / 9.5：
Audit Logs / 9.5.1：
Audit Events / 9.5.3：
Service Auditing / 9.5.4：
Use Cases / 9.5.5：
Mapping of COM OPC to OPC UA / 9.6：
OPC Data Access 2.05A and 3.0 / 10.1：
Address Space / 10.2.1：
Access Information / 10.2.2：
OPC XML-DA 1.01 / 10.2.3：
OPC Alarm and Events 1.1 / 10.3：
Migration / 10.3.1：
Wrappers - Access COM Server from UA Client / 11.1：
Proxies - Access UA Server from COM Client / 11.3：
Native Development / 11.4：
Profiles / 11.5：
Motivation / 12.1：
Profiles, Conformance Units and Test Cases / 12.2：
Profiles for Server Applications / 12.3：
Profiles for Client Applications / 12.4：
Transport Profiles / 12.5：
Security Profiles / 12.6：
Certification Process / 12.7：
Performance / 12.8：
Performance Numbers / 13.1：
Conclusion and Outlook / 13.3：
OPC UA in a Nutshell / 14.1：
Is OPC UA Complicated? / 14.2：
Are OPC UA Services Difficult to Handle? / 14.2.1：
Is Information Modeling a Pain? / 14.2.2：
Transport Protocols and Encodings: Why So Many? / 14.2.3：
Implementation Issues / 14.2.4：
Migration of Existing Code / 14.2.5：
Management Summary / 14.2.6：
Outlook / 14.3：
Literature / 15：
Graphical Notation / Appendix A：
Motivation and Relation to UML
Notation
Node Classes and Attributes / Appendix B：
Base Information Model Reference / Appendix C：
Index
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
88.

電子ブック
ＥＢ
88. OPC Unified Architecture
Wolfgang Mahnke, Matthias Damm, Stefan-Helmut Leitner
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
Acknowledgements
Introduction / 1：
OPC Foundation / 1.1：
Classic OPC / 1.2：
OPC Data Access / 1.2.1：
OPC Alarm and Events / 1.2.2：
OPC Historical Data Access / 1.2.3：
Other OPC Interface Standards / 1.2.4：
OPC XML-DA / 1.2.5：
Motivation for OPC UA / 1.3：
OPC UA Overview / 1.4：
OPC UA Specifications / 1.5：
OPC UA Software Layers / 1.6：
Evolution Not Revolution / 1.7：
Summary / 1.8：
Key Messages / 1.8.1：
Where to Find More Information? / 1.8.2：
What's Next? / 1.8.3：
Information Modeling: Concepts / 2：
Why Information Modeling? / 2.1：
Nodes and References / 2.2：
Reference Types / 2.3：
Objects, Variables and Methods / 2.4：
Types for Objects and Variables / 2.5：
Simple Object Types / 2.5.1：
Simple Variable Types / 2.5.2：
Complex Object Types / 2.5.3：
Instance Declarations / 2.5.4：
Complex Variable Types / 2.5.5：
Modelling Rules / 2.5.6：
Subtyping of Complex Types / 2.5.7：
Data Variables and Properties / 2.6：
Model Parent for Objects, Variables and Methods / 2.7：
Data Types / 2.8：
Data Type Node Class / 2.8.1：
Built-in and Simple Data Types / 2.8.2：
Enumeration Data Types / 2.8.3：
Structured Data Types / 2.8.4：
Specific Built-in Data Types / 2.8.5：
Summary on Data Types / 2.8.6：
Views / 2.9：
Events / 2.10：
Historical Access / 2.11：
Historical Data / 2.11.1：
Historical Events / 2.11.2：
Historical Address Space / 2.11.3：
Address Space Model and Information Models / 2.12：
Information Modeling: Example and Best Practice / 2.13：
Overview / 3.1：
Example / 3.2：
Application Scenario / 3.2.1：
Simple Scenario - Similar to Classic OPC / 3.2.2：
Advanced Scenario - Providing Full Power of OPC UA / 3.2.3：
Best Practices / 3.3：
Structuring with Objects, Reference Types and Views / 3.3.1：
Type Definitions (Object Types and Variable Types) / 3.3.2：
Providing Complex Data Structures / 3.3.3：
Providing User-Defined Data Types / 3.3.4：
Properties / 3.3.5：
Methods / 3.3.6：
Proxy Objects (Properties on References) / 3.3.7：
Standard Information Models / 3.4：
Handling Information Models / 4.1：
What is Specified by an Information Model? / 4.2.1：
How is an Information Model Specified? / 4.2.2：
How are Multiple Information Models Supported? / 4.2.3：
Base OPC UA Information Model / 4.3：
Capabilities and Diagnostics / 4.4：
Data Access / 4.5：
Historical Access and Aggregates / 4.6：
State Machine / 4.7：
Programs / 4.8：
Alarms and Conditions / 4.9：
Domain-Specific Information Models / 4.10：
Devices Information Model / 4.10.1：
Services / 4.11：
General Service Concepts / 5.1：
Timeout Handling / 5.2.1：
Request and Response Headers / 5.2.2：
Error Handling / 5.2.3：
Extensible Parameters / 5.2.4：
Communication Context / 5.2.5：
Convention for Describing Services in this Chapter / 5.2.6：
Finding Servers / 5.3：
Service Find Servers / 5.3.1：
Service Get Endpoints / 5.3.2：
Service Register Server / 5.3.3：
Connection Management Between Clients and Servers / 5.4：
Secure Channel Establishment / 5.4.1：
Creating an Application Session / 5.4.2：
Closing an Application Session / 5.4.3：
Cancel Outstanding Service Requests / 5.4.4：
Find Information in the Address Space / 5.5：
Services Used for Discovering the Address Space / 5.5.1：
Use Cases for Finding Information in the Address Space / 5.5.2：
Read and Write Data and Metadata / 5.6：
Reading Data / 5.6.1：
Writing Data / 5.6.2：
Subscribe for Data Changes and Events / 5.7：
Delivery of Changed Data and Events / 5.7.1：
Create and Manage Subscriptions / 5.7.2：
Create and Manage Monitored Items / 5.7.3：
Monitor Data Changes / 5.7.4：
Monitor Events / 5.7.5：
Monitor Aggregated Data / 5.7.6：
Calling Methods Defined by the Server / 5.8：
Access History of Data and Events / 5.9：
History Read Service / 5.9.1：
History Update Service / 5.9.2：
Find Information in Complex Address Space / 5.10：
Modify the Address Space / 5.11：
Adding Nodes / 5.11.1：
Creating References Between Nodes / 5.11.2：
Removing Nodes / 5.11.3：
Delete References Between Nodes / 5.11.4：
Technology Mapping / 5.12：
Data Encodings / 6.1：
OPC UA Binary / 6.2.1：
XML / 6.2.2：
Security Protocols / 6.3：
WS-Secure Conversation / 6.3.1：
UA-Secure Conversation / 6.3.2：
Transport Protocols / 6.4：
UA TCP / 6.4.1：
SOAP/HTTP / 6.4.2：
Available Mapping Implementations / 6.5：
Security / 6.6：
Why is Security so Important? / 7.1：
Organizational Perspective of Security / 7.2：
Technical Perspective of Security / 7.3：
Determining The Appropriate Level of Security / 7.4：
Security Assessments / 7.4.1：
The OPC UA Security Assessment / 7.4.2：
The OPC UA Security Model / 7.5：
Security Architecture / 7.5.1：
Securing the Communication Channel / 7.5.2：
Authentication and Authorization / 7.5.3：
Security Policies and Profiles / 7.5.4：
Certificates / 7.6：
What is a Certificate? / 7.6.1：
OPC UA Certificates / 7.6.2：
Public Key Infrastructure for OPC UA / 7.7：
What is a PKI? / 7.7.1：
Trust Models / 7.7.2：
Certificate Lifecycle Management / 7.7.3：
Available PKI Frameworks / 7.7.4：
PKI for Industrial Applications / 7.7.5：
Application Architecture / 7.8：
Architectural Overview / 8.1：
Stack / 8.3：
Interface / 8.3.1：
Encoding Layer / 8.3.2：
Security Layer / 8.3.3：
Transport Layer / 8.3.4：
Platform Layer / 8.3.5：
Software Development Toolkit / 8.4：
UA-Specific Functionality / 8.4.1：
Common Functionality / 8.4.2：
Interfaces / 8.4.3：
Application / 8.5：
Client / 8.5.1：
Server / 8.5.2：
Deliverables Provided by the OPC Foundation / 8.6：
Stacks / 8.6.1：
SDKs / 8.6.2：
Applications / 8.6.3：
System Architecture / 8.7：
System Environment / 9.1：
Basic Architecture Patterns / 9.2：
Client-Server / 9.2.1：
Chained Server / 9.2.2：
Server-to-Server Communication / 9.2.3：
Aggregating Server / 9.2.4：
Redundancy / 9.3：
Client Redundancy / 9.3.1：
Server Redundancy / 9.3.2：
Discovery / 9.4：
Why discovery? / 9.4.1：
Discovery Entities / 9.4.2：
Discovery Process / 9.4.3：
Auditing / 9.5：
Audit Logs / 9.5.1：
Audit Events / 9.5.3：
Service Auditing / 9.5.4：
Use Cases / 9.5.5：
Mapping of COM OPC to OPC UA / 9.6：
OPC Data Access 2.05A and 3.0 / 10.1：
Address Space / 10.2.1：
Access Information / 10.2.2：
OPC XML-DA 1.01 / 10.2.3：
OPC Alarm and Events 1.1 / 10.3：
Migration / 10.3.1：
Wrappers - Access COM Server from UA Client / 11.1：
Proxies - Access UA Server from COM Client / 11.3：
Native Development / 11.4：
Profiles / 11.5：
Motivation / 12.1：
Profiles, Conformance Units and Test Cases / 12.2：
Profiles for Server Applications / 12.3：
Profiles for Client Applications / 12.4：
Transport Profiles / 12.5：
Security Profiles / 12.6：
Certification Process / 12.7：
Performance / 12.8：
Performance Numbers / 13.1：
Conclusion and Outlook / 13.3：
OPC UA in a Nutshell / 14.1：
Is OPC UA Complicated? / 14.2：
Are OPC UA Services Difficult to Handle? / 14.2.1：
Is Information Modeling a Pain? / 14.2.2：
Transport Protocols and Encodings: Why So Many? / 14.2.3：
Implementation Issues / 14.2.4：
Migration of Existing Code / 14.2.5：
Management Summary / 14.2.6：
Outlook / 14.3：
Literature / 15：
Graphical Notation / Appendix A：
Motivation and Relation to UML
Notation
Node Classes and Attributes / Appendix B：
Base Information Model Reference / Appendix C：
Index
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
89.

電子ブック
ＥＢ
89. Knowledge Representation and the Semantics of Natural Language
Hermann Helbig, Dov M. Gabbay, J?rg Siekmann
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Knowledge Representation with MultiNet / Part I：
Introduction / 1：
Historical Roots / 2：
Basic Concepts / 3：
General Remarks / 3.1：
Classificatory Knowledge / 3.2：
Sorts and Features / 3.2.1：
Multidimensional Layer Attributes / 3.2.2：
Immanent vs. Situational Components of Meaning / 3.2.3：
Classification of Questions / 3.2.4：
Structural Means of Representation / 3.3：
Relations and Functions / 3.3.1：
Inferential Relationships - Axiomatic Rules / 3.3.2：
Semantic Characterization of Objects / 4：
The Hierarchical Order of Objects / 4.1：
Material Characterization of Objects / 4.2：
Qualitative Characterization of Objects / 4.3：
Assignment of Properties to Objects / 4.3.1：
Attribute-Value Characterizations / 4.3.3：
Instances, Attributes, and Values / 4.3.3.1：
Generic Concepts and Their Attributes / 4.3.3.2：
Possession, Attachment, and Association / 4.4：
Possession / 4.4.1：
Assignment of Objects to Objects (Attachment) / 4.4.2：
Association / 4.4.3：
Different Manifestations of Objects / 4.5：
Semantic Characterization of Situations / 5：
The General Structure of Situations / 5.1：
Events [Dynamic Situations] / 5.2：
Participants and C-Roles [Valency Frames] / 5.2.1：
Conceptual Subordination of Situations / 5.2.2：
Circumstances / 5.2.3：
States [Static Situations] / 5.3：
The Comparison of Entities / 6：
Typical Relations of Comparison / 6.1：
The Semantic Treatment of Comparison / 6.2：
The Absolute or Positive / 6.2.1：
The Comparative / 6.2.2：
The Superlative / 6.2.3：
The Spatio-temporal Characterization of Entities / 7：
General Remarks on Space and Time / 7.1：
Local Relations / 7.2：
Temporal Relations / 7.3：
Situations and Times / 7.4：
Modality and Negation / 8：
The Modal Characterization of Situations / 8.1：
Negation / 8.2：
Modalities in a Narrower Sense / 8.3：
Quantification and Pluralities / 9：
The Role of Layer Information in Semantic Representations / 10：
Degree of Generalization: GENER / 10.1：
Facticity: FACT / 10.3：
Determination of Reference: REFER / 10.4：
Variability: VARIA / 10.5：
Relations Between Situations / 11：
Semantic Interpretation of Conjunctions / 11.1：
Subordinating Conjunctions (Subordinators) / 11.1.1：
Coordinative Conjunctions (Coordinators) / 11.1.3：
Conditions and Reasons / 11.2：
Language Phenomena and Representational Means / 11.2.1：
Causality / 11.2.2：
Conditional Relations / 11.2.3：
Counterfactuals / 11.3：
Contextual Restrictions and Situational Embedding / 11.4：
The Rhetorical Structure Theory (RST) / 11.5：
Lexicon and Knowledge Representation / 12：
Linguistic Knowledge and World Knowledge / 12.1：
The Semantic Component of the Lexicon / 12.2：
Question Answering and Inferences / 13：
Logical Principles / 13.1：
Classes of Questions and Inferential Answer Finding / 13.2：
Associatively Guided Question Answering / 13.3：
Software Tools for the Knowledge Engineer / Sample Applications / 14：
Knowledge Management as an Engineering Task / 14.1：
MWR - the Workbench for the Knowledge Engineer / 14.2：
NatLink - A Semantic Interpreter for MultiNet / 14.3：
LIA - the Workbench for the Computer Lexicographer / 14.4：
VILAB - The Virtual Laboratory / 14.5：
Comparison Between MultiNet and Other Semantic Formalisms / 15：
Introductory Remarks / 15.1：
MultiNet and Other Network Representations / 15.2：
Structured Inheritance Networks / 15.2.1：
The Semantic Network Processing System (SNePS) / 15.2.2：
Sowa's Conceptual Structures (SCS) / 15.2.3：
Scripts and the Conceptual Dependency Theory / 15.2.4：
MultiNet and Logic-Oriented Semantic Formalisms / 15.3：
The Discourse Representation Theory / 15.3.1：
Description Logics / 15.3.3：
The Generalized Quantifier Theory / 15.3.4：
Comparison Between MultiNet and Frame Representations / 15.4：
The Knowledge Representation Language KRL / 15.4.1：
The Knowledge Base Project CYC / 15.4.3：
The Representational Means of MultiNet / Part II：
Overview and Representational Principles / 16：
MultiNet Within the Context of Knowledge Processing / 16.1：
The Paradigm of Multilayered Extended Semantic Networks / 16.2：
Conventions of Description / 16.3：
Means for Expressing Classification and Stratification / 17：
Layers / 17.1：
General Remarks on the Typology of Layer Attributes / 17.2.1：
Degree of Generality (Attribute GENER) / 17.2.2：
Determination of Reference (Attribute REFER) / 17.2.3：
Variabihty (Attribute VARIA) / 17.2.4：
Facticity (Attribute FACT) / 17.2.5：
Quantification (QUANT) vs. Cardinality (CARD) / 17.2.6：
Type of Extensionality (Attribute ETYPE) / 17.2.7：
The Classification of Nominal Concepts / 17.2.8：
Encapsulation of Concepts / 17.3：
Overview / 18：
Relations / 18.2：
AFF: C-Role - Affected Object / 18.2.1：
AGT: C-Role - Agent / 18.2.2：
ANLG2/3: Similarity Between Entities / 18.2.3：
ANTE: Relation of Temporal Succession / 18.2.4：
ANTO: Antonymy Relation / 18.2.5：
ARG1/2/3: Argument Specification at the Metalevel / 18.2.6：
ASSOC: Association / 18.2.7：
ATTCH: Attachment of Objects / 18.2.8：
ATTR: Assignment of Attributes to Objects / 18.2.9：
AVRT: C-Role - Averting from an Object / 18.2.10：
BENE: C-Role - Beneficiary / 18.2.11：
CAUS: Causality, Relation Between Cause and Effect / 18.2.12：
CHEA: Sortal Change: Event - Abstract Concept / 18.2.13：
CHPA: Sortal Change: Property - Abstract Concept / 18.2.14：
CHPE: Sortal Change: Property - Event / 18.2.15：
CHPS: Sortal Change: Property - State / 18.2.16：
CHSA: Sortal Change: State - Abstract State / 18.2.17：
CHSP1/2/3: Sortal Change Between Situational Concepts and Properties / 18.2.18：
CIRC: Relation Between a Situation and a Concomitant Situation / 18.2.19：
CNVRS: Lexical Relation Between Converse Concepts / 18.2.20：
COMPL: Complementarity / 18.2.21：
CONC: Relation Expressing a Concession / 18.2.22：
COND: Conditional Relation / 18.2.23：
CONF: Relation Expressing the Conformity with an Abstract Frame / 18.2.24：
CONTR: Relation of Contrast / 18.2.25：
CORR: Qualitative or Quantitative Correspondence / 18.2.26：
CSTR: C-Role - Causator / 18.2.27：
CTXT: Relation Specifying a Restricting Context / 18.2.28：
DIRCL: Local Destination or Direction / 18.2.29：
DISTG/2/3: Relations Specifying a Difference / 18.2.30：
DPND: Dependency Relation / 18.2.31：
DUR: Relation Specifying a Temporal Extension / 18.2.32：
ELMT: Element Relation / 18.2.33：
EQU: Equivalence Relation / 18.2.34：
EXP: C-Role - Experiencer of an Event / 18.2.35：
EXT: Relation Between Intension and Extension / 18.2.36：
FIN: Temporal End / 18.2.37：
GOAL: Generalized Goal / 18.2.38：
HSIT: Constituents of a Hypersituation / 18.2.39：
IMPL: Implication Relation Between Situations / 18.2.40：
INIT: Initial Situation or Entity / 18.2.41：
INSTR: C-Role - Instrument / 18.2.42：
JUST: Justification of a Situation / 18.2.43：
LEXT: Relation Specifying a Local Extent / 18.2.44：
LOC: Location of a Situation / 18.2.45：
MAJ/MAJE: 'Greater than (or Equal to)'-Relation / 18.2.46：
MANNR: Relation Specifying the Manner / 18.2.47：
MCONT: C-Role - Relation Between a Mental Process and Its Content / 18.2.48：
MERO: Meronymy Relation / 18.2.49：
METH: C-Role - Method / 18.2.50：
MEXP: C-Role - Mental Experiencer / 18.2.51：
MIN/MINE: 'Smaller than (or Equal to)'-Relation / 18.2.52：
MODE: Generalized Mode of a Situation / 18.2.53：
MODL: Relation Specifying the Modality of a Situation / 18.2.54：
NAME: Assignment of a Name to an Object / 18.2.55：
OBJ: C-Role - Neutral Object as Participant / 18.2.56：
OPPOS: C-Role - Relation Specifying an Opposition / 18.2.57：
ORIG: Mental or Informational Origin / 18.2.58：
ORIGL: Relation Specifying the Local Origin / 18.2.59：
ORIGM: Relation Specifying the Material Origin / 18.2.60：
ORNT: C-Role - Orientation to an Object / 18.2.61：
PARS: Relation Between Part and Whole / 18.2.62：
POSS: Relation of Possession / 18.2.63：
PRED/PREDR/PREDS: Predicative Concept Governing a Plurality / 18.2.64：
PROP: Relation Between Object and Property / 18.2.65：
PROPR: Relation Between a Plurality and a Semantically Relational Property / 18.2.66：
PURP: Relation Specifying a Purpose / 18.2.67：
QMOD: Quantitative Modification / 18.2.68：
REAS: General Reason for a Situation / 18.2.69：
RPRS: Representational Form or Manifestation of an Object / 18.2.70：
RSLT: C-Role - Result / 18.2.71：
SCAR: C-Role - Carrier of a State (Passive) / 18.2.72：
SETOF: Relation Between the Extensional of a Plurality and the Governing Predicative Concept / 18.2.73：
SITU: Situational Embedding or Abstract Location / 18.2.74：
SOURC: Generalized Source or Origin / 18.2.75：
SSPE: C-Role - Entity Specifying a State / 18.2.76：
STRT: Relation Specifying the Temporal Beginning / 18.2.77：
SUB: Subordination of Concepts Representing Objects / 18.2.78：
SUBO: Generalized Subordination Relation / 18.2.79：
SUBM/SUBME: Subsumption of Sets (Set Inclusion) / 18.2.80：
SUBR: Metarelation for the Description of Relations / 18.2.81：
SUBS: Subordination of Situations / 18.2.82：
SUBST: Relation Specifying a Substitute for an Entity / 18.2.83：
SUPPL: Supplement Relation / 18.2.84：
SYNO: Synonymy Relation / 18.2.85：
TEMP: Relation Specifying a Temporal Frame / 18.2.86：
VAL: Relation Between Attribute and Value / 18.2.87：
VALR: Relation Between Attributes and Their Value Restriction / 18.2.88：
VIA: Relation Specifying a Spatial Path / 18.2.89：
Functions / 18.3：
ALTN1/2: Construction of Alternative Pluralities / 18.3.1：
COMP: Function for the Comparison of Properties / 18.3.2：
DIFF: Set Difference / 18.3.3：
FLP[subscript J]: Functions Generating Locations / 18.3.4：
INTSC: Intersection of Sets / 18.3.5：
ITMS/ITMS-I: Function for Enumerating Sets and Its Counterpart at the Intensional Level / 18.3.6：
MODP: Function for the Modification of Properties / 18.3.7：
MODQ: Function for the Modification of Quantities / 18.3.8：
MODS: Modification of a Situational Concept / 18.3.9：
NON: Family of Functions Specifying Negation / 18.3.10：
OP[subscript J]: Arithmetic Operations / 18.3.11：
ORD: Function Defining Ordinal Numbers / 18.3.12：
PMOD: Modification of Objects by Associative Properties / 18.3.13：
QUANT: Function Generating Quantities / 18.3.14：
SUPL: Function Characterizing the Superlative / 18.3.15：
TUPL: Function Generating Tuples / 18.3.16：
UNION: Union of Sets / 18.3.17：
VEL1/2: Disjunctive Composition of Situations / 18.3.18：
Table of Abbreviations / A：
Overview of the Representational Means / B：
Semantic Templates for the Meaning of Relations / C：
Characterization of Arcs with Regard to Their Knowledge Type / D：
Classes of Typical Axioms / E：
R-Axioms (Categorical Knowledge) / E.1：
R-Axioms (Default Knowledge) / E.2：
R-Axioms (Definitions of Relations) / E.3：
Axioms Concerning the Preextensional Level / E.4：
B-Axioms (Categorical Knowledge) / E.5：
R-Axioms and B-Axioms (Spatio-temporal Relations) / E.6：
Axiom Schemata (B-Axioms) / E.7：
Axiom Schemata (R-Axioms) / E.8：
Bibliography
List of Figures
Index
Knowledge Representation with MultiNet / Part I：
Introduction / 1：
Historical Roots / 2：
90.

電子ブック
ＥＢ
90. Knowledge Representation and the Semantics of Natural Language
Hermann Helbig, Dov M. Gabbay, Jörg Siekmann
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Knowledge Representation with MultiNet / Part I：
Introduction / 1：
Historical Roots / 2：
Basic Concepts / 3：
General Remarks / 3.1：
Classificatory Knowledge / 3.2：
Sorts and Features / 3.2.1：
Multidimensional Layer Attributes / 3.2.2：
Immanent vs. Situational Components of Meaning / 3.2.3：
Classification of Questions / 3.2.4：
Structural Means of Representation / 3.3：
Relations and Functions / 3.3.1：
Inferential Relationships - Axiomatic Rules / 3.3.2：
Semantic Characterization of Objects / 4：
The Hierarchical Order of Objects / 4.1：
Material Characterization of Objects / 4.2：
Qualitative Characterization of Objects / 4.3：
Assignment of Properties to Objects / 4.3.1：
Attribute-Value Characterizations / 4.3.3：
Instances, Attributes, and Values / 4.3.3.1：
Generic Concepts and Their Attributes / 4.3.3.2：
Possession, Attachment, and Association / 4.4：
Possession / 4.4.1：
Assignment of Objects to Objects (Attachment) / 4.4.2：
Association / 4.4.3：
Different Manifestations of Objects / 4.5：
Semantic Characterization of Situations / 5：
The General Structure of Situations / 5.1：
Events [Dynamic Situations] / 5.2：
Participants and C-Roles [Valency Frames] / 5.2.1：
Conceptual Subordination of Situations / 5.2.2：
Circumstances / 5.2.3：
States [Static Situations] / 5.3：
The Comparison of Entities / 6：
Typical Relations of Comparison / 6.1：
The Semantic Treatment of Comparison / 6.2：
The Absolute or Positive / 6.2.1：
The Comparative / 6.2.2：
The Superlative / 6.2.3：
The Spatio-temporal Characterization of Entities / 7：
General Remarks on Space and Time / 7.1：
Local Relations / 7.2：
Temporal Relations / 7.3：
Situations and Times / 7.4：
Modality and Negation / 8：
The Modal Characterization of Situations / 8.1：
Negation / 8.2：
Modalities in a Narrower Sense / 8.3：
Quantification and Pluralities / 9：
The Role of Layer Information in Semantic Representations / 10：
Degree of Generalization: GENER / 10.1：
Facticity: FACT / 10.3：
Determination of Reference: REFER / 10.4：
Variability: VARIA / 10.5：
Relations Between Situations / 11：
Semantic Interpretation of Conjunctions / 11.1：
Subordinating Conjunctions (Subordinators) / 11.1.1：
Coordinative Conjunctions (Coordinators) / 11.1.3：
Conditions and Reasons / 11.2：
Language Phenomena and Representational Means / 11.2.1：
Causality / 11.2.2：
Conditional Relations / 11.2.3：
Counterfactuals / 11.3：
Contextual Restrictions and Situational Embedding / 11.4：
The Rhetorical Structure Theory (RST) / 11.5：
Lexicon and Knowledge Representation / 12：
Linguistic Knowledge and World Knowledge / 12.1：
The Semantic Component of the Lexicon / 12.2：
Question Answering and Inferences / 13：
Logical Principles / 13.1：
Classes of Questions and Inferential Answer Finding / 13.2：
Associatively Guided Question Answering / 13.3：
Software Tools for the Knowledge Engineer / Sample Applications / 14：
Knowledge Management as an Engineering Task / 14.1：
MWR - the Workbench for the Knowledge Engineer / 14.2：
NatLink - A Semantic Interpreter for MultiNet / 14.3：
LIA - the Workbench for the Computer Lexicographer / 14.4：
VILAB - The Virtual Laboratory / 14.5：
Comparison Between MultiNet and Other Semantic Formalisms / 15：
Introductory Remarks / 15.1：
MultiNet and Other Network Representations / 15.2：
Structured Inheritance Networks / 15.2.1：
The Semantic Network Processing System (SNePS) / 15.2.2：
Sowa's Conceptual Structures (SCS) / 15.2.3：
Scripts and the Conceptual Dependency Theory / 15.2.4：
MultiNet and Logic-Oriented Semantic Formalisms / 15.3：
The Discourse Representation Theory / 15.3.1：
Description Logics / 15.3.3：
The Generalized Quantifier Theory / 15.3.4：
Comparison Between MultiNet and Frame Representations / 15.4：
The Knowledge Representation Language KRL / 15.4.1：
The Knowledge Base Project CYC / 15.4.3：
The Representational Means of MultiNet / Part II：
Overview and Representational Principles / 16：
MultiNet Within the Context of Knowledge Processing / 16.1：
The Paradigm of Multilayered Extended Semantic Networks / 16.2：
Conventions of Description / 16.3：
Means for Expressing Classification and Stratification / 17：
Layers / 17.1：
General Remarks on the Typology of Layer Attributes / 17.2.1：
Degree of Generality (Attribute GENER) / 17.2.2：
Determination of Reference (Attribute REFER) / 17.2.3：
Variabihty (Attribute VARIA) / 17.2.4：
Facticity (Attribute FACT) / 17.2.5：
Quantification (QUANT) vs. Cardinality (CARD) / 17.2.6：
Type of Extensionality (Attribute ETYPE) / 17.2.7：
The Classification of Nominal Concepts / 17.2.8：
Encapsulation of Concepts / 17.3：
Overview / 18：
Relations / 18.2：
AFF: C-Role - Affected Object / 18.2.1：
AGT: C-Role - Agent / 18.2.2：
ANLG2/3: Similarity Between Entities / 18.2.3：
ANTE: Relation of Temporal Succession / 18.2.4：
ANTO: Antonymy Relation / 18.2.5：
ARG1/2/3: Argument Specification at the Metalevel / 18.2.6：
ASSOC: Association / 18.2.7：
ATTCH: Attachment of Objects / 18.2.8：
ATTR: Assignment of Attributes to Objects / 18.2.9：
AVRT: C-Role - Averting from an Object / 18.2.10：
BENE: C-Role - Beneficiary / 18.2.11：
CAUS: Causality, Relation Between Cause and Effect / 18.2.12：
CHEA: Sortal Change: Event - Abstract Concept / 18.2.13：
CHPA: Sortal Change: Property - Abstract Concept / 18.2.14：
CHPE: Sortal Change: Property - Event / 18.2.15：
CHPS: Sortal Change: Property - State / 18.2.16：
CHSA: Sortal Change: State - Abstract State / 18.2.17：
CHSP1/2/3: Sortal Change Between Situational Concepts and Properties / 18.2.18：
CIRC: Relation Between a Situation and a Concomitant Situation / 18.2.19：
CNVRS: Lexical Relation Between Converse Concepts / 18.2.20：
COMPL: Complementarity / 18.2.21：
CONC: Relation Expressing a Concession / 18.2.22：
COND: Conditional Relation / 18.2.23：
CONF: Relation Expressing the Conformity with an Abstract Frame / 18.2.24：
CONTR: Relation of Contrast / 18.2.25：
CORR: Qualitative or Quantitative Correspondence / 18.2.26：
CSTR: C-Role - Causator / 18.2.27：
CTXT: Relation Specifying a Restricting Context / 18.2.28：
DIRCL: Local Destination or Direction / 18.2.29：
DISTG/2/3: Relations Specifying a Difference / 18.2.30：
DPND: Dependency Relation / 18.2.31：
DUR: Relation Specifying a Temporal Extension / 18.2.32：
ELMT: Element Relation / 18.2.33：
EQU: Equivalence Relation / 18.2.34：
EXP: C-Role - Experiencer of an Event / 18.2.35：
EXT: Relation Between Intension and Extension / 18.2.36：
FIN: Temporal End / 18.2.37：
GOAL: Generalized Goal / 18.2.38：
HSIT: Constituents of a Hypersituation / 18.2.39：
IMPL: Implication Relation Between Situations / 18.2.40：
INIT: Initial Situation or Entity / 18.2.41：
INSTR: C-Role - Instrument / 18.2.42：
JUST: Justification of a Situation / 18.2.43：
LEXT: Relation Specifying a Local Extent / 18.2.44：
LOC: Location of a Situation / 18.2.45：
MAJ/MAJE: 'Greater than (or Equal to)'-Relation / 18.2.46：
MANNR: Relation Specifying the Manner / 18.2.47：
MCONT: C-Role - Relation Between a Mental Process and Its Content / 18.2.48：
MERO: Meronymy Relation / 18.2.49：
METH: C-Role - Method / 18.2.50：
MEXP: C-Role - Mental Experiencer / 18.2.51：
MIN/MINE: 'Smaller than (or Equal to)'-Relation / 18.2.52：
MODE: Generalized Mode of a Situation / 18.2.53：
MODL: Relation Specifying the Modality of a Situation / 18.2.54：
NAME: Assignment of a Name to an Object / 18.2.55：
OBJ: C-Role - Neutral Object as Participant / 18.2.56：
OPPOS: C-Role - Relation Specifying an Opposition / 18.2.57：
ORIG: Mental or Informational Origin / 18.2.58：
ORIGL: Relation Specifying the Local Origin / 18.2.59：
ORIGM: Relation Specifying the Material Origin / 18.2.60：
ORNT: C-Role - Orientation to an Object / 18.2.61：
PARS: Relation Between Part and Whole / 18.2.62：
POSS: Relation of Possession / 18.2.63：
PRED/PREDR/PREDS: Predicative Concept Governing a Plurality / 18.2.64：
PROP: Relation Between Object and Property / 18.2.65：
PROPR: Relation Between a Plurality and a Semantically Relational Property / 18.2.66：
PURP: Relation Specifying a Purpose / 18.2.67：
QMOD: Quantitative Modification / 18.2.68：
REAS: General Reason for a Situation / 18.2.69：
RPRS: Representational Form or Manifestation of an Object / 18.2.70：
RSLT: C-Role - Result / 18.2.71：
SCAR: C-Role - Carrier of a State (Passive) / 18.2.72：
SETOF: Relation Between the Extensional of a Plurality and the Governing Predicative Concept / 18.2.73：
SITU: Situational Embedding or Abstract Location / 18.2.74：
SOURC: Generalized Source or Origin / 18.2.75：
SSPE: C-Role - Entity Specifying a State / 18.2.76：
STRT: Relation Specifying the Temporal Beginning / 18.2.77：
SUB: Subordination of Concepts Representing Objects / 18.2.78：
SUBO: Generalized Subordination Relation / 18.2.79：
SUBM/SUBME: Subsumption of Sets (Set Inclusion) / 18.2.80：
SUBR: Metarelation for the Description of Relations / 18.2.81：
SUBS: Subordination of Situations / 18.2.82：
SUBST: Relation Specifying a Substitute for an Entity / 18.2.83：
SUPPL: Supplement Relation / 18.2.84：
SYNO: Synonymy Relation / 18.2.85：
TEMP: Relation Specifying a Temporal Frame / 18.2.86：
VAL: Relation Between Attribute and Value / 18.2.87：
VALR: Relation Between Attributes and Their Value Restriction / 18.2.88：
VIA: Relation Specifying a Spatial Path / 18.2.89：
Functions / 18.3：
ALTN1/2: Construction of Alternative Pluralities / 18.3.1：
COMP: Function for the Comparison of Properties / 18.3.2：
DIFF: Set Difference / 18.3.3：
FLP[subscript J]: Functions Generating Locations / 18.3.4：
INTSC: Intersection of Sets / 18.3.5：
ITMS/ITMS-I: Function for Enumerating Sets and Its Counterpart at the Intensional Level / 18.3.6：
MODP: Function for the Modification of Properties / 18.3.7：
MODQ: Function for the Modification of Quantities / 18.3.8：
MODS: Modification of a Situational Concept / 18.3.9：
NON: Family of Functions Specifying Negation / 18.3.10：
OP[subscript J]: Arithmetic Operations / 18.3.11：
ORD: Function Defining Ordinal Numbers / 18.3.12：
PMOD: Modification of Objects by Associative Properties / 18.3.13：
QUANT: Function Generating Quantities / 18.3.14：
SUPL: Function Characterizing the Superlative / 18.3.15：
TUPL: Function Generating Tuples / 18.3.16：
UNION: Union of Sets / 18.3.17：
VEL1/2: Disjunctive Composition of Situations / 18.3.18：
Table of Abbreviations / A：
Overview of the Representational Means / B：
Semantic Templates for the Meaning of Relations / C：
Characterization of Arcs with Regard to Their Knowledge Type / D：
Classes of Typical Axioms / E：
R-Axioms (Categorical Knowledge) / E.1：
R-Axioms (Default Knowledge) / E.2：
R-Axioms (Definitions of Relations) / E.3：
Axioms Concerning the Preextensional Level / E.4：
B-Axioms (Categorical Knowledge) / E.5：
R-Axioms and B-Axioms (Spatio-temporal Relations) / E.6：
Axiom Schemata (B-Axioms) / E.7：
Axiom Schemata (R-Axioms) / E.8：
Bibliography
List of Figures
Index
Knowledge Representation with MultiNet / Part I：
Introduction / 1：
Historical Roots / 2：
91.

電子ブック
ＥＢ
91. Secure Transaction Protocol Analysis
Qingfeng Chen, Takeo Kanade, Chengqi Zhang, Shichao Zhang
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
Formal Methods and Related Areas / 1.3：
Emerging Issues and Trends / 1.4：
A Brief Discussion on the Chapters / 1.5：
Summary / 1.6：
Overview of Security Protocol Analysis / 2：
The Formalism / 2.1：
Basic Notations and Terminology / 2.1.1：
Inference Rules / 2.1.2：
Security Protocols / 2.2：
SET Protocol / 2.2.1：
Netbill Protocol / 2.2.2：
Security Services / 2.2.3：
Principles of Cryptography / 2.2.4：
Threats in Security Protocols / 2.2.5：
Research into Analysis of Security Protocols / 2.3：
A Discussion of Formal Methods and Security Protocols / 2.3.1：
A Brief Introduction to Protocol Abstraction / 2.3.2：
A Classification of Approaches for Protocol Analysis / 2.3.3：
Attack-Construction Approach / 2.4：
Approaches by Dolev and Yao / 2.4.1：
NRL Protocol Analyser / 2.4.2：
Inference-Construction Approach / 2.5：
BAN Logic / 2.5.1：
Extensions to BAN Logic / 2.5.2：
Proof-Construction Approach / 2.6：
Approaches Using Formal Tools and Specification Languages / 2.7：
Formal Analysis of Secure Transaction Protocols / 2.8：
Research into Verifying Electronic Transaction Protocols / 3.1：
Formalism for Protocol Analysis Using Process Calculi / 3.2.1：
Formal Analysis Using an Observational Transition System / 3.2.2：
Formal Analysis of Card-Based Payment Systems in Mobile Devices / 3.2.3：
A Computational Model / 3.3：
Basic Terms and Statements / 3.4：
Logical Framework and Statement of ENDL / 3.5：
Axiom / 3.5.1：
Inference Format / 3.5.2：
Verification Instances of Security Protocols in ENDL / 3.5.4：
Model Checking in Security Protocol Analysis / 3.6：
An Overview of Model Checking in Analysing E-Commerce Protocols / 4.1：
Model Checking for Failure Analysis of Protocols / 4.1.1：
Automatic Analysis of E-commerce Protocols Using UML / 4.1.2：
An ENDL-Based Verification Model / 4.2：
Components / 4.2.1：
Designing the Model / 4.2.2：
Handling the Knowledge and Facts / 4.2.3：
Recognition / 4.2.4：
Comparison with Theorem Proving / 4.3：
Discussion / 4.4：
Uncertainty Issues in Secure Messages / 4.5：
Estimation of Inconsistency of Secure Messages / 5.1：
Related Work / 5.2.1：
Semantics Description / 5.2.2：
Measuring Inconsistency in Secure Messages / 5.2.3：
Examples of Measuring Inconsistency / 5.2.4：
Experiments / 5.2.5：
Integration of Conflicting Beliefs in Secure Messages / 5.3：
Basic Concepts / 5.3.1：
Handling Inconsistent Beliefs in Secure Messages / 5.3.3：
Applications of Data Mining in Protocol Analysis / 5.3.4：
Association Rule Mining for Inconsistent Secure Messages / 6.1：
The Basics of Association Rule Mining / 6.4.1：
Data Preparation / 6.4.2：
Identifying Association Rules of Interest / 6.4.3：
Algorithms and Experiments / 6.5：
Algorithms / 6.5.1：
Detection Models of Collusion Attacks / 6.5.2：
Identification of Frequent Patterns for Collusion Attack Detection / 7.1：
A Framework to Detect Collusion Attacks / 7.3.1：
Dealing with Knowledge and Facts / 7.3.3：
A Case Study / 7.3.4：
Estimation of the Probability of Collusion Attacks / 7.4：
Motivations / 7.4.1：
Preliminaries / 7.4.2：
Identifying Collusion Attack Using Bayesian Network / 7.4.3：
Conclusion and Future Works / 7.4.4：
Conclusion / 8.1：
Future Work / 8.2：
References
Index
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
92.

電子ブック
ＥＢ
92. Security for Telecommunications Networks
Patrick Traynor, Thomas F. La Porta, Patrick Drew McDaniel
出版情報: Springer eBooks Computer Science , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Telecommunications Networks / 1.1：
Network Convergence and Security / 1.2：
Outline of this Book / 1.3：
Audience / 1.4：
Other Sources of Information / 1.5：
Network Architecture / Part I：
Security / 2：
Overview / 2.1：
What is security? / 2.1.1：
Basic Terminology / 2.1.2：
Attacks / 2.1.3：
Trust / 2.1.4：
Services and Tools / 2.2：
Cryptography / 2.2.1：
Authentication and Authorization / 2.2.2：
Certificates and PKI / 2.2.3：
Network Security / 2.3：
IPsec / 2.3.1：
SSL/TLS / 2.3.2：
Firewalls / 2.3.3：
Intrusion and Anomaly Detection / 2.3.4：
Summary / 2.4：
Cellular Architecture / 3：
History of Cellular Telephony / 3.1：
Cellular Voice Networks / 3.2：
Voice Network Elements / 3.2.1：
Home Location Register / 3.2.2：
Mobile Switching Center/Visiting Location Register / 3.2.3：
Base Station Subsystem / 3.2.4：
Cellular Data Networks / 3.3：
Data Network Elements / 3.3.1：
Gateway GPRS Support Node / 3.3.2：
Serving GPRS Support Node / 3.3.3：
Signaling Network and Protocols / 3.4：
Common Channel Signaling Network / 3.4.1：
Message Transfer Part / 3.4.2：
Signaling Connection Control Part / 3.4.3：
Transaction Capabilities Application Part / 3.4.4：
Mobile Application Part / 3.4.5：
ISDN User Part / 3.4.6：
Wireless Network / 3.5：
Wireless Access Techniques / 3.5.1：
Frequency Issues / 3.5.2：
Voice Encoding / 3.5.3：
Summary of Procedures / 3.5.4：
Registration and Call Setup Procedures / 3.6：
Core Network Security / 3.7：
Air Interface Security / 3.8：
Vulnerability Analysis / 3.9：
Vulnerabilities in the Telephony / 4：
Weak Cryptographic Algorithms / 4.1：
Vulnerabilities in the Network Core / 4.2：
Wireless Eavesdropping / 4.3：
Jamming / 4.4：
Use Tracking and Privacy / 4.5：
Overload / 4.6：
Malware / 4.7：
Vulnerabilities in the Short Messaging Service (SMS) / 5：
History and Description / 5.1：
Delivering Messages / 5.2：
Submitting a Message / 5.2.1：
Routing a Message / 5.2.2：
Wireless Delivery / 5.2.3：
Identifying System Bottlenecks / 5.3：
Queue Management / 5.3.1：
Message Injection / 5.3.2：
Efficient Device Targeting / 5.4：
NPA/NXX / 5.4.1：
Web Scraping / 5.4.2：
Testing Phone "Liveness" / 5.4.3：
Additional Collection Methods / 5.4.4：
Modeling Denial of Service / 5.5：
Attacking Individuals / 5.5.1：
Metropolitan Area Service / 5.5.2：
Regional Service / 5.5.3：
Network Characterization / 5.6：
Attack Characterization / 5.7：
Current Solutions / 5.8：
Weighted Fair Queuing / 5.9：
Weighted Random Early Detection / 5.9.2：
Resource Provisioning / 5.9.3：
Strict Resource Provisioning / 5.10.1：
Dynamic Resource Provisioning / 5.10.2：
Direct Channel Allocation / 5.10.3：
Combining Mechanisms / 5.10.4：
Vulnerabilities in Cellular Data Networks / 5.12：
Delivering Packets from the Internet / 6.1：
Device Registration / 6.2.1：
Submitting Packets / 6.2.2：
Routing Packets / 6.2.3：
Packet Multiplexing / 6.2.4：
Exploiting Cellular Data Services / 6.4：
Determining Network Settings / 6.4.1：
Exploiting Teardown Mechanisms / 6.4.2：
Exploiting Setup Mechanisms / 6.4.3：
Conflicts in Network Design / 6.5：
Efficient Mitigation of Data Network Vulnerabilities / 6.6：
Vulnerabilities in Voice over IP / 6.7：
Session Initiation Protocol / 7.1：
Architecture / 7.2.1：
SIP Messages / 7.2.2：
Making Phone Calls / 7.2.3：
IP-Multimedia Subsystem Network / 7.3：
IMS Architecture / 7.3.1：
IMS Versus Pure Internet Telephony / 7.3.2：
Wireless Issues / 7.5：
Security Issues / 7.6：
Analysis of Emerging Vulnerabilities / 7.6.1：
Building Secure IP Telephony Networks / 7.7：
Future Analyses / 7.8：
Future Directions and Challenges / 8：
Denial of Service Attacks / 8.1：
Logical vs Flooding Attacks / 8.1.1：
Problems in "Controlled" Networks / 8.1.2：
End-To-End Arguments and Security / 8.2：
The Future of Rigid Systems / 8.3：
Moving Forward / 8.4：
Glossary
References
Index
Introduction / 1：
Telecommunications Networks / 1.1：
Network Convergence and Security / 1.2：
93.

電子ブック
ＥＢ
93. Secure Transaction Protocol Analysis
Qingfeng Chen, Takeo Kanade, Chengqi Zhang, Shichao Zhang
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
Formal Methods and Related Areas / 1.3：
Emerging Issues and Trends / 1.4：
A Brief Discussion on the Chapters / 1.5：
Summary / 1.6：
Overview of Security Protocol Analysis / 2：
The Formalism / 2.1：
Basic Notations and Terminology / 2.1.1：
Inference Rules / 2.1.2：
Security Protocols / 2.2：
SET Protocol / 2.2.1：
Netbill Protocol / 2.2.2：
Security Services / 2.2.3：
Principles of Cryptography / 2.2.4：
Threats in Security Protocols / 2.2.5：
Research into Analysis of Security Protocols / 2.3：
A Discussion of Formal Methods and Security Protocols / 2.3.1：
A Brief Introduction to Protocol Abstraction / 2.3.2：
A Classification of Approaches for Protocol Analysis / 2.3.3：
Attack-Construction Approach / 2.4：
Approaches by Dolev and Yao / 2.4.1：
NRL Protocol Analyser / 2.4.2：
Inference-Construction Approach / 2.5：
BAN Logic / 2.5.1：
Extensions to BAN Logic / 2.5.2：
Proof-Construction Approach / 2.6：
Approaches Using Formal Tools and Specification Languages / 2.7：
Formal Analysis of Secure Transaction Protocols / 2.8：
Research into Verifying Electronic Transaction Protocols / 3.1：
Formalism for Protocol Analysis Using Process Calculi / 3.2.1：
Formal Analysis Using an Observational Transition System / 3.2.2：
Formal Analysis of Card-Based Payment Systems in Mobile Devices / 3.2.3：
A Computational Model / 3.3：
Basic Terms and Statements / 3.4：
Logical Framework and Statement of ENDL / 3.5：
Axiom / 3.5.1：
Inference Format / 3.5.2：
Verification Instances of Security Protocols in ENDL / 3.5.4：
Model Checking in Security Protocol Analysis / 3.6：
An Overview of Model Checking in Analysing E-Commerce Protocols / 4.1：
Model Checking for Failure Analysis of Protocols / 4.1.1：
Automatic Analysis of E-commerce Protocols Using UML / 4.1.2：
An ENDL-Based Verification Model / 4.2：
Components / 4.2.1：
Designing the Model / 4.2.2：
Handling the Knowledge and Facts / 4.2.3：
Recognition / 4.2.4：
Comparison with Theorem Proving / 4.3：
Discussion / 4.4：
Uncertainty Issues in Secure Messages / 4.5：
Estimation of Inconsistency of Secure Messages / 5.1：
Related Work / 5.2.1：
Semantics Description / 5.2.2：
Measuring Inconsistency in Secure Messages / 5.2.3：
Examples of Measuring Inconsistency / 5.2.4：
Experiments / 5.2.5：
Integration of Conflicting Beliefs in Secure Messages / 5.3：
Basic Concepts / 5.3.1：
Handling Inconsistent Beliefs in Secure Messages / 5.3.3：
Applications of Data Mining in Protocol Analysis / 5.3.4：
Association Rule Mining for Inconsistent Secure Messages / 6.1：
The Basics of Association Rule Mining / 6.4.1：
Data Preparation / 6.4.2：
Identifying Association Rules of Interest / 6.4.3：
Algorithms and Experiments / 6.5：
Algorithms / 6.5.1：
Detection Models of Collusion Attacks / 6.5.2：
Identification of Frequent Patterns for Collusion Attack Detection / 7.1：
A Framework to Detect Collusion Attacks / 7.3.1：
Dealing with Knowledge and Facts / 7.3.3：
A Case Study / 7.3.4：
Estimation of the Probability of Collusion Attacks / 7.4：
Motivations / 7.4.1：
Preliminaries / 7.4.2：
Identifying Collusion Attack Using Bayesian Network / 7.4.3：
Conclusion and Future Works / 7.4.4：
Conclusion / 8.1：
Future Work / 8.2：
References
Index
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
94.

電子ブック
ＥＢ
94. Security for Telecommunications Networks
Patrick Traynor, Thomas F. La Porta, Patrick Drew McDaniel, Thomas La Porta, Patrick McDaniel
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Telecommunications Networks / 1.1：
Network Convergence and Security / 1.2：
Outline of this Book / 1.3：
Audience / 1.4：
Other Sources of Information / 1.5：
Network Architecture / Part I：
Security / 2：
Overview / 2.1：
What is security? / 2.1.1：
Basic Terminology / 2.1.2：
Attacks / 2.1.3：
Trust / 2.1.4：
Services and Tools / 2.2：
Cryptography / 2.2.1：
Authentication and Authorization / 2.2.2：
Certificates and PKI / 2.2.3：
Network Security / 2.3：
IPsec / 2.3.1：
SSL/TLS / 2.3.2：
Firewalls / 2.3.3：
Intrusion and Anomaly Detection / 2.3.4：
Summary / 2.4：
Cellular Architecture / 3：
History of Cellular Telephony / 3.1：
Cellular Voice Networks / 3.2：
Voice Network Elements / 3.2.1：
Home Location Register / 3.2.2：
Mobile Switching Center/Visiting Location Register / 3.2.3：
Base Station Subsystem / 3.2.4：
Cellular Data Networks / 3.3：
Data Network Elements / 3.3.1：
Gateway GPRS Support Node / 3.3.2：
Serving GPRS Support Node / 3.3.3：
Signaling Network and Protocols / 3.4：
Common Channel Signaling Network / 3.4.1：
Message Transfer Part / 3.4.2：
Signaling Connection Control Part / 3.4.3：
Transaction Capabilities Application Part / 3.4.4：
Mobile Application Part / 3.4.5：
ISDN User Part / 3.4.6：
Wireless Network / 3.5：
Wireless Access Techniques / 3.5.1：
Frequency Issues / 3.5.2：
Voice Encoding / 3.5.3：
Summary of Procedures / 3.5.4：
Registration and Call Setup Procedures / 3.6：
Core Network Security / 3.7：
Air Interface Security / 3.8：
Vulnerability Analysis / 3.9：
Vulnerabilities in the Telephony / 4：
Weak Cryptographic Algorithms / 4.1：
Vulnerabilities in the Network Core / 4.2：
Wireless Eavesdropping / 4.3：
Jamming / 4.4：
Use Tracking and Privacy / 4.5：
Overload / 4.6：
Malware / 4.7：
Vulnerabilities in the Short Messaging Service (SMS) / 5：
History and Description / 5.1：
Delivering Messages / 5.2：
Submitting a Message / 5.2.1：
Routing a Message / 5.2.2：
Wireless Delivery / 5.2.3：
Identifying System Bottlenecks / 5.3：
Queue Management / 5.3.1：
Message Injection / 5.3.2：
Efficient Device Targeting / 5.4：
NPA/NXX / 5.4.1：
Web Scraping / 5.4.2：
Testing Phone "Liveness" / 5.4.3：
Additional Collection Methods / 5.4.4：
Modeling Denial of Service / 5.5：
Attacking Individuals / 5.5.1：
Metropolitan Area Service / 5.5.2：
Regional Service / 5.5.3：
Network Characterization / 5.6：
Attack Characterization / 5.7：
Current Solutions / 5.8：
Weighted Fair Queuing / 5.9：
Weighted Random Early Detection / 5.9.2：
Resource Provisioning / 5.9.3：
Strict Resource Provisioning / 5.10.1：
Dynamic Resource Provisioning / 5.10.2：
Direct Channel Allocation / 5.10.3：
Combining Mechanisms / 5.10.4：
Vulnerabilities in Cellular Data Networks / 5.12：
Delivering Packets from the Internet / 6.1：
Device Registration / 6.2.1：
Submitting Packets / 6.2.2：
Routing Packets / 6.2.3：
Packet Multiplexing / 6.2.4：
Exploiting Cellular Data Services / 6.4：
Determining Network Settings / 6.4.1：
Exploiting Teardown Mechanisms / 6.4.2：
Exploiting Setup Mechanisms / 6.4.3：
Conflicts in Network Design / 6.5：
Efficient Mitigation of Data Network Vulnerabilities / 6.6：
Vulnerabilities in Voice over IP / 6.7：
Session Initiation Protocol / 7.1：
Architecture / 7.2.1：
SIP Messages / 7.2.2：
Making Phone Calls / 7.2.3：
IP-Multimedia Subsystem Network / 7.3：
IMS Architecture / 7.3.1：
IMS Versus Pure Internet Telephony / 7.3.2：
Wireless Issues / 7.5：
Security Issues / 7.6：
Analysis of Emerging Vulnerabilities / 7.6.1：
Building Secure IP Telephony Networks / 7.7：
Future Analyses / 7.8：
Future Directions and Challenges / 8：
Denial of Service Attacks / 8.1：
Logical vs Flooding Attacks / 8.1.1：
Problems in "Controlled" Networks / 8.1.2：
End-To-End Arguments and Security / 8.2：
The Future of Rigid Systems / 8.3：
Moving Forward / 8.4：
Glossary
References
Index
Introduction / 1：
Telecommunications Networks / 1.1：
Network Convergence and Security / 1.2：
95.

電子ブック
ＥＢ
95. Modular Specification and Verification of Object-Oriented Programs
Peter Müller
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2002
所蔵情報: loading…
目次情報: 続きを見る
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：
96.

電子ブック
ＥＢ
96. Lithium Ion Rechargeable Batteries: Materials, Technology, and New Applications
Kazunori Ozawa
出版情報: Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Inc., 2009
所蔵情報: loading…
目次情報: 続きを見る
Preface
List of Contributors
General Concepts / Kenzo Matsuki ; Kazunori Ozawa1：
Brief Outline of Batteries / 1.1：
Galvanic Cell System - Aqueous Electrolyte System / 1.1.1：
Lithium-Cell System - Nonaqueous Electrolyte System / 1.1.2：
Early Development of Lithium-Ion Batteries / 1.2：
Ceramics Production Capability / 1.2.1：
Coating Technology / 1.2.2：
LiPF6 as a Salt for Electrolytes / 1.2.3：
Graphite Conductor in the Cathode / 1.2.4：
Using Hard Carbon for the Anode / 1.2.5：
Nonwoven Shut-down Separator / 1.2.6：
Ni-Plated Fe Can / 1.2.7：
Toward a Realistic Goal / 1.3：
References
Lithium Insertion Materials Having Spinel-Framework Structure for Advanced Batteries / Kingo Ariyoshi ; Yoshinari Makimura ; Tsutomu Ohzuku2：
Introduction / 2.1：
Structural Description of Spinel / 2.2：
Derivatives of Spinel-Framework Structure / 2.3：
Superlattice Structures Derived from "Spinel" / 2.3.1：
Examples of Superstructure Derived from "Spinel" / 2.3.2：
Electrochemistry of Lithium Insertion Materials Having Spinel-Framework Structure / 2.4：
Lithium Manganese Oxides (LMO) / 2.4.1：
Lithium Titanium Oxide (LTO) / 2.4.2：
Lithium Nickel Manganese Oxide (LiNiMO) / 2.4.3：
An Application of Lithium Insertion Materials Having Spinel-Framework Structure to 12 V "Lead-Free" Accumulators / 2.5：
Twelve-Volt Batteries Consisting of Lithium Titanium Oxide (LTO) and Lithium Manganese Oxide (LMO) / 2.5.1：
Twelve-Volt Batteries Consisting of Lithium Titanium Oxide (LTO) and Lithium Nickel Manganese Oxide (LiNiMO) / 2.5.2：
Concluding Remarks / 2.6：
Overlithiated Li1+x(Niz Co1-2ZMnz)1-xO2 as Positive Electrode Materials for Lithium-Ion Batteries / Naoaki Kumagai ; Jung-Min Kim3：
Co-Free Li1+x (Ni1/2Mn1/2)1-xO2 / 3.1：
Li1+x (Ni1/3Co1/3Mn1/3)1-xO2 / 3.3：
Other Li1+x(NizCo1-2zMnz)1-xO2 Materials / 3.4：
Conclusion / 3.5：
Iron-Based Rare-Metal-Free Cathodes / Shigeto Okada ; Jun-ichi Yamaki4：
2D Layered Rocksalt-Type Oxide Cathode / 4.1：
3D NASICON-Type Sulfate Cathode / 4.3：
3D Olivine-Type Phosphate Cathode / 4.4：
3D Calcite-Type Borate Cathode / 4.5：
3D Perovskite-Type Fluoride Cathode / 4.6：
Summary / 4.7：
Thermodynamics of Electrode Materials for Lithium-Ion Batteries / Rachid Yazami5：
Experimental / 5.1：
The ETMS / 5.2.1：
Electrochemical Cells: Construction and Formation Cycles / 5.2.2：
Thermodynamics Data Acquisition / 5.2.3：
Results / 5.3：
Carbonaceous Anode Materials / 5.3.1：
Pre-coke (HTT < 500 C) / 5.3.1.1：
Cokes HTT 900-1700°C / 5.3.1.2：
Cokes HTT 2200 and 2600°C / 5.3.1.3：
Natural Graphite / 5.3.1.4：
Entropy and Degree of Graphitization / 5.3.1.5：
Cathode Materials / 5.3.2：
LiCoO2 / 5.3.2.1：
LiMn2O4 / 5.3.2.2：
Effect of Cycling on Thermodynamics / 5.3.2.3：
Raman Investigation of Cathode Materials for Lithium Batteries / Rita Baddour-Hadjean ; Jean-Pierre Pereira-Ramos5.4：
Raman Microspectrometry: Principle and Instrumentation / 6.1：
Principle / 6.2.1：
Instrumentation / 6.2.2：
Transition Metal-Oxide-Based Compounds / 6.3：
LiNiO2 and Its Derivative Compounds LiNi1-yCoyO2 (0 < y < 1) / 6.3.1：
Manganese Oxide-Based Compounds / 6.3.3：
MnO2-Type Compounds / 6.3.3.1：
Ternary Lithiated LixMnOy Compounds / 6.3.3.2：
V2O5 / 6.3.4：
V2O5 Structure / 6.3.4.1：
Structural Features of the LixV2O5 Phases / 6.3.4.2：
Titanium Dioxide / 6.3.5：
Phospho-Olivine LiMPO4 Compounds / 6.4：
General Conclusion / 6.5：
Development of Lithium-Ion Batteries: From the Viewpoint of Importance of the Electrolytes / Masaki Yoshio ; Hiroyoshi Nakamura ; Nikolay Dimov7：
General Design to Find Additives for Improving the Performance of LIB / 7.1：
A Series of Developing Processes to Find Novel Additives / 7.3：
Cathodic and the Other Additives for LIBs / 7.4：
Conditioning / 7.5：
Inorganic Additives and Electrode Interface / Shinichi Komaba8：
Transition Metal Ions and Cathode Dissolution / 8.1：
Mn(II) Ion / 8.2.1：
Co(II) Ion / 8.2.2：
Ni(II) Ion / 8.2.3：
How to Suppress the Mn(II) Degradation / 8.3：
LiI, LiBr, and NH4I / 8.3.1：
2-Vinylpyridine / 8.3.2：
Alkali Metal Ions / 8.4：
Na+ Ion / 8.4.1：
K+ Ion / 8.4.2：
Alkali Salt Coating / 8.5：
Characterization of Solid Polymer Electrolytes and Fabrication of all Solid-State Lithium Polymer Secondary Batteries / Masataka Wakihara ; Masanobu Nakayama ; Yuki Kato8.6：
Molecular Design and Characterization of Polymer Electrolytes with Li Salts / 9.1：
Solid Polymer Electrolytes with Plasticizers / 9.1.1：
Preparation of SPE Films with B-PEG and Al-PEG Plasticizers / 9.1.3：
Evaluation of SPE Films with B-PEG Plasticizers / 9.1.4：
Ionic Conductivity of SPE Films with B-PEG Plasticizers / 9.1.5：
Transport Number of Lithium Ions / 9.1.6：
Electrochemical Stability / 9.1.7：
Fabrication of All-Solid-State Lithium Polymer Battery / 9.1.8：
Required Ionic Conductivity of SPE / 9.2.1：
Difference between Conventional Battery with Liquid Electrolyte and All-Solid-State LPB / 9.2.3：
Fabrication and Electrochemical Performance of LPBs Using SPE with B-PEG and/or Al-PEG Plasticizers / 9.2.4：
Fabrication of a Nonflammable Lithium Polymer Battery and Its Electrochemical Evaluation / 9.2.5：
Thin-Film Metal-Oxide Electrodes for Lithium Microbatteries / 9.2.6：
Lithium Cobalt Oxide Thin Films / 10.1：
Sputtered LiCoO2 Films / 10.2.1：
Liquid Electrolyte / 10.2.1.1：
Solid-State Electrolyte / 10.2.1.2：
PLD LiCoO2 Films / 10.2.2：
CVD LiCoO2 Films / 10.2.3：
LiCoO2 Films Prepared by Chemical Routes / 10.2.4：
LiNiO2 and Its Derivatives Compounds LiNi1-xMO2 / 10.2.5：
Li - Ni - Mn Films / 10.3.1：
LiMn2O4 Films / 10.3.4：
Sputtered LiMn2O4 Films / 10.4.1：
PLD LiMn2O4 Films / 10.4.2：
ESD LiMn2O4 Films / 10.4.3：
LiMn2O4 Films Prepared Through Chemical Routes / 10.4.4：
Substituted LiMn2-xMxO4 Spinel Films / 10.4.5：
V2O5 Thin Films / 10.4.6：
Sputtered V2O5 Thin Films / 10.5.1：
PLD V2O5 Thin Films / 10.5.1.1：
CVD V2O5 Films / 10.5.3：
V2O5 Films Prepared by Evaporation Techniques / 10.5.4：
V2O5 Films Prepared by Electrostatic Spray Deposition / 10.5.5：
V2O5 Films Prepared via Solution Techniques / 10.5.6：
MoO3 Thin Films / 10.5.7：
Solid State Electrolyte / 10.6.1：
General Conclusions / 10.6.3：
Research and Development Work on Advanced Lithium-Ion Batteries for High-Performance Environmental Vehicles / Hideaki Horie11：
Energy Needed to Power an EV / 11.1：
Quest for a High-Power Characteristic in Lithium-Ion Batteries / 11.3：
Cell Thermal Behavior and Cell System Stability / 11.4：
Further Reading
Index
Preface
List of Contributors
General Concepts / Kenzo Matsuki ; Kazunori Ozawa1：
97.

電子ブック
ＥＢ
97. Qualit? dei Dati
Carlo Batini, Paolo Ancilotti, Monica Scannapieco
出版情報: Springer eBooks Computer Science , Springer Milan, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduzione alla Qualità dei Dati / 1：
Perché la Qualità dei Dati è Importante / 1.1：
Introduzione alla Nozione di Qualità dei Dati / 1.2：
Qualità dei Dati e Tipi di Dati / 1.3：
Qualità dei Dati e Tipi di Sistema Informativo / 1.4：
Principali Problemi di Ricerca e Domini Applicativi della Qualità dei Dati / 1.5：
Problemi della Ricerca nel Campo della Qualità dei Dati / 1.5.1：
Domini Applicativi della Qualitaà dei Dati / 1.5.2：
Aree di Ricerca Legate alla Qualità dei Dati / 1.5.3：
Sommario / 1.6：
Dimensioni della Qualità dei Dati / 2：
Accuratezza / 2.1：
Completezza / 2.2：
Completezza dei Dati Relazionali / 2.2.1：
Completezza dei Dati Web / 2.2.2：
Dimensioni temporali: Aggiornamento, Tempestività e Volatilità / 2.3：
Consistenza / 2.4：
Vincoli di Integrità / 2.4.1：
Data Edit / 2.4.2：
Altre Dimensioni della Qualità dei Dati / 2.5：
Accessibilità / 2.5.1：
Qualità delle Sorgenti Informative / 2.5.2：
Approcci alla Definizione delle Dimensioni di Qualità dei Dati / 2.6：
Approccio Teorico / 2.6.1：
Approccio empirico / 2.6.2：
Approccio Intuitivo / 2.6.3：
Analisi Comparativa delle Definizioni delle Dimensioni / 2.6.4：
Trade-off Tra Dimensioni / 2.6.5：
Dimensioni di Qualità dello Schema / 2.7：
Leggibilità / 2.7.1：
Normalizzazione / 2.7.2：
Modelli per la Qualità dei Dati / 2.8：
Introduzione / 3.1：
Estensioni dei Modelli dei Dati Strutturati / 3.2：
Modelli Concettuali / 3.2.1：
Modelli Logici per la Descrizione dei Dati / 3.2.2：
Il Modello Polygen per la Manipolazione dei Dati / 3.2.3：
Provenance dei Dati / 3.2.4：
Estensione dei Modelli per Dati Semistrutturati / 3.3：
Modelli per i Sistemi Informativi Gestionali / 3.4：
Modelli per la Descrizione dei Processi: il modello IP-MAP / 3.4.1：
Estensioni di IP-MAP / 3.4.2：
Modelli per i Dati / 3.4.3：
Attività e Tecniche Inerenti la Qualità dei Dati: Generalità / 3.5：
Attività Inerenti la Qualità dei Dati / 4.1：
Composizione della Qualità / 4.2：
Modelli e Assunzioni / 4.2.1：
Dimensioni / 4.2.2：
Localizzazione e Correzione degli Errori / 4.2.3：
Localizzare e Correggere le Inconsistenze / 4.3.1：
Dati Incompleti / 4.3.2：
Scoperta dei Valori Anomali / 4.3.3：
Classificazioni dei Costi e dei Benefici / 4.4：
Classificazioni dei Costi / 4.4.1：
Classificazione dei Benefici / 4.4.2：
Identificazione degli Oggetti / 4.5：
Cenni Storici / 5.1：
Identificazione degli Oggetti per le Diverse Tipologie di Dati / 5.2：
Il Processo di Identificazione degli Oggetti ad Alto Livello / 5.3：
Dettagli sui Passi dell'Identificazione degli Oggetti / 5.4：
Preprocessing / 5.4.1：
Riduzione dello Spazio di Ricerca / 5.4.2：
Funzioni di Confronto / 5.4.3：
Tecniche di Identificazione degli Oggetti / 5.5：
Tecniche Probabilistiche / 5.6：
La Teoria di Fellegi e Sunter e sue Estensioni / 5.6.1：
Una Tecnica Probabilistica Basata sui Costi / 5.6.2：
Tecniche empiriche / 5.7：
Metodo del Sorted Neighborhood e sue Estensioni / 5.7.1：
L'Algoritmo a Coda di Priorità / 5.7.2：
Una Tecnica per Dati Strutturati Complessi: Delphi / 5.7.3：
Scoperta dei Duplicati XML: DogmatiX / 5.7.4：
Altri Metodi Empirici / 5.7.5：
Tecniche Basate sulla Conoscenza / 5.8：
Un Approccio Basato su Regole: Intelliclean / 5.8.1：
Metodi di Apprendimento per le Regole di Decisione: Atlas / 5.8.2：
Confronto delle Tecniche / 5.9：
Metriche / 5.9.1：
Metodi di Riduzione dello Spazio di Ricerca / 5.9.2：
Metodi Decisionali / 5.9.3：
Risultati / 5.9.5：
Problemi Inerenti la Qualità dei Dati nei Sistemi di Integrazione dei Dati / 5.10：
Generalità sui Sistemi di Integrazione dei Dati / 6.1：
Elaborazione delle Interrogazioni / 6.2.1：
Tecniche per l'Elaborazione delle Interrogazioni Guidata dalla Qualità / 6.3：
Il QP-alg: Pianificazione delle Interrogazioni Guidata dalla Qualità / 6.3.1：
Elaborazione delle Interrogazioni in DaQuinCIS / 6.3.2：
Elaborazione dell'Interrogazione con Fusionplex / 6.3.3：
Confronto tra le Tecniche di Elaborazione dell'Interrogazione Guidata dalla Qualitaà / 6.3.4：
Risoluzione dei Conflitti a Livello di Istanza / 6.4：
Classificazione dei Conflitti a Livello di Istanza / 6.4.1：
Panoramica delle Tecniche / 6.4.2：
Confronto tra le Tecniche di Risoluzione dei Conflitti a Livello di Istanza / 6.4.3：
Gestione delle Inconsistenze nell'Integrazione dei Dati: una Prospettiva Teorica / 6.5：
Un Framework Formale per l'Integrazione dei Dati / 6.5.1：
Il Problema dell'Inconsistenza / 6.5.2：
Metodologie per la Misurazione e il Miglioramento della Qualità dei Dati / 6.6：
Fondamenti delle Metodologie per la Qualità dei Dati / 7.1：
Input e output / 7.1.1：
Classificazione delle Metodologie / 7.1.2：
Confronto tra Strategie Guidate dai Dati e Strategie Guidate dai Processi / 7.1.3：
Metodologie per la Valutazione / 7.2：
Analisi Comparativa Delle Metodologie per Scopi Generali / 7.3：
Fasi Fondamentali Comuni tra le Metodologie / 7.3.1：
La Metodologia TDQM / 7.3.2：
La Metodologia TQdM / 7.3.3：
La Metodologia Istat / 7.3.4：
Confronto delle Metodologie / 7.3.5：
La Metodologia CDQM / 7.4：
Ricostruire lo Stato dei Dati / 7.4.1：
Ricostruire i Processi Aziendali / 7.4.2：
Ricostruire Macroprocessi e Regole / 7.4.3：
Verificare i Problemi con gli Utenti / 7.4.4：
Misurare la Qualitaà dei Dati / 7.4.5：
Fissare Nuovi Livelli Target della QD / 7.4.6：
Scegliere le Attività di Miglioramento / 7.4.7：
Scegliere le Tecniche per le Attività dei Dati / 7.4.8：
Individuare i Processi di Miglioramento / 7.4.9：
Scegliere il Processo di Miglioramento Ottimale / 7.4.10：
Lo Studio di un Caso per l'Area e-Government / 7.5：
Strumenti per la Qualità dei Dati / 7.6：
Strumenti / 8.1：
Potter's Wheel / 8.2.1：
Telcordia / 8.2.2：
Ajax / 8.2.3：
Arktos / 8.2.4：
Choice Maker / 8.2.5：
Framework per Sistemi Informativi Cooperativi / 8.3：
Framework DaQuinCIS / 8.3.1：
Framework FusionPlex / 8.3.2：
Toolbox per il Confronto degli Strumenti / 8.4：
Tailor / 8.4.1：
Problemi Aperti / 8.5：
Dimensioni e Metriche / 9.1：
Identificazione degli oggetti / 9.2：
Identificazione degli Oggetti XML / 9.2.1：
Identificazione degli Oggetti nel Personal Information Management / 9.2.2：
Record Linkage e Privacy / 9.2.3：
Integrazione dei Dati / 9.3：
Elaborazione delle Interrogazioni Trust-Aware nei Contesti P2P / 9.3.1：
Elaborazione delle Interrogazioni Guidata dai Costi / 9.3.2：
Metodologie / 9.4：
Conclusioni / 9.5：
Riferimenti bibliografici
Indice analitico
Introduzione alla Qualità dei Dati / 1：
Perché la Qualità dei Dati è Importante / 1.1：
Introduzione alla Nozione di Qualità dei Dati / 1.2：
98.

電子ブック
ＥＢ
98. A Theory of Shape Identification
Frédéric Cao, José-Luis Lisani, Jean-Michel Morel, Pablo Musé, Frédéric Sur, F. Takens, édéric Sur
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
A Single Principle / 1.1：
Shape Invariants and Consequences / 1.2：
Shape Distortions / 1.2.1：
General Overview / 1.3：
Extraction of Shape Elements / 1.3.1：
Shape Element Encoding / 1.3.2：
Recognition of Shape Elements / 1.3.3：
Grouping / 1.3.4：
Algorithm Synopsis / 1.3.5：
Extracting Image boundaries / Part I：
Extracting Meaningful Curves from Images / 2：
The Level Lines Tree, or Topographic Map / 2.1：
Matas et al. Maximally Stable Extremal Regions (MSER) / 2.2：
Meaningful Boundaries / 2.3：
Contrasted Boundaries / 2.3.1：
Maximal Boundaries / 2.3.2：
A Mathematical Justification of Meaningful Contrasted Boundaries / 2.4：
Interpretation of the Number of False Alarms / 2.4.1：
Multiscale Meaningful Boundaries / 2.5：
Adapting Boundary Detection to Local Contrast / 2.6：
Local Contrast / 2.6.1：
Experiments on Locally Contrasted Boundaries / 2.6.2：
Bibliographic Notes / 2.7：
Edge Detection / 2.7.1：
Meaningful Boundaries vs. Haralick's Detector / 2.7.2：
Level Lines and Shapes / 2.7.3：
Tree of Shapes, FLST, and MSER / 2.7.4：
Extracting Shapes from Images / 2.7.5：
Level Line Invariant Descriptors / Part II：
Robust Shape Directions / 3：
Flat Parts of Level Lines / 3.1：
Flat Parts Detection Algorithm / 3.1.1：
Reduction to a Parameterless Method / 3.1.2：
The Algorithm / 3.1.3：
Some Properties of the Detected Flat Parts / 3.1.4：
Experiments / 3.2：
Experimental Validation of the Flat Part Algorithm / 3.2.1：
Flat Parts Correspond to Salient Features / 3.2.2：
Curve Smoothing and the Reduction of the Number of Bitangent Lines / 3.3：
Detecting Flat Parts in Curves / 3.4：
Scale-Space and Curve Smoothing / 3.4.2：
Invariant Level Line Encoding / 4：
Global Normalization and Encoding / 4.1：
Global Affine Normalization / 4.1.1：
Application to the MSER Normalization Method / 4.1.2：
Geometric Global Normalization Methods / 4.1.3：
Semi-Local Normalization and Encoding / 4.2：
Similarity Invariant Normalization and Encoding Algorithm / 4.2.1：
Affine Invariant Normalization and Encoding Algorithm / 4.2.2：
Typical Number of LLDs in Images / 4.2.3：
Geometric Invariance and Shape Recognition / 4.3：
Global Features and Global Normalization / 4.3.2：
Local and Semi-Local Features / 4.3.3：
Recognizing Level Lines / Part III：
A Contrario Decision: the LLD Method / 5：
A Contrario Models / 5.1：
Shape Model or Background Model? / 5.1.1：
Detection Terminology / 5.1.2：
The Background Model / 5.2：
Deriving Statistically Independent Features from Level Lines / 5.2.1：
Testing the Background Model / 5.3：
Shape Distances / 5.4：
A Contrario Methods / 5.4.2：
Meaningful Matches: Experiments on LLD and MSER / 6：
Semi-Local Meaningful Matches / 6.1：
A Toy Example / 6.1.1：
Perspective Distortion / 6.1.2：
A More Difficult Problem / 6.1.3：
Slightly Meaningful Matches between Unrelated Images / 6.1.4：
Camera Blur / 6.1.5：
Recognition Relative to Context / 6.2：
Testing A Contrario MSER (Global Normalization) / 6.3：
Global Affine Invariant Recognition. A Toy Example / 6.3.1：
Comparing Similarity and Affine Invariant Global Recognition Methods / 6.3.2：
Global Matches of Non-Locally Encoded LLDs / 6.3.3：
Grouping Shape Elements / Part IV：
Hierarchical Clustering and Validity Assessment / 7：
Clustering Analysis / 7.1：
A Contrario Cluster Validity / 7.2：
Meaningful Groups / 7.2.1：
Optimal Merging Criteria / 7.3：
Local Merging Criterion / 7.3.1：
Computational Issues / 7.4：
Choosing Test Regions / 7.4.1：
Indivisibility and Maximality / 7.4.2：
Experimental Validation: Object Grouping Based on Elementary Features / 7.5：
Segments / 7.5.1：
DNA Image / 7.5.2：
Grouping Spatially Coherent Meaningful Matches / 7.6：
Why Spatial Coherence Detection? / 8.1：
Describing Transformations / 8.2：
The Similarity Case / 8.2.1：
The Affine Transformation Case / 8.2.2：
Meaningful Transformation Clusters / 8.3：
Measuring Transformation Dissimilarity / 8.3.1：
Background Model: the Similarity Case / 8.3.2：
Experimental Results / 8.4：
Visualizing the Results / 9.1：
Multiple Occurrences of a Logo / 9.2：
Valbonne Church / 9.2.2：
Tramway / 9.2.3：
Occlusions / 9.3：
Stroboscopic Effect / 9.4：
The SIFT Method / Part V：
A Short Guide to SIFT Encoding / 10：
Scale-Space Extrema / 10.1.1：
Accurate Key Point Detection / 10.1.2：
Orientation Assignment / 10.1.3：
Local Image Descriptor / 10.1.4：
SIFT Descriptor Matching / 10.1.5：
Shape Element Stability versus SIFT Stability / 10.2：
An Experimental Protocol / 10.2.1：
Some Conclusions Concerning Stability / 10.2.2：
SIFT Descriptors Matching versus LLD A Contrario Matching / 10.3：
Measuring Matching Performance / 10.3.1：
Conclusion / 10.3.2：
Interest Points of an Image / 10.5：
Local Descriptors / 10.5.2：
Matching and Grouping / 10.5.3：
Securing SIFT with A Contrario Techniques / 11：
A Contrario Clustering of SIFT Matches / 11.1：
Using a Background Model for SIFT / 11.2：
Meaningful SIFT Matching / 11.3：
Normalization / 11.3.1：
Matching / 11.3.2：
Choosing Sample Points / 11.3.3：
The Detection Algorithm / 11.4：
Experiments: Securing SIFT Detections / 11.4.1：
Keynotes / 11.5：
Cluster Analysis Reader's Digest / A.1：
Partitional Clustering Methods / A.1.1：
Iterative Methods for Partitional Clustering / A.1.2：
Hierarchical Clustering Methods / A.1.3：
Cluster Validity Analysis and Stopping Rules / A.1.4：
Three classical methods for object detection based on spatial coherence / A.2：
The Generalized Hough Transform / A.2.1：
Geometric Hashing / A.2.2：
A RANSAC-based Approach / A.2.3：
On the Negative Association of Multinomial Distributions / A.3：
Algorithms / B：
LLD Method Summary / B.1：
Improved MSER Method Summary / B.2：
Improved SIFT Method Summary / B.3：
References
Index
Introduction / 1：
A Single Principle / 1.1：
Shape Invariants and Consequences / 1.2：
99.

電子ブック
ＥＢ
99. Introduction to Empirical Processes and Semiparametric Inference
Michael R. Kosorok
出版情報: SpringerLink Books - AutoHoldings , Springer, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Overview / I：
Introduction / 1：
An Overview of Empirical Processes / 2：
The Main Features / 2.1：
Empirical Process Techniques / 2.2：
Stochastic Convergence / 2.2.1：
Entropy for Glivenko-Cantelli and Donsker Theorems / 2.2.2：
Bootstrapping Empirical Processes / 2.2.3：
The Functional Delta Method / 2.2.4：
Z-Estimators / 2.2.5：
M-Estimators / 2.2.6：
Other Topics / 2.3：
Exercises / 2.4：
Notes / 2.5：
Overview of Semiparametric Inference / 3：
Semiparametric Models and Efficiency / 3.1：
Score Functions and Estimating Equations / 3.2：
Maximum Likelihood Estimation / 3.3：
Case Studies I / 3.4：
Linear Regression / 4.1：
Mean Zero Residuals / 4.1.1：
Median Zero Residuals / 4.1.2：
Counting Process Regression / 4.2：
The General Case / 4.2.1：
The Cox Model / 4.2.2：
The Kaplan-Meier Estimator / 4.3：
Efficient Estimating Equations for Regression / 4.4：
Simple Linear Regression / 4.4.1：
A Poisson Mixture Regression Model / 4.4.2：
Partly Linear Logistic Regression / 4.5：
Empirical Processes / 4.6：
Introduction to Empirical Processes / 5：
Preliminaries for Empirical Processes / 6：
Metric Spaces / 6.1：
Outer Expectation / 6.2：
Linear Operators and Functional Differentiation / 6.3：
Proofs / 6.4：
Stochastic Processes in Metric Spaces / 6.5：
Weak Convergence / 7.2：
General Theory / 7.2.1：
Spaces of Bounded Functions / 7.2.2：
Other Modes of Convergence / 7.3：
Empirical Process Methods / 7.4：
Maximal Inequalities / 8.1：
Orlicz Norms and Maxima / 8.1.1：
Maximal Inequalities for Processes / 8.1.2：
The Symmetrization Inequality and Measurability / 8.2：
Glivenko-Cantelli Results / 8.3：
Donsker Results / 8.4：
Entropy Calculations / 8.5：
Uniform Entropy / 9.1：
VC-Classes / 9.1.1：
BUEI Classes / 9.1.2：
Bracketing Entropy / 9.2：
Glivenko-Cantelli Preservation / 9.3：
Donsker Preservation / 9.4：
The Bootstrap for Donsker Classes / 9.5：
An Unconditional Multiplier Central Limit Theorem / 10.1.1：
Conditional Multiplier Central Limit Theorems / 10.1.2：
Bootstrap Central Limit Theorems / 10.1.3：
Continuous Mapping Results / 10.1.4：
The Bootstrap for Glivenko-Cantelli Classes / 10.2：
A Simple Z-Estimator Master Theorem / 10.3：
Additional Empirical Process Results / 10.4：
Bounding Moments and Tail Probabilities / 11.1：
Sequences of Functions / 11.2：
Contiguous Alternatives / 11.3：
Sums of Independent but not Identically Distributed Stochastic Processes / 11.4：
Central Limit Theorems / 11.4.1：
Bootstrap Results / 11.4.2：
Function Classes Changing with n / 11.5：
Dependent Observations / 11.6：
Main Results and Proofs / 11.7：
Examples / 12.2：
Composition / 12.2.1：
Integration / 12.2.2：
Product Integration / 12.2.3：
Inversion / 12.2.4：
Other Mappings / 12.2.5：
Consistency / 12.3：
The General Setting / 13.2：
Using Donsker Classes / 13.2.2：
A Master Theorem and the Bootstrap / 13.2.3：
Using the Delta Method / 13.3：
The Argmax Theorem / 13.4：
Rate of Convergence / 14.2：
Regular Euclidean M-Estimators / 14.4：
Non-Regular Examples / 14.5：
A Change-Point Model / 14.5.1：
Monotone Density Estimation / 14.5.2：
Case Studies II / 14.6：
Partly Linear Logistic Regression Revisited / 15.1：
The Two-Parameter Cox Score Process / 15.2：
The Proportional Odds Model Under Right Censoring / 15.3：
Nonparametric Maximum Likelihood Estimation / 15.3.1：
Existence / 15.3.2：
Score and Information Operators / 15.3.3：
Weak Convergence and Bootstrap Validity / 15.3.5：
Testing for a Change-point / 15.4：
Large p Small n Asymptotics for Microarrays / 15.5：
Assessing P-Value Approximations / 15.5.1：
Consistency of Marginal Empirical Distribution Functions / 15.5.2：
Inference for Marginal Sample Means / 15.5.3：
Semiparametric Inference / 15.6：
Introduction to Semiparametric Inference / 16：
Preliminaries for Semiparametric Inference / 17：
Projections / 17.1：
Hilbert Spaces / 17.2：
More on Banach Spaces / 17.3：
Tangent Sets and Regularity / 17.4：
Efficiency / 18.2：
Optimality of Tests / 18.3：
Efficient Inference for Finite-Dimensional Parameters / 18.4：
Efficient Score Equations / 19.1：
Profile Likelihood and Least-Favorable Submodels / 19.2：
The Cox Model for Right Censored Data / 19.2.1：
The Proportional Odds Model for Right Censored Data / 19.2.2：
The Cox Model for Current Status Data / 19.2.3：
Inference / 19.2.4：
Quadratic Expansion of the Profile Likelihood / 19.3.1：
The Profile Sampler / 19.3.2：
The Penalized Profile Sampler / 19.3.3：
Other Methods / 19.3.4：
Efficient Inference for Infinite-Dimensional Parameters / 19.4：
Semiparametric Maximum Likelihood Estimation / 20.1：
Weighted and Nonparametric Bootstraps / 20.2：
The Piggyback Bootstrap / 20.2.2：
Semiparametric M-Estimation / 20.2.3：
Semiparametric M-estimators / 21.1：
Motivating Examples / 21.1.1：
General Scheme for Semiparametric M-Estimators / 21.1.2：
Consistency and Rate of Convergence / 21.1.3：
[radical]n Consistency and Asymptotic Normality / 21.1.4：
Weighted M-Estimators and the Weighted Bootstrap / 21.2：
Entropy Control / 21.3：
Examples Continued / 21.4：
Cox Model with Current Status Data (Example 1, Continued) / 21.4.1：
Binary Regression Under Misspecified Link Function (Example 2, Continued) / 21.4.2：
Mixture Models (Example 3, Continued) / 21.4.3：
Penalized M-estimation / 21.5：
Two Other Examples / 21.5.1：
Case Studies III / 21.6：
The Proportional Odds Model Under Right Censoring Revisited / 22.1：
Efficient Linear Regression / 22.2：
Temporal Process Regression / 22.3：
A Partly Linear Model for Repeated Measures / 22.4：
References / 22.5：
Author Index
List of symbols
Subject Index
Preface
Overview / I：
Introduction / 1：
100.

電子ブック
ＥＢ
100. Qualità dei Dati
Carlo Batini, Paolo Ancilotti, Monica Scannapieco
出版情報: SpringerLink Books - AutoHoldings , Springer Milan, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduzione alla Qualità dei Dati / 1：
Perché la Qualità dei Dati è Importante / 1.1：
Introduzione alla Nozione di Qualità dei Dati / 1.2：
Qualità dei Dati e Tipi di Dati / 1.3：
Qualità dei Dati e Tipi di Sistema Informativo / 1.4：
Principali Problemi di Ricerca e Domini Applicativi della Qualità dei Dati / 1.5：
Problemi della Ricerca nel Campo della Qualità dei Dati / 1.5.1：
Domini Applicativi della Qualitaà dei Dati / 1.5.2：
Aree di Ricerca Legate alla Qualità dei Dati / 1.5.3：
Sommario / 1.6：
Dimensioni della Qualità dei Dati / 2：
Accuratezza / 2.1：
Completezza / 2.2：
Completezza dei Dati Relazionali / 2.2.1：
Completezza dei Dati Web / 2.2.2：
Dimensioni temporali: Aggiornamento, Tempestività e Volatilità / 2.3：
Consistenza / 2.4：
Vincoli di Integrità / 2.4.1：
Data Edit / 2.4.2：
Altre Dimensioni della Qualità dei Dati / 2.5：
Accessibilità / 2.5.1：
Qualità delle Sorgenti Informative / 2.5.2：
Approcci alla Definizione delle Dimensioni di Qualità dei Dati / 2.6：
Approccio Teorico / 2.6.1：
Approccio empirico / 2.6.2：
Approccio Intuitivo / 2.6.3：
Analisi Comparativa delle Definizioni delle Dimensioni / 2.6.4：
Trade-off Tra Dimensioni / 2.6.5：
Dimensioni di Qualità dello Schema / 2.7：
Leggibilità / 2.7.1：
Normalizzazione / 2.7.2：
Modelli per la Qualità dei Dati / 2.8：
Introduzione / 3.1：
Estensioni dei Modelli dei Dati Strutturati / 3.2：
Modelli Concettuali / 3.2.1：
Modelli Logici per la Descrizione dei Dati / 3.2.2：
Il Modello Polygen per la Manipolazione dei Dati / 3.2.3：
Provenance dei Dati / 3.2.4：
Estensione dei Modelli per Dati Semistrutturati / 3.3：
Modelli per i Sistemi Informativi Gestionali / 3.4：
Modelli per la Descrizione dei Processi: il modello IP-MAP / 3.4.1：
Estensioni di IP-MAP / 3.4.2：
Modelli per i Dati / 3.4.3：
Attività e Tecniche Inerenti la Qualità dei Dati: Generalità / 3.5：
Attività Inerenti la Qualità dei Dati / 4.1：
Composizione della Qualità / 4.2：
Modelli e Assunzioni / 4.2.1：
Dimensioni / 4.2.2：
Localizzazione e Correzione degli Errori / 4.2.3：
Localizzare e Correggere le Inconsistenze / 4.3.1：
Dati Incompleti / 4.3.2：
Scoperta dei Valori Anomali / 4.3.3：
Classificazioni dei Costi e dei Benefici / 4.4：
Classificazioni dei Costi / 4.4.1：
Classificazione dei Benefici / 4.4.2：
Identificazione degli Oggetti / 4.5：
Cenni Storici / 5.1：
Identificazione degli Oggetti per le Diverse Tipologie di Dati / 5.2：
Il Processo di Identificazione degli Oggetti ad Alto Livello / 5.3：
Dettagli sui Passi dell'Identificazione degli Oggetti / 5.4：
Preprocessing / 5.4.1：
Riduzione dello Spazio di Ricerca / 5.4.2：
Funzioni di Confronto / 5.4.3：
Tecniche di Identificazione degli Oggetti / 5.5：
Tecniche Probabilistiche / 5.6：
La Teoria di Fellegi e Sunter e sue Estensioni / 5.6.1：
Una Tecnica Probabilistica Basata sui Costi / 5.6.2：
Tecniche empiriche / 5.7：
Metodo del Sorted Neighborhood e sue Estensioni / 5.7.1：
L'Algoritmo a Coda di Priorità / 5.7.2：
Una Tecnica per Dati Strutturati Complessi: Delphi / 5.7.3：
Scoperta dei Duplicati XML: DogmatiX / 5.7.4：
Altri Metodi Empirici / 5.7.5：
Tecniche Basate sulla Conoscenza / 5.8：
Un Approccio Basato su Regole: Intelliclean / 5.8.1：
Metodi di Apprendimento per le Regole di Decisione: Atlas / 5.8.2：
Confronto delle Tecniche / 5.9：
Metriche / 5.9.1：
Metodi di Riduzione dello Spazio di Ricerca / 5.9.2：
Metodi Decisionali / 5.9.3：
Risultati / 5.9.5：
Problemi Inerenti la Qualità dei Dati nei Sistemi di Integrazione dei Dati / 5.10：
Generalità sui Sistemi di Integrazione dei Dati / 6.1：
Elaborazione delle Interrogazioni / 6.2.1：
Tecniche per l'Elaborazione delle Interrogazioni Guidata dalla Qualità / 6.3：
Il QP-alg: Pianificazione delle Interrogazioni Guidata dalla Qualità / 6.3.1：
Elaborazione delle Interrogazioni in DaQuinCIS / 6.3.2：
Elaborazione dell'Interrogazione con Fusionplex / 6.3.3：
Confronto tra le Tecniche di Elaborazione dell'Interrogazione Guidata dalla Qualitaà / 6.3.4：
Risoluzione dei Conflitti a Livello di Istanza / 6.4：
Classificazione dei Conflitti a Livello di Istanza / 6.4.1：
Panoramica delle Tecniche / 6.4.2：
Confronto tra le Tecniche di Risoluzione dei Conflitti a Livello di Istanza / 6.4.3：
Gestione delle Inconsistenze nell'Integrazione dei Dati: una Prospettiva Teorica / 6.5：
Un Framework Formale per l'Integrazione dei Dati / 6.5.1：
Il Problema dell'Inconsistenza / 6.5.2：
Metodologie per la Misurazione e il Miglioramento della Qualità dei Dati / 6.6：
Fondamenti delle Metodologie per la Qualità dei Dati / 7.1：
Input e output / 7.1.1：
Classificazione delle Metodologie / 7.1.2：
Confronto tra Strategie Guidate dai Dati e Strategie Guidate dai Processi / 7.1.3：
Metodologie per la Valutazione / 7.2：
Analisi Comparativa Delle Metodologie per Scopi Generali / 7.3：
Fasi Fondamentali Comuni tra le Metodologie / 7.3.1：
La Metodologia TDQM / 7.3.2：
La Metodologia TQdM / 7.3.3：
La Metodologia Istat / 7.3.4：
Confronto delle Metodologie / 7.3.5：
La Metodologia CDQM / 7.4：
Ricostruire lo Stato dei Dati / 7.4.1：
Ricostruire i Processi Aziendali / 7.4.2：
Ricostruire Macroprocessi e Regole / 7.4.3：
Verificare i Problemi con gli Utenti / 7.4.4：
Misurare la Qualitaà dei Dati / 7.4.5：
Fissare Nuovi Livelli Target della QD / 7.4.6：
Scegliere le Attività di Miglioramento / 7.4.7：
Scegliere le Tecniche per le Attività dei Dati / 7.4.8：
Individuare i Processi di Miglioramento / 7.4.9：
Scegliere il Processo di Miglioramento Ottimale / 7.4.10：
Lo Studio di un Caso per l'Area e-Government / 7.5：
Strumenti per la Qualità dei Dati / 7.6：
Strumenti / 8.1：
Potter's Wheel / 8.2.1：
Telcordia / 8.2.2：
Ajax / 8.2.3：
Arktos / 8.2.4：
Choice Maker / 8.2.5：
Framework per Sistemi Informativi Cooperativi / 8.3：
Framework DaQuinCIS / 8.3.1：
Framework FusionPlex / 8.3.2：
Toolbox per il Confronto degli Strumenti / 8.4：
Tailor / 8.4.1：
Problemi Aperti / 8.5：
Dimensioni e Metriche / 9.1：
Identificazione degli oggetti / 9.2：
Identificazione degli Oggetti XML / 9.2.1：
Identificazione degli Oggetti nel Personal Information Management / 9.2.2：
Record Linkage e Privacy / 9.2.3：
Integrazione dei Dati / 9.3：
Elaborazione delle Interrogazioni Trust-Aware nei Contesti P2P / 9.3.1：
Elaborazione delle Interrogazioni Guidata dai Costi / 9.3.2：
Metodologie / 9.4：
Conclusioni / 9.5：
Riferimenti bibliografici
Indice analitico
Introduzione alla Qualità dei Dati / 1：
Perché la Qualità dei Dati è Importante / 1.1：
Introduzione alla Nozione di Qualità dei Dati / 1.2：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼