close
1.

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

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

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

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

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

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

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

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

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

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

電子ブック
ＥＢ
11. Dependency Structures and Lexicalized Grammars
Marco Kuhlmann, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
Generative Capacity and Non-projectivity / 1.1.2：
Lexicalized Grammars Induce Dependency Trees / 1.2：
Overview of the Book / 1.3：
Dependency Languages / 1.3.1：
Contributions / 1.3.3：
Preliminaries / 2：
Projective Dependency Structures / 3：
Projectivity / 3.1：
Projectivity in the Sense of Harper and Hays / 3.1.1：
Projectivity in the Sense of Lecerf and Ihm / 3.1.2：
Projectivity in the Sense of Fitialov / 3.1.3：
Related Work / 3.1.4：
Algebraic Framework / 3.2：
Tree Traversal Strategies / 3.2.1：
Traversal of Treelet-Ordered Trees / 3.2.2：
Order Annotations / 3.2.3：
Dependency Algebras / 3.2.4：
Algorithmic Problems / 3.3：
Encoding and Decoding / 3.3.1：
Testing whether a Dependency Structure Is Projective / 3.3.2：
Empirical Evaluation / 3.3.3：
The Projectivity Hypothesis / 3.4.1：
Experimental Setup / 3.4.2：
Results and Discussion / 3.4.3：
Dependency Structures of Bounded Degree / 3.4.4：
The Block-Degree Measure / 4.1：
Blocks and Block-Degree / 4.1.1：
A Hierarchy of Non-projective Dependency Structures / 4.1.2：
Traversal of Block-Ordered Trees / 4.1.3：
Segmented Dependency Structures / 4.2.2：
Dependency Structure Algebras / 4.2.3：
Encoding / 4.3：
Computing the Block-Degree of a Dependency Structure / 4.3.2：
Dependency Structures without Crossings / 4.4：
Weakly Non-projective Dependency Structures / 5.1：
Definition of Weak Non-projectivity / 5.1.1：
Relation to the Block-Degree Measure / 5.1.2：
Algebraic Opaqueness / 5.1.3：
Well-Nested Dependency Structures / 5.1.4：
Definition of Well-Nestedness / 5.2.1：
Non-crossing Partitions / 5.2.2：
Algebraic Characterization / 5.2.3：
Testing whether a Dependency Structure Is Well-Nested / 5.2.4：
Structures and Grammars / 5.2.5：
Context-Free Grammars / 6.1：
Definition / 6.1.1：
String Semantics / 6.1.2：
Linearization Semantics / 6.1.3：
Dependency Semantics / 6.1.4：
Linear Context-Free Rewriting Systems / 6.2：
Non-essential Concatenation Functions / 6.2.1：
Coupled Context-Free Grammars / 6.2.4：
Tree Adjoining Grammar / 6.3.1：
Regular Dependency Languages / 6.4.1：
Regular Sets of Dependency Structures / 7.1：
Algebraic Recognizability / 7.1.1：
Elementary Properties / 7.1.2：
Regular Term Grammars / 7.1.3：
Regular Dependency Grammars / 7.1.4：
Dependency Languages and Lexicalized Grammars / 7.1.5：
Pumping Lemmata / 7.2：
The Pumping Lemma for Regular Term Languages / 7.2.1：
Ogden's Lemma for Regular Term Languages / 7.2.2：
Constant Growth / 7.3：
Constant Growth and Semilinearity / 7.3.1：
Regular Term Languages are Semilinear / 7.3.2：
Generative Capacity and Parsing Complexity / 7.3.3：
Projection of String Languages / 8.1：
Labelled Dependency Structures / 8.1.1：
String-Generating Regular Dependency Grammars / 8.1.2：
String-Generative Capacity / 8.1.3：
String Languages and Structural Properties / 8.2：
Masked Strings / 8.2.1：
Enforcing a Given Block-Degree / 8.2.2：
Enforcing Ill-Nestedness / 8.2.3：
Hierarchies of String Languages / 8.2.4：
Parsing Complexity / 8.2.5：
Membership Problems / 8.3.1：
The Standard Membership Problem / 8.3.2：
The Uniform Membership Problem / 8.3.3：
Recognition of Well-Nested Languages / 8.3.4：
Conclusion / 8.3.5：
Main Contributions / 9.1：
Future Directions / 9.2：
Development of the Formalism / 9.2.1：
Linguistic Relevance / 9.2.2：
Applications to Parsing / 9.2.3：
An Algebraic Perspective on Grammar Formalisms / 9.2.4：
References
Index
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
12.

電子ブック
ＥＢ
12. Dependency Structures and Lexicalized Grammars
Marco Kuhlmann, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
Generative Capacity and Non-projectivity / 1.1.2：
Lexicalized Grammars Induce Dependency Trees / 1.2：
Overview of the Book / 1.3：
Dependency Languages / 1.3.1：
Contributions / 1.3.3：
Preliminaries / 2：
Projective Dependency Structures / 3：
Projectivity / 3.1：
Projectivity in the Sense of Harper and Hays / 3.1.1：
Projectivity in the Sense of Lecerf and Ihm / 3.1.2：
Projectivity in the Sense of Fitialov / 3.1.3：
Related Work / 3.1.4：
Algebraic Framework / 3.2：
Tree Traversal Strategies / 3.2.1：
Traversal of Treelet-Ordered Trees / 3.2.2：
Order Annotations / 3.2.3：
Dependency Algebras / 3.2.4：
Algorithmic Problems / 3.3：
Encoding and Decoding / 3.3.1：
Testing whether a Dependency Structure Is Projective / 3.3.2：
Empirical Evaluation / 3.3.3：
The Projectivity Hypothesis / 3.4.1：
Experimental Setup / 3.4.2：
Results and Discussion / 3.4.3：
Dependency Structures of Bounded Degree / 3.4.4：
The Block-Degree Measure / 4.1：
Blocks and Block-Degree / 4.1.1：
A Hierarchy of Non-projective Dependency Structures / 4.1.2：
Traversal of Block-Ordered Trees / 4.1.3：
Segmented Dependency Structures / 4.2.2：
Dependency Structure Algebras / 4.2.3：
Encoding / 4.3：
Computing the Block-Degree of a Dependency Structure / 4.3.2：
Dependency Structures without Crossings / 4.4：
Weakly Non-projective Dependency Structures / 5.1：
Definition of Weak Non-projectivity / 5.1.1：
Relation to the Block-Degree Measure / 5.1.2：
Algebraic Opaqueness / 5.1.3：
Well-Nested Dependency Structures / 5.1.4：
Definition of Well-Nestedness / 5.2.1：
Non-crossing Partitions / 5.2.2：
Algebraic Characterization / 5.2.3：
Testing whether a Dependency Structure Is Well-Nested / 5.2.4：
Structures and Grammars / 5.2.5：
Context-Free Grammars / 6.1：
Definition / 6.1.1：
String Semantics / 6.1.2：
Linearization Semantics / 6.1.3：
Dependency Semantics / 6.1.4：
Linear Context-Free Rewriting Systems / 6.2：
Non-essential Concatenation Functions / 6.2.1：
Coupled Context-Free Grammars / 6.2.4：
Tree Adjoining Grammar / 6.3.1：
Regular Dependency Languages / 6.4.1：
Regular Sets of Dependency Structures / 7.1：
Algebraic Recognizability / 7.1.1：
Elementary Properties / 7.1.2：
Regular Term Grammars / 7.1.3：
Regular Dependency Grammars / 7.1.4：
Dependency Languages and Lexicalized Grammars / 7.1.5：
Pumping Lemmata / 7.2：
The Pumping Lemma for Regular Term Languages / 7.2.1：
Ogden's Lemma for Regular Term Languages / 7.2.2：
Constant Growth / 7.3：
Constant Growth and Semilinearity / 7.3.1：
Regular Term Languages are Semilinear / 7.3.2：
Generative Capacity and Parsing Complexity / 7.3.3：
Projection of String Languages / 8.1：
Labelled Dependency Structures / 8.1.1：
String-Generating Regular Dependency Grammars / 8.1.2：
String-Generative Capacity / 8.1.3：
String Languages and Structural Properties / 8.2：
Masked Strings / 8.2.1：
Enforcing a Given Block-Degree / 8.2.2：
Enforcing Ill-Nestedness / 8.2.3：
Hierarchies of String Languages / 8.2.4：
Parsing Complexity / 8.2.5：
Membership Problems / 8.3.1：
The Standard Membership Problem / 8.3.2：
The Uniform Membership Problem / 8.3.3：
Recognition of Well-Nested Languages / 8.3.4：
Conclusion / 8.3.5：
Main Contributions / 9.1：
Future Directions / 9.2：
Development of the Formalism / 9.2.1：
Linguistic Relevance / 9.2.2：
Applications to Parsing / 9.2.3：
An Algebraic Perspective on Grammar Formalisms / 9.2.4：
References
Index
Introduction / 1：
Motivation / 1.1：
Dependency Structures / 1.1.1：
13.

電子ブック
ＥＢ
13. Resource Allocation in Wireless Networks
S?�?��awomir Staanczak, Holger Boche, Takeo Kanade, Marcin Wiczanowski
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
Some Basic Definitions / 1.1：
Some Bounds on the Perron Root and Their Applications / 1.2：
Concavity of the Perron Root on Some Subsets of Irreducible Matrices / 1.2.1：
Kullback-Leibler Divergence Characterization / 1.2.2：
Some Extended Perron Root Characterizations / 1.2.3：
Collatz-Wielandt-Type Characterization of the Perron Root / 1.2.4：
Convexity of the Perron Root / 1.3：
Some Definitions / 1.3.1：
Sufficient Conditions / 1.3.2：
Convexity of the Feasibility Set / 1.3.3：
Necessary Conditions / 1.3.4：
Special Classes of Matrices / 1.4：
Symmetric Matrices / 1.4.1：
Symmetric Positive Semidefinite Matrices / 1.4.2：
The Perron Root Under the Linear Mapping / 1.5：
Some Bounds / 1.5.1：
Disproof of the Conjecture / 1.5.2：
Some Remarks on Arbitrary Nonnegative Matrices / 1.6：
Log-Convexity of the Spectral Radius / 1.6.1：
Characterization of the Spectral Radius / 1.6.2：
Collatz-Wielandt-Type Characterization of the Spectral Radius / 1.6.3：
Bibliograpical Notes / 1.7：
On the Positive Solution to a Linear System with Nonnegative Coefficients / 2：
Basic Concepts and Definitions / 2.1：
Feasibility Sets / 2.2：
Convexity Results / 2.3：
Log-Convexity of the Positive Solution / 2.3.1：
Strict Log-Convexity / 2.3.2：
Strict Convexity of the Feasibility Sets / 2.3.4：
The Linear Case / 2.4：
Applications and Algorithms / Part II：
Introduction / 3：
Network Model / 4：
Basic Definitions / 4.1：
Medium Access Control / 4.2：
Wireless Communication Channel / 4.3：
Signal-to-Interference Ratio / 4.3.1：
Power Constraints / 4.3.2：
Data Rate Model / 4.3.3：
Two Examples / 4.3.4：
Resource Allocation Problem in Communications Networks / 5：
End-to-End Rate Control in Wired Networks / 5.1：
Fairness Criteria / 5.1.1：
Algorithms / 5.1.2：
Problem Formulation for Wireless Networks / 5.2：
Joint Power Control and Link Scheduling / 5.2.1：
Feasible Rate Region / 5.2.2：
End-to-End Window-Based Rate Control for Wireless Networks / 5.2.3：
MAC Layer Fair Rate Control for Wireless Networks / 5.2.4：
Utility-Based Power Control / 5.2.5：
Interpretation in the QoS Domain / 5.3：
Remarks on Joint Power Control and Link Scheduling / 5.4：
Optimal Joint Power Control and Link Scheduling / 5.4.1：
High SIR Regime / 5.4.2：
Low SIR Regime / 5.4.3：
Wireless Links with Self-Interference / 5.4.4：
Remarks on the Efficiency-Fairness Trade Off / 5.5：
Efficiency of the Max-Min Fair Power Allocation / 5.5.1：
Axiom-Based Interference Model / 5.5.2：
Power Control Algorithm / 6：
Convex Statement of the Problem / 6.1：
Strong Convexity Conditions / 6.3：
Gradient Projection Algorithm / 6.4：
Global Convergence / 6.4.1：
Rate of Convergence / 6.4.2：
Diagonal Scaling / 6.4.3：
Projection on a Closed Convex Set / 6.4.4：
Distributed Implementation / 6.5：
Local and Global Parts of the Gradient Vector / 6.5.1：
Adjoint Network / 6.5.2：
Distributed Handshake Protocol / 6.5.3：
Noisy Measurements / 6.5.4：
Appendices / Part III：
Some Concepts and Results from Matrix Analysis / A：
Vectors and Vector Norms / A.1：
Matrices and Matrix Norms / A.2：
Square Matrices and Eigenvalues / A.3：
Spectral Radius and Neumann Series / A.3.1：
Orthogonal, Symmetric and Positive Semidefinite Matrices / A.3.2：
Perron-Frobenius Theory / A.4：
Perron-Frobenius Theorem for Irreducible Matrices / A.4.1：
Perron-Frobenius Theorem for Primitive Matrices / A.4.2：
Some Remarks on Reducible Matrices / A.4.3：
The Existence of a Positive Solution p to ([alpha]I - X)p = b / A.4.4：
Some Concepts and Results from Convex Analysis / B：
Sets and Functions / B.1：
Convex Sets and Functions / B.2：
Strong Convexity / B.2.1：
Log-Convex Functions / B.3：
Inverse Functions of Monotonic Log-Convex Functions / B.3.1：
Convergence of Gradient Projection Algorithms / B.4：
References
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
14.

電子ブック
ＥＢ
14. Resource Allocation in Wireless Networks
SŁ°awomir Staanczak, Holger Boche, Takeo Kanade, Marcin Wiczanowski
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
Some Basic Definitions / 1.1：
Some Bounds on the Perron Root and Their Applications / 1.2：
Concavity of the Perron Root on Some Subsets of Irreducible Matrices / 1.2.1：
Kullback-Leibler Divergence Characterization / 1.2.2：
Some Extended Perron Root Characterizations / 1.2.3：
Collatz-Wielandt-Type Characterization of the Perron Root / 1.2.4：
Convexity of the Perron Root / 1.3：
Some Definitions / 1.3.1：
Sufficient Conditions / 1.3.2：
Convexity of the Feasibility Set / 1.3.3：
Necessary Conditions / 1.3.4：
Special Classes of Matrices / 1.4：
Symmetric Matrices / 1.4.1：
Symmetric Positive Semidefinite Matrices / 1.4.2：
The Perron Root Under the Linear Mapping / 1.5：
Some Bounds / 1.5.1：
Disproof of the Conjecture / 1.5.2：
Some Remarks on Arbitrary Nonnegative Matrices / 1.6：
Log-Convexity of the Spectral Radius / 1.6.1：
Characterization of the Spectral Radius / 1.6.2：
Collatz-Wielandt-Type Characterization of the Spectral Radius / 1.6.3：
Bibliograpical Notes / 1.7：
On the Positive Solution to a Linear System with Nonnegative Coefficients / 2：
Basic Concepts and Definitions / 2.1：
Feasibility Sets / 2.2：
Convexity Results / 2.3：
Log-Convexity of the Positive Solution / 2.3.1：
Strict Log-Convexity / 2.3.2：
Strict Convexity of the Feasibility Sets / 2.3.4：
The Linear Case / 2.4：
Applications and Algorithms / Part II：
Introduction / 3：
Network Model / 4：
Basic Definitions / 4.1：
Medium Access Control / 4.2：
Wireless Communication Channel / 4.3：
Signal-to-Interference Ratio / 4.3.1：
Power Constraints / 4.3.2：
Data Rate Model / 4.3.3：
Two Examples / 4.3.4：
Resource Allocation Problem in Communications Networks / 5：
End-to-End Rate Control in Wired Networks / 5.1：
Fairness Criteria / 5.1.1：
Algorithms / 5.1.2：
Problem Formulation for Wireless Networks / 5.2：
Joint Power Control and Link Scheduling / 5.2.1：
Feasible Rate Region / 5.2.2：
End-to-End Window-Based Rate Control for Wireless Networks / 5.2.3：
MAC Layer Fair Rate Control for Wireless Networks / 5.2.4：
Utility-Based Power Control / 5.2.5：
Interpretation in the QoS Domain / 5.3：
Remarks on Joint Power Control and Link Scheduling / 5.4：
Optimal Joint Power Control and Link Scheduling / 5.4.1：
High SIR Regime / 5.4.2：
Low SIR Regime / 5.4.3：
Wireless Links with Self-Interference / 5.4.4：
Remarks on the Efficiency-Fairness Trade Off / 5.5：
Efficiency of the Max-Min Fair Power Allocation / 5.5.1：
Axiom-Based Interference Model / 5.5.2：
Power Control Algorithm / 6：
Convex Statement of the Problem / 6.1：
Strong Convexity Conditions / 6.3：
Gradient Projection Algorithm / 6.4：
Global Convergence / 6.4.1：
Rate of Convergence / 6.4.2：
Diagonal Scaling / 6.4.3：
Projection on a Closed Convex Set / 6.4.4：
Distributed Implementation / 6.5：
Local and Global Parts of the Gradient Vector / 6.5.1：
Adjoint Network / 6.5.2：
Distributed Handshake Protocol / 6.5.3：
Noisy Measurements / 6.5.4：
Appendices / Part III：
Some Concepts and Results from Matrix Analysis / A：
Vectors and Vector Norms / A.1：
Matrices and Matrix Norms / A.2：
Square Matrices and Eigenvalues / A.3：
Spectral Radius and Neumann Series / A.3.1：
Orthogonal, Symmetric and Positive Semidefinite Matrices / A.3.2：
Perron-Frobenius Theory / A.4：
Perron-Frobenius Theorem for Irreducible Matrices / A.4.1：
Perron-Frobenius Theorem for Primitive Matrices / A.4.2：
Some Remarks on Reducible Matrices / A.4.3：
The Existence of a Positive Solution p to ([alpha]I - X)p = b / A.4.4：
Some Concepts and Results from Convex Analysis / B：
Sets and Functions / B.1：
Convex Sets and Functions / B.2：
Strong Convexity / B.2.1：
Log-Convex Functions / B.3：
Inverse Functions of Monotonic Log-Convex Functions / B.3.1：
Convergence of Gradient Projection Algorithms / B.4：
References
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
15.

電子ブック
ＥＢ
15. Semantic Techniques for the Web
Fran?��ois Bry, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Hybrid Reasoning with Rules and Ontologies / W&lslash;odzimierz Drabent ; Thomas Eiter ; Giovambattista Ianni ; Thomas Krennwallner ; Thomas Lukasiewicz ; Jan Ma&lslash;uszyński1：
Introduction / 1.1：
Overview of Approaches / 1.2：
RDF and RDF Schema / 1.2.1：
The Web Ontology Language OWL / 1.2.2：
Rule Languages for Integration / 1.2.3：
Rule Interchange Format RIF / 1.2.4：
Approaches to Integration / 1.2.5：
Hybrid Rules and Ontologies in REWERSE / 1.3：
Extensions of Expressive Non-monotonic Logic Programs by DL-Programs and HEX-Programs / 1.3.1：
DL-Programs / 1.3.2：
HEX-Programs / 1.3.3：
Extensions of Well-Founded Semantics by Hybrid Well-Founded Semantics / 1.3.4：
Variants and Extensions of the Basic Formalisms / 1.4：
Probabilistic DL-Programs / 1.4.1：
Fuzzy DL-Programs / 1.4.2：
CQ-Programs / 1.4.3：
Conclusion / 1.5：
Four Lessons in Versatility or How Query Languages Adapt to the Web / François Bry ; Tim Furche ; Benedikt Linse ; Alexander Pohl ; Antonius Weinzierl ; Olga Yestekhina2：
Versatile Data / 2.1：
Extensible Markup Language (XML) / 2.2.1：
Resource Description Framework (RDF) / 2.2.2：
Versatile Queries / 2.3：
XML Queries-Examples and Patterns / 2.3.1：
RDF Queries-Examples and Patterns / 2.3.2：
Rules-Separation of Concern and Reasoning / 2.3.3：
State of the Art: The SPARQL Query Language and Its Extensions / 2.3.4：
Versatile Semantics / 2.4：
Simulation as Foundation for a Semantics of Versatile Queries / 2.4.1：
Rules with Negation and Versatile Queries: Local Stratification / 2.4.2：
Rules with Negation and Versatile Queries: Well-Founded Semantics / 2.4.3：
A Relational Semantics for Versatile Queries / 2.4.4：
Versatile Evaluation / 2.5：
Evaluating Queries: Structure Scaling with CIQCAG / 2.5.1：
Evaluating Rules: Subsumption under Rich Unification / 2.5.2：
Evolution and Reactivity in the Semantic Web / José Júlio Alferes ; Michael Eckert ; Wolfgang May2.6：
Starting Point and Related Work / 3.1：
Conceptualization of ECA Rules and Their Components: A General Framework for ECA Rules / 3.3：
The Rule Level / 3.3.1：
The Event Component / 3.3.2：
The Condition Component / 3.3.3：
The Action Component / 3.3.4：
Languages and Language Borders / 3.3.5：
Languages Types, Service Types, and Tasks / 3.3.6：
Architecture and Processing: Cooperation between Resources / 3.3.7：
The RDF Level: Language Elements and Their Instances as Resources / 3.3.8：
MARS Implementation / 3.3.9：
r3 Implementation / 3.3.10：
X Change-A Concrete Web-Based ECA Rule Language / 3.4：
Representing, Querying, and Constructing Web Data / 3.4.1：
Event-Condition-Action (ECA) Rules / 3.4.2：
Events / 3.4.3：
Conditions / 3.4.4：
Actions / 3.4.5：
Applications / 3.4.6：
Conclusions and Outlook / 3.5：
Rule-Based Policy Representations and Reasoning / Piero Andrea Bonatti ; Juri Luca De Coi ; Daniel Olmedilla ; Luigi Sauro4：
A Review of the State-of-the-Art in Policy Languages / 4.1：
Related Work / 4.2.1：
Background / 4.2.2：
Presentation of the Considered Policy Languages / 4.2.3：
Presentation of the Considered Criteria / 4.2.4：
Comparison / 4.2.5：
Discussion / 4.2.6：
A Framework for Semantic Web Policies / 4.3：
Policies as Semantic Markup in Protune / 4.3.1：
Negotiations / 4.3.2：
Protune's Policy Language and Framework / 4.3.3：
Explanations: Protune-X / 4.3.4：
The Engine / 4.3.5：
Demo: Policy-Driven Protection and Personalization of Web Content / 4.3.6：
Experimental Evaluation / 4.3.7：
Discussion and Conclusions / 4.3.8：
Component Models for Semantic Web Languages / Jakob Henriksson ; Uwe Aßmann5：
Composition Systems and Component Models / 5.1：
Web Query Language Xcerpt / 5.2.2：
Description Logics and OWL / 5.2.3：
State of the Art: Semantic Web Components and Invasive Software Component Models / 5.3：
Query Modularization / 5.3.1：
Ontology Modularization / 5.3.2：
Invasive Component Models in Software Engineering / 5.3.3：
Use-Cases: Components on the Web / 5.4：
Modular Xcerpt / 5.4.1：
Role Models as Ontology Components / 5.4.2：
Universal Component Models / 5.5：
Universal Grammar-Based Modularization (U-GBM) / 5.5.1：
Universal Invasive Software Composition (U-ISC) / 5.5.2：
Universal Syntactic Abstractions with Embedded ISC / 5.5.3：
Example Application: Modular Xcerpt / 5.6：
Conclusions / 5.7：
Controlled English for Reasoning on the Semantic Web / Norbert E. Fucks ; Kaarel Kaljurand ; Tobias Kuhn6：
Why Use Controlled Natural Languages for the Semantic Web? / 6.1：
Controlled Natural Languages: State of the Art / 6.2：
Attempto Controlled English (ACE) / 6.3：
Overview of Attempto Controlled English / 6.3.1：
From Attempto Controlled English to First-Order Logic / 6.3.2：
Attempto Parsing Engine (APE) / 6.3.3：
Fitting ACE into the Semantic Web / 6.4：
OWL and SWRL / 6.4.1：
AceRules: Rules in ACE / 6.4.2：
The Protune Policy Language / 6.4.3：
Other Web Languages / 6.4.4：
ACE Tools for the Semantic Web / 6.5：
Attempto Reasoner RACE / 6.5.1：
ACE View Ontology and Rule Editor / 6.5.2：
AceWiki: ACE in a Semantic Wiki / 6.5.3：
Protune / 6.5.4：
Semantic Search with GoPubMed / Andreas Doms ; Michael Schroeder6.6：
Biomedical Literature Search / 7.1：
Limits of Classical Search / 7.1.1：
Biomedical Search Engines / 7.1.2：
The Ontology-Based Search Paradigm / 7.1.3：
Answering Biomedical Questions / 7.2：
Characterization of Question Types / 7.2.1：
Using Background Knowledge to Answer Questions / 7.2.2：
Revealing Trends in the Literature / 7.3：
Important Topic: Apotosis / 7.3.1：
Important Topic: Endosome / 7.3.2：
Important Place: Dresden / 7.3.3：
Important Journal: Which Are the 10 Most Frequently Used GO Terms in Nature, Cell and Science? / 7.3.4：
20 Journals for the Molecular Biologist / 7.3.5：
Information Integration in Bioinformatics with Ontologies and Standards / Patrick Lambrix ; Lena Strömbäck ; He Tan7.4：
Resources / 8.1：
Data Sources / 8.2.1：
Ontologies / 8.2.2：
Standards / 8.2.3：
Integrating the Resources / 8.3：
Integration Model / 8.3.1：
Integration of Data Sources / 8.3.2：
Data Sources and Ontologies / 8.3.3：
Ontology Alignment / 8.3.4：
Integrating Standards / 8.3.5：
Connection between Standards and Other Resources / 8.3.6：
Author Index / 8.4：
Hybrid Reasoning with Rules and Ontologies / W&lslash;odzimierz Drabent ; Thomas Eiter ; Giovambattista Ianni ; Thomas Krennwallner ; Thomas Lukasiewicz ; Jan Ma&lslash;uszyński1：
Introduction / 1.1：
Overview of Approaches / 1.2：
16.

電子ブック
ＥＢ
16. Semantic Techniques for the Web
François Bry, Takeo Kanade, Josef Kittler, Jan Maluszynski
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Hybrid Reasoning with Rules and Ontologies / W&lslash;odzimierz Drabent ; Thomas Eiter ; Giovambattista Ianni ; Thomas Krennwallner ; Thomas Lukasiewicz ; Jan Ma&lslash;uszyński1：
Introduction / 1.1：
Overview of Approaches / 1.2：
RDF and RDF Schema / 1.2.1：
The Web Ontology Language OWL / 1.2.2：
Rule Languages for Integration / 1.2.3：
Rule Interchange Format RIF / 1.2.4：
Approaches to Integration / 1.2.5：
Hybrid Rules and Ontologies in REWERSE / 1.3：
Extensions of Expressive Non-monotonic Logic Programs by DL-Programs and HEX-Programs / 1.3.1：
DL-Programs / 1.3.2：
HEX-Programs / 1.3.3：
Extensions of Well-Founded Semantics by Hybrid Well-Founded Semantics / 1.3.4：
Variants and Extensions of the Basic Formalisms / 1.4：
Probabilistic DL-Programs / 1.4.1：
Fuzzy DL-Programs / 1.4.2：
CQ-Programs / 1.4.3：
Conclusion / 1.5：
Four Lessons in Versatility or How Query Languages Adapt to the Web / François Bry ; Tim Furche ; Benedikt Linse ; Alexander Pohl ; Antonius Weinzierl ; Olga Yestekhina2：
Versatile Data / 2.1：
Extensible Markup Language (XML) / 2.2.1：
Resource Description Framework (RDF) / 2.2.2：
Versatile Queries / 2.3：
XML Queries-Examples and Patterns / 2.3.1：
RDF Queries-Examples and Patterns / 2.3.2：
Rules-Separation of Concern and Reasoning / 2.3.3：
State of the Art: The SPARQL Query Language and Its Extensions / 2.3.4：
Versatile Semantics / 2.4：
Simulation as Foundation for a Semantics of Versatile Queries / 2.4.1：
Rules with Negation and Versatile Queries: Local Stratification / 2.4.2：
Rules with Negation and Versatile Queries: Well-Founded Semantics / 2.4.3：
A Relational Semantics for Versatile Queries / 2.4.4：
Versatile Evaluation / 2.5：
Evaluating Queries: Structure Scaling with CIQCAG / 2.5.1：
Evaluating Rules: Subsumption under Rich Unification / 2.5.2：
Evolution and Reactivity in the Semantic Web / José Júlio Alferes ; Michael Eckert ; Wolfgang May2.6：
Starting Point and Related Work / 3.1：
Conceptualization of ECA Rules and Their Components: A General Framework for ECA Rules / 3.3：
The Rule Level / 3.3.1：
The Event Component / 3.3.2：
The Condition Component / 3.3.3：
The Action Component / 3.3.4：
Languages and Language Borders / 3.3.5：
Languages Types, Service Types, and Tasks / 3.3.6：
Architecture and Processing: Cooperation between Resources / 3.3.7：
The RDF Level: Language Elements and Their Instances as Resources / 3.3.8：
MARS Implementation / 3.3.9：
r3 Implementation / 3.3.10：
X Change-A Concrete Web-Based ECA Rule Language / 3.4：
Representing, Querying, and Constructing Web Data / 3.4.1：
Event-Condition-Action (ECA) Rules / 3.4.2：
Events / 3.4.3：
Conditions / 3.4.4：
Actions / 3.4.5：
Applications / 3.4.6：
Conclusions and Outlook / 3.5：
Rule-Based Policy Representations and Reasoning / Piero Andrea Bonatti ; Juri Luca De Coi ; Daniel Olmedilla ; Luigi Sauro4：
A Review of the State-of-the-Art in Policy Languages / 4.1：
Related Work / 4.2.1：
Background / 4.2.2：
Presentation of the Considered Policy Languages / 4.2.3：
Presentation of the Considered Criteria / 4.2.4：
Comparison / 4.2.5：
Discussion / 4.2.6：
A Framework for Semantic Web Policies / 4.3：
Policies as Semantic Markup in Protune / 4.3.1：
Negotiations / 4.3.2：
Protune's Policy Language and Framework / 4.3.3：
Explanations: Protune-X / 4.3.4：
The Engine / 4.3.5：
Demo: Policy-Driven Protection and Personalization of Web Content / 4.3.6：
Experimental Evaluation / 4.3.7：
Discussion and Conclusions / 4.3.8：
Component Models for Semantic Web Languages / Jakob Henriksson ; Uwe Aßmann5：
Composition Systems and Component Models / 5.1：
Web Query Language Xcerpt / 5.2.2：
Description Logics and OWL / 5.2.3：
State of the Art: Semantic Web Components and Invasive Software Component Models / 5.3：
Query Modularization / 5.3.1：
Ontology Modularization / 5.3.2：
Invasive Component Models in Software Engineering / 5.3.3：
Use-Cases: Components on the Web / 5.4：
Modular Xcerpt / 5.4.1：
Role Models as Ontology Components / 5.4.2：
Universal Component Models / 5.5：
Universal Grammar-Based Modularization (U-GBM) / 5.5.1：
Universal Invasive Software Composition (U-ISC) / 5.5.2：
Universal Syntactic Abstractions with Embedded ISC / 5.5.3：
Example Application: Modular Xcerpt / 5.6：
Conclusions / 5.7：
Controlled English for Reasoning on the Semantic Web / Norbert E. Fucks ; Kaarel Kaljurand ; Tobias Kuhn6：
Why Use Controlled Natural Languages for the Semantic Web? / 6.1：
Controlled Natural Languages: State of the Art / 6.2：
Attempto Controlled English (ACE) / 6.3：
Overview of Attempto Controlled English / 6.3.1：
From Attempto Controlled English to First-Order Logic / 6.3.2：
Attempto Parsing Engine (APE) / 6.3.3：
Fitting ACE into the Semantic Web / 6.4：
OWL and SWRL / 6.4.1：
AceRules: Rules in ACE / 6.4.2：
The Protune Policy Language / 6.4.3：
Other Web Languages / 6.4.4：
ACE Tools for the Semantic Web / 6.5：
Attempto Reasoner RACE / 6.5.1：
ACE View Ontology and Rule Editor / 6.5.2：
AceWiki: ACE in a Semantic Wiki / 6.5.3：
Protune / 6.5.4：
Semantic Search with GoPubMed / Andreas Doms ; Michael Schroeder6.6：
Biomedical Literature Search / 7.1：
Limits of Classical Search / 7.1.1：
Biomedical Search Engines / 7.1.2：
The Ontology-Based Search Paradigm / 7.1.3：
Answering Biomedical Questions / 7.2：
Characterization of Question Types / 7.2.1：
Using Background Knowledge to Answer Questions / 7.2.2：
Revealing Trends in the Literature / 7.3：
Important Topic: Apotosis / 7.3.1：
Important Topic: Endosome / 7.3.2：
Important Place: Dresden / 7.3.3：
Important Journal: Which Are the 10 Most Frequently Used GO Terms in Nature, Cell and Science? / 7.3.4：
20 Journals for the Molecular Biologist / 7.3.5：
Information Integration in Bioinformatics with Ontologies and Standards / Patrick Lambrix ; Lena Strömbäck ; He Tan7.4：
Resources / 8.1：
Data Sources / 8.2.1：
Ontologies / 8.2.2：
Standards / 8.2.3：
Integrating the Resources / 8.3：
Integration Model / 8.3.1：
Integration of Data Sources / 8.3.2：
Data Sources and Ontologies / 8.3.3：
Ontology Alignment / 8.3.4：
Integrating Standards / 8.3.5：
Connection between Standards and Other Resources / 8.3.6：
Author Index / 8.4：
Hybrid Reasoning with Rules and Ontologies / W&lslash;odzimierz Drabent ; Thomas Eiter ; Giovambattista Ianni ; Thomas Krennwallner ; Thomas Lukasiewicz ; Jan Ma&lslash;uszyński1：
Introduction / 1.1：
Overview of Approaches / 1.2：
17.

電子ブック
ＥＢ
17. Towards Digital Optical Networks
Ioannis Tomkos, Karin Ennser, Takeo Kanade, Martin K?hn, Branko Mikac, Maria Spyropoulou
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
Transmission of 8-Level 240 Gb/s RZ-DQPSK-ASK / 1.1：
Four Bits per Symbol 16-ary Transmission Experiments / 1.3：
Optical Rate Conversion Units / 1.4：
Optical Packet Compression and Expansion / 1.4.1：
Optical Compression/Expansion Loop / 1.4.2：
Optical Delay Line Structure / 1.4.3：
Scalable Packet Compression/Expansion Units / 1.4.4：
Transmission Efficiency / 1.4.5：
References
Electronic Channel Equalization Techniques / 2：
Electronic Equalizers / 2.1：
Fundamental Limits of MLSE Performance with Large Number of States / 2.3：
No PD-Filter, 8 Samples/Bit / 2.3.1：
With PD-Filter, 2 Samples/Bit / 2.3.2：
Large Optical Filter, 2 Samples/Bit / 2.3.3：
Large Optical Filter, 1 Sample/Bit / 2.3.4：
Compensation of SPM Using MLSE / 2.3.5：
Nonlinear Electrical Equalization for Different Modulation Formats / 2.4：
Introduction of NL-FFE-DFE / 2.4.1：
System Setups and Parameters / 2.4.2：
EDC Performance for Different Modulation Formats / 2.4.3：
Optical Single Sideband Modulation / 2.5：
Compensation of Optical Dispersion / 2.5.1：
Reduction of Nonlinear Transmission Effects / 2.5.2：
Enhancing the Performance DML Transmitters / 2.6：
Conclusions / 2.7：
Optical Signal Processing Techniques for Signal Regeneration and Digital Logic / 3：
Optical Regeneration and Wavelength Conversion / 3.1：
640 Gbit/s Wavelength Conversion Based on XPM in HNLF / 3.1.1：
Wavelength Conversion and Regeneration Based on Supercontinuum Generation / 3.1.2：
Multi-Wavelength Conversion at 10 Gb/s and 40 GHz Using a Hybrid Integrated SOA Mach-Zehnder Interferometer / 3.1.3：
All-Optical Multi-Wavelength Regeneration Based on Quantum-Dot Semiconductor Optical Amplifiers for High Bit Rates / 3.1.4：
Optoelectronic Clock Recovery, Retiming and OTDM Demultiplexing / 3.2：
320 Gbit/s Clock Transmission and Channel Identification / 3.2.1：
Filtering-Assisted Cross-Phase Modulation in a Semiconductor Optical Amplifier Enabling 320 Gb/s Clock Recovery / 3.2.2：
640 Gbit/s Data Transmission and Clock Recovery Using an Ultra-Fast Periodically Poled Lithium Niobate Device / 3.2.3：
All-Optical Clock Extraction Circuit Based on a Mode-Locked Ring Laser Comprising SOA and FP Filter / 3.2.4：
OTDM Demux Based on Induced Modulation on an Auxiliary Carrier by Means of Super-Continuum Generation / 3.2.5：
160 Gb/s Retiming Using Rectangular Pulses Generated Using a Superstructured Fibre Bragg Grating / 3.2.6：
Timing Jitter Tolerant 640 Gb/s Demultiplexing Using a Long-Period Fibre Grating-Based Flat-Top Pulse Shaper / 3.2.7：
Evolution of Optical Access Networks / 4：
Introduction: FTTX Developments / 4.1：
FTTX Architectures / 4.1.1：
Current Standard PON Deployment Worldwide / 4.1.2：
Emerging Standards for 100 Gbit Ethernet Access and Beyond / 4.2：
Introduction - Why Higher Speed Ethernet? / 4.2.1：
100 Gbit Ethernet Challenges / 4.2.2：
Transparent Optical Transmission For 100 Gbit Ethernet / 4.2.3：
Future Directions / 4.2.4：
Interoperability of TDM and WDM PONs / 4.3：
Network Architecture / 4.3.1：
Network Routing Performance / 4.3.3：
3G Radio Distribution over Fibre / 4.3.4：
Optical Wireless for Last Mile Access / 4.4.1：
FSO Networks / 4.5.1：
Propagation Results / 4.5.3：
Dynamic Bandwidth Allocation Protocols over GPONs / 4.5.4：
Dynamic Bandwidth Allocation Protocols / 4.6.1：
Innovative Architecture and Control Plane for Metro-Access Convergence / 4.6.3：
Motivation for Metro-Access Convergence / 4.7.1：
Unified Metro-Access Networks Criteria / 4.7.2：
A Few Examples of Unified Metro-Access Networks (UMAN) / 4.7.3：
The Success + Network / 4.7.4：
The Success + Network Topology / 4.7.5：
The Success + UMAN Control Plane / 4.7.6：
Conclusion / 4.7.7：
Protection Schemes for PONs / 4.8：
Evolution of PON Protection Schemes / 4.8.1：
Recent PON Protection Architectures / 4.8.2：
Hybrid WDM/TDM PON / 4.8.3：
Reliability Performance Evaluation / 4.8.4：
Novel Switch Architectures / 5：
Application of Quantum-Dot SOAs for the Realization of All-Optical Buffer Architectures up to 160 Gb/s / 5.1：
Multiwavelength Optical Buffers / 5.3：
New Buffer Architectures / 5.3.1：
Scheduling Algorithms / 5.3.2：
Performance Evaluation / 5.3.3：
Multi-Stage Optical Switches with Optical Recirculation Buffers / 5.4：
The Switching Fabric Architecture / 5.4.1：
Scheduling Algorithms for the Single-Stage Shared FDL Switch / 5.4.2：
Scheduling Algorithms for the Three-Stage Shared FDL Optical Clos-Network Switch / 5.4.3：
Simulation Experiments / 5.4.4：
Optical Asynchronous Packet Switch Architectures / 5.5：
All-Optical Buffer Technologies / 5.5.1：
Node Architectures / 5.5.2：
Future Outlook (Part I) / 5.5.3：
Introduction (Part II) / Part II：
Cross-Layer Optimization Issues for Realizing Transparent Mesh Optical Networks / 6：
An Impairment Aware Networking Approach for Transparent Mesh Optical Networks / 6.1：
Transparent Optical Network Challenges / 6.1.1：
Proposed Approach / 6.1.3：
Mutual Impact of Physical Impairments and Traffic Grooming Capable Nodes with Limited Number of O/E/O / 6.2：
Motivation / 6.2.1：
Modelling the Physical Layer Impairments / 6.2.2：
The Routing Model / 6.2.3：
Simulation Results / 6.2.4：
Performance Issues in Optical Burst/Packet Switching / 6.3：
OBS/OPS Performance / 7.1：
Introduction and State-of-the-Art / 7.2.1：
On the Use of Balking for Estimation of the Blocking Probability for OBS Routers with FDL Lines / 7.2.2：
A Performance Comparison of Synchronous Slotted OPS Switches / 7.2.3：
A Performance Comparison of OBS and OpMiGua Paradigms / 7.2.4：
Burstification Mechanisms / 7.3：
Delay-Throughput Curves for Timer-Based OBS Burstifiers with Light Load / 7.3.2：
Performance Evaluation of Adaptive Burst Assembly Algorithms in OBS Networks with Self-Similar Traffic Sources / 7.3.3：
QoS Provisioning / 7.4：
Performance Overview of QoS Mechanisms in OBS Networks / 7.4.1：
Evaluation of Preemption Probabilities in OBS Networks with Burst Segmentation / 7.4.3：
Routing Algorithms / 7.5：
Optimization of Multi-Path Routing in Optical Burst Switching Networks / 7.5.1：
TCP over OBS Networks / 7.6：
Burst Reordering Impact on TCP over OBS Networks / 7.6.1：
Multi-layer Traffic Engineering (MTE) in Grooming Enabled ASON/GMPLS Networks / 7.7：
Routing and Grooming in Multi-layer Networks / 8.1：
Basic Schemes / 8.2.1：
Adaptive Integrated Multi-layer Routing / 8.2.2：
Simulation Study / 8.2.3：
Improvements for Multi-layer Routing and Grooming Schemes / 8.3：
Online Optimization at Connection Teardown / 8.3.1：
Admission Control for Improving Fairness / 8.3.2：
Evaluation of Traffic and Network Patterns / 8.4：
Network Resilience in Future Optical Networks / 9：
Terminology / 9.1：
Basic Resilience Techniques and Failure Management / 9.3：
Resilient Network Performance Improvement, Evaluation Methods and Parameters / 9.4：
Availability Calculation in Optical Network / 9.4.1：
Recovery Time / 9.4.2：
Network Performance Improvement through Differentiated Survivability / 9.4.3：
Security Issues in Transparent Optical Networks / 9.5：
Multilayer Resilience / 9.6：
Single Layer Recovery in Multilayer Networks / 9.6.1：
Interworking between Layers / 9.6.2：
Multilayer Survivability Strategies / 9.6.3：
Logical Topology Design / 9.6.4：
Optical Storage Area Networks / 9.7：
Storage Area Networks (SANS) / 10.1：
Data Mirroring Techniques / 10.1.2：
Network Architectures / 10.2：
Proposed Mirroring Technique / 10.3：
Single Section Ring Architecture / 10.4：
Two Sections Ring Architecture / 10.4.2：
Future Outlook (Part II) / 10.5：
Introduction (Part III) / Part III：
Software Tools and Methods for Modelling Physical Layer Issues / 11：
Modelling of Optoelectronic Components (Lasers and Semiconductor Optical Amplifiers) / 11.1：
Frequency-Domain Approaches / 11.1.1：
Time-Domain Models / 11.1.3：
Lumped-Element Models / 11.1.4：
Distributed Time-Domain Models / 11.1.5：
Modeling of Hybrid Mode-Locked Lasers / 11.1.6：
Modelling of Travelling-Wave Semiconductor Optical Amplifiers / 11.1.7：
Simulation Tool MOVE-IT / 11.2：
Numerical Models for Simulation of Transient Effect in Raman Fibre Amplifiers / 11.3：
Split-Step-Fourier-Method in Modeling of WDM Links / 11.4：
Pre-simulated Local Errors S-SSMF / 11.4.1：
Results / 11.4.2：
Software Tools and Methods for Research and Education in Optical Networks / 11.4.3：
Models and Simulations / 12.1：
Modelling / 12.1.1：
Simulation Techniques / 12.1.2：
Simulation and Model Verification / 12.1.3：
Summary on Modelling / 12.1.4：
Tool Integration Perspectives / 12.2：
Integration: Definitions / 12.2.1：
Obstacles to Integration and Possible Diversions / 12.2.2：
Conclusions and Future Outlook / 12.2.3：
Modelling with OPNET: A Practical Example / 12.3：
OPNET Domains / 12.3.1：
The OPNET Project Editor / 12.3.2：
Developing Models with OPNET: Conclusion / 12.3.3：
Simulation of ASON/GMPLS Using OMNET++ Simulator / 12.4：
The OMNET Simulator and the INET Framework / 12.4.1：
IP/MPLS over ASON/GMPLS Simulator / 12.4.2：
WDM Network Planning: The MatPlanWDM Tool / 12.4.3：
Distinctions Between Planning Problems / 12.5.1：
Integrated Tool / 12.5.2：
Extension of the Tool / 12.5.3：
The Javanco Environment / 12.6：
History and Predecessors / 12.6.1：
General Architecture / 12.6.2：
Utilisations / 12.6.3：
Future Developments and Conclusion / 12.6.4：
IKR Simulation Library / 12.7：
Conceptual Structure / 12.7.1：
Libraries / 12.7.2：
Application of the Simulation Library / 12.7.3：
Summary / 12.7.4：
Future Outlook (Part III)
Future Outlook
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
18.

電子ブック
ＥＢ
18. Data Management in Cloud, Grid and P2P Systems
David Hutchison, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2012
所蔵情報: loading…
19.

電子ブック
ＥＢ
19. Data Management in Cloud, Grid and P2P Systems
David Hutchison, Takeo Kanade, Farookh Khadeer Hussain, Franck Morvan, A. Min Tjoa
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2012
所蔵情報: loading…
20.

電子ブック
ＥＢ
20. Towards Digital Optical Networks
Ioannis Tomkos, Karin Ennser, Takeo Kanade, Martin Köhn, Branko Mikac, Maria Spyropoulou
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
Transmission of 8-Level 240 Gb/s RZ-DQPSK-ASK / 1.1：
Four Bits per Symbol 16-ary Transmission Experiments / 1.3：
Optical Rate Conversion Units / 1.4：
Optical Packet Compression and Expansion / 1.4.1：
Optical Compression/Expansion Loop / 1.4.2：
Optical Delay Line Structure / 1.4.3：
Scalable Packet Compression/Expansion Units / 1.4.4：
Transmission Efficiency / 1.4.5：
References
Electronic Channel Equalization Techniques / 2：
Electronic Equalizers / 2.1：
Fundamental Limits of MLSE Performance with Large Number of States / 2.3：
No PD-Filter, 8 Samples/Bit / 2.3.1：
With PD-Filter, 2 Samples/Bit / 2.3.2：
Large Optical Filter, 2 Samples/Bit / 2.3.3：
Large Optical Filter, 1 Sample/Bit / 2.3.4：
Compensation of SPM Using MLSE / 2.3.5：
Nonlinear Electrical Equalization for Different Modulation Formats / 2.4：
Introduction of NL-FFE-DFE / 2.4.1：
System Setups and Parameters / 2.4.2：
EDC Performance for Different Modulation Formats / 2.4.3：
Optical Single Sideband Modulation / 2.5：
Compensation of Optical Dispersion / 2.5.1：
Reduction of Nonlinear Transmission Effects / 2.5.2：
Enhancing the Performance DML Transmitters / 2.6：
Conclusions / 2.7：
Optical Signal Processing Techniques for Signal Regeneration and Digital Logic / 3：
Optical Regeneration and Wavelength Conversion / 3.1：
640 Gbit/s Wavelength Conversion Based on XPM in HNLF / 3.1.1：
Wavelength Conversion and Regeneration Based on Supercontinuum Generation / 3.1.2：
Multi-Wavelength Conversion at 10 Gb/s and 40 GHz Using a Hybrid Integrated SOA Mach-Zehnder Interferometer / 3.1.3：
All-Optical Multi-Wavelength Regeneration Based on Quantum-Dot Semiconductor Optical Amplifiers for High Bit Rates / 3.1.4：
Optoelectronic Clock Recovery, Retiming and OTDM Demultiplexing / 3.2：
320 Gbit/s Clock Transmission and Channel Identification / 3.2.1：
Filtering-Assisted Cross-Phase Modulation in a Semiconductor Optical Amplifier Enabling 320 Gb/s Clock Recovery / 3.2.2：
640 Gbit/s Data Transmission and Clock Recovery Using an Ultra-Fast Periodically Poled Lithium Niobate Device / 3.2.3：
All-Optical Clock Extraction Circuit Based on a Mode-Locked Ring Laser Comprising SOA and FP Filter / 3.2.4：
OTDM Demux Based on Induced Modulation on an Auxiliary Carrier by Means of Super-Continuum Generation / 3.2.5：
160 Gb/s Retiming Using Rectangular Pulses Generated Using a Superstructured Fibre Bragg Grating / 3.2.6：
Timing Jitter Tolerant 640 Gb/s Demultiplexing Using a Long-Period Fibre Grating-Based Flat-Top Pulse Shaper / 3.2.7：
Evolution of Optical Access Networks / 4：
Introduction: FTTX Developments / 4.1：
FTTX Architectures / 4.1.1：
Current Standard PON Deployment Worldwide / 4.1.2：
Emerging Standards for 100 Gbit Ethernet Access and Beyond / 4.2：
Introduction - Why Higher Speed Ethernet? / 4.2.1：
100 Gbit Ethernet Challenges / 4.2.2：
Transparent Optical Transmission For 100 Gbit Ethernet / 4.2.3：
Future Directions / 4.2.4：
Interoperability of TDM and WDM PONs / 4.3：
Network Architecture / 4.3.1：
Network Routing Performance / 4.3.3：
3G Radio Distribution over Fibre / 4.3.4：
Optical Wireless for Last Mile Access / 4.4.1：
FSO Networks / 4.5.1：
Propagation Results / 4.5.3：
Dynamic Bandwidth Allocation Protocols over GPONs / 4.5.4：
Dynamic Bandwidth Allocation Protocols / 4.6.1：
Innovative Architecture and Control Plane for Metro-Access Convergence / 4.6.3：
Motivation for Metro-Access Convergence / 4.7.1：
Unified Metro-Access Networks Criteria / 4.7.2：
A Few Examples of Unified Metro-Access Networks (UMAN) / 4.7.3：
The Success + Network / 4.7.4：
The Success + Network Topology / 4.7.5：
The Success + UMAN Control Plane / 4.7.6：
Conclusion / 4.7.7：
Protection Schemes for PONs / 4.8：
Evolution of PON Protection Schemes / 4.8.1：
Recent PON Protection Architectures / 4.8.2：
Hybrid WDM/TDM PON / 4.8.3：
Reliability Performance Evaluation / 4.8.4：
Novel Switch Architectures / 5：
Application of Quantum-Dot SOAs for the Realization of All-Optical Buffer Architectures up to 160 Gb/s / 5.1：
Multiwavelength Optical Buffers / 5.3：
New Buffer Architectures / 5.3.1：
Scheduling Algorithms / 5.3.2：
Performance Evaluation / 5.3.3：
Multi-Stage Optical Switches with Optical Recirculation Buffers / 5.4：
The Switching Fabric Architecture / 5.4.1：
Scheduling Algorithms for the Single-Stage Shared FDL Switch / 5.4.2：
Scheduling Algorithms for the Three-Stage Shared FDL Optical Clos-Network Switch / 5.4.3：
Simulation Experiments / 5.4.4：
Optical Asynchronous Packet Switch Architectures / 5.5：
All-Optical Buffer Technologies / 5.5.1：
Node Architectures / 5.5.2：
Future Outlook (Part I) / 5.5.3：
Introduction (Part II) / Part II：
Cross-Layer Optimization Issues for Realizing Transparent Mesh Optical Networks / 6：
An Impairment Aware Networking Approach for Transparent Mesh Optical Networks / 6.1：
Transparent Optical Network Challenges / 6.1.1：
Proposed Approach / 6.1.3：
Mutual Impact of Physical Impairments and Traffic Grooming Capable Nodes with Limited Number of O/E/O / 6.2：
Motivation / 6.2.1：
Modelling the Physical Layer Impairments / 6.2.2：
The Routing Model / 6.2.3：
Simulation Results / 6.2.4：
Performance Issues in Optical Burst/Packet Switching / 6.3：
OBS/OPS Performance / 7.1：
Introduction and State-of-the-Art / 7.2.1：
On the Use of Balking for Estimation of the Blocking Probability for OBS Routers with FDL Lines / 7.2.2：
A Performance Comparison of Synchronous Slotted OPS Switches / 7.2.3：
A Performance Comparison of OBS and OpMiGua Paradigms / 7.2.4：
Burstification Mechanisms / 7.3：
Delay-Throughput Curves for Timer-Based OBS Burstifiers with Light Load / 7.3.2：
Performance Evaluation of Adaptive Burst Assembly Algorithms in OBS Networks with Self-Similar Traffic Sources / 7.3.3：
QoS Provisioning / 7.4：
Performance Overview of QoS Mechanisms in OBS Networks / 7.4.1：
Evaluation of Preemption Probabilities in OBS Networks with Burst Segmentation / 7.4.3：
Routing Algorithms / 7.5：
Optimization of Multi-Path Routing in Optical Burst Switching Networks / 7.5.1：
TCP over OBS Networks / 7.6：
Burst Reordering Impact on TCP over OBS Networks / 7.6.1：
Multi-layer Traffic Engineering (MTE) in Grooming Enabled ASON/GMPLS Networks / 7.7：
Routing and Grooming in Multi-layer Networks / 8.1：
Basic Schemes / 8.2.1：
Adaptive Integrated Multi-layer Routing / 8.2.2：
Simulation Study / 8.2.3：
Improvements for Multi-layer Routing and Grooming Schemes / 8.3：
Online Optimization at Connection Teardown / 8.3.1：
Admission Control for Improving Fairness / 8.3.2：
Evaluation of Traffic and Network Patterns / 8.4：
Network Resilience in Future Optical Networks / 9：
Terminology / 9.1：
Basic Resilience Techniques and Failure Management / 9.3：
Resilient Network Performance Improvement, Evaluation Methods and Parameters / 9.4：
Availability Calculation in Optical Network / 9.4.1：
Recovery Time / 9.4.2：
Network Performance Improvement through Differentiated Survivability / 9.4.3：
Security Issues in Transparent Optical Networks / 9.5：
Multilayer Resilience / 9.6：
Single Layer Recovery in Multilayer Networks / 9.6.1：
Interworking between Layers / 9.6.2：
Multilayer Survivability Strategies / 9.6.3：
Logical Topology Design / 9.6.4：
Optical Storage Area Networks / 9.7：
Storage Area Networks (SANS) / 10.1：
Data Mirroring Techniques / 10.1.2：
Network Architectures / 10.2：
Proposed Mirroring Technique / 10.3：
Single Section Ring Architecture / 10.4：
Two Sections Ring Architecture / 10.4.2：
Future Outlook (Part II) / 10.5：
Introduction (Part III) / Part III：
Software Tools and Methods for Modelling Physical Layer Issues / 11：
Modelling of Optoelectronic Components (Lasers and Semiconductor Optical Amplifiers) / 11.1：
Frequency-Domain Approaches / 11.1.1：
Time-Domain Models / 11.1.3：
Lumped-Element Models / 11.1.4：
Distributed Time-Domain Models / 11.1.5：
Modeling of Hybrid Mode-Locked Lasers / 11.1.6：
Modelling of Travelling-Wave Semiconductor Optical Amplifiers / 11.1.7：
Simulation Tool MOVE-IT / 11.2：
Numerical Models for Simulation of Transient Effect in Raman Fibre Amplifiers / 11.3：
Split-Step-Fourier-Method in Modeling of WDM Links / 11.4：
Pre-simulated Local Errors S-SSMF / 11.4.1：
Results / 11.4.2：
Software Tools and Methods for Research and Education in Optical Networks / 11.4.3：
Models and Simulations / 12.1：
Modelling / 12.1.1：
Simulation Techniques / 12.1.2：
Simulation and Model Verification / 12.1.3：
Summary on Modelling / 12.1.4：
Tool Integration Perspectives / 12.2：
Integration: Definitions / 12.2.1：
Obstacles to Integration and Possible Diversions / 12.2.2：
Conclusions and Future Outlook / 12.2.3：
Modelling with OPNET: A Practical Example / 12.3：
OPNET Domains / 12.3.1：
The OPNET Project Editor / 12.3.2：
Developing Models with OPNET: Conclusion / 12.3.3：
Simulation of ASON/GMPLS Using OMNET++ Simulator / 12.4：
The OMNET Simulator and the INET Framework / 12.4.1：
IP/MPLS over ASON/GMPLS Simulator / 12.4.2：
WDM Network Planning: The MatPlanWDM Tool / 12.4.3：
Distinctions Between Planning Problems / 12.5.1：
Integrated Tool / 12.5.2：
Extension of the Tool / 12.5.3：
The Javanco Environment / 12.6：
History and Predecessors / 12.6.1：
General Architecture / 12.6.2：
Utilisations / 12.6.3：
Future Developments and Conclusion / 12.6.4：
IKR Simulation Library / 12.7：
Conceptual Structure / 12.7.1：
Libraries / 12.7.2：
Application of the Simulation Library / 12.7.3：
Summary / 12.7.4：
Future Outlook (Part III)
Future Outlook
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
21.

電子ブック
ＥＢ
21. Modular Algorithms in Symbolic Summation and Symbolic Integration
J?rgen Gerhard, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Overview / 2：
Outline / 2.1：
Statement of Main Results / 2.2：
References and Related Works / 2.3：
Open Problems / 2.4：
Technical Prerequisites / 3：
Subresultants and the Euclidean Algorithm / 3.1：
The Cost of Arithmetic / 3.2：
Change of Basis / 4：
Computing Taylor Shifts / 4.1：
Conversion to Falling Factorials / 4.2：
Fast Multiplication in the Falling Factorial Basis / 4.3：
Modular Squarefree and Greatest Factorial Factorization / 5：
Squarefree Factorization / 5.1：
Greatest Factorial Factorization / 5.2：
Modular Hermite Integration / 6：
Small Primes Modular Algorithm / 6.1：
Prime Power Modular Algorithm / 6.2：
Implementation / 6.3：
Computing All Integral Roots of the Resultant / 7：
Application to Hypergeometric Summation / 7.1：
Computing All Integral Roots Via Factoring / 7.2：
Application to Hyperexponential Integration / 7.3：
Modular LRT Algorithm / 7.4：
Modular Algorithms for the Gosper-PetkovÜek Form / 8：
Modular GP′-Form Computation / 8.1：
Polynomial Solutions of Linear First Order Equations / 9：
The Method of Undetermined Coefficients / 9.1：
Brent and Kung's Algorithm for Linear Differential Equations / 9.2：
Rothstein's SPDE Algorithm / 9.3：
The ABP Algorithm / 9.4：
A Divide-and-Conquer Algorithm: Generic Case / 9.5：
A Divide-and-Conquer Algorithm: General Case / 9.6：
Barkatou's Algorithm for Linear Difference Equations / 9.7：
Modular Algorithms / 9.8：
Modular Gosper and Almkvist & Zeilberger Algorithms / 10：
High Degree Examples / 10.1：
References
Index
Introduction / 1：
Overview / 2：
Outline / 2.1：
22.

電子ブック
ＥＢ
22. Modular Algorithms in Symbolic Summation and Symbolic Integration
Jürgen Gerhard, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Overview / 2：
Outline / 2.1：
Statement of Main Results / 2.2：
References and Related Works / 2.3：
Open Problems / 2.4：
Technical Prerequisites / 3：
Subresultants and the Euclidean Algorithm / 3.1：
The Cost of Arithmetic / 3.2：
Change of Basis / 4：
Computing Taylor Shifts / 4.1：
Conversion to Falling Factorials / 4.2：
Fast Multiplication in the Falling Factorial Basis / 4.3：
Modular Squarefree and Greatest Factorial Factorization / 5：
Squarefree Factorization / 5.1：
Greatest Factorial Factorization / 5.2：
Modular Hermite Integration / 6：
Small Primes Modular Algorithm / 6.1：
Prime Power Modular Algorithm / 6.2：
Implementation / 6.3：
Computing All Integral Roots of the Resultant / 7：
Application to Hypergeometric Summation / 7.1：
Computing All Integral Roots Via Factoring / 7.2：
Application to Hyperexponential Integration / 7.3：
Modular LRT Algorithm / 7.4：
Modular Algorithms for the Gosper-PetkovÜek Form / 8：
Modular GP′-Form Computation / 8.1：
Polynomial Solutions of Linear First Order Equations / 9：
The Method of Undetermined Coefficients / 9.1：
Brent and Kung's Algorithm for Linear Differential Equations / 9.2：
Rothstein's SPDE Algorithm / 9.3：
The ABP Algorithm / 9.4：
A Divide-and-Conquer Algorithm: Generic Case / 9.5：
A Divide-and-Conquer Algorithm: General Case / 9.6：
Barkatou's Algorithm for Linear Difference Equations / 9.7：
Modular Algorithms / 9.8：
Modular Gosper and Almkvist & Zeilberger Algorithms / 10：
High Degree Examples / 10.1：
References
Index
Introduction / 1：
Overview / 2：
Outline / 2.1：
23.

電子ブック
ＥＢ
23. Variations on Constants
Markus M?ller-Olm, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
A Hierarchy of Constants / 2：
A Taxonomy of Constants / 2.1：
Flow Graphs / 2.1.1：
May- and Must-Constants / 2.1.2：
Weakened Constant Detection Problems / 2.1.3：
Classes of Integer Constants / 2.1.4：
Known Results / 2.2：
New Undecidability Results / 2.3：
New Intractability Results / 2.4：
Summary / 2.5：
Deciding Constants by Effective Weakest Preconditions / 3：
Presburger and Polynomial Constants / 3.1：
Presburger-Constant Detection at a Glance / 3.2：
A Generic Algorithm / 3.3：
Detection of Presburger Constants / 3.4：
A Primer on Computable Ideal Theory / 3.5：
Zeros / 3.6：
Substitution / 3.6.3：
Projection / 3.6.4：
Detection of Polynomial Constants / 3.7：
Conclusion / 3.8：
Limits of Parallel Flow Analysis / 4：
A Motivating Example / 4.1：
Parallel Programs / 4.2：
Interprocedural Copy-Constant Detection / 4.3：
Two-Counter Machines / 4.3.1：
Constructing a Program / 4.3.2：
Correctness of the Reduction / 4.3.3：
Intraprocedural Copy-Constant Detection / 4.4：
Copy-Constant Detection in Loop-Free Programs / 4.5：
Beyond Fork/Join Parallelism / 4.6：
Owicki/Gries-Style Program Proofs / 4.7：
Correctness of the Reduction in Section 4.3 / 4.8：
Enriching the Program / 4.8.1：
The Proof Outlines / 4.8.2：
Interference Freedom / 4.8.3：
Correctness of the Reduction in Section 4.4 / 4.9：
An Auxiliary Predicate / 4.9.1：
Proof Outline for Main / 4.9.3：
Parallel Flow Graphs / 4.9.6：
Operational Semantics / 5.1：
Atomic Runs / 5.3：
The Run Sets of Ultimate Interest / 5.4：
The Constraint Systems / 5.5：
Same-Level Runs / 5.5.1：
Inverse Same-Level Runs / 5.5.2：
Two Assumptions and a Simple Analysis / 5.5.3：
Reaching Runs / 5.5.4：
Terminating Runs / 5.5.5：
Bridging Runs / 5.5.6：
The General Case / 5.5.7：
Discussion / 5.6：
Non-atomic Execution / 6：
Modeling Non-atomic Execution by Virtual Variables / 6.1：
The Domain of Non-atomic Run Sets / 6.2：
Base Statements / 6.3.1：
Sequential Composition / 6.3.2：
Interleaving Operator / 6.3.3：
Pre-operator / 6.3.4：
Post-operator / 6.3.5：
Dependence Traces / 6.4：
Transparency and Dependences / 7.1：
Implication Order / 7.2：
Subsumption Order / 7.4：
A Lattice of Antichains / 7.5：
Short Dependence Traces / 7.6：
The Abstract Domain / 7.7：
Interleaving / 7.8：
Complementary Dependence Traces / 7.11.1：
Soundness Lemmas / 7.11.2：
Completeness Lemmas / 7.11.4：
Proof of Theorem 7.11.1 / 7.11.5：
Base Edges / 7.12：
Running Time / 7.13：
Detecting Copy Constants and Eliminating Faint Code / 7.14：
Copy-Constant Detection / 8.1：
Faint-Code Elimination / 8.2：
Complexity in the Non-atomic Scenario / 8.3：
The SAT-reduction / 9.1：
Towards Stronger Lower Bounds / 9.2：
Assignment Statements That Propagate Twice / 9.2.1：
Propagating Runs of Exponential Length / 9.2.2：
Future Research / 9.3：
A Primer on Constraint-Based Program Analysis / A：
References
Introduction / 1：
A Hierarchy of Constants / 2：
A Taxonomy of Constants / 2.1：
24.

電子ブック
ＥＢ
24. Variations on Constants
Markus Müller-Olm, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
A Hierarchy of Constants / 2：
A Taxonomy of Constants / 2.1：
Flow Graphs / 2.1.1：
May- and Must-Constants / 2.1.2：
Weakened Constant Detection Problems / 2.1.3：
Classes of Integer Constants / 2.1.4：
Known Results / 2.2：
New Undecidability Results / 2.3：
New Intractability Results / 2.4：
Summary / 2.5：
Deciding Constants by Effective Weakest Preconditions / 3：
Presburger and Polynomial Constants / 3.1：
Presburger-Constant Detection at a Glance / 3.2：
A Generic Algorithm / 3.3：
Detection of Presburger Constants / 3.4：
A Primer on Computable Ideal Theory / 3.5：
Zeros / 3.6：
Substitution / 3.6.3：
Projection / 3.6.4：
Detection of Polynomial Constants / 3.7：
Conclusion / 3.8：
Limits of Parallel Flow Analysis / 4：
A Motivating Example / 4.1：
Parallel Programs / 4.2：
Interprocedural Copy-Constant Detection / 4.3：
Two-Counter Machines / 4.3.1：
Constructing a Program / 4.3.2：
Correctness of the Reduction / 4.3.3：
Intraprocedural Copy-Constant Detection / 4.4：
Copy-Constant Detection in Loop-Free Programs / 4.5：
Beyond Fork/Join Parallelism / 4.6：
Owicki/Gries-Style Program Proofs / 4.7：
Correctness of the Reduction in Section 4.3 / 4.8：
Enriching the Program / 4.8.1：
The Proof Outlines / 4.8.2：
Interference Freedom / 4.8.3：
Correctness of the Reduction in Section 4.4 / 4.9：
An Auxiliary Predicate / 4.9.1：
Proof Outline for Main / 4.9.3：
Parallel Flow Graphs / 4.9.6：
Operational Semantics / 5.1：
Atomic Runs / 5.3：
The Run Sets of Ultimate Interest / 5.4：
The Constraint Systems / 5.5：
Same-Level Runs / 5.5.1：
Inverse Same-Level Runs / 5.5.2：
Two Assumptions and a Simple Analysis / 5.5.3：
Reaching Runs / 5.5.4：
Terminating Runs / 5.5.5：
Bridging Runs / 5.5.6：
The General Case / 5.5.7：
Discussion / 5.6：
Non-atomic Execution / 6：
Modeling Non-atomic Execution by Virtual Variables / 6.1：
The Domain of Non-atomic Run Sets / 6.2：
Base Statements / 6.3.1：
Sequential Composition / 6.3.2：
Interleaving Operator / 6.3.3：
Pre-operator / 6.3.4：
Post-operator / 6.3.5：
Dependence Traces / 6.4：
Transparency and Dependences / 7.1：
Implication Order / 7.2：
Subsumption Order / 7.4：
A Lattice of Antichains / 7.5：
Short Dependence Traces / 7.6：
The Abstract Domain / 7.7：
Interleaving / 7.8：
Complementary Dependence Traces / 7.11.1：
Soundness Lemmas / 7.11.2：
Completeness Lemmas / 7.11.4：
Proof of Theorem 7.11.1 / 7.11.5：
Base Edges / 7.12：
Running Time / 7.13：
Detecting Copy Constants and Eliminating Faint Code / 7.14：
Copy-Constant Detection / 8.1：
Faint-Code Elimination / 8.2：
Complexity in the Non-atomic Scenario / 8.3：
The SAT-reduction / 9.1：
Towards Stronger Lower Bounds / 9.2：
Assignment Statements That Propagate Twice / 9.2.1：
Propagating Runs of Exponential Length / 9.2.2：
Future Research / 9.3：
A Primer on Constraint-Based Program Analysis / A：
References
Introduction / 1：
A Hierarchy of Constants / 2：
A Taxonomy of Constants / 2.1：
25.

電子ブック
ＥＢ
25. OMDoc ? An Open Markup Format for Mathematical Documents [version 1.2]
Michael Kohlhase, Takeo Kanade
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
Markup for the World Wide Web / 1.2：
XML, the eXtensible Markup Language / 1.3：
Markup for Mathematical Knowledge / 2：
Mathematical Objects and Formulae / 2.1：
Mathematical Texts and Statements / 2.2：
Large-Scale Structure and Context in Mathematics / 2.3：
Open Mathematical Documents / 3：
A Brief History of the OMDoc Format / 3.1：
Three Levels of Markup / 3.2：
Situating the OMDoc Format / 3.3：
The Future: An Active Web of (Mathematical) Knowledge / 3.4：
An OMDoc Primer / Part II：
Textbooks and Articles / 4：
Minimal OMDoc Markup / 4.1：
Structure and Statements / 4.2：
Marking up the Formulae / 4.3：
Full Formalization / 4.4：
OpenMath Content Dictionaries / 5：
Structured and Parametrized Theories / 6：
A Development Graph for Elementary Algebra / 7：
Courseware and the Narrative/Content Distinction / 8：
A Knowledge-Centered View / 8.1：
A Narrative-Structured View / 8.2：
Choreographing Narrative and Content OMDoc / 8.3：
Summary / 8.4：
Communication Between Systems / 9：
The OMDoc Document Format / Part III：
OMDoc as a Modular Format / 10：
The OMDoc Namespaces / 10.1：
Common Attributes in OMDoc / 10.2：
Document Infrastructure / 11：
The Document Root / 11.1：
Metadata / 11.2：
Document Comments / 11.3：
Document Structure / 11.4：
Sharing Document Parts / 11.5：
The Dublin Core Elements (Module DC) / 12：
Roles in Dublin Core Elements / 12.2：
Managing Rights / 12.3：
Inheritance of Metadata / 12.4：
Mathematical Objects / 13：
OpenMath / 13.1：
Content MathML / 13.2：
Representing Types in Content-MathML and OpenMath / 13.3：
Semantics of Variables / 13.4：
Legacy Representation for Migration / 13.5：
Mathematical Text / 14：
Multilingual Mathematical Vernacular / 14.1：
Formal Mathematical Properties / 14.2：
Text Fragments and Their Rhetoric/Mathematical Roles / 14.3：
Phrase-Level Markup of Mathematical Vernacular / 14.4：
Technical Terms / 14.5：
Rich Text Structure / 14.6：
Mathematical Statements / 15：
Types of Statements in Mathematics / 15.1：
Theory-Constitutive Statements in OMDoc / 15.2：
The Unassuming Rest / 15.3：
Mathematical Examples in OMDoc / 15.4：
Inline Statements / 15.5：
Theories as Structured Contexts / 15.6：
Abstract Data Types / 16：
Representing Proofs / 17：
Proof Structure / 17.1：
Proof Step Justifications / 17.2：
Scoping and Context in a Proof / 17.3：
Formal Proofs as Mathematical Objects / 17.4：
Complex Theories / 18：
Inheritance via Translations / 18.1：
Postulated Theory Inclusions / 18.2：
Local/Required Theory Inclusions / 18.3：
Induced Assertions / 18.4：
Development Graphs / 18.5：
Notation and Presentation / 19：
Styling OMDoc Elements / 19.1：
A Restricted Style Language / 19.2：
Notation of Symbols / 19.3：
Presenting Bound Variables / 19.4：
Auxiliary Elements / 20：
Non-XML Data and Program Code in OMDoc / 20.1：
Applets and External Objects in OMDoc / 20.2：
Exercises / 21：
Document Models for OMDoc / 22：
XML Document Models / 22.1：
The OMDoc Document Model / 22.2：
OMDoc Sub-Languages / 22.3：
OMDoc Applications, Tools, and Projects / Part IV：
OMDoc Resources / 23：
The OMDoc Web Site, Wiki, and Mailing List / 23.1：
The OMDoc Distribution / 23.2：
The OMDoc Bug Tracker / 23.3：
An XML Catalog for OMDoc / 23.4：
External Resources / 23.5：
Validating OMDoc Documents / 24：
Validation with Document Type Definitions / 24.1：
Validation with RelaxNG Schemata / 24.2：
Validation with XML Schema / 24.3：
Transforming OMDoc / 25：
Extracting and Linking XSLT Templates / 25.1：
Interfaces for Systems / 25.2：
Presenting OMDoc to Humans / 25.3：
Applications and Projects / 26：
Introduction / 26.1：
QMath Parser / 26.2：
Sentido Integrated Environment / 26.3：
MBase / 26.4：
A Search Engine for Mathematical Formulae / 26.5：
Semantic Interrelation and Change Management / 26.6：
MathDox / 26.7：
ActiveMath / 26.8：
Authoring Tools for ActiveMath / 26.9：
SWiM - An OMDoc-Based Semantic Wiki / 26.10：
Induction Challenge Problems / 26.11：
Maya / 26.12：
Hets / 26.13：
CPoint / 26.14：
Stex: A Latex-Based Workflow for OMDoc / 26.15：
An Emacs Mode for Editing OMDoc Documents / 26.16：
Converting Mathematica Notebooks to OMDoc / 26.17：
Standardizing Context in System Interoperability / 26.18：
Proof Assistants in Scientific Editors / 26.19：
VeriFun / 26.20：
Appendix / Part V：
Changes to the Specification / A：
Changes from 1.1 to 1.2 / A.1：
Changes from 1.0 to 1.1 / A.2：
Quick-Reference / B：
Table of Attributes / C：
The RelaxNG Schema for OMDoc / D：
The Sub-language Drivers / D.1：
Common Attributes / D.2：
Module MOBJ: Mathematical Objects and Text / D.3：
Module MTXT: Mathematical Text / D.4：
Module DOC: Document Infrastructure / D.5：
Module DC: Dublin Core Metadata / D.6：
Module ST: Mathematical Statements / D.7：
Module ADT: Abstract Data Types / D.8：
Module PF: Proofs and Proof objects / D.9：
Module CTH: Complex Theories / D.10：
Module RT: Rich Text Structure / D.11：
Module EXT: Applets and Non-XML Data / D.12：
Module PRES: Adding Presentation Information / D.13：
Module QUIZ: Infrastructure for Assessments / D.14：
The RelaxNG Schemata for Mathematical Objects / E：
The RelaxNG Schema for OpenMath / E.1：
The RelaxNG Schema for MathML / E.2：
Bibliography
Index
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
26.

電子ブック
ＥＢ
26. OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]
Michael Kohlhase, Takeo Kanade, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
Markup for the World Wide Web / 1.2：
XML, the eXtensible Markup Language / 1.3：
Markup for Mathematical Knowledge / 2：
Mathematical Objects and Formulae / 2.1：
Mathematical Texts and Statements / 2.2：
Large-Scale Structure and Context in Mathematics / 2.3：
Open Mathematical Documents / 3：
A Brief History of the OMDoc Format / 3.1：
Three Levels of Markup / 3.2：
Situating the OMDoc Format / 3.3：
The Future: An Active Web of (Mathematical) Knowledge / 3.4：
An OMDoc Primer / Part II：
Textbooks and Articles / 4：
Minimal OMDoc Markup / 4.1：
Structure and Statements / 4.2：
Marking up the Formulae / 4.3：
Full Formalization / 4.4：
OpenMath Content Dictionaries / 5：
Structured and Parametrized Theories / 6：
A Development Graph for Elementary Algebra / 7：
Courseware and the Narrative/Content Distinction / 8：
A Knowledge-Centered View / 8.1：
A Narrative-Structured View / 8.2：
Choreographing Narrative and Content OMDoc / 8.3：
Summary / 8.4：
Communication Between Systems / 9：
The OMDoc Document Format / Part III：
OMDoc as a Modular Format / 10：
The OMDoc Namespaces / 10.1：
Common Attributes in OMDoc / 10.2：
Document Infrastructure / 11：
The Document Root / 11.1：
Metadata / 11.2：
Document Comments / 11.3：
Document Structure / 11.4：
Sharing Document Parts / 11.5：
The Dublin Core Elements (Module DC) / 12：
Roles in Dublin Core Elements / 12.2：
Managing Rights / 12.3：
Inheritance of Metadata / 12.4：
Mathematical Objects / 13：
OpenMath / 13.1：
Content MathML / 13.2：
Representing Types in Content-MathML and OpenMath / 13.3：
Semantics of Variables / 13.4：
Legacy Representation for Migration / 13.5：
Mathematical Text / 14：
Multilingual Mathematical Vernacular / 14.1：
Formal Mathematical Properties / 14.2：
Text Fragments and Their Rhetoric/Mathematical Roles / 14.3：
Phrase-Level Markup of Mathematical Vernacular / 14.4：
Technical Terms / 14.5：
Rich Text Structure / 14.6：
Mathematical Statements / 15：
Types of Statements in Mathematics / 15.1：
Theory-Constitutive Statements in OMDoc / 15.2：
The Unassuming Rest / 15.3：
Mathematical Examples in OMDoc / 15.4：
Inline Statements / 15.5：
Theories as Structured Contexts / 15.6：
Abstract Data Types / 16：
Representing Proofs / 17：
Proof Structure / 17.1：
Proof Step Justifications / 17.2：
Scoping and Context in a Proof / 17.3：
Formal Proofs as Mathematical Objects / 17.4：
Complex Theories / 18：
Inheritance via Translations / 18.1：
Postulated Theory Inclusions / 18.2：
Local/Required Theory Inclusions / 18.3：
Induced Assertions / 18.4：
Development Graphs / 18.5：
Notation and Presentation / 19：
Styling OMDoc Elements / 19.1：
A Restricted Style Language / 19.2：
Notation of Symbols / 19.3：
Presenting Bound Variables / 19.4：
Auxiliary Elements / 20：
Non-XML Data and Program Code in OMDoc / 20.1：
Applets and External Objects in OMDoc / 20.2：
Exercises / 21：
Document Models for OMDoc / 22：
XML Document Models / 22.1：
The OMDoc Document Model / 22.2：
OMDoc Sub-Languages / 22.3：
OMDoc Applications, Tools, and Projects / Part IV：
OMDoc Resources / 23：
The OMDoc Web Site, Wiki, and Mailing List / 23.1：
The OMDoc Distribution / 23.2：
The OMDoc Bug Tracker / 23.3：
An XML Catalog for OMDoc / 23.4：
External Resources / 23.5：
Validating OMDoc Documents / 24：
Validation with Document Type Definitions / 24.1：
Validation with RelaxNG Schemata / 24.2：
Validation with XML Schema / 24.3：
Transforming OMDoc / 25：
Extracting and Linking XSLT Templates / 25.1：
Interfaces for Systems / 25.2：
Presenting OMDoc to Humans / 25.3：
Applications and Projects / 26：
Introduction / 26.1：
QMath Parser / 26.2：
Sentido Integrated Environment / 26.3：
MBase / 26.4：
A Search Engine for Mathematical Formulae / 26.5：
Semantic Interrelation and Change Management / 26.6：
MathDox / 26.7：
ActiveMath / 26.8：
Authoring Tools for ActiveMath / 26.9：
SWiM - An OMDoc-Based Semantic Wiki / 26.10：
Induction Challenge Problems / 26.11：
Maya / 26.12：
Hets / 26.13：
CPoint / 26.14：
Stex: A Latex-Based Workflow for OMDoc / 26.15：
An Emacs Mode for Editing OMDoc Documents / 26.16：
Converting Mathematica Notebooks to OMDoc / 26.17：
Standardizing Context in System Interoperability / 26.18：
Proof Assistants in Scientific Editors / 26.19：
VeriFun / 26.20：
Appendix / Part V：
Changes to the Specification / A：
Changes from 1.1 to 1.2 / A.1：
Changes from 1.0 to 1.1 / A.2：
Quick-Reference / B：
Table of Attributes / C：
The RelaxNG Schema for OMDoc / D：
The Sub-language Drivers / D.1：
Common Attributes / D.2：
Module MOBJ: Mathematical Objects and Text / D.3：
Module MTXT: Mathematical Text / D.4：
Module DOC: Document Infrastructure / D.5：
Module DC: Dublin Core Metadata / D.6：
Module ST: Mathematical Statements / D.7：
Module ADT: Abstract Data Types / D.8：
Module PF: Proofs and Proof objects / D.9：
Module CTH: Complex Theories / D.10：
Module RT: Rich Text Structure / D.11：
Module EXT: Applets and Non-XML Data / D.12：
Module PRES: Adding Presentation Information / D.13：
Module QUIZ: Infrastructure for Assessments / D.14：
The RelaxNG Schemata for Mathematical Objects / E：
The RelaxNG Schema for OpenMath / E.1：
The RelaxNG Schema for MathML / E.2：
Bibliography
Index
Setting the Stage for Open Mathematical Documents / Part I：
Document Markup for the Web / 1：
Structure vest. Appearance in Markup / 1.1：
27.

電子ブック
ＥＢ
27. Databases, Information Systems, and Peer-to-Peer Computing
DBISP2P 2004, Takeo Kanade, Wee Siong Ng, Beng Chin Ooi, Aris Ouksel, Claudio Sartori
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
28.

電子ブック
ＥＢ
28. Web and Wireless Geographical Information Systems
W2GIS 2004, Alain Bouju, Christophe Claramunt, Takeo Kanade, Yong-Jin Kwon
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
29.

電子ブック
ＥＢ
29. Agents and Peer-to-Peer Computing
AP2PC 2004, Karl Aberer, Sonia Bergamaschi, Takeo Kanade, Gianluca Moro
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
30.

電子ブック
ＥＢ
30. Web and Wireless Geographical Information Systems
W2GIS 2005, Takeo Kanade, Ki-Joune Li, Christelle Vangenot
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
31.

電子ブック
ＥＢ
31. Databases, Information Systems, and Peer-to-Peer Computing
DBISP2P 2004, Takeo Kanade, Wee Siong Ng, Beng Chin Ooi, Aris Ouksel, Claudio Sartori
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
32.

電子ブック
ＥＢ
32. Agents and Peer-to-Peer Computing
AP2PC 2004, Karl Aberer, Sonia Bergamaschi, Takeo Kanade, Gianluca Moro
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
33.

電子ブック
ＥＢ
33. Web and Wireless Geographical Information Systems
W2GIS 2004, Alain Bouju, Christophe Claramunt, Takeo Kanade, Yong-Jin Kwon
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
34.

電子ブック
ＥＢ
34. Web and Wireless Geographical Information Systems
W2GIS 2005, Takeo Kanade, Ki-Joune Li, Christelle Vangenot, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
35.

電子ブック
ＥＢ
35. Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
Damien Sauveron, Angelos Bilas, Takeo Kanade, Konstantinos Markantonakis, Jean-Jacques Quisquater, Association for Computing Machinery-Digital Library., International Federation for Information Processing.
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
36.

電子ブック
ＥＢ
36. Trust Management
Ketil St?len, Takeo Kanade, Fabio Martinelli, Fabio Massacci, Ketil St2len, William H. Winsborough
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
37.

電子ブック
ＥＢ
37. Trust Management
Ketil Stølen, Takeo Kanade, Fabio Martinelli, Fabio Massacci, Ketil St2len, William H. Winsborough
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
38.

電子ブック
ＥＢ
38. Data Management in Grid and Peer-to-Peer Systems
Abdelkader Hameurlain, Takeo Kanade, Franck Morvan, A Min Tjoa
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Data Storage and Management
High Throughput Data-Compression for Cloud Storage / Bogdan Nicolae
Merging File Systems and Data Bases to Fit the Grid / Yves Denneulin ; Cyril Labbé ; Laurent d'Orazio ; Claudia Roncancio
Multidimensional Arrays for Warehousing Data on Clouds / Sandro Bimonte
Replication, Caching and Security
Continuous Timestamping for Efficient Replication Management in DHTs / Reza Akbarinia ; Mounir Tlili ; Esther Pacitti ; Patrick Valduriez ; Alexandre A.B. Lima
A Catalog-Based Caching Strategy for Structured P2P Systems / Mile Arnedo ; Maria del Pilar Villamil ; Ricardo Villanueva ; Harold Castro
Secure Routing Strategies in DHT-Based Systems
Data Placement and Performance Evaluation
Data Life Time for Different Placement Policies in P2P Storage Systems / Stéphane Caron ; Frédéric Giroire ; Dorian Mazauric ; Julian Monteiro ; Stéphane Pérennes
Performance Evaluation of WebRowSet Implementations / Alexander Wöhrer ; Thomas Lustig ; Peter Brezany
P2PIRB: Benchmarking Framework for P2PIR / Saloua Zammali ; Khedija Arour
Verification of General and Cyclic Covering Arrays Using Grid Computing / Himer Avila-George ; Jose Torres-Jimenez ; Vicente Hernández ; Nelson Rangel-Valdez
Data Stream Systems and Large Scale Distributed Applications
Scale Out Parallel and Distributed CDR Stream Analytics / Qiming Chen ; Meichun Hsu
A Wide Area Network Optimization Service for Effective Access to Heterogeneous DataGrid Infrastructures / Francesco Palmieri ; Silvio Pardi
A Profile-Based Aggregation Model in a Peer-To-Peer Information Retrieval System / Rim Mghirbi ; Yahya Slimani ; Bruno Defude
Author Index
Data Storage and Management
High Throughput Data-Compression for Cloud Storage / Bogdan Nicolae
Merging File Systems and Data Bases to Fit the Grid / Yves Denneulin ; Cyril Labbé ; Laurent d'Orazio ; Claudia Roncancio
39.

電子ブック
ＥＢ
39. Data Management in Grid and Peer-to-Peer Systems
Abdelkader Hameurlain, Takeo Kanade, Franck Morvan, A Min Tjoa
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Data Storage and Management
High Throughput Data-Compression for Cloud Storage / Bogdan Nicolae
Merging File Systems and Data Bases to Fit the Grid / Yves Denneulin ; Cyril Labbé ; Laurent d'Orazio ; Claudia Roncancio
Multidimensional Arrays for Warehousing Data on Clouds / Sandro Bimonte
Replication, Caching and Security
Continuous Timestamping for Efficient Replication Management in DHTs / Reza Akbarinia ; Mounir Tlili ; Esther Pacitti ; Patrick Valduriez ; Alexandre A.B. Lima
A Catalog-Based Caching Strategy for Structured P2P Systems / Mile Arnedo ; Maria del Pilar Villamil ; Ricardo Villanueva ; Harold Castro
Secure Routing Strategies in DHT-Based Systems
Data Placement and Performance Evaluation
Data Life Time for Different Placement Policies in P2P Storage Systems / Stéphane Caron ; Frédéric Giroire ; Dorian Mazauric ; Julian Monteiro ; Stéphane Pérennes
Performance Evaluation of WebRowSet Implementations / Alexander Wöhrer ; Thomas Lustig ; Peter Brezany
P2PIRB: Benchmarking Framework for P2PIR / Saloua Zammali ; Khedija Arour
Verification of General and Cyclic Covering Arrays Using Grid Computing / Himer Avila-George ; Jose Torres-Jimenez ; Vicente Hernández ; Nelson Rangel-Valdez
Data Stream Systems and Large Scale Distributed Applications
Scale Out Parallel and Distributed CDR Stream Analytics / Qiming Chen ; Meichun Hsu
A Wide Area Network Optimization Service for Effective Access to Heterogeneous DataGrid Infrastructures / Francesco Palmieri ; Silvio Pardi
A Profile-Based Aggregation Model in a Peer-To-Peer Information Retrieval System / Rim Mghirbi ; Yahya Slimani ; Bruno Defude
Author Index
Data Storage and Management
High Throughput Data-Compression for Cloud Storage / Bogdan Nicolae
Merging File Systems and Data Bases to Fit the Grid / Yves Denneulin ; Cyril Labbé ; Laurent d'Orazio ; Claudia Roncancio
40.

電子ブック
ＥＢ
40. Algorithms for Sensor and Ad Hoc Networks
Dorothea Wagner, Takeo Kanade, Roger Wattenhofer, Roger Peter Wattenhofer
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
Current Hardware Platforms / 1.2：
Upcoming Applications / 1.4：
Chapter Notes / 1.5：
Modeling Sensor and Ad Hoc Networks / F. Schuh2：
Distributed Algorithms / 2.1：
Communication / 2.3：
Energy / 2.4：
Mobility / 2.5：
Clustering / T. Moscibroda2.6：
Models / 3.1：
Clustering Algorithms for Unit Disk Graphs / 3.3：
Clustering Algorithms for General Graphs / 3.4：
Conclusionsand Open Problems / 3.5：
MAC Layer and Coloring / S. Mecke3.6：
Algorithms for Vertex Coloring / 4.1：
Conclusion / 4.3：
Topology Control / K. Buchin ; M. Buchin4.4：
Quality Criteria / 5.1：
Locally Defined Geometric Graphs and Further Proximity Graphs / 5.3：
Localized Algorithms / 5.4：
Interference and Signal-to-Noise-Ratio / A. Kröller5.5：
Interference Models / 6.1：
Low-Interference Topologies / 6.3：
Topology Scheduling / 6.4：
Flow and Path Scheduling / 6.5：
Lower Bounds / Z. Benenson6.6：
A Lower Boundon3-Coloringa Ring / 7.1：
Locally Checkable Labelings / 7.3：
Minimum-Weight Spanning Trees / 7.4：
Facility Location / C. Frank7.5：
Problem Definition / 8.1：
Centralized Approximations / 8.3：
Simple Distributed Approximation / 8.4：
Fast Distributed Approximation / 8.5：
Discussionand Outlook / 8.6：
Geographic Routing / A. Zollinger8.7：
Related Work / 9.1：
Models and Preliminaries / 9.3：
Greedy Routing / 9.4：
Routing with Faces / 9.5：
A Lower Bound / 9.6：
Combining Greedy and Face Routing / 9.7：
Compact Routing / M. Dom9.8：
Definitions / 10.1：
Overview / 10.3：
Algorithms / 10.4：
Pseudo Geometric Routing for Sensor Networks / O. Landsiedel10.5：
Routing Algorithmsfor Sensor Networks / 11.1：
Virtual Coordinate Based Routing / 11.3：
Beacon Vector Routing / 11.4：
Algorithmic View / 11.5：
Minimal Range Assignments for Broadcasts / C. Gunia11.6：
The Algorithm RAPMST and Its Analysis / 12.1：
Distributed Computation of an MST / 12.3：
Further Advances / 12.4：
Conclusion and Open Questions / 12.5：
Data Gathering in Sensor Networks / L. Scharf12.6：
Network Model / 13.1：
Minimum Energy Data Gathering / 13.3：
Maximum Lifetime Data Gathering / 13.4：
Location Services / B. Fabian ; M. Fischmann ; S.F. Gürses13.5：
Grid Location Service (GLS) / 14.1：
Locality-Aware Location Service (LLS) / 14.3：
Mobility-Aware Location Service (MLS) / 14.4：
Outlook / 14.5：
Positioning / D. Fleischer ; C. Pich14.6：
Hardness Results / 15.1：
Security / E.-O. Blaß15.3：
Symmetric Key Distribution / 16.1：
Public-Key Distribution / 16.3：
Open Questions / 16.4：
Trust Mechanisms and Reputation Systems / E. Buchmann16.5：
General Trust Models / 17.1：
Reputation-Based Trust Protocols in Ad Hoc Networks / 17.3：
Open Problems / 17.4：
Selfish Agents and Economic Aspects / 17.5：
Mechanism Design / 18.1：
Unicast in Selfish Networks / 18.3：
Multicast in Selfish Networks / 18.5：
Time Synchronization / M. Busse ; T. Streichert18.6：
Time Synchronization Approaches / 19.1：
Synchronizing Clocks in the Presence of Faults / 19.3：
Theoretical Bounds for Clock Synchronization and Ordering ofEvents / 19.4：
Gradient Clock Synchronization / 19.5：
Bibliography / 19.6：
Author Index
Subject Index
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
41.

電子ブック
ＥＢ
41. Algorithms for Sensor and Ad Hoc Networks
Dorothea Wagner, Takeo Kanade, Roger Wattenhofer, Roger Peter Wattenhofer, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
Current Hardware Platforms / 1.2：
Upcoming Applications / 1.4：
Chapter Notes / 1.5：
Modeling Sensor and Ad Hoc Networks / F. Schuh2：
Distributed Algorithms / 2.1：
Communication / 2.3：
Energy / 2.4：
Mobility / 2.5：
Clustering / T. Moscibroda2.6：
Models / 3.1：
Clustering Algorithms for Unit Disk Graphs / 3.3：
Clustering Algorithms for General Graphs / 3.4：
Conclusionsand Open Problems / 3.5：
MAC Layer and Coloring / S. Mecke3.6：
Algorithms for Vertex Coloring / 4.1：
Conclusion / 4.3：
Topology Control / K. Buchin ; M. Buchin4.4：
Quality Criteria / 5.1：
Locally Defined Geometric Graphs and Further Proximity Graphs / 5.3：
Localized Algorithms / 5.4：
Interference and Signal-to-Noise-Ratio / A. Kröller5.5：
Interference Models / 6.1：
Low-Interference Topologies / 6.3：
Topology Scheduling / 6.4：
Flow and Path Scheduling / 6.5：
Lower Bounds / Z. Benenson6.6：
A Lower Boundon3-Coloringa Ring / 7.1：
Locally Checkable Labelings / 7.3：
Minimum-Weight Spanning Trees / 7.4：
Facility Location / C. Frank7.5：
Problem Definition / 8.1：
Centralized Approximations / 8.3：
Simple Distributed Approximation / 8.4：
Fast Distributed Approximation / 8.5：
Discussionand Outlook / 8.6：
Geographic Routing / A. Zollinger8.7：
Related Work / 9.1：
Models and Preliminaries / 9.3：
Greedy Routing / 9.4：
Routing with Faces / 9.5：
A Lower Bound / 9.6：
Combining Greedy and Face Routing / 9.7：
Compact Routing / M. Dom9.8：
Definitions / 10.1：
Overview / 10.3：
Algorithms / 10.4：
Pseudo Geometric Routing for Sensor Networks / O. Landsiedel10.5：
Routing Algorithmsfor Sensor Networks / 11.1：
Virtual Coordinate Based Routing / 11.3：
Beacon Vector Routing / 11.4：
Algorithmic View / 11.5：
Minimal Range Assignments for Broadcasts / C. Gunia11.6：
The Algorithm RAPMST and Its Analysis / 12.1：
Distributed Computation of an MST / 12.3：
Further Advances / 12.4：
Conclusion and Open Questions / 12.5：
Data Gathering in Sensor Networks / L. Scharf12.6：
Network Model / 13.1：
Minimum Energy Data Gathering / 13.3：
Maximum Lifetime Data Gathering / 13.4：
Location Services / B. Fabian ; M. Fischmann ; S.F. Gürses13.5：
Grid Location Service (GLS) / 14.1：
Locality-Aware Location Service (LLS) / 14.3：
Mobility-Aware Location Service (MLS) / 14.4：
Outlook / 14.5：
Positioning / D. Fleischer ; C. Pich14.6：
Hardness Results / 15.1：
Security / E.-O. Blaß15.3：
Symmetric Key Distribution / 16.1：
Public-Key Distribution / 16.3：
Open Questions / 16.4：
Trust Mechanisms and Reputation Systems / E. Buchmann16.5：
General Trust Models / 17.1：
Reputation-Based Trust Protocols in Ad Hoc Networks / 17.3：
Open Problems / 17.4：
Selfish Agents and Economic Aspects / 17.5：
Mechanism Design / 18.1：
Unicast in Selfish Networks / 18.3：
Multicast in Selfish Networks / 18.5：
Time Synchronization / M. Busse ; T. Streichert18.6：
Time Synchronization Approaches / 19.1：
Synchronizing Clocks in the Presence of Faults / 19.3：
Theoretical Bounds for Clock Synchronization and Ordering ofEvents / 19.4：
Gradient Clock Synchronization / 19.5：
Bibliography / 19.6：
Author Index
Subject Index
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
42.

電子ブック
ＥＢ
42. Advanced Studies in Biometrics
Summer School on Biometrics, Josef Big?n, Enrico Grosso, Takeo Kanade, Massimo Tistarelli
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
目次情報: 続きを見る
Combining Biometric Evidence for Person Authentication / J. Bigun ; J. Fierrez-Aguilar ; J. Ortega-Garcia ; J. Gonzales-Rodriguez
Biometric Gait Recognition / J.E. Boyd ; J.J. Little
A Tutorial on Fingerprint Recognition / D. Maltoni
Spiral Topologies for Biometric Recognition / M. Tistarelli ; E. Grosso ; A. Lagorio
Statistical Learning Approaches with Application to Face Detection / E. Franceschi ; F. Odone ; A. Verri
Hand Detection by Direct Convexity Estimation / D. Maimon ; Y. Yeshurun
Template-Based Hand Detection and Tracking / R. Cipolla ; B. Stenger ; A. Thayananthan ; P.H.S. Torr
Student Papers
3D Face Recognition Using Stereoscopic Vision / U. Castellani ; M. Bicego ; G. Iacono ; V. Murino
Selection of Location, Frequency, and Orientation Parameters of 2D Gabor Wavelets for Face Recognition / B. Gökberk ; M. O. Irfanoglu ; L. Akarun ; E. Alpaydin
A Face Recognition System Based on Local Feature Characterization / P. Campadelli ; R. Lanzarotti
Influence of Location over Several Classifiers in 2D and 3D Face Verification / S. Mata ; C. Conde ; A. Sánchez ; E. Cabello
Author Index
Combining Biometric Evidence for Person Authentication / J. Bigun ; J. Fierrez-Aguilar ; J. Ortega-Garcia ; J. Gonzales-Rodriguez
Biometric Gait Recognition / J.E. Boyd ; J.J. Little
A Tutorial on Fingerprint Recognition / D. Maltoni
43.

電子ブック
ＥＢ
43. Incentives, Overlays, and Economic Traffic Control
Burkhard Stiller, Tobias Ho?feld, Takeo Kanade, George D. Stamoulis
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Keynote
Socio-economic Challenges for the Internet of the Future: The Case of Congestion Control / Costas Courcoubetis
P2P and Overlay Management
An Incentive-Based Approach to Traffic Management for Peer-to-Peer Overlays / Konstantin Pussep ; Sergey Kuleshov ; Christian Gro? ; Sergios Soursos
Quantifying Operational Cost-Savings through ALTO-Guidance for P2P Live Streaming / Jan Seedorf ; Saverio Niccolini ; Martin Stiemerling ; Ettore Ferranti ; Rolf Winter
Overlay Connection Usage in BitTorrent Swarms / Simon Oechsner ; Frank Lehrieder ; Dirk Staehle
Evaluations and Estimations
Implementation and Performance Evaluation of the re-ECN Protocol / Mirja Kühlewind ; Michael Scharf
Estimating AS Relationships for Application-Layer Traffic Optimization / Hirochika Asai ; Hiroshi Esaki
Mobile Internet in Stereo: An End-to-End Scenario / Henna Warma ; Tapio Levä ; Lars Eggert ; Heikki Hämmäinen ; Jukka Manner
Short Papers
A Study of Non-neutral Networks with Usage-Based Prices / Eitan Altman ; Pierre Bernhard ; Stephane Caron ; George Kesidis ; Julio Rojas-Mora ; Sulan Wong
Stability of Alliances between Service Providers / Hélène Le Cadre
Business-Driven QoS Management of B2C Web Servers / Grazyna Suchacka ; Leszek Borzemski
The Applicability of Context-Based Multicast - A Shopping Centre Scenario / Thomas Wozniak ; Katarina Stanoevska-Slabeva ; Diogo Gomes ; Hans D. Schotten
Author Index
Keynote
Socio-economic Challenges for the Internet of the Future: The Case of Congestion Control / Costas Courcoubetis
P2P and Overlay Management
44.

電子ブック
ＥＢ
44. Advanced Studies in Biometrics
Summer School on Biometrics, Josef Bigün, Enrico Grosso, Takeo Kanade, Massimo Tistarelli
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
目次情報: 続きを見る
Combining Biometric Evidence for Person Authentication / J. Bigun ; J. Fierrez-Aguilar ; J. Ortega-Garcia ; J. Gonzales-Rodriguez
Biometric Gait Recognition / J.E. Boyd ; J.J. Little
A Tutorial on Fingerprint Recognition / D. Maltoni
Spiral Topologies for Biometric Recognition / M. Tistarelli ; E. Grosso ; A. Lagorio
Statistical Learning Approaches with Application to Face Detection / E. Franceschi ; F. Odone ; A. Verri
Hand Detection by Direct Convexity Estimation / D. Maimon ; Y. Yeshurun
Template-Based Hand Detection and Tracking / R. Cipolla ; B. Stenger ; A. Thayananthan ; P.H.S. Torr
Student Papers
3D Face Recognition Using Stereoscopic Vision / U. Castellani ; M. Bicego ; G. Iacono ; V. Murino
Selection of Location, Frequency, and Orientation Parameters of 2D Gabor Wavelets for Face Recognition / B. Gökberk ; M. O. Irfanoglu ; L. Akarun ; E. Alpaydin
A Face Recognition System Based on Local Feature Characterization / P. Campadelli ; R. Lanzarotti
Influence of Location over Several Classifiers in 2D and 3D Face Verification / S. Mata ; C. Conde ; A. Sánchez ; E. Cabello
Author Index
Combining Biometric Evidence for Person Authentication / J. Bigun ; J. Fierrez-Aguilar ; J. Ortega-Garcia ; J. Gonzales-Rodriguez
Biometric Gait Recognition / J.E. Boyd ; J.J. Little
A Tutorial on Fingerprint Recognition / D. Maltoni
45.

電子ブック
ＥＢ
45. Incentives, Overlays, and Economic Traffic Control
Burkhard Stiller, Tobias Hoßfeld, Takeo Kanade, George D. Stamoulis
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Keynote
Socio-economic Challenges for the Internet of the Future: The Case of Congestion Control / Costas Courcoubetis
P2P and Overlay Management
An Incentive-Based Approach to Traffic Management for Peer-to-Peer Overlays / Konstantin Pussep ; Sergey Kuleshov ; Christian Gro? ; Sergios Soursos
Quantifying Operational Cost-Savings through ALTO-Guidance for P2P Live Streaming / Jan Seedorf ; Saverio Niccolini ; Martin Stiemerling ; Ettore Ferranti ; Rolf Winter
Overlay Connection Usage in BitTorrent Swarms / Simon Oechsner ; Frank Lehrieder ; Dirk Staehle
Evaluations and Estimations
Implementation and Performance Evaluation of the re-ECN Protocol / Mirja Kühlewind ; Michael Scharf
Estimating AS Relationships for Application-Layer Traffic Optimization / Hirochika Asai ; Hiroshi Esaki
Mobile Internet in Stereo: An End-to-End Scenario / Henna Warma ; Tapio Levä ; Lars Eggert ; Heikki Hämmäinen ; Jukka Manner
Short Papers
A Study of Non-neutral Networks with Usage-Based Prices / Eitan Altman ; Pierre Bernhard ; Stephane Caron ; George Kesidis ; Julio Rojas-Mora ; Sulan Wong
Stability of Alliances between Service Providers / Hélène Le Cadre
Business-Driven QoS Management of B2C Web Servers / Grazyna Suchacka ; Leszek Borzemski
The Applicability of Context-Based Multicast - A Shopping Centre Scenario / Thomas Wozniak ; Katarina Stanoevska-Slabeva ; Diogo Gomes ; Hans D. Schotten
Author Index
Keynote
Socio-economic Challenges for the Internet of the Future: The Case of Congestion Control / Costas Courcoubetis
P2P and Overlay Management
46.

電子ブック
ＥＢ
46. Functional Imaging and Modeling of the Heart
FIMH 2005, Alejandro F. Frangi, Takeo Kanade, Monica Hernandez, Petia I. Radeva, Andres Santos
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
47.

電子ブック
ＥＢ
47. Software Architecture
EWSA 2005, Takeo Kanade, Ronald Morrison, Flavio Oquendo
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
48.

電子ブック
ＥＢ
48. Security Protocols
International Workshop on Security Protocols, Bruce Christianson, Takeo Kanade, Bruno Crispo, James A. Malcolm, Michael Roe
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
49.

電子ブック
ＥＢ
49. Mathematical Foundations of Computer Science 2005
Symposium on Mathematical Foundations of Computer Science (1972- ), Takeo Kanade, Andrzej Szepietowski
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
50.

電子ブック
ＥＢ
50. Pattern Recognition
DAGM (Organization). Symposium, Allan Hanbury, Takeo Kanade, Walter Kropatsch, Robert Sablatnig
出版情報: Springer eBooks Computer Science , Springer Berlin / Heidelberg, 2005
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼