close
1.

電子ブック
ＥＢ
1. A Tiny Handbook of R
Mike Allerhand
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction to R / 1：
Why Command Lines and Scripts? / 1.1：
The R Console / 1.1.1：
Variables / 1.1.2：
Functions / 1.1.3：
Finding Functions and Getting Help / 1.2：
Libraries / 1.2.1：
Packages / 1.2.2：
Finding Functions / 1.2.3：
Getting Help / 1.2.4：
R Projects / 1.3：
Saving Your Session / 1.3.1：
Scripts / 1.3.2：
Data Structures / 2：
Vectors, Matrices, and Arrays / 2.1：
Data Frames and Lists / 2.1.2：
Creating Data / 2.1.3：
Sampling Data / 2.1.4：
Reading Data / 2.1.5：
Operations on Vectors and Matrices / 2.2：
Arithmetic Functions / 2.2.1：
Descriptive Functions / 2.2.2：
Operators and Expressions / 2.2.3：
Factors / 2.3：
Making Factors / 2.3.1：
Operations on Factors / 2.3.2：
Re-ordering and Re-labelling / 2.3.3：
Indexing / 2.4：
Indexing by Name / 2.4.1：
Indexing by Number / 2.4.2：
Inserting and Deleting Rows or Columns / 2.4.3：
Indexing with Factors / 2.4.4：
Conditional Indexing / 2.4.5：
Sorting / 2.4.6：
Reshaping / 2.5：
Stacking and Unstacking? / 2.5.1：
Reshaping: Wide and Long / 2.5.2：
Merging / 2.5.3：
Missing Values / 2.6：
Recoding Missing Values / 2.6.1：
Operations with Missing Values / 2.6.2：
Counting and Sorting Missing Values / 2.6.3：
Handling Missing Values / 2.6.4：
Mapping Functions / 2.7：
Repeated Evaluation / 2.7.1：
Applying Functions / 2.7.2：
Writing Functions / 2.8：
Anonymous Functions / 2.8.1：
Optional Arguments / 2.8.2：
Tables and Graphs / 3：
Tables / 3.1：
Frequency Tables / 3.1.1：
Tables of Cell Means and Other Summaries / 3.1.2：
Saving Tables / 3.1.3：
Graphs / 3.2：
Base Graphics / 3.2.1：
Lattice Graphics / 3.2.2：
Multiple Plot Layout / 3.2.3：
Saving Graphics / 3.2.4：
Hypothesis Tests / 4：
Probability Distributions / 4.1：
How to Run a t test / 4.2：
Linear Models / 5：
Model Formulas / 5.1：
Formula and Data Frame / 5.1.1：
Updating Model Fits / 5.1.2：
General Linear Models / 5.2：
Regression Diagnostics / 5.2.1：
Testing the Regression Coefficients / 5.2.2：
Prediction / 5.2.3：
Stepwise Regression / 5.2.4：
Extracting Information from the Fit Object / 5.2.5：
Residualizing / 5.2.6：
ANOVA / 5.3：
ANOVA Tables / 5.3.1：
Comparisons / 5.3.2：
Learning R / 5.4：
Index
Introduction to R / 1：
Why Command Lines and Scripts? / 1.1：
The R Console / 1.1.1：
2.

電子ブック
ＥＢ
2. 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：
3.

電子ブック
ＥＢ
3. 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：
4.

電子ブック
ＥＢ
4. 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：
5.

電子ブック
ＥＢ
5. 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：
6.

電子ブック
ＥＢ
6. 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：
7.

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

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

電子ブック
ＥＢ
9. 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：
10.

電子ブック
ＥＢ
10. Electron Microscopical Investigation of Interdiffusion and Phase Formation at Gd2O3/CeO2- and Sm2O3/CeO2-Interfaces
Christian Rockenhäuser
出版情報: SpringerLink Books - AutoHoldings , Springer Fachmedien Wiesbaden, 2015
所蔵情報: loading…
11.

電子ブック
ＥＢ
11. 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：
12.

電子ブック
ＥＢ
12. 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：
13.

電子ブック
ＥＢ
13. E-Librarian Service
Serge Linckels, Christoph Meinel
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction to E-Librarian Services / 1：
From Ancient to Digital Libraries / 1.1：
From Searching to Finding / 1.2：
Searching the Web / 1.2.1：
Searching Multimedia Knowledge Bases / 1.2.2：
Exploratory Search / 1.2.3：
E-Librarian Services / 1.3：
Overview / 1.3.1：
Early Question-Answering Systems / 1.3.2：
Natural Language Interface / 1.3.3：
No Library without a Librarian / 1.3.4：
Characteristics of an E-Librarian Service / 1.3.5：
Overview and Organization of the Book / 1.4：
Key Technologies of E-Librarian Services / Part I：
Semantic Web and Ontologies / 2：
What is the Semantic Web? / 2.1：
The Vision of the Semantic Web / 2.1.1：
Semantic Web vs. Web N.O / 2.1.2：
Three Principles Ruling the Semantic Web / 2.1.3：
Architecture / 2.1.4：
Ontologies / 2.2：
Ontology Structure / 2.2.1：
Upper and Domain Ontologies / 2.2.2：
Linked Data / 2.2.3：
Expressivity of Ontologies / 2.2.4：
XML Extensible Markup Language / 2.3：
XML: Elements, Attributes and Values / 2.3.1：
Namespaces and Qualified Names / 2.3.2：
XML Schema / 2.3.3：
Complete Example / 2.3.4：
Limitations of XML / 2.3.5：
RDF-Resource Description Framework / 2.4：
RDF Triples and Serialization / 2.4.1：
RDF Schema / 2.4.2：
Limitations of RDF / 2.4.3：
Owl 1 and Owl 2 - Web Ontology Language / 2.5：
Instances, Classes and Restrictions in Owl / 2.5.1：
From Owl 1 to Owl 2 / 2.5.2：
Sparql, the Query Language / 2.5.4：
Description Logics and Reasoning / 3：
DL- Description Logics / 3.1：
Concept Descriptions / 3.1.1：
DL Languages / 3.1.2：
Equivalences between OWL and DL / 3.1.3：
DL Knowledge Base / 3.2：
Terminologies (TBox) / 3.2.1：
World Descriptions (ABox) / 3.2.2：
Interpretations / 3.3：
Interpreting Individuals, Concepts, and Roles / 3.3.1：
Modeling the Real World / 3.3.2：
Inferences / 3.4：
Standard Inferences / 3.4.1：
Non-Standard Inferences / 3.4.2：
Natural Language Processing / 4：
Overview and Challenges / 4.1：
Syntax, Semantics and Pragmatics / 4.1.1：
Difficulties of NLP / 4.1.2：
Zipf's law / 4.1.3：
Dealing with Single Words / 4.2：
Tokenization and Tagging / 4.2.1：
Morphology / 4.2.2：
Building Words over an Alphabet / 4.2.3：
Operations over Words / 4.2.4：
Semantic Knowledge Sources / 4.3：
Semantic relations / 4.3.1：
Semantic resources / 4.3.2：
Dealing with Sentences / 4.4：
Phrase Types / 4.4.1：
Phrase Structure / 4.4.2：
Grammar / 4.4.3：
Formal languages / 4.4.4：
Phrase structure ambiguities / 4.4.5：
Alternative parsing techniques / 4.4.6：
Multi-Language / 4.5：
Semantic Interpretation / 4.6：
Information Retrieval / 5：
Retrieval Process / 5.1：
Document Indexation and Weighting / 5.2：
Index of terms / 5.2.1：
Weighting / 5.2.2：
Retrieval Models / 5.3：
Boolean Model / 5.3.1：
Vector Model / 5.3.2：
Probabilistic Model / 5.3.3：
Page Rank / 5.3.4：
Semantic Distance / 5.3.5：
Other Models / 5.3.6：
Retrieval Evaluation / 5.4：
Precision, Recall, and Accuracy / 5.4.1：
Design and Utilization of E-Librarian Services / Part II：
Ontological Approach / 6：
Expert Systems / 6.1：
Classical Expert Systems / 6.1.1：
Ontology-Driven Expert Systems / 6.1.2：
Towards an E-Librarian Service / 6.2：
Reasoning Capabilities of an E-Librarian Service / 6.2.1：
Deploying an Ontology / 6.2.2：
Designing the Ontological Background / 6.2.3：
Semantic Annotation of the Knowledge Base / 6.3：
Computer-Assisted Creation of metadata / 6.3.1：
Automatic Generation of metadata / 6.3.2：
Design of the Natural Language Processing Module / 7：
Overview of the Semantic Interpretation / 7.1：
Logical Form / 7.1.1：
Processing of a User Question / 7.1.2：
NLP Pre-Processing / 7.2：
Domain Language / 7.2.1：
Lemmatization / 7.2.2：
Handling Spelling Errors / 7.2.3：
Ontology Mapping / 7.3：
Domain Dictionary / 7.3.1：
Mapping of Words / 7.3.2：
Resolving Ambiguities / 7.3.3：
Generation of a DL-Concept Description / 7.4：
Without Syntactic Analysis / 7.4.1：
With Syntactic Analysis / 7.4.2：
How much NLP is Sufficient? / 7.4.3：
Optimization and Normal Form / 7.4.4：
General Limitations and Constraints / 7.5：
Role Quantifiers / 7.5.1：
Conjunction and Disjunction / 7.5.2：
Negation / 7.5.3：
Open-Ended and Closed-Ended Questions / 7.5.4：
Formulations / 7.5.5：
Others / 7.5.6：
Multiple-Language Feature / 7.6：
Designing the Multimedia Information Retrieval Module / 8：
Overview of the MIR Module / 8.1：
Knowledge Base and metadata / 8.1.1：
Retrieval Principle / 8.1.2：
The Concept Covering Problem / 8.1.3：
Identifying Covers / 8.2：
Computing the Best Covers / 8.3：
Miss and Rest / 8.3.1：
Size of a Concept Description / 8.3.2：
Best Covers / 8.3.3：
Ranking / 8.4：
Algorithm for the Retrieval Problem / 8.5：
User Feedback / 8.6：
Direct User Feedback / 8.6.1：
Collaborative Tagging and Social Networks / 8.6.2：
Diversification of User Feedback / 8.6.3：
Implementation / 9：
Knowledge Layer / 9.1：
Inference Layer / 9.1.2：
Communication Layer / 9.1.3：
Presentation Layer / 9.1.4：
Development Details / 9.2：
Processing Owl and DL in Java / 9.2.1：
Client Front-End with Ajax Autocompleter / 9.2.2：
The Soap Web Service Interface / 9.2.3：
Applications / Part III：
Best practices / 10：
Computer History Expert System (CHESt) / 10.1：
Description / 10.1.1：
Experiment / 10.1.2：
Mathematics Expert System (MatES) / 10.2：
Benchmark Test / 10.2.1：
The Lecture Butler's E-Librarian Service / 10.2.3：
Benchmark Tests / 10.3.1：
Appendix / Part IV：
XML Schema Primitive Datatypes / A：
Reasoning Algorithms / B：
Structural Subsumption / B.1：
Example 1 / B.2.1：
Example 2 / B.2.2：
Brown Tag Set / C：
Part-of-Speech Taggers and Parsers / D：
POS Taggers / D.1：
Parsers / D.2：
Probabilistic IR Model / E：
Probability Theory / E.1：
References / E.2：
Index
Introduction to E-Librarian Services / 1：
From Ancient to Digital Libraries / 1.1：
From Searching to Finding / 1.2：
14.

電子ブック
ＥＢ
14. E-Librarian Service
Serge Linckels, Christoph Meinel
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction to E-Librarian Services / 1：
From Ancient to Digital Libraries / 1.1：
From Searching to Finding / 1.2：
Searching the Web / 1.2.1：
Searching Multimedia Knowledge Bases / 1.2.2：
Exploratory Search / 1.2.3：
E-Librarian Services / 1.3：
Overview / 1.3.1：
Early Question-Answering Systems / 1.3.2：
Natural Language Interface / 1.3.3：
No Library without a Librarian / 1.3.4：
Characteristics of an E-Librarian Service / 1.3.5：
Overview and Organization of the Book / 1.4：
Key Technologies of E-Librarian Services / Part I：
Semantic Web and Ontologies / 2：
What is the Semantic Web? / 2.1：
The Vision of the Semantic Web / 2.1.1：
Semantic Web vs. Web N.O / 2.1.2：
Three Principles Ruling the Semantic Web / 2.1.3：
Architecture / 2.1.4：
Ontologies / 2.2：
Ontology Structure / 2.2.1：
Upper and Domain Ontologies / 2.2.2：
Linked Data / 2.2.3：
Expressivity of Ontologies / 2.2.4：
XML Extensible Markup Language / 2.3：
XML: Elements, Attributes and Values / 2.3.1：
Namespaces and Qualified Names / 2.3.2：
XML Schema / 2.3.3：
Complete Example / 2.3.4：
Limitations of XML / 2.3.5：
RDF-Resource Description Framework / 2.4：
RDF Triples and Serialization / 2.4.1：
RDF Schema / 2.4.2：
Limitations of RDF / 2.4.3：
Owl 1 and Owl 2 - Web Ontology Language / 2.5：
Instances, Classes and Restrictions in Owl / 2.5.1：
From Owl 1 to Owl 2 / 2.5.2：
Sparql, the Query Language / 2.5.4：
Description Logics and Reasoning / 3：
DL- Description Logics / 3.1：
Concept Descriptions / 3.1.1：
DL Languages / 3.1.2：
Equivalences between OWL and DL / 3.1.3：
DL Knowledge Base / 3.2：
Terminologies (TBox) / 3.2.1：
World Descriptions (ABox) / 3.2.2：
Interpretations / 3.3：
Interpreting Individuals, Concepts, and Roles / 3.3.1：
Modeling the Real World / 3.3.2：
Inferences / 3.4：
Standard Inferences / 3.4.1：
Non-Standard Inferences / 3.4.2：
Natural Language Processing / 4：
Overview and Challenges / 4.1：
Syntax, Semantics and Pragmatics / 4.1.1：
Difficulties of NLP / 4.1.2：
Zipf's law / 4.1.3：
Dealing with Single Words / 4.2：
Tokenization and Tagging / 4.2.1：
Morphology / 4.2.2：
Building Words over an Alphabet / 4.2.3：
Operations over Words / 4.2.4：
Semantic Knowledge Sources / 4.3：
Semantic relations / 4.3.1：
Semantic resources / 4.3.2：
Dealing with Sentences / 4.4：
Phrase Types / 4.4.1：
Phrase Structure / 4.4.2：
Grammar / 4.4.3：
Formal languages / 4.4.4：
Phrase structure ambiguities / 4.4.5：
Alternative parsing techniques / 4.4.6：
Multi-Language / 4.5：
Semantic Interpretation / 4.6：
Information Retrieval / 5：
Retrieval Process / 5.1：
Document Indexation and Weighting / 5.2：
Index of terms / 5.2.1：
Weighting / 5.2.2：
Retrieval Models / 5.3：
Boolean Model / 5.3.1：
Vector Model / 5.3.2：
Probabilistic Model / 5.3.3：
Page Rank / 5.3.4：
Semantic Distance / 5.3.5：
Other Models / 5.3.6：
Retrieval Evaluation / 5.4：
Precision, Recall, and Accuracy / 5.4.1：
Design and Utilization of E-Librarian Services / Part II：
Ontological Approach / 6：
Expert Systems / 6.1：
Classical Expert Systems / 6.1.1：
Ontology-Driven Expert Systems / 6.1.2：
Towards an E-Librarian Service / 6.2：
Reasoning Capabilities of an E-Librarian Service / 6.2.1：
Deploying an Ontology / 6.2.2：
Designing the Ontological Background / 6.2.3：
Semantic Annotation of the Knowledge Base / 6.3：
Computer-Assisted Creation of metadata / 6.3.1：
Automatic Generation of metadata / 6.3.2：
Design of the Natural Language Processing Module / 7：
Overview of the Semantic Interpretation / 7.1：
Logical Form / 7.1.1：
Processing of a User Question / 7.1.2：
NLP Pre-Processing / 7.2：
Domain Language / 7.2.1：
Lemmatization / 7.2.2：
Handling Spelling Errors / 7.2.3：
Ontology Mapping / 7.3：
Domain Dictionary / 7.3.1：
Mapping of Words / 7.3.2：
Resolving Ambiguities / 7.3.3：
Generation of a DL-Concept Description / 7.4：
Without Syntactic Analysis / 7.4.1：
With Syntactic Analysis / 7.4.2：
How much NLP is Sufficient? / 7.4.3：
Optimization and Normal Form / 7.4.4：
General Limitations and Constraints / 7.5：
Role Quantifiers / 7.5.1：
Conjunction and Disjunction / 7.5.2：
Negation / 7.5.3：
Open-Ended and Closed-Ended Questions / 7.5.4：
Formulations / 7.5.5：
Others / 7.5.6：
Multiple-Language Feature / 7.6：
Designing the Multimedia Information Retrieval Module / 8：
Overview of the MIR Module / 8.1：
Knowledge Base and metadata / 8.1.1：
Retrieval Principle / 8.1.2：
The Concept Covering Problem / 8.1.3：
Identifying Covers / 8.2：
Computing the Best Covers / 8.3：
Miss and Rest / 8.3.1：
Size of a Concept Description / 8.3.2：
Best Covers / 8.3.3：
Ranking / 8.4：
Algorithm for the Retrieval Problem / 8.5：
User Feedback / 8.6：
Direct User Feedback / 8.6.1：
Collaborative Tagging and Social Networks / 8.6.2：
Diversification of User Feedback / 8.6.3：
Implementation / 9：
Knowledge Layer / 9.1：
Inference Layer / 9.1.2：
Communication Layer / 9.1.3：
Presentation Layer / 9.1.4：
Development Details / 9.2：
Processing Owl and DL in Java / 9.2.1：
Client Front-End with Ajax Autocompleter / 9.2.2：
The Soap Web Service Interface / 9.2.3：
Applications / Part III：
Best practices / 10：
Computer History Expert System (CHESt) / 10.1：
Description / 10.1.1：
Experiment / 10.1.2：
Mathematics Expert System (MatES) / 10.2：
Benchmark Test / 10.2.1：
The Lecture Butler's E-Librarian Service / 10.2.3：
Benchmark Tests / 10.3.1：
Appendix / Part IV：
XML Schema Primitive Datatypes / A：
Reasoning Algorithms / B：
Structural Subsumption / B.1：
Example 1 / B.2.1：
Example 2 / B.2.2：
Brown Tag Set / C：
Part-of-Speech Taggers and Parsers / D：
POS Taggers / D.1：
Parsers / D.2：
Probabilistic IR Model / E：
Probability Theory / E.1：
References / E.2：
Index
Introduction to E-Librarian Services / 1：
From Ancient to Digital Libraries / 1.1：
From Searching to Finding / 1.2：
15.

電子ブック
ＥＢ
15. 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：
16.

電子ブック
ＥＢ
16. 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：
17.

電子ブック
ＥＢ
17. 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：
18.

電子ブック
ＥＢ
18. 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：
19.

電子ブック
ＥＢ
19. 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：
20.

電子ブック
ＥＢ
20. 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：
21.

電子ブック
ＥＢ
21. 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：
22.

電子ブック
ＥＢ
22. Combinatorial Computational Biology of RNA
Christian M. Reidys
出版情報: SpringerLink Books - AutoHoldings , Springer New York, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
RNA secondary structures / 1.1：
RNA pseudoknot structures / 1.2：
Sequence to structure maps / 1.3：
Folding / 1.4：
RNA tertiary interactions: a combinatorial perspective / 1.5：
Basic concepts / 2：
k-Noncrossing partial matchings / 2.1：
Young tableaux, RSK algorithm, and Weyl chambers / 2.1.1：
The Weyl group / 2.1.2：
From tableaux to paths and back / 2.1.3：
The generating function via the reflection principle / 2.1.4：
D-finiteness / 2.1.5：
Symbolic enumeration / 2.2：
Singularity analysis / 2.3：
Transfer theorems / 2.3.1：
The supercritical paradigm / 2.3.2：
Some ODEs / 2.4：
n-Cubes / 2.4.2：
Some basic facts / 2.5.1：
Random subgraphs of the n-cube / 2.5.2：
Vertex boundaries / 2.5.3：
Branching processes and Janson's inequality / 2.5.4：
Exercises / 2.6：
Tangled diagrams / 3：
Tangled diagrams and vacillating tableaux / 3.1：
The bijection / 3.2：
Enumeration / 3.3：
Combinatorial analysis / 4：
Cores and Shapes / 4.1：
Cores / 4.1.1：
Shapes / 4.1.2：
Generating functions / 4.2：
The GF of cores / 4.2.1：
The GF of k-noncrossing, ?-canonical structures / 4.2.2：
Asymptotics / 4.3：
k-Noncrossing structures / 4.3.1：
Canonical structures / 4.3.2：
Modular k-noncrossing structures / 4.4：
Colored shapes / 4.4.1：
The main theorem / 4.4.2：
Probabilistic Analysis / 4.5：
Uniform generation / 5.1：
Partial matchings / 5.1.1：
Central limit theorems / 5.1.2：
The central limit theorem / 5.2.1：
Arcs and stacks / 5.2.2：
Hairpin loops, interior loops, and bulges / 5.2.3：
Discrete limit laws / 5.3：
Irreducible substructures / 5.3.1：
The limit distribution of nontrivial returns / 5.3.2：
DP folding based on loop energies / 5.4：
Secondary structures / 6.1.1：
Pseudoknot structures / 6.1.2：
Combinatorial folding / 6.2：
Motifs / 6.2.1：
Skeleta / 6.2.3：
Saturation / 6.2.4：
Neutral networks / 7：
Neutral networks as random graphs / 7.1：
The giant / 7.2：
Cells / 7.2.1：
The number of vertices contained in cells / 7.2.2：
The largest component / 7.2.3：
Neutral paths / 7.3：
Connectivity / 7.4：
References / 7.5：
Index
Introduction / 1：
RNA secondary structures / 1.1：
RNA pseudoknot structures / 1.2：
23.

電子ブック
ＥＢ
23. 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：
24.

電子ブック
ＥＢ
24. 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：
25.

電子ブック
ＥＢ
25. 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：
26.

電子ブック
ＥＢ
26. 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：
27.

電子ブック
ＥＢ
27. 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：
28.

電子ブック
ＥＢ
28. ISO/IEC 8802-2:1998 ANSI/IEEE Std 802.2, 1998 edition (Incorporating ANSI/IEEE Stds 802.2c-1997, 802.2f-1997, and 802.2h-1997): IEEE International Standard for Information technology -- Telecommunications and information exchange between systems -- Local
出版情報: IEEE Electronic Library (IEL) Standards , IEEE, 1998
所蔵情報: loading…
29.

電子ブック
ＥＢ
29. 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：
30.

電子ブック
ＥＢ
30. 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：
31.

電子ブック
ＥＢ
31. Coarse-to-Fine Natural Language Processing
Slav Petrov, Eugene Charniak
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2012
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Coarse-to-Fine Models / 1.1：
Coarse-to-Fine Inference / 1.2：
Latent Variable Grammars for Natural Language Parsing / 2：
Experimental Setup / 2.1：
Manual Grammar Refinement / 2.2：
Vertical and Horizontal Markovization / 2.2.1：
Additional Linguistic Refinements / 2.2.2：
Generative Latent Variable Grammars / 2.3：
Hierarchical Estimation / 2.3.1：
Adaptive Refinement / 2.3.2：
Smoothing / 2.3.3：
An Infinite Alternative / 2.3.4：
Inference / 2.4：
Hierarchical Coarse-to-Fine Pruning / 2.4.1：
Objective Functions for Parsing / 2.4.2：
Additional Experiments / 2.5：
Baseline Grammar Variation / 2.5.1：
Final Results WSJ / 2.5.3：
Multilingual Parsing / 2.5.4：
Corpus Variation / 2.5.5：
Training Size Variation / 2.5.6：
Analysis / 2.6：
Lexical Subcategories / 2.6.1：
Phrasal Subcategories / 2.6.2：
Multilingual Analysis / 2.6.3：
Summary and Future Work / 2.7：
Discriminative Latent Variable Grammars / 3：
Log-Linear Latent Variable Grammars / 3.1：
Single-Scale Discriminative Grammars / 3.3：
Efficient Discriminative Estimation / 3.3.1：
Experiments / 3.3.2：
Multi-scale Discriminative Grammars / 3.4：
Hierarchical Refinement / 3.4.1：
Learning Sparse Multi-scale Grammars / 3.4.2：
Additional Features / 3.4.3：
Structured Acoustic Models for Speech Recognition / 3.4.4：
Learning / 4.1：
The Hand-Aligned Case / 4.2.1：
Splitting / 4.2.2：
Merging / 4.2.3：
The Automatically-Aligned Case / 4.2.4：
Phone Recognition / 4.3：
Phone Classification / 4.4.2：
Coarse-to-Fine Machine Translation Decoding / 4.5：
Coarse-to-Fine Decoding / 5.1：
Related Work / 5.2.1：
Language Model Projections / 5.2.2：
Multipass Decoding / 5.2.3：
Inversion Transduction Grammars / 5.3：
Learning Coarse Languages / 5.4：
Random Projections / 5.4.1：
Frequency Clustering / 5.4.2：
HMM Clustering / 5.4.3：
JCluster / 5.4.4：
Clustering Results / 5.4.5：
Clustering / 5.5：
Spacing / 5.5.2：
Encoding Versus Order / 5.5.3：
Final Results / 5.5.4：
Search Error Analysis / 5.5.5：
Conclusions and Future Work / 5.6：
References
Introduction / 1：
Coarse-to-Fine Models / 1.1：
Coarse-to-Fine Inference / 1.2：
32.

電子ブック
ＥＢ
32. 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：
33.

電子ブック
ＥＢ
33. 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：
34.

電子ブック
ＥＢ
34. 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
35.

電子ブック
ＥＢ
35. 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：
36.

電子ブック
ＥＢ
36. Theory of Hypergeometric Functions
Kazuhiko Aomoto, Michitake Kita, Toshitake Kohno, Kenji Iohara
出版情報: SpringerLink Books - AutoHoldings , Springer Japan, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction: the Euler-Gauss Hypergeometric Function / 1：
?-Function / 1.1：
Infinite-Product Representation Due to Euler / 1.1.1：
?-Function as Meromorphic Function / 1.1.2：
Connection Formula / 1.1.3：
Power Series and Higher Logarithmic Expansion / 1.2：
Hypergeometric Series / 1.2.1：
Gauss' Differential Equation / 1.2.2：
First-Order Fuchsian Equation / 1.2.3：
Logarithmic Connection / 1.2.4：
Higher Logarithmic Expansion / 1.2.5：
D-Module / 1.2.6：
Integral Representation Due to Euler and Riemann / 1.3：
Kummer's Method / 1.3.1：
Gauss' Contiguous Relations and Continued Fraction Expansion / 1.4：
Gauss' Contiguous Relation / 1.4.1：
Continued Fraction Expansion / 1.4.2：
Convergence / 1.4.3：
The Mellin-Barnes Integral / 1.5：
Summation over a Lattice / 1.5.1：
Barnes' Integral Representation / 1.5.2：
Mellin's Differential Equation / 1.5.3：
Plan from Chapter 2 / 1.6：
Representation of Complex Integrals and Twisted de Rham Cohomologies / 2：
Formulation of the Problem and Intuitive Explanation of the Twisted de Rham Theory / 2.1：
Concept of Twist / 2.1.1：
Intuitive Explanation / 2.1.2：
One-Dimensional Case / 2.1.3：
Two-Dimensional Case / 2.1.4：
Higher-Dimensional Generalization / 2.1.5：
Twisted Homology Group / 2.1.6：
Locally Finite Twisted Homology Group / 2.1.7：
Review of the de Rham Theory and the Twisted de Rham Theory / 2.2：
Preliminary from Homological Algebra / 2.2.1：
Current / 2.2.2：
Current with Compact Support / 2.2.3：
Sheaf Cohomology / 2.2.4：
The Case of Compact Support / 2.2.5：
De Rham's Theorem / 2.2.6：
Duality / 2.2.7：
Integration over a Simplex / 2.2.8：
Twisted Chain / 2.2.9：
Twisted Version of § 2.2.4 / 2.2.10：
Poincaré Duality / 2.2.11：
Reformulation / 2.2.12：
Comparison of Cohomologies / 2.2.13：
Computation of the Euler Characteristic / 2.2.14：
Construction of Twisted Cycles (1): One-Dimensional Case / 2.3：
Twisted Cycle Around One Point / 2.3.1：
Construction of Twisted Cycles / 2.3.2：
Intersection Number (i) / 2.3.3：
Comparison Theorem / 2.4：
Algebraic de Rham Complex / 2.4.1：
Cech Cohomology / 2.4.2：
Hypercohomology / 2.4.3：
Spectral Sequence / 2.4.4：
Algebraic de Rham Cohomology / 2.4.5：
Analytic de Rham Cohomology / 2.4.6：
de Rham-Saito Lemma and Representation of Logarithmic Differential Forms / 2.4.7：
Logarithmic Differential Forms / 2.5.1：
de Rham-Saito Lemma / 2.5.2：
Representation of Logarithmic Differential Forms (i) / 2.5.3：
Vanishing of Twisted Cohomology for Homogeneous Case / 2.6：
Basic Operators / 2.6.1：
Homotopy Formula / 2.6.2：
Eigenspace Decomposition / 2.6.3：
Vanishing Theorem (i) / 2.6.4：
Filtration of Logarithmic Complex / 2.7：
Filtration / 2.7.1：
Comparison with Homogeneous Case / 2.7.2：
Isomorphism / 2.7.3：
Vanishing Theorem of the Twisted Rational de Rham Cohomology / 2.8：
Vanishing of Logarithmic de Rham Cohomology / 2.8.1：
Vanishing of Algebraic de Rham Cohomology / 2.8.2：
Example / 2.8.3：
Arrangement of Hyperplanes in General Position / 2.9：
Vanishing Theorem (ii) / 2.9.1：
Representation of Logarithmic Differential Forms (ii) / 2.9.2：
Reduction of Poles / 2.9.3：
Basis of Cohomology / 2.9.4：
Arrangement of Hyperplanes and Hypergeometric Functions over Grassmannians / 3：
Classical Hypergeometric Series and Their Generalizations, in Particular, Hypergeometric Series of Type (n + 1, m + 1) / 3.1：
Definition / 3.1.1：
Simple Examples / 3.1.2：
Hypergeometric Series of Type (n + 1, m + 1) / 3.1.3：
Appell-Lauricella Hypergeometric Functions (i) / 3.1.4：
Appell-Lauricella Hypergeometric Functions (ii) / 3.1.5：
Restriction to a Sublattice / 3.1.6：
Examples / 3.1.7：
Appell-Lauricella Hypergeometric Functions (iii) / 3.1.8：
Horn's Hypergeometric Functions / 3.1.9：
Construction of Twisted Cycles (2): For an Arrangement of Hyperplanes in General Positiion / 3.2：
Bounded Chambers / 3.2.1：
Basis of Locally Finite Homology / 3.2.3：
Regularization of Integrals / 3.2.4：
Kummer's Method for Integral Representations and Its Modernization via the Twisted de Rham Theory: Integral Representations of Hypergeometric Series of Type (n + 1, m +1) / 3.3：
Higher-Dimensional Case / 3.3.1：
Elementary Integral Representations / 3.3.4：
Hypergeometric Function of Type (3,6) / 3.3.5：
Hypergeometric Functions of Type (n + 1, m + 1) / 3.3.6：
Horn's Cases / 3.3.7：
System of Hypergeometric Differential Equations E(n + 1, m + 1; ?) / 3.4：
Hypergeometric Integral of Type (n + 1, m + 1; ?) / 3.4.1：
Differential Equation E(n + 1, m + 1; ?) / 3.4.2：
Equivalent System / 3.4.3：
Integral Solutions of E(n + 1, m + 1; ?) and Wronskian / 3.5：
Hypergeometric Integrals as a Basis / 3.5.1：
Gauss' Equation E'(2, 4; ?') / 3.5.2：
Appell-Lauricella Hypergeometric Differential Equation E'(2, m + 1; ?') / 3.5.3：
Equation E'(3.6; ?') / 3.5.4：
Equation E'(4, 8; ?') / 3.5.5：
General Cases / 3.5.6：
Wronskian / 3.5.7：
Varchenko's Formula / 3.5.8：
Intersection Number (ii) / 3.5.9：
Twisted Riemann's Period Relations and Quadratic Relations of Hypergeometric Functions / 3.5.10：
Determination of the Rank of E(n + 1, m + 1; ?) / 3.6：
Equation E'(n + 1, m + 1; ?') / 3.6.1：
Equation E'(2,4; ?') / 3.6.2：
Equation E'(2, m + 1; ?') / 3.6.3：
Equation E'(3, 6; ?') / 3.6.4：
Duality of E(n + 1, m + 1; ?) / 3.6.5：
Duality of Equations / 3.7.1：
Duality of Grassmannians / 3.7.2：
Duality of Hypergeometric Functions / 3.7.3：
Duality of Integral Representations / 3.7.4：
Logarithmic Gauss-Manin Connection Associated to an Arrangement of Hyperplanes in General Position / 3.7.5：
Review of Notation / 3.8.1：
Variational Formula / 3.8.2：
Partial Fraction Expansion / 3.8.3：
Logarithmic Gauss-Manin Connection / 3.8.4：
Holonomic Difference Equations and Asymptotic Expansion / 4：
Existence Theorem Due to G.D. Birkhoff and Infinite- Product Representation of Matrices / 4.1：
Normal Form of Matrix-Valued Function / 4.1.1：
Asymptotic Form of Solutions / 4.1.2：
Existence Theorem (i) / 4.1.3：
Infinite-Product Representation of Matrices / 4.1.4：
Gauss' Decomposition / 4.1.5：
Regularization of the Product / 4.1.6：
Convergence of the First Column / 4.1.7：
Asymptotic Estimate of Infinite Product / 4.1.8：
Convergence of Lower Triangular Matrices / 4.1.9：
Asymptotic Estimate of Lower Triangular Matrices / 4.1.10：
Difference Equation Satisfied by Upper Triangular Matrices / 4.1.11：
Resolution of Difference Equations / 4.1.12：
Completion of the Proof / 4.1.13：
Holonomic Difference Equations in Several Variables and Asymptotic Expansion / 4.2：
Holonomic Difference Equations of First Order / 4.2.1：
Formal Asymptotic Expansion / 4.2.2：
Normal Form of Asymptotic Expansion / 4.2.3：
Existence Theorem (ii) / 4.2.4：
Connection Problem / 4.2.5：
Remark on 1-Cocyles / 4.2.6：
Gauss' Contiguous Relations / 4.2.8：
Saddle Point Method and Asymptotic Expansion / 4.2.9：
Contracting (Expanding) Twisted Cycles and Asymptotic Expansion / 4.3：
Twisted Cohomology / 4.3.1：
Saddle Point Method for Multi-Dimensional Case / 4.3.2：
Complete Kähler Metric / 4.3.3：
Gradient Vector Field / 4.3.4：
Critical Points / 4.3.5：
Vanishing Theorem (iii) / 4.3.6：
Application of the Morse Theory / 4.3.7：
n-Dimensional Lagrangian Cycles / 4.3.8：
n-Dimensional Twisted Cycles / 4.3.9：
Geometric Meaning of Asymptotic Expansion / 4.3.10：
Difference Equations Satisfied by the Hypergeometric Functions of Type (n + l, m +1; ?) / 4.4：
Derivation of Difference Equations / 4.4.1：
Asymptotic Expansion with a Fixed Direction / 4.4.3：
Non-Degeneracy of Period Matrix / 4.4.4：
Connection Problem of System of Difference Equations / 4.5：
Formulation / 4.5.1：
The Case of Appell-Lauricella Hypergeometric Functions / 4.5.2：
Mellin's Generalized Hypergeometric Functions / A：
Toric Multinomial Theorem / A.1：
Differential Equations of Mellin Type / A.4：
b-Functions / A.6：
Action of Algebraic Torus / A.7：
Vector Fields of Torus Action / A.8：
Lattice Defined by the Characters / A.9：
G-G-Z Equation / A.10：
The Selberg Integral and Hypergeometric Function of BC Type / A.11：
Selberg's Integral / B.1：
Generalization to Correlation Functions / B.2：
Monodromy Representation of Hypergeometric Functions of Type (2, m + 1; ?) / C：
Isotopic Deformation and Monodromy / C.1：
KZ Equation (Toshitake Kohno) / D：
Knizhnik-Zamolodchikov Equation / D.1：
Review of Conformal Field Theory / D.2：
Connection Matrices of KZ Equation / D.3：
Iwahori-Hecke Algebra and Quasi-Hopf Algebras / D.4：
Kontsevich Integral and Its Application / D.5：
Integral Representation of Solutions of the KZ Equation / D.6：
References
Index
Introduction: the Euler-Gauss Hypergeometric Function / 1：
?-Function / 1.1：
Infinite-Product Representation Due to Euler / 1.1.1：
37.

電子ブック
ＥＢ
37. 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：
38.

電子ブック
ＥＢ
38. Nickel Catalysis in Organic Synthesis: Methods and Reactions
Sensuke Ogoshi
出版情報: Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Inc., 2020
所蔵情報: loading…
目次情報: 続きを見る
Preface
Reactions via Nickelacycles / Part I：
Formation of Nickelacycles and Reaction with Carbon Monoxide / Sensuke Ogoshi1：
Introduction / 1.1：
Formation of Hetero-nickelacycles from Nickel(O) / 1.2：
Stoichiometric Reaction of Hetero-nickelacycles with Carbon Monoxide / 1.3：
References
Transformation of Aldehydes via Nickelacycles / Yoichi Hashimoto2：
Introduction and Scope of This Chapter / 2.1：
Catalytic Transformation of Aldehydes Through Three-Membered Oxanickelacycle Complexes / 2.2：
Catalytic Transformation of Aldehydes Through Five-Membered Oxanickelacycle Complexes / 2.3：
Catalytic Transformation of Aldehydes Through Seven-Membered Oxanickelacycle Complexes / 2.4：
Conclusion and Outlook / 2.5：
Transformation of Imines via Nickelacycles / Masato Ohashi3：
[2 + 2 + 1] Carbonylative Cycloaddition of an Imine and Either an Alkyne or an Alkene Leading to ¿-Lactams / 3.1：
[2 + 2 + 2] Cycloaddition Reaction of an Imine with Two Alkynes: Formation of 1,2-Dihydropyridine Derivatives / 3.3：
Three-Component Coupling and Cyclocondensation Reactions of an Imine, an Alkyne, and Alkylmetal Reagents / 3.4：
Asymmetric C-C Bond Formation Reactions via Nickelacycles / Ravindra Kumar and Sensuke Ogoshi4：
Enantioselective Reactions Involving Nickelacycles / 4.1：
Nickel-Catalyzed Asymmetric Coupling of Alkynes and Aldehydes / 4.2.1：
Nickel-Catalyzed Asymmetric Reductive Coupling of Alkynes and Aldehydes / 4.2.1.1：
Nickel-Catalyzed Asymmetric Alkylative Coupling of Alkynes and Aldehydes / 4.2.1.2：
Nickel-Catalyzed Asymmetric Coupling of Alkynes and Imines / 4.2.2：
Nickel-Catalyzed Asymmetric Coupling of 1,3-Enynes and Aldehydes / 4.2.3：
Nickel-Catalyzed Asymmetric Coupling of 1,3-Enynes and Ketones / 4.2.4：
Nickel-Catalyzed Asymmetric Coupling of 1,3-Dienes and Aldehydes / 4.2.5：
Nickel-Catalyzed Asymmetric Coupling of Enones and Alkynes / 4.2.6：
Nickel-Catalyzed Asymmetric Alkylative Coupling of Enones and Alkynes / 4.2.6.1：
Nickel-Catalyzed Asymmetric Coupling of Arylenoates and Alkynes / 4.2.6.2：
Nickel-Catalyzed Asymmetric Coupling of Diynes with Ketenes / 4.2.8：
Nickel-Catalyzed Asymmetric Coupling of Allenes, Aldehydes, and Silanes / 4.2.9：
Nickel-Catalyzed Asymmetric Coupling of Allenes and Isocyanates / 4.2.10：
Nickel-Catalyzed Asymmetric Coupling of Alkenes, Aldehydes, and Silanes / 4.2.11：
Nickel-Catalyzed Asymmetric Coupling of Formamide and Alkene / 4.2.12：
Nickel-Catalyzed Asymmetric Coupling of Alkynes and Cyclopropyl Carboxamide / 4.2.13：
Miscellaneous / 4.3：
Nickel-Catalyzed Asymmetric Annulation of Pyridones via Hydroarylation to Alkenes / 4.3.1：
Nickel-Catalyzed Asymmetric Synthesis of Benzoxasilole / 4.3.2：
Overview and Future Perspective / 4.4：
Functionalization of Unreactive Bonds / Part II：
Recent Advances in Ni-Catalyzed Chelation-Assisted Direct Functionalization of Inert C-H Bonds / Yon-Hua Liu and Fang Hu and Bing-Feng Shi5：
Ni-Catalyzed Functionalization of Inert C-H Bonds Assisted by Bidentate Directing Groups / 5.1：
Arylation / 5.2.1：
Alkylation / 5.2.2：
Alkenylation / 5.2.3：
Alkynylation / 5.2.4：
Other C-C Bond Formation Reactions Directed by Bidentate Directing Group / 5.2.5：
C-N Bond Formation / 5.2.6：
C-Chalcogen (Chalcogen = O, S, Se) Bond Formation / 5.2.7：
C-Halogen Bond Formation / 5.2.8：
Ni-Catalyzed Functionalization of Inert C-H Bonds Assisted by Monodentate Directing Groups / 5.3：
C-Calcogen Bond Formation / 5.3.1：
Summary / 5.4：
C-C Bond Functionalization / Yoshiaki Nakao6：
C-C Bond Functionalization of Three-Membered Rings / 6.1：
C-C Bond Functionalization of Four- and Five-Membered Rings / 6.3：
C-C Bond Functionalization of Less Strained Molecules / 6.4：
C-CN Bond Functionalization / 6.5：
Summary and Outlook / 6.6：
C-O Bond Transformations / Mamoru Tobisu7：
C(aryl)-O Bond Cleavage / 7.1：
Aryl Esters, Carbamates, and Carbonates / 7.2.1：
Aryl Ethers / 7.2.2：
Arenols / 7.2.3：
C(benzyl)-O Bond Cleavage / 7.3：
Benzyl Esters and Carbamates / 7.3.1：
Benzyl Ethers / 7.3.2：
C(acyl)-O Bond Cleavage / 7.4：
Coupling Reactions via Ni(I) and/or Ni(III) / 7.5：
Photo-Assisted Nickel-Catalyzed Cross-Coupling Processes / Christophe Lévéque and Cyril Ollivier and Louis Fensterbank8：
Development of Visible-Light Photoredox/Nickel Dual Catalysis / 8.1：
For the Formation of Carbon-Carbon Bonds / 8.2.1：
Starting from Organotrifluoroborates / 8.2.1.1：
Starting from Carboxylates or Keto Acids or from Methylanilines / 8.2.1.2：
Starting from Alkylsilicates / 8.2.1.3：
Starting from 1,4-Dihydropyridines / 8.2.1.4：
Starting from Alkylsulfinates / 8.2.1.5：
Starting from Alkyl Bromides / 8.2.1.6：
Starting from Xanthates / 8.2.1.7：
Starting from Sp3 CH Bonds / 8.2.1.8：
For the Formation of Carbon-Heteroatom Bonds / 8.2.2：
Formation of C-O Bond / 8.2.2.1：
Formation of C-P Bond / 8.2.2.2：
Formation of C-S Bond / 8.2.2.3：
Energy-Transfer-Mediated Nickel Catalysis / 8.3：
Conclusion / 8.4：
Cross-Electrophile Coupling: Principles and New Reactions / Matthew M. Goldfogel and Liangbin Huang and Daniel J. Weix9：
Mechanistic Discussion of Cross-Electrophile Coupling / 9.1：
C(sp2)-C(sp3) Bond Formation / 9.3：
Cross-Electrophile Coupling of Aryl-X and Alkyl-X / 9.3.1：
Cross-Electrophile Coupling of ArX and Bn-X / 9.3.2：
Cross-Electrophile Coupling of ArX and Allyl-X / 9.3.3：
Vinyl-X with R-X / 9.3.4：
Acyl-X with Alkyl-X / 9.3.5：
C(sp2)-C(sp2) Coupling / 9.4：
Aryl-X/Vinyl-X + Aryl-X/Vinyl-X / 9.4.1：
Aryl-X + Acyl-X / 9.4.2：
C(sp3)-C(sp3) Coupling / 9.5：
C(sp)-C(sp3) Coupling / 9.6：
Multicomponent Reactions / 9.7：
Future of the Field / 9.8：
Organometallic Chemistry of High-Valent Ni(III) and Ni(IV) Complexes / Liviu M. Mirica and Sofia M. Smith and Leonel Griego10：
Organometallic Ni(III) Complexes / 10.1：
Organometallic Ni(IV) Complexes / 10.3：
Other High-Valent Ni Complexes / 10.4：
Additional NiIII Complexes / 10.4.1：
Additional NiIV Complexes / 10.4.2：
Conclusions and Outlook / 10.5：
Carbon Dioxide Fixation / Part IV：
Carbon Dioxide Fixation via Nickelacycle / Ryohei Doi and Yoshihiro Sato11：
Introduction: Carbon Dioxide as a C1 Building Block / 11.1：
Formation, Structure, and Reactivity of Nickelalactone / 11.2：
Formation and Characterization of Nickelalactone via Oxidative Cyclization with CO2 / 11.2.1：
Reaction with Alkene / 11.2.1.1：
Reaction with Allene / 11.2.1.2：
Reaction with Diene / 11.2.1.3：
Reaction with Alkyne / 11.2.1.4：
Other Related Reactions / 11.2.1.5：
Generation of Nickelalactone Without CO2 / 11.2.1.6：
Reactivity of Nickelalactone / 11.2.2：
Transmetalation with Organometallic Reagent / 11.2.2.1：
ß-Hydride Elimination / 11.2.2.2：
Insertion of Another Unsaturated Molecule / 11.2.2.3：
Retro-cyclization / 11.2.2.4：
Nucleophilic Attack / 11.2.2.5：
Oxidation / 11.2.2.6：
Ligand Exchange / 11.2.2.7：
Catalytic Transformation via Nickelalactone 1: Reactions of Alkynes / 11.3：
Synthesis of Pyrone / 11.3.1：
Initial Finding / 11.3.1.1：
Reaction of Diynes with CO2 / 11.3.1.2：
Synthesis of ¿,ß-Unsaturated Ester / 11.3.2：
Electrochemical Reactions / 11.3.2.1：
Reduction with Organometallic Reagents / 11.3.2.2：
Catalytic Transformation via Nickelalactone 2: Reactions of Alkenes and Related Molecules / 11.4：
Transformation of Diene, Allene, and Substituted Alkene / 11.4.1：
Coupling of Diene with CO2 / 11.4.1.1：
Electrochemical Process / 11.4.1.2：
Use of Reductant / 11.4.1.3：
Synthesis of Acrylic Acid from Ethylene and CO2 / 11.4.2：
Before the Dawn / 11.4.2.1：
Development of Catalytic Reaction / 11.4.2.2：
Concluding Remarks / 11.5：
Relevance of Ni(I) in Catalytic Carboxylation Reactions / Rosie J. Somerville and Ruben Martin12：
Mechanistic Building Blocks / 12.1：
Additives / 12.2.1：
Coordination of CO2 / 12.2.2：
Insertion/C-C Bond Formation / 12.2.3：
Ligand Effects / 12.2.4：
Oxidative Addition / 12.2.5：
Oxidation State / 12.2.6：
Single Electron Transfer (SET) / 12.2.7：
Electrocarboxylation / 12.2.8：
Phosphine Ligands / 12.3.1：
Bipyridine and Related ¿-Diimine Ligands / 12.3.3：
Salen Ligands / 12.3.4：
Non-electrochemical Methods / 12.3.5：
Aryl Halides / 12.4.1：
Benzyl Electrophiles / 12.4.2：
Carboxylation of Unactivated Alkyl Electrophiles / 12.4.3：
Carboxylation of Allyl Electrophiles / 12.4.4：
Unsaturated Systems / 12.4.5：
Conclusions / 12.5：
Index
Preface
Reactions via Nickelacycles / Part I：
Formation of Nickelacycles and Reaction with Carbon Monoxide / Sensuke Ogoshi1：
39.

電子ブック
ＥＢ
39. 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：
40.

電子ブック
ＥＢ
40. 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：
41.

電子ブック
ＥＢ
41. Semantic Web Services
Dieter Fensel, Federico Michele Facca, Elena Simperl, Ioan Toma
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Scientific and Technological Foundations of Semantic Web Services / Part I：
Introduction / 1：
Web Science / 2：
Motivation / 2.1：
Technical Solution / 2.2：
History of the Web / 2.2.1：
Building the Web / 2.2.2：
Web in Society / 2.2.3：
Operationalizing the Web Science for a World of International Commerce / 2.2.4：
Analyzing the Web / 2.2.5：
Web 2.0 / 2.3：
Conclusions / 2.4：
References
Service Science / 3：
What Is a Service? / 3.1：
Service Analysis, Design, Development and Testing / 3.3：
Service Orchestration, Composition and Delivery / 3.4：
Service Innovation / 3.5：
Service Design Approach / 3.6：
Service Pricing Method and Economics / 3.7：
Service Quality Measurement / 3.8：
Service Technologies / 3.9：
Service Application / 3.10：
Web Services / 3.11：
Service Oriented Computing (SOC) / 4.1：
Service Oriented Architecture (SOA) / 4.1.2：
Defining Web Services / 4.2：
Web Service Technologies / 4.2.2：
Illustration by a Larger Example / 4.3：
Summary / 4.4：
Exercises / 4.5：
Web2.0 and RESTful Services / 5：
REST / 5.1：
Describing RESTful Services / 5.2.2：
Data Exchange for RESTful Services / 5.2.3：
AJAX APIs / 5.2.4：
Examples of RESTful Services / 5.2.5：
Semantic Web / 5.3：
Extensions / 6.1：
Web Service Modeling Ontology Approach / 6.4：
Web Service Modeling Ontology / 7：
Ontologies / 7.1：
Goals / 7.2.2：
Mediators / 7.2.4：
The Web Service Modeling Language / 7.3：
Principles of WSMO / 8.1：
Logics Families and Semantic Web Services / 8.1.2：
WSML Language Variants / 8.2：
WSML Basis / 8.2.2：
Ontologies in WSML / 8.2.3：
Web Services in WSML / 8.2.4：
Goals in WSML / 8.2.5：
Mediators in WSML / 8.2.6：
Technologies for Using WSML / 8.2.7：
Travel Ontology / 8.3：
Services / 8.4.2：
Goal / 8.4.3：
The Web Service Execution Environment / 8.5：
Service Orientation / 9.1：
Execution Environment for Semantic Web Services / 9.1.2：
Governing Principles / 9.1.3：
SESA Vision / 9.2：
SESA Middleware / 9.2.2：
SESA Execution Semantics / 9.2.3：
Modeling of Business Services / 9.3：
Execution of Services / 9.3.2：
Possible Extensions / 9.4：
Goal Subscription / 9.4.1：
Complementary Approaches for Web Service Modeling Ontology / 9.5：
Triple Space Computing for Semantic Web Services / 10：
Tuplespace Computing / 10.1：
Triple Space Computing / 10.2.2：
Triple Space Conceptual Models / 10.2.3：
Triple Space Architecture / 10.2.4：
Triple Space and Semantic Web Services / 10.2.5：
Triple Space and Semantic SOA / 10.2.6：
OWL-S and Other Approaches / 10.3：
OWL-S / 11.2.1：
Service Profile
Service Grounding / 11.2.2：
Service Model / 11.2.3：
An Extension to OWL-S / 11.2.4：
Tool Support / 11.2.5：
OWL-S Summary / 11.2.6：
METEOR-S / 11.3：
Semantic Annotation of Web services / 11.3.1：
Semantics-Based Discovery of Web Services / 11.3.2：
Composition of Web Services / 11.3.3：
METEOR-S Summary / 11.3.4：
IRS-III / 11.4：
Discovery, Selection and Mediation / 11.4.1：
Communication / 11.4.2：
Choreography and Orchestration / 11.4.3：
Lightweight Semantic Web Service Descriptions / 11.5：
SAWSDL / 12.1：
WSMO-Lite Service Semantics / 12.2.2：
WSMO-Lite in SAWSDL / 12.2.3：
WSMO-Lite for RESTful Services / 12.2.4：
Real-World Adoption of Semantic Web Services / 12.3：
What Are SWS Good for? DIP, SUPER, and SOA4All Use Cases / 13：
Data, Information, and Process Integration with Semantic Web Services (DIP) / 13.1：
Use Cases / 13.2.1：
Semantics Utilized for Process Management Within and Between Enterprises (SUPER) / 13.3：
Service Oriented Architectures for All (SOA4All) / 13.3.1：
Seekda: The Business Point of View / 13.4.1：
Crawler / 14.1：
Search Engine / 14.2.2：
Bundle Configurator and Assistant / 14.2.3：
Index / 14.3：
Scientific and Technological Foundations of Semantic Web Services / Part I：
Introduction / 1：
Web Science / 2：
42.

電子ブック
ＥＢ
42. Semantic Web Services
Dieter Fensel, Federico Michele Facca, Elena Simperl, Ioan Toma
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2011
所蔵情報: loading…
目次情報: 続きを見る
Scientific and Technological Foundations of Semantic Web Services / Part I：
Introduction / 1：
Web Science / 2：
Motivation / 2.1：
Technical Solution / 2.2：
History of the Web / 2.2.1：
Building the Web / 2.2.2：
Web in Society / 2.2.3：
Operationalizing the Web Science for a World of International Commerce / 2.2.4：
Analyzing the Web / 2.2.5：
Web 2.0 / 2.3：
Conclusions / 2.4：
References
Service Science / 3：
What Is a Service? / 3.1：
Service Analysis, Design, Development and Testing / 3.3：
Service Orchestration, Composition and Delivery / 3.4：
Service Innovation / 3.5：
Service Design Approach / 3.6：
Service Pricing Method and Economics / 3.7：
Service Quality Measurement / 3.8：
Service Technologies / 3.9：
Service Application / 3.10：
Web Services / 3.11：
Service Oriented Computing (SOC) / 4.1：
Service Oriented Architecture (SOA) / 4.1.2：
Defining Web Services / 4.2：
Web Service Technologies / 4.2.2：
Illustration by a Larger Example / 4.3：
Summary / 4.4：
Exercises / 4.5：
Web2.0 and RESTful Services / 5：
REST / 5.1：
Describing RESTful Services / 5.2.2：
Data Exchange for RESTful Services / 5.2.3：
AJAX APIs / 5.2.4：
Examples of RESTful Services / 5.2.5：
Semantic Web / 5.3：
Extensions / 6.1：
Web Service Modeling Ontology Approach / 6.4：
Web Service Modeling Ontology / 7：
Ontologies / 7.1：
Goals / 7.2.2：
Mediators / 7.2.4：
The Web Service Modeling Language / 7.3：
Principles of WSMO / 8.1：
Logics Families and Semantic Web Services / 8.1.2：
WSML Language Variants / 8.2：
WSML Basis / 8.2.2：
Ontologies in WSML / 8.2.3：
Web Services in WSML / 8.2.4：
Goals in WSML / 8.2.5：
Mediators in WSML / 8.2.6：
Technologies for Using WSML / 8.2.7：
Travel Ontology / 8.3：
Services / 8.4.2：
Goal / 8.4.3：
The Web Service Execution Environment / 8.5：
Service Orientation / 9.1：
Execution Environment for Semantic Web Services / 9.1.2：
Governing Principles / 9.1.3：
SESA Vision / 9.2：
SESA Middleware / 9.2.2：
SESA Execution Semantics / 9.2.3：
Modeling of Business Services / 9.3：
Execution of Services / 9.3.2：
Possible Extensions / 9.4：
Goal Subscription / 9.4.1：
Complementary Approaches for Web Service Modeling Ontology / 9.5：
Triple Space Computing for Semantic Web Services / 10：
Tuplespace Computing / 10.1：
Triple Space Computing / 10.2.2：
Triple Space Conceptual Models / 10.2.3：
Triple Space Architecture / 10.2.4：
Triple Space and Semantic Web Services / 10.2.5：
Triple Space and Semantic SOA / 10.2.6：
OWL-S and Other Approaches / 10.3：
OWL-S / 11.2.1：
Service Profile
Service Grounding / 11.2.2：
Service Model / 11.2.3：
An Extension to OWL-S / 11.2.4：
Tool Support / 11.2.5：
OWL-S Summary / 11.2.6：
METEOR-S / 11.3：
Semantic Annotation of Web services / 11.3.1：
Semantics-Based Discovery of Web Services / 11.3.2：
Composition of Web Services / 11.3.3：
METEOR-S Summary / 11.3.4：
IRS-III / 11.4：
Discovery, Selection and Mediation / 11.4.1：
Communication / 11.4.2：
Choreography and Orchestration / 11.4.3：
Lightweight Semantic Web Service Descriptions / 11.5：
SAWSDL / 12.1：
WSMO-Lite Service Semantics / 12.2.2：
WSMO-Lite in SAWSDL / 12.2.3：
WSMO-Lite for RESTful Services / 12.2.4：
Real-World Adoption of Semantic Web Services / 12.3：
What Are SWS Good for? DIP, SUPER, and SOA4All Use Cases / 13：
Data, Information, and Process Integration with Semantic Web Services (DIP) / 13.1：
Use Cases / 13.2.1：
Semantics Utilized for Process Management Within and Between Enterprises (SUPER) / 13.3：
Service Oriented Architectures for All (SOA4All) / 13.3.1：
Seekda: The Business Point of View / 13.4.1：
Crawler / 14.1：
Search Engine / 14.2.2：
Bundle Configurator and Assistant / 14.2.3：
Index / 14.3：
Scientific and Technological Foundations of Semantic Web Services / Part I：
Introduction / 1：
Web Science / 2：
43.

電子ブック
ＥＢ
43. Chemical catalysts for biomass upgrading / (: electronic bk)
edited by Mark Crocker, Eduardo Santillan-Jimenez
出版情報:   1 online resource
所蔵情報: loading…
目次情報: 続きを見る
Preface
Upgrading of Biomass via Catalytic Fast Pyrolysis (CFP) / Charles A. Mullen1：
Introduction / 1.1：
Catalytic Pyrolysis Over Zeolites / 1.1.1：
Catalytic Pyrolysis Over HZSM-5 / 1.1.1.1：
Deactivation of HZSM-5 During CFP / 1.1.1.2：
Modification of ZSM-5 with Metals / 1.1.1.3：
Modifications of ZSM-5 Pore Structure / 1.1.1.4：
CFP with Metal Oxide Catalysts / 1.1.2：
CFP to Produce Fine Chemicals / 1.1.3：
Outlook and Conclusions / 1.1.4：
References
The Upgrading of Bio-Oil via Hydrodeoxygenation / Adetoyese O. Oyedun and Madhumita Patel and Mayank Kumar and Amit Kumar2：
Hydrodeoxygenation (HDO) / 2.1：
Hydrodeoxygenation of Phenol as a Model Compound / 2.2.1：
HDO of Phenolic (Guaiacol) Model Compounds / 2.2.1.1：
HDO of Phenolic (Anisole) Model Compounds / 2.2.1.2：
HDO of Phenolic (Cresol) Model Compounds / 2.2.1.3：
Hydrodeoxygenation of Aldehyde Model Compounds / 2.2.2：
Hydrodeoxygenation of Carboxylic Acid Model Compounds / 2.2.3：
Hydrodeoxygenation of Alcohol Model Compounds / 2.2.4：
Hydrodeoxygenation of Carbohydrate Model Compounds / 2.2.5：
Chemical Catalysts for the HDO Reaction / 2.3：
Catalyst Promoters for HDO / 2.3.1：
Catalyst Supports for HDO / 2.3.2：
Catalyst Selectivity for HDO / 2.3.3：
Catalyst Deactivation During HDO / 2.3.4：
Research Gaps / 2.4：
Conclusions / 2.5：
Acknowledgments
Upgrading of Bio-oil via Fluid Catalytic Cracking / Idoia Hita and Jose Maria Arandes and Javier Bilbao3：
Bio-oil / 3.1：
Bio-oil Production via Fast Pyrolysis / 3.2.1：
General Characteristics, Composition, and Stabilization of Bio-oil / 3.2.2：
Adjustment of Bio-oil Composition Through Pyrolytic Strategies / 3.2.2.1：
Bio-oil Stabilization / 3.2.2.2：
Valorization Routes for Bio-oil / 3.2.3：
Hydroprocessing / 3.2.3.1：
Steam Reforming / 3.2.3.2：
Extraction of Valuable Components from Bio-oil / 3.2.3.3：
Catalytic Cracking of Bio-oil: Fundamental Aspects / 3.3：
The FCC Unit / 3.3.1：
Cracking Reactions and Mechanisms / 3.3.2：
Cracking of Oxygenated Compounds / 3.3.3：
Cracking of Bio-oil / 3.3.4：
Bio-oil Cracking in the FCC Unit / 3.4：
Cracking of Model Oxygenates / 3.4.1：
Coprocessing of Oxygenates and Their Mixtures with Vacuum Gas Oil (VGO) / 3.4.2：
Cracking of Bio-oil and Its Mixtures with VGO / 3.4.3：
Conclusions and Critical Discussion / 3.5：
Stabilization of Bio-oil via Esterification / Xun Hu4：
Reactions of the Main Components of Bio-Oil Under Esterification Conditions / 4.1：
Sugars / 4.2.1：
Carboxylic Acids / 4.2.2：
Furans / 4.2.3：
Aldehydes and Ketones / 4.2.4：
Phenolics / 4.2.5：
Other Components / 4.2.6：
Processes for Esterification of Bio-oil / 4.3：
Esterification of Bio-oil Under Subcritical or Supercritical Conditions / 4.3.1：
Removal of the Water in Bio-oil to Enhance Conversion of Carboxylic Acids / 4.3.2：
In-line Esterification of Bio-oil / 4.3.3：
Esterification Coupled with Oxidation / 4.3.4：
Esterification Coupled with Hydrogenation / 4.3.5：
Steric Hindrance in Bio-oil Esterification / 4.3.6：
Coking in Esterification of Bio-oil / 4.3.7：
Effects of Bio-oil Esterification on the Subsequent Hydrotreatment / 4.3.8：
Catalysts / 4.4：
Summary and Outlook / 4.5：
Catalytic Upgrading of Holocellulose-Derived C5 and C6 Sugars / Xingguang Zhang and Zhijun Tai and Amin Osatiashtiani and Lee Durndell and Adam F. Lee and Karen Wilson5：
Catalytic Transformation of C5-C6 Sugars / 5.1：
Isomerization Catalysts / 5.2.1：
Zeolites / 5.2.1.1：
Hydrotalcites / 5.2.1.2：
Other Solid Catalysts / 5.2.1.3：
Dehydration Catalysts / 5.2.2：
Zeolitic and Mesoporous Brønsted Solid Acids / 5.2.2.1：
Sulfonic Acid Functionalized Hybrid Organic-Inorganic Silicas / 5.2.2.2：
Metal-Organic Frameworks / 5.2.2.3：
Supported Ionic Liquids / 5.2.2.4：
Catalysts for Tandem Isomerization and Dehydration of C5-C6 Sugars / 5.2.3：
Bifunctional Zeolites and Mesoporous Solid Acids / 5.2.3.1：
Metal Oxides, Sulfates, and Phosphates / 5.2.3.2：
Catalysts for the Hydrogenation of C5-C6 Sugars / 5.2.3.3：
Ni Catalysts / 5.2.4.1：
Ru Catalysts / 5.2.4.2：
Pt Catalysts / 5.2.4.3：
Other Hydrogenation Catalysts / 5.2.4.4：
Hydrogenolysis Catalysts / 5.2.5：
Other Reactions / 5.2.6：
Conclusions and Future Perspectives / 5.3：
Chemistry of C-C Bond Formation Reactions Used in Biomass Upgrading: Reaction Mechanisms, Site Requirements, and Catalytic Materials / Tuong V. Bui and Nhung Duong and Felipe Anaya and Duong Ngo and Gap Warakunwit and Daniel E. Resasco6：
Mechanisms and Site Requirements of C-C Coupling Reactions / 6.1：
Aldol Condensation: Mechanism and Site Requirement / 6.2.1：
Base-Catalyzed Aldol Condensation / 6.2.1.1：
Acid-Catalyzed Aldol Condensation: Mechanism and Site Requirement / 6.2.1.2：
Alkylation: Mechanism and Site Requirement / 6.2.2：
Lewis Acid-Catalyzed Alkylation Mechanism / 6.2.2.1：
Brønsted Acid-Catalyzed Alkylation Mechanism / 6.2.2.2：
Base-Catalyzed Alkylation: Mechanism and Site Requirement / 6.2.2.3：
Hydroxyalkylation: Mechanism and Site Requirement / 6.2.3：
Brønsted Acid-Catalyzed Mechanism / 6.2.3.1：
Site Requirement / 6.2.3.2：
Acylation: Mechanism and Site Requirement / 6.2.4：
Mechanistic Aspects of Acylation Reactions / 6.2.4.1：
Role of Brønsted vs. Lewis Acid in Acylation Over Zeolites / 6.2.4.2：
Ketonization: Mechanism and Site Requirement / 6.2.5：
Mechanism of Surface Ketonization / 6.2.5.1：
Optimization and Design of Catalytic Materials for C-C Bond Forming Reactions / 6.2.5.2：
Oxides / 6.3.1：
Magnesia (MgO) / 6.3.1.1：
Zirconia (ZrO2) / 6.3.1.2：
ZSM-5 / 6.3.2：
HY / 6.3.2.2：
HBEA / 6.3.2.3：
Downstream Conversion of Biomass-Derived Oxygenates to Fine Chemicals / Michèle Besson and Stéphane Loridant and Noémie Perret and Catherine Pinel7：
Selective Catalytic Oxidation / 7.1：
Catalytic Oxidation of Glycerol / 7.2.1：
Glycerol to Glyceric Acid (GLYAC) / 7.2.2.1：
Glycerol to Tartronic Acid (TARAC) / 7.2.2.2：
Glycerol to Dihydroxyacetone (DHA) / 7.2.2.3：
Glycerol to Mesoxalic Acid (MESAC) / 7.2.2.4：
Glycerol to Glycolic Acid (GLYCAC) / 7.2.2.5：
Glycerol to Lactic Acid (LAC) / 7.2.2.6：
Oxidation of 5-HydroxymethylfurfuraI (HMF) / 7.2.3：
HMF to 2,5-Furandicarboxylic Acid (FDCA) / 7.2.3.1：
HMF to 2,5-Diformylfuran (DFF) / 7.2.3.2：
HMF to 5-Hydroxymethyl-2-furancarboxylic Acid (HMFCA) or 5-Formyl-2-furancarboxylic Acid (FFCA) / 7.2.3.3：
Hydrogenation/Hydrogenolysis / 7.3：
Hydrogenolysis of Polyols / 7.3.1：
Hydrodeoxygenation of Polyols / 7.3.2.1：
C-C Hydrogenolysis of Polyols / 7.3.2.2：
Hydrogenation of Carboxylic Acids / 7.3.3：
Levulinic Acid / 7.3.3.1：
Succinic Acid / 7.3.3.2：
Selective Hydrogenation of Furanic Compounds / 7.3.4：
Reductive Amination of Acids and Furans / 7.3.5：
Catalyst Design for the Dehydration of Biosourced Molecules / 7.4：
Glycerol to Acrolein / 7.4.1：
Lactic Acid to Acrylic Acid / 7.4.3：
Sorbitol to Isosorbide / 7.4.4：
Conclusions and Outlook / 7.5：
Conversion of Lignin to Value-added Chemicals via Oxidative Depolymerization / Justin K. Mobley8：
Cautionary Statements / 8.1：
Catalytic Systems for the Oxidative Depolymerization of Lignin / 8.2：
Enzymes and Bio-mimetic Catalysts / 8.2.1：
Cobalt Schiff Base Catalysts / 8.2.2：
Vanadium Catalysts / 8.2.3：
Methyltrioxorhenium (MTO) Catalysts / 8.2.4：
Commercial Products from Lignin / 8.3：
Stepwise Depolymerization of ß-O-4 Linkages / 8.4：
Benzylic Oxidation / 8.4.1：
Secondary Depolymerization / 8.4.2：
Heterogeneous Catalysts for Lignin Depolymerization / 8.5：
Outlook / 8.6：
Lignin Valorization via Reductive Depolymerization / Yang (Vanessa) Song9：
Late-stage Reductive Lignin Depolymerization / 9.1：
Mild Hydroprocessing / 9.2.1：
Harsh Hydroprocessing / 9.2.2：
Bifunctional Hydroprocessing / 9.2.3：
Liquid Phase Reforming / 9.2.4：
Reductive Lignin Depolymerization Using Hydrosilanes, Zinc, and Sodium / 9.2.5：
Reductive Catalytic Fractionation (RCF) / 9.3：
Reaction Conditions / 9.3.1：
Lignocellulose Source / 9.3.2：
Applied Catalyst / 9.3.3：
Acknowledgment / 9.4：
Conversion of Lipids to Biodiesel via Esterification and Transesterification / Amin Talebian-Kiakalaieh and Amin Nor Aishah Saidina10：
Different Feedstocks tor Biodiesel Production / 10.1：
Biodiesel Production / 10.3：
Algal Bio diesel Production / 10.3.1：
Nutrients for Microalgae Growth / 10.3.1.1：
Microalgae Cultivation System / 10.3.1.2：
Harvesting / 10.3.1.3：
Drying / 10.3.1.4：
Lipid Extraction / 10.3.1.5：
Catalytic Transesterification / 10.4：
Homogeneous Catalysts / 10.4.1：
Alkali Catalysts / 10.4.1.1：
Acid Catalysts / 10.4.1.2：
Two-step Esterification-Transesterification Reactions / 10.4.1.3：
Heterogeneous Catalysts / 10.4.2：
Solid Acid Catalysts / 10.4.2.1：
Solid Base Catalysts / 10.4.2.2：
Enzyme-Catalyzed Transesterification Reactions / 10.4.3：
Supercritical Transesterification Processes / 10.5：
Alternative Processes for Biodiesel Production / 10.6：
Ultrasonic Processes / 10.6.1：
Microwave-Assisted Processes / 10.6.2：
Summary / 10.7：
Upgrading of Lipids to Hydrocarbon Fuels via (Hydro)deoxygenation / David Kubicka11：
Feedstocks / 11.1：
Chemistry / 11.3：
Technologies / 11.4：
Sulfided Catalysts / 11.5：
Metallic Catalysts / 11.5.2：
Metal Carbide, Nitride, and Phosphide Catalysts / 11.5.3：
Upgrading of Lipids to Fuel-like Hydrocarbons and Terminal Olefins via Decarbonylation/Decarboxylation / Ryan Loe and Eduardo Santillan-Jimenez and Mark Crocker11.6：
Lipid Feeds / 12.1：
deCOx Catalysts: Active Phases / 12.3：
deCOx Catalysts: Support Materials / 12.4：
Reaction Mechanism / 12.5：
Catalyst Deactivation / 12.7：
Conversion of Terpenes to Chemicals and Related Products / Anne E. Harman-Ware12.8：
Terpene Biosynthesis and Structure / 13.1：
Sources of Terpenes / 13.3：
Conifers and Other Trees / 13.3.1：
Essential Oils and Other Extracts / 13.3.2：
Isolation of Terpenes / 13.4：
Tapping and Extraction / 13.4.1：
Terpenes as a By-product of Pulping Processes / 13.4.2：
Historical Uses of Raw Terpenes / 13.5：
Adhesives and Turpentine / 13.5.1：
Flavors, Fragrances, Therapeutics, and Pharmaceutical Applications / 13.5.2：
Catalytic Methods for Conversion of Terpenes to Fine Chemicals and Materials / 13.6：
Homogeneous Processes / 13.6.1：
Hydration and Oxidation Reactions / 13.6.1.1：
Homogeneous Catalysis for the Epoxidation of Monoterpenes / 13.6.1.2：
Isomerizations / 13.6.1.3：
Production of Terpene Carbonates from CO2 and Epoxides / 13.6.1.4：
Polymers and Other Materials from Terpenes / 13.6.1.5：
"Click Chemistry" Routes for the Production of Materials and Medicinal Compounds from Terpenes / 13.6.1.6：
Heterogeneous Processes / 13.6.2：
Isomerization and Hydration of ¿-Pinene / 13.6.2.1：
Heterogeneous Catalysts for the Epoxidation of Monoterpenes / 13.6.2.2：
Isomerization of ¿-Pinene Oxide / 13.6.2.3：
Vitamins from Terpenes / 13.6.2.4：
Dehydrogenation and Hydrogenation Reactions of Terpenes / 13.6.2.5：
Conversion of Terpenes to Fuels / 13.6.2.6：
Conversion of Chitin to Nitrogen-containing Chemicals / Xi Chen and Ning Yan14：
Waste Shell Biorefinery / 14.1：
Production of Amines and Amides from Chitin Biomass / 14.2：
Sugar Amines/Amides / 14.2.1：
Furanic Amines/Amides / 14.2.2：
Polyol Amines/Amides / 14.2.3：
Production of N-heterocyclic Compounds from Chitin Biomass / 14.3：
Production of Carbohydrates and Acetic Acid from Chitin Biomass / 14.4：
Production of Advanced Products from Chitin Biomass / 14.5：
Conclusion / 14.6：
Index / Eduardo Santillan-Jimenez and Mark Crocker15：
Preface
Upgrading of Biomass via Catalytic Fast Pyrolysis (CFP) / Charles A. Mullen1：
Introduction / 1.1：
44.

電子ブック
ＥＢ
44. Chemical Catalysts for Biomass Upgrading
Crocker, Santillan-Jimenez Eduardo
出版情報: Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Inc., 2020
所蔵情報: loading…
目次情報: 続きを見る
Preface
Upgrading of Biomass via Catalytic Fast Pyrolysis (CFP) / Charles A. Mullen1：
Introduction / 1.1：
Catalytic Pyrolysis Over Zeolites / 1.1.1：
Catalytic Pyrolysis Over HZSM-5 / 1.1.1.1：
Deactivation of HZSM-5 During CFP / 1.1.1.2：
Modification of ZSM-5 with Metals / 1.1.1.3：
Modifications of ZSM-5 Pore Structure / 1.1.1.4：
CFP with Metal Oxide Catalysts / 1.1.2：
CFP to Produce Fine Chemicals / 1.1.3：
Outlook and Conclusions / 1.1.4：
References
The Upgrading of Bio-Oil via Hydrodeoxygenation / Adetoyese O. Oyedun and Madhumita Patel and Mayank Kumar and Amit Kumar2：
Hydrodeoxygenation (HDO) / 2.1：
Hydrodeoxygenation of Phenol as a Model Compound / 2.2.1：
HDO of Phenolic (Guaiacol) Model Compounds / 2.2.1.1：
HDO of Phenolic (Anisole) Model Compounds / 2.2.1.2：
HDO of Phenolic (Cresol) Model Compounds / 2.2.1.3：
Hydrodeoxygenation of Aldehyde Model Compounds / 2.2.2：
Hydrodeoxygenation of Carboxylic Acid Model Compounds / 2.2.3：
Hydrodeoxygenation of Alcohol Model Compounds / 2.2.4：
Hydrodeoxygenation of Carbohydrate Model Compounds / 2.2.5：
Chemical Catalysts for the HDO Reaction / 2.3：
Catalyst Promoters for HDO / 2.3.1：
Catalyst Supports for HDO / 2.3.2：
Catalyst Selectivity for HDO / 2.3.3：
Catalyst Deactivation During HDO / 2.3.4：
Research Gaps / 2.4：
Conclusions / 2.5：
Acknowledgments
Upgrading of Bio-oil via Fluid Catalytic Cracking / Idoia Hita and Jose Maria Arandes and Javier Bilbao3：
Bio-oil / 3.1：
Bio-oil Production via Fast Pyrolysis / 3.2.1：
General Characteristics, Composition, and Stabilization of Bio-oil / 3.2.2：
Adjustment of Bio-oil Composition Through Pyrolytic Strategies / 3.2.2.1：
Bio-oil Stabilization / 3.2.2.2：
Valorization Routes for Bio-oil / 3.2.3：
Hydroprocessing / 3.2.3.1：
Steam Reforming / 3.2.3.2：
Extraction of Valuable Components from Bio-oil / 3.2.3.3：
Catalytic Cracking of Bio-oil: Fundamental Aspects / 3.3：
The FCC Unit / 3.3.1：
Cracking Reactions and Mechanisms / 3.3.2：
Cracking of Oxygenated Compounds / 3.3.3：
Cracking of Bio-oil / 3.3.4：
Bio-oil Cracking in the FCC Unit / 3.4：
Cracking of Model Oxygenates / 3.4.1：
Coprocessing of Oxygenates and Their Mixtures with Vacuum Gas Oil (VGO) / 3.4.2：
Cracking of Bio-oil and Its Mixtures with VGO / 3.4.3：
Conclusions and Critical Discussion / 3.5：
Stabilization of Bio-oil via Esterification / Xun Hu4：
Reactions of the Main Components of Bio-Oil Under Esterification Conditions / 4.1：
Sugars / 4.2.1：
Carboxylic Acids / 4.2.2：
Furans / 4.2.3：
Aldehydes and Ketones / 4.2.4：
Phenolics / 4.2.5：
Other Components / 4.2.6：
Processes for Esterification of Bio-oil / 4.3：
Esterification of Bio-oil Under Subcritical or Supercritical Conditions / 4.3.1：
Removal of the Water in Bio-oil to Enhance Conversion of Carboxylic Acids / 4.3.2：
In-line Esterification of Bio-oil / 4.3.3：
Esterification Coupled with Oxidation / 4.3.4：
Esterification Coupled with Hydrogenation / 4.3.5：
Steric Hindrance in Bio-oil Esterification / 4.3.6：
Coking in Esterification of Bio-oil / 4.3.7：
Effects of Bio-oil Esterification on the Subsequent Hydrotreatment / 4.3.8：
Catalysts / 4.4：
Summary and Outlook / 4.5：
Catalytic Upgrading of Holocellulose-Derived C5 and C6 Sugars / Xingguang Zhang and Zhijun Tai and Amin Osatiashtiani and Lee Durndell and Adam F. Lee and Karen Wilson5：
Catalytic Transformation of C5-C6 Sugars / 5.1：
Isomerization Catalysts / 5.2.1：
Zeolites / 5.2.1.1：
Hydrotalcites / 5.2.1.2：
Other Solid Catalysts / 5.2.1.3：
Dehydration Catalysts / 5.2.2：
Zeolitic and Mesoporous Brønsted Solid Acids / 5.2.2.1：
Sulfonic Acid Functionalized Hybrid Organic-Inorganic Silicas / 5.2.2.2：
Metal-Organic Frameworks / 5.2.2.3：
Supported Ionic Liquids / 5.2.2.4：
Catalysts for Tandem Isomerization and Dehydration of C5-C6 Sugars / 5.2.3：
Bifunctional Zeolites and Mesoporous Solid Acids / 5.2.3.1：
Metal Oxides, Sulfates, and Phosphates / 5.2.3.2：
Catalysts for the Hydrogenation of C5-C6 Sugars / 5.2.3.3：
Ni Catalysts / 5.2.4.1：
Ru Catalysts / 5.2.4.2：
Pt Catalysts / 5.2.4.3：
Other Hydrogenation Catalysts / 5.2.4.4：
Hydrogenolysis Catalysts / 5.2.5：
Other Reactions / 5.2.6：
Conclusions and Future Perspectives / 5.3：
Chemistry of C-C Bond Formation Reactions Used in Biomass Upgrading: Reaction Mechanisms, Site Requirements, and Catalytic Materials / Tuong V. Bui and Nhung Duong and Felipe Anaya and Duong Ngo and Gap Warakunwit and Daniel E. Resasco6：
Mechanisms and Site Requirements of C-C Coupling Reactions / 6.1：
Aldol Condensation: Mechanism and Site Requirement / 6.2.1：
Base-Catalyzed Aldol Condensation / 6.2.1.1：
Acid-Catalyzed Aldol Condensation: Mechanism and Site Requirement / 6.2.1.2：
Alkylation: Mechanism and Site Requirement / 6.2.2：
Lewis Acid-Catalyzed Alkylation Mechanism / 6.2.2.1：
Brønsted Acid-Catalyzed Alkylation Mechanism / 6.2.2.2：
Base-Catalyzed Alkylation: Mechanism and Site Requirement / 6.2.2.3：
Hydroxyalkylation: Mechanism and Site Requirement / 6.2.3：
Brønsted Acid-Catalyzed Mechanism / 6.2.3.1：
Site Requirement / 6.2.3.2：
Acylation: Mechanism and Site Requirement / 6.2.4：
Mechanistic Aspects of Acylation Reactions / 6.2.4.1：
Role of Brønsted vs. Lewis Acid in Acylation Over Zeolites / 6.2.4.2：
Ketonization: Mechanism and Site Requirement / 6.2.5：
Mechanism of Surface Ketonization / 6.2.5.1：
Optimization and Design of Catalytic Materials for C-C Bond Forming Reactions / 6.2.5.2：
Oxides / 6.3.1：
Magnesia (MgO) / 6.3.1.1：
Zirconia (ZrO2) / 6.3.1.2：
ZSM-5 / 6.3.2：
HY / 6.3.2.2：
HBEA / 6.3.2.3：
Downstream Conversion of Biomass-Derived Oxygenates to Fine Chemicals / Michèle Besson and Stéphane Loridant and Noémie Perret and Catherine Pinel7：
Selective Catalytic Oxidation / 7.1：
Catalytic Oxidation of Glycerol / 7.2.1：
Glycerol to Glyceric Acid (GLYAC) / 7.2.2.1：
Glycerol to Tartronic Acid (TARAC) / 7.2.2.2：
Glycerol to Dihydroxyacetone (DHA) / 7.2.2.3：
Glycerol to Mesoxalic Acid (MESAC) / 7.2.2.4：
Glycerol to Glycolic Acid (GLYCAC) / 7.2.2.5：
Glycerol to Lactic Acid (LAC) / 7.2.2.6：
Oxidation of 5-HydroxymethylfurfuraI (HMF) / 7.2.3：
HMF to 2,5-Furandicarboxylic Acid (FDCA) / 7.2.3.1：
HMF to 2,5-Diformylfuran (DFF) / 7.2.3.2：
HMF to 5-Hydroxymethyl-2-furancarboxylic Acid (HMFCA) or 5-Formyl-2-furancarboxylic Acid (FFCA) / 7.2.3.3：
Hydrogenation/Hydrogenolysis / 7.3：
Hydrogenolysis of Polyols / 7.3.1：
Hydrodeoxygenation of Polyols / 7.3.2.1：
C-C Hydrogenolysis of Polyols / 7.3.2.2：
Hydrogenation of Carboxylic Acids / 7.3.3：
Levulinic Acid / 7.3.3.1：
Succinic Acid / 7.3.3.2：
Selective Hydrogenation of Furanic Compounds / 7.3.4：
Reductive Amination of Acids and Furans / 7.3.5：
Catalyst Design for the Dehydration of Biosourced Molecules / 7.4：
Glycerol to Acrolein / 7.4.1：
Lactic Acid to Acrylic Acid / 7.4.3：
Sorbitol to Isosorbide / 7.4.4：
Conclusions and Outlook / 7.5：
Conversion of Lignin to Value-added Chemicals via Oxidative Depolymerization / Justin K. Mobley8：
Cautionary Statements / 8.1：
Catalytic Systems for the Oxidative Depolymerization of Lignin / 8.2：
Enzymes and Bio-mimetic Catalysts / 8.2.1：
Cobalt Schiff Base Catalysts / 8.2.2：
Vanadium Catalysts / 8.2.3：
Methyltrioxorhenium (MTO) Catalysts / 8.2.4：
Commercial Products from Lignin / 8.3：
Stepwise Depolymerization of ß-O-4 Linkages / 8.4：
Benzylic Oxidation / 8.4.1：
Secondary Depolymerization / 8.4.2：
Heterogeneous Catalysts for Lignin Depolymerization / 8.5：
Outlook / 8.6：
Lignin Valorization via Reductive Depolymerization / Yang (Vanessa) Song9：
Late-stage Reductive Lignin Depolymerization / 9.1：
Mild Hydroprocessing / 9.2.1：
Harsh Hydroprocessing / 9.2.2：
Bifunctional Hydroprocessing / 9.2.3：
Liquid Phase Reforming / 9.2.4：
Reductive Lignin Depolymerization Using Hydrosilanes, Zinc, and Sodium / 9.2.5：
Reductive Catalytic Fractionation (RCF) / 9.3：
Reaction Conditions / 9.3.1：
Lignocellulose Source / 9.3.2：
Applied Catalyst / 9.3.3：
Acknowledgment / 9.4：
Conversion of Lipids to Biodiesel via Esterification and Transesterification / Amin Talebian-Kiakalaieh and Amin Nor Aishah Saidina10：
Different Feedstocks tor Biodiesel Production / 10.1：
Biodiesel Production / 10.3：
Algal Bio diesel Production / 10.3.1：
Nutrients for Microalgae Growth / 10.3.1.1：
Microalgae Cultivation System / 10.3.1.2：
Harvesting / 10.3.1.3：
Drying / 10.3.1.4：
Lipid Extraction / 10.3.1.5：
Catalytic Transesterification / 10.4：
Homogeneous Catalysts / 10.4.1：
Alkali Catalysts / 10.4.1.1：
Acid Catalysts / 10.4.1.2：
Two-step Esterification-Transesterification Reactions / 10.4.1.3：
Heterogeneous Catalysts / 10.4.2：
Solid Acid Catalysts / 10.4.2.1：
Solid Base Catalysts / 10.4.2.2：
Enzyme-Catalyzed Transesterification Reactions / 10.4.3：
Supercritical Transesterification Processes / 10.5：
Alternative Processes for Biodiesel Production / 10.6：
Ultrasonic Processes / 10.6.1：
Microwave-Assisted Processes / 10.6.2：
Summary / 10.7：
Upgrading of Lipids to Hydrocarbon Fuels via (Hydro)deoxygenation / David Kubicka11：
Feedstocks / 11.1：
Chemistry / 11.3：
Technologies / 11.4：
Sulfided Catalysts / 11.5：
Metallic Catalysts / 11.5.2：
Metal Carbide, Nitride, and Phosphide Catalysts / 11.5.3：
Upgrading of Lipids to Fuel-like Hydrocarbons and Terminal Olefins via Decarbonylation/Decarboxylation / Ryan Loe and Eduardo Santillan-Jimenez and Mark Crocker11.6：
Lipid Feeds / 12.1：
deCOx Catalysts: Active Phases / 12.3：
deCOx Catalysts: Support Materials / 12.4：
Reaction Mechanism / 12.5：
Catalyst Deactivation / 12.7：
Conversion of Terpenes to Chemicals and Related Products / Anne E. Harman-Ware12.8：
Terpene Biosynthesis and Structure / 13.1：
Sources of Terpenes / 13.3：
Conifers and Other Trees / 13.3.1：
Essential Oils and Other Extracts / 13.3.2：
Isolation of Terpenes / 13.4：
Tapping and Extraction / 13.4.1：
Terpenes as a By-product of Pulping Processes / 13.4.2：
Historical Uses of Raw Terpenes / 13.5：
Adhesives and Turpentine / 13.5.1：
Flavors, Fragrances, Therapeutics, and Pharmaceutical Applications / 13.5.2：
Catalytic Methods for Conversion of Terpenes to Fine Chemicals and Materials / 13.6：
Homogeneous Processes / 13.6.1：
Hydration and Oxidation Reactions / 13.6.1.1：
Homogeneous Catalysis for the Epoxidation of Monoterpenes / 13.6.1.2：
Isomerizations / 13.6.1.3：
Production of Terpene Carbonates from CO2 and Epoxides / 13.6.1.4：
Polymers and Other Materials from Terpenes / 13.6.1.5：
"Click Chemistry" Routes for the Production of Materials and Medicinal Compounds from Terpenes / 13.6.1.6：
Heterogeneous Processes / 13.6.2：
Isomerization and Hydration of ¿-Pinene / 13.6.2.1：
Heterogeneous Catalysts for the Epoxidation of Monoterpenes / 13.6.2.2：
Isomerization of ¿-Pinene Oxide / 13.6.2.3：
Vitamins from Terpenes / 13.6.2.4：
Dehydrogenation and Hydrogenation Reactions of Terpenes / 13.6.2.5：
Conversion of Terpenes to Fuels / 13.6.2.6：
Conversion of Chitin to Nitrogen-containing Chemicals / Xi Chen and Ning Yan14：
Waste Shell Biorefinery / 14.1：
Production of Amines and Amides from Chitin Biomass / 14.2：
Sugar Amines/Amides / 14.2.1：
Furanic Amines/Amides / 14.2.2：
Polyol Amines/Amides / 14.2.3：
Production of N-heterocyclic Compounds from Chitin Biomass / 14.3：
Production of Carbohydrates and Acetic Acid from Chitin Biomass / 14.4：
Production of Advanced Products from Chitin Biomass / 14.5：
Conclusion / 14.6：
Index / Eduardo Santillan-Jimenez and Mark Crocker15：
Preface
Upgrading of Biomass via Catalytic Fast Pyrolysis (CFP) / Charles A. Mullen1：
Introduction / 1.1：
45.

電子ブック
ＥＢ
45. Dynamical Systems and Chaos
Henk Broer, Floris Takens
出版情報: SpringerLink Books - AutoHoldings , Springer New York, 2011
所蔵情報: loading…
目次情報: 続きを見る
Examples and definitions of dynamical phenomena / 1：
The pendulum as a dynamical system / 1.1：
The free pendulum / 1.1.1：
The free undamped pendulum / 1.1.1.1：
The free damped pendulum / 1.1.1.2：
The forced pendulum / 1.1.2：
Summary and outlook / 1.1.3：
General definition of dynamical systems / 1.2：
Differential equations / 1.2.1：
Constructions of dynamical systems / 1.2.2：
Restriction / 1.2.2.1：
Discretisation / 1.2.2.2：
Suspension and poincaré map / 1.2.2.3：
Further examples of dynamical systems / 1.3：
A Hopf bifurcation in the Van der Pol equation / 1.3.1：
The Van der Pol equation / 1.3.1.1：
Hopf bifurcation / 1.3.1.2：
The Hénon map: Saddle points and separatrices / 1.3.2：
The logistic system: Bifurcation diagrams / 1.3.3：
The Newton algorithm / 1.3.4：
R U {∞} as a circle: Stereographic projection / 1.3.4.1：
Applicability of the Newton algorithm / 1.3.4.2：
Nonconvergent Newton algorithm / 3.3.4.1：
Newton algorithm in higher dimensions
Dynamical systems defined by partial differential equations / 1.3.5：
The 1-dimensional wave equation / 1.3.5.1：
Solution of the 1-dimensional wave equation / 1.3.5.2：
The 1-dimensional heat equation / 3.3.5.3：
The Lorenz attractor / 1.3.6：
The Lorenz system; the Lorenz attractor / 1.3.6.1：
Sensitive dependence on initial state / 1.3.6.2：
The Rössler attractor; Poincaré map / 1.3.7：
The Rössler system / 1.3.7.1：
The attractor of the Poincaré map / 1.3.7.2：
The doubling map and chaos / 1.3.8：
The doubling map on the interval / 1.3.8.1：
The doubling map on the circle / 1.3.8.2：
The doubling map in symbolic dynamics / 1.3.8.3：
Analysis of the doubling map in symbolic form / 1.3.8.4：
General shifts / 1.3.9：
Exercises / 1.4：
Qualitative properties and predictability of evolutions / 2：
Stationary and periodic evolutions / 2.1：
Predictability of periodic and stationary motions / 2.1.1：
Asymptotically and eventually periodic evolutions / 2.1.2：
Multi- and quasi-periodic evolutions / 2.2：
The n-dimensional torus / 2.2.1：
Translations on a torus / 2.2.2：
Translation systems on the 1 -dimensional torus / 2.2.2.1：
Translation systems on the 2-dimensional torus with time set R / 2.2.2.2：
Translation systems on the n-dimensional torus with time set R / 2.2.2.3：
Translation systems on the n-dimensional torus with time set Z or Z+ / 2.2.2.4：
General definition of multi- and quasi-periodic evolutions / 2.2.3：
Multi- and quasi-periodic subsystems / 2.2.3.1：
Example: The driven Van der Pol equation / 2.2.3.2：
The prediction principle l'histoire se répète / 2.2.4：
The general principle / 2.2.4.1：
Application to quasi-periodic evolutions / 2.2.4.2：
Historical remarks / 2.2.5：
Chaotic evolutions / 2.3：
Badly predictable (chaotic) evolutions of the doubling map / 2.3.1：
Definition of dispersion exponent and chaos / 2.3.2：
Properties of the dispersion exponent / 2.3.3：
'Transition' from quasi-periodic to stochastic / 2.3.3.1：
'Transition' from periodic to chaotic / 2.3.3.2：
'Transition' from chaotic to stochastic / 2.3.3.3：
Chaotic evolutions in the examples of Chapter 1 / 2.3.4：
Chaotic evolutions of the Thom map / 2.3.5：
Persistence of dynamical properties / 2.4：
Variation of initial state / 3.1：
Variation of parameters / 3.2：
Persistence of stationary and periodic evolutions / 3.3：
Persistence of stationary evolutions / 3.3.1：
Persistence of periodic evolutions / 3.3.2：
Persistence for the doubling map / 3.4：
Perturbations of the doubling map: Persistent chaoticity / 3.4.1：
Structural stability / 3.4.2：
The doubling map modelling a (fair) coin / 3.4.3：
Global structure of dynamical systems / 3.5：
Definitions / 4.1：
Examples of attractors / 4.2：
The doubling map and hyperbolic attractors / 4.2.1：
The doubling map on the plane / 4.2.1.1：
The doubling map in 3-space: The solenoid / 4.2.1.2：
Digression on hyperbolicity / 4.2.1.3：
The solenoid as a hyperbolic attractor / 4.2.1.4：
Properties of hyperbolic attractors / 4.2.1.5：
Nonhyperbolic attractors / 4.2.2：
Hénon-like attractors / 4.2.2.1：
Chaotic systems / 4.2.2.2：
Basin boundaries and the horseshoe map / 4.4：
Gradient systems / 4.4.1：
The horseshoe map / 4.4.2：
Symbolic dynamics / 4.4.2.1：
Horseshoelike sets in basin boundaries / 4.4.2.2：
On KAM theory / 4.5：
Introduction, setting of the problem / 5.1：
KAM theory of circle maps / 5.2：
Preliminaries / 5.2.1：
Formal considerations and small divisors / 5.2.2：
Resonance tongues / 5.2.3：
KAM theory of area-preserving maps / 5.3：
KAM theory of holomorphic maps / 5.4：
Complex linearisation / 5.4.1：
Cremer's example in Herman's version / 5.4.2：
The linear small divisor problem / 5.5：
Motivation / 5.5.1：
Setting of the problem and formal solution / 5.5.2：
Convergence / 5.5.3：
Reconstruction and time series analysis / 5.6：
Introduction / 6.1：
An experimental example: The dripping faucet / 6.2：
The reconstruction theorem / 6.3：
Generalisations / 6.3.1：
Continuous time / 6.3.1.1：
Multidimensional measurements / 6.3.1.2：
Endomorphisms / 6.3.1.3：
Compactness / 6.3.1.4：
Historical note / 6.3.2：
Reconstruction and detecting determinism / 6.4：
Box-counting dimension and its numerical estimation / 6.4.1：
Numerical estimation of the box-counting dimension / 6.4.2：
Box-counting dimension as an indication for 'thin' subsets / 6.4.3：
Estimation of topological entropy / 6.4.4：
Stationarity and reconstruction measures / 6.5：
Probability measures defined by relative frequencies / 6.5.1：
Definition of stationarity and reconstruction measures / 6.5.2：
Examples of nonexistence of reconstruction measures / 6.5.3：
Correlation dimensions and entropies / 6.6：
Miscellaneous remarks / 6.6.1：
Compatibility of the definitions of dimension and entropy with reconstruction / 6.6.2.1：
Generalised correlation integrals, dimensions, and entropies / 6.6.2.2：
Numerical estimation of correlation integrals, dimensions, entropies / 6.7：
Classical time series analysis, correlation integrals, and predictability / 6.8：
Classical time series analysis / 6.8.1：
Optimal linear predictors / 6.8.1.1：
Gaussian time series / 6.8.1.2：
Determinism and Autocovariances / 6.8.2：
Predictability and correlation integrals / 6.8.3：
L'histoire se répète / 6.8.3.1：
Local linear predictors / 6.8.3.2：
Miscellaneous subjects / 6.9：
Lyapunov exponents / 6.9.1：
Estimation of Lyapunov exponents from a time series / 6.9.2：
The Kantz-Diks test: Discriminating between time series and testing for reversibility / 6.9.3：
Differential topology and measure theory / 6.10：
Topology / A.1：
Differentiable manifolds / A.2：
Measure theory / A.3：
Miscellaneous KAM theory / Appendix B：
Classical (conservative) KAM theory / B.1：
Dissipative KAM theory / B.3：
On the KAM proof in the dissipative case / B.4：
Reformulation and some notation / B.4.1：
On the Newtonian iteration / B.4.2：
Miscellaneous bifurcations / B.5：
Local bifurcations of low codimension / C.1：
Saddle-node bifurcation / C.1.1：
Period doubling bifurcation / C.1.2：
Hopf-Neimark-Sacker bifurcation / C.1.3：
The center-saddle bifurcation / C.1.5：
Quasi-periodic bifurcations / C.2：
The quasi-periodic center-saddle bifurcation / C.2.1：
The quasi-periodic Hopf bifurcation / C.2.2：
Transition to chaos / C.3：
Derivation of the Lorenz equations / C.4：
Geometry and flow of an incompressible fluid / D.1：
Heat transport and the influence of temperature / D.2：
Rayleigh stability analysis / D.3：
Restriction to a 3-dimensionaI state space / D.4：
Guide to the literature / Appendix E：
General references / E.1：
On ergodic theory / E.2：
On Hamiltonian dynamics / E.3：
On normal forms and bifurcations / E.4：
Bibliography
Index
Examples and definitions of dynamical phenomena / 1：
The pendulum as a dynamical system / 1.1：
The free pendulum / 1.1.1：
46.

電子ブック
ＥＢ
46. Computational complexity : a conceptual perspective (: electronic bk)
Oded Goldreich
出版情報:   1 online resource (xxiv, 606 p.)
所蔵情報: loading…
目次情報: 続きを見る
Introduction and preliminaries / 1：
P, NP and NP-completeness / 2：
Variations on P and NP / 3：
More resources, more power? / 4：
Space complexity / 5：
Randomness and counting / 6：
The bright side of hardness / 7：
Pseudorandom generators / 8：
Probabilistic proof systems / 9：
Relaxing the requirements / 10：
Epilogue
Glossary of complexity classes / A：
On the quest for lower bounds / B：
On the foundations of modern cryptography / C：
Probabilistic preliminaries and advanced topics in randomization / D：
Explicit constructions / E：
Some omitted proofs / F：
Some computational problems / G：
List of Figures
Preface
Organization and Chapter Summaries
Acknowledgments
Introduction and Preliminaries
Introduction / 1.1：
A Brief Overview of Complexity Theory / 1.1.1：
Characteristics of Complexity Theory / 1.1.2：
Contents of This Book / 1.1.3：
Approach and Style of This Book / 1.1.4：
Standard Notations and Other Conventions / 1.1.5：
Computational Tasks and Models / 1.2：
Representation / 1.2.1：
Computational Tasks / 1.2.2：
Uniform Models (Algorithms) / 1.2.3：
Non-uniform Models (Circuits and Advice) / 1.2.4：
Complexity Classes / 1.2.5：
Chapter Notes
P, NP, and NP-Completeness
The P Versus NP Question / 2.1：
The Search Version: Finding Versus Checking / 2.1.1：
The Decision Version: Proving Versus Verifying / 2.1.2：
Equivalence of the Two Formulations / 2.1.3：
Two Technical Comments Regarding NP / 2.1.4：
The Traditional Definition of NP / 2.1.5：
In Support of P Different from NP / 2.1.6：
Philosophical Meditations / 2.1.7：
Polynomial-Time Reductions / 2.2：
The General Notion of a Reduction / 2.2.1：
Reducing Optimization Problems to Search Problems / 2.2.2：
Self-Reducibility of Search Problems / 2.2.3：
Digest and General Perspective / 2.2.4：
NP-Completeness / 2.3：
Definitions / 2.3.1：
The Existence of NP-Complete Problems / 2.3.2：
Some Natural NP-Complete Problems / 2.3.3：
NP Sets That Are Neither in P nor NP-Complete / 2.3.4：
Reflections on Complete Problems / 2.3.5：
Three Relatively Advanced Topics / 2.4：
Promise Problems / 2.4.1：
Optimal Search Algorithms for NP / 2.4.2：
The Class coNP and Its Intersection with NP / 2.4.3：
Exercises
Non-uniform Polynomial Time (P/poly) / 3.1：
Boolean Circuits / 3.1.1：
Machines That Take Advice / 3.1.2：
The Polynomial-Time Hierarchy (PH) / 3.2：
Alternation of Quantifiers / 3.2.1：
Non-deterministic Oracle Machines / 3.2.2：
The P/poly Versus NP Question and PH / 3.2.3：
More Resources, More Power?
Non-uniform Complexity Hierarchies / 4.1：
Time Hierarchies and Gaps / 4.2：
Time Hierarchies / 4.2.1：
Time Gaps and Speedup / 4.2.2：
Space Hierarchies and Gaps / 4.3：
Space Complexity
General Preliminaries and Issues / 5.1：
Important Conventions / 5.1.1：
On the Minimal Amount of Useful Computation Space / 5.1.2：
Time Versus Space / 5.1.3：
Circuit Evaluation / 5.1.4：
Logarithmic Space / 5.2：
The Class L / 5.2.1：
Log-Space Reductions / 5.2.2：
Log-Space Uniformity and Stronger Notions / 5.2.3：
Undirected Connectivity / 5.2.4：
Non-deterministic Space Complexity / 5.3：
Two Models / 5.3.1：
NL and Directed Connectivity / 5.3.2：
A Retrospective Discussion / 5.3.3：
PSPACE and Games / 5.4：
Randomness and Counting
Probabilistic Polynomial Time / 6.1：
Basic Modeling Issues / 6.1.1：
Two-Sided Error: The Complexity Class BPP / 6.1.2：
One-Sided Error: The Complexity Classes RP and coRP / 6.1.3：
Zero-Sided Error: The Complexity Class ZPP / 6.1.4：
Randomized Log-Space / 6.1.5：
Counting / 6.2：
Exact Counting / 6.2.1：
Approximate Counting / 6.2.2：
Searching for Unique Solutions / 6.2.3：
Uniform Generation of Solutions / 6.2.4：
The Bright Side of Hardness
One-Way Functions / 7.1：
Generating Hard Instances and One-Way Functions / 7.1.1：
Amplification of Weak One-Way Functions / 7.1.2：
Hard-Core Preicates / 7.1.3：
Reflections on Hardness Amplification / 7.1.4：
Hard Problems in E / 7.2：
Amplification with Respect to Polynomial-Size Circuits / 7.2.1：
Amplification with Respect to Exponential-Size Circuits / 7.2.2：
Pseudorandom Generators
The General Paradigm / 8.1：
General-Purpose Pseudorandom Generators / 8.2：
The Basic Definition / 8.2.1：
The Archetypical Application / 8.2.2：
Computational Indistinguishability / 8.2.3：
Amplifying the Stretch Function / 8.2.4：
Constructions / 8.2.5：
Non-uniformly Strong Pseudorandom Generators / 8.2.6：
Stronger Notions and Conceptual Reflections / 8.2.7：
Derandomization of Time-Complexity Classes / 8.3：
Defining Canonical Derandomizers / 8.3.1：
Constructing Canonical Derandomizers / 8.3.2：
Technical Variations and Conceptual Reflections / 8.3.3：
Space-Bounded Distinguishers / 8.4：
Definitional Issues / 8.4.1：
Two Constructions / 8.4.2：
Special-Purpose Generators / 8.5：
Pairwise Independence Generators / 8.5.1：
Small-Bias Generators / 8.5.2：
Random Walks on Expanders / 8.5.3：
Probabilistic Proof Systems
Interactive Proof Systems / 9.1：
Motivation and Perspective / 9.1.1：
Definition / 9.1.2：
The Power of Interactive Proofs / 9.1.3：
Variants and Finer Structure: An Overview / 9.1.4：
On Computationally Bounded Provers: An Overview / 9.1.5：
Zero-Knowledge Proof Systems / 9.2：
The Power of Zero-Knowledge / 9.2.1：
Proofs of Knowledge - A Parenthetical Subsection / 9.2.3：
Probabilistically Checkable Proof Systems / 9.3：
The Power of Probabilistically Checkable Proofs / 9.3.1：
PCP and Approximation / 9.3.3：
More on PCP Itself: An Overview / 9.3.4：
Relaxing the Requirements
Approximation / 10.1：
Search or Optimization / 10.1.1：
Decision or Property Testing / 10.1.2：
Average-Case Complexity / 10.2：
The Basic Theory / 10.2.1：
Ramifications / 10.2.2：
Glossary of Complexity Classes / Appendix A：
Preliminaries / A.1：
Algorithm-Based Classes / A.2：
Time Complexity Classes / A.2.1：
Space Complexity Classes / A.2.2：
Circuit-Based Classes / A.3：
On the Quest for Lower Bounds / Appendix B：
Boolean Circuit Complexity / B.1：
Basic Results and Questions / B.2.1：
Monotone Circuits / B.2.2：
Bounded-Depth Circuits / B.2.3：
Formula Size / B.2.4：
Arithmetic Circuits / B.3：
Univariate Polynomials / B.3.1：
Multivariate Polynomials / B.3.2：
Proof Complexity / B.4：
Logical Proof Systems / B.4.1：
Algebraic Proof Systems / B.4.2：
Geometric Proof Systems / B.4.3：
On the Foundations of Modern Cryptography / Appendix C：
The Underlying Principles / C.1：
The Computational Model / C.1.2：
Organization and Beyond / C.1.3：
Computational Difficulty / C.2：
Hard-Core Predicates / C.2.1：
Pseudorandomness / C.3：
Pseudorandom Functions / C.3.1：
Zero-Knowledge / C.4：
The Simulation Paradigm / C.4.1：
The Actual Definition / C.4.2：
A General Result and a Generic Application / C.4.3：
Definitional Variations and Related Notions / C.4.4：
Encryption Schemes / C.5：
Beyond Eavesdropping Security / C.5.1：
Signatures and Message Authentication / C.6：
General Cryptographic Protocols / C.6.1：
The Definitional Approach and Some Models / C.7.1：
Some Known Results / C.7.2：
Construction Paradigms and Two Simple Protocols / C.7.3：
Concluding Remarks / C.7.4：
Probabilistic Preliminaries and Advanced Topics in Randomization / Appendix D：
Probabilistic Preliminaries / D.1：
Notational Conventions / D.1.1：
Three Inequalities / D.1.2：
Hashing / D.2：
The Leftover Hash Lemma / D.2.1：
Sampling / D.3：
Formal Setting / D.3.1：
Known Results / D.3.2：
Hitters / D.3.3：
Randomnes Extractors / D.4：
Definitions and Various Perspectives / D.4.1：
Explicit Constructions / D.4.2：
Error-Correcting Codes / E.1：
Basic Notions / E.1.1：
A Few Popular Codes / E.1.2：
Two Additional Computational Problems / E.1.3：
A List-Decoding Bound / E.1.4：
Expander Graphs / E.2：
Definitions and Properties / E.2.1：
Some Omitted Proofs / E.2.2：
Proving That PH Reduces to #P / F.1：
Proving That IP(f) [characters not reproducible] AM(O(f)) [characters not reproducible] AM(f) / F.2：
Emulating General Interactive Proofs by AM-Games / F.2.1：
Linear Speedup for AM / F.2.2：
Some Computational Problems / Appendix G：
Graphs / G.1：
Boolean Formulae / G.2：
Finite Fields, Polynomials, and Vector Spaces / G.3：
The Determinant and the Permanent / G.4：
Primes and Composite Numbers / G.5：
Bibliography
Index
Introduction and preliminaries / 1：
P, NP and NP-completeness / 2：
Variations on P and NP / 3：
47.

電子ブック
ＥＢ
47. 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：
48.

電子ブック
ＥＢ
48. 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：
49.

電子ブック
ＥＢ
49. Spyware and Adware
John Daniel Aycock
出版情報: Springer eBooks Computer Science , Springer US, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Definitions and History / 1.1：
Motivation / 1.2：
Getting There / 2：
Installation / 2.1：
Explicit, Voluntary Installation / 2.1.1：
Drive-by Downloads, User Involvement / 2.1.2：
Drive-by Downloads, No User Involvement / 2.1.3：
Installation via Malware / 2.1.4：
Startup / 2.2：
Application-Specific Startup / 2.2.1：
GUI Startup / 2.2.2：
System Startup / 2.2.3：
Kernel Startup / 2.2.4：
Defenses / 2.2.5：
Staying There / 3：
Avoiding Detection / 3.1：
Basic Detection Avoidance / 3.1.1：
Anti-Spyware / 3.1.2：
Advanced Detection Avoidance: Rootkits / 3.1.3：
Avoiding Uninstall / 3.2：
Passive Avoidance / 3.2.1：
Active Avoidance / 3.2.2：
Keylogging / 4：
User Space Keylogging / 4.1：
Polling / 4.1.1：
Event Copying / 4.1.2：
Event Monitoring / 4.1.3：
User Space Keylogging Defenses / 4.2：
Authentication / 4.3：
Phoning Home / 5：
Push vs. Pull / 5.1：
Finding Home / 5.2：
Steganography / 5.3：
Information Leaking Defenses / 5.4：
Advertising / 6：
Types of Advertisement / 6.1：
Banner Advertisement / 6.1.1：
Banner Advertisement with Pull-down Menu / 6.1.2：
Expandable Banner Advertisement / 6.1.3：
Pushdown Banner Advertisement / 6.1.4：
Pop-up Advertisement / 6.1.5：
Pop-under Advertisement / 6.1.6：
Floating Advertisement / 6.1.7：
Tear-back Advertisement / 6.1.8：
In-text Advertisement / 6.1.9：
Transition Advertisement / 6.1.10：
Video Advertisements / 6.1.11：
Intent and Content / 6.2：
Advertisement Implementation / 7：
Implementation Location / 7.1：
Implementation on the User Machine / 7.1.1：
Implementation in the Network / 7.1.2：
Implementation near the User Machine / 7.1.3：
Implementation on the Server / 7.1.4：
Choosing Keywords / 7.2：
Blocking Advertisements / 7.3：
Pop-up Blocking / 7.3.1：
General Advertisement Blocking / 7.3.2：
Blocker Evasion and Blocker Blocking / 7.3.3：
Tracking Users
Cookies / 8.1：
Other Browser-Related Tracking Methods / 8.1.1：
User Profiling / 8.2：
Cognitive Styles, Mood, and Personality / 8.2.1：
Future Actions / 8.2.2：
Demographic Information / 8.2.3：
Social Networks / 8.2.4：
Real World Activities / 8.2.5：
Physical of Location / 8.2.6：
Search Terms and keywords / 8.2.7：
Disinterests / 8.2.8：
Conclusion / 9：
References
Index
Introduction / 1：
Definitions and History / 1.1：
Motivation / 1.2：
50.

電子ブック
ＥＢ
50. 2nd Workshop on Specialty Optical Fibers and Their Applications (WSOF-2)
Hern??ndez-cordero
出版情報: SPIE Digital Library Proceedings , 2010
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼