1.
図書
Maxim Ryadnov
目次情報:
続きを見る
Introductory Notes / Chapter 1：
Inspiring Hierarchical / 1.1：
Encoding Instructive / 1.2：
Starting Lowest / 1.3：
Picturing Biological / 1.4：
References
Recycling Hereditary / Chapter 2：
Coding Dual / 2.1：
Deoxyribonucleic / 2.1.1：
Building up in Two / 2.1.1.1：
Keeping in Shape / 2.1.1.2：
Priming Topological / 2.1.2：
Resequencing Basic / 2.1.2.1：
Choosing the Fittest / 2.1.2.1.1：
Evolving Diverse / 2.1.2.1.2：
Primary Motifs / 2.1.2.2：
Gluing Universal / 2.1.2.2.1：
Alienating Axial / 2.1.2.2.2：
Fixing Spatial / 2.2：
Hinting Geometric: Secondary Motifs / 2.2.1：
Crossing Double / 2.2.1.1：
Reporting Visible / 2.2.1.1.1：
Translating Symmetrical / 2.2.1.1.2：
Extending Cohesive / 2.2.1.2：
Sharing Mutual / 2.2.1.2.1：
Multiplying Traversal / 2.2.1.2.2：
Tiling Square / 2.2.1.2.3：
Scaffolding Algorithmic / 2.3：
Pursuing Autonomous / 2.3.1：
Lengthening to Shorten / 2.3.1.1：
Gathering to Limit / 2.3.1.2：
Assigning Arbitrary / 2.3.2：
Synchronising Local / 2.3.2.1：
Prescribing General / 2.3.2.2：
Adding up to Third / 2.3.3：
Wrapping to Shut / 2.3.3.1：
Framing to Classify / 2.3.3.2：
Outlook / 2.4：
Recaging Within / Chapter 3：
Enclosing to Deliver / 3.1：
Transporting Foreign / 3.1.1：
Fitting Flat and Straight / 3.1.1.1：
Spiralling Along / 3.1.1.2：
Packing Out and In / 3.1.2：
Spooling Around / 3.1.2.1：
Tunnelling Through
Escaping Walled / 3.1.3：
Capturing On and Off / 3.1.3.1：
Storing Exchangeable / 3.1.3.2：
Reacting Nano / 3.2：
Clustering Spherical / 3.2.1：
Contriving Consistent / 3.2.1.1：
Scaling Hosting / 3.2.1.2：
Following Linear / 3.2.2：
Channelling Inner
Converting Outer
Repairing from Inside / 3.3：
Uninviting Levy / 3.3.1：
Necessitating Exterior / 3.3.2：
Antagonising Dressing / 3.3.2.1：
Renting Occasional / 3.3.2.1.2：
Phasing West / 3.3.2.2：
Facing Concentric / 3.3.2.2.1：
Encircling Between / 3.3.2.2.2：
Singling Out Unique / 3.3.2.2.3：
Sharing the Balance / 3.3.3：
Driving Symmetrical / 3.3.3.1：
Sealing Annular / 3.3.3.2：
Reassembling Multiple / 3.4：
Keeping All in Touch / 4.1：
Unravelling the Essential / 4.1.1：
Winding Three in One / 4.1.1.1：
Aligning Stagger / 4.1.1.2：
Tapering Polar / 4.1.1.3：
Branching and Stretching / 4.1.1.4：
Replicating Apparent / 4.1.2：
Scraping Refusal / 4.1.2.1：
Tempting Compatible / 4.1.2.2：
Likening Synthetic / 4.1.2.3：
Recovering Intelligent / 4.1.2.4：
Restoring Available / 4.2：
Prompting Longitudinal / 4.2.1：
Invoking Granted / 4.2.1.1：
Reposing Modular / 4.3：
Displacing Coil / 4.3.1：
Settling Lateral / 4.3.2：
Bundling Exclusive / 4.3.2.1：
Permitting Distinctive / 4.3.2.2：
Inviting Captive / 4.3.2.3：
Clearing Limiting / 4.3.3：
Equilibrating Transitional / 4.3.3.1：
Extracting Minimal / 4.3.3.2：
Gambling Beyond / 4.4：
Guiding Proliferative / 4.4.1：
Feeding Proximate / 4.4.1.1：
Rooting Renewal / 4.4.1.2：
Accepting Inescapable / 4.4.2：
Patterning Positional / 4.4.2.1：
Relating Interfacial / 4.4.2.2：
Grafting Integral / 4.4.2.3：
Concluding Remarks / 4.5：
Learning Fluent / 5.1：
Parsing Semantic / 5.2：
Drawing Pragmatic / 5.3：
Revealing Contributory / Chapter 6：
Subject Index
Introductory Notes / Chapter 1：
Inspiring Hierarchical / 1.1：
Encoding Instructive / 1.2：
2.
ＥＢ
Kim-Kwang Raymond Choo
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
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.
ＥＢ
Kim-Kwang Raymond Choo
出版情報:
SpringerLink Books - AutoHoldings , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
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.
ＥＢ
Abhishek Singh., Abhishek Singh, Baibhav Singh
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
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：
5.
ＥＢ
Abhishek Singh., Abhishek Singh, Baibhav Singh
出版情報:
SpringerLink Books - AutoHoldings , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
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：
6.
ＥＢ
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…
所蔵情報:
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：
7.
ＥＢ
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…
所蔵情報:
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：
8.
ＥＢ
Gian Piero Zarri
出版情報:
Springer eBooks Computer Science , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
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：
9.
ＥＢ
Gian Piero Zarri
出版情報:
SpringerLink Books - AutoHoldings , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
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：
10.
ＥＢ
Kathryn E. Merrick, Mary Lou Maher
出版情報:
Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
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：
11.
ＥＢ
Kathryn E. Merrick, Mary Lou Maher
出版情報:
SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
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：
12.
図書
M. Hinze ... [et al.]
目次情報:
続きを見る
Preface
Analytical Background and Optimality Theory / 1：
Stefan Ulbrich
Introduction and Examples / 1.1：
Introduction / 1.1.1：
Examples for Optimization Problems with PDEs / 1.1.2：
Optimization of a Stationary Heating Process / 1.1.3：
Optimization of an Unsteady Heating Processes / 1.1.4：
Optimal Design / 1.1.5：
Linear Functional Analysis and Sobolev Spaces / 1.2：
Banach and Hilbert Spaces / 1.2.1：
Sobolev Spaces / 1.2.2：
Weak Convergence / 1.2.3：
Weak Solutions of Elliptic and Parabolic PDEs / 1.3：
Weak Solutions of Elliptic PDEs / 1.3.1：
Weak Solutions of Parabolic PDEs / 1.3.2：
Gateaux- and Fréchet Differentiability / 1.4：
Basic Definitions / 1.4.1：
Implicit Function Theorem / 1.4.2：
Existence of Optimal Controls / 1.5：
Existence Result for a General Linear-Quadratic Problem / 1.5.1：
Existence Result for Nonlinear Problems / 1.5.2：
Applications / 1.5.3：
Reduced Problem, Sensitivities and Adjoints / 1.6：
Sensitivity Approach / 1.6.1：
Adjoint Approach / 1.6.2：
Application to a Linear-Quadratic Optimal Control Problem / 1.6.3：
A Lagrangian-Based View of the Adjoint Approach / 1.6.4：
Second Derivatives / 1.6.5：
Optimality Conditions / 1.7：
Optimality Conditions for Simply Constrained Problems / 1.7.1：
Optimality Conditions for Control-Constrained Problems / 1.7.2：
Optimality Conditions for Problems with General Constraints / 1.7.3：
Optimal Control of Instationary Incompressible Navier-Stokes Flow / 1.8：
Functional Analytic Setting / 1.8.1：
Analysis of the Flow Control Problem / 1.8.2：
Reduced Optimal Control Problem / 1.8.3：
Optimization Methods in Banach Spaces / 2：
Michael Ulbrich
Synopsis / 2.1：
Globally Convergent Methods in Banach Spaces / 2.2：
Unconstrained Optimization / 2.2.1：
Optimization on Closed Convex Sets / 2.2.2：
General Optimization Problems / 2.2.3：
Newton-Based Methods-A Preview / 2.3：
Unconstrained Problems-Newton's Method / 2.3.1：
Simple Constraints / 2.3.2：
General Inequality Constraints / 2.3.3：
Generalized Newton Methods / 2.4：
Motivation: Application to Optimal Control / 2.4.1：
A General Superlinear Convergence Result / 2.4.2：
The Classical Newton's Method / 2.4.3：
Generalized Differential and Semismoothness / 2.4.4：
Semismooth Newton Methods / 2.4.5：
Semismooth Newton Methods in Function Spaces / 2.5：
Semismoothness of Superposition Operators / 2.5.1：
Application to Optimal Control / 2.5.3：
Application to Elliptic Optimal Control Problems / 2.5.5：
Optimal Control of the Incompressible Navier-Stokes Equations / 2.5.7：
Sequential Quadratic Programming / 2.6：
Lagrange-Newton Methods for Equality Constrained Problems / 2.6.1：
The Josephy-Newton Method / 2.6.2：
SQP Methods for Inequality Constrained Problems / 2.6.3：
State-Constrained Problems / 2.7：
SQP Methods / 2.7.1：
Further Aspects / 2.7.2：
Mesh Independence / 2.8.1：
Application of Fast Solvers / 2.8.2：
Other Methods / 2.8.3：
Discrete Concepts in PDE Constrained Optimization / 3：
Michael Hinze
Control Constraints / 3.1：
Stationary Model Problem / 3.2.1：
First Discretize, Then Optimize / 3.2.2：
First Optimize, Then Discretize / 3.2.3：
Discussion and Implications / 3.2.4：
The Variational Discretization Concept / 3.2.5：
Error Estimates / 3.2.6：
Boundary Control / 3.2.7：
Some Literature Related to Control Constraints / 3.2.8：
Constraints on the State / 3.3：
Pointwise Bounds on the State / 3.3.1：
Pointwise Bounds on the Gradient of the State / 3.3.2：
Time Dependent Problem / 3.4：
Mathematical Model, State Equation / 3.4.1：
Optimization Problem / 3.4.2：
Discretization / 3.4.3：
Further Literature on Control of Time-Dependent Problems / 3.4.4：
Rene Pinnau / 4：
Optimal Semiconductor Design / 4.1：
Semiconductor Device Physics / 4.1.1：
The Optimization Problem / 4.1.2：
Numerical Results / 4.1.3：
Optimal Control of Glass Cooling / 4.2：
Modeling / 4.2.1：
Optimal Boundary Control / 4.2.2：
References / 4.2.3：
Preface
Analytical Background and Optimality Theory / 1：
Stefan Ulbrich
13.
ＥＢ
Hartmut Obendorf
出版情報:
Springer eBooks Computer Science , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
Machine Beauty = Power + Simplicity / 1.1.1：
Reduction-Give Up or Gain? / 1.1.2：
Minimalism: Borrowing the Extreme from the Arts / 1.1.3：
Minimalism in a Nutshell / 1.2：
Four Notions of Minimalism, Their Relationship, and Design / 1.2.1：
An Example Analysis Using Notions of Minimalism / 1.2.2：
Minimalism, Products, and Processes / 1.2.3：
Defining the Scope of Minimalist Terminology / 1.3：
Minimalism-Mathematic Minimalism / 1.3.1：
Minimalism-Linguistic Minimalism / 1.3.2：
Minimalism-Documentation Minimalism / 1.3.3：
Minimalism-Folk Minimalism / 1.3.4：
Finding a Minimalism for Interaction Design / 1.4：
References
Defining Minimalism / Part II：
In Search of "Minimalism"-Roving in Art, Music and Elsewhere / 2：
Minimalism in the Arts / 2.1：
Rauschenberg, Klein and Newman: Birth of Minimal Painting / 2.1.1：
Reinhardt: Art-as-Art / 2.1.2：
Stella: To See What Is There / 2.1.3：
Radical Minimalism and Post-Minimalist Painting / 2.1.4：
Judd, Andre, Flavin, and Morris: Minimal Objects / 2.1.5：
LeWitt: Minimal Structure in Minimalist Sculpture / 2.1.6：
Post-Minimalist Sculpture / 2.1.7：
Minimal Art: Art as Art or Cooperative Sense-Building? / 2.1.8：
Minimalism in Music / 2.2：
The Origins of Minimal Music / 2.2.1：
Terry Riley / 2.2.2：
La Monte Young / 2.2.3：
Philip Glass / 2.2.4：
Steve Reich / 2.2.5：
Summarizing Minimalism in Music / 2.2.6：
Minimalism Found Elsewhere / 2.3：
Literary Minimalism: Roots in Hemingway, Archetype in Carver / 2.3.1：
Minimalism in Architecture / 2.3.2：
Minimalism in Typography / 2.3.3：
Homing in on Minimalism: Summarizing the Art perspective / 2.4：
Minimality of Means / 2.4.1：
Minimality of Meaning / 2.4.2：
Minimality of Structure / 2.4.3：
Use of Patterns / 2.4.4：
Involvement of the recipient / 2.4.5：
The Minimalist Perspective and Criticism / 2.4.6：
Minimalism for Interaction Design: a Proposal / 3：
Meanings of Minimalism in HCI-A Transfer from the Arts / 3.1：
Defining Four Notions of the Minimal for Interaction Design / 3.2：
Minimal Functionality for User Interfaces / 3.2.1：
Minimal Structure for User Interfaces / 3.2.2：
Minimal Architecture for User Interfaces / 3.2.3：
Minimal Composition for User Interfaces / 3.2.4：
A Minimalist Terminology for the Design of Interactive Systems / 3.2.5：
Summary / 3.3：
Rethinking Minimalism / Part III：
Minimalism, Industrial Design and HCI / 4：
Following the Roots in Industrial Design / 4.1：
Standards in Interaction Design and Minimalism / 4.2：
HCI Lore and Minimalism / 4.3：
Rules of Noble Metal and Minimalism / 4.3.1：
Interface Guidelines and Minimalism / 4.3.2：
Discussion / 4.3.3：
Minimalism, Simplicity and Rules of Design / 4.4：
Deep Design: Causes of Clutter and Excise / 5.1：
Visibility of Interface Elements / 5.2：
Access Structure / 5.3：
Minimalism and Consistency / 5.4：
Minimalism and Conceptions of Design / 5.5：
Minimalism and Simplicity / 5.6：
Limits of the Notion of Simplicity / 5.6.1：
Revisiting the Four Notions of Minimalism / 5.7：
Applying Minimalism / Part IV：
Detecting the Minimal / 6：
Functional Minimalism / 6.1：
Cutting Edges / 6.1.1：
Apple GarageBand (i-Series 1) / 6.1.2：
The CommSy Community System / 6.1.3：
Word Processing / 6.1.4：
Refining the Notion of Functional Minimalism / 6.1.5：
Structural Minimalism / 6.2：
Remote Controls / 6.2.1：
The Palm Handheld / 6.2.2：
Minimal Access Structures for Mobile Communication / 6.2.3：
HyperScout: Enhancing Link Preview in the World Wide Web / 6.2.4：
World Processing / 6.2.5：
Refining the Notion of Structural Minimalism / 6.2.6：
Architectural Minimalism / 6.3：
Building Blocks / 6.3.1：
Apple Automator (i-Series 2) / 6.3.2：
Sketch Up / 6.3.3：
Apple iPod / 6.3.4：
Web 2.0 / 6.3.5：
Refining the Notion of Architectural Minimalism / 6.3.6：
Compositional Minimalism / 6.4：
Old Buildings Learn / 6.4.1：
A Sticky Story: The Post-it Note / 6.4.2：
E-mail / 6.4.3：
PowerPoint / 6.4.4：
WikiWikiWebs / 6.4.5：
Refining the Notion of Compositional Minimalism / 6.4.6：
Reflections on the Four Notions of Minimalism / 6.5：
A First Assessment of Suitability for the Analysis of Products / 6.5.1：
Design Advice / 6.5.2：
Designing the Minimal / 7：
Process Matters / 7.1：
A Direct Approach: Reduction as a Design Activity / 7.2：
The Minimal Design Game / 7.2.1：
First Experiences / 7.2.2：
The Indirect Approach: Changing the Process / 7.2.3：
Scoping Reduction / 7.3.1：
Defining Scope: Using Personas / 7.4：
Personas and Notions of Minimalism / 7.4.1：
Reduction and the Use of Personas / 7.4.2：
Defining Use: Scenario Techniques / 7.5：
Scenarios and Notions of Minimalism / 7.5.1：
Scenario-Based Design / 7.5.2：
Reduction and the Use of Scenarios / 7.5.3：
Defining Architecture: Small Steps and Agile Methods / 7.6：
Simplicity in Software Engineering / 7.6.1：
Minimalism in Agile Development / 7.6.2：
Reduction in Agile Methods / 7.6.3：
Defining Growth: Using Values in Design / 7.7：
Values in Software / 7.7.1：
Case Study: CommSy-Designing with Values / 7.7.2：
Sharing Explicit Values in Communities of Interest / 7.7.3：
Reduction in Value-Based Development / 7.7.4：
Engineering Simplicity? A Reality Check / 7.8：
Reflections on Minimalism / Part V：
Minimalism Revisited / 8：
The Minimal Perspective on Design / 8.1：
Minimalism as an Analytic Tool / 8.2：
Minimalism as a Constructive Tool / 8.3：
A Minimalist Design Method: The Minimal Design Game / 8.3.1：
Indirect Minimalism in Existing Methods / 8.3.2：
Refining the Definition of Minimalism / 8.4：
Functional Minimalism Revisited / 8.4.1：
Structural Minimalism Revisited / 8.4.2：
Architectural Minimalism Revisited / 8.4.3：
Compositional Minimalism Revisited / 8.4.4：
Implications of a Minimalist Standpoint for Design / 8.5：
Minimal Aesthetics / 9：
Unconnected Ends / 10：
Conclusion / 11：
Index
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
14.
ＥＢ
Hartmut Obendorf
出版情報:
SpringerLink Books - AutoHoldings , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
Machine Beauty = Power + Simplicity / 1.1.1：
Reduction-Give Up or Gain? / 1.1.2：
Minimalism: Borrowing the Extreme from the Arts / 1.1.3：
Minimalism in a Nutshell / 1.2：
Four Notions of Minimalism, Their Relationship, and Design / 1.2.1：
An Example Analysis Using Notions of Minimalism / 1.2.2：
Minimalism, Products, and Processes / 1.2.3：
Defining the Scope of Minimalist Terminology / 1.3：
Minimalism-Mathematic Minimalism / 1.3.1：
Minimalism-Linguistic Minimalism / 1.3.2：
Minimalism-Documentation Minimalism / 1.3.3：
Minimalism-Folk Minimalism / 1.3.4：
Finding a Minimalism for Interaction Design / 1.4：
References
Defining Minimalism / Part II：
In Search of "Minimalism"-Roving in Art, Music and Elsewhere / 2：
Minimalism in the Arts / 2.1：
Rauschenberg, Klein and Newman: Birth of Minimal Painting / 2.1.1：
Reinhardt: Art-as-Art / 2.1.2：
Stella: To See What Is There / 2.1.3：
Radical Minimalism and Post-Minimalist Painting / 2.1.4：
Judd, Andre, Flavin, and Morris: Minimal Objects / 2.1.5：
LeWitt: Minimal Structure in Minimalist Sculpture / 2.1.6：
Post-Minimalist Sculpture / 2.1.7：
Minimal Art: Art as Art or Cooperative Sense-Building? / 2.1.8：
Minimalism in Music / 2.2：
The Origins of Minimal Music / 2.2.1：
Terry Riley / 2.2.2：
La Monte Young / 2.2.3：
Philip Glass / 2.2.4：
Steve Reich / 2.2.5：
Summarizing Minimalism in Music / 2.2.6：
Minimalism Found Elsewhere / 2.3：
Literary Minimalism: Roots in Hemingway, Archetype in Carver / 2.3.1：
Minimalism in Architecture / 2.3.2：
Minimalism in Typography / 2.3.3：
Homing in on Minimalism: Summarizing the Art perspective / 2.4：
Minimality of Means / 2.4.1：
Minimality of Meaning / 2.4.2：
Minimality of Structure / 2.4.3：
Use of Patterns / 2.4.4：
Involvement of the recipient / 2.4.5：
The Minimalist Perspective and Criticism / 2.4.6：
Minimalism for Interaction Design: a Proposal / 3：
Meanings of Minimalism in HCI-A Transfer from the Arts / 3.1：
Defining Four Notions of the Minimal for Interaction Design / 3.2：
Minimal Functionality for User Interfaces / 3.2.1：
Minimal Structure for User Interfaces / 3.2.2：
Minimal Architecture for User Interfaces / 3.2.3：
Minimal Composition for User Interfaces / 3.2.4：
A Minimalist Terminology for the Design of Interactive Systems / 3.2.5：
Summary / 3.3：
Rethinking Minimalism / Part III：
Minimalism, Industrial Design and HCI / 4：
Following the Roots in Industrial Design / 4.1：
Standards in Interaction Design and Minimalism / 4.2：
HCI Lore and Minimalism / 4.3：
Rules of Noble Metal and Minimalism / 4.3.1：
Interface Guidelines and Minimalism / 4.3.2：
Discussion / 4.3.3：
Minimalism, Simplicity and Rules of Design / 4.4：
Deep Design: Causes of Clutter and Excise / 5.1：
Visibility of Interface Elements / 5.2：
Access Structure / 5.3：
Minimalism and Consistency / 5.4：
Minimalism and Conceptions of Design / 5.5：
Minimalism and Simplicity / 5.6：
Limits of the Notion of Simplicity / 5.6.1：
Revisiting the Four Notions of Minimalism / 5.7：
Applying Minimalism / Part IV：
Detecting the Minimal / 6：
Functional Minimalism / 6.1：
Cutting Edges / 6.1.1：
Apple GarageBand (i-Series 1) / 6.1.2：
The CommSy Community System / 6.1.3：
Word Processing / 6.1.4：
Refining the Notion of Functional Minimalism / 6.1.5：
Structural Minimalism / 6.2：
Remote Controls / 6.2.1：
The Palm Handheld / 6.2.2：
Minimal Access Structures for Mobile Communication / 6.2.3：
HyperScout: Enhancing Link Preview in the World Wide Web / 6.2.4：
World Processing / 6.2.5：
Refining the Notion of Structural Minimalism / 6.2.6：
Architectural Minimalism / 6.3：
Building Blocks / 6.3.1：
Apple Automator (i-Series 2) / 6.3.2：
Sketch Up / 6.3.3：
Apple iPod / 6.3.4：
Web 2.0 / 6.3.5：
Refining the Notion of Architectural Minimalism / 6.3.6：
Compositional Minimalism / 6.4：
Old Buildings Learn / 6.4.1：
A Sticky Story: The Post-it Note / 6.4.2：
E-mail / 6.4.3：
PowerPoint / 6.4.4：
WikiWikiWebs / 6.4.5：
Refining the Notion of Compositional Minimalism / 6.4.6：
Reflections on the Four Notions of Minimalism / 6.5：
A First Assessment of Suitability for the Analysis of Products / 6.5.1：
Design Advice / 6.5.2：
Designing the Minimal / 7：
Process Matters / 7.1：
A Direct Approach: Reduction as a Design Activity / 7.2：
The Minimal Design Game / 7.2.1：
First Experiences / 7.2.2：
The Indirect Approach: Changing the Process / 7.2.3：
Scoping Reduction / 7.3.1：
Defining Scope: Using Personas / 7.4：
Personas and Notions of Minimalism / 7.4.1：
Reduction and the Use of Personas / 7.4.2：
Defining Use: Scenario Techniques / 7.5：
Scenarios and Notions of Minimalism / 7.5.1：
Scenario-Based Design / 7.5.2：
Reduction and the Use of Scenarios / 7.5.3：
Defining Architecture: Small Steps and Agile Methods / 7.6：
Simplicity in Software Engineering / 7.6.1：
Minimalism in Agile Development / 7.6.2：
Reduction in Agile Methods / 7.6.3：
Defining Growth: Using Values in Design / 7.7：
Values in Software / 7.7.1：
Case Study: CommSy-Designing with Values / 7.7.2：
Sharing Explicit Values in Communities of Interest / 7.7.3：
Reduction in Value-Based Development / 7.7.4：
Engineering Simplicity? A Reality Check / 7.8：
Reflections on Minimalism / Part V：
Minimalism Revisited / 8：
The Minimal Perspective on Design / 8.1：
Minimalism as an Analytic Tool / 8.2：
Minimalism as a Constructive Tool / 8.3：
A Minimalist Design Method: The Minimal Design Game / 8.3.1：
Indirect Minimalism in Existing Methods / 8.3.2：
Refining the Definition of Minimalism / 8.4：
Functional Minimalism Revisited / 8.4.1：
Structural Minimalism Revisited / 8.4.2：
Architectural Minimalism Revisited / 8.4.3：
Compositional Minimalism Revisited / 8.4.4：
Implications of a Minimalist Standpoint for Design / 8.5：
Minimal Aesthetics / 9：
Unconnected Ends / 10：
Conclusion / 11：
Index
Designing for an Age of Complexity / Part I：
Minimalism: Introduction and Synopsis / 1：
Motivations for Minimalism in HCI / 1.1：
15.
ＥＢ
Stefano Crespi Reghizzi
出版情報:
Springer eBooks Computer Science , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
Syntax / 2：
Artificial and Formal Languages / 2.1：
Language Types / 2.1.2：
Chapter Outline / 2.1.3：
Formal Language Theory / 2.2：
Alphabet and Language / 2.2.1：
Language Operations / 2.2.2：
Set Operations / 2.2.3：
Star and Cross / 2.2.4：
Quotient / 2.2.5：
Regular Expressions and Languages / 2.3：
Definition of Regular Expression / 2.3.1：
Derivation and Language / 2.3.2：
Other Operators / 2.3.3：
Closure Properties of REG Family / 2.3.4：
Linguistic Abstraction / 2.4：
Abstract and Concrete Lists / 2.4.1：
Context-Free Generative Grammars / 2.5：
Limits of Regular Languages / 2.5.1：
Introduction to Context-Free Grammars / 2.5.2：
Conventional Grammar Representations / 2.5.3：
Derivation and Language Generation / 2.5.4：
Erroneous Grammars and Useless Rules / 2.5.5：
Recursion and Language Infinity / 2.5.6：
Syntax Trees and Canonical Derivations / 2.5.7：
Parenthesis Languages / 2.5.8：
Regular Composition of Context-Free Languages / 2.5.9：
Ambiguity / 2.5.10：
Catalogue of Ambiguous Forms and Remedies / 2.5.11：
Weak and Structural Equivalence / 2.5.12：
Grammar Transformations and Normal Forms / 2.5.13：
Grammars of Regular Languages / 2.6：
From Regular Expressions to Context-Free Grammars / 2.6.1：
Linear Grammars / 2.6.2：
Linear Language Equations / 2.6.3：
Comparison of Regular and Context-Free Languages / 2.7：
Limits of Context-Free Languages / 2.7.1：
Closure Properties of REG and CF / 2.7.2：
Alphabetic Transformations / 2.7.3：
Grammars with Regular Expressions / 2.7.4：
More General Grammars and Language Families / 2.8：
Chomsky Classification / 2.8.1：
Finite Automata as Regular Language Recognizers / 3：
Recognition Algorithms and Automata / 3.1：
A General Automation / 3.2.1：
Introduction to Finite Automata / 3.3：
Deterministic Finite Automata / 3.4：
Error State and Total Automata / 3.4.1：
Clean Automata / 3.4.2：
Minimal Automata / 3.4.3：
From Automata to Grammars / 3.4.4：
Nondeterministic Automata / 3.5：
Motivation of Nondeterminism / 3.5.1：
Nondeterministic Recognizers / 3.5.2：
Automata with Spontaneous Moves / 3.5.3：
Correspondence between Automata and Grammars / 3.5.4：
Ambiguity of Automata / 3.5.5：
Left-Linear Grammars and Automata / 3.5.6：
Directly from Automata to Regular Expressions: BMC Method / 3.6：
Elimination of Nondeterminism / 3.7：
Construction of Accessible Subsets / 3.7.1：
From Regular Expression to Recognizer / 3.8：
Thompson Structural Method / 3.8.1：
Algorithm of Glushkov, McNaughton and Yamada / 3.8.2：
Deterministic Recognizer by Berry and Sethi Algorithm / 3.8.3：
Regular Expressions with Complement and Intersection / 3.9：
Product of Automata / 3.9.1：
Summary of Relations between Regular Languages, Grammars, and Automata / 3.10：
Pushdown Automata and Top-down Parsing / 4：
Pushdown Automaton / 4.1：
From Grammar to Pushdown Automaton / 4.1.2：
Definition of Pushdown Automaton / 4.1.3：
One Family for Context-Free Languages and Pushdown Automata / 4.2：
Intersection of Regular and Context-Free Languages / 4.2.1：
Deterministic Pushdown Automata and Languages / 4.2.2：
Syntax Analysis / 4.3：
Top-Down and Bottom-Up Analysis / 4.3.1：
Grammar as Network of Finite Automata / 4.3.2：
Nondeterministic Recognition Algorithm / 4.3.3：
Top-Down Deterministic Syntax Analysis / 4.4：
Condition for LL(1) Parsing / 4.4.1：
How to Obtain LL(1) Grammars / 4.4.2：
Increasing Look-ahead / 4.4.3：
Bottom-Up and General Parsing / 5：
Bottom-Up Deterministic Syntax Analysis / 5.1：
LR(0) Method / 5.2.1：
LR(0) Grammars / 5.2.2：
Shift-Reduce Parser / 5.2.3：
Syntax Analysis with LR(k) Look-Ahead / 5.2.4：
LR(1) Parsing Algorithm / 5.2.5：
Properties of LR(k) Language and Grammar Families / 5.2.6：
How to Obtain LR(1) Grammars / 5.2.7：
LR(1) Parsing with Extended Context-Free Grammars / 5.2.8：
Comparison of Deterministic Families REG, LL(k), and LR(k) / 5.2.9：
A General Parsing Algorithm / 5.3：
Introductory Example / 5.3.1：
Earley Algorithm / 5.3.2：
Computational Complexity / 5.3.3：
Handling of Empty Rules / 5.3.4：
Further Developments / 5.3.5：
How to Choose a Parser / 5.4：
Translation Semantics and Static Analysis / 6：
Translation Relation and Function / 6.1：
Transliteration / 6.3：
Regular Translations / 6.4：
Two-Input Automaton / 6.4.1：
Translation Functions and Finite Transducers / 6.4.2：
Purely Syntactic Translation / 6.5：
Infix and Polish Notations / 6.5.1：
Ambiguity of Source Grammar and Translation / 6.5.2：
Translation Grammars and Pushdown Transducers / 6.5.3：
Syntax Analysis with Online Translation / 6.5.4：
Top-Down Deterministic Translation / 6.5.5：
Bottom-Up Deterministic Translation / 6.5.6：
Comparisons / 6.5.7：
Closure Properties of Translations / 6.5.8：
Semantic Translations / 6.6：
Attribute Grammars / 6.6.1：
Left and Right Attributes / 6.6.2：
Definition of Attribute Grammar / 6.6.3：
Dependence Graph and Attribute Evaluation / 6.6.4：
One Sweep Semantic Evaluation / 6.6.5：
Other Evaluation Methods / 6.6.6：
Combined Syntax and Semantic Analysis / 6.6.7：
Typical Applications of Attribute Grammars / 6.6.8：
Static Program Analysis / 6.7：
A Program as an Automaton / 6.7.1：
Liveness Intervals of Variables / 6.7.2：
Reaching Definitions / 6.7.3：
References
Index
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
16.
ＥＢ
Stefano Crespi Reghizzi, Stefano Crespi Reghizzi
出版情報:
SpringerLink Books - AutoHoldings , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
Syntax / 2：
Artificial and Formal Languages / 2.1：
Language Types / 2.1.2：
Chapter Outline / 2.1.3：
Formal Language Theory / 2.2：
Alphabet and Language / 2.2.1：
Language Operations / 2.2.2：
Set Operations / 2.2.3：
Star and Cross / 2.2.4：
Quotient / 2.2.5：
Regular Expressions and Languages / 2.3：
Definition of Regular Expression / 2.3.1：
Derivation and Language / 2.3.2：
Other Operators / 2.3.3：
Closure Properties of REG Family / 2.3.4：
Linguistic Abstraction / 2.4：
Abstract and Concrete Lists / 2.4.1：
Context-Free Generative Grammars / 2.5：
Limits of Regular Languages / 2.5.1：
Introduction to Context-Free Grammars / 2.5.2：
Conventional Grammar Representations / 2.5.3：
Derivation and Language Generation / 2.5.4：
Erroneous Grammars and Useless Rules / 2.5.5：
Recursion and Language Infinity / 2.5.6：
Syntax Trees and Canonical Derivations / 2.5.7：
Parenthesis Languages / 2.5.8：
Regular Composition of Context-Free Languages / 2.5.9：
Ambiguity / 2.5.10：
Catalogue of Ambiguous Forms and Remedies / 2.5.11：
Weak and Structural Equivalence / 2.5.12：
Grammar Transformations and Normal Forms / 2.5.13：
Grammars of Regular Languages / 2.6：
From Regular Expressions to Context-Free Grammars / 2.6.1：
Linear Grammars / 2.6.2：
Linear Language Equations / 2.6.3：
Comparison of Regular and Context-Free Languages / 2.7：
Limits of Context-Free Languages / 2.7.1：
Closure Properties of REG and CF / 2.7.2：
Alphabetic Transformations / 2.7.3：
Grammars with Regular Expressions / 2.7.4：
More General Grammars and Language Families / 2.8：
Chomsky Classification / 2.8.1：
Finite Automata as Regular Language Recognizers / 3：
Recognition Algorithms and Automata / 3.1：
A General Automation / 3.2.1：
Introduction to Finite Automata / 3.3：
Deterministic Finite Automata / 3.4：
Error State and Total Automata / 3.4.1：
Clean Automata / 3.4.2：
Minimal Automata / 3.4.3：
From Automata to Grammars / 3.4.4：
Nondeterministic Automata / 3.5：
Motivation of Nondeterminism / 3.5.1：
Nondeterministic Recognizers / 3.5.2：
Automata with Spontaneous Moves / 3.5.3：
Correspondence between Automata and Grammars / 3.5.4：
Ambiguity of Automata / 3.5.5：
Left-Linear Grammars and Automata / 3.5.6：
Directly from Automata to Regular Expressions: BMC Method / 3.6：
Elimination of Nondeterminism / 3.7：
Construction of Accessible Subsets / 3.7.1：
From Regular Expression to Recognizer / 3.8：
Thompson Structural Method / 3.8.1：
Algorithm of Glushkov, McNaughton and Yamada / 3.8.2：
Deterministic Recognizer by Berry and Sethi Algorithm / 3.8.3：
Regular Expressions with Complement and Intersection / 3.9：
Product of Automata / 3.9.1：
Summary of Relations between Regular Languages, Grammars, and Automata / 3.10：
Pushdown Automata and Top-down Parsing / 4：
Pushdown Automaton / 4.1：
From Grammar to Pushdown Automaton / 4.1.2：
Definition of Pushdown Automaton / 4.1.3：
One Family for Context-Free Languages and Pushdown Automata / 4.2：
Intersection of Regular and Context-Free Languages / 4.2.1：
Deterministic Pushdown Automata and Languages / 4.2.2：
Syntax Analysis / 4.3：
Top-Down and Bottom-Up Analysis / 4.3.1：
Grammar as Network of Finite Automata / 4.3.2：
Nondeterministic Recognition Algorithm / 4.3.3：
Top-Down Deterministic Syntax Analysis / 4.4：
Condition for LL(1) Parsing / 4.4.1：
How to Obtain LL(1) Grammars / 4.4.2：
Increasing Look-ahead / 4.4.3：
Bottom-Up and General Parsing / 5：
Bottom-Up Deterministic Syntax Analysis / 5.1：
LR(0) Method / 5.2.1：
LR(0) Grammars / 5.2.2：
Shift-Reduce Parser / 5.2.3：
Syntax Analysis with LR(k) Look-Ahead / 5.2.4：
LR(1) Parsing Algorithm / 5.2.5：
Properties of LR(k) Language and Grammar Families / 5.2.6：
How to Obtain LR(1) Grammars / 5.2.7：
LR(1) Parsing with Extended Context-Free Grammars / 5.2.8：
Comparison of Deterministic Families REG, LL(k), and LR(k) / 5.2.9：
A General Parsing Algorithm / 5.3：
Introductory Example / 5.3.1：
Earley Algorithm / 5.3.2：
Computational Complexity / 5.3.3：
Handling of Empty Rules / 5.3.4：
Further Developments / 5.3.5：
How to Choose a Parser / 5.4：
Translation Semantics and Static Analysis / 6：
Translation Relation and Function / 6.1：
Transliteration / 6.3：
Regular Translations / 6.4：
Two-Input Automaton / 6.4.1：
Translation Functions and Finite Transducers / 6.4.2：
Purely Syntactic Translation / 6.5：
Infix and Polish Notations / 6.5.1：
Ambiguity of Source Grammar and Translation / 6.5.2：
Translation Grammars and Pushdown Transducers / 6.5.3：
Syntax Analysis with Online Translation / 6.5.4：
Top-Down Deterministic Translation / 6.5.5：
Bottom-Up Deterministic Translation / 6.5.6：
Comparisons / 6.5.7：
Closure Properties of Translations / 6.5.8：
Semantic Translations / 6.6：
Attribute Grammars / 6.6.1：
Left and Right Attributes / 6.6.2：
Definition of Attribute Grammar / 6.6.3：
Dependence Graph and Attribute Evaluation / 6.6.4：
One Sweep Semantic Evaluation / 6.6.5：
Other Evaluation Methods / 6.6.6：
Combined Syntax and Semantic Analysis / 6.6.7：
Typical Applications of Attribute Grammars / 6.6.8：
Static Program Analysis / 6.7：
A Program as an Automaton / 6.7.1：
Liveness Intervals of Variables / 6.7.2：
Reaching Definitions / 6.7.3：
References
Index
Introduction / 1：
Intended Scope and Audience / 1.1：
Compiler Parts and Corresponding Concepts / 1.2：
17.
図書
Stephen Marsland
目次情報:
続きを見る
Prologue
Introduction / 1：
If Data Had Mass, the Earth Would Be a Black Hole / 1.1：
Learning / 1.2：
Machine Learning / 1.2.1：
Types of Machine Learning / 1.3：
Supervised Learning / 1.4：
Regression / 1.4.1：
Classification / 1.4.2：
The Brain and the Neuron / 1.5：
Hebb's Rule / 1.5.1：
McCulloch and Pitts Neurons / 1.5.2：
Limitations of the McCulloch and Pitt Neuronal Model / 1.5.3：
Further Reading
Linear Discriminants / 2：
Preliminaries / 2.1：
The Perceptron / 2.2：
The Learning Rate ? / 2.2.1：
The Bias Input / 2.2.2：
The Perceptron Learning Algorithm / 2.2.3：
An Example of Perceptron Learning / 2.2.4：
Implementation / 2.2.5：
Testing the Network / 2.2.6：
Linear Separability / 2.3：
The Exclusive Or (XOR) Function / 2.3.1：
A Useful Insight / 2.3.2：
Another Example: The Pima Indian Dataset / 2.3.3：
Linear Regression / 2.4：
Linear Regression Examples / 2.4.1：
Practice Questions
The Multi-Layer Perceptron / 3：
Going Forwards / 3.1：
Biases / 3.1.1：
Going Backwards: Back-Propagation of Error / 3.2：
The Multi-Layer Preceptron Algorithm / 3.2.1：
Initialising the Weights / 3.2.2：
Different Output Activation Functions / 3.2.3：
Sequential and Batch Training / 3.2.4：
Local Minima / 3.2.5：
Picking Up Momentum / 3.2.6：
Other Improvements / 3.2.7：
The Multi-Layer Perceptron in Practice / 3.3：
Data Preparation / 3.3.1：
Amount of Training Data / 3.3.2：
Number of Hidden Layers / 3.3.3：
Generalisation and Overfitting / 3.3.4：
Training, Testing, and Validation / 3.3.5：
When to Stop Learning / 3.3.6：
Computing and Evaluating the Results / 3.3.7：
Examples of Using the MLP / 3.4：
A Regression Problem / 3.4.1：
Classification with the MLP / 3.4.2：
A Classification Example / 3.4.3：
Time-Series Prediction / 3.4.4：
Data Compression: The Auto-Associative Network / 3.4.5：
Overview / 3.5：
Deriving Back-Propagation / 3.6：
The Network Output and the Error / 3.6.1：
The Error of the Network / 3.6.2：
A Suitable Activation Function / 3.6.3：
Back-Propagation of Error / 3.6.4：
Radial Basis Functions and Splines / 4：
Concepts / 4.1：
Weight Space / 4.1.1：
Receptive Fields / 4.1.2：
The Radial Basis Function (RBF) Network / 4.2：
Training the RBF Network / 4.2.1：
The Curse of Dimensionality / 4.3：
Interpolation and Basis Functions / 4.4：
Bases and Basis Functions / 4.4.1：
The Cubic Spline / 4.4.2：
Fitting the Spline to the Data / 4.4.3：
Smoothing Splines / 4.4.4：
Higher Dimensions / 4.4.5：
Beyond the Bounds / 4.4.6：
Support Vector Machines / 5：
Optimal Separation / 5.1：
Kernels / 5.2：
Example: XOR / 5.2.1：
Extensions to the Support Vector Machine / 5.2.2：
Learning with Trees / 6：
Using Decision Trees / 6.1：
Constructing Decision Trees / 6.2：
Quick Aside: Entropy in Information Theory / 6.2.1：
ID3 / 6.2.2：
Implementing Trees and Graphs in Python / 6.2.3：
Implementation of the Decision Tree / 6.2.4：
Dealing with Continuous Variables / 6.2.5：
Computational Complexity / 6.2.6：
Classification and Regression Trees (CART) / 6.3：
Gini Impurity / 6.3.1：
Regression in Trees / 6.3.2：
Classification Example / 6.4：
Decision by Committee: Ensemble Learning / 7：
Boosting / 7.1：
AdaBoost / 7.1.1：
Stumpting / 7.1.2：
Bagging / 7.2：
Subagging / 7.2.1：
Different Ways to Combine Classifiers / 7.3：
Probability and Learning / 8：
Turning Data into Probabilities / 8.1：
Minimising Risk / 8.1.1：
The Naive Bayes' Classifier / 8.1.2：
Some Basic Statistics / 8.2：
Averages / 8.2.1：
Variance and Covariance / 8.2.2：
The Gaussian / 8.2.3：
The Bias-Variance Tradeoff / 8.2.4：
Gaussian Mixture Models / 8.3：
The Expectation-Maximisation (EM) Algorithm / 8.3.1：
Nearest Neighbour Methods / 8.4：
Nearest Neighbour Smoothing / 8.4.1：
Efficient Distance Computations: the KD-Tree / 8.4.2：
Distance Measures / 8.4.3：
Unsupervised Learning / 9：
The ?-Means Algorithm / 9.1：
Dealing with Noise / 9.1.1：
The ?-Means Neural Network / 9.1.2：
Normalisation / 9.1.3：
A Better Weight Update Rule / 9.1.4：
Example: The Iris Dataset Again / 9.1.5：
Using Competitive Learning for Clustering / 9.1.6：
Vector Quantisation / 9.2：
The Self-Organising Feature Map / 9.3：
The SOM Algorithm / 9.3.1：
Neighbourhood Connections / 9.3.2：
Self-Organisation / 9.3.3：
Network Dimensionality and Boundary Conditions / 9.3.4：
Examples of Using the SOM / 9.3.5：
Dimensionality Reduction / 10：
Linear Discriminant Analysis (LDA) / 10.1：
Principal Components Analysis (PCA) / 10.2：
Relation with the Multi-Layer Perceptron / 10.2.1：
Kernel PCA / 10.2.2：
Factor Analysis / 10.3：
Independent Components Analysis (ICA) / 10.4：
Locally Linear Embedding / 10.5：
Isomap / 10.6：
Multi-Dimensional Scaling (MDS) / 10.6.1：
Optimisation and Search / 11：
Going Downhill / 11.1：
Least-Squares Optimisation / 11.2：
Taylor Expansion / 11.2.1：
The Levenberg-Marquardt Algorithm / 11.2.2：
Conjugate Gradients / 11.3：
Conjugate Gradients Example / 11.3.1：
Search: Three Basic Approaches / 11.4：
Exhaustive Search / 11.4.1：
Greedy Search / 11.4.2：
Hill Climbing / 11.4.3：
Exploitation and Exploration / 11.5：
Simulated Annealing / 11.6：
Comparison / 11.6.1：
Evolutionary Learning / 12：
The Genetic Algorithm (GA) / 12.1：
String Representation / 12.1.1：
Evaluating Fitness / 12.1.2：
Population / 12.1.3：
Generating Offspring: Parent Selection / 12.1.4：
Generating Offspring: Genetic Operators / 12.2：
Crossover / 12.2.1：
Mutation / 12.2.2：
Elitism, Tournaments, and Niching / 12.2.3：
Using Genetic Algorithms / 12.3：
Map Colouring / 12.3.1：
Punctuated Equilibrium / 12.3.2：
Example: The Knapsack Problem / 12.3.3：
Example: The Four Peaks Problem / 12.3.4：
Limitations of the GA / 12.3.5：
Training Neural Networks with Genetic Algorithms / 12.3.6：
Genetic Programming / 12.4：
Combining Sampling with Evolutionary Learning / 12.5：
Reinforcement Learning / 13：
Example: Getting Lost / 13.1：
State and Action Spaces / 13.2.1：
Carrots and Sticks: the Reward Function / 13.2.2：
Discounting / 13.2.3：
Action Selection / 13.2.4：
Policy / 13.2.5：
Markov Decision Processes / 13.3：
The Markov Property / 13.3.1：
Probabilities in Markov Decision Processes / 13.3.2：
Values / 13.4：
Back on Holiday: Using Reinforcement Learning / 13.5：
The Difference between Sarsa and Q-Learning / 13.6：
Uses of Reinforcement Learning / 13.7：
Markov Chain Monte Carlo (MCMC) Methods / 14：
Sampling / 14.1：
Random Numbers / 14.1.1：
Gaussian Random Numbers / 14.1.2：
Monte Carlo or Bust / 14.2：
The Proposal Distribution / 14.3：
Markov Chain Monte Carlo / 14.4：
Markov Chains / 14.4.1：
The Metropolis-Hastings Algorithm / 14.4.2：
Simulated Annealing (Again) / 14.4.3：
Gibbs Sampling / 14.4.4：
Graphical Models / 15：
Bayesian Networks / 15.1：
Example: Exam Panic / 15.1.1：
Approximate Inference / 15.1.2：
Making Bayesian Networks / 15.1.3：
Markov Random Fields / 15.2：
Hidden Markov Models (HMMs) / 15.3：
The Forward Algorithm / 15.3.1：
The Viterbi Algorithm / 15.3.2：
The Baum-Welch or Forward-Backward Algorithm / 15.3.3：
Tracking Methods / 15.4：
The Kalman Filter / 15.4.1：
The Particle Filter / 15.4.2：
Python / 16：
Installing Python and Other Packages / 16.1：
Getting Started / 16.2：
Python for MATLAB and R users / 16.2.1：
Code Basics / 16.3：
Writing and Importing Code / 16.3.1：
Control Flow / 16.3.2：
Functions / 16.3.3：
The doc String / 16.3.4：
map and lambda / 16.3.5：
Exceptions / 16.3.6：
Classes / 16.3.7：
Using NumPy and Matplotlib / 16.4：
Arrays / 16.4.1：
Linear Algebra / 16.4.2：
Plotting / 16.4.4：
Index
Prologue
Introduction / 1：
If Data Had Mass, the Earth Would Be a Black Hole / 1.1：
18.
ＥＢ
Jo?o M.P Cardoso, Jo?o M.P Cardoso, Pedro C. Diniz, F. Melchers, M. Potter
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
This Book: Key Techniques when Compiling to Reconfigurable Architecture / 1.3：
Organization of this Book / 1.4：
Overview of Reconfigurable Architectures / 2：
Evolution of Reconfigurable Architectures / 2.1：
Reconfigurable Architectures: Key Characteristics / 2.2：
Granularity / 2.3：
Fine-Grained Reconfigurable Architectures / 2.3.1：
Coarse-Grained Reconfigurable Architectures / 2.3.2：
Hybrid Reconfigurable Architectures / 2.3.3：
Granularity and Mapping / 2.3.4：
Interconnection Topologies / 2.4：
System-Level Integration / 2.5：
Dynamic Reconfiguration / 2.6：
Computational and Execution Models / 2.7：
Streaming Data Input and Output / 2.8：
Summary / 2.9：
Compilation and Synthesis Flows / 3：
Overview / 3.1：
Front-End / 3.1.1：
Middle-End / 3.1.2：
Back-End / 3.1.3：
Hardware Compilation and High-Level Synthesis / 3.2：
Generic High-Level Synthesis / 3.2.1：
Customized High-Level Synthesis for Fine-Grained Reconfigurable Architectures / 3.2.2：
Register-Transfer-Level/Logic Synthesis / 3.2.3：
High-Level Compilation for Coarse-Grained Reconfigurable Architectures / 3.2.4：
Placement and Routing / 3.2.5：
Illustrative Example / 3.3：
High-Level Source Code Example / 3.3.1：
Data-Flow Representation / 3.3.2：
Computation-Oriented Mapping and Scheduling / 3.3.3：
Data-Oriented Mapping and Transformations / 3.3.4：
Translation to Hardware / 3.3.5：
Reconfigurable Computing Issues and Their Impact on Compilation / 3.4：
Programming Languages and Execution Models / 3.4.1：
Intermediate Representations / 3.4.2：
Target Reconfigurable Architecture Features / 3.4.3：
Code Transformations / 3.5：
Bit-Level Transformations / 4.1：
Bit-Width Narrowing / 4.1.1：
Bit-Level Optimizations / 4.1.2：
Conversion from Floating- to Fixed-Point Representations / 4.1.3：
Nonstandard Floating-Point Formats / 4.1.4：
Instruction-Level Transformations / 4.2：
Operator Strength Reduction / 4.2.1：
Height Reduction / 4.2.2：
Code Motion / 4.2.3：
Loop-Level Transformations / 4.3：
Loop Unrolling / 4.3.1：
Loop Tiling and Loop Strip-Mining / 4.3.2：
Loop Merging and Loop Distribution / 4.3.3：
Data-Oriented Transformations / 4.4：
Data Distribution / 4.4.1：
Data Replication / 4.4.2：
Data Reuse and Scalar Replacement in Registers and Internal RAMs / 4.4.3：
Other Data-Oriented Transformations / 4.4.4：
Function-Oriented Transformations / 4.5：
Function Inlining and Outlining / 4.5.1：
Recursive Functions / 4.5.2：
Which Code Transformations to Choose? / 4.6：
Mapping and Execution Optimizations / 4.7：
Hardware Execution Techniques / 5.1：
Instruction-Level Parallelism / 5.1.1：
Speculative Execution / 5.1.2：
Predication and if-conversion / 5.1.3：
Multi Tasking / 5.1.4：
Partitioning / 5.2：
Temporal Partitioning / 5.2.1：
Spatial Partitioning / 5.2.2：
Mapping Program Constructs to Resources / 5.2.3：
Mapping Scalar Variables to Registers / 5.3.1：
Mapping of Operations to FUs / 5.3.2：
Mapping of Selection Structures / 5.3.3：
Sharing Functional Units FUs / 5.3.4：
Combining Instructions for RFUs / 5.3.5：
Pipelining / 5.4：
Pipelined Functional and Execution Units / 5.4.1：
Pipelining Memory Accesses / 5.4.2：
Loop Pipelining / 5.4.3：
Coarse-Grained Pipelining / 5.4.4：
Pipelining Configuration-Computation Sequences / 5.4.5：
Memory Accesses / 5.5：
Partitioning and Mapping of Arrays to Memory Resources / 5.5.1：
Improving Memory Accesses / 5.5.2：
Back-End Support / 5.6：
Allocation, Scheduling, and Binding / 5.6.1：
Module Generation / 5.6.2：
Mapping, Placement, and Routing / 5.6.3：
Compilers for Reconfigurable Architectures / 5.7：
Early Compilation Efforts / 6.1：
Compilers for FPGA-Based Systems / 6.2：
The SPC Compiler / 6.2.1：
A C to Fine-Grained Pipelining Compiler / 6.2.2：
The DeepC Silicon Compiler / 6.2.3：
The COBRA-ABS Tool / 6.2.4：
The DEFACTO Compiler / 6.2.5：
The Streams-C Compiler / 6.2.6：
The Cameron Compiler / 6.2.7：
The MATCH Compiler / 6.2.8：
The Galadriel and Nenya Compilers / 6.2.9：
The Sea Cucumber Compiler / 6.2.10：
The Abstract-Machines Compiler / 6.2.11：
The CHAMPION Software Design Environment / 6.2.12：
The SPARCS Tool / 6.2.13：
The ROCCC Compiler / 6.2.14：
The DWARV Compiler / 6.2.15：
Compilers for Coarse-Grained Reconfigurable Architectures / 6.3：
The DIL Compiler / 6.3.1：
The RaPiD-C Compiler / 6.3.2：
The CoDe-X Compiler / 6.3.3：
The XPP-VC Compiler / 6.3.4：
The DRESC Compiler / 6.3.5：
Compilers for Hybrid Reconfigurable Architectures / 6.4：
The Chimaera-C Compiler / 6.4.1：
The Garp and the Nimble C Compilers / 6.4.2：
The NAPA-C Compiler / 6.4.3：
Compilation Efforts Summary / 6.5：
Perspectives on Programming Reconfigurable Computing Platforms / 7：
How to Make Reconfigurable Computing a Reality? / 7.1：
Easy of Programming / 7.1.1：
Program Portability and Legacy Code Migration / 7.1.2：
Performance Portability / 7.1.3：
Research Directions in Compilation for Reconfigurable Architectures / 7.2：
Programming Language Design / 7.2.1：
Intermediate Representation / 7.2.2：
Mapping to Multiple Computing Engines / 7.2.3：
Design-Space Exploration and Compilation Time / 7.2.4：
Pipelined Execution / 7.2.6：
Memory Mapping Optimizations / 7.2.7：
Application-Specific Compilers and Cores / 7.2.8：
Resource Virtualization / 7.2.9：
Dynamic and Incremental Compilation / 7.2.10：
Tackling the Compilation Challenge for Reconfigurable Architectures / 7.3：
Reconfigurable Architectures and Nanotechnology / 7.4：
Final Remarks / 7.5：
References
List of Acronyms
Index
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
19.
ＥＢ
João M.P Cardoso, João M.P Cardoso, Pedro C. Diniz, F. Melchers, M. Potter
出版情報:
SpringerLink Books - AutoHoldings , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
This Book: Key Techniques when Compiling to Reconfigurable Architecture / 1.3：
Organization of this Book / 1.4：
Overview of Reconfigurable Architectures / 2：
Evolution of Reconfigurable Architectures / 2.1：
Reconfigurable Architectures: Key Characteristics / 2.2：
Granularity / 2.3：
Fine-Grained Reconfigurable Architectures / 2.3.1：
Coarse-Grained Reconfigurable Architectures / 2.3.2：
Hybrid Reconfigurable Architectures / 2.3.3：
Granularity and Mapping / 2.3.4：
Interconnection Topologies / 2.4：
System-Level Integration / 2.5：
Dynamic Reconfiguration / 2.6：
Computational and Execution Models / 2.7：
Streaming Data Input and Output / 2.8：
Summary / 2.9：
Compilation and Synthesis Flows / 3：
Overview / 3.1：
Front-End / 3.1.1：
Middle-End / 3.1.2：
Back-End / 3.1.3：
Hardware Compilation and High-Level Synthesis / 3.2：
Generic High-Level Synthesis / 3.2.1：
Customized High-Level Synthesis for Fine-Grained Reconfigurable Architectures / 3.2.2：
Register-Transfer-Level/Logic Synthesis / 3.2.3：
High-Level Compilation for Coarse-Grained Reconfigurable Architectures / 3.2.4：
Placement and Routing / 3.2.5：
Illustrative Example / 3.3：
High-Level Source Code Example / 3.3.1：
Data-Flow Representation / 3.3.2：
Computation-Oriented Mapping and Scheduling / 3.3.3：
Data-Oriented Mapping and Transformations / 3.3.4：
Translation to Hardware / 3.3.5：
Reconfigurable Computing Issues and Their Impact on Compilation / 3.4：
Programming Languages and Execution Models / 3.4.1：
Intermediate Representations / 3.4.2：
Target Reconfigurable Architecture Features / 3.4.3：
Code Transformations / 3.5：
Bit-Level Transformations / 4.1：
Bit-Width Narrowing / 4.1.1：
Bit-Level Optimizations / 4.1.2：
Conversion from Floating- to Fixed-Point Representations / 4.1.3：
Nonstandard Floating-Point Formats / 4.1.4：
Instruction-Level Transformations / 4.2：
Operator Strength Reduction / 4.2.1：
Height Reduction / 4.2.2：
Code Motion / 4.2.3：
Loop-Level Transformations / 4.3：
Loop Unrolling / 4.3.1：
Loop Tiling and Loop Strip-Mining / 4.3.2：
Loop Merging and Loop Distribution / 4.3.3：
Data-Oriented Transformations / 4.4：
Data Distribution / 4.4.1：
Data Replication / 4.4.2：
Data Reuse and Scalar Replacement in Registers and Internal RAMs / 4.4.3：
Other Data-Oriented Transformations / 4.4.4：
Function-Oriented Transformations / 4.5：
Function Inlining and Outlining / 4.5.1：
Recursive Functions / 4.5.2：
Which Code Transformations to Choose? / 4.6：
Mapping and Execution Optimizations / 4.7：
Hardware Execution Techniques / 5.1：
Instruction-Level Parallelism / 5.1.1：
Speculative Execution / 5.1.2：
Predication and if-conversion / 5.1.3：
Multi Tasking / 5.1.4：
Partitioning / 5.2：
Temporal Partitioning / 5.2.1：
Spatial Partitioning / 5.2.2：
Mapping Program Constructs to Resources / 5.2.3：
Mapping Scalar Variables to Registers / 5.3.1：
Mapping of Operations to FUs / 5.3.2：
Mapping of Selection Structures / 5.3.3：
Sharing Functional Units FUs / 5.3.4：
Combining Instructions for RFUs / 5.3.5：
Pipelining / 5.4：
Pipelined Functional and Execution Units / 5.4.1：
Pipelining Memory Accesses / 5.4.2：
Loop Pipelining / 5.4.3：
Coarse-Grained Pipelining / 5.4.4：
Pipelining Configuration-Computation Sequences / 5.4.5：
Memory Accesses / 5.5：
Partitioning and Mapping of Arrays to Memory Resources / 5.5.1：
Improving Memory Accesses / 5.5.2：
Back-End Support / 5.6：
Allocation, Scheduling, and Binding / 5.6.1：
Module Generation / 5.6.2：
Mapping, Placement, and Routing / 5.6.3：
Compilers for Reconfigurable Architectures / 5.7：
Early Compilation Efforts / 6.1：
Compilers for FPGA-Based Systems / 6.2：
The SPC Compiler / 6.2.1：
A C to Fine-Grained Pipelining Compiler / 6.2.2：
The DeepC Silicon Compiler / 6.2.3：
The COBRA-ABS Tool / 6.2.4：
The DEFACTO Compiler / 6.2.5：
The Streams-C Compiler / 6.2.6：
The Cameron Compiler / 6.2.7：
The MATCH Compiler / 6.2.8：
The Galadriel and Nenya Compilers / 6.2.9：
The Sea Cucumber Compiler / 6.2.10：
The Abstract-Machines Compiler / 6.2.11：
The CHAMPION Software Design Environment / 6.2.12：
The SPARCS Tool / 6.2.13：
The ROCCC Compiler / 6.2.14：
The DWARV Compiler / 6.2.15：
Compilers for Coarse-Grained Reconfigurable Architectures / 6.3：
The DIL Compiler / 6.3.1：
The RaPiD-C Compiler / 6.3.2：
The CoDe-X Compiler / 6.3.3：
The XPP-VC Compiler / 6.3.4：
The DRESC Compiler / 6.3.5：
Compilers for Hybrid Reconfigurable Architectures / 6.4：
The Chimaera-C Compiler / 6.4.1：
The Garp and the Nimble C Compilers / 6.4.2：
The NAPA-C Compiler / 6.4.3：
Compilation Efforts Summary / 6.5：
Perspectives on Programming Reconfigurable Computing Platforms / 7：
How to Make Reconfigurable Computing a Reality? / 7.1：
Easy of Programming / 7.1.1：
Program Portability and Legacy Code Migration / 7.1.2：
Performance Portability / 7.1.3：
Research Directions in Compilation for Reconfigurable Architectures / 7.2：
Programming Language Design / 7.2.1：
Intermediate Representation / 7.2.2：
Mapping to Multiple Computing Engines / 7.2.3：
Design-Space Exploration and Compilation Time / 7.2.4：
Pipelined Execution / 7.2.6：
Memory Mapping Optimizations / 7.2.7：
Application-Specific Compilers and Cores / 7.2.8：
Resource Virtualization / 7.2.9：
Dynamic and Incremental Compilation / 7.2.10：
Tackling the Compilation Challenge for Reconfigurable Architectures / 7.3：
Reconfigurable Architectures and Nanotechnology / 7.4：
Final Remarks / 7.5：
References
List of Acronyms
Index
Introduction / 1：
The Promise of Reconfigurable Architectures and Systems / 1.1：
The Challenge: How to Program and Compile for Reconfigurable Systems? / 1.2：
20.
ＥＢ
Jin, Jianming Jin, Douglas J. Riley
出版情報:
Wiley Online Library - AutoHoldings Books , Wiley-IEEE Press, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Introduction / 1：
Numerical Simulation of Antennas / 1.1：
Finite Element Analysis Versus Other Numerical Methods / 1.2：
Frequency-Versus Time-Domain Simulations / 1.3：
Brief Review of Past Work / 1.4：
Overview of the Book / 1.5：
References
Finite Element Formulation / 2：
Finite Element Formulation in the Frequency Domain / 2.1：
Finite Element Formulation in the Time Domain / 2.2：
Modeling of Complex Materials / 2.3：
Modeling of Electrically and Magnetically Lossy Materials / 2.3.1：
Modeling of Electrically Dispersive Materials / 2.3.2：
Modeling of Magnetically Dispersive Materials / 2.3.3：
Modeling of Doubly Dispersive Lossy Materials / 2.3.4：
Validation Examples / 2.3.5：
Solution of the Finite Element Equations / 2.4：
Higher-Order and Curvilinear Finite Elements / 2.5：
Summary / 2.6：
Finite Element Mesh Truncation / 3：
Absorbing Boundary Conditions / 3.1：
First-Order Absorbing Boundary Condition / 3.1.1：
Second-Order Absorbing Boundary Condition / 3.1.2：
Perfectly Matched Layers / 3.2：
PML in Terms of Stretched Coordinates / 3.2.1：
PML as an Anisotropic Material Absorber / 3.2.2：
PML for Truncating the Computational Domain / 3.2.3：
Finite Element Implementation of PML / 3.2.4：
ABC-Backed, Complementary, CFS, and Second-Order PMLs / 3.2.5：
Boundary Integral Equations / 3.3：
Frequency-Domain Formulations / 3.3.1：
Time-Domain Formulations / 3.3.2：
Treatment of the Infinite Ground Plane / 3.3.3：
Hybrid FETD-FDTD Technique / 3.4：
FDTD Method / 4.1：
PML Implementation in FDTD / 4.2：
FDTD Stretched-Coordinate PML / 4.2.1：
FDTD Anisotropic-Medium PML / 4.2.2：
Near-to-Far-Field Transformation in FDTD / 4.3：
Alternative FETD Formulation / 4.4：
Equivalence Between FETD and FDTD / 4.5：
Stable FETD-FDTD Interface / 4.6：
Initial Approaches / 4.6.1：
Stable Formulation / 4.6.2：
Building Hybrid Meshes / 4.7：
Wave-Equation Stabilization / 4.8：
Antenna Source Modeling and Parameter Calculation / 4.9：
Antenna Feed Modeling / 5.1：
Current Probe / 5.1.1：
Voltage Gap Generator / 5.1.2：
Waveguide Feed Model / 5.1.3：
Plane-Wave Excitation / 5.2：
Total-Field Formulation / 5.2.1：
Scattered-Field Formulation / 5.2.2：
Total-and Scattered-Field Decomposition Approach / 5.2.3：
Far-Field Pattern Computation / 5.3：
Near-Field Visualization / 5.4：
Modeling of Complex Structures / 5.5：
Thin-Material Layers and Sheets / 6.1：
Impedance Boundary Conditions / 6.1.1：
Shell Element Formulation / 6.1.2：
Thin Wires and Slots / 6.2：
Thin Wires / 6.2.1：
Thin Slots / 6.2.2：
Lumped-Circuit Elements / 6.3：
Coupled First-Order Equations / 6.3.1：
Wave Equation / 6.3.2：
Example / 6.3.3：
Distributed Feed Network / 6.4：
System-Level Coupling Example / 6.5：
Internal Dispersive Material Calibration / 6.5.1：
External Illumination and Aperture Coupling / 6.5.2：
Antenna Simulation Examples / 6.6：
Narrowband Antennas / 7.1：
Coaxial-Fed Monopole Antenna / 7.1.1：
Monopole Antennas on a Plate / 7.1.2：
Patch Antennas on a Plate / 7.1.3：
Conformal Patch Antenna Array / 7.1.4：
Broadband Antennas / 7.2：
Ridged Horn Antenna / 7.2.1：
Sinuous Antenna / 7.2.2：
Logarithmic Spiral Antenna / 7.2.3：
Inverted Conical Spiral Antenna / 7.2.4：
Antipodal Vivaldi Antenna / 7.2.5：
Vlasov Antenna / 7.2.6：
Antenna RCS Simulations / 7.3：
Microstrip Patch Antenna / 7.3.1：
Standard Gain Horn Antenna / 7.3.2：
Axisymmetric Antenna Modeling / 7.4：
Method of Analysis / 8.1：
Mesh Truncation Using Perfectly Matched Layers / 8.1.1：
Mesh Truncation Using Boundary Integral Equations / 8.1.3：
Far-Field Computation / 8.1.4：
Application Examples / 8.2：
Luneburg Lens / 8.2.1：
Corrugated Horn / 8.2.2：
Current Loop Inside a Radome / 8.2.3：
Infinite Phased-Array Modeling / 8.3：
Frequency-Domain Modeling / 9.1：
Periodic Boundary Conditions / 9.1.1：
Mesh Truncation Techniques / 9.1.2：
Extension to Skew Arrays / 9.1.3：
Extension to Scattering Analysis / 9.1.4：
Time-Domain Modeling / 9.1.5：
Transformed Field Variable / 9.2.1：
General Material Modeling / 9.2.2：
Approximation to Finite Arrays / 9.2.4：
Finite Phased-Array Modeling / 9.4：
FETI-DPEM1 Formulation / 10.1：
FETI-DPEM2 Formulation / 10.1.2：
Nonconforming Domain Decomposition / 10.1.3：
Dual-Field Domain-Decomposition Method / 10.1.4：
Domain Decomposition for Iterative Solutions / 10.2.2：
Antenna-Platform Interaction Modeling / 10.2.3：
Coupled Analysis / 11.1：
FETI-DPEM with Domain Decomposition / 11.1.1：
Hybrid FETD-FDTD with Domain Decomposition / 11.1.2：
Hybrid FE-BI Method with FMM Acceleration / 11.1.3：
Decoupled Analysis / 11.2：
Near-Field Calculation / 11.2.1：
Far-Field Evaluation by Numerical Methods / 11.2.2：
Far-Field Evaluation by Asymptotic Techniques / 11.2.3：
Direct and Interative Improvements / 11.2.4：
Numerical and Practical Considerations / 11.3：
Choice of Simulation Technologies / 12.1：
Frequency-Versus Time-Domain Simulation Tools / 12.2：
Fast Frequency Sweep / 12.3：
Numerical Convergence / 12.4：
Domain Decomposition and Parallel Computing / 12.5：
Verification and Validation of Predictions / 12.6：
Index / 12.7：
Acknowledgments
Finite Element Analysis vs. Other Numerical Methods / Chapter 1：
Frequency- vs. Time-Domain Simulations
Overview of This Book
PML for Truncating Computational Domain / Chapter 2：
Treatment of Infinite Ground Plane
The FDTD Method / Chapter 4：
FDTD Anisotropic PML
Equivalence between FETD and FDTD
Wave-Equation Stablization
Total- and Scattered-Field Decomposition Approach / Chapter 5：
Thin Material Layers and Sheets / Chapter 6：
Lumped Circuit Elements
Coaxial-fed Monopole Antenna / Chapter 7：
Axisymmetric Ant / Chapter 8：
Preface
Introduction / 1：
Numerical Simulation of Antennas / 1.1：
21.
ＥＢ
Laure Saint-Raymond
出版情報:
SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
The Sixth Problem of Hilbert / 1.1：
The Mathematical Treatment of the Axioms of Physics / 1.1.1：
From Microscopic to Macroscopic Equations / 1.1.2：
Formal Study of the Transitions / 1.2：
Scalings / 1.2.1：
Hydrodynamic Limits / 1.2.2：
The Probabilistic Approach / 1.3：
The Euler Limit / 1.3.1：
The Incompressible Navier-Stokes Equations / 1.3.2：
The Analytic Approach / 1.4：
Formal Derivations / 1.4.1：
Convergence Proofs Based on Asymptotic Expansions / 1.4.2：
Convergence Proofs Based on Spectral Results / 1.4.3：
A Program of Deriving Weak Solutions / 1.4.4：
The Boltzmann Equation and its Formal Hydrodynamic Limits / 2：
Formulation and Fundamental Properties of the Boltzmann Equation / 2.1：
The Boltzmann Collision Integral / 2.1.1：
Local Conservation Laws / 2.1.2：
Boltzmann's H Theorem / 2.1.3：
Orders of Magnitude and Qualitative Behaviour of the Boltzmann Equation / 2.2：
Nondimensional Form of the Boltzmann Equation / 2.2.1：
Hydrodynamic Regimes / 2.2.2：
Corrections to Hydrodynamic Approximations / 2.2.3：
Taking into Account the Boundary / 2.2.4：
Mathematical Theories for the Boltzmann Equation / 2.3：
Perturbative Framework: Global Existence of Smooth Solutions / 2.3.1：
Physical Framework : Global Existence of Renormalized Solutions / 2.3.2：
Further Results in One Space Dimension / 2.3.3：
Mathematical Tools for the Derivation of Hydrodynamic Limits / 3：
Physical a Priori Estimates : Definition of Suitable Functional Spaces / 3.1：
The Entropy Bound / 3.1.1：
The Darrozès-Guiraud Information / 3.1.2：
The Entropy Dissipation Bound / 3.1.3：
Properties of the Collision Operator : Relaxation Towards Equilibrium and Regularization in ? Variables / 3.2：
Some Results in the Non Perturbative Framework / 3.2.1：
Coercivity of the Linearized Collision Operator / 3.2.2：
Improving Integrability with Respect to the ? Variables / 3.2.3：
Properties of the Free Transport Operator: Dispersion and Averaging Lemmas / 3.3：
Dispersive Properties of the Free-Transport Operator / 3.3.1：
The Case of a Spatial Domain with Boundaries / 3.3.3：
The Incompressible Navier-Stokes Limit / 4：
Convergence Result : From the Boltzmann Equation to the Incompressible Navier-Stokes-Fourier System / 4.1：
Mathematical Theories for the Incompressible Navier-Stokes Equations / 4.1.1：
Analogies with the Scaled Boltzmann Equation / 4.1.2：
Statement of the Result / 4.1.3：
The Moment Method / 4.2：
Description of the Strategy / 4.2.1：
Convergence of the Conservation Defects / 4.2.2：
Decomposition of the Flux Term / 4.2.3：
Study of the Convection and Diffusion Terms / 4.3：
Spatial Regularity Coming from Averaging Lemmas / 4.3.1：
Filtering of Acoustic Waves / 4.3.2：
Convergence of the Nonlinear Convection Term / 4.3.3：
Convergence of the Diffusion Term / 4.3.4：
Taking into Account Boundary Conditions / 4.4：
A Priori Estimates Coming from the Inside / 4.4.1：
A Priori Estimates Coming from the Boundary / 4.4.2：
The Limiting Boundary Conditions / 4.4.3：
The Incompressible Euler Limit / 5：
Convergence Result : From the Boltzmann Equation to the Incompressible Euler System / 5.1：
Mathematical Theories for the Incompressible Euler Equations / 5.1.1：
The Convergence Results for "Well-Prepared" Initial Data / 5.1.2：
The Convergence Result for General Initial Data / 5.1.4：
The Relative Entropy Method / 5.2：
The Stability Inequality in the Framework of Renormalized Solutions / 5.2.1：
The Stability Inequality Under the Additional Integrability Assumption / 5.2.3：
The Case of "Well-Prepared" Initial Data / 5.3：
Control of the Flux Term / 5.3.1：
Proof of Theorem 5.1.8 and Corollary 5.1.9 / 5.3.2：
Taking into Account Acoustic Waves / 5.4：
Construction of Approximate Solutions by a Filtering Method / 5.4.1：
Control of the Flux Term and Proof of Convergence / 5.4.2：
Taking into Account the Knudsen Layer / 5.5：
The Refined Stability Inequality / 5.5.1：
Construction of An Approximate Solution / 5.5.2：
The Compressible Euler Limit / 5.5.3：
Mathematical Theories for the Compressible Euler System / 6.1：
Local Smooth Solutions / 6.1.1：
Weak and Entropic Solutions / 6.1.2：
Global Entropic Solutions in One Spatial Dimension / 6.1.3：
Some Perspectives / 6.2：
Convergence Towards Smooth Solutions / 6.2.1：
Convergence Towards Weak Solutions in One Space Dimension / 6.2.2：
Appendix
Some Consequences of Egorov's Theorem / A：
The Product Limit Theorem / A.1：
An Asymptotic Result of Variables Separating / A.2：
Classical Trace Results on the Solutions of Transport Equations / B：
Definition of the Trace / B.1：
Free Transport with Reflection at the Boundary / B.2：
Some Consequences of Chacon's Biting Lemma / C：
From Renormalized Convergence to Chacon's Convergence / C.1：
A Result of Partial Equiintegrability / C.2：
References
Index
Introduction / 1：
The Sixth Problem of Hilbert / 1.1：
The Mathematical Treatment of the Axioms of Physics / 1.1.1：
22.
ＥＢ
Wolfgang Mahnke, Matthias Damm, Stefan-Helmut Leitner
出版情報:
Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
Acknowledgements
Introduction / 1：
OPC Foundation / 1.1：
Classic OPC / 1.2：
OPC Data Access / 1.2.1：
OPC Alarm and Events / 1.2.2：
OPC Historical Data Access / 1.2.3：
Other OPC Interface Standards / 1.2.4：
OPC XML-DA / 1.2.5：
Motivation for OPC UA / 1.3：
OPC UA Overview / 1.4：
OPC UA Specifications / 1.5：
OPC UA Software Layers / 1.6：
Evolution Not Revolution / 1.7：
Summary / 1.8：
Key Messages / 1.8.1：
Where to Find More Information? / 1.8.2：
What's Next? / 1.8.3：
Information Modeling: Concepts / 2：
Why Information Modeling? / 2.1：
Nodes and References / 2.2：
Reference Types / 2.3：
Objects, Variables and Methods / 2.4：
Types for Objects and Variables / 2.5：
Simple Object Types / 2.5.1：
Simple Variable Types / 2.5.2：
Complex Object Types / 2.5.3：
Instance Declarations / 2.5.4：
Complex Variable Types / 2.5.5：
Modelling Rules / 2.5.6：
Subtyping of Complex Types / 2.5.7：
Data Variables and Properties / 2.6：
Model Parent for Objects, Variables and Methods / 2.7：
Data Types / 2.8：
Data Type Node Class / 2.8.1：
Built-in and Simple Data Types / 2.8.2：
Enumeration Data Types / 2.8.3：
Structured Data Types / 2.8.4：
Specific Built-in Data Types / 2.8.5：
Summary on Data Types / 2.8.6：
Views / 2.9：
Events / 2.10：
Historical Access / 2.11：
Historical Data / 2.11.1：
Historical Events / 2.11.2：
Historical Address Space / 2.11.3：
Address Space Model and Information Models / 2.12：
Information Modeling: Example and Best Practice / 2.13：
Overview / 3.1：
Example / 3.2：
Application Scenario / 3.2.1：
Simple Scenario - Similar to Classic OPC / 3.2.2：
Advanced Scenario - Providing Full Power of OPC UA / 3.2.3：
Best Practices / 3.3：
Structuring with Objects, Reference Types and Views / 3.3.1：
Type Definitions (Object Types and Variable Types) / 3.3.2：
Providing Complex Data Structures / 3.3.3：
Providing User-Defined Data Types / 3.3.4：
Properties / 3.3.5：
Methods / 3.3.6：
Proxy Objects (Properties on References) / 3.3.7：
Standard Information Models / 3.4：
Handling Information Models / 4.1：
What is Specified by an Information Model? / 4.2.1：
How is an Information Model Specified? / 4.2.2：
How are Multiple Information Models Supported? / 4.2.3：
Base OPC UA Information Model / 4.3：
Capabilities and Diagnostics / 4.4：
Data Access / 4.5：
Historical Access and Aggregates / 4.6：
State Machine / 4.7：
Programs / 4.8：
Alarms and Conditions / 4.9：
Domain-Specific Information Models / 4.10：
Devices Information Model / 4.10.1：
Services / 4.11：
General Service Concepts / 5.1：
Timeout Handling / 5.2.1：
Request and Response Headers / 5.2.2：
Error Handling / 5.2.3：
Extensible Parameters / 5.2.4：
Communication Context / 5.2.5：
Convention for Describing Services in this Chapter / 5.2.6：
Finding Servers / 5.3：
Service Find Servers / 5.3.1：
Service Get Endpoints / 5.3.2：
Service Register Server / 5.3.3：
Connection Management Between Clients and Servers / 5.4：
Secure Channel Establishment / 5.4.1：
Creating an Application Session / 5.4.2：
Closing an Application Session / 5.4.3：
Cancel Outstanding Service Requests / 5.4.4：
Find Information in the Address Space / 5.5：
Services Used for Discovering the Address Space / 5.5.1：
Use Cases for Finding Information in the Address Space / 5.5.2：
Read and Write Data and Metadata / 5.6：
Reading Data / 5.6.1：
Writing Data / 5.6.2：
Subscribe for Data Changes and Events / 5.7：
Delivery of Changed Data and Events / 5.7.1：
Create and Manage Subscriptions / 5.7.2：
Create and Manage Monitored Items / 5.7.3：
Monitor Data Changes / 5.7.4：
Monitor Events / 5.7.5：
Monitor Aggregated Data / 5.7.6：
Calling Methods Defined by the Server / 5.8：
Access History of Data and Events / 5.9：
History Read Service / 5.9.1：
History Update Service / 5.9.2：
Find Information in Complex Address Space / 5.10：
Modify the Address Space / 5.11：
Adding Nodes / 5.11.1：
Creating References Between Nodes / 5.11.2：
Removing Nodes / 5.11.3：
Delete References Between Nodes / 5.11.4：
Technology Mapping / 5.12：
Data Encodings / 6.1：
OPC UA Binary / 6.2.1：
XML / 6.2.2：
Security Protocols / 6.3：
WS-Secure Conversation / 6.3.1：
UA-Secure Conversation / 6.3.2：
Transport Protocols / 6.4：
UA TCP / 6.4.1：
SOAP/HTTP / 6.4.2：
Available Mapping Implementations / 6.5：
Security / 6.6：
Why is Security so Important? / 7.1：
Organizational Perspective of Security / 7.2：
Technical Perspective of Security / 7.3：
Determining The Appropriate Level of Security / 7.4：
Security Assessments / 7.4.1：
The OPC UA Security Assessment / 7.4.2：
The OPC UA Security Model / 7.5：
Security Architecture / 7.5.1：
Securing the Communication Channel / 7.5.2：
Authentication and Authorization / 7.5.3：
Security Policies and Profiles / 7.5.4：
Certificates / 7.6：
What is a Certificate? / 7.6.1：
OPC UA Certificates / 7.6.2：
Public Key Infrastructure for OPC UA / 7.7：
What is a PKI? / 7.7.1：
Trust Models / 7.7.2：
Certificate Lifecycle Management / 7.7.3：
Available PKI Frameworks / 7.7.4：
PKI for Industrial Applications / 7.7.5：
Application Architecture / 7.8：
Architectural Overview / 8.1：
Stack / 8.3：
Interface / 8.3.1：
Encoding Layer / 8.3.2：
Security Layer / 8.3.3：
Transport Layer / 8.3.4：
Platform Layer / 8.3.5：
Software Development Toolkit / 8.4：
UA-Specific Functionality / 8.4.1：
Common Functionality / 8.4.2：
Interfaces / 8.4.3：
Application / 8.5：
Client / 8.5.1：
Server / 8.5.2：
Deliverables Provided by the OPC Foundation / 8.6：
Stacks / 8.6.1：
SDKs / 8.6.2：
Applications / 8.6.3：
System Architecture / 8.7：
System Environment / 9.1：
Basic Architecture Patterns / 9.2：
Client-Server / 9.2.1：
Chained Server / 9.2.2：
Server-to-Server Communication / 9.2.3：
Aggregating Server / 9.2.4：
Redundancy / 9.3：
Client Redundancy / 9.3.1：
Server Redundancy / 9.3.2：
Discovery / 9.4：
Why discovery? / 9.4.1：
Discovery Entities / 9.4.2：
Discovery Process / 9.4.3：
Auditing / 9.5：
Audit Logs / 9.5.1：
Audit Events / 9.5.3：
Service Auditing / 9.5.4：
Use Cases / 9.5.5：
Mapping of COM OPC to OPC UA / 9.6：
OPC Data Access 2.05A and 3.0 / 10.1：
Address Space / 10.2.1：
Access Information / 10.2.2：
OPC XML-DA 1.01 / 10.2.3：
OPC Alarm and Events 1.1 / 10.3：
Migration / 10.3.1：
Wrappers - Access COM Server from UA Client / 11.1：
Proxies - Access UA Server from COM Client / 11.3：
Native Development / 11.4：
Profiles / 11.5：
Motivation / 12.1：
Profiles, Conformance Units and Test Cases / 12.2：
Profiles for Server Applications / 12.3：
Profiles for Client Applications / 12.4：
Transport Profiles / 12.5：
Security Profiles / 12.6：
Certification Process / 12.7：
Performance / 12.8：
Performance Numbers / 13.1：
Conclusion and Outlook / 13.3：
OPC UA in a Nutshell / 14.1：
Is OPC UA Complicated? / 14.2：
Are OPC UA Services Difficult to Handle? / 14.2.1：
Is Information Modeling a Pain? / 14.2.2：
Transport Protocols and Encodings: Why So Many? / 14.2.3：
Implementation Issues / 14.2.4：
Migration of Existing Code / 14.2.5：
Management Summary / 14.2.6：
Outlook / 14.3：
Literature / 15：
Graphical Notation / Appendix A：
Motivation and Relation to UML
Notation
Node Classes and Attributes / Appendix B：
Base Information Model Reference / Appendix C：
Index
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
23.
ＥＢ
Wolfgang Mahnke, Matthias Damm, Stefan-Helmut Leitner
出版情報:
SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
Acknowledgements
Introduction / 1：
OPC Foundation / 1.1：
Classic OPC / 1.2：
OPC Data Access / 1.2.1：
OPC Alarm and Events / 1.2.2：
OPC Historical Data Access / 1.2.3：
Other OPC Interface Standards / 1.2.4：
OPC XML-DA / 1.2.5：
Motivation for OPC UA / 1.3：
OPC UA Overview / 1.4：
OPC UA Specifications / 1.5：
OPC UA Software Layers / 1.6：
Evolution Not Revolution / 1.7：
Summary / 1.8：
Key Messages / 1.8.1：
Where to Find More Information? / 1.8.2：
What's Next? / 1.8.3：
Information Modeling: Concepts / 2：
Why Information Modeling? / 2.1：
Nodes and References / 2.2：
Reference Types / 2.3：
Objects, Variables and Methods / 2.4：
Types for Objects and Variables / 2.5：
Simple Object Types / 2.5.1：
Simple Variable Types / 2.5.2：
Complex Object Types / 2.5.3：
Instance Declarations / 2.5.4：
Complex Variable Types / 2.5.5：
Modelling Rules / 2.5.6：
Subtyping of Complex Types / 2.5.7：
Data Variables and Properties / 2.6：
Model Parent for Objects, Variables and Methods / 2.7：
Data Types / 2.8：
Data Type Node Class / 2.8.1：
Built-in and Simple Data Types / 2.8.2：
Enumeration Data Types / 2.8.3：
Structured Data Types / 2.8.4：
Specific Built-in Data Types / 2.8.5：
Summary on Data Types / 2.8.6：
Views / 2.9：
Events / 2.10：
Historical Access / 2.11：
Historical Data / 2.11.1：
Historical Events / 2.11.2：
Historical Address Space / 2.11.3：
Address Space Model and Information Models / 2.12：
Information Modeling: Example and Best Practice / 2.13：
Overview / 3.1：
Example / 3.2：
Application Scenario / 3.2.1：
Simple Scenario - Similar to Classic OPC / 3.2.2：
Advanced Scenario - Providing Full Power of OPC UA / 3.2.3：
Best Practices / 3.3：
Structuring with Objects, Reference Types and Views / 3.3.1：
Type Definitions (Object Types and Variable Types) / 3.3.2：
Providing Complex Data Structures / 3.3.3：
Providing User-Defined Data Types / 3.3.4：
Properties / 3.3.5：
Methods / 3.3.6：
Proxy Objects (Properties on References) / 3.3.7：
Standard Information Models / 3.4：
Handling Information Models / 4.1：
What is Specified by an Information Model? / 4.2.1：
How is an Information Model Specified? / 4.2.2：
How are Multiple Information Models Supported? / 4.2.3：
Base OPC UA Information Model / 4.3：
Capabilities and Diagnostics / 4.4：
Data Access / 4.5：
Historical Access and Aggregates / 4.6：
State Machine / 4.7：
Programs / 4.8：
Alarms and Conditions / 4.9：
Domain-Specific Information Models / 4.10：
Devices Information Model / 4.10.1：
Services / 4.11：
General Service Concepts / 5.1：
Timeout Handling / 5.2.1：
Request and Response Headers / 5.2.2：
Error Handling / 5.2.3：
Extensible Parameters / 5.2.4：
Communication Context / 5.2.5：
Convention for Describing Services in this Chapter / 5.2.6：
Finding Servers / 5.3：
Service Find Servers / 5.3.1：
Service Get Endpoints / 5.3.2：
Service Register Server / 5.3.3：
Connection Management Between Clients and Servers / 5.4：
Secure Channel Establishment / 5.4.1：
Creating an Application Session / 5.4.2：
Closing an Application Session / 5.4.3：
Cancel Outstanding Service Requests / 5.4.4：
Find Information in the Address Space / 5.5：
Services Used for Discovering the Address Space / 5.5.1：
Use Cases for Finding Information in the Address Space / 5.5.2：
Read and Write Data and Metadata / 5.6：
Reading Data / 5.6.1：
Writing Data / 5.6.2：
Subscribe for Data Changes and Events / 5.7：
Delivery of Changed Data and Events / 5.7.1：
Create and Manage Subscriptions / 5.7.2：
Create and Manage Monitored Items / 5.7.3：
Monitor Data Changes / 5.7.4：
Monitor Events / 5.7.5：
Monitor Aggregated Data / 5.7.6：
Calling Methods Defined by the Server / 5.8：
Access History of Data and Events / 5.9：
History Read Service / 5.9.1：
History Update Service / 5.9.2：
Find Information in Complex Address Space / 5.10：
Modify the Address Space / 5.11：
Adding Nodes / 5.11.1：
Creating References Between Nodes / 5.11.2：
Removing Nodes / 5.11.3：
Delete References Between Nodes / 5.11.4：
Technology Mapping / 5.12：
Data Encodings / 6.1：
OPC UA Binary / 6.2.1：
XML / 6.2.2：
Security Protocols / 6.3：
WS-Secure Conversation / 6.3.1：
UA-Secure Conversation / 6.3.2：
Transport Protocols / 6.4：
UA TCP / 6.4.1：
SOAP/HTTP / 6.4.2：
Available Mapping Implementations / 6.5：
Security / 6.6：
Why is Security so Important? / 7.1：
Organizational Perspective of Security / 7.2：
Technical Perspective of Security / 7.3：
Determining The Appropriate Level of Security / 7.4：
Security Assessments / 7.4.1：
The OPC UA Security Assessment / 7.4.2：
The OPC UA Security Model / 7.5：
Security Architecture / 7.5.1：
Securing the Communication Channel / 7.5.2：
Authentication and Authorization / 7.5.3：
Security Policies and Profiles / 7.5.4：
Certificates / 7.6：
What is a Certificate? / 7.6.1：
OPC UA Certificates / 7.6.2：
Public Key Infrastructure for OPC UA / 7.7：
What is a PKI? / 7.7.1：
Trust Models / 7.7.2：
Certificate Lifecycle Management / 7.7.3：
Available PKI Frameworks / 7.7.4：
PKI for Industrial Applications / 7.7.5：
Application Architecture / 7.8：
Architectural Overview / 8.1：
Stack / 8.3：
Interface / 8.3.1：
Encoding Layer / 8.3.2：
Security Layer / 8.3.3：
Transport Layer / 8.3.4：
Platform Layer / 8.3.5：
Software Development Toolkit / 8.4：
UA-Specific Functionality / 8.4.1：
Common Functionality / 8.4.2：
Interfaces / 8.4.3：
Application / 8.5：
Client / 8.5.1：
Server / 8.5.2：
Deliverables Provided by the OPC Foundation / 8.6：
Stacks / 8.6.1：
SDKs / 8.6.2：
Applications / 8.6.3：
System Architecture / 8.7：
System Environment / 9.1：
Basic Architecture Patterns / 9.2：
Client-Server / 9.2.1：
Chained Server / 9.2.2：
Server-to-Server Communication / 9.2.3：
Aggregating Server / 9.2.4：
Redundancy / 9.3：
Client Redundancy / 9.3.1：
Server Redundancy / 9.3.2：
Discovery / 9.4：
Why discovery? / 9.4.1：
Discovery Entities / 9.4.2：
Discovery Process / 9.4.3：
Auditing / 9.5：
Audit Logs / 9.5.1：
Audit Events / 9.5.3：
Service Auditing / 9.5.4：
Use Cases / 9.5.5：
Mapping of COM OPC to OPC UA / 9.6：
OPC Data Access 2.05A and 3.0 / 10.1：
Address Space / 10.2.1：
Access Information / 10.2.2：
OPC XML-DA 1.01 / 10.2.3：
OPC Alarm and Events 1.1 / 10.3：
Migration / 10.3.1：
Wrappers - Access COM Server from UA Client / 11.1：
Proxies - Access UA Server from COM Client / 11.3：
Native Development / 11.4：
Profiles / 11.5：
Motivation / 12.1：
Profiles, Conformance Units and Test Cases / 12.2：
Profiles for Server Applications / 12.3：
Profiles for Client Applications / 12.4：
Transport Profiles / 12.5：
Security Profiles / 12.6：
Certification Process / 12.7：
Performance / 12.8：
Performance Numbers / 13.1：
Conclusion and Outlook / 13.3：
OPC UA in a Nutshell / 14.1：
Is OPC UA Complicated? / 14.2：
Are OPC UA Services Difficult to Handle? / 14.2.1：
Is Information Modeling a Pain? / 14.2.2：
Transport Protocols and Encodings: Why So Many? / 14.2.3：
Implementation Issues / 14.2.4：
Migration of Existing Code / 14.2.5：
Management Summary / 14.2.6：
Outlook / 14.3：
Literature / 15：
Graphical Notation / Appendix A：
Motivation and Relation to UML
Notation
Node Classes and Attributes / Appendix B：
Base Information Model Reference / Appendix C：
Index
Foreword / Tom Burke
Preface / Jim Luth
About the Authors
24.
図書
Andrea S. Foulkes
目次情報:
続きを見る
Preface
List of Tables
List of Figures
Acronyms
Genetic Association Studies / 1：
Overview of population-based investigations / 1.1：
Types of investigations / 1.1.1：
Genotype versus gene expression / 1.1.2：
Population-versus family-based investigations / 1.1.3：
Assocation versus population genetics / 1.1.4：
Data components and terminology / 1.2：
Genetic information / 1.2.1：
Traits / 1.2.2：
Covariates / 1.2.3：
Data examples / 1.3：
Complex disease association studies / 1.3.1：
HIV genotype association studies / 1.3.2：
Publicly available data used throughout the text / 1.3.3：
Problems
Elementary Statistical Principles / 2：
Background / 2.1：
Notation and basic probability concepts / 2.1.1：
Important epidemiological concepts / 2.1.2：
Measures and tests of association / 2.2：
Contingency table analysis for a binary trait / 2.2.1：
M-sample tests for a quantitative trait / 2.2.2：
Generalized linear model / 2.2.3：
Analytic challenges / 2.3：
Multiplicity and high dimensionality / 2.3.1：
Missing and unobservable data considerations / 2.3.2：
Race and ethnicity / 2.3.3：
Genetic models and models of association / 2.3.4：
Genetic Data Concepts and Tests / 3：
Linkage disequilibrium (LD) / 3.1：
Measures of LD: D' and r2 / 3.1.1：
LD blocks and SNP tagging / 3.1.2：
LD and population stratification / 3.1.3：
Hardy-Weinberg equilibrium (HWE) / 3.2：
Pearson's X2-test and Fisher's exact test / 3.2.1：
HWE and population substructure / 3.2.2：
Quality control and preprocessing / 3.3：
SNP chips / 3.3.1：
Genotyping errors / 3.3.2：
Identifying population substructure / 3.3.3：
Relatedness / 3.3.4：
Accounting for unobservable substructure / 3.3.5：
Multiple Comparison Procedures / 4：
Measures of error / 4.1：
Family-wise error rate / 4.1.1：
False discovery rate / 4.1.2：
Single-step and step-down adjustments / 4.2：
Bonferroni adjustment / 4.2.1：
Tukey and Scheffe tests / 4.2.2：
False discovery rate control / 4.2.3：
The q-value / 4.2.4：
Resampling-based methods / 4.3：
Free step-down resampling / 4.3.1：
Null unrestricted bootstrap / 4.3.2：
Alternative paradigms / 4.4：
Effective number of tests / 4.4.1：
Global tests / 4.4.2：
Methods for Unobservable Phase / 5：
Haplotype estimation / 5.1：
An expectation-maximization algorithm / 5.1.1：
Bayesian haplotype reconstruction / 5.1.2：
Estimating and testing for haplotype-trait association / 5.2：
Two-stage approaches / 5.2.1：
A fully likelihood-based approach / 5.2.2：
Supplemental notes
Supplemental R scripts
Classification and Regression Trees / 6：
Building a tree / 6.1：
Recursive partitioning / 6.1.1：
Splitting rules / 6.1.2：
Defining inputs / 6.1.3：
Optimal trees / 6.2：
Honest estimates / 6.2.1：
Cost-complexity pruning / 6.2.2：
Additional Topics in High-Dimensional Data Analysis / 7：
Random forests / 7.1：
Variable importance / 7.1.1：
Missing data methods / 7.1.2：
Logic regression / 7.1.3：
Multivariate adaptive regression splines / 7.3：
Bayesian variable selection / 7.4：
Further readings / 7.5：
Appendix R Basics
Getting started / A.1：
Types of data objects / A.2：
Importing data / A.3：
Managing data / A.4：
Installing packages / A.5：
Additional help / A.6：
References
Glossary of Terms
Glossary of Select R Packages
Subject Index
Index of R Functions and Packages
Preface
List of Tables
List of Figures
25.
ＥＢ
Kazunori Ozawa
出版情報:
Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Inc., 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
List of Contributors
General Concepts / Kenzo Matsuki ; Kazunori Ozawa1：
Brief Outline of Batteries / 1.1：
Galvanic Cell System - Aqueous Electrolyte System / 1.1.1：
Lithium-Cell System - Nonaqueous Electrolyte System / 1.1.2：
Early Development of Lithium-Ion Batteries / 1.2：
Ceramics Production Capability / 1.2.1：
Coating Technology / 1.2.2：
LiPF6 as a Salt for Electrolytes / 1.2.3：
Graphite Conductor in the Cathode / 1.2.4：
Using Hard Carbon for the Anode / 1.2.5：
Nonwoven Shut-down Separator / 1.2.6：
Ni-Plated Fe Can / 1.2.7：
Toward a Realistic Goal / 1.3：
References
Lithium Insertion Materials Having Spinel-Framework Structure for Advanced Batteries / Kingo Ariyoshi ; Yoshinari Makimura ; Tsutomu Ohzuku2：
Introduction / 2.1：
Structural Description of Spinel / 2.2：
Derivatives of Spinel-Framework Structure / 2.3：
Superlattice Structures Derived from "Spinel" / 2.3.1：
Examples of Superstructure Derived from "Spinel" / 2.3.2：
Electrochemistry of Lithium Insertion Materials Having Spinel-Framework Structure / 2.4：
Lithium Manganese Oxides (LMO) / 2.4.1：
Lithium Titanium Oxide (LTO) / 2.4.2：
Lithium Nickel Manganese Oxide (LiNiMO) / 2.4.3：
An Application of Lithium Insertion Materials Having Spinel-Framework Structure to 12 V "Lead-Free" Accumulators / 2.5：
Twelve-Volt Batteries Consisting of Lithium Titanium Oxide (LTO) and Lithium Manganese Oxide (LMO) / 2.5.1：
Twelve-Volt Batteries Consisting of Lithium Titanium Oxide (LTO) and Lithium Nickel Manganese Oxide (LiNiMO) / 2.5.2：
Concluding Remarks / 2.6：
Overlithiated Li1+x (Niz Co1-2Z Mnz )1-x O2 as Positive Electrode Materials for Lithium-Ion Batteries / Naoaki Kumagai ; Jung-Min Kim3：
Co-Free Li1+x (Ni1/2 Mn1/2 )1-x O2 / 3.1：
Li1+x (Ni1/3 Co1/3 Mn1/3 )1-x O2 / 3.3：
Other Li1+x (Niz Co1-2z Mnz )1-x O2 Materials / 3.4：
Conclusion / 3.5：
Iron-Based Rare-Metal-Free Cathodes / Shigeto Okada ; Jun-ichi Yamaki4：
2D Layered Rocksalt-Type Oxide Cathode / 4.1：
3D NASICON-Type Sulfate Cathode / 4.3：
3D Olivine-Type Phosphate Cathode / 4.4：
3D Calcite-Type Borate Cathode / 4.5：
3D Perovskite-Type Fluoride Cathode / 4.6：
Summary / 4.7：
Thermodynamics of Electrode Materials for Lithium-Ion Batteries / Rachid Yazami5：
Experimental / 5.1：
The ETMS / 5.2.1：
Electrochemical Cells: Construction and Formation Cycles / 5.2.2：
Thermodynamics Data Acquisition / 5.2.3：
Results / 5.3：
Carbonaceous Anode Materials / 5.3.1：
Pre-coke (HTT < 500 C) / 5.3.1.1：
Cokes HTT 900-1700°C / 5.3.1.2：
Cokes HTT 2200 and 2600°C / 5.3.1.3：
Natural Graphite / 5.3.1.4：
Entropy and Degree of Graphitization / 5.3.1.5：
Cathode Materials / 5.3.2：
LiCoO2 / 5.3.2.1：
LiMn2 O4 / 5.3.2.2：
Effect of Cycling on Thermodynamics / 5.3.2.3：
Raman Investigation of Cathode Materials for Lithium Batteries / Rita Baddour-Hadjean ; Jean-Pierre Pereira-Ramos5.4：
Raman Microspectrometry: Principle and Instrumentation / 6.1：
Principle / 6.2.1：
Instrumentation / 6.2.2：
Transition Metal-Oxide-Based Compounds / 6.3：
LiNiO2 and Its Derivative Compounds LiNi1-y Coy O2 (0 < y < 1) / 6.3.1：
Manganese Oxide-Based Compounds / 6.3.3：
MnO2 -Type Compounds / 6.3.3.1：
Ternary Lithiated Lix MnOy Compounds / 6.3.3.2：
V2 O5 / 6.3.4：
V2 O5 Structure / 6.3.4.1：
Structural Features of the Lix V2 O5 Phases / 6.3.4.2：
Titanium Dioxide / 6.3.5：
Phospho-Olivine LiMPO4 Compounds / 6.4：
General Conclusion / 6.5：
Development of Lithium-Ion Batteries: From the Viewpoint of Importance of the Electrolytes / Masaki Yoshio ; Hiroyoshi Nakamura ; Nikolay Dimov7：
General Design to Find Additives for Improving the Performance of LIB / 7.1：
A Series of Developing Processes to Find Novel Additives / 7.3：
Cathodic and the Other Additives for LIBs / 7.4：
Conditioning / 7.5：
Inorganic Additives and Electrode Interface / Shinichi Komaba8：
Transition Metal Ions and Cathode Dissolution / 8.1：
Mn(II) Ion / 8.2.1：
Co(II) Ion / 8.2.2：
Ni(II) Ion / 8.2.3：
How to Suppress the Mn(II) Degradation / 8.3：
LiI, LiBr, and NH4 I / 8.3.1：
2-Vinylpyridine / 8.3.2：
Alkali Metal Ions / 8.4：
Na+ Ion / 8.4.1：
K+ Ion / 8.4.2：
Alkali Salt Coating / 8.5：
Characterization of Solid Polymer Electrolytes and Fabrication of all Solid-State Lithium Polymer Secondary Batteries / Masataka Wakihara ; Masanobu Nakayama ; Yuki Kato8.6：
Molecular Design and Characterization of Polymer Electrolytes with Li Salts / 9.1：
Solid Polymer Electrolytes with Plasticizers / 9.1.1：
Preparation of SPE Films with B-PEG and Al-PEG Plasticizers / 9.1.3：
Evaluation of SPE Films with B-PEG Plasticizers / 9.1.4：
Ionic Conductivity of SPE Films with B-PEG Plasticizers / 9.1.5：
Transport Number of Lithium Ions / 9.1.6：
Electrochemical Stability / 9.1.7：
Fabrication of All-Solid-State Lithium Polymer Battery / 9.1.8：
Required Ionic Conductivity of SPE / 9.2.1：
Difference between Conventional Battery with Liquid Electrolyte and All-Solid-State LPB / 9.2.3：
Fabrication and Electrochemical Performance of LPBs Using SPE with B-PEG and/or Al-PEG Plasticizers / 9.2.4：
Fabrication of a Nonflammable Lithium Polymer Battery and Its Electrochemical Evaluation / 9.2.5：
Thin-Film Metal-Oxide Electrodes for Lithium Microbatteries / 9.2.6：
Lithium Cobalt Oxide Thin Films / 10.1：
Sputtered LiCoO2 Films / 10.2.1：
Liquid Electrolyte / 10.2.1.1：
Solid-State Electrolyte / 10.2.1.2：
PLD LiCoO2 Films / 10.2.2：
CVD LiCoO2 Films / 10.2.3：
LiCoO2 Films Prepared by Chemical Routes / 10.2.4：
LiNiO2 and Its Derivatives Compounds LiNi1-x MO2 / 10.2.5：
Li - Ni - Mn Films / 10.3.1：
LiMn2 O4 Films / 10.3.4：
Sputtered LiMn2 O4 Films / 10.4.1：
PLD LiMn2 O4 Films / 10.4.2：
ESD LiMn2 O4 Films / 10.4.3：
LiMn2 O4 Films Prepared Through Chemical Routes / 10.4.4：
Substituted LiMn2-x Mx O4 Spinel Films / 10.4.5：
V2 O5 Thin Films / 10.4.6：
Sputtered V2 O5 Thin Films / 10.5.1：
PLD V2 O5 Thin Films / 10.5.1.1：
CVD V2 O5 Films / 10.5.3：
V2 O5 Films Prepared by Evaporation Techniques / 10.5.4：
V2 O5 Films Prepared by Electrostatic Spray Deposition / 10.5.5：
V2 O5 Films Prepared via Solution Techniques / 10.5.6：
MoO3 Thin Films / 10.5.7：
Solid State Electrolyte / 10.6.1：
General Conclusions / 10.6.3：
Research and Development Work on Advanced Lithium-Ion Batteries for High-Performance Environmental Vehicles / Hideaki Horie11：
Energy Needed to Power an EV / 11.1：
Quest for a High-Power Characteristic in Lithium-Ion Batteries / 11.3：
Cell Thermal Behavior and Cell System Stability / 11.4：
Further Reading
Index
Preface
List of Contributors
General Concepts / Kenzo Matsuki ; Kazunori Ozawa1：
26.
ＥＢ
Antonio Badia, M. P. Fourman, C. J. Mulvey, Dana S. Scott, London Mathematical Society.
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Basic Concepts / 2：
From Propositional to First Order Logic / 2.1：
Quantification / 2.2：
Semantics / 2.2.1：
Meaning / 2.2.2：
More on Quantification / 2.3：
Quantifier Scope and Prefixes / 2.3.1：
Skolemization / 2.3.2：
Quantifier Rank / 2.3.3：
Relativization / 2.3.4：
Games / 2.4：
More Semantics / 2.5：
Expressive Power of FOL / 2.5.1：
Finite and Infinite Models / 2.5.2：
Generalized Quantifiers / 3：
Another view / 3.1：
Basic Complexity / 3.4：
QLGQ: A Query Language with Generalized Quantifiers / 4：
Introduction: GQs in Query languages / 4.1：
QLGQ / 4.2：
Syntax of QLGQ / 4.2.1：
Semantics of QLGQ / 4.2.2：
Remarks on Syntax / 4.2.3：
Safety and Domain Independence / 4.3：
Relation to other languages / 4.3.1：
Generalized Quantifiers and SQL / 4.4：
Implementation and Optimization of Standard GQs / 5：
Languages to Define GQs / 5.1：
Translating and Optimizing QLGQ / 5.2：
The Interpreter / 5.3：
Complex Queries / 5.3.1：
Optimization / 5.4：
Optimization on RA Expressions / 5.4.1：
Optimization using GQ Properties / 5.4.2：
Application to SQL / 5.5：
Monadic vs. Polyadic Quantification / 5.6：
Quantifier Prefixes / 6：
Linear and Non-linear Prefixes / 6.1：
Henkin Prefixes and Generalized Quantifiers / 6.1.2：
Linear and Non-Linear Prefixes in QLGQ / 6.2：
Cumulation / 6.3：
Branching / 6.4：
Linear Prefixes / 6.5：
Algebraic Translation / 6.5.1：
Cooperative Query Answering / 7：
Cooperative Query Answering with QLGQ / 7.1：
Presuppositions / 7.3.1：
Constructing Explanations and Justifications / 7.3.2：
Relaxed Queries / 7.3.3：
Expressing and Using Constraints / 7.3.4：
Further Research in CQA / 7.4：
Generalized Quantifiers and Natural Language / 8：
Question Answering / 8.1：
GQs in Natural Language Analysis / 8.3：
Combining Quantifiers / 8.3.1：
QLGQ in QA / 8.4：
CQA, QA and GQs / 8.5：
Challenges / 8.6：
Extensions / 9：
Datalog-like Languages / 9.1：
Aggregates / 9.1.1：
Fixpoint / 9.1.2：
Higher Order Variables / 9.1.3：
Distributed Quantification / 9.2：
Quantification and Distributed Databases / 9.2.1：
Computing Distributed Quantification / 9.2.2：
Other Data Models / 9.3：
Conclusion / 10：
References
Introduction / 1：
Basic Concepts / 2：
From Propositional to First Order Logic / 2.1：
27.
ＥＢ
Mario Lefebvre
出版情報:
SpringerLink Books - AutoHoldings , Springer New York, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
List of Tables
List of Figures
Review of differential calculus / 1：
Limits and continuity / 1.1：
Derivatives / 1.2：
Integrals / 1.3：
Particular integration techniques / 1.3.1：
Double integrals / 1.3.2：
Infinite series / 1.4：
Geometric series / 1.4.1：
Exercises for Chapter 1 / 1.5：
Elementary probability / 2：
Random experiments / 2.1：
Events / 2.2：
Probability / 2.3：
Conditional probability / 2.4：
Total probability / 2.5：
Combinatorial analysis / 2.6：
Exercises for Chapter 2 / 2.7：
Random variables / 3：
Introduction / 3.1：
Discrete case / 3.1.1：
Continuous case / 3.1.2：
Important discrete random variables / 3.2：
Binomial distribution / 3.2.1：
Geometric and negative binomial distributions / 3.2.2：
Hypergeometric distribution / 3.2.3：
Poisson distribution and process / 3.2.4：
Important continuous random variables / 3.3：
Normal distribution / 3.3.1：
Gamma distribution / 3.3.2：
Weibull distribution / 3.3.3：
Beta distribution / 3.3.4：
Lognormal distribution / 3.3.5：
Functions of Random variables / 3.4：
Characteristics of random variables / 3.4.1：
Exercises for Chapter 3 / 3.6：
Random vectors / 4：
Discrete random vectors / 4.1：
Continuous random vectors / 4.2：
Functions of random vectors / 4.3：
Convolutions / 4.3.1：
Covariance and correlation coefficient / 4.4：
Limit theorems / 4.5：
Exercises for Chapter 4 / 4.6：
Reliability / 5：
Basic notions / 5.1：
Reliability of systems / 5.2：
Systems in series / 5.2.1：
Systems in parallel / 5.2.2：
Other cases / 5.2.3：
Paths and cuts / 5.3：
Exercises for Chapter 5 / 5.4：
Queueing / 6：
Continuous-time Markov chains / 6.1：
Quening systems with a single server / 6.2：
The M/M/1 model / 6.2.1：
The M/M/1 model with finite capacity / 6.2.2：
Queueing systems with two or more servers / 6.3：
The M/M/s model / 6.3.1：
The M/M/s/c model / 6.3.2：
Exercises for Chapter 6 / 6.4：
Time series / 7：
Particular time series models / 7.1：
Autoregressive processes / 7.2.1：
Moving average processes / 7.2.2：
Autoregressive moving average processes / 7.2.3：
Modeling and forecasting / 7.3：
Exercises for Chapter 7 / 7.4：
List of symbols and abbreviations / A：
Statistical tables / B：
Solutions to "Solved exercises" / C：
Answers to even-numbered exercises / D：
Answers to multiple choice questions / E：
References
Index
Preface
List of Tables
List of Figures
28.
ＥＢ
Antonio Badia, M. P. Fourman, C. J. Mulvey, Dana S. Scott, London Mathematical Society.
出版情報:
SpringerLink Books - AutoHoldings , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Basic Concepts / 2：
From Propositional to First Order Logic / 2.1：
Quantification / 2.2：
Semantics / 2.2.1：
Meaning / 2.2.2：
More on Quantification / 2.3：
Quantifier Scope and Prefixes / 2.3.1：
Skolemization / 2.3.2：
Quantifier Rank / 2.3.3：
Relativization / 2.3.4：
Games / 2.4：
More Semantics / 2.5：
Expressive Power of FOL / 2.5.1：
Finite and Infinite Models / 2.5.2：
Generalized Quantifiers / 3：
Another view / 3.1：
Basic Complexity / 3.4：
QLGQ: A Query Language with Generalized Quantifiers / 4：
Introduction: GQs in Query languages / 4.1：
QLGQ / 4.2：
Syntax of QLGQ / 4.2.1：
Semantics of QLGQ / 4.2.2：
Remarks on Syntax / 4.2.3：
Safety and Domain Independence / 4.3：
Relation to other languages / 4.3.1：
Generalized Quantifiers and SQL / 4.4：
Implementation and Optimization of Standard GQs / 5：
Languages to Define GQs / 5.1：
Translating and Optimizing QLGQ / 5.2：
The Interpreter / 5.3：
Complex Queries / 5.3.1：
Optimization / 5.4：
Optimization on RA Expressions / 5.4.1：
Optimization using GQ Properties / 5.4.2：
Application to SQL / 5.5：
Monadic vs. Polyadic Quantification / 5.6：
Quantifier Prefixes / 6：
Linear and Non-linear Prefixes / 6.1：
Henkin Prefixes and Generalized Quantifiers / 6.1.2：
Linear and Non-Linear Prefixes in QLGQ / 6.2：
Cumulation / 6.3：
Branching / 6.4：
Linear Prefixes / 6.5：
Algebraic Translation / 6.5.1：
Cooperative Query Answering / 7：
Cooperative Query Answering with QLGQ / 7.1：
Presuppositions / 7.3.1：
Constructing Explanations and Justifications / 7.3.2：
Relaxed Queries / 7.3.3：
Expressing and Using Constraints / 7.3.4：
Further Research in CQA / 7.4：
Generalized Quantifiers and Natural Language / 8：
Question Answering / 8.1：
GQs in Natural Language Analysis / 8.3：
Combining Quantifiers / 8.3.1：
QLGQ in QA / 8.4：
CQA, QA and GQs / 8.5：
Challenges / 8.6：
Extensions / 9：
Datalog-like Languages / 9.1：
Aggregates / 9.1.1：
Fixpoint / 9.1.2：
Higher Order Variables / 9.1.3：
Distributed Quantification / 9.2：
Quantification and Distributed Databases / 9.2.1：
Computing Distributed Quantification / 9.2.2：
Other Data Models / 9.3：
Conclusion / 10：
References
Introduction / 1：
Basic Concepts / 2：
From Propositional to First Order Logic / 2.1：
29.
ＥＢ
Ernesto; Jeong, Jechang Damiani, Ernesto Damiani, Jechang Jeong
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Low Level Approach for Image and Video Understanding / Part I：
GOP Structure Conversion in Transcoding MPEG-2 to H.264/AVC / Kangjun Lee ; Gwanggil Jeon ; Jechang Jeong1：
Introduction / 1.1：
GOP Structure Conversion / 1.2：
MV Scaling in the Temporal Direction / 1.2.1：
Correlation Between the Current MB Mode and the Reference Region / 1.2.2：
Proposed Algorithms / 1.3：
Adaptive Search Range Selection through the MV Linearity Test in the Temporal Direction / 1.3.1：
Adaptive Mode Decision Method Based on Region Information / 1.3.2：
Simulation Results / 1.4：
Conclusion / 1.5：
References
Simple Low Level Features for Image Analysis / Paolo Falcoz2：
The Role of Color / 2.1：
Color Spaces / 2.2.1：
HSL and HSV / 2.2.2：
CIE-Lab / 2.2.3：
Color Flattening / 2.2.4：
Blob Detection / 2.3：
Edge Detection / 2.4：
Simple Shapes / 2.5：
Scale and Position Invariants: Procrustes Analysis / 2.5.1：
Shape Alignment: Iterative Closest Point / 2.5.2：
Shape Encoding and Matching: Curvature Space Scale / 2.5.3：
Combination of simple features / 2.6：
Conclusions / 2.7：
Fast and robust Face Detection / Marco Anisetti3：
Related work / 3.1：
Feature-based / 3.1.1：
Low level / 3.1.1.1：
Skin-map / 3.1.1.2：
Feature analysis / 3.1.1.3：
Template based / 3.1.1.4：
Appearance-based / 3.1.2：
Face detection on video stream / 3.2：
Efficient object detection / 3.3.1：
Appearance-based face detection / 3.3.2：
Features-based face detection / 3.3.3：
Adaptive Skin detection / 3.3.3.1：
Eyes detection and validation / 3.3.3.2：
Face normalization / 3.3.3.3：
Experimental results / 3.4：
Discussion and Conclusions / 3.4.1：
Automatic 3D Facial Fitting for Tracking in Video Sequence / Valerio Bellandi4：
The 3D Face Model / 4.1：
3D morphing basis / 4.2：
3D morphing basis for shape and expression / 4.2.1：
Shape Unit / 4.2.1.1：
Expression Unit / 4.2.1.2：
Appearance basis / 4.3：
PCA / 4.3.0.3：
Image-based PCA / 4.3.0.4：
3D Illumination basis / 4.4：
The General Purposes 3D Tracking Algorithm / 4.5：
Feature Location / 4.5.1：
Model adaptation / 4.6：
Feature-based pose estimation / 4.6.1：
Shape and expression inference / 4.6.2：
3D Tracking-based Model refinement / 4.6.3：
Initial refinement / 4.6.4：
Deep refinement / 4.6.5：
Multimedia Knowledge-Based Approaches and Applications / 4.7：
Input Devices and Interaction Techniques for VR-Enhanced Medicine / Luigi Gallo ; Giuseppe De Pietro5：
Related Works / 5.1：
Requirements Analysis / 5.3：
Interaction Metaphors and Techniques / 5.4：
Realistic Metaphors / 5.4.1：
A Realistic Metaphor: Virtual Hand / 5.4.1.1：
Magic Metaphors / 5.4.2：
A Magic Metaphor: Virtual Pointer / 5.4.2.1：
Pros and Cons of Realistic vs. Magic Interaction Metaphors / 5.4.3：
The Proposed Input Device: the Wiimote / 5.5：
Communication / 5.5.1：
Inputs / 5.5.2：
Outputs / 5.5.3：
Classification / 5.5.4：
The Proposed Interaction Techniques / 5.6：
The Manipulation State / 5.6.1：
Pointing / 5.6.1.1：
Translation and Zooming / 5.6.1.2：
Rotation / 5.6.1.3：
The Cropping State / 5.6.2：
Discussion / 5.7：
Bridging Sensing and Decision Making in Ambient Intelligence Environments / Elie Raad ; Bechara Al Bouna ; Richard Chbeir6：
Preliminaries / 6.1：
Templates / 6.4：
Uncertainty Resolver via Aggregation Functions / 6.5：
Average-based Function / 6.5.1：
Bayesian Network-Based Function / 6.5.2：
"Dempster and Shafer" -Based Function / 6.5.3：
Decision Tree-Based Function / 6.5.4：
Experimentation / 6.6：
Aggregation Function Accuracy and Time Processing / 6.6.1：
Value Distribution / 6.6.2：
Test 1: Values higher than 0.5 / 6.6.2.1：
Test 2: Values less than 0.5 / 6.6.2.2：
Test 3: Random Values / 6.6.2.3：
Test 5: 75% of the values are less than 0.5 / 6.6.2.4：
Test 6: Equally distributed values / 6.6.2.5：
Test 7: Distribution change / 6.6.2.6：
Test 8: Influence of the number of returned values 0 and 1 on the aggregated result / 6.6.2.7：
Template Tuning / 6.6.2.8：
Case 1: using the multimedia function f1 / 6.6.3.1：
Case 2: using the multimedia function f2 / 6.6.3.2：
Uncertainty threshold tuning / 6.6.3.3：
Ambient Intelligence in Multimedia and Virtual Reality Environments for the rehabilitation / Attila Benko ; Sik Lanyi Cecilia6.7：
Using AI by special needs users / 7.1：
Visual Impairment and Partially Sighted People / 7.2.1：
Deaf and Hard-of-Hearing People / 7.2.2：
Physically Disabled Persons / 7.2.3：
Mentally Disabled People / 7.2.4：
Smart Home / 7.2.5：
A detailed example of using AI in virtual reality for rehabilitation / 7.3：
Future vision / 7.4：
Acknowledgement / 7.5：
Artificial Neural Networks for Processing Graphs with Application to Image Understanding: A Survey / Monica Bianchini ; Franco Scarselli8：
From flat to structural Pattern Recognition / 8.1：
Graph processing by neural networks / 8.2：
Notation / 8.2.1：
A general framework for graph processing / 8.2.2：
Recursive Neural Networks / 8.2.3：
Graph Neural Networks / 8.2.4：
Other models / 8.2.5：
Graph-based representation of images / 8.3：
Image segmentation / 8.3.1：
Region Adjacency Graphs / 8.3.2：
Multi-resolution trees / 8.3.3：
Index / 8.4：
Low Level Approach for Image and Video Understanding / Part I：
GOP Structure Conversion in Transcoding MPEG-2 to H.264/AVC / Kangjun Lee ; Gwanggil Jeon ; Jechang Jeong1：
Introduction / 1.1：
30.
ＥＢ
Ernesto; Jeong, Jechang Damiani, Ernesto Damiani, Jechang Jeong
出版情報:
SpringerLink Books - AutoHoldings , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Low Level Approach for Image and Video Understanding / Part I：
GOP Structure Conversion in Transcoding MPEG-2 to H.264/AVC / Kangjun Lee ; Gwanggil Jeon ; Jechang Jeong1：
Introduction / 1.1：
GOP Structure Conversion / 1.2：
MV Scaling in the Temporal Direction / 1.2.1：
Correlation Between the Current MB Mode and the Reference Region / 1.2.2：
Proposed Algorithms / 1.3：
Adaptive Search Range Selection through the MV Linearity Test in the Temporal Direction / 1.3.1：
Adaptive Mode Decision Method Based on Region Information / 1.3.2：
Simulation Results / 1.4：
Conclusion / 1.5：
References
Simple Low Level Features for Image Analysis / Paolo Falcoz2：
The Role of Color / 2.1：
Color Spaces / 2.2.1：
HSL and HSV / 2.2.2：
CIE-Lab / 2.2.3：
Color Flattening / 2.2.4：
Blob Detection / 2.3：
Edge Detection / 2.4：
Simple Shapes / 2.5：
Scale and Position Invariants: Procrustes Analysis / 2.5.1：
Shape Alignment: Iterative Closest Point / 2.5.2：
Shape Encoding and Matching: Curvature Space Scale / 2.5.3：
Combination of simple features / 2.6：
Conclusions / 2.7：
Fast and robust Face Detection / Marco Anisetti3：
Related work / 3.1：
Feature-based / 3.1.1：
Low level / 3.1.1.1：
Skin-map / 3.1.1.2：
Feature analysis / 3.1.1.3：
Template based / 3.1.1.4：
Appearance-based / 3.1.2：
Face detection on video stream / 3.2：
Efficient object detection / 3.3.1：
Appearance-based face detection / 3.3.2：
Features-based face detection / 3.3.3：
Adaptive Skin detection / 3.3.3.1：
Eyes detection and validation / 3.3.3.2：
Face normalization / 3.3.3.3：
Experimental results / 3.4：
Discussion and Conclusions / 3.4.1：
Automatic 3D Facial Fitting for Tracking in Video Sequence / Valerio Bellandi4：
The 3D Face Model / 4.1：
3D morphing basis / 4.2：
3D morphing basis for shape and expression / 4.2.1：
Shape Unit / 4.2.1.1：
Expression Unit / 4.2.1.2：
Appearance basis / 4.3：
PCA / 4.3.0.3：
Image-based PCA / 4.3.0.4：
3D Illumination basis / 4.4：
The General Purposes 3D Tracking Algorithm / 4.5：
Feature Location / 4.5.1：
Model adaptation / 4.6：
Feature-based pose estimation / 4.6.1：
Shape and expression inference / 4.6.2：
3D Tracking-based Model refinement / 4.6.3：
Initial refinement / 4.6.4：
Deep refinement / 4.6.5：
Multimedia Knowledge-Based Approaches and Applications / 4.7：
Input Devices and Interaction Techniques for VR-Enhanced Medicine / Luigi Gallo ; Giuseppe De Pietro5：
Related Works / 5.1：
Requirements Analysis / 5.3：
Interaction Metaphors and Techniques / 5.4：
Realistic Metaphors / 5.4.1：
A Realistic Metaphor: Virtual Hand / 5.4.1.1：
Magic Metaphors / 5.4.2：
A Magic Metaphor: Virtual Pointer / 5.4.2.1：
Pros and Cons of Realistic vs. Magic Interaction Metaphors / 5.4.3：
The Proposed Input Device: the Wiimote / 5.5：
Communication / 5.5.1：
Inputs / 5.5.2：
Outputs / 5.5.3：
Classification / 5.5.4：
The Proposed Interaction Techniques / 5.6：
The Manipulation State / 5.6.1：
Pointing / 5.6.1.1：
Translation and Zooming / 5.6.1.2：
Rotation / 5.6.1.3：
The Cropping State / 5.6.2：
Discussion / 5.7：
Bridging Sensing and Decision Making in Ambient Intelligence Environments / Elie Raad ; Bechara Al Bouna ; Richard Chbeir6：
Preliminaries / 6.1：
Templates / 6.4：
Uncertainty Resolver via Aggregation Functions / 6.5：
Average-based Function / 6.5.1：
Bayesian Network-Based Function / 6.5.2：
"Dempster and Shafer" -Based Function / 6.5.3：
Decision Tree-Based Function / 6.5.4：
Experimentation / 6.6：
Aggregation Function Accuracy and Time Processing / 6.6.1：
Value Distribution / 6.6.2：
Test 1: Values higher than 0.5 / 6.6.2.1：
Test 2: Values less than 0.5 / 6.6.2.2：
Test 3: Random Values / 6.6.2.3：
Test 5: 75% of the values are less than 0.5 / 6.6.2.4：
Test 6: Equally distributed values / 6.6.2.5：
Test 7: Distribution change / 6.6.2.6：
Test 8: Influence of the number of returned values 0 and 1 on the aggregated result / 6.6.2.7：
Template Tuning / 6.6.2.8：
Case 1: using the multimedia function f1 / 6.6.3.1：
Case 2: using the multimedia function f2 / 6.6.3.2：
Uncertainty threshold tuning / 6.6.3.3：
Ambient Intelligence in Multimedia and Virtual Reality Environments for the rehabilitation / Attila Benko ; Sik Lanyi Cecilia6.7：
Using AI by special needs users / 7.1：
Visual Impairment and Partially Sighted People / 7.2.1：
Deaf and Hard-of-Hearing People / 7.2.2：
Physically Disabled Persons / 7.2.3：
Mentally Disabled People / 7.2.4：
Smart Home / 7.2.5：
A detailed example of using AI in virtual reality for rehabilitation / 7.3：
Future vision / 7.4：
Acknowledgement / 7.5：
Artificial Neural Networks for Processing Graphs with Application to Image Understanding: A Survey / Monica Bianchini ; Franco Scarselli8：
From flat to structural Pattern Recognition / 8.1：
Graph processing by neural networks / 8.2：
Notation / 8.2.1：
A general framework for graph processing / 8.2.2：
Recursive Neural Networks / 8.2.3：
Graph Neural Networks / 8.2.4：
Other models / 8.2.5：
Graph-based representation of images / 8.3：
Image segmentation / 8.3.1：
Region Adjacency Graphs / 8.3.2：
Multi-resolution trees / 8.3.3：
Index / 8.4：
Low Level Approach for Image and Video Understanding / Part I：
GOP Structure Conversion in Transcoding MPEG-2 to H.264/AVC / Kangjun Lee ; Gwanggil Jeon ; Jechang Jeong1：
Introduction / 1.1：
31.
ＥＢ
Maciej Drozdowski
出版情報:
Springer eBooks Computer Science , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Introduction / 1：
Field of Scheduling for Parallel Processing / 1.1：
Basic Scheduling Notions / 1.2：
Scheduling Theory Notions / 1.2.1：
Computer Systems Notions / 1.2.2：
Why We Need Scheduling / 1.3：
Problems, Models, Algorithms, and Schedules / 1.4：
References
Basics / 2：
Selected Definitions Form Graph Theory / 2.1：
Methodology of Complexity Theory / 2.2：
Problems, Machines, Complexity Functions / 2.2.1：
Basic Complexity Classes / 2.2.2：
Approximability of Hard Problems / 2.2.3：
Solving Hard Combinatorial Problems / 2.3：
Branch and Bound Algorithm / 2.3.1：
Dynamic Programming / 2.3.2：
Linear Programming / 2.3.3：
Metaheuristics / 2.3.4：
Parallel Performance Metrics / 2.4：
Vision of Scheduling in Parallel Systems / 3：
Hardware / 3.1：
CPU / 3.1.1：
Memory / 3.1.2：
Interconnection / 3.1.3：
Programming Environments / 3.2：
Runtime Environments / 3.3：
Operating System Peculiarities / 3.3.1：
Resource Managers / 3.3.2：
Classic Scheduling Theory / 4：
Definitions / 4.1：
?/?/? Notation and Complexity Inference / 4.2：
Scheduling Parallel Processors / 4.3：
Cmax Criterion / 4.3.1：
Lmax Criterion / 4.3.2：
?cj, ? wjcj Criteria / 4.3.3：
Beyond the Classics / 4.4：
New Criteria / 4.4.1：
Multicriteria Scheduling / 4.4.2：
Online Scheduling / 4.4.3：
Remarks on the Classic Scheduling Theory / 4.5：
Parallel Tasks / 5：
Parallel Tasks in Practice / 5.1：
Parallel Applications / 5.1.1：
Bandwidth and Storage Allocation / 5.1.2：
Reliable Computing / 5.1.3：
Assumptions and Definitions / 5.2：
Types of Parallel Tasks / 5.2.1：
Processing Time Functions / 5.2.2：
Extension of ?/?/? Notation / 5.2.3：
Rigid Tasks / 5.3：
Cmax, Lmax Criteria / 5.3.1：
Minsum Criteria / 5.3.2：
Other Heuristics for Rigid Task Scheduling / 5.3.3：
Moldable Tasks / 5.4：
Other Heuristics for Moldable Task Scheduling / 5.4.1：
Malleable Tasks / 5.5：
Cmax, Lmax, max WjSj Criteria / 5.5.1：
Other Heuristics for Malleable Task Scheduling / 5.5.2：
Tasks with Hypercube Shape / 5.6：
Subcube Allocation / 5.6.1：
Other Heuristics for Tasks with Hypercube Shape / 5.6.2：
Tasks with Mesh Shape / 5.7：
Submesh Allocation / 5.7.1：
Heuristics with a Guarantee / 5.7.2：
Heuristics Without a Guarantee / 5.7.3：
Multiprocessor Tasks / 5.8：
Cmax, Lmax, Criteria / 5.8.1：
Concluding Remarks on Parallel Task Model / 5.8.2：
Scheduling with Communication Delays / 6：
Scheduling with Communication Delays in Practice / 6.1：
Formulation of the Problem / 6.2：
Notation and Preliminaries / 6.2.1：
Interconnection Topology and Communication Delay Models / 6.2.2：
Technical Terminology / 6.2.3：
Limited Processor Number and No Duplication / 6.3：
Hard Cases / 6.4.1：
Polynomial Cases / 6.4.2：
Limited Processor Number and Duplication / 6.4.3：
Complexity of the Problem / 6.5.1：
Unlimited Processor Number and No Duplication / 6.5.2：
Unlimited Processor Number and Duplication / 6.6.1：
Scheduling in Processor Networks / 6.7.1：
Scheduling in Log P Model / 6.9：
Notation / 6.9.1：
Remarks on Scheduling in Log P Model / 6.9.2：
Scheduling with Hierarchical Communication / 6.10：
Problem Formulation and Notation / 6.10.1：
Further Reading and Conclusions / 6.10.2：
Other Branches of Scheduling with Communication Delays / 6.11.1：
Observations on Scheduling with Communication Delays / 6.11.2：
Divisible Loads / 7：
Star - Basic Formulation / 7.1：
Base Model / 7.1.1：
Start-Up Times, Message Sequencing, Complexity / 7.1.2：
Communication Options / 7.1.3：
Equivalent Speed / 7.1.4：
Interconnection Topologies / 7.2：
Chains / 7.2.1：
Trees / 7.2.2：
Meshes / 7.2.3：
Hypercubes / 7.2.4：
Arbitrary Graphs / 7.2.5：
Multi-installment Processing / 7.3：
Memory Constraints / 7.4：
Single Installement Processing / 7.4.1：
Processing Cost Optimization / 7.4.2：
Negligible Start-Up Times / 7.5.1：
Nonzero Start-Up Times / 7.5.2：
Multiple Tasks / 7.6：
Single Source Loads / 7.6.1：
Multiple Source Load / 7.6.2：
Time-Varying Environment / 7.7：
Expected Search Time / 7.8：
Steady-State Divisible Load Scheduling / 7.9：
Single Originator / 7.9.1：
Multiple Originators / 7.9.2：
Measuring Heuristics / 7.10：
Loop Scheduling / 7.10.2：
Other Heuristics / 7.10.3：
Toward Discrete Load Granularity / 7.11：
Rounding Techniques / 7.11.1：
Discretely Divisible Loads / 7.11.2：
DLT and Performance Evaluation / 7.12：
DLT and the Classic Performance Measures / 7.12.1：
Equivalent Processors and Ultimate Performance / 7.12.2：
Isoefficiency / 7.12.3：
Divisible Loads in Practice / 7.13：
Divisible Applications / 7.13.1：
Empirical Confirmations of DLT / 7.13.2：
Concluding Remarks on DLT / 7.14：
Back to Scheduling Models / 8：
On Scheduling Models / 8.1：
What Is a Parallel Application? / 8.1.1：
Parallel Systems in Scheduling Models / 8.1.2：
On Bridging the Models / 8.1.3：
The Case of Granularity / 8.1.4：
Criteria and Constraints / 8.1.5：
On Scheduling Algorithms / 8.2：
Computational Costs / 8.2.1：
Where Is My Scheduling Information? / 8.2.2：
It Is a Matter of Time / 8.3：
Toward Scheduling Problem Taxonomy Anyway? / 8.4：
Summary of the Notation / Appendix A：
Index
Preface
Introduction / 1：
Field of Scheduling for Parallel Processing / 1.1：
32.
ＥＢ
Maciej Drozdowski
出版情報:
SpringerLink Books - AutoHoldings , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Introduction / 1：
Field of Scheduling for Parallel Processing / 1.1：
Basic Scheduling Notions / 1.2：
Scheduling Theory Notions / 1.2.1：
Computer Systems Notions / 1.2.2：
Why We Need Scheduling / 1.3：
Problems, Models, Algorithms, and Schedules / 1.4：
References
Basics / 2：
Selected Definitions Form Graph Theory / 2.1：
Methodology of Complexity Theory / 2.2：
Problems, Machines, Complexity Functions / 2.2.1：
Basic Complexity Classes / 2.2.2：
Approximability of Hard Problems / 2.2.3：
Solving Hard Combinatorial Problems / 2.3：
Branch and Bound Algorithm / 2.3.1：
Dynamic Programming / 2.3.2：
Linear Programming / 2.3.3：
Metaheuristics / 2.3.4：
Parallel Performance Metrics / 2.4：
Vision of Scheduling in Parallel Systems / 3：
Hardware / 3.1：
CPU / 3.1.1：
Memory / 3.1.2：
Interconnection / 3.1.3：
Programming Environments / 3.2：
Runtime Environments / 3.3：
Operating System Peculiarities / 3.3.1：
Resource Managers / 3.3.2：
Classic Scheduling Theory / 4：
Definitions / 4.1：
?/?/? Notation and Complexity Inference / 4.2：
Scheduling Parallel Processors / 4.3：
Cmax Criterion / 4.3.1：
Lmax Criterion / 4.3.2：
?cj, ? wjcj Criteria / 4.3.3：
Beyond the Classics / 4.4：
New Criteria / 4.4.1：
Multicriteria Scheduling / 4.4.2：
Online Scheduling / 4.4.3：
Remarks on the Classic Scheduling Theory / 4.5：
Parallel Tasks / 5：
Parallel Tasks in Practice / 5.1：
Parallel Applications / 5.1.1：
Bandwidth and Storage Allocation / 5.1.2：
Reliable Computing / 5.1.3：
Assumptions and Definitions / 5.2：
Types of Parallel Tasks / 5.2.1：
Processing Time Functions / 5.2.2：
Extension of ?/?/? Notation / 5.2.3：
Rigid Tasks / 5.3：
Cmax, Lmax Criteria / 5.3.1：
Minsum Criteria / 5.3.2：
Other Heuristics for Rigid Task Scheduling / 5.3.3：
Moldable Tasks / 5.4：
Other Heuristics for Moldable Task Scheduling / 5.4.1：
Malleable Tasks / 5.5：
Cmax, Lmax, max WjSj Criteria / 5.5.1：
Other Heuristics for Malleable Task Scheduling / 5.5.2：
Tasks with Hypercube Shape / 5.6：
Subcube Allocation / 5.6.1：
Other Heuristics for Tasks with Hypercube Shape / 5.6.2：
Tasks with Mesh Shape / 5.7：
Submesh Allocation / 5.7.1：
Heuristics with a Guarantee / 5.7.2：
Heuristics Without a Guarantee / 5.7.3：
Multiprocessor Tasks / 5.8：
Cmax, Lmax, Criteria / 5.8.1：
Concluding Remarks on Parallel Task Model / 5.8.2：
Scheduling with Communication Delays / 6：
Scheduling with Communication Delays in Practice / 6.1：
Formulation of the Problem / 6.2：
Notation and Preliminaries / 6.2.1：
Interconnection Topology and Communication Delay Models / 6.2.2：
Technical Terminology / 6.2.3：
Limited Processor Number and No Duplication / 6.3：
Hard Cases / 6.4.1：
Polynomial Cases / 6.4.2：
Limited Processor Number and Duplication / 6.4.3：
Complexity of the Problem / 6.5.1：
Unlimited Processor Number and No Duplication / 6.5.2：
Unlimited Processor Number and Duplication / 6.6.1：
Scheduling in Processor Networks / 6.7.1：
Scheduling in Log P Model / 6.9：
Notation / 6.9.1：
Remarks on Scheduling in Log P Model / 6.9.2：
Scheduling with Hierarchical Communication / 6.10：
Problem Formulation and Notation / 6.10.1：
Further Reading and Conclusions / 6.10.2：
Other Branches of Scheduling with Communication Delays / 6.11.1：
Observations on Scheduling with Communication Delays / 6.11.2：
Divisible Loads / 7：
Star - Basic Formulation / 7.1：
Base Model / 7.1.1：
Start-Up Times, Message Sequencing, Complexity / 7.1.2：
Communication Options / 7.1.3：
Equivalent Speed / 7.1.4：
Interconnection Topologies / 7.2：
Chains / 7.2.1：
Trees / 7.2.2：
Meshes / 7.2.3：
Hypercubes / 7.2.4：
Arbitrary Graphs / 7.2.5：
Multi-installment Processing / 7.3：
Memory Constraints / 7.4：
Single Installement Processing / 7.4.1：
Processing Cost Optimization / 7.4.2：
Negligible Start-Up Times / 7.5.1：
Nonzero Start-Up Times / 7.5.2：
Multiple Tasks / 7.6：
Single Source Loads / 7.6.1：
Multiple Source Load / 7.6.2：
Time-Varying Environment / 7.7：
Expected Search Time / 7.8：
Steady-State Divisible Load Scheduling / 7.9：
Single Originator / 7.9.1：
Multiple Originators / 7.9.2：
Measuring Heuristics / 7.10：
Loop Scheduling / 7.10.2：
Other Heuristics / 7.10.3：
Toward Discrete Load Granularity / 7.11：
Rounding Techniques / 7.11.1：
Discretely Divisible Loads / 7.11.2：
DLT and Performance Evaluation / 7.12：
DLT and the Classic Performance Measures / 7.12.1：
Equivalent Processors and Ultimate Performance / 7.12.2：
Isoefficiency / 7.12.3：
Divisible Loads in Practice / 7.13：
Divisible Applications / 7.13.1：
Empirical Confirmations of DLT / 7.13.2：
Concluding Remarks on DLT / 7.14：
Back to Scheduling Models / 8：
On Scheduling Models / 8.1：
What Is a Parallel Application? / 8.1.1：
Parallel Systems in Scheduling Models / 8.1.2：
On Bridging the Models / 8.1.3：
The Case of Granularity / 8.1.4：
Criteria and Constraints / 8.1.5：
On Scheduling Algorithms / 8.2：
Computational Costs / 8.2.1：
Where Is My Scheduling Information? / 8.2.2：
It Is a Matter of Time / 8.3：
Toward Scheduling Problem Taxonomy Anyway? / 8.4：
Summary of the Notation / Appendix A：
Index
Preface
Introduction / 1：
Field of Scheduling for Parallel Processing / 1.1：
33.
ＥＢ
Christian Perwass, Herbert Edelsbrunner, Leif Kobbelt, Leif Kobbelt, Konrad Polthier. edited by Herbert Edelsbrunner
出版情報:
Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
History / 1.1：
Geometry / 1.2：
Outlook / 1.3：
Overview of This Text / 1.4：
CLUCalc / 1.4.1：
Algebra / 1.4.2：
Geometries / 1.4.3：
Numerics / 1.4.4：
Uncertain Geometric Entities and Operators / 1.4.5：
The Inversion Camera Model / 1.4.6：
Monocular Pose Estimation / 1.4.7：
Versor Functions / 1.4.8：
Random Variable Space / 1.4.9：
Overview of Geometric Algebra / 1.5：
Basics of the Algebra / 1.5.1：
General Vectors / 1.5.2：
Transformations / 1.5.3：
Outermorphism / 1.5.5：
Learning Geometric Algebra with CLUCalc / 2：
Background / 2.1：
The Software / 2.2：
Editor Window / 2.2.1：
Visualization Window / 2.2.2：
Output Window / 2.2.3：
Command Line Parameters / 2.2.4：
The Scripting Language / 2.3：
Basics / 2.3.1：
Visualizing Geometry / 2.3.2：
User Interaction / 2.3.3：
Animation / 2.3.4：
Annotating Graphics / 2.3.5：
Multivector Calculations / 2.3.6：
Summary / 2.4：
Theory / Part I：
Axioms / 3：
Basic Properties / 3.1.2：
Algebraic Basis / 3.1.3：
Involutions / 3.1.4：
Duality / 3.1.5：
Inner and Outer Product / 3.1.6：
Blades / 3.2：
Geometric Product / 3.2.1：
Outer Product / 3.2.2：
Scalar Product / 3.2.3：
Reverse / 3.2.4：
Conjugate / 3.2.5：
Norm / 3.2.6：
Inner Product / 3.2.7：
Inverse / 3.2.8：
Projection / 3.2.10：
Rejection / 3.2.11：
Meet and Join / 3.2.12：
Regressive Product / 3.2.13：
Versors / 3.3：
Definitions / 3.3.1：
Properties / 3.3.2：
Linear Functions / 3.4：
Determinant / 3.4.1：
Determinant Product / 3.4.2：
Reciprocal Bases / 3.4.3：
Definition / 3.5.1：
Example / 3.5.2：
Differentiation / 3.6：
Vector Derivative / 3.6.1：
Multivector Differentiation / 3.6.2：
Tensor Representation / 3.6.3：
Algorithms / 3.7：
Basis Orthogonalization / 3.7.1：
Factorization of Blades / 3.7.2：
Evaluation of the Join / 3.7.3：
Versor Factorization / 3.7.4：
Related Algebras / 3.8：
Gibbs's Vector Algebra / 3.8.1：
Complex Numbers / 3.8.2：
Quaternions / 3.8.3：
Grassmann Algebra / 3.8.4：
Grassmann-Cayley Algebra / 3.8.5：
Euclidean Space / 4：
Outer-Product Representations / 4.1.1：
Geometric Interpretation of the Inner Product / 4.1.2：
Inner Product Representation / 4.1.3：
Reflections / 4.1.4：
Rotations / 4.1.5：
Mean Rotor / 4.1.6：
Projective Space / 4.2：
Inner-Product Representations / 4.2.1：
Reflections in Projective Space / 4.2.4：
Rotations in Projective Space / 4.2.5：
Conformal Space / 4.3：
Stereographic Embedding of Euclidean Space / 4.3.1：
Homogenization of Stereographic Embedding / 4.3.2：
Geometric Algebra on R[superscript n+1,1] / 4.3.3：
Inner-Product Representations in G[subscript 4,1] / 4.3.4：
Outer-Product Representations in G[subscript 4,1] / 4.3.5：
Summary of Representations / 4.3.6：
Stratification of Spaces / 4.3.7：
Reflections in G[subscript n+1,1] / 4.3.8：
Inversions in G[subscript n+1,1] / 4.3.9：
Translations in G[subscript n+1,1] / 4.3.10：
Rotations in G[subscript n+1,1] / 4.3.11：
Dilations in G[subscript n+1,1] / 4.3.12：
Summary of Operator Representations / 4.3.13：
Incidence Relations / 4.3.14：
Analysis of Blades / 4.3.15：
Conic Space / 4.4：
Polynomial Embedding / 4.4.1：
Symmetric-Matrix Vector Space / 4.4.2：
The Geometric Algebra G[subscript 6] / 4.4.3：
Rotation Operator / 4.4.4：
Analysis of Conics / 4.4.5：
Intersecting Lines and Conics / 4.4.6：
Intersection of Conics / 4.4.7：
Conformal Conic Space / 4.5：
The Vector Space / 4.5.1：
The Geometric Algebra G[subscript 5,3] / 4.5.2：
Component Vectors / 5：
Example: Geometric Product in G[subscript 2] / 5.1.2：
Subspace Projection / 5.1.3：
Example: Reduced Geometric Product / 5.1.4：
Change of Basis / 5.1.5：
Solving Linear Geometric Algebra Equations / 5.2：
Inverse of a Multivector / 5.2.1：
Versor Equation / 5.2.2：
Example: Inverse of a Multivector in G[subscript 2] / 5.2.3：
Random Multivectors / 5.3：
First-Order Error Propagation / 5.3.1：
Bilinear Functions / 5.3.3：
Validity of Error Propagation / 5.3.4：
Non-Gaussivity / 5.4.1：
Error Propagation Bias / 5.4.2：
Conclusions / 5.4.3：
Uncertainty in Projective Space / 5.5：
Mapping / 5.5.1：
Random Homogeneous Vectors / 5.5.2：
Conditioning / 5.5.3：
Uncertainty in Conformal Space / 5.6：
Blades and Operators / 5.6.1：
Uncertainty in Conic Space / 5.7：
The Gauss-Markov Model / 5.8：
Linearization / 5.8.1：
Constraints on Parameters Alone / 5.8.2：
Least-Squares Estimation / 5.8.3：
Numerical Calculation / 5.8.4：
Generalization / 5.8.5：
The Gauss-Helmert Model / 5.9：
The Constraints / 5.9.1：
Least-Squares Minimization / 5.9.2：
Derivation of the Covariance Matrix [Sigma subscript Delta p, Delta p] / 5.9.3：
Numerical Evaluation / 5.9.4：
Applying the Gauss-Markov and Gauss-Helmert Models / 5.9.5：
Iterative Application of Gauss-Helmert Method / 5.10.1：
Applications / Part II：
Construction / 6：
Geometric Entities in Conformal Space / 6.1.1：
Geometric Entities in Conic Space / 6.1.2：
Operators in Conformal Space / 6.1.3：
Estimation / 6.2：
Estimation of Geometric Entities / 6.2.1：
Projective Versor Equation / 6.2.2：
Constraint Metrics / 6.2.4：
Estimation of a 3D Circle / 6.2.5：
Estimation of a General Rotor / 6.2.6：
Hypothesis Testing / 6.3：
The Pinhole Camera Model / 7：
Definition of the Inversion Camera Model / 7.2：
From Pinhole to Lens / 7.3：
Mathematical Formulation / 7.3.1：
Relationship Between Focal Length and Lens Distortion / 7.3.2：
Fisheye Lenses / 7.4：
Catadioptric Camera / 7.5：
Extensions / 7.6：
Initial Pose / 8：
Formulation of the Problem in CGA / 8.2：
Solution Method / 8.3：
Tensor Form / 8.3.1：
Jacobi Matrices / 8.3.2：
Constraints on Parameters / 8.3.3：
Iterative Estimation / 8.3.4：
Experiments / 8.4：
Setup / 8.4.1：
Execution / 8.4.2：
Results / 8.4.3：
Coupled Motors / 8.5：
Cycloidal Curves / 9.1.1：
Fourier Series / 9.1.2：
Space Curves / 9.1.3：
Pythagorean-Hodograph Curves / 9.2：
Relation to Versor Equation / 9.2.1：
Relation Between the Rotation and Reflection Forms / 9.2.2：
Pythagorean-Hodograph Quintic Hermite Interpolation / 9.2.4：
Degrees of Freedom / 9.2.5：
Curves of Constant Length / 9.2.6：
Pythagorean-Hodograph Curves in R[superscript n] / 9.2.7：
Proof of Lemma 9.5 / 9.2.8：
Random-Variable Space / 10：
A Random-Variable Vector Space / 10.1：
Probability Space / 10.1.1：
Continuous Random Variables / 10.1.2：
Multiple Random Variables / 10.1.3：
A Hilbert Space of Random Variables / 10.2：
The Norm / 10.2.1：
The Scalar Product / 10.2.2：
The Dirac Delta Distribution / 10.2.3：
Geometric Algebra over Random Variables / 10.3：
General Properties / 10.3.1：
Correlation / 10.3.3：
Normal Random Variables / 10.3.4：
Notation
References
Index
Introduction / 1：
History / 1.1：
Geometry / 1.2：
34.
ＥＢ
Christian Perwass, Herbert Edelsbrunner, Leif Kobbelt, Leif Kobbelt, Konrad Polthier. edited by Herbert Edelsbrunner, Konrad Polthier
出版情報:
SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
History / 1.1：
Geometry / 1.2：
Outlook / 1.3：
Overview of This Text / 1.4：
CLUCalc / 1.4.1：
Algebra / 1.4.2：
Geometries / 1.4.3：
Numerics / 1.4.4：
Uncertain Geometric Entities and Operators / 1.4.5：
The Inversion Camera Model / 1.4.6：
Monocular Pose Estimation / 1.4.7：
Versor Functions / 1.4.8：
Random Variable Space / 1.4.9：
Overview of Geometric Algebra / 1.5：
Basics of the Algebra / 1.5.1：
General Vectors / 1.5.2：
Transformations / 1.5.3：
Outermorphism / 1.5.5：
Learning Geometric Algebra with CLUCalc / 2：
Background / 2.1：
The Software / 2.2：
Editor Window / 2.2.1：
Visualization Window / 2.2.2：
Output Window / 2.2.3：
Command Line Parameters / 2.2.4：
The Scripting Language / 2.3：
Basics / 2.3.1：
Visualizing Geometry / 2.3.2：
User Interaction / 2.3.3：
Animation / 2.3.4：
Annotating Graphics / 2.3.5：
Multivector Calculations / 2.3.6：
Summary / 2.4：
Theory / Part I：
Axioms / 3：
Basic Properties / 3.1.2：
Algebraic Basis / 3.1.3：
Involutions / 3.1.4：
Duality / 3.1.5：
Inner and Outer Product / 3.1.6：
Blades / 3.2：
Geometric Product / 3.2.1：
Outer Product / 3.2.2：
Scalar Product / 3.2.3：
Reverse / 3.2.4：
Conjugate / 3.2.5：
Norm / 3.2.6：
Inner Product / 3.2.7：
Inverse / 3.2.8：
Projection / 3.2.10：
Rejection / 3.2.11：
Meet and Join / 3.2.12：
Regressive Product / 3.2.13：
Versors / 3.3：
Definitions / 3.3.1：
Properties / 3.3.2：
Linear Functions / 3.4：
Determinant / 3.4.1：
Determinant Product / 3.4.2：
Reciprocal Bases / 3.4.3：
Definition / 3.5.1：
Example / 3.5.2：
Differentiation / 3.6：
Vector Derivative / 3.6.1：
Multivector Differentiation / 3.6.2：
Tensor Representation / 3.6.3：
Algorithms / 3.7：
Basis Orthogonalization / 3.7.1：
Factorization of Blades / 3.7.2：
Evaluation of the Join / 3.7.3：
Versor Factorization / 3.7.4：
Related Algebras / 3.8：
Gibbs's Vector Algebra / 3.8.1：
Complex Numbers / 3.8.2：
Quaternions / 3.8.3：
Grassmann Algebra / 3.8.4：
Grassmann-Cayley Algebra / 3.8.5：
Euclidean Space / 4：
Outer-Product Representations / 4.1.1：
Geometric Interpretation of the Inner Product / 4.1.2：
Inner Product Representation / 4.1.3：
Reflections / 4.1.4：
Rotations / 4.1.5：
Mean Rotor / 4.1.6：
Projective Space / 4.2：
Inner-Product Representations / 4.2.1：
Reflections in Projective Space / 4.2.4：
Rotations in Projective Space / 4.2.5：
Conformal Space / 4.3：
Stereographic Embedding of Euclidean Space / 4.3.1：
Homogenization of Stereographic Embedding / 4.3.2：
Geometric Algebra on R[superscript n+1,1] / 4.3.3：
Inner-Product Representations in G[subscript 4,1] / 4.3.4：
Outer-Product Representations in G[subscript 4,1] / 4.3.5：
Summary of Representations / 4.3.6：
Stratification of Spaces / 4.3.7：
Reflections in G[subscript n+1,1] / 4.3.8：
Inversions in G[subscript n+1,1] / 4.3.9：
Translations in G[subscript n+1,1] / 4.3.10：
Rotations in G[subscript n+1,1] / 4.3.11：
Dilations in G[subscript n+1,1] / 4.3.12：
Summary of Operator Representations / 4.3.13：
Incidence Relations / 4.3.14：
Analysis of Blades / 4.3.15：
Conic Space / 4.4：
Polynomial Embedding / 4.4.1：
Symmetric-Matrix Vector Space / 4.4.2：
The Geometric Algebra G[subscript 6] / 4.4.3：
Rotation Operator / 4.4.4：
Analysis of Conics / 4.4.5：
Intersecting Lines and Conics / 4.4.6：
Intersection of Conics / 4.4.7：
Conformal Conic Space / 4.5：
The Vector Space / 4.5.1：
The Geometric Algebra G[subscript 5,3] / 4.5.2：
Component Vectors / 5：
Example: Geometric Product in G[subscript 2] / 5.1.2：
Subspace Projection / 5.1.3：
Example: Reduced Geometric Product / 5.1.4：
Change of Basis / 5.1.5：
Solving Linear Geometric Algebra Equations / 5.2：
Inverse of a Multivector / 5.2.1：
Versor Equation / 5.2.2：
Example: Inverse of a Multivector in G[subscript 2] / 5.2.3：
Random Multivectors / 5.3：
First-Order Error Propagation / 5.3.1：
Bilinear Functions / 5.3.3：
Validity of Error Propagation / 5.3.4：
Non-Gaussivity / 5.4.1：
Error Propagation Bias / 5.4.2：
Conclusions / 5.4.3：
Uncertainty in Projective Space / 5.5：
Mapping / 5.5.1：
Random Homogeneous Vectors / 5.5.2：
Conditioning / 5.5.3：
Uncertainty in Conformal Space / 5.6：
Blades and Operators / 5.6.1：
Uncertainty in Conic Space / 5.7：
The Gauss-Markov Model / 5.8：
Linearization / 5.8.1：
Constraints on Parameters Alone / 5.8.2：
Least-Squares Estimation / 5.8.3：
Numerical Calculation / 5.8.4：
Generalization / 5.8.5：
The Gauss-Helmert Model / 5.9：
The Constraints / 5.9.1：
Least-Squares Minimization / 5.9.2：
Derivation of the Covariance Matrix [Sigma subscript Delta p, Delta p] / 5.9.3：
Numerical Evaluation / 5.9.4：
Applying the Gauss-Markov and Gauss-Helmert Models / 5.9.5：
Iterative Application of Gauss-Helmert Method / 5.10.1：
Applications / Part II：
Construction / 6：
Geometric Entities in Conformal Space / 6.1.1：
Geometric Entities in Conic Space / 6.1.2：
Operators in Conformal Space / 6.1.3：
Estimation / 6.2：
Estimation of Geometric Entities / 6.2.1：
Projective Versor Equation / 6.2.2：
Constraint Metrics / 6.2.4：
Estimation of a 3D Circle / 6.2.5：
Estimation of a General Rotor / 6.2.6：
Hypothesis Testing / 6.3：
The Pinhole Camera Model / 7：
Definition of the Inversion Camera Model / 7.2：
From Pinhole to Lens / 7.3：
Mathematical Formulation / 7.3.1：
Relationship Between Focal Length and Lens Distortion / 7.3.2：
Fisheye Lenses / 7.4：
Catadioptric Camera / 7.5：
Extensions / 7.6：
Initial Pose / 8：
Formulation of the Problem in CGA / 8.2：
Solution Method / 8.3：
Tensor Form / 8.3.1：
Jacobi Matrices / 8.3.2：
Constraints on Parameters / 8.3.3：
Iterative Estimation / 8.3.4：
Experiments / 8.4：
Setup / 8.4.1：
Execution / 8.4.2：
Results / 8.4.3：
Coupled Motors / 8.5：
Cycloidal Curves / 9.1.1：
Fourier Series / 9.1.2：
Space Curves / 9.1.3：
Pythagorean-Hodograph Curves / 9.2：
Relation to Versor Equation / 9.2.1：
Relation Between the Rotation and Reflection Forms / 9.2.2：
Pythagorean-Hodograph Quintic Hermite Interpolation / 9.2.4：
Degrees of Freedom / 9.2.5：
Curves of Constant Length / 9.2.6：
Pythagorean-Hodograph Curves in R[superscript n] / 9.2.7：
Proof of Lemma 9.5 / 9.2.8：
Random-Variable Space / 10：
A Random-Variable Vector Space / 10.1：
Probability Space / 10.1.1：
Continuous Random Variables / 10.1.2：
Multiple Random Variables / 10.1.3：
A Hilbert Space of Random Variables / 10.2：
The Norm / 10.2.1：
The Scalar Product / 10.2.2：
The Dirac Delta Distribution / 10.2.3：
Geometric Algebra over Random Variables / 10.3：
General Properties / 10.3.1：
Correlation / 10.3.3：
Normal Random Variables / 10.3.4：
Notation
References
Index
Introduction / 1：
History / 1.1：
Geometry / 1.2：
35.
ＥＢ
Shayne Fletcher, C. Gardner, Christopher Gardner
出版情報:
Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Inc., 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Welcome to Python / 1：
Why Python? / 1.1：
Python is a general-purpose high-level programming language / 1.1.1：
Python integrates well with data analysis, visualisation and GUI toolkits / 1.1.2：
Python 'plays well with others' / 1.1.3：
Common misconceptions about Python / 1.2：
Roadmap for this book / 1.3：
The PPF Package / 2：
PPF topology / 2.1：
Unit testing / 2.2：
doctest / 2.2.1：
PyUnit / 2.2.2：
Building and installing PPF / 2.3：
Prerequisites and dependencies / 2.3.1：
Building the C++ extension modules / 2.3.2：
Installing the PPF package / 2.3.3：
Testing a PPF installation / 2.3.4：
Extending Python from C++ / 3：
Boost.Date_Time types / 3.1：
Examples / 3.1.1：
Boost.MultiArray and special functions / 3.2：
NumPy arrays / 3.3：
Accessing array data in C++ / 3.3.1：
Basic Mathematical Tools / 3.3.2：
Random number generation / 4.1：
N(.) / 4.2：
Interpolation / 4.3：
Linear interpolation / 4.3.1：
Loglinear interpolation / 4.3.2：
Linear on zero interpolation / 4.3.3：
Cubic spline interpolation / 4.3.4：
Root finding / 4.4：
Bisection method / 4.4.1：
Newton-Raphson method / 4.4.2：
Linear algebra / 4.5：
Matrix multiplication / 4.5.1：
Matrix inversion / 4.5.2：
Matrix pseudo-inverse / 4.5.3：
Solving linear systems / 4.5.4：
Solving tridiagonal systems / 4.5.5：
Solving upper diagonal systems / 4.5.6：
Singular value decomposition / 4.5.7：
Generalised linear least squares / 4.6：
Quadratic and cubic roots / 4.7：
Integration / 4.8：
Piecewise constant polynomial fitting / 4.8.1：
Piecewise polynomial integration / 4.8.2：
Semi-analytic conditional expectations / 4.8.3：
Market: Curves and Surfaces / 5：
Curves / 5.1：
Surfaces / 5.2：
Environment / 5.3：
Data Model / 6：
Observables / 6.1：
LIBOR / 6.1.1：
Swap rate / 6.1.2：
Flows / 6.2：
Adjuvants / 6.3：
Legs / 6.4：
Exercises / 6.5：
Trades / 6.6：
Trade utilities / 6.7：
Timeline: Events and Controller / 7：
Events / 7.1：
Timeline / 7.2：
Controller / 7.3：
The Hull-White Model / 8：
A component-based design / 8.1：
Requestor / 8.1.1：
State / 8.1.2：
Filler / 8.1.3：
Rollback / 8.1.4：
Evolve / 8.1.5：
Exercise / 8.1.6：
The model and model factories / 8.2：
Concluding remarks / 8.3：
Pricing using Numerical Methods / 9：
A lattice pricing framework / 9.1：
A Monte-Carlo pricing framework / 9.2：
Pricing non-callable trades / 9.2.1：
Pricing callable trades / 9.2.2：
Pricing Financial Structures in Hull-White / 9.3：
Pricing a Bermudan / 10.1：
Pricing a TARN / 10.2：
Hybrid Python/C++ Pricing Systems / 10.3：
nth_imm_of_year revisited / 11.1：
Exercising nth_imm_of_year from C++ / 11.2：
Python Excel Integration / 12：
Black-scholes COM server / 12.1：
VBS client / 12.1.1：
VBA client / 12.1.2：
Numerical pricing with PPF in Excel / 12.2：
Common utilities / 12.2.1：
Market server / 12.2.2：
Trade server / 12.2.3：
Pricer server / 12.2.4：
Appendices
Python / A：
Python interpreter modes / A.1：
Interactive mode / A.1.1：
Batch mode / A.1.2：
Basic Python / A.2：
Simple expressions / A.2.1：
Built-in data types / A.2.2：
Control flow statements / A.2.3：
Functions / A.2.4：
Classes / A.2.5：
Modules and packages / A.2.6：
Conclusion / A.3：
Boost.Python / B：
Hello world / B.1：
Classes, constructors and methods / B.2：
Inheritance / B.3：
Python operators / B.4：
Enums / B.5：
Embedding / B.7：
Hull-White Model Mathematics / B.8：
Pickup Value Regression / D：
Bibliography
Index
Welcome to Python / 1：
Why Python? / 1.1：
Python is a general-purpose high-level programming language / 1.1.1：
36.
ＥＢ
Bryon K. Ehlmann, Bart Childs, Ilpo Laine, Olli Lehto, Tuomas Sorvali
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Motivation
Purpose
Readers
Structure
Downloads
Acknowledgments
About the Author
Contents
List of Abbreviations
About Relationships and ORN / Part I：
Introduction Including a Brief History of Relationships / Chapter I：
Relationships / 1.1：
A Brief History of Relationships / 1.2：
The paper-based system / 1.2.1：
The computerized file-based system / 1.2.2：
Early data models and DBMSs / 1.2.3：
The relational model and RDBMS / 1.2.4：
The entity-relationship model and database / 1.2.5：
Semantic models, the object model, and the ODBMS / 1.2.6：
The object-relational DBMS / 1.2.7：
Problems in Modeling and Implementing Relationships / 1.3：
Preview of a Solution / 1.4：
Object Relationship Notation (ORN) / Chapter 2：
Syntax / 2.1：
Graphical Representation / 2.2：
Semantics / 2.3：
Examples / 2.4：
<*-to-*> / 2.4.1：
<1-to-*>|- / 2.4.2：
<0..1-to-*>|- / 2.4.3：
<0..1-to*>|-X- / 2.4.4：
<0..1-to-1..*>? / 2.4.5：
!<0..1-to-*> / 2.4.6：
'<*-to-1..*> / 2.4.7：
Flashback to the Company Database / 2.5：
ORN Simulator A Modeling Tool Where Associations Come Alive / Chapter 3：
Creating a Database Model and a Database / 3.1：
Verifying Association Semantics / 3.2：
Architecture / 3.3：
Benefits / 3.4：
Association Patterns Emerging from a Variety of Association Types / Chapter 4：
Context / 4.1：
Pattern Descriptions / 4.2：
"is defined by" pattern / 4.2.1：
"is recorded for" pattern / 4.2.2：
"is a realization of" pattern / 4.2.3：
"is associated by" pattern / 4.2.4：
"is an update of" pattern / 4.2.5：
"is a part of" pattern / 4.2.6：
"is a" pattern / 4.2.7：
Patterns in Database Modeling and Implementation / 4.3：
Associations That Don't Conform to a Pattern / 4.4：
Conclusion / 4.5：
Comparing ORN to Similar Declarative Schemes / Chapter 5：
Schemes for Relational Databases and Object Relations / 5.1：
Null constraint / 5.1.1：
Key constraints / 5.1.2：
Referential integrity rules / 5.1.3：
Subjectivity constraints / 5.1.4：
Additional relationship semantics / 5.1.5：
Schemes for the ER model / 5.2：
Schemes in ODBMSs / 5.3：
Whole-Part Properties and Dimensions for Class Diagrams / 5.4：
Proposed association dimensions for Class diagrams / 5.4.1：
Primary characteristics for whole-part relationships / 5.4.2：
Secondary characteristics for whole-part relationships / 5.4.3：
Using ORN to Develop a Database System / 5.5：
ORN Additive A Tool for Extending SQL Server with ORN / Chapter 6：
Capabilities, Operations, and Architecture / 6.1：
Capabilities / 6.1.1：
Operations and architecture / 6.1.2：
The +ornddl command / 6.1.3：
The +orndml command / 6.1.4：
ORN Additive DDL Statements / 6.2：
USE statement / 6.2.1：
Constraint statement / 6.2.2：
Delete statement / 6.2.3：
Set Orn_Message_Number_Base statement / 6.2.4：
Example of a query file with ORN Additive DDL statements / 6.2.5：
ORN Additive DML Statements / 6.3：
Use statement / 6.3.1：
Begin Transaction statement / 6.3.2：
Save Transaction statement / 6.3.3：
Commit Transaction statement / 6.3.4：
Rollback Transaction statement / 6.3.5：
Set Rxc_Mode statement / 6.3.6：
Enable/Disable Orn_Triggers statement / 6.3.7：
Example of query file with ORN Additive DML statements / 6.3.8：
Object Relater Plus (OR+) An ORN-extended Object DBMS / 6.4：
Capabilities and Compatibilities / 7.1：
ODDL / 7.2：
ODDL specification / 7.2.1：
/ 7.2.2：
Control commands / 7.2.3：
ODML / 7.3：
Architecture, Implementation, and Extensibility / 7.4：
Implementation / 7.4.1：
Extensibility / 7.4.3：
Mapping Database Models to DDLs From ORN-Extended Class Diagrams to ORN-Extended DBMSs / 7.5：
Mapping an ORN-Extended Model to an ORN-Extended SQL / 8.1：
Transformating the model for a relational database / 8.1.1：
Mapping classes to tables / 8.1.2：
Mapping associations to foreign keys / 8.1.3：
Mapping an ORN-Extended Model to an Object DDL / 8.2：
Transforming the model for an object database / 8.2.1：
Mapping classes to class definitions and extents / 8.2.2：
Mapping associations to object-based attributes / 8.2.3：
Association Semantics Dealing with the Subtleties, Inconsistencies, and Ambiguities / 8.3：
Inconsistencies / 9.1：
Within an / 9.1.1：
Involving combinations / 9.1.2：
Inconsistency Detection / 9.2：
Ambiguities / 9.3：
Associations as Functions / 9.4：
Adding ORN to a DBMS / 9.5：
A Conceptual Implementation of ORN Exploring Semantic Circularity and Ambiguity / Chapter 10：
Algorithms / 10.1：
Algorithm CreateObject / 10.1.1：
Transaction operations / 10.1.2：
Supporting pseudocode for complex object operations / 10.1.3：
Algorithm CreateLink / 10.1.4：
Algorithm DeleteObject / 10.1.5：
Algorithm DestroyLink / 10.1.6：
Algorithm ChangeLink / 10.1.7：
Link Cycles / 10.2：
Circularity / 10.2.1：
The Theorem for ORN Semantic Clarity and its proof / 10.2.2：
Adding ORN to the SQL Standard for RDBMSs / 10.3：
Overview of SQL Association Capabilities / 11.1：
Proposed ORN Extension to SQL / 11.3：
Adding ORN to the ODMG Standard for ODMSs / 11.4：
Adding ORN to ODL / 12.1：
Associations in ODL / 12.2.1：
Adding ORN syntax / 12.2.2：
Adapting ORN semantics to ODL / 12.2.3：
Class Transaction / 12.3：
Method new() / 12.3.2：
Method delete() / 12.3.3：
Method _enforce_binding() / 12.3.4：
Method form_tpR() / 12.3.5：
Method drop_tpR() / 12.3.6：
Method_enforce_explicit_binding() / 12.3.7：
Method change_tpR()
Example / 12.3.9：
Bibliography / 12.4：
Index
Preface
Motivation
Purpose
37.
図書
edited by Noritaka Mizuno
出版情報:
Weinheim : Wiley-VCH, c2009 xv, 341 p. ; 25 cm
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
List of Contributors
Concepts in Selective Oxidation of Small Alkane Molecules / Robert Schlogl1：
Introduction / 1.1：
The Research Field / 1.2：
Substrate Activation / 1.3：
Active Oxygen Species / 1.4：
Catalyst Material Science / 1.5：
Conclusion / 1.6：
References
Active Ensemble Structures for Selective Oxidation Catalyses at Surfaces / Mizuki Tada ; Yasuhiro Iwasawa2：
Asymmetric Heterogeneous Catalysis Using Supported Metal Complexes / 2.1：
Asymmetric Catalysis for Oxidative Coupling of 2-Naphthol to BINOL / 2.2.2：
Active Re Clusters Entrapped in ZSM-5 Pores / 2.3：
Unique Catalytic Performance of Supported Gold Nanoparticles in Oxidation / Yunbo Yu ; Jiahui Huang ; Tamao Ishida ; Masatake Haruta2.4.4：
Low-Temperature CO Oxidation / 3.1：
Low-Temperature CO Oxidation in Air / 3.2.1：
Junction Perimeter Between Au Particles and the Support / 3.2.1.1：
Selection of Suitable Supports / 3.2.1.2：
Sensitivity to the Size of the Gold Particles / 3.2.1.3：
Mechanism for CO Oxidation Over Supported Gold Nanoparticles / 3.2.2：
Mechanisms Involving Junction Perimeter Between Gold and the Metal-Oxide Supports / 3.2.3.1：
Mechanisms Involving Specific Size or Thickness of Gold Clusters or Thin Layers / 3.2.3.2：
Mechanisms Involving Cationic Gold / 3.2.3.3：
Complete Oxidation of Volatile Organic Compounds / 3.3：
Gas-Phase Selective Oxidation of Organic Compounds / 3.4：
Gas-Phase Selective Oxidation of Aliphatic Alkanes / 3.4.1：
Gas-Phase Selective Oxidation of Alcohols / 3.4.2：
Gas-Phase Propylene Epoxidation / 3.4.3：
Liquid-Phase Selective Oxidation of Organic Compounds / 3.4.3.1：
Oxidation of Mono-Alcohols / 3.5.1：
Oxidation of Diols / 3.5.2：
Oxidation of Glycerol / 3.5.3：
Aerobic Oxidation of Glucose / 3.5.4：
Oxidation of Alkanes and Alkenes / 3.5.5：
Conclusions / 3.6：
Metal-Substituted Zeolites as Heterogeneous Oxidation Catalysts / Takashi Tatsumi4：
Introduction - Two Ways to Introduce Hetero-Metals into Zeolites / 4.1：
Titanium-Containing Zeolites / 4.2：
TS-1 / 4.2.1：
Ti-Beta / 4.2.2：
Ti-MWW / 4.2.3：
Other Titanium-Containing Zeolites / 4.2.4：
Solvent Effects and Reaction Intermediate / 4.2.5：
Other Metal-Containing Zeolites / 4.3：
Design of Well-Defined Active Sites on Crystalline Materials for Liquid-Phase Oxidations / Kiyotomi Kaneda ; Takato Mitsudome4.4：
Oxidation of Alcohols / 5.1：
Ru Catalyst / 5.2.1：
Pd Catalyst / 5.2.2：
Au Catalyst / 5.2.3：
Au-Pd Catalyst / 5.2.4：
Epoxidation of Olefins / 5.3：
Epoxidation with Hydrogen Peroxide / 5.3.1：
Titanium-Based Catalysts / 5.3.1.1：
Tungsten-Based Catalysts / 5.3.1.2：
Base Catalyst / 5.3.1.3：
Epoxidation with Molecular Oxygen / 5.3.2：
Cis-Dihydroxylation / 5.4：
Baeyer-Villiger Oxidation / 5.5：
C-H Activation Using Molecular Oxygen / 5.6：
Liquid-Phase Oxidations with Hydrogen Peroxide and Molecular Oxygen Catalyzed by Polyoxometalate-Based Compounds / Noritaka Mizuno ; Keigo Kamata ; Sayaka Uchida ; Kazuya Yamaguchi5.7：
Isopoly- and Heteropolyoxometalates / 6.1：
Peroxometalates / 6.2.2：
Lacunary Polyoxometalates / 6.2.3：
Transition-Metal-Substituted Polyoxometalates / 6.2.4：
Heterogenization of Polyoxometalates / 6.3：
Solidification of Polyoxometalates with Appropriate Cations / 6.3.1：
Metal and Alkylammonium Cations / 6.3.1.1：
Polycations / 6.3.1.2：
Cationic Organometallic Complexes / 6.3.1.3：
Immobilization of Polyoxometalate-Based Compounds / 6.3.2：
Wet Impregnation / 6.3.2.1：
Solvent-Anchoring and Covalent Linkage / 6.3.2.2：
Anion Exchange / 6.3.2.3：
Nitrous Oxide as an Oxygen Donor in Oxidation Chemistry and Catalysis / Gennady I. Panov ; Konstantin A. Dubkov ; Alexander S. Kharitonov6.4：
Molecular Structure and Physical Properties of Nitrous Oxide / 7.1：
Catalytic Oxidation by Nitrous Oxide in the Gas Phase / 7.3：
Oxidation of Lower Alkanes Over Oxide Catalysts / 7.3.1：
Oxidation Over Zeolites / 7.3.2：
Oxidation by Dioxygen / 7.3.2.1：
Nature of Zeolite Activity, a-Sites / 7.3.2.2：
Hydroxylation of Alkanes and Benzene Derivatives / 7.3.2.4：
Other Types of Oxidation Reactions / 7.3.2.6：
Liquid-Phase Oxidation of Alkenes / 7.4：
Linear Alkenes / 7.5.1.1：
Cyclic Alkenes / 7.5.1.2：
Cyclodienes / 7.5.1.3：
Bicyclic Alkenes / 7.5.1.4：
Heterocyclic Alkenes / 7.5.1.5：
Carboxidation of Polymers / 7.5.2：
Carboxidation of Polyethylene / 7.5.2.1：
Carboxidation of Polybutadiene Rubber / 7.5.2.2：
Direct Synthesis of Hydrogen Peroxide: Recent Advances / Gabriele Centi ; Siglinda Perathoner ; Salvatore Abate7.6：
Industrial Production / 8.1：
Uses of Hydrogen Peroxide / 8.1.2：
Status of Development and Perspectives of Industrial Production / 8.2：
Fundamental Studies / 8.2.2：
Intrinsically Safe Operations and Microreactors / 8.3.1：
Nature of the Catalyst and Reaction Network / 8.3.2：
Role of the Solvent and of Promoters / 8.3.3：
Recent Achievements and Challenges for a Greener Chemical Industry / Fabrizio Cavani ; Nicola Ballarini8.4：
Introduction: Old and New Challenges for Oxidation Catalysis in Industry / 9.1：
Recent Successful Examples of Alkanes Oxidation / 9.2：
Oxidation of Ethane to Acetic Acid / 9.2.1：
Ammoxidation of Propane to Acrylonitrile / 9.2.2：
New Oxidation Technologies: Oxidative Desulfurization (ODS) of Gas Oil / 9.3：
Process Intensification in Catalytic Oxidation / 9.4：
An Alternative Approach: Anaerobic Oxidation with Metal Oxides in a Cycle Process (from an Oxidation Catalyst to a Reusable Stoichiometric Oxidant) / 9.5：
Anaerobic Oxidation of Propene to Acrolein in a CFBR Reactor / 9.5.1：
Anaerobic Synthesis of 2-Methyl-1,4-Naphthoquinone (Menadione) / 9.5.2：
Anaerobic Oxidative Dehydrogenation of Propane to Propene / 9.5.3：
Production of Hydrogen from Methane with Oxide Materials and Inherent Segregation of Carbon Dioxide / 9.5.4：
Current and Developing Processes for the Transformation of Bioplatform Molecules into Chemicals by Catalytic Oxidation / 9.6：
Glycerol: A Versatile Building Block / 9.6.1：
Index / 9.7：
Preface
List of Contributors
Concepts in Selective Oxidation of Small Alkane Molecules / Robert Schlogl1：
38.
ＥＢ
Bryon K. Ehlmann, Bart Childs, Ilpo Laine, Olli Lehto, Tuomas Sorvali
出版情報:
SpringerLink Books - AutoHoldings , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Preface
Motivation
Purpose
Readers
Structure
Downloads
Acknowledgments
About the Author
Contents
List of Abbreviations
About Relationships and ORN / Part I：
Introduction Including a Brief History of Relationships / Chapter I：
Relationships / 1.1：
A Brief History of Relationships / 1.2：
The paper-based system / 1.2.1：
The computerized file-based system / 1.2.2：
Early data models and DBMSs / 1.2.3：
The relational model and RDBMS / 1.2.4：
The entity-relationship model and database / 1.2.5：
Semantic models, the object model, and the ODBMS / 1.2.6：
The object-relational DBMS / 1.2.7：
Problems in Modeling and Implementing Relationships / 1.3：
Preview of a Solution / 1.4：
Object Relationship Notation (ORN) / Chapter 2：
Syntax / 2.1：
Graphical Representation / 2.2：
Semantics / 2.3：
Examples / 2.4：
<*-to-*> / 2.4.1：
<1-to-*>|- / 2.4.2：
<0..1-to-*>|- / 2.4.3：
<0..1-to*>|-X- / 2.4.4：
<0..1-to-1..*>? / 2.4.5：
!<0..1-to-*> / 2.4.6：
'<*-to-1..*> / 2.4.7：
Flashback to the Company Database / 2.5：
ORN Simulator A Modeling Tool Where Associations Come Alive / Chapter 3：
Creating a Database Model and a Database / 3.1：
Verifying Association Semantics / 3.2：
Architecture / 3.3：
Benefits / 3.4：
Association Patterns Emerging from a Variety of Association Types / Chapter 4：
Context / 4.1：
Pattern Descriptions / 4.2：
"is defined by" pattern / 4.2.1：
"is recorded for" pattern / 4.2.2：
"is a realization of" pattern / 4.2.3：
"is associated by" pattern / 4.2.4：
"is an update of" pattern / 4.2.5：
"is a part of" pattern / 4.2.6：
"is a" pattern / 4.2.7：
Patterns in Database Modeling and Implementation / 4.3：
Associations That Don't Conform to a Pattern / 4.4：
Conclusion / 4.5：
Comparing ORN to Similar Declarative Schemes / Chapter 5：
Schemes for Relational Databases and Object Relations / 5.1：
Null constraint / 5.1.1：
Key constraints / 5.1.2：
Referential integrity rules / 5.1.3：
Subjectivity constraints / 5.1.4：
Additional relationship semantics / 5.1.5：
Schemes for the ER model / 5.2：
Schemes in ODBMSs / 5.3：
Whole-Part Properties and Dimensions for Class Diagrams / 5.4：
Proposed association dimensions for Class diagrams / 5.4.1：
Primary characteristics for whole-part relationships / 5.4.2：
Secondary characteristics for whole-part relationships / 5.4.3：
Using ORN to Develop a Database System / 5.5：
ORN Additive A Tool for Extending SQL Server with ORN / Chapter 6：
Capabilities, Operations, and Architecture / 6.1：
Capabilities / 6.1.1：
Operations and architecture / 6.1.2：
The +ornddl command / 6.1.3：
The +orndml command / 6.1.4：
ORN Additive DDL Statements / 6.2：
USE statement / 6.2.1：
Constraint statement / 6.2.2：
Delete statement / 6.2.3：
Set Orn_Message_Number_Base statement / 6.2.4：
Example of a query file with ORN Additive DDL statements / 6.2.5：
ORN Additive DML Statements / 6.3：
Use statement / 6.3.1：
Begin Transaction statement / 6.3.2：
Save Transaction statement / 6.3.3：
Commit Transaction statement / 6.3.4：
Rollback Transaction statement / 6.3.5：
Set Rxc_Mode statement / 6.3.6：
Enable/Disable Orn_Triggers statement / 6.3.7：
Example of query file with ORN Additive DML statements / 6.3.8：
Object Relater Plus (OR+) An ORN-extended Object DBMS / 6.4：
Capabilities and Compatibilities / 7.1：
ODDL / 7.2：
ODDL specification / 7.2.1：
/ 7.2.2：
Control commands / 7.2.3：
ODML / 7.3：
Architecture, Implementation, and Extensibility / 7.4：
Implementation / 7.4.1：
Extensibility / 7.4.3：
Mapping Database Models to DDLs From ORN-Extended Class Diagrams to ORN-Extended DBMSs / 7.5：
Mapping an ORN-Extended Model to an ORN-Extended SQL / 8.1：
Transformating the model for a relational database / 8.1.1：
Mapping classes to tables / 8.1.2：
Mapping associations to foreign keys / 8.1.3：
Mapping an ORN-Extended Model to an Object DDL / 8.2：
Transforming the model for an object database / 8.2.1：
Mapping classes to class definitions and extents / 8.2.2：
Mapping associations to object-based attributes / 8.2.3：
Association Semantics Dealing with the Subtleties, Inconsistencies, and Ambiguities / 8.3：
Inconsistencies / 9.1：
Within an / 9.1.1：
Involving combinations / 9.1.2：
Inconsistency Detection / 9.2：
Ambiguities / 9.3：
Associations as Functions / 9.4：
Adding ORN to a DBMS / 9.5：
A Conceptual Implementation of ORN Exploring Semantic Circularity and Ambiguity / Chapter 10：
Algorithms / 10.1：
Algorithm CreateObject / 10.1.1：
Transaction operations / 10.1.2：
Supporting pseudocode for complex object operations / 10.1.3：
Algorithm CreateLink / 10.1.4：
Algorithm DeleteObject / 10.1.5：
Algorithm DestroyLink / 10.1.6：
Algorithm ChangeLink / 10.1.7：
Link Cycles / 10.2：
Circularity / 10.2.1：
The Theorem for ORN Semantic Clarity and its proof / 10.2.2：
Adding ORN to the SQL Standard for RDBMSs / 10.3：
Overview of SQL Association Capabilities / 11.1：
Proposed ORN Extension to SQL / 11.3：
Adding ORN to the ODMG Standard for ODMSs / 11.4：
Adding ORN to ODL / 12.1：
Associations in ODL / 12.2.1：
Adding ORN syntax / 12.2.2：
Adapting ORN semantics to ODL / 12.2.3：
Class Transaction / 12.3：
Method new() / 12.3.2：
Method delete() / 12.3.3：
Method _enforce_binding() / 12.3.4：
Method form_tpR() / 12.3.5：
Method drop_tpR() / 12.3.6：
Method_enforce_explicit_binding() / 12.3.7：
Method change_tpR()
Example / 12.3.9：
Bibliography / 12.4：
Index
Preface
Motivation
Purpose
39.
図書
Tony Aspromourgos
目次情報:
続きを見る
Preface
A note on citation practice
Introduction / 1：
The science of wealth / 2：
Political oeconomy and science / 2.1：
Smith on 'political economy' / 2.1.1：
Smith on 'science' / 2.1.2：
Genesis of modern political economy / 2.1.3：
Enlightenment and political economy / 2.1.4：
Hobbes, Petty, Steuart / 2.1.5：
Cameralism and Linnaeus / 2.1.6：
Smith's achievement / 2.1.7：
Wealth as national product / 2.2：
Smith on 'wealth' / 2.2.1：
Early meanings of wealth / 2.2.2：
Petty to Turgot / 2.2.3：
Nature as a norm / 2.3：
Smith on 'nature' / 2.3.1：
Earlier concepts of 'natural' / 2.3.2：
A science of man / 2.3.3：
The economy of nature / 2.3.4：
A 'new' science / 2.4：
Competition, prices and distribution / 3：
Competition and prices / 3.1：
Concepts of price / 3.1.1：
Smith on 'competition' / 3.1.2：
Supply and demand / 3.2：
Smith on 'supply' and 'demand' / 3.2.1：
Smith on 'scarcity' and 'plenty' / 3.2.2：
Market prices, supply dynamics and the role of demand / 3.3：
Role of supply versus demand / 3.3.1：
Indeterminacy of demand-prices / 3.3.2：
Competitive price and concepts of cost / 3.4：
Normal price and scale of production / 3.4.1：
Four concepts of cost / 3.4.2：
Income distribution as pricing / 3.4.3：
Prices and costs prior to Smith / 3.5：
Etymology / 3.5.1：
The century prior to Smith / 3.5.2：
Market prices and the 'just' price / 3.5.3：
Aristotle's formula / 3.5.4：
Some latter-day interpretations / 3.5.5：
Cost and pre-modern thought / 3.5.6：
Competition theory without supply-and-demand functions / 3.6：
Production and capital accumulation / 4：
Division of labour and labour productivity / 4.1：
Smith and division of labour / 4.1.1：
Earlier conceptions of division of labour / 4.1.2：
Gross revenue and net revenue / 4.2：
Smith and social 'net revenue' / 4.2.1：
The concept of a social surplus / 4.2.2：
Earlier concepts of net revenue / 4.2.3：
Capital and productive labour / 4.3：
Smith on 'capital' / 4.3.1：
Smith on 'productive labour' / 4.3.2：
Productive labour: a rational reconstruction / 4.3.3：
Growth dynamics / 4.3.4：
Reducibility of normal prices / 4.3.5：
Prehistory: capital, cattle, chattels / 4.3.6：
Quesnay: the invention of capital theory / 4.3.7：
Luxury, unproductiveness and surplus before Smith / 4.3.8：
Two problems / 4.4：
Growth dynamics and demand/supply coordination / 4.4.1：
The content of the social surplus / 4.4.2：
Opulence and policy / 5：
The progress of opulence / 5.1：
Smith on 'opulence' / 5.1.1：
Extending opulence / 5.1.2：
Policy and the system of liberty / 5.2：
Smith on 'liberty' / 5.2.1：
Smith on 'police' and 'policy' / 5.2.2：
Economic liberty: justification and limits / 5.2.3：
Early meanings of liberty and freedom / 5.2.4：
Modern political liberty / 5.2.5：
The idea of police / 5.2.6：
Theory, policy, history / 5.3：
Smith on 'theory' / 5.3.1：
Theory and practice / 5.3.2：
History and political economy / 5.3.3：
Limits of theory and limits of Smith's policy / 5.4：
Epilogue
Notes
References
Index
Preface
A note on citation practice
Introduction / 1：
40.
図書
ACM Workshop on General Purpose Processing on Graphics Processing Units
41.
ＥＢ
Maribel Fern?ndez, Samson Abramsky, Ian Mackie, Samson Abramsky, Chris Hankin, Dexter Kozen, Andrew Pitts, Hanne Riis Nielson, Steven Skiena, Ian Stewart, David Zhang. edited by Ian Mackie
出版情報:
Springer eBooks Computer Science , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Models of computation / 1.1：
Some non-computable functions / 1.2：
Further reading / 1.3：
Exercises / 1.4：
Traditional Models of Computation / Part I：
Automata and Turing Machines / 2：
Formal languages and automata / 2.1：
Finite automata / 2.2：
Deterministic and non-deterministic automata / 2.2.1：
The power of finite automata / 2.2.2：
Push-down automata / 2.3：
Turing machines / 2.4：
Variants of Turing machines / 2.4.1：
The universal Turing machine / 2.4.2：
Imperative programming / 2.5：
The Lambda Calculus / 2.6：
Lambda-calculus: Syntax / 3.1：
Computation / 3.2：
Substitution / 3.2.1：
Normal forms / 3.2.2：
Properties of reductions / 3.2.3：
Reduction strategies / 3.2.4：
Arithmetic functions / 3.3：
Booleans / 3.4：
Recursion / 3.5：
Functional programming / 3.6：
Recursive Functions / 3.7：
Primitive recursive functions / 4.1：
Partial recursive functions / 4.2：
Programming with functions / 4.3：
Logic-Based Models of Computation / 4.4：
The Herbrand universe / 5.1：
Logic programs / 5.2：
Answers / 5.2.1：
Computing with logic programs / 5.3：
Unification / 5.3.1：
The Principle of Resolution / 5.3.2：
Prolog and the logic programming paradigm / 5.4：
Modern Models of Computation / 5.5：
Computing with Objects / 6：
Object calculus: Syntax / 6.1：
Reduction rules / 6.2：
Computation power / 6.3：
Object-oriented programming / 6.4：
Combining objects and functions / 6.5：
Interaction-Based Models of Computation / 6.6：
The paradigm of interaction / 7.1：
Numbers and arithmetic operations / 7.2：
Turing completeness / 7.3：
More examples: Lists / 7.4：
Combinators for interaction nets / 7.5：
Textual languages and strategies for interaction nets / 7.6：
A textual interaction calculus / 7.6.1：
Properties of the calculus / 7.6.2：
Normal forms and strategies / 7.6.3：
Extensions to model non-determinism / 7.7：
Concurrency / 7.8：
Specifying concurrent systems / 8.1：
Simulation and bisimulation / 8.2：
A language to write processes / 8.3：
A language for communicating processes / 8.4：
Another view of concurrency: The chemical metaphor / 8.5：
Emergent Models of Computation / 8.6：
Bio-computing / 9.1：
Membrane calculi / 9.1.1：
Protein interaction calculi / 9.1.2：
Quantum computing / 9.2：
Answers to Selected Exercises / 9.3：
Bibliography
Index
Introduction / 1：
Models of computation / 1.1：
Some non-computable functions / 1.2：
42.
図書
Eyal Kolman and Michael Margaliot
目次情報:
続きを見る
Preface
List of Abbreviations
List of Symbols
Introduction / 1：
Artificial Neural Networks (ANNs) / 1.1：
Fuzzy Rule-Bases (FRBs) / 1.2：
The ANN-FRB Synergy / 1.3：
Knowledge-Based Neurocomputing / 1.4：
Knowledge Extraction from ANNs / 1.4.1：
Knowledge-Based Design of ANNs / 1.4.2：
The FARB: A Neuro-fuzzy Equivalence / 1.5：
The FARB / 2：
Definition / 2.1：
Input-Output Mapping / 2.2：
The FARB-ANN Equivalence / 3：
The FARB and Feedforward ANNs / 3.1：
Example 1: Knowledge Extraction from a Feedforward ANN / 3.1.1：
Example 2: Knowledge-Based Design of a Feedforward ANN / 3.1.2：
The FARB and First-Order RNNs / 3.2：
First Approach / 3.2.1：
Example 3: Knowledge Extraction from a Simple RNN / 3.2.2：
Second Approach / 3.2.3：
Third Approach / 3.2.4：
Example 4: Knowledge Extraction from an RNN / 3.2.5：
Example 5: Knowledge-Based Design of an RNN / 3.2.6：
The FARB and Second-Order RNNs / 3.3：
Summary / 3.4：
Rule Simplification / 4：
Sensitivity Analysis / 4.1：
A Procedure for Simplifying a FARB / 4.2：
Knowledge Extraction Using the FARB / 5：
The Iris Classification Problem / 5.1：
The LED Display Recognition Problem / 5.2：
FARB Simplification / 5.2.1：
Analysis of the FRB / 5.2.3：
Formal Languages / 5.3：
Formal Languages and RNNs / 5.3.2：
The Trained RNN / 5.3.3：
The Direct Approach / 5.3.4：
The Modular Approach / 6.1.1：
The Counter Module / 6.2.1：
The Sequence-Counter Module / 6.2.2：
The String-Comparator Module / 6.2.3：
The String-to-Num Converter Module / 6.2.4：
The Num-to-String Converter Module / 6.2.5：
The Soft Threshold Module / 6.2.6：
KBD of an RNN for Recognizing the AB Language / 6.2.7：
KBD of an RNN for Recognizing the Balanced Parentheses Language / 6.2.9：
Conclusions and Future Research / 6.2.10：
Future Research / 7.1：
Regularization of Network Training / 7.1.1：
Extracting Knowledge during the Learning Process / 7.1.2：
Knowledge Extraction from Support Vector Machines / 7.1.3：
Knowledge Extraction from Trained Networks / 7.1.4：
Proofs / A：
Details of the LED Recognition Network / B：
References
Index
Preface
List of Abbreviations
List of Symbols
43.
ＥＢ
Maribel Fernández, Samson Abramsky, Ian Mackie, Samson Abramsky, Chris Hankin, Dexter Kozen, Andrew Pitts, Hanne Riis Nielson, Steven Skiena, Ian Stewart, David Zhang. edited by Ian Mackie, Chris Hankin
出版情報:
SpringerLink Books - AutoHoldings , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Models of computation / 1.1：
Some non-computable functions / 1.2：
Further reading / 1.3：
Exercises / 1.4：
Traditional Models of Computation / Part I：
Automata and Turing Machines / 2：
Formal languages and automata / 2.1：
Finite automata / 2.2：
Deterministic and non-deterministic automata / 2.2.1：
The power of finite automata / 2.2.2：
Push-down automata / 2.3：
Turing machines / 2.4：
Variants of Turing machines / 2.4.1：
The universal Turing machine / 2.4.2：
Imperative programming / 2.5：
The Lambda Calculus / 2.6：
Lambda-calculus: Syntax / 3.1：
Computation / 3.2：
Substitution / 3.2.1：
Normal forms / 3.2.2：
Properties of reductions / 3.2.3：
Reduction strategies / 3.2.4：
Arithmetic functions / 3.3：
Booleans / 3.4：
Recursion / 3.5：
Functional programming / 3.6：
Recursive Functions / 3.7：
Primitive recursive functions / 4.1：
Partial recursive functions / 4.2：
Programming with functions / 4.3：
Logic-Based Models of Computation / 4.4：
The Herbrand universe / 5.1：
Logic programs / 5.2：
Answers / 5.2.1：
Computing with logic programs / 5.3：
Unification / 5.3.1：
The Principle of Resolution / 5.3.2：
Prolog and the logic programming paradigm / 5.4：
Modern Models of Computation / 5.5：
Computing with Objects / 6：
Object calculus: Syntax / 6.1：
Reduction rules / 6.2：
Computation power / 6.3：
Object-oriented programming / 6.4：
Combining objects and functions / 6.5：
Interaction-Based Models of Computation / 6.6：
The paradigm of interaction / 7.1：
Numbers and arithmetic operations / 7.2：
Turing completeness / 7.3：
More examples: Lists / 7.4：
Combinators for interaction nets / 7.5：
Textual languages and strategies for interaction nets / 7.6：
A textual interaction calculus / 7.6.1：
Properties of the calculus / 7.6.2：
Normal forms and strategies / 7.6.3：
Extensions to model non-determinism / 7.7：
Concurrency / 7.8：
Specifying concurrent systems / 8.1：
Simulation and bisimulation / 8.2：
A language to write processes / 8.3：
A language for communicating processes / 8.4：
Another view of concurrency: The chemical metaphor / 8.5：
Emergent Models of Computation / 8.6：
Bio-computing / 9.1：
Membrane calculi / 9.1.1：
Protein interaction calculi / 9.1.2：
Quantum computing / 9.2：
Answers to Selected Exercises / 9.3：
Bibliography
Index
Introduction / 1：
Models of computation / 1.1：
Some non-computable functions / 1.2：
44.
図書
Thomas Mikosch
出版情報:
Berlin : Springer, c2009 xv, 432 p. ; 24 cm
シリーズ名:
Universitext
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Collective Risk Models / Part I：
The Basic Model / 1：
Models for the Claim Number Process / 2：
The Poisson Process / 2.1：
The Homogeneous Poisson Process, the Intensity Function, the Cramer-Lundberg Model / 2.1.1：
The Markov Property / 2.1.2：
Relations Between the Homogeneous and the Inhomogeneous Poisson Process / 2.1.3：
The Homogeneous Poisson Process as a Renewal Process / 2.1.4：
The Distribution of the Inter-Arrival Times / 2.1.5：
The Order Statistics Property / 2.1.6：
A Discussion of the Arrival Times of the Danish Fire Insurance Data 1980-1990 / 2.1.7：
An Informal Discussion of Transformed and Generalized Poisson Processes / 2.1.8：
Exercises
The Renewal Process / 2.2：
Basic Properties / 2.2.1：
An Informal Discussion of Renewal Theory / 2.2.2：
The Mixed Poisson Process / 2.3：
The Total Claim Amount / 3：
The Order of Magnitude of the Total Claim Amount / 3.1：
The Mean and the Variance in the Renewal Model / 3.1.1：
The Asymptotic Behavior in the Renewal Model / 3.1.2：
Classical Premium Calculation Principles / 3.1.3：
Claim Size Distributions / 3.2：
An Exploratory Statistical Analysis: QQ-Plots / 3.2.1：
A Preliminary Discussion of Heavy- and Light-Tailed Distributions / 3.2.2：
An Exploratory Statistical Analysis: Mean Excess Plots / 3.2.3：
Standard Claim Size Distributions and Their Properties / 3.2.4：
Regularly Varying Claim Sizes and Their Aggregation / 3.2.5：
Subexponential Distributions / 3.2.6：
The Distribution of the Total Claim Amount / 3.3：
Mixture Distributions / 3.3.1：
Space-Time Decomposition of a Compound Poisson Process / 3.3.2：
An Exact Numerical Procedure for Calculating the Total Claim Amount Distribution / 3.3.3：
Approximation to the Distribution of the Total Claim Amount Using the Central Limit Theorem / 3.3.4：
Approximation to the Distribution of the Total Claim Amount by Monte Carlo Techniques / 3.3.5：
Reinsurance Treaties / 3.4：
Ruin Theory / 4：
Risk Process, Ruin Probability and Net Profit Condition / 4.1：
Bounds for the Ruin Probability / 4.2：
Lundberg's Inequality / 4.2.1：
Exact Asymptotics for the Ruin Probability: the Small Claim Case / 4.2.2：
The Representation of the Ruin Probability as a Compound Geometric Probability / 4.2.3：
Exact Asymptotics for the Ruin Probability: the Large Claim Case / 4.2.4：
Experience Rating / Part II：
Bayes Estimation / 5：
The Heterogeneity Model / 5.1：
Bayes Estimation in the Heterogeneity Model / 5.2：
Linear Bayes Estimation / 6：
An Excursion to Minimum Linear Risk Estimation / 6.1：
The Buhlmann Model / 6.2：
Linear Bayes Estimation in the Buhlmann Model / 6.3：
The Buhlmann-Straub Model / 6.4：
A Point Process Approach to Collective Risk Theory / Part III：
The General Poisson Process / 7：
The Notion of a Point Process / 7.1：
Definition and First Examples / 7.1.1：
Distribution and Laplace Functional / 7.1.2：
Poisson Random Measures / 7.2：
Laplace Functional and Non-Negative Poisson Integrals / 7.2.1：
Properties of General Poisson Integrals / 7.2.3：
Construction of New Poisson Random Measures from Given Poisson Random Measures / 7.3：
Transformation of the Points of a Poisson Random Measure / 7.3.1：
Marked Poisson Random Measures / 7.3.2：
The Cramer-Lundberg and Related Models as Marked Poisson Random Measures / 7.3.3：
Aggregating Poisson Random Measures / 7.3.4：
Poisson Random Measures in Collective Risk Theory / 8：
Decomposition of the Time-Claim Size Space / 8.1：
Decomposition by Claim Size / 8.1.1：
Decomposition by Year of Occurrence / 8.1.2：
Decomposition by Year of Reporting / 8.1.3：
Effects of Dependence Between Delay in Reporting Time and Claim Size / 8.1.4：
Effects of Inflation and Interest / 8.1.5：
A General Model with Delay in Reporting and Settlement of Claim Payments / 8.2：
The Basic Model and the Basic Decomposition of Time-Claim Size Space / 8.2.1：
The Basic Decomposition of the Claim Number Process / 8.2.2：
The Basic Decomposition of the Total Claim Amount / 8.2.3：
An Excursion to Teletraffic and Long Memory: The Stationary IBNR Claim Number Process / 8.2.4：
A Critique of the Basic Model / 8.2.5：
Weak Convergence of Point Processes / 9：
Definition and Basic Examples / 9.1：
Convergence of the Finite-Dimensional Distributions / 9.1.1：
Convergence of Laplace Functionals / 9.1.2：
Point Processes of Exceedances and Extremes / 9.2：
Convergence of the Point Processes of Exceedances / 9.2.1：
Convergence in Distribution of Maxima and Order Statistics Under Affine Transformations / 9.2.2：
Maximum Domains of Attraction / 9.2.3：
The Point Process of Exceedances at the Times of a Renewal Process / 9.2.4：
Asymptotic Theory for the Reinsurance Treaties of Extreme Value Type / 9.3：
Special Topics / Part IV：
An Excursion to Levy Processes / 10：
Definition and First Examples of Levy Processes / 10.1：
Some Basic Properties of Levy Processes / 10.2：
Infinite Divisibility: The Levy-Khintchine Formula / 10.3：
The Levy-Ito Representation of a Levy Process / 10.4：
Some Special Levy Processes / 10.5：
Cluster Point Processes / 11：
The General Cluster Process / 11.1：
The Chain Ladder Method / 11.2：
The Chain Ladder Model / 11.2.1：
Mack's Model / 11.2.2：
Some Asymptotic Results in the Chain Ladder Model / 11.2.3：
Moments of the Chain Ladder Estimators / 11.2.4：
Prediction in Mack's Model / 11.2.5：
An Informal Discussion of a Cluster Model with Poisson Arrivals / 11.3：
Specification of the Model / 11.3.1：
An Analysis of the First and Second Moments / 11.3.2：
A Model when Clusters are Poisson Processes / 11.3.3：
References
Index
List of Abbreviations and Symbols
Collective Risk Models / Part I：
The Basic Model / 1：
Models for the Claim Number Process / 2：
45.
ＥＢ
S. Z. Li
出版情報:
Springer eBooks Computer Science , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Foreword / Anil K. Jain
Preface to the Third Edition / Rama Chellappa
Preface to the Second Edition
Preface to the First Edition
Introduction / 1：
Labeling for Image Analysis / 1.1：
Sites and Labels / 1.1.1：
The Labeling Problem / 1.1.2：
Labeling Problems in Image Analysis / 1.1.3：
Labeling with Contextual Constraints / 1.1.4：
Optimization-Based Approach / 1.2：
Research Issues / 1.2.1：
Role of Energy Functions / 1.2.2：
Formulation of Objective Functions / 1.2.3：
Optimality Criteria / 1.2.4：
The MAP-MRF Framework / 1.3：
Bayes Estimation / 1.3.1：
MAP-MRF Labeling / 1.3.2：
Regularization / 1.3.3：
Summary of the MAP-MRF Approach / 1.3.4：
Validation of Modeling / 1.4：
Mathematical MRF Models / 2：
Markov Random Fields and Gibbs Distributions / 2.1：
Neighborhood System and Cliques / 2.1.1：
Markov Random Fields / 2.1.2：
Gibbs Random Fields / 2.1.3：
Markov-Gibbs Equivalence / 2.1.4：
Normalized and Canonical Forms / 2.1.5：
Auto-models / 2.2：
Multi-level Logistic Model / 2.3：
The Smoothness Prior / 2.4：
Hierarchical GRF Model / 2.5：
The FRAME Model / 2.6：
Multiresolution MRF Modeling / 2.7：
Conditional Random Fields / 2.8：
Discriminative Random Fields / 2.9：
Strong MRF Model / 2.10：
<$>{\cal K}<$>-MRF and Nakagami-MRF Models / 2.11：
Graphical Models: MRF's versus Bayesian Networks / 2.12：
Low-Level MRF Models / 3：
Observation Models / 3.1：
Image Restoration and Reconstruction / 3.2：
MRF Priors for Image Surfaces / 3.2.1：
Piecewise Constant Restoration / 3.2.2：
Piecewise Continuous Restoration / 3.2.3：
Surface Reconstruction / 3.2.4：
Edge Detection / 3.3：
Edge Labeling Using Line Process / 3.3.1：
Forbidden Edge Patterns / 3.3.2：
Texture Synthesis and Analysis / 3.4：
MRF Texture Modeling / 3.4.1：
Texture Segmentation / 3.4.2：
Optical Flow / 3.5：
Variational Approach / 3.5.1：
Flow Discontinuities / 3.5.2：
Stereo Vision / 3.6：
Spatio-temporal Models / 3.7：
Bayesian Deformable Models / 3.8：
Formulation of EigenSnake / 3.8.1：
Experiments / 3.8.2：
High-Level MRF Models / 4：
Matching under Relational Constraints / 4.1：
Relational Structure Representation / 4.1.1：
Work in Relational Matching / 4.1.2：
Feature-Based Matching / 4.2：
Posterior Probability and Energy / 4.2.1：
Matching to Multiple Objects / 4.2.2：
Extensions / 4.2.3：
Optimal Matching to Multiple Overlapping Objects / 4.2.4：
Formulation of MAP-MRF Estimation / 4.3.1：
Computational Issues / 4.3.2：
Pose Computation / 4.4：
Pose Clustering and Estimation / 4.4.1：
Simultaneous Matching and Pose Estimation / 4.4.2：
Discussion / 4.4.3：
Face Detection and Recognition / 4.5：
Discontinuities in MRF's / 5：
Smoothness, Regularization, and Discontinuities / 5.1：
Regularization and Discontinuities / 5.1.1：
Other Regularization Models / 5.1.2：
The Discontinuity Adaptive MRF Model / 5.2：
Defining the DA Model / 5.2.1：
Relations with Previous Models / 5.2.2：
Discrete Data and 2D Cases / 5.2.3：
Solution Stability / 5.2.4：
Total Variation Models / 5.2.5：
Total Variation Norm / 5.3.1：
TV Models / 5.3.2：
Multichannel TV / 5.3.3：
Modeling Roof Discontinuities / 5.4：
Roof-Edge Model / 5.4.1：
MAP-MRF Solution / 5.4.2：
Experimental Results / 5.4.3：
Step-Edge-Preserving Smoothing / 5.5.1：
Roof-Edge-Preserving Smoothing / 5.5.2：
MRF Model with Robust Statistics / 6：
The DA Prior and Robust Statistics / 6.1：
Robust M-Estimator / 6.1.1：
Problems with M-Estimator / 6.1.2：
Redefinition of M-Estimator / 6.1.3：
AM-Estimator / 6.1.4：
Convex Priors for DA and M-Estimation / 6.1.5：
Half-Quadratic Minimization / 6.1.6：
Experimental Comparison / 6.2：
Location Estimation / 6.2.1：
Rotation Angle Estimation / 6.2.2：
MRF Parameter Estimation / 7：
Supervised Estimation with Labeled Data / 7.1：
Maximum Likelihood / 7.1.1：
Pseudo-likelihood / 7.1.2：
Coding Method / 7.1.3：
Mean Field Approximations / 7.1.4：
Least Squares Fit / 7.1.5：
Markov Chain Monte Carlo Methods / 7.1.6：
Learning in the FRAME Model / 7.1.7：
Unsupervised Estimation with Unlabeled Data / 7.2：
Simultaneous Restoration and Estimation / 7.2.1：
Simultaneous Segmentation and Estimation / 7.2.2：
Expectation-Maximization / 7.2.3：
Cross Validation / 7.2.4：
Estimating the Number of MRF's / 7.3：
Akaike Information Criterion (AIC) / 7.3.1：
Reversible Jump MCMC / 7.3.2：
Reduction of Nonzero Parameters / 7.4：
Parameter Estimation in Optimal Object Recognition / 8：
Motivation / 8.1：
Theory of Parameter Estimation for Recognition / 8.2：
Optimization-Based Object Recognition / 8.2.1：
Criteria for Parameter Estimation / 8.2.2：
Linear Classification Function / 8.2.3：
A Nonparametric Learning Algorithm / 8.2.4：
Reducing Search Space / 8.2.5：
Application in MRF Object Recognition / 8.3：
Posterior Energy / 8.3.1：
Energy in Linear Form / 8.3.2：
How the Minimal Configuration Changes / 8.3.3：
Parametric Estimation under Gaussian Noise / 8.3.4：
Recognition of Line Patterns / 8.4：
Recognition of Curved Objects / 8.4.2：
Convergence / 8.4.3：
Conclusion / 8.5：
Minimization - Local Methods / 9：
Problem Categorization / 9.1：
Classical Minimization with Continuous Labels / 9.2：
Minimization with Discrete Labels / 9.3：
Interated Conditional Modes / 9.3.1：
Relaxation Labeling / 9.3.2：
Belief Propagation / 9.3.3：
Convex Relaxation / 9.3.4：
Highest Confidence First / 9.3.5：
Dynamic Programming / 9.3.6：
Constrained Minimization / 9.4：
Penalty Functions / 9.4.1：
Lagrange Multipliers / 9.4.2：
Hopfield Method / 9.4.3：
Augmented Lagrange-Hopfield Method / 9.5：
MAP-MRF Estimation as Constrained Optimization / 9.5.1：
The ALH Method / 9.5.2：
Minimization - Global Methods / 10：
Simulated Annealing / 10.1：
Mean Field Annealing / 10.2：
Graduated Nonconvexity / 10.3：
GNC Algorithm / 10.3.1：
Annealing Labeling for MAP-MRF Matching / 10.3.2：
Graph Cuts / 10.4：
Max-Flow / 10.4.1：
Two-Label Graph Cuts / 10.4.2：
Multilabel Graph Cuts / 10.4.3：
Genetic Algorithms / 10.5：
Standard GA / 10.5.1：
Hybrid GA: Comb Algorithm / 10.5.2：
Experimental Comparisons / 10.6：
Comparing Various Relaxation Labeling Algorithms / 10.6.1：
Comparing the ALH Algorithm with Others / 10.6.2：
Comparing the Comb Algorithm with Others / 10.6.3：
Accelerating Computation / 10.7：
Multiresolution Methods / 10.7.1：
Use of Heuristics / 10.7.2：
References
List of Notation
Index
Foreword / Anil K. Jain
Preface to the Third Edition / Rama Chellappa
Preface to the Second Edition
46.
ＥＢ
S. Z. Li
出版情報:
SpringerLink Books - AutoHoldings , Springer London, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Foreword / Anil K. Jain
Preface to the Third Edition / Rama Chellappa
Preface to the Second Edition
Preface to the First Edition
Introduction / 1：
Labeling for Image Analysis / 1.1：
Sites and Labels / 1.1.1：
The Labeling Problem / 1.1.2：
Labeling Problems in Image Analysis / 1.1.3：
Labeling with Contextual Constraints / 1.1.4：
Optimization-Based Approach / 1.2：
Research Issues / 1.2.1：
Role of Energy Functions / 1.2.2：
Formulation of Objective Functions / 1.2.3：
Optimality Criteria / 1.2.4：
The MAP-MRF Framework / 1.3：
Bayes Estimation / 1.3.1：
MAP-MRF Labeling / 1.3.2：
Regularization / 1.3.3：
Summary of the MAP-MRF Approach / 1.3.4：
Validation of Modeling / 1.4：
Mathematical MRF Models / 2：
Markov Random Fields and Gibbs Distributions / 2.1：
Neighborhood System and Cliques / 2.1.1：
Markov Random Fields / 2.1.2：
Gibbs Random Fields / 2.1.3：
Markov-Gibbs Equivalence / 2.1.4：
Normalized and Canonical Forms / 2.1.5：
Auto-models / 2.2：
Multi-level Logistic Model / 2.3：
The Smoothness Prior / 2.4：
Hierarchical GRF Model / 2.5：
The FRAME Model / 2.6：
Multiresolution MRF Modeling / 2.7：
Conditional Random Fields / 2.8：
Discriminative Random Fields / 2.9：
Strong MRF Model / 2.10：
<$>{\cal K}<$>-MRF and Nakagami-MRF Models / 2.11：
Graphical Models: MRF's versus Bayesian Networks / 2.12：
Low-Level MRF Models / 3：
Observation Models / 3.1：
Image Restoration and Reconstruction / 3.2：
MRF Priors for Image Surfaces / 3.2.1：
Piecewise Constant Restoration / 3.2.2：
Piecewise Continuous Restoration / 3.2.3：
Surface Reconstruction / 3.2.4：
Edge Detection / 3.3：
Edge Labeling Using Line Process / 3.3.1：
Forbidden Edge Patterns / 3.3.2：
Texture Synthesis and Analysis / 3.4：
MRF Texture Modeling / 3.4.1：
Texture Segmentation / 3.4.2：
Optical Flow / 3.5：
Variational Approach / 3.5.1：
Flow Discontinuities / 3.5.2：
Stereo Vision / 3.6：
Spatio-temporal Models / 3.7：
Bayesian Deformable Models / 3.8：
Formulation of EigenSnake / 3.8.1：
Experiments / 3.8.2：
High-Level MRF Models / 4：
Matching under Relational Constraints / 4.1：
Relational Structure Representation / 4.1.1：
Work in Relational Matching / 4.1.2：
Feature-Based Matching / 4.2：
Posterior Probability and Energy / 4.2.1：
Matching to Multiple Objects / 4.2.2：
Extensions / 4.2.3：
Optimal Matching to Multiple Overlapping Objects / 4.2.4：
Formulation of MAP-MRF Estimation / 4.3.1：
Computational Issues / 4.3.2：
Pose Computation / 4.4：
Pose Clustering and Estimation / 4.4.1：
Simultaneous Matching and Pose Estimation / 4.4.2：
Discussion / 4.4.3：
Face Detection and Recognition / 4.5：
Discontinuities in MRF's / 5：
Smoothness, Regularization, and Discontinuities / 5.1：
Regularization and Discontinuities / 5.1.1：
Other Regularization Models / 5.1.2：
The Discontinuity Adaptive MRF Model / 5.2：
Defining the DA Model / 5.2.1：
Relations with Previous Models / 5.2.2：
Discrete Data and 2D Cases / 5.2.3：
Solution Stability / 5.2.4：
Total Variation Models / 5.2.5：
Total Variation Norm / 5.3.1：
TV Models / 5.3.2：
Multichannel TV / 5.3.3：
Modeling Roof Discontinuities / 5.4：
Roof-Edge Model / 5.4.1：
MAP-MRF Solution / 5.4.2：
Experimental Results / 5.4.3：
Step-Edge-Preserving Smoothing / 5.5.1：
Roof-Edge-Preserving Smoothing / 5.5.2：
MRF Model with Robust Statistics / 6：
The DA Prior and Robust Statistics / 6.1：
Robust M-Estimator / 6.1.1：
Problems with M-Estimator / 6.1.2：
Redefinition of M-Estimator / 6.1.3：
AM-Estimator / 6.1.4：
Convex Priors for DA and M-Estimation / 6.1.5：
Half-Quadratic Minimization / 6.1.6：
Experimental Comparison / 6.2：
Location Estimation / 6.2.1：
Rotation Angle Estimation / 6.2.2：
MRF Parameter Estimation / 7：
Supervised Estimation with Labeled Data / 7.1：
Maximum Likelihood / 7.1.1：
Pseudo-likelihood / 7.1.2：
Coding Method / 7.1.3：
Mean Field Approximations / 7.1.4：
Least Squares Fit / 7.1.5：
Markov Chain Monte Carlo Methods / 7.1.6：
Learning in the FRAME Model / 7.1.7：
Unsupervised Estimation with Unlabeled Data / 7.2：
Simultaneous Restoration and Estimation / 7.2.1：
Simultaneous Segmentation and Estimation / 7.2.2：
Expectation-Maximization / 7.2.3：
Cross Validation / 7.2.4：
Estimating the Number of MRF's / 7.3：
Akaike Information Criterion (AIC) / 7.3.1：
Reversible Jump MCMC / 7.3.2：
Reduction of Nonzero Parameters / 7.4：
Parameter Estimation in Optimal Object Recognition / 8：
Motivation / 8.1：
Theory of Parameter Estimation for Recognition / 8.2：
Optimization-Based Object Recognition / 8.2.1：
Criteria for Parameter Estimation / 8.2.2：
Linear Classification Function / 8.2.3：
A Nonparametric Learning Algorithm / 8.2.4：
Reducing Search Space / 8.2.5：
Application in MRF Object Recognition / 8.3：
Posterior Energy / 8.3.1：
Energy in Linear Form / 8.3.2：
How the Minimal Configuration Changes / 8.3.3：
Parametric Estimation under Gaussian Noise / 8.3.4：
Recognition of Line Patterns / 8.4：
Recognition of Curved Objects / 8.4.2：
Convergence / 8.4.3：
Conclusion / 8.5：
Minimization - Local Methods / 9：
Problem Categorization / 9.1：
Classical Minimization with Continuous Labels / 9.2：
Minimization with Discrete Labels / 9.3：
Interated Conditional Modes / 9.3.1：
Relaxation Labeling / 9.3.2：
Belief Propagation / 9.3.3：
Convex Relaxation / 9.3.4：
Highest Confidence First / 9.3.5：
Dynamic Programming / 9.3.6：
Constrained Minimization / 9.4：
Penalty Functions / 9.4.1：
Lagrange Multipliers / 9.4.2：
Hopfield Method / 9.4.3：
Augmented Lagrange-Hopfield Method / 9.5：
MAP-MRF Estimation as Constrained Optimization / 9.5.1：
The ALH Method / 9.5.2：
Minimization - Global Methods / 10：
Simulated Annealing / 10.1：
Mean Field Annealing / 10.2：
Graduated Nonconvexity / 10.3：
GNC Algorithm / 10.3.1：
Annealing Labeling for MAP-MRF Matching / 10.3.2：
Graph Cuts / 10.4：
Max-Flow / 10.4.1：
Two-Label Graph Cuts / 10.4.2：
Multilabel Graph Cuts / 10.4.3：
Genetic Algorithms / 10.5：
Standard GA / 10.5.1：
Hybrid GA: Comb Algorithm / 10.5.2：
Experimental Comparisons / 10.6：
Comparing Various Relaxation Labeling Algorithms / 10.6.1：
Comparing the ALH Algorithm with Others / 10.6.2：
Comparing the Comb Algorithm with Others / 10.6.3：
Accelerating Computation / 10.7：
Multiresolution Methods / 10.7.1：
Use of Heuristics / 10.7.2：
References
List of Notation
Index
Foreword / Anil K. Jain
Preface to the Third Edition / Rama Chellappa
Preface to the Second Edition
47.
ＥＢ
Melanie Volkamer, John Mylopoulos
出版情報:
Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Elections and Electronic Voting / 1.1：
Motivation / 1.2：
Contribution, Methodology, and Structure / 1.3：
Fundamentals / Part I：
Implementations of Electronic Voting / 2：
Classification of Election Forms / 2.1：
Dimensions / 2.1.1：
Categories of Election Forms / 2.1.2：
Multiple Channel Elections / 2.1.3：
Paper-Based Elections versus Electronic Voting / 2.2：
Examples of Electronic Voting Machines / 2.3：
Direct Recording Electronic Voting Machines / 2.3.1：
Digital Election Pen / 2.3.2：
Overview of Remote Electronic Voting / 2.4：
Authentication Techniques / 2.4.1：
Techniques to Ensure the Secrecy of the Vote / 2.4.2：
Client-Side Voting Software / 2.4.3：
Summary / 2.5：
Related Work - A Landscape of Requirement Catalogues / 3：
Regulations for Electronic Voting Machines / 3.1：
German Federal Ordinance for Voting Machines / 3.1.1：
Election Law of the Free and Hanseatic City of Hamburg (Germany) / 3.1.2：
American Election Regulations / 3.1.3：
Requirements for Remote Electronic Voting / 3.2：
Council of Europe Recommendations / 3.2.1：
Online-Voting System Requirements for Non-parliamentary Elections / 3.2.2：
Catalogue of the Gesellschaft für Informatik / 3.2.3：
Swiss Election Law / 3.2.4：
Austrian Election Regulations / 3.2.5：
Network Voting System Standards / 3.2.6：
Scientific Papers / 3.3：
Result of the Analysis / 3.4：
Requirements / 3.5：
Process and Framework Description / 4：
Description of the Procedure / 4.1：
Election Principles / 4.2：
Threats / 4.3：
Syntax and Semantics / 4.4：
Beyond the Scope / 4.5：
Requirements for Electronic Voting Machines / 4.6：
Citation and Additional Notations / 5.1：
Target of Evaluation / 5.2：
Security Requirements / 5.3：
Security Requirements for the Polling Phase / 5.3.1：
Security Requirements for the Tallying Phase / 5.3.2：
Functional Requirements / 5.4：
Functional Requirements for the Polling Phase / 5.4.1：
Functional Requirements for the Tallying Phase / 5.4.2：
Functional Requirements for the Audit System / 5.4.3：
Assurance Requirements / 5.5：
Additional Requirements / 5.6：
Usability Requirements / 5.6.1：
Operational Requirements / 5.6.2：
Evaluation / 5.7：
Evaluation Methodology / 7：
Common Criteria Introduction / 7.1：
Discussion of Possible Trust Models / 7.2：
Trustworthy Vote Casting Device / 7.2.1：
Compromising Encryptions / 7.2.2：
Evaluation Assurance Level According to the Requirements / 7.3：
Formal IT Security Model / 7.4：
General Introduction / 7.4.1：
Application of Available IT Security Models for Elections / 7.4.2：
Selection of Security Objectives / 7.4.3：
Formal IT Security Model for Remote Electronic Voting / 7.4.4：
Core Protection Profile / 7.5：
Background, History, Motivation, and Discussions / 8.1：
The GI/BSI/DFKI Protection Profile / 8.2：
Introduction/TOE Overview / 8.2.1：
Conformance Claims / 8.2.2：
Security Problem Definition / 8.2.3：
Security Objectives and Functional Requirements / 8.2.4：
Security Assurance Requirements / 8.2.5：
Comparison, Open Points, and Suggestions for Improvements / 8.3：
Application / 8.3.1：
Proof of Concept / 9：
Procedure Specification / 9.1：
The Estonian System / 9.2：
System Description / 9.2.1：
System Analysis / 9.2.2：
The POLYAS System / 9.3：
Separation of Duty Principle / 9.3.1：
'K-resilience' Approach / 10.1：
Future Work - Open Issues / 10.3：
Conclusion / Part V：
Summary and Concluding Words / 12：
Appendix / Part VI：
List of Acronyms / A：
Links / B：
Electronic Voting Systems / B.1：
Electronic Voting Antagonists / B.2：
Glossary / C：
Election Terminology / C.1：
Electronic Voting Specific Terms / C.2：
Phases of the Election / C.3：
Participants / C.4：
Devices and Components / C.5：
Assessing Terminology / C.6：
Mapping: PP Glossary - Book Glossary / C.7：
Removed Requirements / D：
Protection Profile Structure / E：
References
Introduction / 1：
Elections and Electronic Voting / 1.1：
Motivation / 1.2：
48.
ＥＢ
Melanie Volkamer, John Mylopoulos
出版情報:
SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Elections and Electronic Voting / 1.1：
Motivation / 1.2：
Contribution, Methodology, and Structure / 1.3：
Fundamentals / Part I：
Implementations of Electronic Voting / 2：
Classification of Election Forms / 2.1：
Dimensions / 2.1.1：
Categories of Election Forms / 2.1.2：
Multiple Channel Elections / 2.1.3：
Paper-Based Elections versus Electronic Voting / 2.2：
Examples of Electronic Voting Machines / 2.3：
Direct Recording Electronic Voting Machines / 2.3.1：
Digital Election Pen / 2.3.2：
Overview of Remote Electronic Voting / 2.4：
Authentication Techniques / 2.4.1：
Techniques to Ensure the Secrecy of the Vote / 2.4.2：
Client-Side Voting Software / 2.4.3：
Summary / 2.5：
Related Work - A Landscape of Requirement Catalogues / 3：
Regulations for Electronic Voting Machines / 3.1：
German Federal Ordinance for Voting Machines / 3.1.1：
Election Law of the Free and Hanseatic City of Hamburg (Germany) / 3.1.2：
American Election Regulations / 3.1.3：
Requirements for Remote Electronic Voting / 3.2：
Council of Europe Recommendations / 3.2.1：
Online-Voting System Requirements for Non-parliamentary Elections / 3.2.2：
Catalogue of the Gesellschaft für Informatik / 3.2.3：
Swiss Election Law / 3.2.4：
Austrian Election Regulations / 3.2.5：
Network Voting System Standards / 3.2.6：
Scientific Papers / 3.3：
Result of the Analysis / 3.4：
Requirements / 3.5：
Process and Framework Description / 4：
Description of the Procedure / 4.1：
Election Principles / 4.2：
Threats / 4.3：
Syntax and Semantics / 4.4：
Beyond the Scope / 4.5：
Requirements for Electronic Voting Machines / 4.6：
Citation and Additional Notations / 5.1：
Target of Evaluation / 5.2：
Security Requirements / 5.3：
Security Requirements for the Polling Phase / 5.3.1：
Security Requirements for the Tallying Phase / 5.3.2：
Functional Requirements / 5.4：
Functional Requirements for the Polling Phase / 5.4.1：
Functional Requirements for the Tallying Phase / 5.4.2：
Functional Requirements for the Audit System / 5.4.3：
Assurance Requirements / 5.5：
Additional Requirements / 5.6：
Usability Requirements / 5.6.1：
Operational Requirements / 5.6.2：
Evaluation / 5.7：
Evaluation Methodology / 7：
Common Criteria Introduction / 7.1：
Discussion of Possible Trust Models / 7.2：
Trustworthy Vote Casting Device / 7.2.1：
Compromising Encryptions / 7.2.2：
Evaluation Assurance Level According to the Requirements / 7.3：
Formal IT Security Model / 7.4：
General Introduction / 7.4.1：
Application of Available IT Security Models for Elections / 7.4.2：
Selection of Security Objectives / 7.4.3：
Formal IT Security Model for Remote Electronic Voting / 7.4.4：
Core Protection Profile / 7.5：
Background, History, Motivation, and Discussions / 8.1：
The GI/BSI/DFKI Protection Profile / 8.2：
Introduction/TOE Overview / 8.2.1：
Conformance Claims / 8.2.2：
Security Problem Definition / 8.2.3：
Security Objectives and Functional Requirements / 8.2.4：
Security Assurance Requirements / 8.2.5：
Comparison, Open Points, and Suggestions for Improvements / 8.3：
Application / 8.3.1：
Proof of Concept / 9：
Procedure Specification / 9.1：
The Estonian System / 9.2：
System Description / 9.2.1：
System Analysis / 9.2.2：
The POLYAS System / 9.3：
Separation of Duty Principle / 9.3.1：
'K-resilience' Approach / 10.1：
Future Work - Open Issues / 10.3：
Conclusion / Part V：
Summary and Concluding Words / 12：
Appendix / Part VI：
List of Acronyms / A：
Links / B：
Electronic Voting Systems / B.1：
Electronic Voting Antagonists / B.2：
Glossary / C：
Election Terminology / C.1：
Electronic Voting Specific Terms / C.2：
Phases of the Election / C.3：
Participants / C.4：
Devices and Components / C.5：
Assessing Terminology / C.6：
Mapping: PP Glossary - Book Glossary / C.7：
Removed Requirements / D：
Protection Profile Structure / E：
References
Introduction / 1：
Elections and Electronic Voting / 1.1：
Motivation / 1.2：
49.
図書
Conrad Bessant, Ian Shadforth, Darren Oakley
出版情報:
New York : Oxford University Press, 2009 xii, 241 p. ; 25 cm
シリーズ名:
Oxford biology
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Acknowledgements
Preface
Introduction / 1：
From data to knowledge: the aim of bioinformatics / 1.1：
Using this book / 1.2：
About the coverage of this book / 1.2.1：
Choice of tools / 1.2.2：
Choice of operating system / 1.2.3：
www.bixsolutions.net / 1.2.4：
Software engineering in bioinformatics / 1.2.5：
Principal applications of bioinformatics / 1.3：
Sequence analysis / 1.3.1：
Microarray data analysis / 1.3.2：
Proteomics / 1.3.3：
Metabolomics / 1.3.4：
Systems biology / 1.3.5：
Literature mining / 1.3.6：
Structural biology / 1.3.7：
Building bioinformatics solutions / 1.4：
Publicly available bioinformatics resources / 1.5：
Publicly available data / 1.5.1：
Publicly available analysis tools / 1.5.2：
Some computing practicalities / 1.6：
Hardware requirements / 1.6.1：
The command line / 1.6.2：
Case sensitivity / 1.6.3：
Security, firewalls, and administration rights / 1.6.4：
References
Building biological databases with MySQL / 2：
Common database types / 2.1：
Flat text files / 2.1.1：
XML / 2.1.2：
Relational databases / 2.1.3：
Relational database design-the 'natural' approach / 2.2：
Steps 1-3: gather, group, and name the data / 2.2.1：
Step 4: data types / 2.2.2：
Step 5: atomicity of data / 2.2.3：
Steps 6 and 7: indexing and linking tables / 2.2.4：
Departure from design / 2.2.5：
Installing and configuring a MySQL server / 2.3：
Download and installation / 2.3.1：
Creating a database and a user account / 2.3.2：
Alternatives to MySQL / 2.4：
PostgreSQL / 2.4.1：
Oracle / 2.4.2：
Microsoft Access / 2.4.3：
Database access using SQL / 2.5：
Compatibility between RDBMSs / 2.5.1：
Error messages / 2.5.2：
Creating a database / 2.5.3：
Creating tables and enforcing referential integrity / 2.5.4：
Populating the database / 2.5.5：
Removing data and tables from the database / 2.5.6：
Creating and using source files / 2.5.7：
Querying the database / 2.5.8：
Transaction handling / 2.5.9：
Copying, moving, and backing up a database / 2.5.10：
Summary / 2.6：
Automating processes using Perl / 3：
Downloading and installing Perl / 3.1：
Getting Perl on Windows / 3.1.1：
Before getting started / 3.1.2：
Basic Perl syntax and logic / 3.2：
Scalar variables / 3.2.1：
Arrays / 3.2.2：
Hashes / 3.2.3：
Control structures and logic operators / 3.2.4：
Writing interactive programs-I/O basics / 3.2.5：
Some good coding practice / 3.2.6：
Multidimensional arrays / 3.2.7：
Multidimensional hashes / 3.3.2：
Viewing data structures with Data:: Dumper / 3.3.3：
Subroutines and modules / 3.4：
Making a Perl module / 3.4.1：
Regular expressions / 3.5：
Defining regular expressions / 3.5.1：
More advanced regular expressions / 3.5.2：
Regular expressions in practice / 3.5.3：
File handling and directory operations / 3.6：
Reading text files / 3.6.1：
Writing text files / 3.6.2：
Directory operations / 3.6.3：
Error handling / 3.7：
Retrieving files from the internet / 3.8：
Utilizing NCBI's eUtilities / 3.8.1：
Accessing relational databases using Perl DBI / 3.9：
Installing DBD:: MySQL / 3.9.1：
Connecting to database / 3.9.2：
Database transactions and error handling / 3.9.3：
Harnessing existing tools / 3.10：
CPAN / 3.10.1：
BioPerl / 3.10.2：
System commands / 3.10.3：
Alternatives to Perl / 3.11：
Python, Ruby and other scripting languages / 3.11.1：
Javaa, C/C++, and other compiled languages / 3.11.2：
Workflows / 3.11.3：
Numerical data analysis using R / 3.12：
Introduction to R / 4.1：
Downloading and installing R / 4.1.1：
Basic R concepts and syntax / 4.1.2：
Vectors and data frames / 4.1.3：
The nature of experimental data / 4.1.4：
R modes, objects, lists, classes, and methods / 4.1.5：
Importing data into R / 4.1.6：
Data visualization in R / 4.1.7：
Writing programs in R / 4.1.8：
Multivariate data analysis / 4.2：
Exploratory data analysis / 4.2.1：
Scatter plots / 4.2.2：
Principal components analysis / 4.2.3：
Hierarchical cluster analysis / 4.2.4：
Classification / 4.2.5：
R packages / 4.3：
Installing and using Bioconductor packages / 4.3.1：
The RMySQL package for database connectivity / 4.3.2：
Packages for multivariate classification / 4.3.3：
Writing your own R packages / 4.3.4：
Integrating Perl and R / 4.3.5：
Alternatives to R / 4.4：
S-Plus / 4.4.1：
Matlab / 4.4.2：
Octave / 4.4.3：
Programming for the Web / 4.5：
Introduction to web servers and Apache / 5.1：
Using the Apache web server / 5.1.1：
Apache fundamentals / 5.1.2：
Introduction to HTML / 5.2：
HTML versus XHTML / 5.2.1：
Creating and editing HTML/XHTML documents / 5.2.2：
The structure of a web page / 5.2.3：
XHTML tags and general formatting / 5.2.4：
An example web page / 5.2.5：
Web standards and browser compatbility / 5.2.6：
CGI programming using Perl / 5.3：
Debugging CGI programs / 5.3.1：
Adding dynamic content to web pages / 5.3.2：
Getting user input via forms / 5.3.3：
Advanced web techniques and languages / 5.4：
Cascading style sheets / 5.4.1：
JavaScript, JavaScript libraries, and Ajax / 5.4.2：
Data visualization with Perl and CGI / 5.5：
Using R graphics in Perl / 5.5.1：
Plotting graphs with GD::Graph / 5.5.2：
Plotting graphs with SVG::TT::Graph / 5.5.3：
Low level graphics in Perl / 5.5.4：
Using command line interfaces / 5.6：
Getting to the operating system command line / A.1：
General command line concepts / A.2：
Command line tips / A.3：
Index
Building Biological Databases with MySQL
Automating Processes Using Perl
Appendix: Using Command Line Interfaces
Acknowledgements
Preface
Introduction / 1：
50.
ＥＢ
Maria Papadopouli, Henning Schulzrinne
出版情報:
Springer eBooks Computer Science , Springer US, 2009
子書誌情報:
loading…
所蔵情報:
loading…
目次情報:
続きを見る
Introduction / 1：
Wireless data communications / 1.1：
Mobile information access / 1.2：
Wireless Internet via APs / 1.2.1：
Infostations / 1.2.2：
Peer-to-Peer systems / 1.2.3：
Target mobile computing environment / 1.3：
High spatial locality of information and queriess / 1.3.1：
Heterogeneity in application requirements / 1.3.2：
Enhancement of information access / 1.3.3：
Resource sharing using 7DS / 1.4：
Overview of this monograph / 1.5：
Outline / 1.5.1：
7DS architecture for information sharing / 2：
Overview of 7DS architecture / 2.1：
Communication / 2.1.1：
Cache management / 2.1.2：
Power conservation / 2.1.3：
Preventing denial-of-service attacks / 2.2：
Encouraging cooperation / 2.3：
Micropayment mechanisms / 2.3.1：
Reputation mechanisms / 2.3.2：
Location-sensing using the peer-to-peer paradigm / 2.4：
Overview of CLS / 2.4.1：
Particle filter-based framework / 2.4.2：
Performance of CLS and other related systems / 2.4.3：
Applications using information sharing via 7DS / 2.5：
Web browsing / 2.5.1：
Notesharing and whiteboard tool / 2.5.2：
Multimedia traveling journal / 2.5.3：
Related mobile peer-to-peer computing systems / 2.6：
Conclusions / 2.7：
Performance analysis of information discovery and dissemination / 3：
Information discovery schemes / 3.1：
Simulation assumptions / 3.2：
Data dissemination benchmarks / 3.3：
Density of dataholders / 3.4：
Average delay / 3.5：
Scaling properties of data dissemination / 3.6：
Models of information dissemination / 3.7：
Simple epidemic model / 3.7.1：
Diffusion-controlled process / 3.7.2：
Discussion / 3.8：
Empirically-based measurements on wireless demand / 4：
Campus-wide wireless infrastructure / 4.1：
Monitoring and data acquisition / 4.3：
Packet header traces / 4.3.1：
HTTP traces / 4.3.2：
SNMP traces / 4.3.3：
SYSLOG traces / 4.3.4：
Privacy assurances / 4.3.5：
Client identification / 4.3.6：
State, history, visits and sessions / 4.4：
Wireless traffic demand at APs / 4.5：
Data acquisition / 4.5.1：
Comparative analysis of wireless traffic load at APs / 4.5.2：
Application-based characterization of wireless demand / 4.6：
Locality of web objects / 4.7：
HTTP requests model / 4.7.1：
Same-client repeated requests / 4.7.2：
Same-AP repeated requests / 4.7.3：
AP_coresident-client repeated requests / 4.7.4：
Same-building and campus-wide repeated requests / 4.7.5：
Modeling the wireless user demand / 4.8：
Client access patterns / 5.1：
Session duration / 5.2.1：
Transient sessions / 5.2.2：
Revisits / 5.2.3：
Roaming across APs / 5.3：
Arrivals of wireless clients at APs / 5.4：
Time-varying Poisson process / 5.4.1：
Arrival process of visits at wireless hotspots / 5.4.2：
Methodology for modeling user demand / 5.5：
Sessions and flows / 5.5.1：
Models of user demand / 5.5.2：
Syntrig: a synthetic traffic generator / 5.6：
Scalability and reusability in user demand models / 5.7：
Variation of the session arrival rate within a day / 5.7.1：
Variation of the session-level flow-related variables / 5.7.2：
Evaluation of user demand models / 5.8：
Statistical-based evaluation / 5.8.1：
Systems-based evaluation / 5.8.2：
Singular spectrum analysis of traffic at APs / 5.9：
Related work / 5.10：
Conclusions and future work / 5.11：
Mobile peer-to-peer computing / 6.1：
Wireless measurements and modeling / 6.1.2：
Directions for future research / 6.2：
Increasing capacity / 6.2.1：
Capacity planning / 6.2.2：
Network interface and channel selection / 6.2.3：
Monitoring / 6.2.4：
Bio-inspired computing networks / 6.3：
New horizons in cross-disciplinary research / 6.4：
Appendices
Appendix / A：
Wireless measurement-based data repositories / B：
References
Index
Introduction / 1：
Wireless data communications / 1.1：
Mobile information access / 1.2：
図書
ＥＢ
