close
1.

図書
図書
1. Technical writing for teams : the STREAM tools handbook (pbk.)
Alexander Mamishev, Sean Williams
出版情報: Hoboken, N.J. : John Wiley & Sons, c2010  xvii, 243 p. ; 24 cm.
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
Introduction / Chapter 1：
In this Chapter / 1.1：
Our Audience / 1.2：
A few horror stories / 1.2.1：
Some history / 1.2.2：
The Need For a Good "Writing System" / 1.3：
Introducing Stream Tools / 1.4：
What is STREAM Tools? / 1.4.1：
Why use STREAM Tools? / 1.4.2：
The software of STREAM Tools / 1.4.3：
Recommended packages / 1.4.3.1：
A brief comparison of Microsoft Word vs. LaTeX: history and myths / 1.4.3.2：
How to Use this Book / 1.5：
Exercises / 1.6：
Quick Start Guide For Stream Tools / Chapter 2：
A General Overview of the Writing Process / 2.1：
Introduction to Writing Quality Tools: The Stream Tools Editorial Mark-Up Table / 2.3：
Introduction to Document Design Tools / 2.4：
Important fundamental concepts / 2.4.1：
Step 1: Use template files to create your new manuscripts / 2.4.1.1：
Step 2: Copy existing elements and paste them into a new location / 2.4.1.2：
Step 3: Edit the element / 2.4.1.3：
Step 4: Cross-referencing elements / 2.4.1.4：
Creating Elements in a Document / 2.4.2：
Headings / 2.4.2.1：
Equations / 2.4.2.2：
Figures / 2.4.2.3：
Tables / 2.4.2.4：
References (literature citations) / 2.4.2.5：
Introduction to File Management: Optimizing Your Workflow / 2.5：
General principles / 2.5.1：
Using a wiki for file management / 2.5.2：
Version control / 2.5.3：
Conclusions / 2.6：
Document Design / 2.7：
Creating Templates / 3.1：
How to create and cross-reference a heading template / 3.2.1：
How to alter a heading template / 3.2.1.2：
Common formatting mistakes in headings / 3.2.1.3：
Common stylistic mistakes for headings / 3.2.1.4：
Tips and tricks / 3.2.1.5：
How to create and cross-reference an equation template / 3.2.2：
How to alter an equation template / 3.2.2.2：
Common formatting mistakes for equations / 3.2.2.3：
Common stylistic mistakes for equations / 3.2.2.4：
How to create and cross-reference a figure template / 3.2.2.5：
How to alter a figure template / 3.2.3.2：
Common formatting mistakes in figures / 3.2.3.3：
Common stylistic mistakes in figures / 3.2.3.4：
Tips and tricks for figures / 3.2.3.5：
How to create and cross-reference a table template / 3.2.4：
How to alter a table template / 3.2.4.2：
Common typesetting mistakes / 3.2.4.3：
Common stylistic mistakes in tables / 3.2.4.4：
Tips and tricks for tables / 3.2.4.5：
Front matter / 3.2.5：
Controlling page numbers / 3.2.5.1：
Table of contents / 3.2.5.2：
Back matter / 3.2.6：
Appendices / 3.2.6.1：
Indices / 3.2.6.2：
Using Multiple Templates / 3.3：
Controlling styles / 3.3.1：
Switching between single-column and double-column formats / 3.3.2：
Master documents / 3.3.3：
Practice Problems / 3.4：
Additional Resources / 3.4.1：
Using Bibliographic Databases / 3.6：
Why Use a Bibliographic Database? / 4.1：
Choice of Software / 4.3：
Using Endnote / 4.4：
Setting up the interface / 4.4.1：
Adding references / 4.4.2：
Citing references / 4.4.3：
Sharing a Database / 4.5：
Numbering the database entries / 4.5.1：
Compatibility with BiBTeX / 4.5.2：
Formatting References / 4.6：
Planning, Drafting, and Editing Documents / 4.7：
Definition Stage / 5.1：
Select your team members / 5.2.1：
Hold a kick-off meeting / 5.2.2：
Analyze the audience / 5.2.3：
Formulate the purpose / 5.2.4：
Persuasion / 5.2.4.1：
Exposition / 5.2.4.2：
Instruction / 5.2.4.3：
Select the optimum combination of STREAM Tools / 5.2.5：
Preparation Stage / 5.3：
Evaluate historical documents / 5.3.1：
Journal articles / 5.3.1.1：
Proceedings/papers / 5.3.1.2：
Theses and dissertations / 5.3.1.3：
Proposals / 5.3.1.4：
Reports / 5.3.1.5：
Populate the file repository / 5.3.2：
Create a comprehensive outline of the document / 5.3.3：
Using deductive structures / 5.3.3.1：
Using Microsoft Word's Outline feature / 5.3.3.2：
Populate all sections with "yellow text" / 5.3.4：
Distribute writing tasks among team members / 5.3.5：
Choose a drafting strategy / 5.3.5.1：
Synchronize writing styles / 5.3.5.2：
Writing Stage / 5.4：
Enter content / 5.4.1：
Legacy content / 5.4.1.1：
New content / 5.4.1.2：
Control versions of shared files / 5.4.1.3：
Request that team members submit their drafts / 5.4.2：
Verify that each section is headed in the right direction / 5.4.3：
Construct the whole document / 5.4.4：
Revise for content and distribute additional writing tasks / 5.4.5：
Comprehensive editing / 5.4.5.1：
STREAM Tools Editorial Mark-up table (STEM Table) / 5.4.5.2：
Strategies for editing electronic copy using Microsoft Word--an overview of Microsoft Word's commenting, reviewing, and proofing features / 5.4.5.3：
Distribute additional writing tasks / 5.4.6：
Completion Stage / 5.5：
Copy edit the document / 5.5.1：
Send out for a final review of content and clarity / 5.5.2：
Proofread the document / 5.5.3：
Submit the document / 5.5.4：
Conduct the final process-improvement review session / 5.5.5：
Building High Quality Writing Teams / 5.6：
Understanding the Benefits and Challenges of Teamwork / 6.1：
The payoff of teamwork / 6.2.1：
Some principle challenges of teamwork / 6.2.2：
Identifying Team Goals and Assigning Member Roles / 6.3：
Define roles and procedures clearly / 6.3.1：
Define team roles / 6.3.1.1：
Define team procedures / 6.3.1.2：
Managing Teamwork at a Distance / 6.4：
Building trust in virtual teams / 6.4.1：
Demonstrating sensitivity to cultural differences / 6.4.2：
Selecting Communication Tools To Support Teamwork / 6.5：
Wikis / 6.5.1：
Creating a wiki / 6.5.1.1：
Editing / 6.5.1.2：
Organizing / 6.5.1.3：
Monitoring edits / 6.5.1.4：
Other suggestions for wiki use / 6.5.1.5：
SharePoint / 6.5.2：
Lists / 6.5.2.1：
Web pages / 6.5.2.2：
Alerts and site management / 6.5.2.3：
Assuring Quality Writing / 6.6：
Choosing the Best Words 278 / 7.1：
Choose strong words / 7.2.1：
Use strong nouns and verbs / 7.2.1.1：
Choose words with the right level of formality / 7.2.1.2：
Avoid weak words / 7.2.2：
Check for confusing or frequently misused words / 7.2.2.1：
Avoid double negatives, and change negatives to affirmatives / 7.2.2.2：
Avoid changing verbs to nouns / 7.2.2.3：
Delete meaningless words and modifiers / 7.2.2.4：
Steer clear of jargon / 7.2.2.5：
Avoid sexist or discriminatory language / 7.2.2.6：
Writing Strong Sentences / 7.3：
Write economically / 7.3.1：
Include a variety of sentence types / 7.3.2：
Avoiding Weak Sentence Construction / 7.4：
Comma splices / 7.4.1.1：
Fragments / 7.4.1.2：
Fused or run-on sentences / 7.4.1.3：
Misplaced, dangling, or two-way modifiers / 7.4.1.4：
Faulty parallelism / 7.4.1.5：
Punctuating For Clarity / 7.5：
End punctuation / 7.5.1：
Periods / 7.5.1.1：
Question marks / 7.5.1.2：
Exclamation points / 7.5.1.3：
Commas / 7.5.2：
Semicolons / 7.5.3：
Colons / 7.5.4：
Apostrophes / 7.5.5：
Dashes and hyphens / 7.5.6：
Final Considerations / 7.6：
Abbreviations and acronyms / 7.6.1：
Capitalization / 7.6.2：
Numbers / 7.6.3：
Dates / 7.6.4：
Fractions and percentages / 7.6.5：
Units of measure / 7.6.6：
A Final Note on Grammar / 7.7：
Concluding Remarks / 7.8：
Business Case / 8.1：
Frequently Asked Questions / 8.3：
Success Stories / 8.4：
Additional Reading / 8.5：
Useful books and articles / 8.5.1：
Useful weblinks / 8.5.2：
EXERCISES / 8.6：
Preface
Acknowledgments
Introduction / Chapter 1：
2.

電子ブック
ＥＢ
2. 2nd Workshop on Specialty Optical Fibers and Their Applications (WSOF-2)
Hern??ndez-cordero
出版情報: SPIE Digital Library Proceedings , 2010
所蔵情報: loading…
3.

図書
図書
3. Freshwater algae : identification and use as bioindicators
Edward Bellinger and David C. Sigee
出版情報: Chichester, West Sussex, UK ; Hoboken, N.J. : Wiley-Blackwell, 2010  viii, 271 p ; 26 cm
所蔵情報: loading…
目次情報: 続きを見る
Introduction to freshwater algae / 1：
General introduction / 1.1：
Algae / 1.1.1：
Algae as primary producers / 1.1.2：
Freshwater environments / 1.1.3：
Planktonic and benthic algae / 1.1.4：
Size and shape / 1.1.5：
Taxonomic variation / 1.2：
Microscopical appearance / 1.2.1：
Biochemistry / 1.2.2：
Molecular characteristics and identification / 1.2.3：
Blue-green algae / 1.3：
Cytology / 1.3.1：
Morphological and taxonomic diversity / 1.3.2：
Ecology / 1.3.3：
Blue-green algae as bioindicators / 1.3.4：
Green algae / 1.4：
Morphological diversity / 1.4.1：
Green algae as bioindicators / 1.4.3：
Euglenoids / 1.5：
Euglenoids as bioindicators / 1.5.1：
Yellow-green algae / 1.6：
Yellow-green algae as bioindicators / 1.6.1：
Dinoflagellates / 1.7：
Cryptomonads / 1.7.1：
Comparison with euglenoid algae / 1.8.1：
Biodiversity / 1.8.3：
Cryptomonads as bioindicators / 1.8.4：
Chrysophytes / 1.9：
Chrysophytes as bioindicators / 1.9.1：
Diatoms / 1.10：
Diatoms as bioindicators / 1.10.1：
Red algae / 1.11：
Brown algae / 1.12：
Sampling, biomass estimation and counts of freshwater algae A Planktonic algae / 2：
Protocol for collection / 2.1：
Standing water phytoplankton / 2.1.1：
River phytoplankton
Mode of collection / 2.2：
Phytoplankton trawl net / 2.2.1：
Volume samplers / 2.2.2：
Integrated sampling / 2.2.3：
Sediment traps / 2.2.4：
Phytoplankton biomass / 2.3：
Turbidity / 2.3.1：
Dry weight and ash-free dry weight / 2.3.2：
Pigment concentrations / 2.3.3：
Flow cytometry / 2.4：
Microscope counts of species populations / 2.5：
Sample preservation and processing / 2.5.1：
Species counts / 2.5.2：
Conversion of species counts to biovolumes / 2.5.3：
Chemical cleaning of diatoms / 2.5.4：
Diversity within species populations / 2.6：
Molecular analysis / 2.6.1：
Analytical microscopical techniques B Non-planktonic algae / 2.6.2：
Deep water benthic algae / 2.7：
Benthic-pelagic coupling / 2.7.1：
Benthic algae and sediment stability / 2.7.2：
Invertebrate grazing of benthic algae / 2.7.3：
Shallow water communities / 2.8：
Substrate / 2.8.1：
Algal communities / 2.8.2：
Algal biofilms / 2.9：
Mucialginous biofilms / 2.9.1：
Biomass / 2.9.2：
Taxonomic composition / 2.9.3：
Matrix structure / 2.9.4：
Periphyton? algal mats / 2.10：
Inorganic substratum / 2.10.1：
Plant surfaces / 2.10.2：
Algae as bioindicators / 3：
Bioindicators and water quality / 3.1：
Biomarkers and bioindicators / 3.1.1：
Characteristics of bioindicators / 3.1.2：
Biological monitoring versus chemical measurements / 3.1.3：
Monitoring water quality: objectives / 3.1.4：
Lakes / 3.2：
Contemporary planktonic and attached algae as bioindicators / 3.2.1：
Fossil algae as bioindicators: lake sediment analysis / 3.2.2：
Water quality parameters / 3.2.3：
Wetlands / 3.3：
Rivers / 3.4：
The periphyton community / 3.4.1：
River diatoms / 3.4.2：
Evaluation of the diatom community / 3.4.3：
Human impacts and diatom indices / 3.4.4：
Calculation of diatom indices / 3.4.5：
Practical applications of diatom indices / 3.4.6：
Estuaries / 3.5：
Ecosystem complexity / 3.5.1：
Algae as estuarine bioindicators / 3.5.2：
A key to the more frequently occurring freshwater algae / 4：
Introduction to the key / 4.1：
Using the key / 4.1.1：
Morphological groupings / 4.1.2：
Key to the main genera and species / 4.2：
List of algae included and their occurrence in the key / 4.3：
Algal identification: bibliography / 4.4：
Glossary
References
Index
Introduction to freshwater algae / 1：
General introduction / 1.1：
Algae / 1.1.1：
4.

電子ブック
ＥＢ
4. Advanced Statistical Steganalysis
Rainer B?hme
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Steganography and Steganalysis as Empirical Sciences / 1.1：
Objective and Approach / 1.2：
Outline / 1.3：
Background and Advances in Theory / Part I：
Principles of Modern Steganography and Steganalysis / 2：
Digital Steganography and Steganalysis / 2.1：
Steganographic System / 2.1.1：
Steganalysis / 2.1.2：
Relevance in Social and Academic Contexts / 2.1.3：
Conventions / 2.2：
Design Goals and Metrics / 2.3：
Capacity / 2.3.1：
Steganographic Security / 2.3.2：
Robustness / 2.3.3：
Further Metrics / 2.3.4：
Paradigms for the Design of Steganographic Systems / 2.4：
Paradigm I: Modify with Caution / 2.4.1：
Paradigm II: Cover Generation / 2.4.2：
Dominant Paradigm / 2.4.3：
Adversary Models / 2.5：
Passive Warden / 2.5.1：
Active Warden / 2.5.2：
Embedding Domains / 2.6：
Artificial Channels / 2.6.1：
Spatial and Time Domains / 2.6.2：
Transformed Domain / 2.6.3：
Selected Cover Formats: JPEG and MP3 / 2.6.4：
Exotic Covers / 2.6.5：
Embedding Operations / 2.7：
LSB Replacement / 2.7.1：
LSB Matching (±1) / 2.7.2：
Mod-? Replacement, Mod-? Matching, and Generalisations / 2.7.3：
Multi-Sample Rules / 2.7.4：
Adaptive Embedding / 2.7.5：
Protocols and Message Coding / 2.8：
Public-Key Steganography / 2.8.1：
Maximising Embedding Efficiency / 2.8.2：
Specific Detection Techniques / 2.9：
Calibration of JPEG Histograms / 2.9.1：
Universal Detectors / 2.9.2：
Quantitative Steganalysis / 2.9.3：
Selected Estimators for LSB Replacement in Spatial Domain Images / 2.10：
RS Analysis / 2.10.1：
Sample Pair Analysis / 2.10.2：
Higher-Order Structural Steganalysis / 2.10.3：
Weighted Stego Image Steganalysis / 2.10.4：
Summary and Further Steps / 2.11：
Towards a Theory of Cover Models / 3：
Steganalyst's Problem Formalised / 3.1：
The Plausibility Heuristic / 3.1.1：
Application to Digital Steganography / 3.1.2：
Incognisability of the Cover Distribution / 3.1.3：
Cover Models / 3.2：
Defining Cover Models / 3.2.1：
Options for Formulating Cover Models / 3.2.2：
Cover Models and Detection Performance / 3.2.3：
Summary and Motivations for Studying Cover Models / 3.2.4：
Dealing with Heterogeneous Cover Sources / 3.3：
Mixture Distributions / 3.3.1：
The Mixture Cover Model / 3.3.2：
Relation to Prior Information-Theoretic Work / 3.4：
Theoretical Limits / 3.4.1：
Observability Bounds / 3.4.2：
Computational Bounds / 3.4.3：
Applicability of the Theory of Cover Models / 3.4.4：
Indeterminacy in the Cover / 3.4.5：
Instances of Cover Models for Heterogeneous Sources / 3.5：
Summary / 3.6：
Specific Advances in Steganalysis / Part II：
Detection of Model-Based Steganography with First-Order Statistics / 4：
Fundamentals of Model-Based Steganography / 4.1：
MB1: An Embedding Function for JPEG Covers / 4.2：
Detection Method / 4.3：
Experimental Validation / 4.4：
Summary and Outlook / 4.5：
Limitations and Future Directions / 4.5.1：
Possible (Short-Term) Countermeasures / 4.5.2：
Implications for More Secure Steganography / 4.5.3：
Models of Heterogeneous Covers for Quantitative Steganalysis / 5：
Metrics for Quantitative Steganalysis / 5.1：
Conventional Metrics / 5.1.1：
Improved Metrics Based on a Distribution Model / 5.1.2：
Decomposition of Estimation Errors / 5.1.3：
Measurement of Sensitivity to Cover Properties / 5.2：
Method / 5.2.1：
Modelling the Shape of the Between-Image Distribution / 5.2.2：
Modelling the Shape of the Within-Image Distribution / 5.2.3：
Summary and Conclusion / 5.3：
Improved Weighted Stego Image Steganalysis / 6：
Enhanced WS for Never-Compressed Covers / 6.1：
Enhanced Predictor / 6.1.1：
Enhanced Calculation of Weights / 6.1.2：
Enhanced Bias Correction / 6.1.3：
Experimental Results / 6.1.4：
Adaptation of WS to JPEG Pre-Compressed Covers / 6.2：
Improved Predictor / 6.2.1：
Estimation of the Cover's JPEG Compression Quality / 6.2.2：
Using Encoder Artefacts for Steganalysis of Compressed Audio Streams / 6.2.3：
MP3 Steganography and Steganalysis / 7.1：
Problem Statement in the Mixture Cover Model Framework / 7.1.1：
Level of Analysis and Related Work / 7.1.2：
Description of Features / 7.1.3：
Features Based on the Compression Size Control Mechanism / 7.2.1：
Features Based on Model Decisions / 7.2.2：
Features Based on Capability Usage / 7.2.3：
Feature Based on Stream Formatting / 7.2.4：
Experimental Results for Encoder Detection / 7.3：
Single-Compressed Audio Files / 7.3.1：
Importance of Individual Features / 7.3.2：
Influence of Double-Compression / 7.3.3：
Experimental Results for Improved Steganalysis / 7.4：
Explorative Analysis of Encoder Similarities / 7.5：
Summary and Discussion / 7.6：
Transferability to Other Formats / 7.6.1：
Related Applications / 7.6.3：
Synthesis / Part III：
General Discussion / 8：
Summary of Results / 8.1：
Results Based on Informal Arguments / 8.1.1：
Results Based on Mathematical Proofs / 8.1.2：
Results Based on Empirical Evidence / 8.1.3：
Limitations / 8.2：
Directions for Future Research / 8.3：
Theoretical Challenges / 8.3.1：
Empirical Challenges / 8.3.2：
Practical Challenges / 8.3.3：
Conclusion and Outlook / 8.4：
Description of Covers Used in the Experiments / A：
Spurious Steganalysis Results Using the 'van Hateren' Image Database / B：
Proof of Weighted Stego Image (WS) Estimator / C：
Derivation of Linear Predictor for Enhanced WS / D：
Game for Formal Security Analysis / E：
Derivation of ROC Curves and AUC Metric for Example Cover Models / F：
Supplementary Figures and Tables / G：
References
List of Tables
List of Figures
List of Acronyms
List of Symbols
List of Functions
Index
Introduction / 1：
Steganography and Steganalysis as Empirical Sciences / 1.1：
Objective and Approach / 1.2：
5.

電子ブック
ＥＢ
5. Advanced Statistical Steganalysis
Rainer Böhme
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Steganography and Steganalysis as Empirical Sciences / 1.1：
Objective and Approach / 1.2：
Outline / 1.3：
Background and Advances in Theory / Part I：
Principles of Modern Steganography and Steganalysis / 2：
Digital Steganography and Steganalysis / 2.1：
Steganographic System / 2.1.1：
Steganalysis / 2.1.2：
Relevance in Social and Academic Contexts / 2.1.3：
Conventions / 2.2：
Design Goals and Metrics / 2.3：
Capacity / 2.3.1：
Steganographic Security / 2.3.2：
Robustness / 2.3.3：
Further Metrics / 2.3.4：
Paradigms for the Design of Steganographic Systems / 2.4：
Paradigm I: Modify with Caution / 2.4.1：
Paradigm II: Cover Generation / 2.4.2：
Dominant Paradigm / 2.4.3：
Adversary Models / 2.5：
Passive Warden / 2.5.1：
Active Warden / 2.5.2：
Embedding Domains / 2.6：
Artificial Channels / 2.6.1：
Spatial and Time Domains / 2.6.2：
Transformed Domain / 2.6.3：
Selected Cover Formats: JPEG and MP3 / 2.6.4：
Exotic Covers / 2.6.5：
Embedding Operations / 2.7：
LSB Replacement / 2.7.1：
LSB Matching (±1) / 2.7.2：
Mod-? Replacement, Mod-? Matching, and Generalisations / 2.7.3：
Multi-Sample Rules / 2.7.4：
Adaptive Embedding / 2.7.5：
Protocols and Message Coding / 2.8：
Public-Key Steganography / 2.8.1：
Maximising Embedding Efficiency / 2.8.2：
Specific Detection Techniques / 2.9：
Calibration of JPEG Histograms / 2.9.1：
Universal Detectors / 2.9.2：
Quantitative Steganalysis / 2.9.3：
Selected Estimators for LSB Replacement in Spatial Domain Images / 2.10：
RS Analysis / 2.10.1：
Sample Pair Analysis / 2.10.2：
Higher-Order Structural Steganalysis / 2.10.3：
Weighted Stego Image Steganalysis / 2.10.4：
Summary and Further Steps / 2.11：
Towards a Theory of Cover Models / 3：
Steganalyst's Problem Formalised / 3.1：
The Plausibility Heuristic / 3.1.1：
Application to Digital Steganography / 3.1.2：
Incognisability of the Cover Distribution / 3.1.3：
Cover Models / 3.2：
Defining Cover Models / 3.2.1：
Options for Formulating Cover Models / 3.2.2：
Cover Models and Detection Performance / 3.2.3：
Summary and Motivations for Studying Cover Models / 3.2.4：
Dealing with Heterogeneous Cover Sources / 3.3：
Mixture Distributions / 3.3.1：
The Mixture Cover Model / 3.3.2：
Relation to Prior Information-Theoretic Work / 3.4：
Theoretical Limits / 3.4.1：
Observability Bounds / 3.4.2：
Computational Bounds / 3.4.3：
Applicability of the Theory of Cover Models / 3.4.4：
Indeterminacy in the Cover / 3.4.5：
Instances of Cover Models for Heterogeneous Sources / 3.5：
Summary / 3.6：
Specific Advances in Steganalysis / Part II：
Detection of Model-Based Steganography with First-Order Statistics / 4：
Fundamentals of Model-Based Steganography / 4.1：
MB1: An Embedding Function for JPEG Covers / 4.2：
Detection Method / 4.3：
Experimental Validation / 4.4：
Summary and Outlook / 4.5：
Limitations and Future Directions / 4.5.1：
Possible (Short-Term) Countermeasures / 4.5.2：
Implications for More Secure Steganography / 4.5.3：
Models of Heterogeneous Covers for Quantitative Steganalysis / 5：
Metrics for Quantitative Steganalysis / 5.1：
Conventional Metrics / 5.1.1：
Improved Metrics Based on a Distribution Model / 5.1.2：
Decomposition of Estimation Errors / 5.1.3：
Measurement of Sensitivity to Cover Properties / 5.2：
Method / 5.2.1：
Modelling the Shape of the Between-Image Distribution / 5.2.2：
Modelling the Shape of the Within-Image Distribution / 5.2.3：
Summary and Conclusion / 5.3：
Improved Weighted Stego Image Steganalysis / 6：
Enhanced WS for Never-Compressed Covers / 6.1：
Enhanced Predictor / 6.1.1：
Enhanced Calculation of Weights / 6.1.2：
Enhanced Bias Correction / 6.1.3：
Experimental Results / 6.1.4：
Adaptation of WS to JPEG Pre-Compressed Covers / 6.2：
Improved Predictor / 6.2.1：
Estimation of the Cover's JPEG Compression Quality / 6.2.2：
Using Encoder Artefacts for Steganalysis of Compressed Audio Streams / 6.2.3：
MP3 Steganography and Steganalysis / 7.1：
Problem Statement in the Mixture Cover Model Framework / 7.1.1：
Level of Analysis and Related Work / 7.1.2：
Description of Features / 7.1.3：
Features Based on the Compression Size Control Mechanism / 7.2.1：
Features Based on Model Decisions / 7.2.2：
Features Based on Capability Usage / 7.2.3：
Feature Based on Stream Formatting / 7.2.4：
Experimental Results for Encoder Detection / 7.3：
Single-Compressed Audio Files / 7.3.1：
Importance of Individual Features / 7.3.2：
Influence of Double-Compression / 7.3.3：
Experimental Results for Improved Steganalysis / 7.4：
Explorative Analysis of Encoder Similarities / 7.5：
Summary and Discussion / 7.6：
Transferability to Other Formats / 7.6.1：
Related Applications / 7.6.3：
Synthesis / Part III：
General Discussion / 8：
Summary of Results / 8.1：
Results Based on Informal Arguments / 8.1.1：
Results Based on Mathematical Proofs / 8.1.2：
Results Based on Empirical Evidence / 8.1.3：
Limitations / 8.2：
Directions for Future Research / 8.3：
Theoretical Challenges / 8.3.1：
Empirical Challenges / 8.3.2：
Practical Challenges / 8.3.3：
Conclusion and Outlook / 8.4：
Description of Covers Used in the Experiments / A：
Spurious Steganalysis Results Using the 'van Hateren' Image Database / B：
Proof of Weighted Stego Image (WS) Estimator / C：
Derivation of Linear Predictor for Enhanced WS / D：
Game for Formal Security Analysis / E：
Derivation of ROC Curves and AUC Metric for Example Cover Models / F：
Supplementary Figures and Tables / G：
References
List of Tables
List of Figures
List of Acronyms
List of Symbols
List of Functions
Index
Introduction / 1：
Steganography and Steganalysis as Empirical Sciences / 1.1：
Objective and Approach / 1.2：
6.

電子ブック
ＥＢ
6. Parsing Beyond Context-Free Grammars
Laura Kallmeyer
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Formal Grammars and Natural Languages / 1.1：
Parsing Beyond CFGs / 1.2：
What This Book Is Not About / 1.3：
Overview of the Book / 1.4：
Grammar Formalisms for Natural Languages / 1.4.1：
Parsing: Preliminaries / 1.4.2：
Tree Adjoining Grammars / 1.4.3：
MCFG and LCFRS / 1.4.4：
Range Concatenation Grammars / 1.4.5：
Automata / 1.4.6：
Some Basic Definitions / 1.5：
Languages / 1.5.1：
Context-Free Grammars / 1.5.2：
Trees / 1.5.3：
Context-Free Grammars and Natural Languages / 2：
The Generative Capacity of CFGs / 2.1.1：
CFGs and Lexicalization / 2.1.2：
Mild Context-Sensitivity / 2.1.3：
Grammar Formalisms Beyond CFG / 2.2：
Linear Indexed Grammars / 2.2.1：
Linear Context-Free Rewriting Systems / 2.2.3：
Multicomponent Tree Adjoining Grammars / 2.2.4：
Multiple Context-Free Grammars / 2.2.5：
Summary / 2.2.6：
Parsing as Deduction / 3：
Motivation / 3.1.1：
Items / 3.1.2：
Deduction Rules / 3.1.3：
Implementation Issues / 3.2：
Dynamic Programming / 3.2.1：
Chart Parsing and Tabulation / 3.2.2：
Hypergraphs / 3.2.3：
Properties of Parsing Algorithms / 3.3：
Soundness and Completeness / 3.3.1：
Complexity / 3.3.2：
Valid Prefix Property / 3.3.3：
Introduction to Tree Adjoining Grammars / 3.4：
Definition of TAG / 4.1.1：
Formal Properties / 4.1.2：
Linguistic Principles for TAG / 4.1.3：
Extended Domain of Locality and Factoring of Recursion / 4.1.4：
Constituency and Dependencies / 4.1.5：
Equivalent Formalisms / 4.2：
Tree-Local MCTAG / 4.2.1：
Combinatory Categorial Grammars / 4.2.2：
Parsing Tree Adjoining Grammars / 4.3：
A CYK Parser for TAG / 5.1：
The Recognizer / 5.1.1：
An Earley Parser for TAG / 5.1.2：
Inference Rules / 5.2.1：
Extending the Algorithm to Substitution / 5.2.4：
The Parser / 5.2.5：
Properties of the Algorithm / 5.2.6：
Prefix Valid Earley Parsing / 5.2.7：
An LR Parser for TAG / 5.3：
Construction of the Automation / 5.3.1：
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems / 5.3.3：
Introduction to MCFG, LCFRS and Simple RCG / 6.1：
Applications / 6.1.1：
Set-Local Multicomponent TAG / 6.2：
Minimalist Grammars / 6.2.2：
Finite-Copying LFG / 6.2.3：
Parsing MCFG, LCFRS and Simple RCG / 6.3：
CYK Parsing of MCFG / 7.1：
The Basic Algorithm / 7.1.1：
The Naïve Algorithm / 7.1.2：
The Active Algorithm / 7.1.3：
The Incremental Algorithm / 7.1.4：
Prediction Strategies / 7.1.5：
Simplifying Simple RCGs / 7.2：
Eliminating Useless Rules / 7.2.1：
Eliminating ?-Rules / 7.2.2：
Ordered Simple RCG / 7.2.3：
Binarization of the Rules / 7.2.4：
An Incremental Earley Parser for Simple RCG / 7.3：
The Algorithm / 7.3.1：
Filters / 7.3.2：
Introduction to Range Concatenation Grammars / 7.4：
Definition of RCG / 8.1.1：
Relations to Other Formalisms / 8.1.2：
Literal Movement Grammars / 8.2.1：
CFG, TAG and MCFG / 8.2.2：
Parsing Range Concatenation Grammars / 8.3：
Basic RCG Parsing / 9.1：
CYK Parsing with Passive Items / 9.1.1：
Non-directional Top-Down Parsing / 9.1.2：
Directional Top-Down Parsing / 9.1.3：
Optimizations / 9.1.4：
Parsing with Constraint Propagation / 9.2：
Range Constraints / 9.2.1：
CYK Parsing with Active Items / 9.2.2：
Earley Parsing / 9.2.3：
Embedded Push-Down Automata / 9.3：
Definition of EPDA / 10.1.1：
EPDA and TAG / 10.1.2：
Bottom-Up Embedded Push-Down Automata / 10.1.3：
?-Order EPDA / 10.1.4：
Two-Stack Automata / 10.2：
General Definition / 10.2.1：
Strongly-Driven Two-Stack Automata / 10.2.2：
Thread Automata / 10.3：
Idea / 10.3.1：
General Definition of TA / 10.3.2：
Constructing a TA for a TAG / 10.3.3：
Constructing a TA for an Ordered SRCG / 10.3.4：
Hierarchy of Grammar Formalisms / 10.4：
List of Acronyms / Appendix B：
Solutions
References
Index
Introduction / 1：
Formal Grammars and Natural Languages / 1.1：
Parsing Beyond CFGs / 1.2：
7.

電子ブック
ＥＢ
7. Parsing Beyond Context-Free Grammars
Laura Kallmeyer
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Formal Grammars and Natural Languages / 1.1：
Parsing Beyond CFGs / 1.2：
What This Book Is Not About / 1.3：
Overview of the Book / 1.4：
Grammar Formalisms for Natural Languages / 1.4.1：
Parsing: Preliminaries / 1.4.2：
Tree Adjoining Grammars / 1.4.3：
MCFG and LCFRS / 1.4.4：
Range Concatenation Grammars / 1.4.5：
Automata / 1.4.6：
Some Basic Definitions / 1.5：
Languages / 1.5.1：
Context-Free Grammars / 1.5.2：
Trees / 1.5.3：
Context-Free Grammars and Natural Languages / 2：
The Generative Capacity of CFGs / 2.1.1：
CFGs and Lexicalization / 2.1.2：
Mild Context-Sensitivity / 2.1.3：
Grammar Formalisms Beyond CFG / 2.2：
Linear Indexed Grammars / 2.2.1：
Linear Context-Free Rewriting Systems / 2.2.3：
Multicomponent Tree Adjoining Grammars / 2.2.4：
Multiple Context-Free Grammars / 2.2.5：
Summary / 2.2.6：
Parsing as Deduction / 3：
Motivation / 3.1.1：
Items / 3.1.2：
Deduction Rules / 3.1.3：
Implementation Issues / 3.2：
Dynamic Programming / 3.2.1：
Chart Parsing and Tabulation / 3.2.2：
Hypergraphs / 3.2.3：
Properties of Parsing Algorithms / 3.3：
Soundness and Completeness / 3.3.1：
Complexity / 3.3.2：
Valid Prefix Property / 3.3.3：
Introduction to Tree Adjoining Grammars / 3.4：
Definition of TAG / 4.1.1：
Formal Properties / 4.1.2：
Linguistic Principles for TAG / 4.1.3：
Extended Domain of Locality and Factoring of Recursion / 4.1.4：
Constituency and Dependencies / 4.1.5：
Equivalent Formalisms / 4.2：
Tree-Local MCTAG / 4.2.1：
Combinatory Categorial Grammars / 4.2.2：
Parsing Tree Adjoining Grammars / 4.3：
A CYK Parser for TAG / 5.1：
The Recognizer / 5.1.1：
An Earley Parser for TAG / 5.1.2：
Inference Rules / 5.2.1：
Extending the Algorithm to Substitution / 5.2.4：
The Parser / 5.2.5：
Properties of the Algorithm / 5.2.6：
Prefix Valid Earley Parsing / 5.2.7：
An LR Parser for TAG / 5.3：
Construction of the Automation / 5.3.1：
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems / 5.3.3：
Introduction to MCFG, LCFRS and Simple RCG / 6.1：
Applications / 6.1.1：
Set-Local Multicomponent TAG / 6.2：
Minimalist Grammars / 6.2.2：
Finite-Copying LFG / 6.2.3：
Parsing MCFG, LCFRS and Simple RCG / 6.3：
CYK Parsing of MCFG / 7.1：
The Basic Algorithm / 7.1.1：
The Naïve Algorithm / 7.1.2：
The Active Algorithm / 7.1.3：
The Incremental Algorithm / 7.1.4：
Prediction Strategies / 7.1.5：
Simplifying Simple RCGs / 7.2：
Eliminating Useless Rules / 7.2.1：
Eliminating ?-Rules / 7.2.2：
Ordered Simple RCG / 7.2.3：
Binarization of the Rules / 7.2.4：
An Incremental Earley Parser for Simple RCG / 7.3：
The Algorithm / 7.3.1：
Filters / 7.3.2：
Introduction to Range Concatenation Grammars / 7.4：
Definition of RCG / 8.1.1：
Relations to Other Formalisms / 8.1.2：
Literal Movement Grammars / 8.2.1：
CFG, TAG and MCFG / 8.2.2：
Parsing Range Concatenation Grammars / 8.3：
Basic RCG Parsing / 9.1：
CYK Parsing with Passive Items / 9.1.1：
Non-directional Top-Down Parsing / 9.1.2：
Directional Top-Down Parsing / 9.1.3：
Optimizations / 9.1.4：
Parsing with Constraint Propagation / 9.2：
Range Constraints / 9.2.1：
CYK Parsing with Active Items / 9.2.2：
Earley Parsing / 9.2.3：
Embedded Push-Down Automata / 9.3：
Definition of EPDA / 10.1.1：
EPDA and TAG / 10.1.2：
Bottom-Up Embedded Push-Down Automata / 10.1.3：
?-Order EPDA / 10.1.4：
Two-Stack Automata / 10.2：
General Definition / 10.2.1：
Strongly-Driven Two-Stack Automata / 10.2.2：
Thread Automata / 10.3：
Idea / 10.3.1：
General Definition of TA / 10.3.2：
Constructing a TA for a TAG / 10.3.3：
Constructing a TA for an Ordered SRCG / 10.3.4：
Hierarchy of Grammar Formalisms / 10.4：
List of Acronyms / Appendix B：
Solutions
References
Index
Introduction / 1：
Formal Grammars and Natural Languages / 1.1：
Parsing Beyond CFGs / 1.2：
8.

図書
図書
8. Essential quantum optics : from quantum measurements to black holes (: hbk ; : pbk)
Ulf Leonhardt
出版情報: Cambridge : Cambridge University Press, 2010  xii, 277 p. ; 26 cm
所蔵情報: loading…
目次情報: 続きを見る
Acknowledgements
Introduction / 1：
A note to the reader / 1.1：
Quantum theory / 1.2：
Axioms / 1.2.1：
Quantum statistics / 1.2.2：
Schrödinger and Heisenberg pictures / 1.2.3：
On the questions and homework problems / 1.3：
Further reading / 1.4：
Quantum field theory of light / 2：
Light in media / 2.1：
Maxwell's equations / 2.1.1：
Quantum commutator / 2.1.2：
Light modes / 2.2：
Modes and their scalar product / 2.2.1：
Bose commutation relations / 2.2.2：
Interference / 2.2.3：
Monochromatic modes / 2.2.4：
Zero-point energy and Casimir force / 2.3：
An attractive cavity / 2.3.1：
Reflections / 2.3.2：
Questions / 2.4：
Homework problem / 2.5：
Simple quantum states of light / 2.6：
The electromagnetic oscillator / 3.1：
Single-mode states / 3.2：
Quadrature states / 3.2.1：
Fock states / 3.2.2：
Thermal states / 3.2.3：
Coherent states / 3.2.4：
Uncertainty and squeezing / 3.3：
Quasiprobability distributions / 3.4：
Wigner representation / 4.1：
Wigner's formula / 4.1.1：
Basic properties / 4.1.2：
Examples / 4.1.3：
Other quasiprobability distributions / 4.2：
Q function / 4.2.1：
P function / 4.2.2：
s-parameterized quasiprobability distributions / 4.2.3：
Simple optical instruments / 4.3：
Beam splitter / 5.1：
Heisenberg picture / 5.1.1：
Schrödinger picture / 5.1.2：
Fock representation and wave-particle dualism / 5.1.3：
Detection / 5.2：
Photodetector / 5.2.1：
Balanced homodyne detection / 5.2.2：
Quantum tomography / 5.2.3：
Simultaneous measurement of conjugate variables / 5.2.4：
Irrevesible processes / 5.3：
Lindblad's theorem / 6.1：
Irreversibility / 6.1.1：
Reversible dynamics / 6.1.2：
Irreversible dynamics / 6.1.3：
Loss and gain / 6.2：
Absorption and amplification / 6.2.1：
Absorber / 6.2.2：
Amplifier / 6.2.3：
Eavesdropper / 6.2.4：
Continuous quantum measurements / 6.3：
Entanglement / 6.4：
Parametric amplifier / 7.1：
Einstein-Podolski-Rosen state / 7.1.1：
Quantum teleportation / 7.1.4：
Polarization correlations / 7.2：
Singlet state / 7.2.1：
Polarization / 7.2.2：
Bell's theorem / 7.2.3：
Horizons / 7.3：
Minkowski space / 8.1：
Locality and relativity / 8.1.1：
Space-time geometry / 8.1.2：
Light / 8.1.3：
Accelerated observers / 8.2：
Rindler coordinates / 8.2.1：
Accelerated modes / 8.2.2：
Unruh effect / 8.2.3：
Moving media / 8.3：
Motivation / 8.3.1：
Trans-Planckian problem / 8.3.2：
Light in moving media / 8.3.3：
Geometry of light / 8.3.4：
Hawking radiation / 8.3.5：
Stress of the quantum vacuum / 8.4：
State reconstruction in quantum mechanics / Appendix B：
References
Index
Irreversible processes
Appendixes
Acknowledgements
Introduction / 1：
A note to the reader / 1.1：
9.

電子ブック
ＥＢ
9. Computational Lithography
Xu Ma, Gonzalo R. Arce
出版情報: Wiley Online Library - AutoHoldings Books , John Wiley & Sons, Incorporated, 2010
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
Acronyms
Introduction / 1：
Optical Lithography / 1.1：
Optical Lithography and Integrated Circuits / 1.1.1：
Brief History of Optical Lithography Systems / 1.1.2：
Rayleigh's Resolution / 1.2：
Resist Processes and Characteristics / 1.3：
Techniques in Computational Lithography / 1.4：
Optical Proximity Correction / 1.4.1：
Phase-Shifting Masks / 1.4.2：
Off-Axis Illumination / 1.4.3：
Second-Generation RETs / 1.4.4：
Outline / 1.5：
Optical Lithography Systems / 2：
Partially Coherent Imaging Systems / 2.1：
Abbe's Model / 2.1.1：
Hopkins Diffraction Model / 2.1.2：
Coherent and Incoherent Imaging Systems / 2.1.3：
Approximation Models / 2.2：
Fourier Series Expansion Model / 2.2.1：
Singular Value Decomposition Model / 2.2.2：
Average Coherent Approximation Model / 2.2.3：
Discussion and Comparison / 2.2.4：
Summary / 2.3：
Rule-Based Resolution Enhancement Techniques / 3：
RET Types / 3.1：
Rule-Based RETs / 3.1.1：
Model-Based RETs / 3.1.2：
Hybrid RETs / 3.1.3：
Rule-Based OPC / 3.2：
Catastrophic OPC / 3.2.1：
One-Dimensional OPC / 3.2.2：
Line-Shortening Reduction OPC / 3.2.3：
Two-Dimensional OPC / 3.2.4：
Rule-Based PSM / 3.3：
Dark-Field Application / 3.3.1：
Light-Field Application / 3.3.2：
Rule-Based OAI / 3.4：
Fundamentals of Optimization / 3.5：
Definition and Classification / 4.1：
Definitions in the Optimization Problem / 4.1.1：
Classification of Optimization Problems / 4.1.2：
Unconstrained Optimization / 4.2：
Solution of Unconstrained Optimization Problem / 4.2.1：
Unconstrained Optimization Algorithms / 4.2.2：
Computational Lithography with Coherent Illumination / 4.3：
Problem Formulation / 5.1：
OPC Optimization / 5.2：
OPC Design Algorithm / 5.2.1：
Simulations / 5.2.2：
Two-Phase PSM Optimization / 5.3：
Two-Phase PSM Design Algorithm / 5.3.1：
Generalized PSM Optimization / 5.3.2：
Generalized PSM Design Algorithm / 5.4.1：
Resist Modeling Effects / 5.4.2：
Regularization Framework / 5.6：
Discretization Penalty / 6.1：
Discretization Penalty for OPC Optimization / 6.1.1：
Discretization Penalty for Two-Phase PSM Optimization / 6.1.2：
Discretization Penalty for Generalized PSM Optimization / 6.1.3：
Complexity Penalty / 6.2：
Total Variation Penalty / 6.2.1：
Global Wavelet Penalty / 6.2.2：
Localized Wavelet Penalty / 6.2.3：
Computational Lithography with Partially Coherent Illumination / 6.3：
OPC Design Algorithm Using the Fourier Series Expansion Model / 7.1：
Simulations Using the Fourier Series Expansion Model / 7.1.2：
OPC Design Algorithm Using the Average Coherent Approximation Model / 7.1.3：
Simulations Using the Average Coherent Approximation Model / 7.1.4：
PSM Optimization / 7.1.5：
PSM Design Algorithm Using the Singular Value Decomposition Model / 7.2.1：
Discretization Regularization for PSM Design Algorithm / 7.2.2：
Other RET Optimization Techniques / 7.2.3：
Double-Patterning Method / 8.1：
Post-Processing Based on 2D DCT / 8.2：
Photoresist Tone Reversing Method / 8.3：
Source and Mask Optimization / 8.4：
Lithography Preliminaries / 9.1：
Topological Constraint / 9.2：
Source-Mask Optimization Algorithm / 9.3：
Coherent Thick-Mask Optimization / 9.4：
Kirchhoff Boundary Conditions / 10.1：
Boundary Layer Model / 10.2：
Boundary Layer Model in Coherent Imaging Systems / 10.2.1：
Boundary Layer Model in Partially Coherent Imaging Systems / 10.2.2：
OPC Optimization Algorithm Based on BL Model Under Coherent Illumination / 10.3：
PSM Optimization Algorithm Based on BL Model Under Coherent Illumination / 10.4.3：
Conclusions and New Directions of Computational Lithography / 10.5.3：
Conclusion / 11.1：
New Directions of Computational Lithography / 11.2：
OPC Optimization for the Next-Generation Lithography Technologies / 11.2.1：
Initialization Approach for the Inverse Lithography Optimization / 11.2.2：
Double Patterning and Double Exposure Methods in Partially Coherent Imaging System / 11.2.3：
OPC and PSM Optimizations for Inverse Lithography Based on Rigorous Mask Models in Partially Coherent Imaging System / 11.2.4：
Simultaneous Source and Mask Optimization for Inverse Lithography Based on Rigorous Mask Models / 11.2.5：
Investigation of Factors Influencing the Complexity of the OPC and PSM Optimization Algorithms / 11.2.6：
Formula Derivation in Chapter 5 / Appendix A：
Manhattan Geometry / Appendix B：
Formula Derivation in Chapter 6 / Appendix C：
Formula Derivation in Chapter 7 / Appendix D：
Formula Derivation in Chapter 8 / Appendix E：
Formula Derivation in Chapter 9 / Appendix F：
Formula Derivation in Chapter 10 / Appendix G：
Software Guide / Appendix H：
References
Index
Preface
Acknowledgments
Acronyms
10.

電子ブック
ＥＢ
10. Automata for Branching and Layered Temporal Structures
Gabriele Puppis, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
Words and Languages / 2.1.1：
Periodicity of Words / 2.1.2：
Word Automata / 2.1.3：
Time Granularities / 2.1.4：
The String-Based and Automaton-Based Approaches / 2.2：
The Granspec Formalism / 2.2.1：
From Granspecs to Single-String Automata / 2.2.2：
Counters and Multiple Transitions / 2.2.3：
The Logical Counterpart of RCSSA / 2.2.4：
Compact and Tractable Representations / 2.3：
Nested Repetitions of Words / 2.3.1：
Algorithms on NCSSA / 2.3.2：
Optimizing Representations / 2.3.3：
Reasoning on Sets of Granularities / 2.4：
Languages of Ultimately Periodic Words / 2.4.1：
Ultimately Periodic Automata / 2.4.2：
Algorithms on UPA / 2.4.3：
Applications to Time Granularity / 2.4.4：
Discussion / 2.5：
Tree Automata and Logics / 3：
Graphs and Trees / 3.1：
Tree Automata / 3.1.2：
Monadic Second-Order Logic / 3.1.3：
The Model Checking Problem / 3.1.4：
The Contraction Method for Tree Automata / 3.2：
Features and Types / 3.2.1：
Types and the Acceptance Problem / 3.2.2：
From Trees to Their Retractions / 3.2.3：
An Example / 3.2.4：
Tree Transformations / 3.3：
Tree Recolorings / 3.3.1：
Tree Substitutions / 3.3.2：
Tree Transducers / 3.3.3：
Inverse Substitutions / 3.3.4：
A Summary / 3.3.5：
The Class of Reducible Trees / 3.4：
Compositional Properties of Types / 3.4.1：
Closure Properties / 3.4.2：
Effectiveness of the Contraction Method / 3.5：
Reducible Trees and the Caucal Hierarchy / 3.5.1：
Two-Way Alternating Tree Automata / 3.5.2：
Morphic Trees / 3.5.3：
Layered Temporal Structures / 3.5.4：
Summary / 3.6：
Technical Proofs / A：
Proofs of Theorem 5 and Theorem 6 / A.l：
Proof of Theorem 8 / A.2：
Proof of Proposition 34 / A.3：
References
Notation
Index
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
11.

電子ブック
ＥＢ
11. Automata for Branching and Layered Temporal Structures
Gabriele Puppis, Takeo Kanade
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
Words and Languages / 2.1.1：
Periodicity of Words / 2.1.2：
Word Automata / 2.1.3：
Time Granularities / 2.1.4：
The String-Based and Automaton-Based Approaches / 2.2：
The Granspec Formalism / 2.2.1：
From Granspecs to Single-String Automata / 2.2.2：
Counters and Multiple Transitions / 2.2.3：
The Logical Counterpart of RCSSA / 2.2.4：
Compact and Tractable Representations / 2.3：
Nested Repetitions of Words / 2.3.1：
Algorithms on NCSSA / 2.3.2：
Optimizing Representations / 2.3.3：
Reasoning on Sets of Granularities / 2.4：
Languages of Ultimately Periodic Words / 2.4.1：
Ultimately Periodic Automata / 2.4.2：
Algorithms on UPA / 2.4.3：
Applications to Time Granularity / 2.4.4：
Discussion / 2.5：
Tree Automata and Logics / 3：
Graphs and Trees / 3.1：
Tree Automata / 3.1.2：
Monadic Second-Order Logic / 3.1.3：
The Model Checking Problem / 3.1.4：
The Contraction Method for Tree Automata / 3.2：
Features and Types / 3.2.1：
Types and the Acceptance Problem / 3.2.2：
From Trees to Their Retractions / 3.2.3：
An Example / 3.2.4：
Tree Transformations / 3.3：
Tree Recolorings / 3.3.1：
Tree Substitutions / 3.3.2：
Tree Transducers / 3.3.3：
Inverse Substitutions / 3.3.4：
A Summary / 3.3.5：
The Class of Reducible Trees / 3.4：
Compositional Properties of Types / 3.4.1：
Closure Properties / 3.4.2：
Effectiveness of the Contraction Method / 3.5：
Reducible Trees and the Caucal Hierarchy / 3.5.1：
Two-Way Alternating Tree Automata / 3.5.2：
Morphic Trees / 3.5.3：
Layered Temporal Structures / 3.5.4：
Summary / 3.6：
Technical Proofs / A：
Proofs of Theorem 5 and Theorem 6 / A.l：
Proof of Theorem 8 / A.2：
Proof of Proposition 34 / A.3：
References
Notation
Index
Introduction / 1：
Word Automata and Time Granularities / 2：
Background Knowledge / 2.1：
12.

電子ブック
ＥＢ
12. IEEE Std 1516.2-2010 (Revision of IEEE Std 1516.2-2000)
出版情報: IEEE Electronic Library (IEL) Standards , IEEE, 2010
所蔵情報: loading…
13.

電子ブック
ＥＢ
13. Discrete Calculus
Leo J. Grady, Jonathan R. Polimeni
出版情報: Springer eBooks Computer Science , Springer London, 2010
所蔵情報: loading…
目次情報: 続きを見る
Discrete Calculus: History and Future / 1：
Discrete Calculus / 1.1：
Origins of Vector Calculus / 1.1.1：
Origins of Discrete Calculus / 1.1.2：
Discrete vs. Discretized / 1.1.3：
Complex Networks / 1.2：
Content Extraction / 1.3：
Organization of the Book / 1.4：
Intended Audience / 1.5：
A Brief Review of Discrete Calculus / Part I：
Introduction to Discrete Calculus / 2：
Topology and the Fundamental Theorem of Calculus / 2.1：
Differential Forms / 2.2：
Exterior Algebra and Antisymmetric Tensors / 2.2.1：
Differentiation and Integration of Forms / 2.2.2：
The Hodge Star Operator / 2.2.3：
Differential Forms and Linear Pairings / 2.2.4：
Discrete Domains / 2.3：
Discrete Forms and the Coboundary Operator / 2.3.2：
Primal and Dual Complexes / 2.3.3：
The Role of a Metric: the Metric Tensor, the Discrete Hodge Star Operator, and Weighted Complexes / 2.3.4：
The Dual Coboundary Operator / 2.3.5：
The Discrete Laplace-de Rham Operator / 2.3.6：
Structure of Discrete Physical Laws / 2.4：
Examples of Discrete Calculus / 2.5：
Fundamental Theorem of Calculus and the Generalized Stokes' Theorem / 2.5.1：
The Helmholtz Decomposition / 2.5.2：
Matrix Representation of Discrete Calculus Identities / 2.5.3：
Elliptic Equations / 2.5.4：
Diffusion / 2.5.5：
Advection / 2.5.6：
Concluding Remarks / 2.6：
Circuit Theory and Other Discrete Physical Models / 3：
Circuit Laws / 3.1：
Steady-State Solutions / 3.2：
Dependent Sources / 3.2.1：
Energy Minimization / 3.2.2：
AC Circuits / 3.3：
Connections Between Circuit Theory and Other Discrete Domains / 3.4：
Spring Networks / 3.4.1：
Random Walks / 3.4.2：
Gaussian Markov Random Fields / 3.4.3：
Tree Counting / 3.4.4：
Linear Algebra Applied to Circuit Analysis / 3.4.5：
Conclusion / 3.5：
Applications of Discrete Calculus / Part II：
Building a Weighted Complex from Data / 4：
Determining Edges and Cycles / 4.1：
Defining an Edge Set / 4.1.1：
Defining a Cycle Set / 4.1.2：
Deriving Edge Weights / 4.2：
Edge Weights to Reflect Geometry / 4.2.1：
Edge Weights to Penalize Data Outliers / 4.2.2：
Edge Weights to Cause Repulsion / 4.2.3：
Edge Weights to Represent Joint Statistics / 4.2.4：
Deducing Edge Weights from Observations / 4.2.5：
Obtaining Higher-Order Weights to Penalize Outliers / 4.3：
Weights Beyond Flows / 4.3.1：
Metrics Defined on a Complex / 4.4：
Filtering on Graphs / 4.5：
Fourier and Spectral Filtering on a Graph / 5.1：
Graphs that Are Not Shift-Invariant / 5.1.1：
The Origins of High Frequency Noise / 5.1.2：
Energy Minimization Methods for Filtering / 5.2：
The Basic Energy Minimization Model / 5.2.1：
Extended Basic Energy Model / 5.2.2：
The Total Variation Model / 5.2.3：
Filtering with Implicit Discontinuities / 5.3：
Filtering with Explicit, but Unknown, Discontinuities / 5.4：
Filtering by Gradient Manipulation / 5.5：
Nonlocal Filtering / 5.6：
Filtering Vectors and Flows / 5.7：
Translating Scalar Filtering to Flow Filtering / 5.7.1：
Filtering Higher-Order Cochains / 5.8：
Applications / 5.9：
Image Processing / 5.9.1：
Three-Dimensional Mesh Filtering / 5.9.2：
Filtering Data on a Surface / 5.9.3：
Geospatial Data / 5.9.4：
Filtering Flow Data-Brain Connectivity / 5.9.5：
Clustering and Segmentation / 5.10：
Targeted Clustering / 6.1：
Primal Targeted Clustering / 6.1.1：
Dual Targeted Clustering / 6.1.2：
Untargeted Clustering / 6.2：
Primal Untargeted Clustering / 6.2.1：
Dual Untargeted Clustering / 6.2.2：
Semi-targeted Clustering / 6.3：
The k-Means Model / 6.3.1：
Clustering Higher-Order Cells / 6.4：
Clustering Edges / 6.4.1：
Image Segmentation / 6.5：
Social Networks / 6.5.2：
Machine Learning and Classification / 6.5.3：
Gene Expression / 6.5.4：
Manifold Learning and Ranking / 6.6：
Manifold Learning / 7.1：
Multidimensional Scaling and Isomap / 7.1.1：
Laplacian Eigenmaps and Spectral Coordinates / 7.1.2：
Locality Preserving Projections / 7.1.3：
Relationship to Clustering / 7.1.4：
Manifold Learning on Edge Data / 7.1.5：
Ranking / 7.2：
PageRank / 7.2.1：
HITS / 7.2.2：
Shape Characterization / 7.3：
Point Correspondence / 7.3.2：
Web Search / 7.3.3：
Judicial Citation / 7.3.4：
Measuring Networks / 7.4：
Measures of Graph Connectedness / 8.1：
Graph Distance / 8.1.1：
Node Centrality / 8.1.2：
Distance-Based Properties of a Graph / 8.1.3：
Measures of Graph Separability / 8.2：
Clustering Measures / 8.2.1：
Small-World Graphs / 8.2.2：
Topological Measures / 8.3：
Geometric Measures / 8.4：
Discrete Gaussian Curvature / 8.4.1：
Discrete Mean Curvature / 8.4.2：
Chemical Graph Theory / 8.5：
Representation and Storage of a Graph and Complex / 8.6：
General Representations for Complexes / A.1：
Cells List Representation / A.1.1：
Operator Representation / A.1.2：
Representation of 1-Complexes / A.2：
Neighbor List Representation / A.2.1：
Optimization / Appendix B：
Real-Valued Optimization / B.1：
Unconstrained Direct Solutions / B.1.1：
Constrained Direct Solutions / B.1.2：
Descent Methods / B.1.3：
Nonconvex Energy Optimization over Real Variables / B.1.4：
Integer-Valued Optimization / B.2：
Linear Objective Functions / B.2.1：
Quadratic Objective Functions / B.2.2：
General Integer Programming Problems / B.2.3：
The Hodge Theorem: A Generalization of the Helmholtz Decomposition / Appendix C：
The Helmholtz Theorem / C.1：
The Hodge Decomposition / C.2：
Summary of Notation
References
Index
Color Plates
Discrete Calculus: History and Future / 1：
Discrete Calculus / 1.1：
Origins of Vector Calculus / 1.1.1：
14.

電子ブック
ＥＢ
14. Discrete Calculus
Leo J. Grady, Jonathan R. Polimeni
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2010
所蔵情報: loading…
目次情報: 続きを見る
Discrete Calculus: History and Future / 1：
Discrete Calculus / 1.1：
Origins of Vector Calculus / 1.1.1：
Origins of Discrete Calculus / 1.1.2：
Discrete vs. Discretized / 1.1.3：
Complex Networks / 1.2：
Content Extraction / 1.3：
Organization of the Book / 1.4：
Intended Audience / 1.5：
A Brief Review of Discrete Calculus / Part I：
Introduction to Discrete Calculus / 2：
Topology and the Fundamental Theorem of Calculus / 2.1：
Differential Forms / 2.2：
Exterior Algebra and Antisymmetric Tensors / 2.2.1：
Differentiation and Integration of Forms / 2.2.2：
The Hodge Star Operator / 2.2.3：
Differential Forms and Linear Pairings / 2.2.4：
Discrete Domains / 2.3：
Discrete Forms and the Coboundary Operator / 2.3.2：
Primal and Dual Complexes / 2.3.3：
The Role of a Metric: the Metric Tensor, the Discrete Hodge Star Operator, and Weighted Complexes / 2.3.4：
The Dual Coboundary Operator / 2.3.5：
The Discrete Laplace-de Rham Operator / 2.3.6：
Structure of Discrete Physical Laws / 2.4：
Examples of Discrete Calculus / 2.5：
Fundamental Theorem of Calculus and the Generalized Stokes' Theorem / 2.5.1：
The Helmholtz Decomposition / 2.5.2：
Matrix Representation of Discrete Calculus Identities / 2.5.3：
Elliptic Equations / 2.5.4：
Diffusion / 2.5.5：
Advection / 2.5.6：
Concluding Remarks / 2.6：
Circuit Theory and Other Discrete Physical Models / 3：
Circuit Laws / 3.1：
Steady-State Solutions / 3.2：
Dependent Sources / 3.2.1：
Energy Minimization / 3.2.2：
AC Circuits / 3.3：
Connections Between Circuit Theory and Other Discrete Domains / 3.4：
Spring Networks / 3.4.1：
Random Walks / 3.4.2：
Gaussian Markov Random Fields / 3.4.3：
Tree Counting / 3.4.4：
Linear Algebra Applied to Circuit Analysis / 3.4.5：
Conclusion / 3.5：
Applications of Discrete Calculus / Part II：
Building a Weighted Complex from Data / 4：
Determining Edges and Cycles / 4.1：
Defining an Edge Set / 4.1.1：
Defining a Cycle Set / 4.1.2：
Deriving Edge Weights / 4.2：
Edge Weights to Reflect Geometry / 4.2.1：
Edge Weights to Penalize Data Outliers / 4.2.2：
Edge Weights to Cause Repulsion / 4.2.3：
Edge Weights to Represent Joint Statistics / 4.2.4：
Deducing Edge Weights from Observations / 4.2.5：
Obtaining Higher-Order Weights to Penalize Outliers / 4.3：
Weights Beyond Flows / 4.3.1：
Metrics Defined on a Complex / 4.4：
Filtering on Graphs / 4.5：
Fourier and Spectral Filtering on a Graph / 5.1：
Graphs that Are Not Shift-Invariant / 5.1.1：
The Origins of High Frequency Noise / 5.1.2：
Energy Minimization Methods for Filtering / 5.2：
The Basic Energy Minimization Model / 5.2.1：
Extended Basic Energy Model / 5.2.2：
The Total Variation Model / 5.2.3：
Filtering with Implicit Discontinuities / 5.3：
Filtering with Explicit, but Unknown, Discontinuities / 5.4：
Filtering by Gradient Manipulation / 5.5：
Nonlocal Filtering / 5.6：
Filtering Vectors and Flows / 5.7：
Translating Scalar Filtering to Flow Filtering / 5.7.1：
Filtering Higher-Order Cochains / 5.8：
Applications / 5.9：
Image Processing / 5.9.1：
Three-Dimensional Mesh Filtering / 5.9.2：
Filtering Data on a Surface / 5.9.3：
Geospatial Data / 5.9.4：
Filtering Flow Data-Brain Connectivity / 5.9.5：
Clustering and Segmentation / 5.10：
Targeted Clustering / 6.1：
Primal Targeted Clustering / 6.1.1：
Dual Targeted Clustering / 6.1.2：
Untargeted Clustering / 6.2：
Primal Untargeted Clustering / 6.2.1：
Dual Untargeted Clustering / 6.2.2：
Semi-targeted Clustering / 6.3：
The k-Means Model / 6.3.1：
Clustering Higher-Order Cells / 6.4：
Clustering Edges / 6.4.1：
Image Segmentation / 6.5：
Social Networks / 6.5.2：
Machine Learning and Classification / 6.5.3：
Gene Expression / 6.5.4：
Manifold Learning and Ranking / 6.6：
Manifold Learning / 7.1：
Multidimensional Scaling and Isomap / 7.1.1：
Laplacian Eigenmaps and Spectral Coordinates / 7.1.2：
Locality Preserving Projections / 7.1.3：
Relationship to Clustering / 7.1.4：
Manifold Learning on Edge Data / 7.1.5：
Ranking / 7.2：
PageRank / 7.2.1：
HITS / 7.2.2：
Shape Characterization / 7.3：
Point Correspondence / 7.3.2：
Web Search / 7.3.3：
Judicial Citation / 7.3.4：
Measuring Networks / 7.4：
Measures of Graph Connectedness / 8.1：
Graph Distance / 8.1.1：
Node Centrality / 8.1.2：
Distance-Based Properties of a Graph / 8.1.3：
Measures of Graph Separability / 8.2：
Clustering Measures / 8.2.1：
Small-World Graphs / 8.2.2：
Topological Measures / 8.3：
Geometric Measures / 8.4：
Discrete Gaussian Curvature / 8.4.1：
Discrete Mean Curvature / 8.4.2：
Chemical Graph Theory / 8.5：
Representation and Storage of a Graph and Complex / 8.6：
General Representations for Complexes / A.1：
Cells List Representation / A.1.1：
Operator Representation / A.1.2：
Representation of 1-Complexes / A.2：
Neighbor List Representation / A.2.1：
Optimization / Appendix B：
Real-Valued Optimization / B.1：
Unconstrained Direct Solutions / B.1.1：
Constrained Direct Solutions / B.1.2：
Descent Methods / B.1.3：
Nonconvex Energy Optimization over Real Variables / B.1.4：
Integer-Valued Optimization / B.2：
Linear Objective Functions / B.2.1：
Quadratic Objective Functions / B.2.2：
General Integer Programming Problems / B.2.3：
The Hodge Theorem: A Generalization of the Helmholtz Decomposition / Appendix C：
The Helmholtz Theorem / C.1：
The Hodge Decomposition / C.2：
Summary of Notation
References
Index
Color Plates
Discrete Calculus: History and Future / 1：
Discrete Calculus / 1.1：
Origins of Vector Calculus / 1.1.1：
15.

図書
図書
15. Molecular genetics of bacteria. 5th ed (: hbk ; : pbk)
Jeremy W. Dale and Simon F. Park
出版情報: Chichester, West Sussex : Wiley-Blackwell, 2010  xii, 388 p. ; 25 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Nucleic Acid Structure and Function / 1：
Structure of nucleic acids / 1.1：
DNA / 1.1.1：
RNA / 1.1.2：
Hydrophobic interactions / 1.1.3：
Different forms of the double helix / 1.1.4：
Supercoiling / 1.1.5：
Denaturation and hybridization / 1.1.6：
Orientation of nucleic acid strands / 1.1.7：
Replication of DNA / 1.2：
Unwinding and rewinding / 1.2.1：
Fidelity of replication; proofreading / 1.2.2：
Chromosome replication and cell division / 1.3：
DNA repair / 1.4：
Mismatch repair / 1.4.1：
Excision repair / 1.4.2：
Recombination (post-replication) repair / 1.4.3：
SOS repair / 1.4.4：
Gene expression / 1.5：
Transcription / 1.5.1：
Translation / 1.5.2：
Post-translational events / 1.5.3：
Gene organization / 1.6：
Mutation and Variation / 2：
Variation and evolution / 2.1：
Fluctuation test / 2.1.1：
Replica plating / 2.1.2：
Directed mutation in bacteria? / 2.1.3：
Types of mutation / 2.2：
Point mutations / 2.2.1：
Conditional mutants / 2.2.2：
Variation due to larger-scale DNA alterations / 2.2.3：
Extrachromosomal agents and horizontal gene transfer / 2.2.4：
Recombination / 2.3：
A model of the general (homologous) recombination process / 2.3.1：
Enzymes involved in recombination / 2.3.2：
Phenotypes / 2.4：
Restoration of phenotype / 2.4.1：
Mechanisms of mutation / 2.5：
Spontaneous mutation / 2.5.1：
Chemical mutagens / 2.5.2：
Ultraviolet irradiation / 2.5.3：
Isolation and identification of mutants / 2.6：
Mutation and selection / 2.6.1：
Isolation of other mutants / 2.6.2：
Molecular methods / 2.6.4：
Regulation of Gene Expression / 3：
Gene copy number / 3.1：
Transcriptional control / 3.2：
Promoters / 3.2.1：
Terminators, attenuators and anti-terminators / 3.2.2：
Induction and repression: regulatory proteins / 3.2.3：
Two-component regulatory systems / 3.2.4：
Global regulatory systems / 3.2.5：
Quorum sensing / 3.2.6：
Translational control / 3.3：
Ribosome binding / 3.3.1：
Codon usage / 3.3.2：
Stringent response / 3.3.3：
Regulatory RNA / 3.3.4：
Phase variation / 3.4：
Genetics of Bacteriophages / 4：
Bacteriophage structure / 4.1：
Single-strand DNA bacteriophages / 4.2：
ΦX174 / 4.2.1：
M13 / 4.2.2：
RNA-containing phages: MS2 / 4.3：
Double-stranded DNA phages / 4.4：
Bacteriophage T4 / 4.4.1：
Bacteriophage λ / 4.4.2：
Lytic and lysogenic regulation of bacteriophage λ / 4.4.3：
Restriction and modification / 4.5：
Bacterial resistance to phage attack / 4.6：
Complementation and recombination / 4.7：
Why are bacteriophages important? / 4.8：
Phage typing / 4.8.1：
Phage therapy / 4.8.2：
Phage display / 4.8.3：
Phages in the natural environment / 4.8.4：
Bacterial virulence and phage conversion / 4.8.5：
Plasmids / 5：
Some bacterial characteristics are determined by plasmids / 5.1：
Antibiotic resistance / 5.1.1：
Colicins and bacteriocins / 5.1.2：
Virulence determinants / 5.1.3：
Plasmids in plant-associated bacteria / 5.1.4：
Metabolic activities / 5.1.5：
Molecular properties of plasmids / 5.2：
Plasmid replication and control / 5.2.1：
Partitioning / 5.2.2：
Host range / 5.2.3：
Plasmid incompatibility / 5.2.4：
Plasmid stability / 5.3：
Plasmid integrity / 5.3.1：
Differential growth rate / 5.3.2：
Associating a plasmid with a phenotype / 5.4：
Gene Transfer / 6：
Transformation / 6.1：
Conjugation / 6.2：
Mechanism of conjugation / 6.2.1：
The F plasmid / 6.2.2：
Conjugation in other bacteria / 6.2.3：
Transduction / 6.3：
Specialized transduction / 6.3.1：
Consequences of recombination / 6.4：
Site-specific and non-homologous (illegitimate) recombination / 6.4.2：
Mosaic genes and chromosome plasticity / 6.5：
Genomic Plasticity: Movable Genes and Phase Variation / 7：
Insertion sequences / 7.1：
Structure of insertion sequences / 7.1.1：
Occurrence of insertion sequences / 7.1.2：
Transposons / 7.2：
Structure of transposons / 7.2.1：
Integrons / 7.2.2：
ISCR elements / 7.2.3：
Mechanisms of transposition / 7.3：
Replicative transposition / 7.3.1：
Non-replicative (conservative) transposition / 7.3.2：
Regulation of transposition / 7.3.3：
Activation of genes by transposable elements / 7.3.4：
Mu: A transposable bacteriophage / 7.3.5：
Conjugative transposons / 7.3.6：
Variation mediated by simple DNA inversion / 7.4：
Variation mediated by nested DNA inversion / 7.4.2：
Antigenic variation in the gonococcus / 7.4.3：
Phase variation by slipped-strand mispairing / 7.4.4：
Phase variation mediated by differential DNA methylation / 7.4.5：
Clustered regularly interspersed short palindromic repeats / 7.5：
Genetic Modification: Exploiting the Potential of Bacteria / 8：
Strain development / 8.1：
Generation of variation / 8.1.1：
Selection of desired variants / 8.1.2：
Overproduction of primary metabolites / 8.2：
Simple pathways / 8.2.1：
Branched pathways / 8.2.2：
Overproduction of secondary metabolites / 8.3：
Gene cloning / 8.4：
Cutting and joining DNA / 8.4.1：
Plasmid vectors / 8.4.2：
Bacteriophage λ vectors / 8.4.3：
Cloning larger fragments / 8.4.4：
Bacteriophage M13 vectors / 8.4.5：
Gene libraries / 8.5：
Construction of genomic libraries / 8.5.1：
Screening a gene library / 8.5.2：
Cloning PCR products / 8.5.3：
Construction of a cDNA library / 8.5.4：
Products from cloned genes / 8.6：
Expression vectors / 8.6.1：
Making new genes / 8.6.2：
Other bacterial hosts / 8.6.3：
Novel vaccines / 8.6.4：
Other uses of gene technology / 8.7：
Genetic Methods for Investigating Bacteria / 9：
Metabolic pathways / 9.1：
Complementation / 9.1.1：
Cross-feeding / 9.1.2：
Microbial physiology / 9.2：
Reporter genes / 9.2.1：
Chromatin immunoprecipitation / 9.2.2：
Cell division / 9.2.3：
Motility and chemotaxis / 9.2.4：
Cell differentiation / 9.2.5：
Bacterial virulence / 9.3：
Wide-range mechanisms of bacterial pathogenesis / 9.3.1：
Detection of virulence genes / 9.3.2：
Specific mutagenesis / 9.4：
Gene replacement / 9.4.1：
Antisense RNA / 9.4.2：
Taxonomy, evolution and epidemiology / 9.5：
Molecular taxonomy / 9.5.1：
GC content / 9.5.2：
16 S rRNA / 9.5.3：
Denaturing-gradient gel electrophoresis and temperature-gradient gel electrophoresis / 9.5.4：
Diagnostic use of PCR / 9.5.5：
Molecular epidemiology / 9.5.6：
Gene Mapping to Genomics and Beyond / 10：
Gene mapping / 10.1：
Conjugational analysis / 10.1.1：
Restriction mapping and pulsed-field gel electrophoresis / 10.1.2：
DNA sequence determination / 10.2：
Sanger sequencing / 10.2.1：
Dye terminator sequencing / 10.2.2：
Pyrosequencing / 10.2.3：
Massively parallel sequencing / 10.2.4：
Genome sequencing / 10.3：
Genome-sequencing strategies / 10.3.1：
Relating sequence to function / 10.3.2：
Metagenomics / 10.3.3：
Comparative genomics / 10.4：
Microarrays / 10.4.1：
Analysis of gene expression / 10.5：
Transcriptional analysis / 10.5.1：
Translational analysis / 10.5.2：
Metabolomics / 10.6：
Systems biology and synthetic genomics / 10.7：
Systems biology / 10.7.1：
Synthetic genomics / 10.7.2：
Conclusion / 10.8：
Further Reading / Appendix A：
Abbreviations Used / Appendix B：
Glossary / Appendix C：
Enzymes and other Proteins / Appendix D：
Genes / Appendix E：
Standard Genetic Code / Appendix F：
Bacterial Species / Appendix G：
Index
?X174
Bacteriophage ?
Lytic and lysogenic regulation of bacteriophage ?
Bacteriophage ? vectors
Preface
Nucleic Acid Structure and Function / 1：
Structure of nucleic acids / 1.1：
16.

電子ブック
ＥＢ
16. Efficient Secure Two-Party Protocols
Carmit Hazay, Yehuda Lindell
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Definitions / Part I：
Introduction / 1：
Secure Multiparty Computation - Background / 1.1：
The GMW Protocol for Secure Computation / 1.2：
A Roadmap to the Book / 1.3：
Part I - Introduction and Definitions / 1.3.1：
Part II - General Constructions / 1.3.2：
Part III - Specific Constructions / 1.3.3：
Definitions / 2：
Preliminaries / 2.1：
Security in the Presence of Semi-honest Adversaries / 2.2：
Security in the Presence of Malicious Adversaries / 2.3：
The Definition / 2.3.1：
Extension to Reactive Functionalities / 2.3.2：
Malicious Versus Semi-honest Adversaries / 2.3.3：
Security in the Presence of Covert Adversaries / 2.4：
Motivation / 2.4.1：
The Actual Definition / 2.4.2：
Cheating and Aborting / 2.4.3：
Relations Between Security Models / 2.4.4：
Restricted Versus General Functionalities / 2.5：
Deterministic Functionalities / 2.5.1：
Single-Output Functionalities / 2.5.2：
Non-reactive Functionalities / 2.5.3：
Non-simulation-Based Definitions / 2.6：
Privacy Only / 2.6.1：
One-Sided Simulatability / 2.6.2：
Sequential Composition - Simulation-Based Definitions / 2.7：
General Constructions / Part II：
Semi-honest Adversaries / 3：
An Overview of the Protocol / 3.1：
Tools / 3.2：
"Special" Private-Key Encryption / 3.2.1：
Oblivious Transfer / 3.2.2：
The Garbled-Circuit Construction / 3.3：
Yao's Two-Party Protocol / 3.4：
Efficiency of the Protocol / 3.5：
Malicious Adversaries / 4：
High-Level Protocol Description / 4.1：
Checks for Correctness and Consistency / 4.1.2：
The Protocol / 4.2：
Proof of Security / 4.3：
Efficient Implementation of the Different Primitives / 4.3.1：
Suggestions for Further Reading / 4.5：
Covert Adversaries / 5：
The Basic Protocol / 5.1：
Extensions / 5.1.2：
Secure Two-Party Computation / 5.2：
Overview of the Protocol / 5.2.1：
The Protocol for Two-Party Computation / 5.2.2：
Non-halting Detection Accuracy / 5.2.3：
Specific Constructions / 5.3：
Sigma Protocols and Efficient Zero-Knowledge / 6：
An Example / 6.1：
Definitions and Properties / 6.2：
Proofs of Knowledge / 6.3：
Proving Compound Statements / 6.4：
Zero-Knowledge from ?-Protocols / 6.5：
The Basic Zero-Knowledge Construction / 6.5.1：
Zero-Knowledge Proofs of Knowledge / 6.5.2：
The ZKPOK Ideal Functionality / 6.5.3：
Efficient Commitment Schemes from ?-Protocols / 6.6：
Summary / 6.7：
Oblivious Transfer and Applications / 7：
Notational Conventions for Protocols / 7.1：
Oblivious Transfer - Privacy Only / 7.2：
A Protocol Based on the DDH Assumption / 7.2.1：
A Protocol from Homomorphic Encryption / 7.2.2：
Oblivious Transfer - One-Sided Simulation / 7.3：
Oblivious Transfer - Full Simulation / 7.4：
1-out-of-2 Oblivious Transfer / 7.4.1：
Batch Oblivious Transfer / 7.4.2：
Another Oblivious Transfer - Full Simulation / 7.5：
Secure Pseudorandom Function Evaluation / 7.6：
Pseudorandom Function - Privacy Only / 7.6.1：
Pseudorandom Function - Full Simulation / 7.6.2：
Covert and One-Sided Simulation / 7.6.3：
Batch Pseudorandom Function Evaluation / 7.6.4：
The kth-Ranked Element / 8：
Background / 8.1：
A Protocol for Finding the Median / 8.1.1：
Reducing the kth-Ranked Element to the Median / 8.1.2：
Computing the Median - Semi-honest / 8.2：
Computing the Median - Malicious / 8.3：
The Reactive Greater-Than Functionality / 8.3.1：
Search Problems / 8.3.2：
Secure Database Search / 9.1：
Securely Realizing Basic Database Search / 9.2.1：
Securely Realizing Pull Database Search / 9.2.2：
Secure Document Search / 9.2.3：
Standard Smartcard Functionality and Security / 9.4：
Secure Text Search (Pattern Matching) / 9.4.2：
Indexed Implementation for Naor-Reingold / 9.5.1：
The Protocol for Secure Text Search / 9.5.2：
References
Index
Introduction and Definitions / Part I：
Introduction / 1：
Secure Multiparty Computation - Background / 1.1：
17.

電子ブック
ＥＢ
17. Efficient Secure Two-Party Protocols
Carmit Hazay, Yehuda Lindell
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Definitions / Part I：
Introduction / 1：
Secure Multiparty Computation - Background / 1.1：
The GMW Protocol for Secure Computation / 1.2：
A Roadmap to the Book / 1.3：
Part I - Introduction and Definitions / 1.3.1：
Part II - General Constructions / 1.3.2：
Part III - Specific Constructions / 1.3.3：
Definitions / 2：
Preliminaries / 2.1：
Security in the Presence of Semi-honest Adversaries / 2.2：
Security in the Presence of Malicious Adversaries / 2.3：
The Definition / 2.3.1：
Extension to Reactive Functionalities / 2.3.2：
Malicious Versus Semi-honest Adversaries / 2.3.3：
Security in the Presence of Covert Adversaries / 2.4：
Motivation / 2.4.1：
The Actual Definition / 2.4.2：
Cheating and Aborting / 2.4.3：
Relations Between Security Models / 2.4.4：
Restricted Versus General Functionalities / 2.5：
Deterministic Functionalities / 2.5.1：
Single-Output Functionalities / 2.5.2：
Non-reactive Functionalities / 2.5.3：
Non-simulation-Based Definitions / 2.6：
Privacy Only / 2.6.1：
One-Sided Simulatability / 2.6.2：
Sequential Composition - Simulation-Based Definitions / 2.7：
General Constructions / Part II：
Semi-honest Adversaries / 3：
An Overview of the Protocol / 3.1：
Tools / 3.2：
"Special" Private-Key Encryption / 3.2.1：
Oblivious Transfer / 3.2.2：
The Garbled-Circuit Construction / 3.3：
Yao's Two-Party Protocol / 3.4：
Efficiency of the Protocol / 3.5：
Malicious Adversaries / 4：
High-Level Protocol Description / 4.1：
Checks for Correctness and Consistency / 4.1.2：
The Protocol / 4.2：
Proof of Security / 4.3：
Efficient Implementation of the Different Primitives / 4.3.1：
Suggestions for Further Reading / 4.5：
Covert Adversaries / 5：
The Basic Protocol / 5.1：
Extensions / 5.1.2：
Secure Two-Party Computation / 5.2：
Overview of the Protocol / 5.2.1：
The Protocol for Two-Party Computation / 5.2.2：
Non-halting Detection Accuracy / 5.2.3：
Specific Constructions / 5.3：
Sigma Protocols and Efficient Zero-Knowledge / 6：
An Example / 6.1：
Definitions and Properties / 6.2：
Proofs of Knowledge / 6.3：
Proving Compound Statements / 6.4：
Zero-Knowledge from ?-Protocols / 6.5：
The Basic Zero-Knowledge Construction / 6.5.1：
Zero-Knowledge Proofs of Knowledge / 6.5.2：
The ZKPOK Ideal Functionality / 6.5.3：
Efficient Commitment Schemes from ?-Protocols / 6.6：
Summary / 6.7：
Oblivious Transfer and Applications / 7：
Notational Conventions for Protocols / 7.1：
Oblivious Transfer - Privacy Only / 7.2：
A Protocol Based on the DDH Assumption / 7.2.1：
A Protocol from Homomorphic Encryption / 7.2.2：
Oblivious Transfer - One-Sided Simulation / 7.3：
Oblivious Transfer - Full Simulation / 7.4：
1-out-of-2 Oblivious Transfer / 7.4.1：
Batch Oblivious Transfer / 7.4.2：
Another Oblivious Transfer - Full Simulation / 7.5：
Secure Pseudorandom Function Evaluation / 7.6：
Pseudorandom Function - Privacy Only / 7.6.1：
Pseudorandom Function - Full Simulation / 7.6.2：
Covert and One-Sided Simulation / 7.6.3：
Batch Pseudorandom Function Evaluation / 7.6.4：
The kth-Ranked Element / 8：
Background / 8.1：
A Protocol for Finding the Median / 8.1.1：
Reducing the kth-Ranked Element to the Median / 8.1.2：
Computing the Median - Semi-honest / 8.2：
Computing the Median - Malicious / 8.3：
The Reactive Greater-Than Functionality / 8.3.1：
Search Problems / 8.3.2：
Secure Database Search / 9.1：
Securely Realizing Basic Database Search / 9.2.1：
Securely Realizing Pull Database Search / 9.2.2：
Secure Document Search / 9.2.3：
Standard Smartcard Functionality and Security / 9.4：
Secure Text Search (Pattern Matching) / 9.4.2：
Indexed Implementation for Naor-Reingold / 9.5.1：
The Protocol for Secure Text Search / 9.5.2：
References
Index
Introduction and Definitions / Part I：
Introduction / 1：
Secure Multiparty Computation - Background / 1.1：
18.

図書
図書
18. Biodata mining and visualization : novel approaches (: hbk.)
Ilkka Havukkala
出版情報: Singapore : World Scientific, c2010  xv, 307 p. ; 24 cm
シリーズ名: Science, engineering, and biology informatics ; v. 5
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgement
About the Author
Introduction to Modern Molecular Biology / 1：
Cells store large amounts of information in DNA / 1.1：
Cells process complex information / 1.2：
Cellular life is chemically complex and somewhat stochastic / 1.3：
Challenges in analyzing complex biodata / 1.4：
References
Biodata Explosion / 2：
Primary sequence and structure data / 2.1：
DNA sequence databases / 2.1.1：
Protein sequence databases / 2.1.2：
Molecular structure databases / 2.1.3：
Secondary annotation data / 2.2：
Motif annotations / 2.2.1：
Gene function annotations / 2.2.2：
Genomic annotations / 2.2.3：
Inter-species phylogeny and gene family annotations / 2.2.4：
Experimental and personalized data / 2.3：
DNA expression profiles / 2.3.1：
Proteomics data and degradomics / 2.3.2：
Protein expression profiles, 2D gel and protein interaction data / 2.3.3：
Metabolomics and metabolic pathway databases / 2.3.4：
Personalized data / 2.3.5：
Semantic and processed text data / 2.4：
Ontologies / 2.4.1：
Text-mined annotation data / 2.4.2：
Integrated and federated databases / 2.5：
Local Pattern Discovery and Comparing Genes and Proteins / 3：
DNA/RNA motif discovery / 3.1：
Single motif models: MEME, AlignAce etc. / 3.1.1：
Multiple motif models: LOGOS and MotifRegressor / 3.1.2：
Informative k-mers approach / 3.1.3：
Protein motif discovery / 3.2：
InterProScan and other traditional methods / 3.2.1：
Protein k-mer and other string based methods / 3.2.2：
Genetic algorithms, particle swarms and ant colonies / 3.3：
Genetic algorithms / 3.3.1：
Particle swarm optimization / 3.3.2：
Ant colony optimization / 3.3.3：
Sequence visualization / 3.4：
Global Pattern Discovery and Comparing Genomes / 4：
Alignment-based methods / 4.1：
Pairwise genome-wide search algorithms: LAGAN, AVID etc. / 4.1.1：
Multiple alignment methods: MLAGAN, MAVID, MULTIZ etc. / 4.1.2：
Dotplots / 4.1.3：
Visualization of genome comparisons / 4.1.4：
Global motif maps / 4.1.5：
Alignmentless methods / 4.2：
K-mer based methods / 4.2.1：
Average common substring and compressibility based methods / 4.2.2：
2D portraits of genomes / 4.2.3：
Genome scale non-sequence data analysis / 4.3：
DNA physical structure based methods / 4.3.1：
Secondary structure based comparisons / 4.3.2：
Molecule Structure Based Searching and Comparison / 5：
Molecule structures as graphs or strings / 5.1：
3D to 1D transformations / 5.1.1：
Graph matching methods / 5.1.2：
Graph visualization / 5.1.3：
Graph grammars / 5.1.4：
RNA structure comparison and prediction / 5.2：
Image comparison based methods / 5.3：
Gabor filter based methods / 5.3.1：
Image symmetry set based methods / 5.3.2：
Other graph topology based methods / 5.3.3：
Function Annotation and Ontology Based Searching and Classification / 6：
Annotation ontologies / 6.1：
Gene Ontology based mining / 6.2：
Sequence similarity based function prediction / 6.3：
Cellular location prediction / 6.4：
New integrative methods: Utilizing networks / 6.5：
Text mining bioliterature for automated annotation / 6.6：
Natural language processing (NLP) / 6.6.1：
Semantic profiling / 6.6.2：
Matrix factorization methods / 6.6.3：
New Methods for Genomics Data: SVM and Others / 7：
SVM kernels / 7.1：
SVM trees / 7.2：
Methods for microarray data / 7.3：
Gene selection algorithms / 7.3.1：
Gene selection by consistency methods / 7.3.2：
Genome as a time series and discrete wavelet transform / 7.4：
Parameterless clustering for gene expression / 7.5：
Transductive confidence machines, conformal predictors and ROC isometrics / 7.6：
Text compression methods for biodata analysis / 7.7：
Integration of Multimodal Data: Toward Systems Biology / 8：
Comparative genome annotation systems / 8.1：
Phylogenetics methods / 8.2：
Network inference from interaction and coexpression data / 8.3：
Bayesian inference, association rule mining and Petri nets / 8.4：
Future Challenges / 9：
Network analysis methods / 9.1：
Unsupervised and supervised clustering / 9.2：
Neural networks and evolutionary methods / 9.3：
Semantic web and ontologization of biology / 9.4：
Biological data fusion / 9.5：
Rise of the GPU machines / 9.6：
Index
Preface
Acknowledgement
About the Author
19.

図書
図書
19. Green chemistry : an introductory text. 2nd ed (: hbk.)
Mike Lancaster
出版情報: Cambridge : Royal Society of Chemistry, c2010  xv, 328 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Principles and Concepts of Green Chemistry / Chapter 1：
Introduction / 1.1：
Sustainable Development and Green Chemistry / 1.2：
Green Engineering / 1.2.1：
Atom Economy / 1.3：
Atom Economic Reactions / 1.4：
Rearrangement Reactions / 1.4.1：
Addition Reactions / 1.4.2：
Atom Un-economic Reactions / 1.5：
Substitution Reactions / 1.5.1：
Elimination Reactions / 1.5.2：
Wittig Reactions / 1.5.3：
Reducing Toxicity / 1.6：
Measuring Toxicity / 1.6.1：
Review Questions
Further Reading
Waste: Production, Problems, and Prevention / Chapter 2：
Some Problems Caused by Waste / 2.1：
Sources of Waste from the Chemical Industry / 2.3：
Cost of Waste / 2.4：
Waste Minimization Techniques / 2.5：
The Team Approach to Waste Minimization / 2.5.1：
Process Design for Waste Minimization / 2.5.2：
Minimizing Waste from Existing Processes / 2.5.3：
On-site Waste Treatment / 2.6：
Physical Treatment / 2.6.1：
Chemical Treatment / 2.6.2：
Biotreatment Plants / 2.6.3：
Design for Degradation / 2.7：
Degradation and Surfactants / 2.7.1：
DDT / 2.7.2：
Polymers / 2.7.3：
Some Rules for Degradation / 2.7.4：
Polymer Recycling / 2.8：
Separation and Sorting / 2.8.1：
Incineration / 2.8.2：
Mechanical Recycling / 2.8.3：
Chemical Recycling to Monomers / 2.8.4：
Measuring and Controlling Environmental Performance / Chapter 3：
The Importance of Measurement / 3.1：
Lactic Acid Production / 3.1.1：
Safer Gasoline / 3.1.2：
Introduction to Life Cycle Assessment / 3.2：
Four Stages of LCA / 3.2.1：
Carbon Footprinting / 3.2.2：
Green Process Metrics / 3.3：
Environmental Management Systems (EMS) / 3.4：
ISO 14001 / 3.4.1：
The European Eco-Management and Audit Scheme (EMAS) / 3.4.2：
Eco-Labels / 3.5：
Legislation / 3.6：
Integrated Pollution Prevention and Control (IPPC) / 3.6.1：
Reach / 3.6.2：
Catalysis and Green Chemistry / Chapter 4：
Introduction to Catalysis / 4.1：
Comparison of Catalyst Types / 4.1.1：
Heterogeneous Catalysts / 4.2：
Basics of Heterogeneous Catalysis / 4.2.1：
Zeolites and the Bulk Chemical Industry / 4.2.2：
Heterogeneous Catalysis in the Fine Chemical and Pharmaceutical Industries / 4.2.3：
Catalytic Converters / 4.2.4：
Homogeneous Catalysts / 4.3：
Transition Metal Catalysts with Phosphine or Carbonyl Ligands / 4.3.1：
Greener Lewis Acids / 4.3.2：
Asymmetric Catalysis / 4.3.3：
Phase Transfer Catalysis / 4.4：
Hazard Reduction / 4.4.1：
C-C Bond Formation / 4.4.2：
Oxidation using Hydrogen Peroxide / 4.4.3：
Biocatalysis / 4.5：
Photocatalysis / 4.6：
Conclusions / 4.7：
Organic Solvents: Environmentally Benign Solutions / Chapter 5：
Organic Solvents and Volatile Organic Compounds / 5.1：
Solvent-free Systems / 5.2：
Supercritical Fluids / 5.3：
Supercritical Carbon Dioxide (scCO2) / 5.3.1：
Supercritical Water / 5.3.2：
Water as a Reaction Solvent / 5.4：
Water Based Coatings / 5.4.1：
Ionic Liquids / 5.5：
Ionic Liquids as Catalysts / 5.5.1：
Ionic Liquids as Solvents / 5.5.2：
Fluorous Biphase Solvents / 5.6：
Comparing Greenness of Solvents / 5.7：
Renewable Resources / 5.8：
Biomass as a Renewable Resource / 6.1：
Energy / 6.2：
Fossil Fuels / 6.2.1：
Energy from Biomass / 6.2.2：
Solar Power / 6.2.3：
Other Forms of Renewable Energy / 6.2.4：
Fuel Cells / 6.2.5：
Chemicals from Renewable Feedstocks / 6.3：
Chemicals from Fatly Acids / 6.3.1：
Polymers from Renewable Resources / 6.3.2：
Some Other Chemicals from Natural Resources / 6.3.3：
Alternative Economies / 6.4：
Syngas Economy / 6.4.1：
Hydrogen Economy / 6.4.2：
Biorefinery / 6.5：
Emerging Greener Technologies and Alternative Energy Sources / 6.6：
Design for Energy Efficiency / 7.1：
Photochemical Reactions / 7.2：
Advantages of and Challenges Faced by Photochemical Processes / 7.2.1：
Examples of Photochemical Reactions / 7.2.2：
Chemistry using Microwaves / 7.3：
Microwave Heating / 7.3.1：
Microwave-assisted Reactions / 7.3.2：
Sonochemistry / 7.4：
Sonochemistry and Green Chemistry / 7.4.1：
Electrochemical Synthesis / 7.5：
Examples of Electrochemical Synthesis / 7.5.1：
Designing Greener Processes / 7.6：
Conventional Reactors / 8.1：
Batch Reactors / 8.2.1：
Continuous Reactors / 8.2.2：
Inherently Safer Design / 8.3：
Minimization / 8.3.1：
Simplification / 8.3.2：
Substitution / 8.3.3：
Moderation / 8.3.4：
Limitation / 8.3.5：
Process Intensification / 8.4：
Some PI Equipment / 8.4.1：
Some Example of Intensified Processes / 8.4.2：
In-process Monitoring / 8.5：
Near-infrared Spectroscopy / 8.5.1：
Process Safety / 8.6：
Industrial Case Studies / Chapter 9：
Methyl Methacrylate / 9.1：
Greening of Acetic Acid Manufacture / 9.3：
EPDM Rubbers / 9.4：
Vitamin C / 9.5：
Leather Manufacture / 9.6：
Tanning / 9.6.1：
Fatliquoring / 9.6.2：
Dyeing to be Green / 9.7：
Some Manufacturing Improvements / 9.7.1：
Dye Application / 9.7.2：
Polyethylene / 9.8：
Radical Process / 9.8.1：
Ziegler-Natta Catalysis / 9.8.2：
Metallocene Catalysis / 9.8.3：
Post Metallocene Catalysts / 9.8.4：
Eco-friendly Pesticides / 9.9：
Insecticides / 9.9.1：
Epichlorohydrin / 9.10：
The Future's Green: An Integrated Approach to a Greener Chemical Industry / Chapter 10：
Society and Sustainability / 10.1：
Barriers & Drivers / 10.2：
Role of Legislation / 10.3：
Green Chemical Supply Strategies / 10.4：
Greener Energy / 10.5：
Subject Index / 10.6：
Principles and Concepts of Green Chemistry / Chapter 1：
Introduction / 1.1：
Sustainable Development and Green Chemistry / 1.2：
20.

図書
図書
20. Three-dimensional flows
Vítor Araújo, Maria José Pacifico
出版情報: Berlin : Springer, c2010  xix, 358 p. ; 24 cm
シリーズ名: Ergebnisse der Mathematik und ihrer Grenzgebiete ; 3. Folge . A series of modern surveys in mathematics ; v. 53
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Organization of the Text / 1.1：
Preliminary Definitions and Results / 2：
Fundamental Notions and Definitions / 2.1：
Critical Elements, Non-wandering Points, Stable and Unstable Sets / 2.1.1：
Limit Sets, Transitivity, Attractors and Repellers / 2.1.2：
Hyperbolic Critical Elements / 2.1.3：
Topological Equivalence, Structural Stability / 2.1.4：
Low Dimensional Flow Versus Chaotic Behavior / 2.2：
One-Dimensional Flows / 2.2.1：
Two-Dimensional Flows / 2.2.2：
Three Dimensional Chaotic Attractors / 2.2.3：
Hyperbolic Flows / 2.3：
Hyperbolic Sets and Singularities / 2.3.1：
Examples of Hyperbolic Sets and Axiom A Flows / 2.3.2：
Expansiveness and Sensitive Dependence on Initial Conditions / 2.4：
Chaotic Systems / 2.4.1：
Expansive Systems / 2.4.2：
Basic Tools / 2.5：
The Tubular Flow Theorem / 2.5.1：
Transverse Sections and the Poincaré Return Map / 2.5.2：
The Hartman-Grobman Theorem on Local Linearization / 2.5.3：
The (Strong) Inclination Lemma (or ?-Lemma) / 2.5.4：
Homoclinic Classes, Transitiveness and Denseness of Periodic Orbits / 2.5.5：
The Closing Lemma / 2.5.6：
The Connecting Lemma / 2.5.7：
The Ergodic Closing Lemma / 2.5.8：
A Perturbation Lemma for Flows / 2.5.9：
Generic Vector Fields and Lyapunov Stability / 2.5.10：
The Linear Poincaré Flow / 2.6：
Hyperbolic Splitting for the Linear Poincaré Flow / 2.6.1：
Dominated Splitting for the Linear Poincaré Flow / 2.6.2：
Incompressible Flows, Hyperbolicity and Dominated Splitting / 2.6.3：
Ergodic Theory / 2.7：
Physical or SRB Measures / 2.7.1：
Gibbs Measures Versus SRB Measures / 2.7.2：
Stability Conjectures / 2.8：
Singular Cycles and Robust Singular Attractors / 3：
Singular Horseshoe / 3.1：
A Singular Horseshoe Map / 3.1.1：
A Singular Cycle with a Singular Horseshoe First Return Map / 3.1.2：
The Singular Horseshoe Is a Partially Hyperbolic Set with Volume Expanding Central Direction / 3.1.3：
Bifurcations of Saddle-Connections / 3.2：
Saddle-Connection with Real Eigenvalues / 3.2.1：
Inclination Flip and Orbit Flip / 3.2.2：
Saddle-Focus Connection and Shil'nikov Bifurcations / 3.2.3：
Lorenz Attractor and Geometric Models / 3.3：
Properties of the Lorenz System of Equations / 3.3.1：
The Geometric Model / 3.3.2：
The Geometric Lorenz Attractor Is a Partially Hyperbolic Set with Volume Expanding Central Direction / 3.3.3：
Existence and Robustness of Invariant Stable Foliation / 3.3.4：
Robustness of the Geometric Lorenz Attractors / 3.3.5：
The Geometric Lorenz Attractor Is a Homoclinic Class / 3.3.6：
Robustness on the Whole Ambient Space / 4：
No Equilibria Surrounded by Regular Orbits with Dominated Splitting / 4.1：
Homogeneous Flows and Dominated Splitting / 4.2：
Dominated Splitting over the Periodic Orbits / 4.2.1：
Dominated Splitting over Regular Orbits from the Periodic Ones / 4.2.2：
Bounded Angles on the Splitting over Hyperbolic Periodic Orbits / 4.2.3：
Dominated Splitting for the Linear Poincaré Flow Along Regular Orbits / 4.2.4：
Uniform Hyperbolicity for the Linear Poincaré Flow / 4.3：
Subadditive Functions of the Orbits of a Flow and Exponential Growth / 4.3.1：
Uniform Hyperbolicity for the Linear Poincaré Flow on the Whole Manifold / 4.3.2：
Robust Transitivity and Singular-Hyperbolicity / 5：
Definitions and Statement of Results / 5.1：
Equilibria of Robust Attractors Are Lorenz-Like / 5.1.1：
Robust Attractors Are Singular-Hyperbolic / 5.1.2：
Brief Sketch of the Proofs / 5.1.3：
Higher Dimensional Analogues / 5.2：
Singular-Attractor with Arbitrary Number of Expanding Directions / 5.2.1：
The Notion of Sectionally Expanding Sets / 5.2.2：
Homogeneous Flows and Sectionally Expanding Attractors / 5.2.3：
Proof of Sufficient Conditions to Obtain Attractors / 5.3：
Robust Singular Transitivity Implies Attractors or Repellers / 5.3.2：
Attractors and Singular-Hyperbolicity / 5.4：
Uniformly Dominated Splitting over the Periodic Orbits / 5.4.1：
Dominated Splitting over a Robust Attractor / 5.4.2：
Flow-Boxes Near Equilibria / 5.4.3：
Uniformly Bounded Angle Between Stable and Center-Unstable Directions on Periodic Orbits / 5.4.5：
Singular-Hyperbolicity and Robustness / 6：
Cross-Sections and Poincaré Maps / 6.1：
Stable Foliations on Cross-Sections / 6.1.1：
Hyperbolicity of Poincaré Maps / 6.1.2：
Adapted Cross-Sections / 6.1.3：
Global Poincaré Return Map / 6.1.4：
The One-Dimensional Piecewise Expanding Map / 6.1.5：
Denseness of Periodic Orbits and the One-Dimensional Map / 6.1.6：
Crossing Strips and the One-Dimensional Map / 6.1.7：
Homoclinic Class / 6.2：
Sufficient Conditions for Robustness / 6.3：
Denseness of Periodic Orbits and Transitivity with a Unique Singularity / 6.3.1：
Unstable Manifolds of Periodic Orbits Inside Singular-Hyperbolic Attractors / 6.3.2：
Expansiveness and Physical Measure / 7：
Statements of the Results and Overview of the Arguments / 7.1：
Robust Sensitiveness / 7.1.1：
Existence and Uniqueness of a Physical Measure / 7.1.2：
Expansiveness / 7.2：
Proof of Expansiveness / 7.2.1：
Infinitely Many Coupled Returns / 7.2.2：
Semi-global Poincaré Map / 7.2.3：
A Tube-Like Domain Without Singularities / 7.2.4：
Every Orbit Leaves the Tube / 7.2.5：
Expansiveness of the Poincaré Map / 7.2.6：
Singular-Hyperbolicity and Chaotic Behavior / 7.2.8：
Non-uniform Hyperbolicity / 7.3：
The Starting Point / 7.3.1：
The Hölder Property of the Projection / 7.3.2：
Integrability of the Global Return Time / 7.3.3：
Suspending Invariant Measures / 7.3.4：
Physical Measure for the Global Poincaré Map / 7.3.5：
Suspension Flow from the Poincaré Map / 7.3.6：
Physical Measures for the Suspension / 7.3.7：
Physical Measure for the Flow / 7.3.8：
Hyperbolicity of the Physical Measure / 7.3.9：
Absolutely Continuous Disintegration of the Physical Measure / 7.3.10：
Constructing the Disintegration / 7.3.11：
The Support Covers the Whole Attractor / 7.3.12：
Singular-Hyperbolicity and Volume / 8：
Dominated Decomposition and Zero Volume / 8.1：
Dominated Splitting and Regularity / 8.1.1：
Uniform Hyperbolicity / 8.1.2：
Singular-Hyperbolicity and Zero Volume / 8.2：
Positive Volume Versus Transitive Anosov Flows / 8.2.1：
Extension to Sectionally Expanding Attractors in Higher Dimensions / 8.2.3：
Global Dynamics of Generic 3-Flows / 9：
Spectral Decomposition / 9.1：
Some Consequences of the Generic Dichotomy / 9.2：
Generic 3-Flows, Lyapunov Stability and Singular-Hyperbolicity / 9.2.2：
Conservative Tubular Flow Theorem / 9.3：
Realizable Linear Flows / 9.3.2：
Blending Oseledets Directions Along an Orbit Segment / 9.3.3：
Lowering the Norm: Local Procedure / 9.3.4：
Lowering the Norm: Global Procedure / 9.3.5：
Proof of the Dichotomy with Singularities (Theorem 9.4) / 9.3.6：
Related Results and Recent Developments / 10：
More on Singular-Hyperbolicity / 10.1：
Topological Dynamics / 10.1.1：
Attractors that Resemble the Lorenz Attractor / 10.1.2：
Unfolding of Singular Cycles / 10.1.3：
Contracting Lorenz-Like Attractors / 10.1.4：
Dimension Theory, Ergodic and Statistical Properties / 10.1.5：
Large Deviations for the Lorenz Flow / 10.2.1：
Central Limit Theorem for the Lorenz Flow / 10.2.2：
Decay of Correlations / 10.2.3：
Decay of Correlations for the Return Map and Quantitative Recurrence on the Geometric Lorenz Flow / 10.2.4：
Non-mixing Flows and Slow Decay of Correlations / 10.2.5：
Decay of Correlations for Flows / 10.2 6：
Thermodynamical Formalism / 10.2.7：
Generic Conservative Flows in Dimension 3 / 10.3：
Lyapunov Stability on Generic Vector Fields / Appendix A：
Robustness of Dominated Decomposition / Appendix B：
References
Index
Introduction / 1：
Organization of the Text / 1.1：
Preliminary Definitions and Results / 2：
21.

電子ブック
ＥＢ
21. Codes and Turbo Codes
Berrou, Claude Berrou
出版情報: Springer eBooks Computer Science , Springer Paris, 2010
所蔵情報: loading…
目次情報: 続きを見る
Contributors
Foreword
Introduction / 1：
Digital messages / 1.1：
A first code / 1.2：
Hard input decoding and soft input decoding / 1.3：
Hard output decoding and soft output decoding / 1.4：
The performance measure / 1.5：
What is a good code? / 1.6：
Families of codes / 1.7：
Digital communications / 2：
Digital Modulations / 2.1：
Linear Memoryless Modulations / 2.1.1：
Memoryless modulation with M states (M-FSK) / 2.1.3：
Modulations with memory by continuous phase frequency shift keying (CPFSK) / 2.1.4：
Structure and performance of the optimal receiver on a Gaussian channel / 2.2：
Structure of the coherent receiver / 2.2.1：
Performance of the coherent receiver / 2.2.2：
Transmission on a band-limited channel / 2.3：
Intersymbol interference / 2.3.1：
Condition of absence of ISI: Nyquist criterion / 2.3.3：
Expression of the error probability in presence of Nyquist filtering / 2.3.4：
Transmission on fading channels / 2.4：
Characterization of a fading channel / 2.4.1：
Transmission on non-frequency-selective slow-fading channels / 2.4.2：
Theoretical limits / 3：
Information theory / 3.1：
Transmission channel / 3.1.1：
An example: the binary symmetric channel / 3.1.2：
Overview of the fundamental coding theorem / 3.1.3：
Geometrical interpretation / 3.1.4：
Random coding / 3.1.5：
Theoretical limits to performance / 3.2：
Binary input and real output channel / 3.2.1：
Capacity of a transmission channel / 3.2.2：
Practical limits to performance / 3.3：
Gaussian binary input channel / 3.3.1：
Gaussian continuous input channel / 3.3.2：
Some examples of limits / 3.3.3：
Minimum distances required / 3.4：
MHD required with 4-PSK modulation / 3.4.1：
MHD required with 8-PSK modulation / 3.4.2：
MHD required with 16-QAM modulation / 3.4.3：
Bibliography
Block codes / 4：
Block codes with binary symbols / 4.1：
Generator matrix of a binary block code / 4.1.1：
Dual code and parity check matrix / 4.1.2：
Minimum distance / 4.1.3：
Extended codes and shortened codes / 4.1.4：
Product codes / 4.1.5：
Examples of binary block codes / 4.1.6：
Cyclic codes / 4.1.7：
Block codes with non-binary symbols / 4.2：
Reed-Solomon codes / 4.2.1：
Implementing the encoder / 4.2.2：
Decoding and performance of codes with binary symbols / 4.3：
Error detection / 4.3.1：
Error correction / 4.3.2：
Decoding and performance of codes with non-binary symbols / 4.4：
Hard input decoding of Reed-Solomon codes / 4.4.1：
Peterson's direct method / 4.4.2：
Iterative method / 4.4.3：
Hard input decoding performance of Reed-Solomon codes / 4.4.4：
Appendix: Notions about Galois fields and minimal polynomials
Convolutional codes and their decoding / 5：
History / 5.1：
Representations of convolutional codes / 5.2：
Generic representation of a convolutional encoder / 5.2.1：
Polynomial representation / 5.2.2：
Tree of a code / 5.2.3：
Trellis of a code / 5.2.4：
State machine of a code / 5.2.5：
Code distances and performance / 5.3：
Choosing a good code / 5.3.1：
RTZ sequences / 5.3.2：
Transfer function and distance spectrum / 5.3.3：
Performance / 5.3.4：
Decoding convolutional codes / 5.4：
Model of the transmission chain and notations / 5.4.1：
The Viterbi algorithm / 5.4.2：
The Maximum A Posteriori algorithm or MAP algorithm / 5.4.3：
Convolutional block codes / 5.5：
Trellis termination / 5.5.1：
Puncturing / 5.5.2：
Concatenated codes / 6：
Parallel concatenation and serial concatenation / 6.1：
Parallel concatenation and LDPC codes / 6.2：
Permutations / 6.3：
Turbo crossword / 6.4：
Convolutional turbo codes / 7：
The history of turbo codes / 7.1：
Multiple concatenation of RSC codes / 7.2：
Turbo codes / 7.3：
Termination of constituent codes / 7.3.1：
The permutation function / 7.3.2：
Decoding turbo codes / 7.4：
Turbo decoding / 7.4.1：
SISO decoding and extrinsic information / 7.4.2：
Practical considerations / 7.4.3：
m-binary turbo codes / 7.5：
m-binary RSC encoders / 7.5.1：
Analysis tools / 7.5.2：
Theoretical performance / 7.6.1：
Asymptotic behaviour / 7.6.2：
Convergence / 7.6.3：
Turbo product codes / 8：
Hard input decoding of product codes / 8.1：
Row-column decoding / 8.3.1：
The Reddy-Robinson algorithm / 8.3.2：
Soft input decoding of product codes / 8.4：
The Chase algorithm with weighted input / 8.4.1：
Performance of the Chase-Pyndiah algorithm / 8.4.2：
The Fang-Battail algorithm / 8.4.3：
The Hartmann-Nazarov algorithm / 8.4.4：
Other soft input decoding algorithms / 8.4.5：
Implantation of the Chase-Pyndiah algorithm / 8.5：
LDPC codes / 9：
Principle of LDPC codes / 9.1：
Parity check code / 9.1.1：
Definition of an LDPC code / 9.1.2：
Encoding / 9.1.3：
Decoding LDPC codes / 9.1.4：
Random construction of LDPC codes / 9.1.5：
Some geometrical constructions of LDPC codes / 9.1.6：
Architecture for decoding LDPC codes for the Gaussian channel / 9.2：
Analysis of the complexity / 9.2.1：
Architecture of a generic node processor (GNP) / 9.2.2：
Generic architecture for message propagation / 9.2.3：
Combining parameters of the architecture / 9.2.4：
Example of synthesis of an LDPC decoder architecture / 9.2.5：
Sub-optimal decoding algorithm / 9.2.6：
Influence of quantization / 9.2.7：
State of the art of published LDPC decoder architectures / 9.2.8：
Turbo codes and large spectral efficiency transmissions / 10：
Turbo trellis coded modulation (TTCM) / 10.1：
Pragmatic turbo coded modulation / 10.2：
The turbo principle applied to equalization and detection / 11：
Turbo equalization / 11.1：
Multipath channels and intersymbol interference / 11.1.1：
The equalization function / 11.1.2：
Combining equalization and decoding / 11.1.3：
Principle of turbo equalization / 11.1.4：
MAP turbo equalization / 11.1.5：
MMSE turbo equalization / 11.1.6：
Multi-user turbo detection and its application to CDMA systems / 11.2：
Introduction and some notations / 11.2.1：
Multi-user detection / 11.2.2：
Turbo CDMA / 11.2.3：
Conclusions / 11.3：
Index
Contributors
Foreword
Introduction / 1：
22.

電子ブック
ＥＢ
22. Grid Resource Management
Mumtaz Siddiqui, Thomas Fahringer, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Overview / Part I：
Introduction / 1：
Motivation / 1.1：
Collaboration Instead of Isolation / 1.1.1：
Discovery and Selection / 1.1.2：
Lifecycle Management / 1.1.3：
On-Demand Provisioning / 1.1.4：
Role of Planning / 1.1.5：
Service-Level Agreement / 1.1.6：
Optimized Resource Allocation / 1.1.7：
Synthesis and Aggregation / 1.1.8：
Grid Enablement / 1.1.9：
Portability / 1.1.10：
Semantics in the Grid / 1.1.11：
Research Goals / 1.2：
Automatic Resource Brokerage / 1.2.1：
Dynamic Registration and Automatic Deployment / 1.2.2：
Advance Reservation and Co-allocation / 1.2.3：
Capacity Management and Planning / 1.2.4：
Standard Adaptation / 1.2.5：
Organization / 1.3：
Part 1: Overview / 1.3.1：
Part 2: Brokerage / 1.3.2：
Part 3: Planning / 1.3.3：
Part 4: Semantics / 1.3.4：
Part 5: Conclusion / 1.3.5：
Appendices / 1.3.6：
Model / 2：
The Grid / 2.1：
Characteristics / 2.1.1：
Layers / 2.1.2：
Architectures / 2.1.3：
Resources and Applications / 2.2：
Activities / 2.2.1：
Workflows / 2.2.2：
Grid Node / 2.2.3：
Grid Operating Environment / 2.3：
Open Grid Services Architecture / 2.3.1：
WS-Resource Framework / 2.3.2：
Globus Toolkit / 2.3.3：
Askalon: A Grid Runtime Environment / 2.4：
Workflow Composition / 2.4.1：
Resource Management / 2.4.2：
Workflow Scheduling / 2.4.3：
Workflow Enactment / 2.4.4：
Performance Prediction and Analysis / 2.4.5：
Semantic Grid / 2.5：
Ontology / 2.5.1：
Web Ontology Language / 2.5.2：
Ontology Query Language / 2.5.3：
Provisioning / 2.6：
Allocation Negotiation / 2.6.2：
Capacity Planning / 2.6.3：
Manageability Models / 2.6.4：
Summary / 2.7：
Brokerage / Part II：
Grid Resource Management and Brokerage System / 3：
Architectural Overview / 3.1：
Node Management / 3.2.1：
Activity Management / 3.2.3：
Allocation Management / 3.2.4：
System Model / 3.3：
Resource Discoverer / 3.3.1：
Candidate Set Generator / 3.3.2：
Resource Synthesizer / 3.3.3：
Resource Selector / 3.3.4：
A Steady System with Proportional Distribution / 3.3.5：
Implementation / 3.4：
Customization / 3.4.1：
Superpeer / 3.4.2：
Experiments and Evaluation / 3.4.3：
Related Work / 3.6：
Grid Activity Registration, Deployment and Provisioning Framework / 3.7：
On-Demand Provisioning Motivation / 4.1：
An Example Using Bare Grid / 4.2.1：
GLARE-Based Solution / 4.2.2：
Activity Manager / 4.3：
Deployment Manager / 4.3.2：
Activity Type Registry / 4.3.3：
Activity Deployment Registry / 4.3.4：
Automatic Deployment Using Expect / 4.4：
Static and Dynamic Registration / 4.4.2：
Self-Management and Fault Tolerance / 4.4.3：
Planning / 4.5：
Allocation Management with Advance Reservation and Service-Level Agreement / 5：
Agreement / 5.1：
Agreement Lifecycle / 5.2.2：
Negotiation / 5.3：
Attentive Allocation / 5.3.1：
Progressive Allocation / 5.3.2：
Share-Based Allocation / 5.3.3：
Allocator / 5.4：
Co-allocator / 5.4.2：
Agreement Enforcement / 5.4.3：
Priority Provision / 5.4.4：
Standards Adaptation / 5.4.5：
Optimizing Multi-Constrained Allocations with Capacity Planning / 5.5：
Allocation Problem / 6.1：
Multi-Constrained Optimization / 6.2.2：
Negotiation Protocol / 6.3：
Allocation Offer Generation / 6.3.1：
Co-allocation Offer Generation / 6.3.2：
Contention Elimination / 6.3.3：
Cost Model / 6.3.4：
Semantics / 6.4：
Semantics in the Grid: Towards Ontology-Based Resource Provisioning / 7：
Describing Resources with Semantics / 7.1：
Concept Description / 7.2.1：
Architectural Extension / 7.3：
Resource Ontologies / 7.4：
Physical Resource Ontology / 7.4.1：
Resource Ensembles / 7.4.2：
Logical Resource Ontology / 7.4.3：
Discovering Resources with Semantics / 7.5：
Subsumption-Based Resource Matching / 7.6：
Evaluation / 7.7：
Subsumption: An Example / 7.7.1：
Semantics-Based Activity Synthesis: Improving On-Demand Provisioning and Planning / 7.8：
Synthesis Model / 8.1：
Ontology Rules / 8.3.1：
Activity Synthesis Problem / 8.3.2：
Applying Patterns for Activity Synthesis / 8.4：
Sequential Flow Patterns / 8.4.1：
Parallel Flow Patterns / 8.4.2：
Built-Ins and Constraints / 8.5：
Assumptions and Effects / 8.5.2：
Improving Capacity Planning / 8.6：
Discussion and Experiments / 8.7：
Conclusion / 8.8：
Resource Management Model / 9：
Towards Automatic Resource Management / 9.2：
Negotiation for Service-Level Agreement (SLA) / 9.3：
Multi-Constrained Optimization and Capacity Planning / 9.5：
Future Research / 9.6：
A Notations
References
Index
Overview / Part I：
Introduction / 1：
Motivation / 1.1：
23.

電子ブック
ＥＢ
23. Grid Resource Management
Mumtaz Siddiqui, Thomas Fahringer, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Overview / Part I：
Introduction / 1：
Motivation / 1.1：
Collaboration Instead of Isolation / 1.1.1：
Discovery and Selection / 1.1.2：
Lifecycle Management / 1.1.3：
On-Demand Provisioning / 1.1.4：
Role of Planning / 1.1.5：
Service-Level Agreement / 1.1.6：
Optimized Resource Allocation / 1.1.7：
Synthesis and Aggregation / 1.1.8：
Grid Enablement / 1.1.9：
Portability / 1.1.10：
Semantics in the Grid / 1.1.11：
Research Goals / 1.2：
Automatic Resource Brokerage / 1.2.1：
Dynamic Registration and Automatic Deployment / 1.2.2：
Advance Reservation and Co-allocation / 1.2.3：
Capacity Management and Planning / 1.2.4：
Standard Adaptation / 1.2.5：
Organization / 1.3：
Part 1: Overview / 1.3.1：
Part 2: Brokerage / 1.3.2：
Part 3: Planning / 1.3.3：
Part 4: Semantics / 1.3.4：
Part 5: Conclusion / 1.3.5：
Appendices / 1.3.6：
Model / 2：
The Grid / 2.1：
Characteristics / 2.1.1：
Layers / 2.1.2：
Architectures / 2.1.3：
Resources and Applications / 2.2：
Activities / 2.2.1：
Workflows / 2.2.2：
Grid Node / 2.2.3：
Grid Operating Environment / 2.3：
Open Grid Services Architecture / 2.3.1：
WS-Resource Framework / 2.3.2：
Globus Toolkit / 2.3.3：
Askalon: A Grid Runtime Environment / 2.4：
Workflow Composition / 2.4.1：
Resource Management / 2.4.2：
Workflow Scheduling / 2.4.3：
Workflow Enactment / 2.4.4：
Performance Prediction and Analysis / 2.4.5：
Semantic Grid / 2.5：
Ontology / 2.5.1：
Web Ontology Language / 2.5.2：
Ontology Query Language / 2.5.3：
Provisioning / 2.6：
Allocation Negotiation / 2.6.2：
Capacity Planning / 2.6.3：
Manageability Models / 2.6.4：
Summary / 2.7：
Brokerage / Part II：
Grid Resource Management and Brokerage System / 3：
Architectural Overview / 3.1：
Node Management / 3.2.1：
Activity Management / 3.2.3：
Allocation Management / 3.2.4：
System Model / 3.3：
Resource Discoverer / 3.3.1：
Candidate Set Generator / 3.3.2：
Resource Synthesizer / 3.3.3：
Resource Selector / 3.3.4：
A Steady System with Proportional Distribution / 3.3.5：
Implementation / 3.4：
Customization / 3.4.1：
Superpeer / 3.4.2：
Experiments and Evaluation / 3.4.3：
Related Work / 3.6：
Grid Activity Registration, Deployment and Provisioning Framework / 3.7：
On-Demand Provisioning Motivation / 4.1：
An Example Using Bare Grid / 4.2.1：
GLARE-Based Solution / 4.2.2：
Activity Manager / 4.3：
Deployment Manager / 4.3.2：
Activity Type Registry / 4.3.3：
Activity Deployment Registry / 4.3.4：
Automatic Deployment Using Expect / 4.4：
Static and Dynamic Registration / 4.4.2：
Self-Management and Fault Tolerance / 4.4.3：
Planning / 4.5：
Allocation Management with Advance Reservation and Service-Level Agreement / 5：
Agreement / 5.1：
Agreement Lifecycle / 5.2.2：
Negotiation / 5.3：
Attentive Allocation / 5.3.1：
Progressive Allocation / 5.3.2：
Share-Based Allocation / 5.3.3：
Allocator / 5.4：
Co-allocator / 5.4.2：
Agreement Enforcement / 5.4.3：
Priority Provision / 5.4.4：
Standards Adaptation / 5.4.5：
Optimizing Multi-Constrained Allocations with Capacity Planning / 5.5：
Allocation Problem / 6.1：
Multi-Constrained Optimization / 6.2.2：
Negotiation Protocol / 6.3：
Allocation Offer Generation / 6.3.1：
Co-allocation Offer Generation / 6.3.2：
Contention Elimination / 6.3.3：
Cost Model / 6.3.4：
Semantics / 6.4：
Semantics in the Grid: Towards Ontology-Based Resource Provisioning / 7：
Describing Resources with Semantics / 7.1：
Concept Description / 7.2.1：
Architectural Extension / 7.3：
Resource Ontologies / 7.4：
Physical Resource Ontology / 7.4.1：
Resource Ensembles / 7.4.2：
Logical Resource Ontology / 7.4.3：
Discovering Resources with Semantics / 7.5：
Subsumption-Based Resource Matching / 7.6：
Evaluation / 7.7：
Subsumption: An Example / 7.7.1：
Semantics-Based Activity Synthesis: Improving On-Demand Provisioning and Planning / 7.8：
Synthesis Model / 8.1：
Ontology Rules / 8.3.1：
Activity Synthesis Problem / 8.3.2：
Applying Patterns for Activity Synthesis / 8.4：
Sequential Flow Patterns / 8.4.1：
Parallel Flow Patterns / 8.4.2：
Built-Ins and Constraints / 8.5：
Assumptions and Effects / 8.5.2：
Improving Capacity Planning / 8.6：
Discussion and Experiments / 8.7：
Conclusion / 8.8：
Resource Management Model / 9：
Towards Automatic Resource Management / 9.2：
Negotiation for Service-Level Agreement (SLA) / 9.3：
Multi-Constrained Optimization and Capacity Planning / 9.5：
Future Research / 9.6：
A Notations
References
Index
Overview / Part I：
Introduction / 1：
Motivation / 1.1：
24.

電子ブック
ＥＢ
24. Codes and Turbo Codes
Berrou, Claude Berrou
出版情報: SpringerLink Books - AutoHoldings , Springer Paris, 2010
所蔵情報: loading…
目次情報: 続きを見る
Contributors
Foreword
Introduction / 1：
Digital messages / 1.1：
A first code / 1.2：
Hard input decoding and soft input decoding / 1.3：
Hard output decoding and soft output decoding / 1.4：
The performance measure / 1.5：
What is a good code? / 1.6：
Families of codes / 1.7：
Digital communications / 2：
Digital Modulations / 2.1：
Linear Memoryless Modulations / 2.1.1：
Memoryless modulation with M states (M-FSK) / 2.1.3：
Modulations with memory by continuous phase frequency shift keying (CPFSK) / 2.1.4：
Structure and performance of the optimal receiver on a Gaussian channel / 2.2：
Structure of the coherent receiver / 2.2.1：
Performance of the coherent receiver / 2.2.2：
Transmission on a band-limited channel / 2.3：
Intersymbol interference / 2.3.1：
Condition of absence of ISI: Nyquist criterion / 2.3.3：
Expression of the error probability in presence of Nyquist filtering / 2.3.4：
Transmission on fading channels / 2.4：
Characterization of a fading channel / 2.4.1：
Transmission on non-frequency-selective slow-fading channels / 2.4.2：
Theoretical limits / 3：
Information theory / 3.1：
Transmission channel / 3.1.1：
An example: the binary symmetric channel / 3.1.2：
Overview of the fundamental coding theorem / 3.1.3：
Geometrical interpretation / 3.1.4：
Random coding / 3.1.5：
Theoretical limits to performance / 3.2：
Binary input and real output channel / 3.2.1：
Capacity of a transmission channel / 3.2.2：
Practical limits to performance / 3.3：
Gaussian binary input channel / 3.3.1：
Gaussian continuous input channel / 3.3.2：
Some examples of limits / 3.3.3：
Minimum distances required / 3.4：
MHD required with 4-PSK modulation / 3.4.1：
MHD required with 8-PSK modulation / 3.4.2：
MHD required with 16-QAM modulation / 3.4.3：
Bibliography
Block codes / 4：
Block codes with binary symbols / 4.1：
Generator matrix of a binary block code / 4.1.1：
Dual code and parity check matrix / 4.1.2：
Minimum distance / 4.1.3：
Extended codes and shortened codes / 4.1.4：
Product codes / 4.1.5：
Examples of binary block codes / 4.1.6：
Cyclic codes / 4.1.7：
Block codes with non-binary symbols / 4.2：
Reed-Solomon codes / 4.2.1：
Implementing the encoder / 4.2.2：
Decoding and performance of codes with binary symbols / 4.3：
Error detection / 4.3.1：
Error correction / 4.3.2：
Decoding and performance of codes with non-binary symbols / 4.4：
Hard input decoding of Reed-Solomon codes / 4.4.1：
Peterson's direct method / 4.4.2：
Iterative method / 4.4.3：
Hard input decoding performance of Reed-Solomon codes / 4.4.4：
Appendix: Notions about Galois fields and minimal polynomials
Convolutional codes and their decoding / 5：
History / 5.1：
Representations of convolutional codes / 5.2：
Generic representation of a convolutional encoder / 5.2.1：
Polynomial representation / 5.2.2：
Tree of a code / 5.2.3：
Trellis of a code / 5.2.4：
State machine of a code / 5.2.5：
Code distances and performance / 5.3：
Choosing a good code / 5.3.1：
RTZ sequences / 5.3.2：
Transfer function and distance spectrum / 5.3.3：
Performance / 5.3.4：
Decoding convolutional codes / 5.4：
Model of the transmission chain and notations / 5.4.1：
The Viterbi algorithm / 5.4.2：
The Maximum A Posteriori algorithm or MAP algorithm / 5.4.3：
Convolutional block codes / 5.5：
Trellis termination / 5.5.1：
Puncturing / 5.5.2：
Concatenated codes / 6：
Parallel concatenation and serial concatenation / 6.1：
Parallel concatenation and LDPC codes / 6.2：
Permutations / 6.3：
Turbo crossword / 6.4：
Convolutional turbo codes / 7：
The history of turbo codes / 7.1：
Multiple concatenation of RSC codes / 7.2：
Turbo codes / 7.3：
Termination of constituent codes / 7.3.1：
The permutation function / 7.3.2：
Decoding turbo codes / 7.4：
Turbo decoding / 7.4.1：
SISO decoding and extrinsic information / 7.4.2：
Practical considerations / 7.4.3：
m-binary turbo codes / 7.5：
m-binary RSC encoders / 7.5.1：
Analysis tools / 7.5.2：
Theoretical performance / 7.6.1：
Asymptotic behaviour / 7.6.2：
Convergence / 7.6.3：
Turbo product codes / 8：
Hard input decoding of product codes / 8.1：
Row-column decoding / 8.3.1：
The Reddy-Robinson algorithm / 8.3.2：
Soft input decoding of product codes / 8.4：
The Chase algorithm with weighted input / 8.4.1：
Performance of the Chase-Pyndiah algorithm / 8.4.2：
The Fang-Battail algorithm / 8.4.3：
The Hartmann-Nazarov algorithm / 8.4.4：
Other soft input decoding algorithms / 8.4.5：
Implantation of the Chase-Pyndiah algorithm / 8.5：
LDPC codes / 9：
Principle of LDPC codes / 9.1：
Parity check code / 9.1.1：
Definition of an LDPC code / 9.1.2：
Encoding / 9.1.3：
Decoding LDPC codes / 9.1.4：
Random construction of LDPC codes / 9.1.5：
Some geometrical constructions of LDPC codes / 9.1.6：
Architecture for decoding LDPC codes for the Gaussian channel / 9.2：
Analysis of the complexity / 9.2.1：
Architecture of a generic node processor (GNP) / 9.2.2：
Generic architecture for message propagation / 9.2.3：
Combining parameters of the architecture / 9.2.4：
Example of synthesis of an LDPC decoder architecture / 9.2.5：
Sub-optimal decoding algorithm / 9.2.6：
Influence of quantization / 9.2.7：
State of the art of published LDPC decoder architectures / 9.2.8：
Turbo codes and large spectral efficiency transmissions / 10：
Turbo trellis coded modulation (TTCM) / 10.1：
Pragmatic turbo coded modulation / 10.2：
The turbo principle applied to equalization and detection / 11：
Turbo equalization / 11.1：
Multipath channels and intersymbol interference / 11.1.1：
The equalization function / 11.1.2：
Combining equalization and decoding / 11.1.3：
Principle of turbo equalization / 11.1.4：
MAP turbo equalization / 11.1.5：
MMSE turbo equalization / 11.1.6：
Multi-user turbo detection and its application to CDMA systems / 11.2：
Introduction and some notations / 11.2.1：
Multi-user detection / 11.2.2：
Turbo CDMA / 11.2.3：
Conclusions / 11.3：
Index
Contributors
Foreword
Introduction / 1：
25.

図書
図書
25. Raman spectroscopy, fullerenes and nanotechnology (: hbk)
Maher S. Amer
出版情報: Cambridge : Royal Society of Chemistry, c2010  xiv, 287 p. ; 24 cm
シリーズ名: RSC nanoscience & nanotechnology ; no. 13
所蔵情報: loading…
目次情報: 続きを見る
Nanotechnology, the Technology of Small Thermodynamic Systems / Chapter 1：
Introduction / 1.1：
Origins of Nanotechnology / 1.2：
What Nanotechnology Is / 1.3：
What Can Nanotechnology Do For Us? / 1.3.1：
Where did the Name "Nano" Came From? / 1.3.2：
Does Every Nanosystem Have to Be so Small? / 1.3.3：
How and Why do the Properties of Matter Change by Entering the Nano-domain? / 1.3.4：
Has Nanotechnology Been Used Before? / 1.3.5：
Why did it Take us so Long to Realize the Importance of Nanotechnology? / 1.3.6：
Back to the Science / 1.4：
Large Systems and Small Systems Limits / 1.5：
Scales of Inhomogeneity / 1.6：
Thermal Gravitational Scale / 1.6.1：
Capillary Length / 1.6.2：
Tolman Length / 1.6.3：
Line Tension (?) and the (?/?) Ratio / 1.6.4：
Correlation Length (?) / 1.6.5：
Thermodynamics of Small Systems / 1.7：
Configurational Entropy of Small Systems / 1.8：
Nanophenomena / 1.9：
Optical Phenomena / 1.9.1：
Electronic Phenomena / 1.9.2：
Thermal Phenomena / 1.9.3：
Mechanical Phenomena / 1.9.4：
References
Raman Spectroscopy; (the Diagnostic Tool / Chapter 2：
Raman Phenomenon / 2.1：
General Theory of Raman Scattering / 2.3：
Raman Selection Rules / 2.4：
Vibration Modes and the Polarizability Tensor / 2.4.1：
Symmetry / 2.5：
Identity (E) / 2.5.1：
Center of Symmetry (i) / 2.5.2：
Planes of Symmetry (?) (Minor Planes) / 2.5.3：
Symmetry Elements and Symmetry Operations / 2.5.5：
Point Groups / 2.6：
Point Groups of Molecules / 2.6.1：
Point Groups of Crystals / 2.6.2：
Space Groups / 2.7：
Glide Planes / 2.7.1：
Space Groups in One- and Two-dimensional Space / 2.7.3：
Character Table / 2.8：
Symmetry Operations and Transformation of Directional Properties / 2.8.1：
Degenerate Symmetry Species (Degenerate Representations) / 2.8.2：
Symmetry Species in Linear Molecules / 2.8.3：
Classification of Normal Vibration by Symmetry / 2.8.4：
Raman Overtones and Combination Bands / 2.8.5：
Molecular and Lattice Raman Modes / 2.8.6：
Raman from an Energy Transfer Viewpoint / 2.9：
Boltzmann Distribution and its Correlation to Raman Lines / 2.10：
Perturbation Effects on Raman Bands / 2.11：
Strain Effects / 2.11.1：
Heat Effects / 2.11.2：
Hydrostatic Pressure Effects / 2.11.3：
Structural Imperfections Effects / 2.11.4：
Chemical Potentials Effects / 2.11.5：
Resonant Raman Effect / 2.12：
Calculations of Raman Band Positions / 2.13：
Polarized Raman and Band Intensity / 2.14：
Dispersion Effect / 2.15：
Instrumentation / 2.16：
Recommended General Reading
Fullerenes, the Building Blocks / Chapter 3：
Overview / 3.1：
Fullerenes, the Beginnings and Current State / 3.2：
Zero-dimensional Fullerenes: The Structure / 3.4：
Structure of the [60] Fullerene Molecule / 3.4.1：
Structure of the [70] Fullerene Molecule / 3.4.2：
Production Methods of Fullerenes / 3.5：
Huffman- Krätschmer Method / 3.5.1：
Benzene Combustion Method / 3.5.2：
Condensation Method / 3.5.3：
Extraction Methods of Fullerenes / 3.6：
Purification Methods of Fullerene / 3.7：
Fullerene Onions / 3.8：
One-dimensional Fullerene: the Structure / 3.9：
Single-walled Carbon Nanotubes (SWCNTs) / 3.9.1：
Multi-walled Carbon Nanotubes (MWCNTs) / 3.9.2：
Production of Carbon Nanotubes / 3.9.3：
Two-dimensional Fullerenes - Graphene / 3.10：
The Nano-frontier; Properties, Achievements, and Challenges / Chapter 4：
Raman Scattering of Fullerenes / 4.1：
Raman Scattering of Single-walled Carbon Nanotubes / 4.2.1：
Raman Scattering of Double- and Multi-walled Carbon Nanotubes / 4.2.4：
Raman Scattering of Graphene / 4.2.5：
Thermal Effects on Raman Scattering / 4.2.6：
Fullerene Solubility and Solvent Interactions / 4.3：
Solvent Effects on Fullerenes / 4.3.1：
Fullerene Effects on Solvents / 4.3.2：
Fullerenes under Pressure / 4.4：
Overview, Potentials, Challenges, and Concluding Remarks / 4.5：
Character Tables for Various Point Groups / Appendix 1：
General Formula for Calculating the Number of Normal Vibrations in Each Symmetry Species / Appendix 2：
Polarizability Tensors for the 32 Point Groups including the Icosahedral Group / Appendix 3：
Subject Index
Nanotechnology, the Technology of Small Thermodynamic Systems / Chapter 1：
Introduction / 1.1：
Origins of Nanotechnology / 1.2：
26.

電子ブック
ＥＢ
26. Sensitivity Analysis for Neural Networks
Daniel S. Yeung, Ian Cloete, Wing W. Y. Ng, Daming Shi
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
Supervised Learning / 1.2.1：
Unsupervised Learning / 1.2.2：
Perceptron / 1.3：
Adaline and Least Mean Square Algorithm / 1.4：
Multilayer Perceptron and Backpropagation Algorithm / 1.5：
Output Layer Learning / 1.5.1：
Hidden Layer Learning / 1.5.2：
Radial Basis Function Networks / 1.6：
Support Vector Machines / 1.7：
Principles of Sensitivity Analysis / 2：
Perturbations in Neural Networks / 2.1：
Neural Network Sensitivity Analysis / 2.2：
Fundamental Methods of Sensitivity Analysis / 2.3：
Geometrical Approach / 2.3.1：
Statistical Approach / 2.3.2：
Summary / 2.4：
Hyper-Rectangle Model / 3：
Hyper-Rectangle Model for Input Space of MLP / 3.1：
Sensitivity Measure of MLP / 3.2：
Discussion / 3.3：
Sensitivity Analysis with Parameterized Activation Function / 4：
Parameterized Antisymmetric Squashing Function / 4.1：
Sensitivity Measure / 4.2：
Localized Generalization Error Model / 4.3：
Introduction / 5.1：
The Localized Generalization Error Model / 5.2：
The Q-Neighborhood and Q-Union / 5.2.1：
The Localized Generalization Error Bound / 5.2.2：
Stochastic Sensitivity Measure for RBFNN / 5.2.3：
Characteristics of the Error Bound / 5.2.4：
Comparing Two Classifiers Using the Error Bound / 5.2.5：
Architecture Selection Using the Error Bound / 5.3：
Critical Vector Learning for RBF Networks / 5.3.1：
Related Work / 6.1：
Construction of RBF Networks with Sensitivity Analysis / 6.2：
RBF Classifiers' Sensitivity to the Kernel Function Centers / 6.2.1：
Orthogonal Least Square Transform / 6.2.2：
Critical Vector Selection / 6.2.3：
Sensitivity Analysis of Prior Knowledge / 6.3：
KBANNs / 7.1：
Inductive Bias / 7.2：
Sensitivity Analysis and Measures / 7.3：
Output-Pattern Sensitivity / 7.3.1：
Output-Weight Sensitivity / 7.3.2：
Output-H Sensitivity / 7.3.3：
Euclidean Distance / 7.3.4：
Promoter Recognition / 7.4：
Data and Initial Domain Theory / 7.4.1：
Experimental Methodology / 7.4.2：
Discussion and Conclusion / 7.5：
Applications / 8：
Input Dimension Reduction / 8.1：
Sensitivity Matrix / 8.1.1：
Criteria for Pruning Inputs / 8.1.2：
Network Optimization / 8.2：
Selective Learning / 8.3：
Hardware Robustness / 8.4：
Measure of Nonlinearity / 8.5：
Parameter Tuning for Neocognitron / 8.6：
Receptive Field / 8.6.1：
Selectivity / 8.6.2：
Sensitivity Analysis of the Neocognitron / 8.6.3：
Bibliography
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
27.

電子ブック
ＥＢ
27. Sensitivity Analysis for Neural Networks
Daniel S. Yeung, Ian Cloete, Wing W. Y. Ng, Daming Shi
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
Supervised Learning / 1.2.1：
Unsupervised Learning / 1.2.2：
Perceptron / 1.3：
Adaline and Least Mean Square Algorithm / 1.4：
Multilayer Perceptron and Backpropagation Algorithm / 1.5：
Output Layer Learning / 1.5.1：
Hidden Layer Learning / 1.5.2：
Radial Basis Function Networks / 1.6：
Support Vector Machines / 1.7：
Principles of Sensitivity Analysis / 2：
Perturbations in Neural Networks / 2.1：
Neural Network Sensitivity Analysis / 2.2：
Fundamental Methods of Sensitivity Analysis / 2.3：
Geometrical Approach / 2.3.1：
Statistical Approach / 2.3.2：
Summary / 2.4：
Hyper-Rectangle Model / 3：
Hyper-Rectangle Model for Input Space of MLP / 3.1：
Sensitivity Measure of MLP / 3.2：
Discussion / 3.3：
Sensitivity Analysis with Parameterized Activation Function / 4：
Parameterized Antisymmetric Squashing Function / 4.1：
Sensitivity Measure / 4.2：
Localized Generalization Error Model / 4.3：
Introduction / 5.1：
The Localized Generalization Error Model / 5.2：
The Q-Neighborhood and Q-Union / 5.2.1：
The Localized Generalization Error Bound / 5.2.2：
Stochastic Sensitivity Measure for RBFNN / 5.2.3：
Characteristics of the Error Bound / 5.2.4：
Comparing Two Classifiers Using the Error Bound / 5.2.5：
Architecture Selection Using the Error Bound / 5.3：
Critical Vector Learning for RBF Networks / 5.3.1：
Related Work / 6.1：
Construction of RBF Networks with Sensitivity Analysis / 6.2：
RBF Classifiers' Sensitivity to the Kernel Function Centers / 6.2.1：
Orthogonal Least Square Transform / 6.2.2：
Critical Vector Selection / 6.2.3：
Sensitivity Analysis of Prior Knowledge / 6.3：
KBANNs / 7.1：
Inductive Bias / 7.2：
Sensitivity Analysis and Measures / 7.3：
Output-Pattern Sensitivity / 7.3.1：
Output-Weight Sensitivity / 7.3.2：
Output-H Sensitivity / 7.3.3：
Euclidean Distance / 7.3.4：
Promoter Recognition / 7.4：
Data and Initial Domain Theory / 7.4.1：
Experimental Methodology / 7.4.2：
Discussion and Conclusion / 7.5：
Applications / 8：
Input Dimension Reduction / 8.1：
Sensitivity Matrix / 8.1.1：
Criteria for Pruning Inputs / 8.1.2：
Network Optimization / 8.2：
Selective Learning / 8.3：
Hardware Robustness / 8.4：
Measure of Nonlinearity / 8.5：
Parameter Tuning for Neocognitron / 8.6：
Receptive Field / 8.6.1：
Selectivity / 8.6.2：
Sensitivity Analysis of the Neocognitron / 8.6.3：
Bibliography
Introduction to Neural Networks / 1：
Properties of Neural Networks / 1.1：
Neural Network Learning / 1.2：
28.

図書
図書
28. Glycome informatics : methods and applications
Kiyoko F. Aoki-Kinoshita
出版情報: Boca Raton : CRC Press, c2010  xvii, 244 p. ; 25 cm
シリーズ名: Chapman and Hall/CRC mathematical & computational biology series / series editors Alison M. Etheridge ... [et al.] ; 28
所蔵情報: loading…
目次情報: 続きを見る
List of Tables
List of Figures
About the Author
Introduction to Glycobiology / 1：
Roles of carbohydrates / 1.1：
Glycan structures / 1.2：
Glycan classes / 1.3：
Glycan biosynthesis / 1.4：
N-linked glycans / 1.4.1：
O-linked glycans / 1.4.2：
Glycosaminoglycans (GAGs) / 1.4.3：
Glycosphingolipids (GSLs) / 1.4.4：
GPI anchors / 1.4.5：
LPS / 1.4.6：
Glycan motifs / 1.5：
Potential for drug discovery / 1.6：
Background / 2：
Glycan nomenclature / 2.1：
InChIÖ / 2.1.1：
(Extended) IUPAC format / 2.1.2：
CarbBank format / 2.1.3：
KCF format / 2.1.4：
LINUCS format / 2.1.5：
BCSDB format / 2.1.6：
Linear Code" / 2.1.7：
GlycoCT format / 2.1.8：
XML representations / 2.1.9：
Lectin-glycan interactions / 2.2：
Families and types of lectins / 2.2.1：
Carbohydrate-binding mechanism of lectins / 2.2.2：
Carbohydrate-carbohydrate interactions / 2.3：
Databases / 3：
Glycan structure databases / 3.1：
KEGG GLYCAN / 3.1.1：
GLYCOSCIENCES.de / 3.1.2：
CFG / 3.1.3：
BCSDB / 3.1.4：
GLYCO3D / 3.1.5：
MonoSaccharideDB / 3.1.6：
GlycomeDB / 3.1.7：
Glyco-gene databases / 3.2：
KEGG BRITE / 3.2.1：
GGDB / 3.2.2：
CAZy / 3.2.4：
Lipid databases / 3.3：
SphingoMAP© / 3.3.1：
LipidBank / 3.3.2：
LMSD / 3.3.3：
Lectin databases / 3.4：
Lectines / 3.4.1：
Animal Lectin DB / 3.4.2：
Others / 3.5：
GlycoEpitopeDB / 3.5.1：
ECODAB / 3.5.2：
SugarBindDB / 3.5.3：
Glycome Informatics / 4：
Terminology and notations / 4.1：
Algorithmic techniques / 4.2：
Tree structure alignment / 4.2.1：
Linkage analysis using score matrices / 4.2.2：
Glycan variation map / 4.2.3：
Bioinformatic methods / 4.3：
Glycan structure prediction from glycogene microarrays / 4.3.1：
Glyco-gene sequence and structure analysis / 4.3.2：
Glyco-related pathway analysis / 4.3.3：
Mass spectral data annotation / 4.3.4：
Data mining techniques / 4.4：
Kernel methods / 4.4.1：
Frequent subtree mining / 4.4.2：
Probabilistic models / 4.4.3：
Glycomics tools / 4.5：
Visualization tools / 4.5.1：
Pathway analysis tools / 4.5.2：
PDB data analysis / 4.5.3：
3D analysis tools / 4.5.4：
Molecular dynamics / 4.5.5：
Spectroscopic tools / 4.5.6：
NMR tools / 4.5.7：
Potential Research Projects / 5：
Sequence and structural analyses / 5.1：
Glycan score matrix / 5.1.1：
Visualization / 5.1.2：
Databases and techniques to integrate heterogeneous data sets / 5.2：
Automated characterization of glycans from MS data / 5.3：
Prediction of glycans from data other than MS / 5.4：
Biomarker prediction / 5.5：
Systems analyses / 5.6：
Drug discovery / 5.7：
Sequence Analysis Methods / A：
Pairwise sequence alignment (dynamic programming) / A.1：
Dynamic programming / A.1.1：
Sequence alignment / A.1.2：
BLOSUM (BLOcks Substitution Matrix) / A.2：
Machine Learning Methods / B：
Kernel methods and SVMs / B.1：
Hidden Markov models / B.2：
The three problems of interest for HMMs / B.2.1：
Expectation-Maximization (EM) algorithm / B.2.2：
Hidden tree Markov models / B.2.3：
Profile Hidden Markov models (profile HMMs) / B.2.4：
Glycomics Technologies / C：
Mass spectrometry (MS) / C.1：
MALDI-MS / C.1.l：
FT-ICR / C.1.2：
LC-MS (HPLC) / C.1.3：
Tandem MS / C.1.4：
Nuclear magnetic resonance (NMR) / C.2：
References
Index
List of Tables
List of Figures
About the Author
29.

電子ブック
ＥＢ
29. Stochastic Models for Fault Tolerance
Katinka Wolter
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Part I：
Basic Concepts and Problems / 1：
The Timeout Problem / 1.1：
System and Fault Models / 1.2：
Preventive Maintenance / 1.3：
Note on Terminology / 1.4：
Outline / 1.5：
Task Completion Time / 2：
Bounded Downtime / 2.1：
System Lifetime / 2.1.1：
Cumulative Uptime / 2.1.2：
Probability of Task Completion / 2.1.3：
Bounded Accumulated Downtime / 2.2：
system Lifetime / 2.2.1：
Bounded Number of Failures / 2.2.2：
Restart / 2.3.1：
Applicability Analysis of Restart / 3：
Applications of Restart / 3.1：
Randomised Algorithms / 3.1.1：
Optimal Restart Time for a Randomised Algorithm / 3.1.2：
Failure Detectors / 3.1.3：
Congestion Control in TCP / 3.1.4：
Criteria for Successful Restarts / 3.2：
When Does Restart Improve the Expected Completion Time? / 3.2.1：
When Does Restart Improve the Probability of Meeting a Deadline? / 3.2.2：
Conclusions / 3.3：
Moments of Completion Time Under Restart / 4：
The Information Captured by the Moments of a Distribution / 4.1：
Models for Moments of Completion Time / 4.2：
Unbounded Number of Restarts / 4.2.1：
Finite Number of Restarts / 4.2.2：
Optimal Restart Times for the Moments of Completion Time / 4.3：
Expected Completion Time / 4.3.1：
Optimal Restart Times for Higher Moments / 4.3.2：
Case Study: Optimising Expected Completion Time in Web Services Reliable Messaging / 4.4：
Metrics for the Fairness-Timeliness tradeoff / 4.4.1：
Oracles for Restart / 4.4.2：
Results / 4.4.3：
HTTP Transport / 4.5：
60 s Disruption / 4.5.1：
Packet Loss / 4.5.2：
Mail Transport / 4.5.3：
Meeting Deadlines Through Restart / 5：
A Model for the Probability of Meeting a Deadline Under Restart / 5.1：
Algorithms for Optimal Restart Times / 5.2：
An Engineering Rule to Approximate the Optimal Restart Time / 5.3：
Towards Online Restart for Self-Management of Systems / 5.4：
Estimating the Hazard Rate / 5.4.1：
Experiments / 5.4.2：
Software Rejuvenation / Part III：
Practical Aspects of Preventive Maintenance and Software Rejuvenation / 6：
Stochastic Models for Preventive Maintenance and Software Rejuvenation / 6.1：
A Markovian Software Rejuvenation Model / 7.1：
Aging in the Modelling of Software Rejuvenation / 7.2：
Behaviour in State A under Policy I / 7.2.1：
Behaviour in State A under Policy II / 7.2.2：
A Petri Net Model / 7.3：
A Non-Markovian Preventive Maintenance Model / 7.4：
Stochastic Processes for Shock and Inspection-Based Modelling / 7.5：
The Inspection Model with Alert Threshold Policy / 7.5.1：
The Shock Model with a Risk Policy / 7.5.2：
Inspection-Based Modelling using the Möbius Modelling Tool / 7.6：
Comparative Summary of the Stochastic Models / 7.7：
Further Reading / 7.8：
Checkpointing / Part IV：
Checkpointing Systems / 8：
Checkpointing Single-Unit Systems / 8.1：
Checkpointing in Distributed Systems / 8.2：
Stochastic Models for Checkpointing / 9：
Checkpointing at Program Level / 9.1：
Equidistant Checkpointing / 9.1.1：
Checkpointing Real-Time Tasks / 9.1.2：
Random Checkpointing Intervals / 9.1.3：
Algorithms for Optimum Checkpoint Selection / 9.1.4：
Checkpointing at System Level / 9.2：
Analytic Models for Checkpointing Transaction-Based Systems / 9.2.1：
Checkpointing Policies for Transaction-Based Systems / 9.2.2：
A Queueing Model for Checkpointing Transaction-Based Systems / 9.2.3：
A Trade-Off Metric for Optimal Checkpoint Selection / 9.3：
Summary / 9.4：
Summary, Conclusion and Outlook / 10：
Properties in Discrete Systems / A：
Cumulative First Moment / A.1：
The Gamma Function / A.2：
Important Probability Distributions / B：
Discrete Probability Distributions / B.1：
The Binomial Distribution / B.1.1：
The Multinomial Distribution / B.1.2：
The Geometric Distribution / B.1.3：
The Poisson Distribution / B.1.4：
Continuous Probability Distributions / B.2：
The Exponential Distribution / B.2.1：
The Erlang Distribution and the Hypo-exponential Distribution / B.2.2：
The Hyperexponential Distribution / B.2.3：
The Mixed Hyper/Hypo-exponential Distribution / B.2.4：
The Weibull Distribution / B.2.5：
The Lognormal Distribution / B.2.6：
Cumulative Hazard Rate / C：
Epanechnikov Kernel / C.2：
Bandwidth Estimation / C.3：
The Laplace and the Laplace-Stieltjes Transform / D：
References
Index
Glossary
Introduction / Part I：
Basic Concepts and Problems / 1：
The Timeout Problem / 1.1：
30.

電子ブック
ＥＢ
30. Stochastic Models for Fault Tolerance
Katinka Wolter
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Part I：
Basic Concepts and Problems / 1：
The Timeout Problem / 1.1：
System and Fault Models / 1.2：
Preventive Maintenance / 1.3：
Note on Terminology / 1.4：
Outline / 1.5：
Task Completion Time / 2：
Bounded Downtime / 2.1：
System Lifetime / 2.1.1：
Cumulative Uptime / 2.1.2：
Probability of Task Completion / 2.1.3：
Bounded Accumulated Downtime / 2.2：
system Lifetime / 2.2.1：
Bounded Number of Failures / 2.2.2：
Restart / 2.3.1：
Applicability Analysis of Restart / 3：
Applications of Restart / 3.1：
Randomised Algorithms / 3.1.1：
Optimal Restart Time for a Randomised Algorithm / 3.1.2：
Failure Detectors / 3.1.3：
Congestion Control in TCP / 3.1.4：
Criteria for Successful Restarts / 3.2：
When Does Restart Improve the Expected Completion Time? / 3.2.1：
When Does Restart Improve the Probability of Meeting a Deadline? / 3.2.2：
Conclusions / 3.3：
Moments of Completion Time Under Restart / 4：
The Information Captured by the Moments of a Distribution / 4.1：
Models for Moments of Completion Time / 4.2：
Unbounded Number of Restarts / 4.2.1：
Finite Number of Restarts / 4.2.2：
Optimal Restart Times for the Moments of Completion Time / 4.3：
Expected Completion Time / 4.3.1：
Optimal Restart Times for Higher Moments / 4.3.2：
Case Study: Optimising Expected Completion Time in Web Services Reliable Messaging / 4.4：
Metrics for the Fairness-Timeliness tradeoff / 4.4.1：
Oracles for Restart / 4.4.2：
Results / 4.4.3：
HTTP Transport / 4.5：
60 s Disruption / 4.5.1：
Packet Loss / 4.5.2：
Mail Transport / 4.5.3：
Meeting Deadlines Through Restart / 5：
A Model for the Probability of Meeting a Deadline Under Restart / 5.1：
Algorithms for Optimal Restart Times / 5.2：
An Engineering Rule to Approximate the Optimal Restart Time / 5.3：
Towards Online Restart for Self-Management of Systems / 5.4：
Estimating the Hazard Rate / 5.4.1：
Experiments / 5.4.2：
Software Rejuvenation / Part III：
Practical Aspects of Preventive Maintenance and Software Rejuvenation / 6：
Stochastic Models for Preventive Maintenance and Software Rejuvenation / 6.1：
A Markovian Software Rejuvenation Model / 7.1：
Aging in the Modelling of Software Rejuvenation / 7.2：
Behaviour in State A under Policy I / 7.2.1：
Behaviour in State A under Policy II / 7.2.2：
A Petri Net Model / 7.3：
A Non-Markovian Preventive Maintenance Model / 7.4：
Stochastic Processes for Shock and Inspection-Based Modelling / 7.5：
The Inspection Model with Alert Threshold Policy / 7.5.1：
The Shock Model with a Risk Policy / 7.5.2：
Inspection-Based Modelling using the Möbius Modelling Tool / 7.6：
Comparative Summary of the Stochastic Models / 7.7：
Further Reading / 7.8：
Checkpointing / Part IV：
Checkpointing Systems / 8：
Checkpointing Single-Unit Systems / 8.1：
Checkpointing in Distributed Systems / 8.2：
Stochastic Models for Checkpointing / 9：
Checkpointing at Program Level / 9.1：
Equidistant Checkpointing / 9.1.1：
Checkpointing Real-Time Tasks / 9.1.2：
Random Checkpointing Intervals / 9.1.3：
Algorithms for Optimum Checkpoint Selection / 9.1.4：
Checkpointing at System Level / 9.2：
Analytic Models for Checkpointing Transaction-Based Systems / 9.2.1：
Checkpointing Policies for Transaction-Based Systems / 9.2.2：
A Queueing Model for Checkpointing Transaction-Based Systems / 9.2.3：
A Trade-Off Metric for Optimal Checkpoint Selection / 9.3：
Summary / 9.4：
Summary, Conclusion and Outlook / 10：
Properties in Discrete Systems / A：
Cumulative First Moment / A.1：
The Gamma Function / A.2：
Important Probability Distributions / B：
Discrete Probability Distributions / B.1：
The Binomial Distribution / B.1.1：
The Multinomial Distribution / B.1.2：
The Geometric Distribution / B.1.3：
The Poisson Distribution / B.1.4：
Continuous Probability Distributions / B.2：
The Exponential Distribution / B.2.1：
The Erlang Distribution and the Hypo-exponential Distribution / B.2.2：
The Hyperexponential Distribution / B.2.3：
The Mixed Hyper/Hypo-exponential Distribution / B.2.4：
The Weibull Distribution / B.2.5：
The Lognormal Distribution / B.2.6：
Cumulative Hazard Rate / C：
Epanechnikov Kernel / C.2：
Bandwidth Estimation / C.3：
The Laplace and the Laplace-Stieltjes Transform / D：
References
Index
Glossary
Introduction / Part I：
Basic Concepts and Problems / 1：
The Timeout Problem / 1.1：
31.

図書
図書
31. Nanostructured thin films and surfaces
edited by Challa S.S.R. Kumar
出版情報: Weinheim : Wiley-VCH, c2010  xix, 431 p. ; 25 cm
シリーズ名: Nanomaterials for the life sciences / edited by Challa S.S.R. Kumar ; v. 5
所蔵情報: loading…
目次情報: 続きを見る
Preface
List of Contributors
Polymer Thin Films for Biomedical Applications / Venkat K. Vendra ; Lin Wu ; Sitaraman Krishnan1：
Introduction / 1.1：
Biocompatible Coatings / 1.2：
Protein-Repellant Coatings / 1.2.1：
Pegylated Thin Films / 1.2.1.1：
Non-Pegylated Hydrophilic Thin Films / 1.2.1.2：
Thin Films of Hyperbranched Polymers / 1.2.1.3：
Multilayer Thin Films / 1.2.1.4：
Antithrombogenic Coatings / 1.2.2：
Surface Chemistry and Blood Compatibility / 1.2.2.1：
Membrane-Mimetic Thin Films / 1.2.2.2：
Heparin-Mimetic Thin Films / 1.2.2.3：
Clot-Lyzing Thin Films / 1.2.2.4：
Polyelectrolyte Multilayer Thin Films / 1.2.2.5：
Polyurethane Coatings / 1.2.2.6：
Vapor-Deposited Thin Films / 1.2.2.7：
Antimicrobial Coatings / 1.2.3：
Cationic Polymers / 1.2.3.1：
Nanocomposite Polymer Thin Films Incorporating Inorganic Biocides / 1.2.3.2：
Antibiotic-Conjugated Polymer Thin Films / 1.2.3.3：
Biomimetic Antibacterial Coatings / 1.2.3.4：
Thin Films Resistant to the Adhesion of Viable Bacteria" / 1.2.3.5：
Coatings for Tissue Engineering Substrates / 1.3：
Zwitterionic Thin Films / 1.3.1：
Polysaccharide-Based Thin Films / 1.3.3：
Temperature-Responsive Polymer Coatings / 1.3.6：
Electroactive Thin Films / 1.3.8：
Other Functional Polymer Coatings / 1.3.9：
Multilayer Thin Films for Cell Encapsulation / 1.3.10：
Patterned Thin Films / 1.3.11：
Polymer Thin Films for Drug Delivery / 1.4：
Polymer Thin Films for Gene Delivery / 1.5：
Conclusions / 1.6：
References
Biofunctionalization of Polymeric Thin Films and Surfaces / Holger Schönherr2：
Introduction: The Case of Biofunctionalized Surfaces and Interfaces / 2.1：
Polymer-Based Biointerfaces / 2.2：
Requirements for Biofunctionalized Polymer Surfaces / 2.2.1：
Surface Modification Using Functional Polymers and Polymer-Based Approaches / 2.2.2：
Grafting of Polymers to Surfaces / 2.2.2.1：
Polymer Brushes by Surface-Initiated Polymerization / 2.2.2.2：
Physisorbed Multifunctional Polymers / 2.2.2.3：
Multipotent Covalent Coatings / 2.2.2.4：
Plasma Polymerization and Chemical Vapor Deposition (CVD) Approaches / 2.2.2.5：
Surface Modification of Polymer Surfaces, and Selected Examples / 2.2.3：
Coupling and Bioconjugation Strategies / 2.2.3.1：
Interaction with Cells / 2.2.3.2：
Patterned Polymeric Thin Films in Biosensor Applications / 2.2.3.3：
Summary and Future Perspectives / 2.3：
Stimuli-Responsive Polymer Nanocoatings / Ana L. Cordeiro3：
Stimuli-Responsive Polymers / 3.1：
Polymers Responsive to Temperature / 3.2.1：
Polymers Responsive to pH / 3.2.2：
Dual Responsive/Multiresponsive Polymers / 3.2.3：
Intelligent Bioconjugates / 3.2.4：
Responsive Biopolymers / 3.2.5：
Polymer Films and Interfacial Analysis / 3.3：
Applications / 3.4：
Release Matrices / 3.4.1：
Cell Sheet Engineering / 3.4.2：
Biofilm Control / 3.4.3：
Cell Sorting / 3.4.4：
Stimuli-Modulated Membranes / 3.4.5：
Chromatography / 3.4.6：
Microfluidics and Laboratory-on-a-Chip / 3.4.7：
Acknowledgments / 3.5：
Ceramic Nanocoatings and Their Applications in the Life Sciences / Eng San Thian4：
Magnetron Sputtering / 4.1：
Physical and Chemical Properties of SiHA Coatings / 4.3：
Biological Properties of SiHA Coatings / 4.4：
In Vitro Acellular Testing / 4.4.1：
In Vitro Cellular Testing / 4.4.2：
Future Perspectives / 4.5：
Gold Nanofilrns: Synthesis, Characterization, and Potential Biomedical Applications / Shiho Tokonami ; Hiroshi Shiigi ; Tsutomu Nagaoka4.6：
Preparation of Various AuNPs / 5.1：
Functionalization of AuNPs and their Applications through Aggregation / 5.3：
AuNP Assemblies and Arrays / 5.4：
AuNP Assemblies Structured on Substrates / 5.4.1：
AuNP Assembly on Biotemplates / 5.4.2：
AuNP Arrays for Gas Sensing / 5.4.3：
AuNP Arrays for Biosensing / 5.4.4：
Thin Films on Titania, and Their Applications in the Life Sciences / Izabella Brand ; Martina Nullmeier5.5：
Titanium in Contact with a Biomaterial / 6.1：
Lipid Bilayers at the Titania Surface / 6.3：
Formation of Lipid Bilayers on the Titania Surface / 6.3.1：
Spreading of Vesicles on a TiO2 Surface: Comparison to a SiO2 Surface / 6.3.1.1：
Interactions: lipid Molecule-Titania Surface / 6.3.2：
Structure and Conformation of lipid Molecules in the Bilayer on the Titania Surface / 6.3.3：
Structure of Phosphatidylcholine on the Titania Surface / 6.3.3.1：
Characteristics of Extracellular Matrix Proteins on the Titania Surface / 6.4：
Collagen Adsorption on Titania Surfaces / 6.4.1：
Morphology of Collagen Adsorbed on an Oxidized Titanium Surface / 6.4.1.1：
Adsorption of Collagen on a Hydroxylated Titania Surface / 6.4.1.2：
Morphology and Structure of Collagen Adsorbed on a Calcified Titania Surface / 6.4.1.3：
Structure of Collagen on the Titania Surface: Theoretical Predictions / 6.4.1.4：
Fibronectin Adsorption on the Titania Surface / 6.4.2：
Morphology of Fibronectin Adsorbed on the Titania Surface / 6.4.2.1：
Fibronectin-Titania Interactions / 6.4.2.2：
Structure of Fibronectin Adsorbed onto the Titania Surface / 6.4.2.3：
Atomic-Scale Picture of Fibronectin Adsorbed on the Titania Surface: Theoretical Predictions / 6.4.2.4：
Preparation, Characterization, and Potential Biomedical Applications of Nanostructured Zirconia Coatings and Films / Xuanyong Liu ; Ying Xu ; Paul K. Chu6.4.2.5：
Preparation and Characterization of Nano-ZrO2 Films / 7.1：
Cathodic Arc Plasma Deposition / 7.2.1：
Plasma Spraying / 7.2.2：
Sol-Gel Methods / 7.2.3：
Electrochemical Deposition / 7.2.4：
Anodic Oxidation and Micro-Arc Oxidation / 7.2.5：
Bioactivity of Nano-ZrO2 Coatings and Films / 7.2.6：
Cell Behavior on Nano-ZrO2 Coatings and Films / 7.4：
Applications of Nano-ZrO2 Films to Biosensors / 7.5：
Free-Standing Nanostructured Thin Films / Izumi Ichinose8：
The Roles of Free-Standing Thin Films / 8.1：
Films as Partitions / 8.2.1：
Nanoseparation Membranes / 8.2.2：
Biomembranes / 8.2.3：
Free-Standing Thin Films with Bilayer Structures / 8.3：
Supported Lipid Bilayers and "Black Lipid Membranes" / 8.3.1：
Foam Films and Newton Black Films / 8.3.2：
Dried Foam Film / 8.3.3：
Foam Films of Ionic Liquids / 8-3.4：
Free-Standing Thin Films Prepared with Solid Surfaces / 8.4：
Free-Standing Thin Films of Nanoparticles / 8.5：
Nanofibrous Free-Standing Thin Films / 8.6：
Electrospinning and Filtration Methods / 8.6.1：
Metal Hydroxide Nanostrands / 8.6.2：
Nanofibrous Composite Films / 8:6.3：
Dip-Pen Nanolithography of Nanostructured Thin Films for the Life Sciences / Euiseok Kim ; Yuan-Shin Lee ; Ravi Aggarwal ; Roger J. Narayan8.6.4：
Dip-Pen Nanolithography / 9.1：
Important Parameters / 9.2.1：
Applications of DPN / 9.2.2：
Direct and Indirect Patterning of Biomaterials Using DPN / 9.3：
Background / 9.3.1：
Direct Patterning / 9.3.2：
Indirect Patterning / 9.3.3：
Applications of DPN for Medical Diagnostics and Drug Development / 9.4：
General Methods of Nano/Micro Bioarray Patterning / 9.4.1：
Virus Array Generation and Detection Tests / 9.4.2：
Diagnosis of Allergic Disease / 9.4.3：
Cancer Detection Using Nano/Micro Protein Arrays / 9.4.4：
Drug Development / 9.4.5：
Lab-on-a-Chip Using Microarrays / 9.4.6：
Summary and Future Directions / 9.5：
Understanding and Controlling Wetting Phenomena at the Micro-and Nanoscales / Zuankai Wang ; Nikhil Koratkar10：
Wetting and Contact Angle / 10.1：
Design and Creation of Superhydrophobic Surfaces / 10.3：
Design Parameters for a Robust Composite Interface / 10.3.1：
Creation of Superhydrophobic Surfaces / 10.3.2：
Superhydrophobic Surfaces with Unitary Roughness / 10.3.3：
Superhydrophobic Surfaces with Two-Scale Roughness / 10.3.4：
Superhydrophobic Surfaces with Reentrant Structure / 10.3.5：
Impact Dynamics of Water on Superhydrophobic Surfaces / 10.4：
Impact Dynamics on Nanostructured MWNT Surfaces / 10.4.1：
Impact Dynamics on Micropattemed Surfaces / 10.4.2：
Electrically Controlled Wettability Switching on Superhydrophobic Surfaces / 10.5：
Reversible Control of Wettability Using Electrostatic Methods / 10.5.1：
Electrowetting on Superhydrophobic Surfaces / 10.5.2：
Novel Strategies for Reversible Electrowetting on Rough Surfaces / 10.5.3：
Electrochemically Controlled Wetting of Superhydrophobic Surfaces / 10.6：
Polarity-Dependent Wetting of Nanotube Membranes / 10.6.1：
Mechanism of Polarity-Dependent Wetting and Transport / 10.6.2：
Potential Applications of Electrochemically Controlled Wetting and Transport / 10.6.3：
Imaging of Thin Films, and Its Application in the Life Sciences / Silvia Mittler10.7：
Thin Film Preparation Methods / 11.1：
Dip-Coating / 11.2.1：
Spin-Coating / 11.2.2：
Langmuir-Blodgett (LB) Films
Self-Assembled Monolayers / 11.2.4：
Layer-by-Layer Assembly / 11.2.5：
Polymer Brushes: The "Grafting-From" Approach / 11.2.6：
Structuring: The Micro- and Nanostructuring of Thin Films / 11.3：
Photolithography / 11.3.1：
Ion Lithography and FIB Lithography / 11.3.2：
Electron lithography / 11.3.3：
Micro-Contact Printing and Nanoimprinting (NIL) / 11.3.4：
Near-Field Scanning Methods / 11.3.5：
Other Methods / 11.3.6：
Imaging Technologies / 11.4：
The Concept of Total Internal Reflection / 11.4.1：
The Concept of Waveguiding / 11.4.2：
Brewster Angle Microscopy (BAM) / 11.4.3：
Resonant Evanescent Methods / 11.4.4：
Surface Plasmon Resonance Microscopy / 11.4.4.1：
Waveguide Resonance Microscopy / 11.4.4.2：
Surface Plasmon Enhanced Fluorescence Microscopy / 11.4.4.3：
Waveguide Resonance Microscopy with Electro-Optical Response / 11.4.4.4：
Nonresonant Evanescent Methods / 11.4.5：
Total Internal Reflection Fluorescence (TIRF) Microscopy / 11.4.5.1：
Waveguide Scattering Microscopy / 11.4.5.2：
Waveguide Evanescent Field Fluorescence Microscopy (WEFFM) / 11.4.5.3：
Confocal Raman Microscopy and One- and Two-Photon Fluorescence Confocal Microscopy / 11.4.5.4：
Application of Thin Films in the Life Sciences / 11.5：
Sensors / 11.5.1：
Surface Functionalization for Biocompatibility / 11.5.2：
Drug Delivery / 11.5.3：
Bioreactors / 11.5.4：
Cell-Surface Mimicking / 11.5.5：
Summary / 11.6：
Structural Characterization Techniques of Molecular Aggregates, Polymer, and Nanoparticle Films / Takeshi Hasegawa12：
Characterization of Ultrathin Films of Soft Materials / 12.1：
X-Ray Diffraction Analysis / 12.2.1：
Infrared Transmission and Reflection Spectroscopy / 12.2.2：
Multiple-Angle Incidence Resolution Spectrometry (MAIRS) / 12.2.3：
Theoretical Background of MAIRS / 12.2.3.1：
Molecular Orientation Analysis in Polymer Thin Films by IR-MAIRS / 12.2.3.2：
Analysis of Metal Thin Films / 12.2.3.3：
Index
Preface
List of Contributors
Polymer Thin Films for Biomedical Applications / Venkat K. Vendra ; Lin Wu ; Sitaraman Krishnan1：
32.

電子ブック
ＥＢ
32. Architecture-Based Design of Multi-Agent Systems
Danny Weyns
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
Middleware / 1.1.2：
Agent-Oriented Methodologies / 1.2：
Case Study / 1.3：
Overview of the Book / 1.4：
Overview of Architecture-Based Design of Multi-Agent Systems / 2：
General Overview of the Approach / 2.1：
Architectural Design in the Development Life Cycle / 2.1.1：
Steps of Architecture-Based Design of Multi-Agent Systems / 2.1.2：
Functional and Quality Attribute Requirements / 2.2：
Architectural Design / 2.3：
Architectural Patterns / 2.3.1：
ADD Process / 2.3.2：
Middleware Support for Multi-Agent Systems / 2.4：
Documenting Software Architecture / 2.5：
Architectural Views / 2.5.1：
Architectural Description Languages / 2.5.2：
Evaluating Software Architecture / 2.6：
From Software Architecture to Downstream Design and Implementation / 2.7：
Summary / 2.8：
Capturing Expertise in Multi-Agent System Engineering with Architectural Patterns / 3：
Situated Multi-Agent Systems / 3.1：
Single-Agent Systems / 3.1.1：
Multi-Agent Systems / 3.1.2：
Target Domain of the Pattern Language for Situated Multi-Agent Systems / 3.2：
Overview of the Pattern Language / 3.3：
Pattern Template / 3.4：
Virtual Environment / 3.5：
Primary Presentation / 3.5.1：
Architectural Elements / 3.5.2：
Interface Descriptions / 3.5.3：
Design Rationale / 3.5.4：
Situated Agent / 3.6：
Selective Perception / 3.6.1：
Roles and Situated Commitments / 3.7.1：
Free-Flow Trees Extended with Roles and Situated Commitments / 3.8.1：
Protocol-Based Communication / 3.9：
Architectural Design of Multi-Agent Systems / 3.9.1：
Designing and Documenting Multi-Agent System Architectures / 4.1：
Designing and Documenting Architecture in the Development Life Cycle / 4.1.1：
Inputs and Outputs of ADD / 4.1.2：
Overview of the ADD Activities / 4.1.3：
The Domain of Automated Transportation Systems / 4.2：
Business Case / 4.2.2：
System Requirements / 4.2.3：
General Overview of the Design / 4.3：
Challenges at the Outset / 4.3.1：
The System and Its Environment / 4.3.2：
Design Process / 4.3.3：
High-Level Design / 4.3.4：
Architecture Documentation / 4.4：
Introduction to the Architecture Documentation / 4.4.1：
Deployment View / 4.4.2：
Module Uses View / 4.4.3：
Collaborating Components View / 4.4.4：
Middleware for Distributed Multi-Agent Systems / 4.5：
Middleware Support for Distributed, Decentralized Coordination / 5.1：
Middleware in Distributed Software Systems / 5.1.1：
Middleware in Multi-Agent Systems / 5.1.2：
Scope of the Middleware and Requirements / 5.2：
Objectplaces / 5.2.2：
Views / 5.2.3：
Coordination Roles / 5.2.4：
Middleware Architecture / 5.3：
High-Level Module Decomposition / 5.3.1：
Group Formation / 5.3.2：
View Management / 5.3.3：
Role Activation / 5.3.4：
Collision Avoidance in the AGV Transportation System / 5.4：
Collision Avoidance / 5.4.1：
Collision Avoidance Protocol / 5.4.2：
Software Architecture: Communicating Processes for Collision Avoidance / 5.4.3：
Task Assignment / 5.5：
Schedule-Based Task Assignment / 6.1：
FiTA: Field-Based Task Assignment / 6.2：
Coordination Fields / 6.2.1：
Adaptive Task Assignment / 6.2.2：
Dealing With Local Minima / 6.2.3：
DynCNET Protocol / 6.3：
Monitoring the Area of Interest / 6.3.1：
Convergence / 6.3.3：
Synchronization Issues / 6.3.4：
Evaluation / 6.4：
Test Setting / 6.4.1：
Test Results / 6.4.2：
Tradeoff Analysis / 6.4.3：
Evaluation of Multi-Agent System Architectures / 6.5：
Evaluating Multi-Agent System Architectures with ATAM / 7.1：
Architecture Evaluation in the Development Life Cycle / 7.1.1：
Objectives of a Multi-Agent System Architecture Evaluation / 7.1.2：
Overview of the ATAM Activities / 7.1.3：
AGV Transportation System for a Tea Processing Warehouse / 7.2：
Evaluation Process / 7.2.2：
Quality Attribute Workshop / 7.2.3：
Analysis of Architectural Approaches / 7.2.4：
Reflection on ATAM for Evaluating a Multi-Agent System Architecture / 7.3：
ATAM Follow-Up and Demonstrator / 7.4：
Related Approaches / 7.5：
Architectural Approaches and Multi-Agent Systems / 8.1：
Architectural Styles / 8.1.1：
Reference Models and Architectures for Multi-Agent Systems / 8.1.2：
Middleware for Mobile Systems / 8.2：
Work Related to Views / 8.2.1：
Work Related to Coordination Roles / 8.2.2：
Scheduling and Routing of AGV Transportation Systems / 8.3：
AI and Robotics Approaches / 8.3.1：
Multi-Agent System Approaches / 8.3.2：
Conclusions / 9：
Reflection on Architecture-Based Design of Multi-Agent Systems / 9.1：
It Works! / 9.1.1：
Reflection on the Project with Egemin / 9.1.2：
Lessons Learned and Challenges / 9.2：
Dealing with Quality Attributes / 9.2.1：
Designing a Multi-Agent System Architecture / 9.2.2：
Integrating a Multi-Agent System with Its Software Environment / 9.2.3：
Impact of Adopting a Multi-Agent System / 9.2.4：
?-ADL Specification of the Architectural Patterns / A：
Language Constructs / A.1：
Virtual Environment Pattern / A.2：
Situated Agent Pattern / A.3：
Synchronization in the DynCNET Protocol / B：
Synchronization of Abort and Bound Messages / B.1：
Synchronization of Scope Dynamics / B.2：
Overview / C：
Invariant / C.2：
Maintaining the Invariant / C.3：
Glossary
References
Index
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
33.

電子ブック
ＥＢ
33. Human Recognition at a Distance in Video
Bir Bhanu, Ju Han
出版情報: Springer eBooks Computer Science , Springer London, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Gait-Based Individual Recognition at a Distance / Part I：
Introduction / 1：
Key Ideas Described in the Book / 1.1：
Organization of the Book / 1.2：
Gait-Based Individual Recognition at a Distance / Part II：
Gait Representations in Video / 2：
Human Motion Analysis and Representations / 2.1：
Human Activity and Individual Recognition by Gait / 2.2：
Human Recognition by Gait / 2.2.1：
Human Activity Recognition / 2.2.2：
Gait Energy Image (GEI) Representation / 2.3：
Motivation / 2.3.1：
Representation Construction / 2.3.2：
Relationship with MEI and MHI / 2.3.3：
Representation Justification / 2.3.4：
Framework for GEI-Based Recognition / 2.4：
Silhouette Extraction and Processing / 2.4.1：
Feature Extraction / 2.4.2：
Summary / 2.5：
Model-Free Gait-Based Human Recognition in Video / 3：
Statistical Feature Fusion for Human Recognition by Gait / 3.1：
Real and Synthetic Gait Templates / 3.1.1：
Human Recognition / 3.1.2：
Experimental Results / 3.1.3：
Human Recognition Based on Environmental Context / 3.2：
Walking Surface Type Detection / 3.2.1：
Classifier Design / 3.2.2：
View-Insensitive Human Recognition by Gait / 3.2.3：
View-Insensitive Gait Templates / 3.3.1：
Human Repetitive Activity Recognition in Thermal Imagery / 3.3.2：
Object Detection in Thermal Infrared Imagery / 3.4.1：
Human Repetitive Activity Representation and Recognition / 3.4.2：
Human Recognition Under Different Carrying Conditions / 3.4.3：
Technical Approach / 3.5.1：
Discrimination Analysis for Model-Based Gait Recognition / 3.5.2：
Predicting Human Recognition Performance / 4.1：
Algorithm Dependent Prediction and Performance Bounds / 4.2：
Body Part Length Distribution / 4.2.1：
Algorithm Dependent Performance Prediction / 4.2.2：
Upper Bound on PCR / 4.2.3：
Model-Based Human Recognition-2D and 3D Gait / 4.3：
2D Gait Recognition (3D Model, 2D Data) / 5.1：
3D Human Modeling / 5.1.1：
Human Recognition from Single Non-calibrated Camera / 5.1.2：
Human Recognition from Multiple Calibrated Cameras / 5.1.3：
Gait Recognition in 3D / 5.2：
Individual Recognition by Gait in 3D / 5.2.1：
Related Work / 5.2.2：
Fusion of Color/Infrared Video for Human Detection / 5.2.3：
Hierarchical Image Registration and Fusion Approach / 6.1：
Image Transformation Model / 6.2.1：
Preliminary Human Silhouette Extraction and Correspondence Initialization / 6.2.2：
Automatic Image Registration / 6.2.3：
Sensor Fusion / 6.2.4：
Registration of EO/IR Sequences with Multiple Objects / 6.2.5：
Image Registration Results / 6.3：
Sensor Fusion Results / 6.3.2：
Face Recognition at a Distance in Video / 6.4：
Super-Resolution of Facial Images in Video at a Distance / 7：
Closed-Loop Super-Resolution of Face Images in Video / 7.1：
Super-Resolution of Facial Images with Expression Changes in Video / 7.1.1：
Constructing Enhanced Side Face Images from Video / 7.2.1：
Enhanced Side Face Image (ESFI) Construction / 7.3.1：
Evaluating Quality of Super-Resolved Face Images / 7.3.2：
Image Quality Indices / 8.1：
Integrated Image Quality Index / 8.2：
Experimental Results for Face Recognition in Video / 8.2.1：
Experiment 1: Influence of Pose Variation on the Super-Resolved Face Image / 8.3.1：
Experiment 2: Influence of Lighting Variation on the Super-Resolved Face Image / 8.3.2：
Experiment 3: Influence of Facial Expression Variation on the Super-Resolved Face Image / 8.3.3：
Experiment 4: Influence of the Number of Images Used for Constructing the Super-Resolved Face Image for Face Recognition / 8.3.4：
Discussion / 8.3.5：
Integrated Face and Gait for Human Recognition at a Distance in Video / 8.4：
Integrating Face Profile and Gait at a Distance / 9：
High-Resolution Image Construction for Face Profile / 9.1：
Face Profile Representation and Matching / 9.2.2：
Gait Recognition / 9.2.3：
Integrating Face Profile and Gait for Recognition at a Distance / 9.2.4：
Face Profile-Based Recognition / 9.3：
Integrating Face Profile With Gait / 9.3.2：
Match Score Level Fusion of Face and Gait at a Distance / 9.4：
Enhanced Side Face Image Construction / 10.1：
Gait Energy Image Construction / 10.3.2：
Human Recognition Using ESFI and GEI / 10.3.3：
Experimental Results and Performance Analysis / 10.4：
Experiments and Parameters / 10.4.1：
Performance Analysis / 10.4.2：
Feature Level Fusion of Face and Gait at a Distance / 10.5：
Human Identification Using ESFI and GEI / 11.1：
The Related Fusion Schemes / 11.3：
Fusion at the Match Score Level [209] / 11.3.1：
Fusion at the Feature Level [207] / 11.3.2：
Experimental Results and Comparisons / 11.4：
Discussion on Experiments / 11.4.1：
Conclusions for Integrated Gait and Face for Human Recognition at a Distance in Video / 11.5：
Conclusions and Future Work / 12：
Gait-Based Human Recognition at a Distance / 12.1：
Video-Based Human Recognition at a Distance / 12.1.2：
Fusion of Face and Gait for Human Recognition at Distance / 12.1.3：
Future Research Directions / 12.2：
References
Index
Introduction to Gait-Based Individual Recognition at a Distance / Part I：
Introduction / 1：
Key Ideas Described in the Book / 1.1：
34.

電子ブック
ＥＢ
34. Markets with transaction costs : mathematical theory (: electronic bk)
Yuri Kabanov, Mher Safarian
出版情報: [Berlin ; Heidelberg] : Springer, [201-]  1 online resource (xiv, 294 p.)
シリーズ名: Springer finance
所蔵情報: loading…
目次情報: 続きを見る
Approximative Hedging / 1：
Black-Scholes Formula Revisited / 1.1：
Pricing by Replication / 1.1.1：
Explicit Formulae / 1.1.2：
Discussion / 1.1.3：
Leland-Lott Theorem / 1.2：
Formulation and Comments / 1.2.1：
Proof / 1.2.2：
Constant Coefficient: Discripancy / 1.3：
Main Result / 1.3.1：
Pergamenshchikov Theorem / 1.3.2：
Rate of Convergence of the Replications Error / 1.4：
Formulation / 1.4.1：
Preparatory Manipulations / 1.4.2：
Convenient Representations, Explicit Formulae, and Useful Bounds / 1.4.3：
Tools / 1.4.4：
Analysis of the Principal Terms: Proof of Proposition 1.4.5 / 1.4.5：
Asymptotics of Gaussian Integrals / 1.4.6：
Functional Limit Theorem for ? = 1/2 / 1.5：
Limit Theorem for Semimartingale Scheme / 1.5.1：
Problem Reformulation / 1.5.3：
Tightness / 1.5.4：
Limit Measure / 1.5.5：
Identification of the Limit / 1.5.6：
Superhedging by Buy-and-Hold / 1.6：
Levental-Skorokhod Theorem / 1.6.1：
Extensions for One-Side Transaction Costs / 1.6.2：
Hedging of Vector-Valued Contingent Claims / 1.6.4：
Arbitrage Theory for Frictionless Markets / 2：
Models without Friction / 2.1：
DMW Theorem / 2.1.1：
Auxiliary Results: Measurable Subsequences and the Kreps-Yan Theorem / 2.1.2：
Proof of the DMW Theorem / 2.1.3：
Fast Proof of the DMW Theorem / 2.1.4：
NA and Conditional Distributions of Price Increments / 2.1.5：
Comment on Absolute Continuous Martingale Measures / 2.1.6：
Complete Markets and Replicable contingent Claims / 2.1.7：
DMW Theorem with Restricted Information / 2.1.8：
Hedging Theorem for American-Type Options / 2.1.9：
Stochastic Discounting Factors / 2.1.10：
Optional Decomposition Theorem / 2.1.11：
Martingale Measures with Bounded Densities / 2.1.13：
Utility Maximization and convex Duality / 2.1.14：
Discrete-Time Infinite-Horizon Model / 2.2：
Martingale Measures in Infinite-Horizon Model / 2.2.1：
No Free Lunch for Models with Infinite Time Horizon / 2.2.2：
No Free Lunch with Vanishing Risk / 2.2.3：
Example: "Retiring" Process / 2.2.4：
The Delbaen-Schachemayer Theory in Continuous Time / 2.2.5：
Arbitrage Theory under Transaction Costs / 3：
Models with Transaction Costs / 3.1：
Basic Model / 3.1.1：
Variants / 3.1.2：
No-arbitrage Problem: Abstract Approach / 3.1 3：
The Grigoriev Theorem / 3.2.1：
Counterexamples / 3.2.4：
A Complement: The Rásonyi Theorem / 3.2.5：
Arbitrage Opportunities of the Second Kind / 3.2.6：
Hedging of European Options / 3.3：
Hedging Theorem: Finite ? / 3.3.1：
Hedging Theorem: Discrete Time, Arbitrary ? / 3.3.2：
Hedging of American Options / 3.4：
American Options: Finite ? / 3.4.1：
American Options: Arbitrary ? / 3.4.2：
Complementary Results and Comments / 3.4.3：
Ramifications / 3.5：
Models with Incomplete Information / 3.5.1：
No Arbitrage Criteria: Finite ? / 3.5.2：
No Arbitrage Criteria: Arbitrary ? / 3.5.3：
Hedging Theorem / 3.5.4：
Hedging Theorems: Continuous Time / 3.6：
Introductory Comments / 3.6.1：
Model Specification / 3.6.2：
Hedging Theorem in Abstract Setting / 3.6.3：
Hedging Theorem: Proof / 3.6.4：
Rásonyi Counterexample / 3.6.5：
Campi-Schachermayer Model / 3.6.6：
Hedging Theorem for American Options / 3.6.7：
When Does a Consistent Price System Exits? / 3.6.8：
Asymptotic Arbitrage Opportunities of the Second Kind / 3.7：
Consumption-Investment Problems / 4：
Consumption-Investment without Friction / 4.1：
The Merton Problem / 4.1.1：
The HJB Equation and a Verification Theorem / 4.1.2：
Proof of the Merton Theorem / 4.1.3：
Robustness of the Merton Solution / 4.1.4：
Consumption-Investment under Transaction Costs / 4.2：
The Model / 4.2.1：
Goal Functionals / 4.2.2：
The Hamilton-Jacobi-Bellman Equation / 4.2.3：
Viscosity Solution / 4.2.4：
Ishii's Lemma / 4.2.5：
Uniqueness of the Solution and Lyapunov Functions / 4.3：
Uniqueness Theorem / 4.3.1：
Existence of Lyapunov Function and Classical Supersolutions / 4.3 2：
Supersolutions and Properties of the Bellman Function / 4.4：
When is W Finite on K? / 4.4.1：
Strict Local Supersolutions / 4.4.2：
Dynamic Programming Principle / 4.5：
The Bellman Function and the HJB Euation / 4.6：
Properties of the Bellman Function / 4.7：
The Subdifferential: Gneralities / 4.7.1：
The Bellman Function of the Two-Asset Model / 4.7.2：
Lower Bounds for the Bellman Function / 4.7.3：
The Davis-Norman Solution / 4.8：
Two-Asset Model: The Result / 4.8.1：
Structure of Bellman Function / 4.8.2：
Study of the Scalar Problem / 4.8.3：
Skorohod Problem / 4.8.4：
Optimal Strategy / 4.8.5：
Precisions on the No-Transaction Region / 4.8.6：
Liquidity Premium / 4.9：
Non-Robustness with Respect to Transaction Costs / 4.9.1：
First-Order Asymptotic Expansion / 4.9.2：
Exceptional Case: ? = 1 / 4.9.3：
Appendix / 5：
Facts from Convex Analysis / 5.1：
Césaro Convergence / 5.2：
Komló Theorem / 5.2.1：
Von Weizsäcker Theorem / 5.2.2：
Delbaen-Schachermayer Lemma / 5.2.4：
Facts from Probability / 5.3：
Essential Supremum / 5.3.1：
Generalized Martingales / 5.3.2：
Equivalent Probabilities / 5.3.3：
Snell Envelopes of Q-Martingales / 5.3.4：
Measurable Selection / 5.4：
Skorokhod Problem and SDE with Reflections / 5.5：
Deterministic Skorokhod Problem / 5.6.1：
Skorokhod Mapping / 5.6.2：
Stochastic Skorokhod Problem / 5.6.3：
Bibliographical Comments
References
Index
Approximative Hedging / 1：
Black-Scholes Formula Revisited / 1.1：
Pricing by Replication / 1.1.1：
35.

電子ブック
ＥＢ
35. Architecture-Based Design of Multi-Agent Systems
Danny Weyns
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
Middleware / 1.1.2：
Agent-Oriented Methodologies / 1.2：
Case Study / 1.3：
Overview of the Book / 1.4：
Overview of Architecture-Based Design of Multi-Agent Systems / 2：
General Overview of the Approach / 2.1：
Architectural Design in the Development Life Cycle / 2.1.1：
Steps of Architecture-Based Design of Multi-Agent Systems / 2.1.2：
Functional and Quality Attribute Requirements / 2.2：
Architectural Design / 2.3：
Architectural Patterns / 2.3.1：
ADD Process / 2.3.2：
Middleware Support for Multi-Agent Systems / 2.4：
Documenting Software Architecture / 2.5：
Architectural Views / 2.5.1：
Architectural Description Languages / 2.5.2：
Evaluating Software Architecture / 2.6：
From Software Architecture to Downstream Design and Implementation / 2.7：
Summary / 2.8：
Capturing Expertise in Multi-Agent System Engineering with Architectural Patterns / 3：
Situated Multi-Agent Systems / 3.1：
Single-Agent Systems / 3.1.1：
Multi-Agent Systems / 3.1.2：
Target Domain of the Pattern Language for Situated Multi-Agent Systems / 3.2：
Overview of the Pattern Language / 3.3：
Pattern Template / 3.4：
Virtual Environment / 3.5：
Primary Presentation / 3.5.1：
Architectural Elements / 3.5.2：
Interface Descriptions / 3.5.3：
Design Rationale / 3.5.4：
Situated Agent / 3.6：
Selective Perception / 3.6.1：
Roles and Situated Commitments / 3.7.1：
Free-Flow Trees Extended with Roles and Situated Commitments / 3.8.1：
Protocol-Based Communication / 3.9：
Architectural Design of Multi-Agent Systems / 3.9.1：
Designing and Documenting Multi-Agent System Architectures / 4.1：
Designing and Documenting Architecture in the Development Life Cycle / 4.1.1：
Inputs and Outputs of ADD / 4.1.2：
Overview of the ADD Activities / 4.1.3：
The Domain of Automated Transportation Systems / 4.2：
Business Case / 4.2.2：
System Requirements / 4.2.3：
General Overview of the Design / 4.3：
Challenges at the Outset / 4.3.1：
The System and Its Environment / 4.3.2：
Design Process / 4.3.3：
High-Level Design / 4.3.4：
Architecture Documentation / 4.4：
Introduction to the Architecture Documentation / 4.4.1：
Deployment View / 4.4.2：
Module Uses View / 4.4.3：
Collaborating Components View / 4.4.4：
Middleware for Distributed Multi-Agent Systems / 4.5：
Middleware Support for Distributed, Decentralized Coordination / 5.1：
Middleware in Distributed Software Systems / 5.1.1：
Middleware in Multi-Agent Systems / 5.1.2：
Scope of the Middleware and Requirements / 5.2：
Objectplaces / 5.2.2：
Views / 5.2.3：
Coordination Roles / 5.2.4：
Middleware Architecture / 5.3：
High-Level Module Decomposition / 5.3.1：
Group Formation / 5.3.2：
View Management / 5.3.3：
Role Activation / 5.3.4：
Collision Avoidance in the AGV Transportation System / 5.4：
Collision Avoidance / 5.4.1：
Collision Avoidance Protocol / 5.4.2：
Software Architecture: Communicating Processes for Collision Avoidance / 5.4.3：
Task Assignment / 5.5：
Schedule-Based Task Assignment / 6.1：
FiTA: Field-Based Task Assignment / 6.2：
Coordination Fields / 6.2.1：
Adaptive Task Assignment / 6.2.2：
Dealing With Local Minima / 6.2.3：
DynCNET Protocol / 6.3：
Monitoring the Area of Interest / 6.3.1：
Convergence / 6.3.3：
Synchronization Issues / 6.3.4：
Evaluation / 6.4：
Test Setting / 6.4.1：
Test Results / 6.4.2：
Tradeoff Analysis / 6.4.3：
Evaluation of Multi-Agent System Architectures / 6.5：
Evaluating Multi-Agent System Architectures with ATAM / 7.1：
Architecture Evaluation in the Development Life Cycle / 7.1.1：
Objectives of a Multi-Agent System Architecture Evaluation / 7.1.2：
Overview of the ATAM Activities / 7.1.3：
AGV Transportation System for a Tea Processing Warehouse / 7.2：
Evaluation Process / 7.2.2：
Quality Attribute Workshop / 7.2.3：
Analysis of Architectural Approaches / 7.2.4：
Reflection on ATAM for Evaluating a Multi-Agent System Architecture / 7.3：
ATAM Follow-Up and Demonstrator / 7.4：
Related Approaches / 7.5：
Architectural Approaches and Multi-Agent Systems / 8.1：
Architectural Styles / 8.1.1：
Reference Models and Architectures for Multi-Agent Systems / 8.1.2：
Middleware for Mobile Systems / 8.2：
Work Related to Views / 8.2.1：
Work Related to Coordination Roles / 8.2.2：
Scheduling and Routing of AGV Transportation Systems / 8.3：
AI and Robotics Approaches / 8.3.1：
Multi-Agent System Approaches / 8.3.2：
Conclusions / 9：
Reflection on Architecture-Based Design of Multi-Agent Systems / 9.1：
It Works! / 9.1.1：
Reflection on the Project with Egemin / 9.1.2：
Lessons Learned and Challenges / 9.2：
Dealing with Quality Attributes / 9.2.1：
Designing a Multi-Agent System Architecture / 9.2.2：
Integrating a Multi-Agent System with Its Software Environment / 9.2.3：
Impact of Adopting a Multi-Agent System / 9.2.4：
?-ADL Specification of the Architectural Patterns / A：
Language Constructs / A.1：
Virtual Environment Pattern / A.2：
Situated Agent Pattern / A.3：
Synchronization in the DynCNET Protocol / B：
Synchronization of Abort and Bound Messages / B.1：
Synchronization of Scope Dynamics / B.2：
Overview / C：
Invariant / C.2：
Maintaining the Invariant / C.3：
Glossary
References
Index
Introduction / 1：
Software Architecture and Middleware / 1.1：
Software Architecture / 1.1.1：
36.

電子ブック
ＥＢ
36. Human Recognition at a Distance in Video
Bir Bhanu, Ju Han
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Gait-Based Individual Recognition at a Distance / Part I：
Introduction / 1：
Key Ideas Described in the Book / 1.1：
Organization of the Book / 1.2：
Gait-Based Individual Recognition at a Distance / Part II：
Gait Representations in Video / 2：
Human Motion Analysis and Representations / 2.1：
Human Activity and Individual Recognition by Gait / 2.2：
Human Recognition by Gait / 2.2.1：
Human Activity Recognition / 2.2.2：
Gait Energy Image (GEI) Representation / 2.3：
Motivation / 2.3.1：
Representation Construction / 2.3.2：
Relationship with MEI and MHI / 2.3.3：
Representation Justification / 2.3.4：
Framework for GEI-Based Recognition / 2.4：
Silhouette Extraction and Processing / 2.4.1：
Feature Extraction / 2.4.2：
Summary / 2.5：
Model-Free Gait-Based Human Recognition in Video / 3：
Statistical Feature Fusion for Human Recognition by Gait / 3.1：
Real and Synthetic Gait Templates / 3.1.1：
Human Recognition / 3.1.2：
Experimental Results / 3.1.3：
Human Recognition Based on Environmental Context / 3.2：
Walking Surface Type Detection / 3.2.1：
Classifier Design / 3.2.2：
View-Insensitive Human Recognition by Gait / 3.2.3：
View-Insensitive Gait Templates / 3.3.1：
Human Repetitive Activity Recognition in Thermal Imagery / 3.3.2：
Object Detection in Thermal Infrared Imagery / 3.4.1：
Human Repetitive Activity Representation and Recognition / 3.4.2：
Human Recognition Under Different Carrying Conditions / 3.4.3：
Technical Approach / 3.5.1：
Discrimination Analysis for Model-Based Gait Recognition / 3.5.2：
Predicting Human Recognition Performance / 4.1：
Algorithm Dependent Prediction and Performance Bounds / 4.2：
Body Part Length Distribution / 4.2.1：
Algorithm Dependent Performance Prediction / 4.2.2：
Upper Bound on PCR / 4.2.3：
Model-Based Human Recognition-2D and 3D Gait / 4.3：
2D Gait Recognition (3D Model, 2D Data) / 5.1：
3D Human Modeling / 5.1.1：
Human Recognition from Single Non-calibrated Camera / 5.1.2：
Human Recognition from Multiple Calibrated Cameras / 5.1.3：
Gait Recognition in 3D / 5.2：
Individual Recognition by Gait in 3D / 5.2.1：
Related Work / 5.2.2：
Fusion of Color/Infrared Video for Human Detection / 5.2.3：
Hierarchical Image Registration and Fusion Approach / 6.1：
Image Transformation Model / 6.2.1：
Preliminary Human Silhouette Extraction and Correspondence Initialization / 6.2.2：
Automatic Image Registration / 6.2.3：
Sensor Fusion / 6.2.4：
Registration of EO/IR Sequences with Multiple Objects / 6.2.5：
Image Registration Results / 6.3：
Sensor Fusion Results / 6.3.2：
Face Recognition at a Distance in Video / 6.4：
Super-Resolution of Facial Images in Video at a Distance / 7：
Closed-Loop Super-Resolution of Face Images in Video / 7.1：
Super-Resolution of Facial Images with Expression Changes in Video / 7.1.1：
Constructing Enhanced Side Face Images from Video / 7.2.1：
Enhanced Side Face Image (ESFI) Construction / 7.3.1：
Evaluating Quality of Super-Resolved Face Images / 7.3.2：
Image Quality Indices / 8.1：
Integrated Image Quality Index / 8.2：
Experimental Results for Face Recognition in Video / 8.2.1：
Experiment 1: Influence of Pose Variation on the Super-Resolved Face Image / 8.3.1：
Experiment 2: Influence of Lighting Variation on the Super-Resolved Face Image / 8.3.2：
Experiment 3: Influence of Facial Expression Variation on the Super-Resolved Face Image / 8.3.3：
Experiment 4: Influence of the Number of Images Used for Constructing the Super-Resolved Face Image for Face Recognition / 8.3.4：
Discussion / 8.3.5：
Integrated Face and Gait for Human Recognition at a Distance in Video / 8.4：
Integrating Face Profile and Gait at a Distance / 9：
High-Resolution Image Construction for Face Profile / 9.1：
Face Profile Representation and Matching / 9.2.2：
Gait Recognition / 9.2.3：
Integrating Face Profile and Gait for Recognition at a Distance / 9.2.4：
Face Profile-Based Recognition / 9.3：
Integrating Face Profile With Gait / 9.3.2：
Match Score Level Fusion of Face and Gait at a Distance / 9.4：
Enhanced Side Face Image Construction / 10.1：
Gait Energy Image Construction / 10.3.2：
Human Recognition Using ESFI and GEI / 10.3.3：
Experimental Results and Performance Analysis / 10.4：
Experiments and Parameters / 10.4.1：
Performance Analysis / 10.4.2：
Feature Level Fusion of Face and Gait at a Distance / 10.5：
Human Identification Using ESFI and GEI / 11.1：
The Related Fusion Schemes / 11.3：
Fusion at the Match Score Level [209] / 11.3.1：
Fusion at the Feature Level [207] / 11.3.2：
Experimental Results and Comparisons / 11.4：
Discussion on Experiments / 11.4.1：
Conclusions for Integrated Gait and Face for Human Recognition at a Distance in Video / 11.5：
Conclusions and Future Work / 12：
Gait-Based Human Recognition at a Distance / 12.1：
Video-Based Human Recognition at a Distance / 12.1.2：
Fusion of Face and Gait for Human Recognition at Distance / 12.1.3：
Future Research Directions / 12.2：
References
Index
Introduction to Gait-Based Individual Recognition at a Distance / Part I：
Introduction / 1：
Key Ideas Described in the Book / 1.1：
37.

電子ブック
ＥＢ
37. Network Intrusion Detection and Prevention
Ali Ghorbani, Ali A. Ghorbani, Wei Lu, Mahbod Tavallaee
出版情報: Springer eBooks Computer Science , Springer US, 2010
所蔵情報: loading…
目次情報: 続きを見る
Network Attacks / 1：
Attack Taxonomies / 1.1：
Probes / 1.2：
EPSweep and PortSweep / 1.2.1：
NMap / 1.2.2：
MScan / 1.2.3：
SAINT / 1.2.4：
Satan / 1.2.5：
Privilege Escalation Attacks / 1.3：
Buffer Overflow Attacks / 1.3.1：
Misconfiguration Attacks / 1.3.2：
Race-condition Attacks / 1.3.3：
Man-in-the-Middle Attacks / 1.3.4：
Social Engineering Attacks / 1.3.5：
Denial of Service (DoS) and Distributed Denial of Service (DDoS) Attacks / 1.4：
Detection Approaches for DoS and DDoS Attacks / 1.4.1：
Prevention and Response for DoS and DDoS Attacks / 1.4.2：
Examples of DoS and DDoS Attacks / 1.4.3：
Worms Attacks / 1.5：
Modeling and Analysis of Worm Behaviors / 1.5.1：
Detection and Monitoring of Worm Attacks / 1.5.2：
Worms Containment / 1.5.3：
Examples of Well Known Worm Attacks / 1.5.4：
Routing Attacks / 1.6：
OSPF Attacks / 1.6.1：
BGP Attacks / 1.6.2：
References
Detection Approaches / 2：
Misuse Detection / 2.1：
Pattern Matching / 2.1.1：
Rule-based Techniques / 2.1.2：
State-based Techniques / 2.1.3：
Techniques based on Data Mining / 2.1.4：
Anomaly Detection / 2.2：
Advanced Statistical Models / 2.2.1：
Rule based Techniques / 2.2.2：
Biological Models / 2.2.3：
Learning Models / 2.2.4：
Specification-based Detection / 2.3：
Hybrid Detection / 2.4：
Data Collection / 3：
Data Collection for Host-Based IDSs / 3.1：
Audit Logs / 3.1.1：
System Call Sequences / 3.1.2：
Data Collection for Network-Based IDSs / 3.2：
SNMP / 3.2.1：
Packets / 3.2.2：
Limitations of Network-Based IDSs / 3.2.3：
Data Collection for Application-Based IDSs / 3.3：
Data Collection for Application-Integrated IDSs / 3.4：
Hybrid Data Collection / 3.5：
Theoretical Foundation of Detection / 4：
Taxonomy of Anomaly Detection Systems / 4.1：
Fuzzy Logic / 4.2：
Fuzzy Logic in Anomaly Detection / 4.2.1：
Bayes Theory / 4.3：
Naive Bayes Classifier / 4.3.1：
Bayes Theory in Anomaly Detection / 4.3.2：
Artificial Neural Networks / 4.4：
Processing Elements / 4.4.1：
Connections / 4.4.2：
Network Architectures / 4.4.3：
Learning Process / 4.4.4：
Artificial Neural Networks in Anomaly Detection / 4.4.5：
Support Vector Machine (SVM) / 4.5：
Support Vector Machine in Anomaly Detection / 4.5.1：
Evolutionary Computation / 4.6：
Evolutionary Computation in Anomaly Detection / 4.6.1：
Association Rules / 4.7：
The Apriori Algorithm / 4.7.1：
Association Rules in Anomaly Detection / 4.7.2：
Clustering / 4.8：
Taxonomy of Clustering Algorithms / 4.8.1：
K-Means Clustering / 4.8.2：
Y-Means Clustering / 4.8.3：
Maximum-Likelihood Estimates / 4.8.4：
Unsupervised Learning of Gaussian Data / 4.8.5：
Clustering Based on Density Distribution Functions / 4.8.6：
Clustering in Anomaly Detection / 4.8.7：
Signal Processing Techniques Based Models / 4.9：
Comparative Study of Anomaly Detection Techniques / 4.10：
Architecture and Implementation / 5：
Centralized / 5.1：
Distributed / 5.2：
Intelligent Agents / 5.2.1：
Mobile Agents / 5.2.2：
Cooperative Intrusion Detection / 5.3：
Alert Management and Correlation / 6：
Data Fusion / 6.1：
Alert Correlation / 6.2：
Preprocess / 6.2.1：
Correlation Techniques / 6.2.2：
Postprocess / 6.2.3：
Alert Correlation Architectures / 6.2.4：
Validation of Alert Correlation Systems / 6.2.5：
Basic Principles of Information Sharing / 6.3：
Cooperation Based on Goal-tree Representation of Attack Strategies / 6.3.2：
Cooperative Discovery of Intrusion Chain / 6.3.3：
Abstraction-Based Intrusion Detection / 6.3.4：
Interest-Biased Communication and Cooperation / 6.3.5：
Agent-Based Cooperation / 6.3.6：
Secure Communication Using Public-key Encryption / 6.3.7：
Evaluation Criteria / 7：
Accuracy / 7.1：
False Positive and Negative / 7.1.1：
Confusion Matrix / 7.1.2：
Precision, Recall, and F-Measure / 7.1.3：
ROC Curves / 7.1.4：
The Base-Rate Fallacy / 7.1.5：
Performance / 7.2：
Completeness / 7.3：
Timely Response / 7.4：
Adaptation and Cost-Sensitivity / 7.5：
Intrusion Tolerance and Attack Resistance / 7.6：
Redundant and Fault Tolerance Design / 7.6.1：
Obstructing Methods / 7.6.2：
Test, Evaluation and Data Sets / 7.7：
Intrusion Response / 8：
Response Type / 8.1：
Passive Alerting and Manual Response / 8.1.1：
Active Response / 8.1.2：
Response Approach / 8.2：
Decision Analysis / 8.2.1：
Control Theory / 8.2.2：
Game theory / 8.2.3：
Fuzzy theory / 8.2.4：
Survivability and Intrusion Tolerance / 8.3：
Examples of Commercial and Open Source IDSs / A：
Bro Intrusion Detection System / A.l：
Prelude Intrusion Detection System / A.2：
Snort Intrusion Detection System / A.3：
Ethereal Application - Network Protocol Analyzer / A.4：
Multi Router Traffic Grapher (MRTG) / A.5：
Tamandua Network Intrusion Detection System / A.6：
Other Commercial IDSs / A.7：
Index
Network Attacks / 1：
Attack Taxonomies / 1.1：
Probes / 1.2：
38.

電子ブック
ＥＢ
38. Computational lithography (: electronic bk)
Xu Ma and Gonzalo R. Arce
出版情報: [Hoboken, N.J.] : Wiley Online Library, 2010  1 online resource (xv, 226 p.)
シリーズ名: Wiley series in pure and applied optics ;
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
Acronyms
Introduction / 1：
Optical Lithography / 1.1：
Optical Lithography and Integrated Circuits / 1.1.1：
Brief History of Optical Lithography Systems / 1.1.2：
Rayleigh's Resolution / 1.2：
Resist Processes and Characteristics / 1.3：
Techniques in Computational Lithography / 1.4：
Optical Proximity Correction / 1.4.1：
Phase-Shifting Masks / 1.4.2：
Off-Axis Illumination / 1.4.3：
Second-Generation RETs / 1.4.4：
Outline / 1.5：
Optical Lithography Systems / 2：
Partially Coherent Imaging Systems / 2.1：
Abbe's Model / 2.1.1：
Hopkins Diffraction Model / 2.1.2：
Coherent and Incoherent Imaging Systems / 2.1.3：
Approximation Models / 2.2：
Fourier Series Expansion Model / 2.2.1：
Singular Value Decomposition Model / 2.2.2：
Average Coherent Approximation Model / 2.2.3：
Discussion and Comparison / 2.2.4：
Summary / 2.3：
Rule-Based Resolution Enhancement Techniques / 3：
RET Types / 3.1：
Rule-Based RETs / 3.1.1：
Model-Based RETs / 3.1.2：
Hybrid RETs / 3.1.3：
Rule-Based OPC / 3.2：
Catastrophic OPC / 3.2.1：
One-Dimensional OPC / 3.2.2：
Line-Shortening Reduction OPC / 3.2.3：
Two-Dimensional OPC / 3.2.4：
Rule-Based PSM / 3.3：
Dark-Field Application / 3.3.1：
Light-Field Application / 3.3.2：
Rule-Based OAI / 3.4：
Fundamentals of Optimization / 3.5：
Definition and Classification / 4.1：
Definitions in the Optimization Problem / 4.1.1：
Classification of Optimization Problems / 4.1.2：
Unconstrained Optimization / 4.2：
Solution of Unconstrained Optimization Problem / 4.2.1：
Unconstrained Optimization Algorithms / 4.2.2：
Computational Lithography with Coherent Illumination / 4.3：
Problem Formulation / 5.1：
OPC Optimization / 5.2：
OPC Design Algorithm / 5.2.1：
Simulations / 5.2.2：
Two-Phase PSM Optimization / 5.3：
Two-Phase PSM Design Algorithm / 5.3.1：
Generalized PSM Optimization / 5.3.2：
Generalized PSM Design Algorithm / 5.4.1：
Resist Modeling Effects / 5.4.2：
Regularization Framework / 5.6：
Discretization Penalty / 6.1：
Discretization Penalty for OPC Optimization / 6.1.1：
Discretization Penalty for Two-Phase PSM Optimization / 6.1.2：
Discretization Penalty for Generalized PSM Optimization / 6.1.3：
Complexity Penalty / 6.2：
Total Variation Penalty / 6.2.1：
Global Wavelet Penalty / 6.2.2：
Localized Wavelet Penalty / 6.2.3：
Computational Lithography with Partially Coherent Illumination / 6.3：
OPC Design Algorithm Using the Fourier Series Expansion Model / 7.1：
Simulations Using the Fourier Series Expansion Model / 7.1.2：
OPC Design Algorithm Using the Average Coherent Approximation Model / 7.1.3：
Simulations Using the Average Coherent Approximation Model / 7.1.4：
PSM Optimization / 7.1.5：
PSM Design Algorithm Using the Singular Value Decomposition Model / 7.2.1：
Discretization Regularization for PSM Design Algorithm / 7.2.2：
Other RET Optimization Techniques / 7.2.3：
Double-Patterning Method / 8.1：
Post-Processing Based on 2D DCT / 8.2：
Photoresist Tone Reversing Method / 8.3：
Source and Mask Optimization / 8.4：
Lithography Preliminaries / 9.1：
Topological Constraint / 9.2：
Source-Mask Optimization Algorithm / 9.3：
Coherent Thick-Mask Optimization / 9.4：
Kirchhoff Boundary Conditions / 10.1：
Boundary Layer Model / 10.2：
Boundary Layer Model in Coherent Imaging Systems / 10.2.1：
Boundary Layer Model in Partially Coherent Imaging Systems / 10.2.2：
OPC Optimization Algorithm Based on BL Model Under Coherent Illumination / 10.3：
PSM Optimization Algorithm Based on BL Model Under Coherent Illumination / 10.4.3：
Conclusions and New Directions of Computational Lithography / 10.5.3：
Conclusion / 11.1：
New Directions of Computational Lithography / 11.2：
OPC Optimization for the Next-Generation Lithography Technologies / 11.2.1：
Initialization Approach for the Inverse Lithography Optimization / 11.2.2：
Double Patterning and Double Exposure Methods in Partially Coherent Imaging System / 11.2.3：
OPC and PSM Optimizations for Inverse Lithography Based on Rigorous Mask Models in Partially Coherent Imaging System / 11.2.4：
Simultaneous Source and Mask Optimization for Inverse Lithography Based on Rigorous Mask Models / 11.2.5：
Investigation of Factors Influencing the Complexity of the OPC and PSM Optimization Algorithms / 11.2.6：
Formula Derivation in Chapter 5 / Appendix A：
Manhattan Geometry / Appendix B：
Formula Derivation in Chapter 6 / Appendix C：
Formula Derivation in Chapter 7 / Appendix D：
Formula Derivation in Chapter 8 / Appendix E：
Formula Derivation in Chapter 9 / Appendix F：
Formula Derivation in Chapter 10 / Appendix G：
Software Guide / Appendix H：
References
Index
Preface
Acknowledgments
Acronyms
39.

電子ブック
ＥＢ
39. Network Intrusion Detection and Prevention
Ali Ghorbani, Ali A. Ghorbani, Wei Lu, Mahbod Tavallaee
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2010
所蔵情報: loading…
目次情報: 続きを見る
Network Attacks / 1：
Attack Taxonomies / 1.1：
Probes / 1.2：
EPSweep and PortSweep / 1.2.1：
NMap / 1.2.2：
MScan / 1.2.3：
SAINT / 1.2.4：
Satan / 1.2.5：
Privilege Escalation Attacks / 1.3：
Buffer Overflow Attacks / 1.3.1：
Misconfiguration Attacks / 1.3.2：
Race-condition Attacks / 1.3.3：
Man-in-the-Middle Attacks / 1.3.4：
Social Engineering Attacks / 1.3.5：
Denial of Service (DoS) and Distributed Denial of Service (DDoS) Attacks / 1.4：
Detection Approaches for DoS and DDoS Attacks / 1.4.1：
Prevention and Response for DoS and DDoS Attacks / 1.4.2：
Examples of DoS and DDoS Attacks / 1.4.3：
Worms Attacks / 1.5：
Modeling and Analysis of Worm Behaviors / 1.5.1：
Detection and Monitoring of Worm Attacks / 1.5.2：
Worms Containment / 1.5.3：
Examples of Well Known Worm Attacks / 1.5.4：
Routing Attacks / 1.6：
OSPF Attacks / 1.6.1：
BGP Attacks / 1.6.2：
References
Detection Approaches / 2：
Misuse Detection / 2.1：
Pattern Matching / 2.1.1：
Rule-based Techniques / 2.1.2：
State-based Techniques / 2.1.3：
Techniques based on Data Mining / 2.1.4：
Anomaly Detection / 2.2：
Advanced Statistical Models / 2.2.1：
Rule based Techniques / 2.2.2：
Biological Models / 2.2.3：
Learning Models / 2.2.4：
Specification-based Detection / 2.3：
Hybrid Detection / 2.4：
Data Collection / 3：
Data Collection for Host-Based IDSs / 3.1：
Audit Logs / 3.1.1：
System Call Sequences / 3.1.2：
Data Collection for Network-Based IDSs / 3.2：
SNMP / 3.2.1：
Packets / 3.2.2：
Limitations of Network-Based IDSs / 3.2.3：
Data Collection for Application-Based IDSs / 3.3：
Data Collection for Application-Integrated IDSs / 3.4：
Hybrid Data Collection / 3.5：
Theoretical Foundation of Detection / 4：
Taxonomy of Anomaly Detection Systems / 4.1：
Fuzzy Logic / 4.2：
Fuzzy Logic in Anomaly Detection / 4.2.1：
Bayes Theory / 4.3：
Naive Bayes Classifier / 4.3.1：
Bayes Theory in Anomaly Detection / 4.3.2：
Artificial Neural Networks / 4.4：
Processing Elements / 4.4.1：
Connections / 4.4.2：
Network Architectures / 4.4.3：
Learning Process / 4.4.4：
Artificial Neural Networks in Anomaly Detection / 4.4.5：
Support Vector Machine (SVM) / 4.5：
Support Vector Machine in Anomaly Detection / 4.5.1：
Evolutionary Computation / 4.6：
Evolutionary Computation in Anomaly Detection / 4.6.1：
Association Rules / 4.7：
The Apriori Algorithm / 4.7.1：
Association Rules in Anomaly Detection / 4.7.2：
Clustering / 4.8：
Taxonomy of Clustering Algorithms / 4.8.1：
K-Means Clustering / 4.8.2：
Y-Means Clustering / 4.8.3：
Maximum-Likelihood Estimates / 4.8.4：
Unsupervised Learning of Gaussian Data / 4.8.5：
Clustering Based on Density Distribution Functions / 4.8.6：
Clustering in Anomaly Detection / 4.8.7：
Signal Processing Techniques Based Models / 4.9：
Comparative Study of Anomaly Detection Techniques / 4.10：
Architecture and Implementation / 5：
Centralized / 5.1：
Distributed / 5.2：
Intelligent Agents / 5.2.1：
Mobile Agents / 5.2.2：
Cooperative Intrusion Detection / 5.3：
Alert Management and Correlation / 6：
Data Fusion / 6.1：
Alert Correlation / 6.2：
Preprocess / 6.2.1：
Correlation Techniques / 6.2.2：
Postprocess / 6.2.3：
Alert Correlation Architectures / 6.2.4：
Validation of Alert Correlation Systems / 6.2.5：
Basic Principles of Information Sharing / 6.3：
Cooperation Based on Goal-tree Representation of Attack Strategies / 6.3.2：
Cooperative Discovery of Intrusion Chain / 6.3.3：
Abstraction-Based Intrusion Detection / 6.3.4：
Interest-Biased Communication and Cooperation / 6.3.5：
Agent-Based Cooperation / 6.3.6：
Secure Communication Using Public-key Encryption / 6.3.7：
Evaluation Criteria / 7：
Accuracy / 7.1：
False Positive and Negative / 7.1.1：
Confusion Matrix / 7.1.2：
Precision, Recall, and F-Measure / 7.1.3：
ROC Curves / 7.1.4：
The Base-Rate Fallacy / 7.1.5：
Performance / 7.2：
Completeness / 7.3：
Timely Response / 7.4：
Adaptation and Cost-Sensitivity / 7.5：
Intrusion Tolerance and Attack Resistance / 7.6：
Redundant and Fault Tolerance Design / 7.6.1：
Obstructing Methods / 7.6.2：
Test, Evaluation and Data Sets / 7.7：
Intrusion Response / 8：
Response Type / 8.1：
Passive Alerting and Manual Response / 8.1.1：
Active Response / 8.1.2：
Response Approach / 8.2：
Decision Analysis / 8.2.1：
Control Theory / 8.2.2：
Game theory / 8.2.3：
Fuzzy theory / 8.2.4：
Survivability and Intrusion Tolerance / 8.3：
Examples of Commercial and Open Source IDSs / A：
Bro Intrusion Detection System / A.l：
Prelude Intrusion Detection System / A.2：
Snort Intrusion Detection System / A.3：
Ethereal Application - Network Protocol Analyzer / A.4：
Multi Router Traffic Grapher (MRTG) / A.5：
Tamandua Network Intrusion Detection System / A.6：
Other Commercial IDSs / A.7：
Index
Network Attacks / 1：
Attack Taxonomies / 1.1：
Probes / 1.2：
40.

電子ブック
ＥＢ
40. Locally Decodable Codes and Private Information Retrieval Schemes
Sergey Yekhanin
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Locally decodable codes / 1.1：
Hadamard code / 1.1.1：
A code based on polynomial interpolation / 1.1.2：
Private information retrieval schemes / 1.2：
A PIR scheme based on polynomial interpolation / 1.2.1：
The history of LDCs and PIR schemes / 1.3：
The first generation: interpolation / 1.3.1：
The second generation: recursion / 1.3.2：
The third generation: point removal / 1.3.3：
Lower bounds / 1.3.4：
Applications of LDCs and PIR schemes / 1.4：
Secure multiparty computation / 1.4.1：
Other models of private information retrieval / 1.4.2：
Average-case complexity / 1.4.3：
Organization of the book / 1.5：
Addendum / 1.6：
Locally decodable codes via the point removal method / 2：
Notation / 2.1：
Binary LDCs via point removal / 2.2：
Regular intersecting families of sets / 2.3.1：
Basic construction / 2.3.2：
The main construction: point removal / 2.3.3：
General LDCs via point removal / 2.4：
3-dependences between p-th roots: sufficient conditions / 2.5：
k-dependences between p-th roots: a sufficient condition / 2.6.2：
Summary / 2.6.3：
Results / 2.7：
Results for three-query binary codes / 2.7.1：
Results for general codes / 2.7.2：
The code / 2.8：
Limitations of the point removal method / 3：
Attaining subexponential length requires a nice sequence / 3.1：
Point removal method / 3.1.1：
Our results / 3.1.2：
A nice sequence yields short dependences between p-th roots / 3.2：
k-dependences between p-th roots: a necessary condition / 3.2.1：
3-dependences between p-th roots: a necessary condition / 3.4：
Conclusions / 3.5：
Private information retrieval / 3.7：
Preliminaries / 4.1：
From LDCs to PIR schemes / 4.2：
Upper bounds for three-server binary PIR schemes / 4.2.1：
Upper bounds for general PIR schemes / 4.2.2：
A combinatorial view of two-server PIR / 4.3：
Bilinear PIR / 4.3.1：
Group-based PIR / 4.3.2：
Complexity of bilinear group-based PIR / 4.4：
Algebraic preliminaries / 4.4.1：
Algebraic formulation / 4.4.2：
Low-dimensional principal ideals in group algebras / 4.4.3：
Summary of lower bounds for two-server PIR / 4.5：
References / 4.6：
Index
Introduction / 1：
Locally decodable codes / 1.1：
Hadamard code / 1.1.1：
41.

電子ブック
ＥＢ
41. Coverage Control in Sensor Networks
Bang Wang
出版情報: Springer eBooks Computer Science , Springer London, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Part I：
Sensors / 1：
Sensor Nodes / 1.2：
Sensor Networks / 1.3：
Sensor Network Scenarios / 1.3.1：
Sensor Network Applications / 1.3.2：
Challenges and Issues / 1.4：
Sensor Network Challenges / 1.4.1：
Key Research Issues / 1.4.2：
References
Sensor Coverage Model / 2：
Motivations / 2.1：
Sensor Coverage Models / 2.2：
Boolean Sector Coverage Models / 2.2.1：
Boolean Disk Coverage Models / 2.2.2：
Attenuated Disk Coverage Models / 2.2.3：
Truncated Attenuated Disk Models / 2.2.4：
Detection Coverage Models / 2.2.5：
Estimation Coverage Models / 2.2.6：
Network Coverage Control / 3：
Motivations and Objectives / 3.1：
Notes and Comments / 3.1.1：
Coverage Control in the Protocol Architecture / 3.2：
Design Issues of Network Coverage Control / 3.2.1：
A Taxonomy for Network Coverage Problems / 3.4：
Target Coverage Problems / Part II：
Node Placement Optimization / 4：
Node Placement as the Set-Covering Problem / 4.1：
Optimal Sensor Placement Problems / 4.2：
Modeling Node Placement / 4.2.1：
Approximation Algorithms / 4.2.2：
Other Placement Problems / 4.2.3：
Coverage Lifetime Maximization / 5：
Maximizing Target Coverage Lifetime / 5.1：
Disjoint Set Cover / 5.1.1：
Nondisjoint Set Cover / 5.1.2：
Maximizing Connected Target Coverage Lifetime / 5.1.3：
Area Coverage Problems / 5.2.1：
Critical Sensor Density / 6：
Deterministic Node Placement / 6.1：
Node Placement in Two-Dimensional Field / 6.1.1：
Node Placement in Three-Dimensional Space / 6.1.2：
Random Node Deployment / 6.1.3：
Vacancy Analysis / 6.2.1：
Numerical Example / 6.2.2：
Sensor Activity Scheduling / 6.2.3：
Assumptions and Objectives / 7.1：
Preserving Complete Area Coverage / 7.2：
Redundancy Check Methods / 7.2.1：
Activity Scheduling Procedures / 7.2.2：
Example Scheduling Protocols / 7.2.3：
Preserving Partial Area Coverage / 7.2.4：
Random Independent Sleeping / 7.3.1：
Neighbor Based Scheduling / 7.3.2：
Preserving Area Coverage and Network Connectivity / 7.3.3：
Relation Between Area Coverage and Network Connectivity / 7.4.1：
Connected Coverage Scheduling / 7.4.2：
Node Movement Strategy / 7.4.3：
Healing Coverage Hole / 8.1：
Optimizing Area Coverage / 8.2：
Coverage Pattern Based Movement / 8.2.1：
Virtual Force Based Movement / 8.2.2：
Grid Quorum Based Movement / 8.2.3：
Improving Event Coverage / 8.3：
Barrier Coverage Problems / Part IV：
Build Intrusion Barriers / 9：
Sensor Barrier for Intrusion Detection / 9.1：
Sensor Scheduling for Barrier Construction / 9.2：
Sensor Barrier with Mobile Nodes / 9.3：
Find Penetration Paths / 10：
Maximal Breach Path / 10.1：
Maximal Support Path / 10.2：
Exposure Path / 10.3：
Detection Path / 10.4：
Analysis for Path Characteristics / 10.5：
Voronoi Diagram and Delaunay Triangulation / A：
Voronoi Diagram / A.l：
Delaunay Triangulation / A.2：
Index
Color Plates
Introduction / Part I：
Sensors / 1：
Sensor Nodes / 1.2：
42.

電子ブック
ＥＢ
42. Logical Tools for Handling Change in Agent-Based Systems
Dov M. Gabbay, Karl Schlechta
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
Nonmonotonic Logics / 1.2.1：
Theory Revision / 1.2.2：
Theory Update / 1.2.3：
Deontic Logic / 1.2.4：
Counterfactual Conditionals / 1.2.5：
Modal Logic / 1.2.6：
Intuitionistic Logic / 1.2.7：
Inheritance Systems / 1.2.8：
A Summarizing Table for the Semantics / 1.2.9：
A Discussion of Concepts / 1.3：
Basic Semantic Entities, Truth Values, and Operators / 1.3.1：
Algebraic and Structural Semantics / 1.3.2：
Restricted Operators and Relations / 1.3.3：
Copies in Preferential Models / 1.3.4：
Further Remarks on Universality of Representation Proofs / 1.3.5：
$$$ in the Object Language? / 1.3.6：
Various Considerations on Abstract Semantics / 1.3.7：
A Comparison with Reiter Defaults / 1.3.8：
IBRS / 1.4：
Definition and Comments / 1.4.1：
The Power of IBRS / 1.4.2：
Abstract Semantics for IBRS and Its Engineering Realization / 1.4.3：
Basic Definitions and Results / 2：
Algebraic Definitions / 2.1：
Basic Logical Definitions / 2.2：
Basic Definitions and Results for Nonmonotonic Logics / 2.3：
Abstract Semantics by Size / 3：
The First-Order Setting / 3.1：
General Size Semantics / 3.2：
Introduction / 3.2.1：
Main Table / 3.2.2：
Coherent Systems / 3.2.3：
Size and Principal Filter Logic / 3.2.4：
Preferential Structures - Part I / 4：
Remarks on Nonmonotonic Logics and Preferential Semantics / 4.1：
Basic Definitions / 4.1.2：
Preferential Structures Without Domain Conditions / 4.2：
General Discussion / 4.2.1：
Detailed Discussion / 4.2.2：
Preferential Structures - Part II / 5：
Simplifications by Domain Conditions, Logical Properties / 5.1：
Smooth Structures / 5.1.1：
Ranked Structures / 5.1.3：
The Logical Properties with Definability Preservation / 5.1.4：
A-Ranked Structures / 5.2：
Representation Results for A-Ranked Structures / 5.2.1：
Two-Sequent Calculi / 5.3：
Plausibility Logic / 5.3.1：
A Comment on the Work by Arieli and Avron / 5.3.3：
Blurred Observation - Absence of Definability Preservation / 5.4：
General and Smooth Structures Without Definability Preservation / 5.4.1：
The Limit Variant / 5.4.3：
The Algebraic Limit / 5.5.1：
The Logical Limit / 5.5.3：
Higher Preferential Structures / 6：
The General Case / 6.1：
Discussion of the Totally Smooth Case / 6.3：
The Essentially Smooth Case / 6.4：
Translation to Logic / 6.5：
Deontic Logic and Hierarchical Conditionals / 7：
Semantics of Deontic Logic / 7.1：
Introductory Remarks / 7.1.1：
Philosophical Discussion of Obligations / 7.1.2：
Examination of the Various Cases / 7.1.4：
What Is An Obligation? / 7.1.5：
Conclusion / 7.1.6：
A Comment on Work by Aqvist / 7.2：
There Are (At Least) Two Solutions / 7.2.1：
Outline / 7.2.3：
Gm $$$ A Implies G $$$ A (Outline) / 7.2.4：
Hierarchical Conditionals / 7.3：
Formal Modelling and Summary of Results / 7.3.1：
Overview / 7.3.3：
Connections with Other Concepts / 7.3.4：
Formal Results and Representation for Hierarchical Conditionals / 7.3.5：
Theory Update and Theory Revision / 8：
Update / 8.1：
Hidden Dimensions / 8.1.1：
Introduction to Theory Revision / 8.2：
Booth Revision / 8.2.2：
Revision and Independence / 8.2.3：
Preferential Modelling of Defaults / 8.2.4：
Remarks on Independence / 8.2.5：
An Analysis of Defeasible Inheritance Systems / 9：
Terminology / 9.1：
Inheritance and Reactive Diagrams / 9.1.2：
Conceptual Analysis / 9.1.3：
Introduction to Nonmonotonic Inheritance / 9.2：
Basic Discussion / 9.2.1：
Directly Sceptical Split Validity Upward Chaining Off-Path Inheritance / 9.2.2：
Review of Other Approaches and Problems / 9.2.3：
Defeasible Inheritance and Reactive Diagrams / 9.3：
Summary of Our Algorithm / 9.3.1：
Compilation and Memorization / 9.3.2：
Executing the Algorithm / 9.3.4：
Signposts / 9.3.5：
Beyond Inheritance / 9.3.6：
Interpretations / 9.4：
Informal Comparison of Inheritance with the Systems P and R / 9.4.1：
Inheritance as Information Transfer / 9.4.3：
Inheritance as Reasoning with Prototypes / 9.4.4：
Detailed Translation of Inheritance to Modified Systems of Small Sets / 9.5：
Normality / 9.5.1：
Small Sets / 9.5.2：
Bibliography
Index
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
43.

電子ブック
ＥＢ
43. Image-Based Modeling
Long Quan
出版情報: Springer eBooks Computer Science , Springer US, 2010
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Acknowledgements
Notation
Introduction / 1：
Geometry: fundamentals of multi-view geometry / Part I：
Geometry prerequisite / 2：
Projective geometry / 2.1：
The basic concepts / 2.2.1：
Projective spaces and transformations / 2.2.2：
Affine and Euclidean specialization / 2.2.3：
Algebraic geometry / 2.3：
The simple methods / 2.3.1：
Ideals, varieties, and Gröbner bases / 2.3.2：
Solving polynomial equations with Gröbner bases / 2.3.3：
Multi-view geometry / 3：
The single-view geometry / 3.1：
What is a camera? / 3.2.1：
Where is the camera? / 3.2.2：
The DLT calibration / 3.2.3：
The three-point pose algorithm / 3.2.4：
The uncalibrated two-view geometry / 3.3：
The fundamental matrix / 3.3.1：
The seven-point algorithm / 3.3.2：
The eight-point linear algorithm / 3.3.3：
The calibrated two-view geometry / 3.4：
The essential matrix / 3.4.1：
The five-point algorithm / 3.4.2：
The three-view geometry / 3.5：
The trifocal tensor / 3.5.1：
The six-point algorithm / 3.5.2：
The calibrated three views / 3.5.3：
The N-view geometry / 3.6：
The multi-linearities / 3.6.1：
Auto-calibration / 3.6.2：
Discussions / 3.7：
Bibliographic notes / 3.8：
Computation: from pixels to 3D points / Part II：
Feature point / 4：
Points of interest / 4.1：
Tracking features / 4.2.1：
Matching corners / 4.2.2：
Scale invariance / 4.2.3：
Invariance and stability / 4.3.1：
Scale, blob and Laplacian / 4.3.2：
Recognizing SIFT / 4.3.3：
Structure from Motion / 4.4：
Least squares and bundle adjustment / 5.1：
Robust statistics and RANSAC / 5.1.2：
The standard sparse approach / 5.2：
A sequence of images / 5.2.1：
A collection of images / 5.2.2：
The match propagation / 5.3：
The best-first match propagation / 5.3.1：
The properties of match propagation / 5.3.2：
The quasi-dense approach / 5.3.3：
The quasi-dense resampling / 5.4.1：
The quasi-dense SFM / 5.4.2：
Results and discussions / 5.4.3：
Modeling: from 3D points to objects / 5.5：
Surface modeling / 6：
Minimal surface functionals / 6.1：
A unified functional / 6.3：
Level-set method / 6.4：
A bounded regularization method / 6.5：
Implementation / 6.6：
Hair modeling / 6.7：
Hair volume determination / 7.1：
Hair fiber recovery / 7.3：
Visibility determination / 7.3.1：
Orientation consistency / 7.3.2：
Orientation triangulation / 7.3.3：
Tree modeling / 7.4：
Branche recovery / 8.1：
Reconstruction of visible branches / 8.2.1：
Synthesis of occluded branches / 8.2.2：
Interactive editing / 8.2.3：
Leaf extraction and reconstruction / 8.3：
Leaf texture segmentation / 8.3.1：
Graph-based leaf extraction / 8.3.2：
Model-based leaf reconstruction / 8.3.3：
Façade modeling / 8.4：
Façade initialization / 9.1：
Initial flat rectangle / 9.2.1：
Texture composition / 9.2.2：
Interactive refinement / 9.2.3：
Façade decomposition / 9.3：
Hidden structure discovery / 9.3.1：
Recursive subdivision / 9.3.2：
Repetitive pattern representation / 9.3.3：
Interactive subdivision refinement / 9.3.4：
Façade augmentation / 9.4：
Depth optimization / 9.4.1：
Cost definition / 9.4.2：
Interactive depth assignment / 9.4.3：
Façade completion / 9.5：
Building modeling / 9.6：
Pre-processing / 10.1：
Building segmentation / 10.3：
Supervised class recognition / 10.3.1：
Multi-view semantic segmentation / 10.3.2：
Building partition / 10.4：
Global vertical alignment / 10.4.1：
Block separator / 10.4.2：
Local horizontal alignment / 10.4.3：
Inverse orthographic composition / 10.5：
Structure analysis and regularization / 10.5.2：
Repetitive pattern rediscovery / 10.5.3：
Boundary regularization / 10.5.4：
Post-processing / 10.6：
List of algorithms / 10.7：
List of figures
References
Index
Foreword
Preface
Acknowledgements
44.

図書
図書
44. Fuzzy logic-based algorithms for video de-interlacing
Piedad Brox, Iluminada Baturone, and Santiago Sánchez-Solano
出版情報: Berlin : Springer Verlag, c2010  x, 174 p. ; 24 cm
シリーズ名: Studies in fuzziness and soft computing ; 246
所蔵情報: loading…
目次情報: 続きを見る
Basic Concepts / 1：
Television Transmission Systems / 1.1：
Monochrome Television Systems / 1.1.1：
Analog Color Television Broadcast Systems / 1.1.2：
Digital Color Television Broadcast Systems / 1.1.3：
Equipment for Broadcasting Television Images / 1.2：
Video Cameras / 1.2.1：
Movie Cameras / 1.2.2：
Film-to-Video Transference: Pull-Down Process / 1.2.3：
The Need of De-Interlacing / 1.3：
Review of De-Interlacing Algorithms / 1.3.1：
Implementation of Video De-Interlacing / 1.4：
Consumer Video Processing Chips / 1.4.1：
De-Interlacing Implementations Based on DSPs, FPGAs and IP Cores / 1.4.2：
The Role of Fuzzy Logic in Video Processing / 1.5：
Basic Concepts of Fuzzy Logic Theory / 1.5.1：
CAD Tools for Designing Fuzzy Systems / 1.5.2：
Conclusions / 1.6：
References
Fuzzy Motion-Adaptive Algorithm for Video De-Interlacing / 2：
Motion-Adaptive De-Interlacing / 2.1：
Van de Ville et al. Proposal / 2.2：
A New Fuzzy Motion-Adaptive De-Interlacing Algorithm / 2.3：
Simulation Results / 2.4：
Results on Benchmark Video Sequences / 2.4.1：
Detailed Results on Three Sequences / 2.4.2：
Design Options of the Fuzzy Motion-Adaptive Algorithm / 2.5：
Convolution Mask Options / 3.1：
Rule Base Options / 3.1.1：
Tuning of Membership Function and Consequent Parameters / 3.2.1：
Reference / 3.2.2：
Fuzzy Motion-Adaptive De-Interlacing with Edge-Adaptive Spatial Interpolation / 4：
Basic Fuzzy-ELA Algorithm / 4.1：
Determination of the Membership Function Parameters / 4.1.1：
Performance of the Basic Fuzzy-ELA Algorithm / 4.1.2：
Modifications of the Basic Fuzzy-ELA Algorithm / 4.2：
Recursive Fuzzy-ELA Algorithm / 4.2.1：
ELA 5+5 and Fuzzy-ELA 5+5 Algorithm / 4.2.2：
Improved Fuzzy-ELA 5+5 Algorithm / 4.2.3：
Comparison of the Fuzzy-ELA Algorithms / 4.2.4：
Robustness of Fuzzy Proposals against Noise / 4.2.5：
Fuzzy Motion Adaptive Algorithm with the 'Improved Fuzzy-ELA 5+5' as Spatial Interpolator / 4.2.6：
Fuzzy Motion-Adaptive De-Interlacing with Smart Temporal Interpolation / 4.3：
A Smart Temporal Interpolator / 5.1：
Morphological Operations / 5.1.1：
Performance of the Proposed Algorithm / 5.2：
Evolution of the Fuzzy De-Interlacing Proposals / 5.3：
Comparison with MC De-Interlacing Methods / 5.4：
Glossary / 5.5：
Index
Basic Concepts / 1：
Television Transmission Systems / 1.1：
Monochrome Television Systems / 1.1.1：
45.

電子ブック
ＥＢ
45. Coverage Control in Sensor Networks
Bang Wang
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Part I：
Sensors / 1：
Sensor Nodes / 1.2：
Sensor Networks / 1.3：
Sensor Network Scenarios / 1.3.1：
Sensor Network Applications / 1.3.2：
Challenges and Issues / 1.4：
Sensor Network Challenges / 1.4.1：
Key Research Issues / 1.4.2：
References
Sensor Coverage Model / 2：
Motivations / 2.1：
Sensor Coverage Models / 2.2：
Boolean Sector Coverage Models / 2.2.1：
Boolean Disk Coverage Models / 2.2.2：
Attenuated Disk Coverage Models / 2.2.3：
Truncated Attenuated Disk Models / 2.2.4：
Detection Coverage Models / 2.2.5：
Estimation Coverage Models / 2.2.6：
Network Coverage Control / 3：
Motivations and Objectives / 3.1：
Notes and Comments / 3.1.1：
Coverage Control in the Protocol Architecture / 3.2：
Design Issues of Network Coverage Control / 3.2.1：
A Taxonomy for Network Coverage Problems / 3.4：
Target Coverage Problems / Part II：
Node Placement Optimization / 4：
Node Placement as the Set-Covering Problem / 4.1：
Optimal Sensor Placement Problems / 4.2：
Modeling Node Placement / 4.2.1：
Approximation Algorithms / 4.2.2：
Other Placement Problems / 4.2.3：
Coverage Lifetime Maximization / 5：
Maximizing Target Coverage Lifetime / 5.1：
Disjoint Set Cover / 5.1.1：
Nondisjoint Set Cover / 5.1.2：
Maximizing Connected Target Coverage Lifetime / 5.1.3：
Area Coverage Problems / 5.2.1：
Critical Sensor Density / 6：
Deterministic Node Placement / 6.1：
Node Placement in Two-Dimensional Field / 6.1.1：
Node Placement in Three-Dimensional Space / 6.1.2：
Random Node Deployment / 6.1.3：
Vacancy Analysis / 6.2.1：
Numerical Example / 6.2.2：
Sensor Activity Scheduling / 6.2.3：
Assumptions and Objectives / 7.1：
Preserving Complete Area Coverage / 7.2：
Redundancy Check Methods / 7.2.1：
Activity Scheduling Procedures / 7.2.2：
Example Scheduling Protocols / 7.2.3：
Preserving Partial Area Coverage / 7.2.4：
Random Independent Sleeping / 7.3.1：
Neighbor Based Scheduling / 7.3.2：
Preserving Area Coverage and Network Connectivity / 7.3.3：
Relation Between Area Coverage and Network Connectivity / 7.4.1：
Connected Coverage Scheduling / 7.4.2：
Node Movement Strategy / 7.4.3：
Healing Coverage Hole / 8.1：
Optimizing Area Coverage / 8.2：
Coverage Pattern Based Movement / 8.2.1：
Virtual Force Based Movement / 8.2.2：
Grid Quorum Based Movement / 8.2.3：
Improving Event Coverage / 8.3：
Barrier Coverage Problems / Part IV：
Build Intrusion Barriers / 9：
Sensor Barrier for Intrusion Detection / 9.1：
Sensor Scheduling for Barrier Construction / 9.2：
Sensor Barrier with Mobile Nodes / 9.3：
Find Penetration Paths / 10：
Maximal Breach Path / 10.1：
Maximal Support Path / 10.2：
Exposure Path / 10.3：
Detection Path / 10.4：
Analysis for Path Characteristics / 10.5：
Voronoi Diagram and Delaunay Triangulation / A：
Voronoi Diagram / A.l：
Delaunay Triangulation / A.2：
Index
Color Plates
Introduction / Part I：
Sensors / 1：
Sensor Nodes / 1.2：
46.

電子ブック
ＥＢ
46. Image-Based Modeling
Long Quan
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2010
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
Acknowledgements
Notation
Introduction / 1：
Geometry: fundamentals of multi-view geometry / Part I：
Geometry prerequisite / 2：
Projective geometry / 2.1：
The basic concepts / 2.2.1：
Projective spaces and transformations / 2.2.2：
Affine and Euclidean specialization / 2.2.3：
Algebraic geometry / 2.3：
The simple methods / 2.3.1：
Ideals, varieties, and Gröbner bases / 2.3.2：
Solving polynomial equations with Gröbner bases / 2.3.3：
Multi-view geometry / 3：
The single-view geometry / 3.1：
What is a camera? / 3.2.1：
Where is the camera? / 3.2.2：
The DLT calibration / 3.2.3：
The three-point pose algorithm / 3.2.4：
The uncalibrated two-view geometry / 3.3：
The fundamental matrix / 3.3.1：
The seven-point algorithm / 3.3.2：
The eight-point linear algorithm / 3.3.3：
The calibrated two-view geometry / 3.4：
The essential matrix / 3.4.1：
The five-point algorithm / 3.4.2：
The three-view geometry / 3.5：
The trifocal tensor / 3.5.1：
The six-point algorithm / 3.5.2：
The calibrated three views / 3.5.3：
The N-view geometry / 3.6：
The multi-linearities / 3.6.1：
Auto-calibration / 3.6.2：
Discussions / 3.7：
Bibliographic notes / 3.8：
Computation: from pixels to 3D points / Part II：
Feature point / 4：
Points of interest / 4.1：
Tracking features / 4.2.1：
Matching corners / 4.2.2：
Scale invariance / 4.2.3：
Invariance and stability / 4.3.1：
Scale, blob and Laplacian / 4.3.2：
Recognizing SIFT / 4.3.3：
Structure from Motion / 4.4：
Least squares and bundle adjustment / 5.1：
Robust statistics and RANSAC / 5.1.2：
The standard sparse approach / 5.2：
A sequence of images / 5.2.1：
A collection of images / 5.2.2：
The match propagation / 5.3：
The best-first match propagation / 5.3.1：
The properties of match propagation / 5.3.2：
The quasi-dense approach / 5.3.3：
The quasi-dense resampling / 5.4.1：
The quasi-dense SFM / 5.4.2：
Results and discussions / 5.4.3：
Modeling: from 3D points to objects / 5.5：
Surface modeling / 6：
Minimal surface functionals / 6.1：
A unified functional / 6.3：
Level-set method / 6.4：
A bounded regularization method / 6.5：
Implementation / 6.6：
Hair modeling / 6.7：
Hair volume determination / 7.1：
Hair fiber recovery / 7.3：
Visibility determination / 7.3.1：
Orientation consistency / 7.3.2：
Orientation triangulation / 7.3.3：
Tree modeling / 7.4：
Branche recovery / 8.1：
Reconstruction of visible branches / 8.2.1：
Synthesis of occluded branches / 8.2.2：
Interactive editing / 8.2.3：
Leaf extraction and reconstruction / 8.3：
Leaf texture segmentation / 8.3.1：
Graph-based leaf extraction / 8.3.2：
Model-based leaf reconstruction / 8.3.3：
Façade modeling / 8.4：
Façade initialization / 9.1：
Initial flat rectangle / 9.2.1：
Texture composition / 9.2.2：
Interactive refinement / 9.2.3：
Façade decomposition / 9.3：
Hidden structure discovery / 9.3.1：
Recursive subdivision / 9.3.2：
Repetitive pattern representation / 9.3.3：
Interactive subdivision refinement / 9.3.4：
Façade augmentation / 9.4：
Depth optimization / 9.4.1：
Cost definition / 9.4.2：
Interactive depth assignment / 9.4.3：
Façade completion / 9.5：
Building modeling / 9.6：
Pre-processing / 10.1：
Building segmentation / 10.3：
Supervised class recognition / 10.3.1：
Multi-view semantic segmentation / 10.3.2：
Building partition / 10.4：
Global vertical alignment / 10.4.1：
Block separator / 10.4.2：
Local horizontal alignment / 10.4.3：
Inverse orthographic composition / 10.5：
Structure analysis and regularization / 10.5.2：
Repetitive pattern rediscovery / 10.5.3：
Boundary regularization / 10.5.4：
Post-processing / 10.6：
List of algorithms / 10.7：
List of figures
References
Index
Foreword
Preface
Acknowledgements
47.

電子ブック
ＥＢ
47. Locally Decodable Codes and Private Information Retrieval Schemes
Sergey Yekhanin
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Locally decodable codes / 1.1：
Hadamard code / 1.1.1：
A code based on polynomial interpolation / 1.1.2：
Private information retrieval schemes / 1.2：
A PIR scheme based on polynomial interpolation / 1.2.1：
The history of LDCs and PIR schemes / 1.3：
The first generation: interpolation / 1.3.1：
The second generation: recursion / 1.3.2：
The third generation: point removal / 1.3.3：
Lower bounds / 1.3.4：
Applications of LDCs and PIR schemes / 1.4：
Secure multiparty computation / 1.4.1：
Other models of private information retrieval / 1.4.2：
Average-case complexity / 1.4.3：
Organization of the book / 1.5：
Addendum / 1.6：
Locally decodable codes via the point removal method / 2：
Notation / 2.1：
Binary LDCs via point removal / 2.2：
Regular intersecting families of sets / 2.3.1：
Basic construction / 2.3.2：
The main construction: point removal / 2.3.3：
General LDCs via point removal / 2.4：
3-dependences between p-th roots: sufficient conditions / 2.5：
k-dependences between p-th roots: a sufficient condition / 2.6.2：
Summary / 2.6.3：
Results / 2.7：
Results for three-query binary codes / 2.7.1：
Results for general codes / 2.7.2：
The code / 2.8：
Limitations of the point removal method / 3：
Attaining subexponential length requires a nice sequence / 3.1：
Point removal method / 3.1.1：
Our results / 3.1.2：
A nice sequence yields short dependences between p-th roots / 3.2：
k-dependences between p-th roots: a necessary condition / 3.2.1：
3-dependences between p-th roots: a necessary condition / 3.4：
Conclusions / 3.5：
Private information retrieval / 3.7：
Preliminaries / 4.1：
From LDCs to PIR schemes / 4.2：
Upper bounds for three-server binary PIR schemes / 4.2.1：
Upper bounds for general PIR schemes / 4.2.2：
A combinatorial view of two-server PIR / 4.3：
Bilinear PIR / 4.3.1：
Group-based PIR / 4.3.2：
Complexity of bilinear group-based PIR / 4.4：
Algebraic preliminaries / 4.4.1：
Algebraic formulation / 4.4.2：
Low-dimensional principal ideals in group algebras / 4.4.3：
Summary of lower bounds for two-server PIR / 4.5：
References / 4.6：
Index
Introduction / 1：
Locally decodable codes / 1.1：
Hadamard code / 1.1.1：
48.

電子ブック
ＥＢ
48. Logical Tools for Handling Change in Agent-Based Systems
Dov M. Gabbay, Karl Schlechta
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
Nonmonotonic Logics / 1.2.1：
Theory Revision / 1.2.2：
Theory Update / 1.2.3：
Deontic Logic / 1.2.4：
Counterfactual Conditionals / 1.2.5：
Modal Logic / 1.2.6：
Intuitionistic Logic / 1.2.7：
Inheritance Systems / 1.2.8：
A Summarizing Table for the Semantics / 1.2.9：
A Discussion of Concepts / 1.3：
Basic Semantic Entities, Truth Values, and Operators / 1.3.1：
Algebraic and Structural Semantics / 1.3.2：
Restricted Operators and Relations / 1.3.3：
Copies in Preferential Models / 1.3.4：
Further Remarks on Universality of Representation Proofs / 1.3.5：
$$$ in the Object Language? / 1.3.6：
Various Considerations on Abstract Semantics / 1.3.7：
A Comparison with Reiter Defaults / 1.3.8：
IBRS / 1.4：
Definition and Comments / 1.4.1：
The Power of IBRS / 1.4.2：
Abstract Semantics for IBRS and Its Engineering Realization / 1.4.3：
Basic Definitions and Results / 2：
Algebraic Definitions / 2.1：
Basic Logical Definitions / 2.2：
Basic Definitions and Results for Nonmonotonic Logics / 2.3：
Abstract Semantics by Size / 3：
The First-Order Setting / 3.1：
General Size Semantics / 3.2：
Introduction / 3.2.1：
Main Table / 3.2.2：
Coherent Systems / 3.2.3：
Size and Principal Filter Logic / 3.2.4：
Preferential Structures - Part I / 4：
Remarks on Nonmonotonic Logics and Preferential Semantics / 4.1：
Basic Definitions / 4.1.2：
Preferential Structures Without Domain Conditions / 4.2：
General Discussion / 4.2.1：
Detailed Discussion / 4.2.2：
Preferential Structures - Part II / 5：
Simplifications by Domain Conditions, Logical Properties / 5.1：
Smooth Structures / 5.1.1：
Ranked Structures / 5.1.3：
The Logical Properties with Definability Preservation / 5.1.4：
A-Ranked Structures / 5.2：
Representation Results for A-Ranked Structures / 5.2.1：
Two-Sequent Calculi / 5.3：
Plausibility Logic / 5.3.1：
A Comment on the Work by Arieli and Avron / 5.3.3：
Blurred Observation - Absence of Definability Preservation / 5.4：
General and Smooth Structures Without Definability Preservation / 5.4.1：
The Limit Variant / 5.4.3：
The Algebraic Limit / 5.5.1：
The Logical Limit / 5.5.3：
Higher Preferential Structures / 6：
The General Case / 6.1：
Discussion of the Totally Smooth Case / 6.3：
The Essentially Smooth Case / 6.4：
Translation to Logic / 6.5：
Deontic Logic and Hierarchical Conditionals / 7：
Semantics of Deontic Logic / 7.1：
Introductory Remarks / 7.1.1：
Philosophical Discussion of Obligations / 7.1.2：
Examination of the Various Cases / 7.1.4：
What Is An Obligation? / 7.1.5：
Conclusion / 7.1.6：
A Comment on Work by Aqvist / 7.2：
There Are (At Least) Two Solutions / 7.2.1：
Outline / 7.2.3：
Gm $$$ A Implies G $$$ A (Outline) / 7.2.4：
Hierarchical Conditionals / 7.3：
Formal Modelling and Summary of Results / 7.3.1：
Overview / 7.3.3：
Connections with Other Concepts / 7.3.4：
Formal Results and Representation for Hierarchical Conditionals / 7.3.5：
Theory Update and Theory Revision / 8：
Update / 8.1：
Hidden Dimensions / 8.1.1：
Introduction to Theory Revision / 8.2：
Booth Revision / 8.2.2：
Revision and Independence / 8.2.3：
Preferential Modelling of Defaults / 8.2.4：
Remarks on Independence / 8.2.5：
An Analysis of Defeasible Inheritance Systems / 9：
Terminology / 9.1：
Inheritance and Reactive Diagrams / 9.1.2：
Conceptual Analysis / 9.1.3：
Introduction to Nonmonotonic Inheritance / 9.2：
Basic Discussion / 9.2.1：
Directly Sceptical Split Validity Upward Chaining Off-Path Inheritance / 9.2.2：
Review of Other Approaches and Problems / 9.2.3：
Defeasible Inheritance and Reactive Diagrams / 9.3：
Summary of Our Algorithm / 9.3.1：
Compilation and Memorization / 9.3.2：
Executing the Algorithm / 9.3.4：
Signposts / 9.3.5：
Beyond Inheritance / 9.3.6：
Interpretations / 9.4：
Informal Comparison of Inheritance with the Systems P and R / 9.4.1：
Inheritance as Information Transfer / 9.4.3：
Inheritance as Reasoning with Prototypes / 9.4.4：
Detailed Translation of Inheritance to Modified Systems of Small Sets / 9.5：
Normality / 9.5.1：
Small Sets / 9.5.2：
Bibliography
Index
Introduction and Motivation / 1：
Programme / 1.1：
Short Overview of the Different Logics / 1.2：
49.

電子ブック
ＥＢ
49. Evolving Towards the Internetworked Enterprise
Passiante, Giuseppina Passiante
出版情報: Springer eBooks Computer Science , Springer US, 2010
所蔵情報: loading…
目次情報: 続きを見る
Towards an Internetworked Enterprise: some issues to be discussed / Chapter 1：
IE theoretical background / 1.1：
From vertical corporation to network organization / 1.1.1：
From industrial cluster to virtual networks / 1.1.2：
IE from theory to practice / 1.2：
From the strategy to the Business Model / 1.2.1：
The "Business Model" enabling Architecture: a strategic tool to design effective socio-technical systems / 1.2.2：
Linking the Business Model with the Enterprise Architecture / 1.2.3：
Conclusion / 1.3：
References
A methodology aimed at fostering and sustaining the development processes of an IE-based industry / Chapter 2：
The TEKNE project Methodology of change / 2.1：
Overview on the adopted approach / 2.2：
The Methodology of change step by step / 2.3：
Environment analysis / 2.3.1：
Business Network Analysis / 2.3.2：
Business Model analysis / 2.3.3：
The Business Model Ontology / 2.3.3.1：
The value flow / 2.3.3.2：
Requirements analysis and architecture design / 2.3.4：
Collaborative Storytelling / 2.3.4.1：
Definition of a value-driven architecture / 2.3.4.2：
Deployment Strategy / 2.3.5：
Measurement of the change impact / 2.3.6：
A network-oriented business modeling environment / 2.4：
Introduction / 3.1：
Business Modeling / 3.2：
SBVR Modeling Tool / 3.3：
Overview of SBVR / 3.3.1：
The conceptual architecture of the SBVR modeling tool / 3.3.2：
Distributed model repository / 3.4：
MOF foundation of the repository / 3.4.1：
The conceptual architecture of the model repository / 3.4.2：
Query/View/Transformation / 3.4.3：
Search and retrieval system / 3.5：
Conclusions / 3.6：
Model-based service-oriented architectures for Internetworked Enterprises / Chapter 4：
Modeling service-based business processes / 4.1：
Processes and services definition / 4.2.1：
Semantic service description / 4.2.2：
Quality model / 4.2.3：
Quality offering / 4.2.3.1：
Quality request / 4.2.3.2：
Service identification methodology / 4.3：
Service Discovery / 4.4：
Semantic-driven service discovery / 4.4.1：
Semantic service matchmaking / 4.4.1.1：
P2P service discovery / 4.4.1.2：
Quality-aware matchmaking / 4.4.2：
Low-level evaluation / 4.4.2.1：
High-level evaluation / 4.4.2.2：
Service Interaction Design / 4.5：
Modeling processes IMPLICITLY with hypertext design primitives / 4.5.1：
A technological infrastructure to sustain Internetworked Enterprises / 4.6：
Overall Architecture / 5.1：
Peer Registry and Knowledge Base / 5.3：
Semantic Layer / 5.4：
Semantic Match / 5.4.1：
Peer Clustering / 5.4.2：
Service MatchMaker / 5.4.3：
Semantic Neighbor Manager / 5.4.4：
Semantic Routing & Discovery / 5.4.5：
Distributed Authentication and Authorization System / 5.5：
Monitoring Business Processes / 5.6：
Monitoring to Change / 6.1：
Performance Measurement / 6.2.1：
The TEKNE approach / 6.2.3：
The Metrics Framework / 6.3：
Discovery / 6.3.1：
Conformance / 6.3.2：
An Approach based on Logics / 6.3.3：
Implementing Performance Indicators / 6.3.4：
The TEKNE Architecture / 6.3.5：
SuperJet International case study: a business network start-up in the aeronautics industry / 6.4：
Enterprise Networks: characteristics / 7.1：
Case study plan and interviews / 7.3：
SuperJet International: the start-up of a network in the aerospace industry / 7.4：
Techno-organizational deployment in the SJI case study / 7.5：
Avio case study: the MRO process / 7.6：
As-is: assessment of the unit of analysis / 8.1：
To-be: business model re-design / 8.3：
Product / 8.3.1：
Customer interface / 8.3.2：
Infrastructure management / 8.3.3：
Financial aspects / 8.3.4：
Value flows / 8.3.5：
Conclusions and future work / 8.4：
Inter-organizational design: exploring the relationship between formal architecture and ICT investments / Chapter 9：
Theoretical Background / 9.1：
The empirical context: Engineering S.p.A / 9.3：
Method / 9.4：
Results / 9.5：
Descriptive Results / 9.5.1：
Analytical results / 9.5.2：
Discussion and Conclusions / 9.6：
Communication flows in an SME network: the C.I.S.I consortium case / Chapter 10：
Literature review and model development / 10.1：
Networks and the diffusion of innovation / 10.2.1：
Personal relationships and networks / 10.2.2：
The empirical context: CISI consortium / 10.3：
Discussion of Results / 10.4：
Strategic activities are mostly enabled by consortium-related associations / 10.5.1：
Strong link between geographic relationships and innovative activities / 10.5.2：
Role of key individuals in strategic activities / 10.5.3：
Role of key clients in the diffusion of organizational innovations / 10.5.4：
Personal relationships enable the diffusion and adoption of innovation / 10.5.5：
Tisettanta case study: the interoperation of furniture production companies / 10.6：
Company overview / 11.1：
Supply chain / 11.3：
Stock management - outline / 11.4：
Production process - outline / 11.5：
Distribution chain / 11.6：
ICT infrastructure and applications / 11.7：
Possible improvements enabled by ICT technologies / 11.8：
Collaboration process models / 11.9：
An analysis of models and practices in Human Resource Management processes and the relationship between firms and outsourcers: a case study / 11.10：
HR Outsourcing / 12.1：
The reasons a company outsources its HR processes / 12.1.1：
Cost Reduction / 12.1.1.1：
Improvement of service levels / 12.1.1.2：
Rendering the cost structure of the HR function flexible / 12.1.1.3：
Selecting HR processes to outsource / 12.1.2：
Core Competence View / 12.1.2.1：
Resource Based View / 12.1.2.2：
Transaction Cost Economics / 12.1.2.3：
HRO Relationships / 12.2：
Types of relationships / 12.2.1：
The level of supplier delegation / 12.2.2：
Relationship governance / 12.2.3：
The organizational interface between customer and supplier / 12.2.4：
The Complexity of HRO Projects: a case study / 12.3：
The case / 12.3.1：
Objectives of HRO and outsourced activities / 12.3.2：
Phases in the process towards HR Outsourcing / 12.3.3：
Mapping the flow of outsourced HR processes / 12.3.4：
Recruitment / 12.3.4.1：
Training / 12.3.4.2：
Payroll / 12.3.4.3：
Competencies required by the HR Outsourcing process / 12.3.5：
Role of the HR Department following HR Outsourcing / 12.3.6：
Towards an Internetworked Enterprise: some issues to be discussed / Chapter 1：
IE theoretical background / 1.1：
From vertical corporation to network organization / 1.1.1：
50.

電子ブック
ＥＢ
50. Evolving Towards the Internetworked Enterprise
Passiante, Giuseppina Passiante
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2010
所蔵情報: loading…
目次情報: 続きを見る
Towards an Internetworked Enterprise: some issues to be discussed / Chapter 1：
IE theoretical background / 1.1：
From vertical corporation to network organization / 1.1.1：
From industrial cluster to virtual networks / 1.1.2：
IE from theory to practice / 1.2：
From the strategy to the Business Model / 1.2.1：
The "Business Model" enabling Architecture: a strategic tool to design effective socio-technical systems / 1.2.2：
Linking the Business Model with the Enterprise Architecture / 1.2.3：
Conclusion / 1.3：
References
A methodology aimed at fostering and sustaining the development processes of an IE-based industry / Chapter 2：
The TEKNE project Methodology of change / 2.1：
Overview on the adopted approach / 2.2：
The Methodology of change step by step / 2.3：
Environment analysis / 2.3.1：
Business Network Analysis / 2.3.2：
Business Model analysis / 2.3.3：
The Business Model Ontology / 2.3.3.1：
The value flow / 2.3.3.2：
Requirements analysis and architecture design / 2.3.4：
Collaborative Storytelling / 2.3.4.1：
Definition of a value-driven architecture / 2.3.4.2：
Deployment Strategy / 2.3.5：
Measurement of the change impact / 2.3.6：
A network-oriented business modeling environment / 2.4：
Introduction / 3.1：
Business Modeling / 3.2：
SBVR Modeling Tool / 3.3：
Overview of SBVR / 3.3.1：
The conceptual architecture of the SBVR modeling tool / 3.3.2：
Distributed model repository / 3.4：
MOF foundation of the repository / 3.4.1：
The conceptual architecture of the model repository / 3.4.2：
Query/View/Transformation / 3.4.3：
Search and retrieval system / 3.5：
Conclusions / 3.6：
Model-based service-oriented architectures for Internetworked Enterprises / Chapter 4：
Modeling service-based business processes / 4.1：
Processes and services definition / 4.2.1：
Semantic service description / 4.2.2：
Quality model / 4.2.3：
Quality offering / 4.2.3.1：
Quality request / 4.2.3.2：
Service identification methodology / 4.3：
Service Discovery / 4.4：
Semantic-driven service discovery / 4.4.1：
Semantic service matchmaking / 4.4.1.1：
P2P service discovery / 4.4.1.2：
Quality-aware matchmaking / 4.4.2：
Low-level evaluation / 4.4.2.1：
High-level evaluation / 4.4.2.2：
Service Interaction Design / 4.5：
Modeling processes IMPLICITLY with hypertext design primitives / 4.5.1：
A technological infrastructure to sustain Internetworked Enterprises / 4.6：
Overall Architecture / 5.1：
Peer Registry and Knowledge Base / 5.3：
Semantic Layer / 5.4：
Semantic Match / 5.4.1：
Peer Clustering / 5.4.2：
Service MatchMaker / 5.4.3：
Semantic Neighbor Manager / 5.4.4：
Semantic Routing & Discovery / 5.4.5：
Distributed Authentication and Authorization System / 5.5：
Monitoring Business Processes / 5.6：
Monitoring to Change / 6.1：
Performance Measurement / 6.2.1：
The TEKNE approach / 6.2.3：
The Metrics Framework / 6.3：
Discovery / 6.3.1：
Conformance / 6.3.2：
An Approach based on Logics / 6.3.3：
Implementing Performance Indicators / 6.3.4：
The TEKNE Architecture / 6.3.5：
SuperJet International case study: a business network start-up in the aeronautics industry / 6.4：
Enterprise Networks: characteristics / 7.1：
Case study plan and interviews / 7.3：
SuperJet International: the start-up of a network in the aerospace industry / 7.4：
Techno-organizational deployment in the SJI case study / 7.5：
Avio case study: the MRO process / 7.6：
As-is: assessment of the unit of analysis / 8.1：
To-be: business model re-design / 8.3：
Product / 8.3.1：
Customer interface / 8.3.2：
Infrastructure management / 8.3.3：
Financial aspects / 8.3.4：
Value flows / 8.3.5：
Conclusions and future work / 8.4：
Inter-organizational design: exploring the relationship between formal architecture and ICT investments / Chapter 9：
Theoretical Background / 9.1：
The empirical context: Engineering S.p.A / 9.3：
Method / 9.4：
Results / 9.5：
Descriptive Results / 9.5.1：
Analytical results / 9.5.2：
Discussion and Conclusions / 9.6：
Communication flows in an SME network: the C.I.S.I consortium case / Chapter 10：
Literature review and model development / 10.1：
Networks and the diffusion of innovation / 10.2.1：
Personal relationships and networks / 10.2.2：
The empirical context: CISI consortium / 10.3：
Discussion of Results / 10.4：
Strategic activities are mostly enabled by consortium-related associations / 10.5.1：
Strong link between geographic relationships and innovative activities / 10.5.2：
Role of key individuals in strategic activities / 10.5.3：
Role of key clients in the diffusion of organizational innovations / 10.5.4：
Personal relationships enable the diffusion and adoption of innovation / 10.5.5：
Tisettanta case study: the interoperation of furniture production companies / 10.6：
Company overview / 11.1：
Supply chain / 11.3：
Stock management - outline / 11.4：
Production process - outline / 11.5：
Distribution chain / 11.6：
ICT infrastructure and applications / 11.7：
Possible improvements enabled by ICT technologies / 11.8：
Collaboration process models / 11.9：
An analysis of models and practices in Human Resource Management processes and the relationship between firms and outsourcers: a case study / 11.10：
HR Outsourcing / 12.1：
The reasons a company outsources its HR processes / 12.1.1：
Cost Reduction / 12.1.1.1：
Improvement of service levels / 12.1.1.2：
Rendering the cost structure of the HR function flexible / 12.1.1.3：
Selecting HR processes to outsource / 12.1.2：
Core Competence View / 12.1.2.1：
Resource Based View / 12.1.2.2：
Transaction Cost Economics / 12.1.2.3：
HRO Relationships / 12.2：
Types of relationships / 12.2.1：
The level of supplier delegation / 12.2.2：
Relationship governance / 12.2.3：
The organizational interface between customer and supplier / 12.2.4：
The Complexity of HRO Projects: a case study / 12.3：
The case / 12.3.1：
Objectives of HRO and outsourced activities / 12.3.2：
Phases in the process towards HR Outsourcing / 12.3.3：
Mapping the flow of outsourced HR processes / 12.3.4：
Recruitment / 12.3.4.1：
Training / 12.3.4.2：
Payroll / 12.3.4.3：
Competencies required by the HR Outsourcing process / 12.3.5：
Role of the HR Department following HR Outsourcing / 12.3.6：
Towards an Internetworked Enterprise: some issues to be discussed / Chapter 1：
IE theoretical background / 1.1：
From vertical corporation to network organization / 1.1.1：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼