close
1.

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

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

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

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

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

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

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

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

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

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

電子ブック
ＥＢ
11. Distributed Event-Based Systems
Gero M?hl, Ludger Fiege, Gero M?hl, Peter Pietzuch
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Networked Computing / 1.1：
Middleware / 1.2：
Event-Based Systems / 1.3：
Application Scenarios / 1.4：
Information Dissemination / 1.4.1：
Network Monitoring / 1.4.2：
Enterprise Application Integration / 1.4.3：
Mobile Systems / 1.4.4：
Ubiquitous systems / 1.4.5：
Putting Event-Based Systems Into Context / 1.5：
From Centralized to Internet-Scale Event Systems / 1.6：
Structure of the Book / 1.7：
Basics / 2：
Terminology / 2.1：
Events and Notifications / 2.1.1：
Producers and Consumers / 2.1.2：
Subscriptions and Filters / 2.1.3：
Event Notification Service / 2.1.4：
Models of Interaction / 2.2：
Request/Reply / 2.2.1：
Anonymous Request/Reply / 2.2.2：
Callback / 2.2.3：
Event-Based / 2.2.4：
Comparison / 2.2.5：
Interaction vs. Implementation / 2.2.6：
Notification Filtering Mechanisms / 2.3：
Channels / 2.3.1：
Subject-Based Filtering / 2.3.2：
Type-Based Filtering / 2.3.3：
Content-Based Filtering / 2.3.4：
A Model Distributed Notification Service / 2.4：
System Model / 2.4.1：
Architecture / 2.4.2：
Distributed Notification Routing / 2.4.3：
Specification of Event Systems / 2.5：
Formal Background / 2.5.1：
A Simple Event System / 2.5.2：
A Simple Event System With Ordering Requirements / 2.5.3：
Simple Event System With Advertisements / 2.5.4：
Further Reading / 2.6：
Content-Based Models and Matching / 3：
Content-Based Data and Filter Models / 3.1：
Tuples / 3.1.1：
Structured Records / 3.1.2：
Semistructured Records / 3.1.3：
Objects / 3.1.4：
Matching Algorithms / 3.2：
Brute Force / 3.2.1：
Counting Algorithm / 3.2.2：
Decision Trees / 3.2.3：
Binary Decision Diagrams / 3.2.4：
Efficient XML Matching / 3.2.5：
Routing Algorithm Framework / 3.3：
Atomic Steps of the Implementation / 4.2.1：
Notification Forwarding and Delivery / 4.2.2：
Avoidance of Duplicate and Spurious Notifications / 4.2.3：
Routing Table Updates / 4.2.4：
Valid and Monotone Valid Routing Algorithms / 4.3：
Valid Routing Algorithms / 4.3.1：
Monotone Valid Routing Algorithms / 4.3.2：
Valid Framework Instantiations / 4.4：
Content-Based Routing Algorithms / 4.5：
Flooding / 4.5.1：
Simple Routing / 4.5.2：
Identity-Based Routing / 4.5.3：
Covering-Based Routing / 4.5.4：
Merging-Based Routing / 4.5.5：
Discussion / 4.5.6：
Extensions of the Basic Routing Framework / 4.6：
Routing With Advertisements / 4.6.1：
Hierarchical Routing Algorithms / 4.6.2：
Rendezvous-Based Routing / 4.6.3：
Topology Changes / 4.6.4：
Joining and Leaving Clients / 4.6.5：
Routing in Cyclic Topologies / 4.6.6：
Exploiting IP Multicast / 4.6.7：
Topology Maintenance / 4.6.8：
Engineering of Event-Based Systems / 4.7：
Engineering Requirements / 5.1：
Application Examples / 5.1.1：
Requirements / 5.1.2：
Existing Support / 5.1.3：
Accessing Publish/Subscribe Functionality / 5.2：
Generic APIs / 5.2.1：
Domain-Specific APIs / 5.2.2：
Using the API / 5.3：
Patterns and Idioms / 5.3.1：
Emitting Notifications / 5.3.2：
Scoping / 5.4：
Controlling Cooperation / 6.1：
Implicit Coordination and Visibility / 6.1.1：
Explicit Control of Visibility / 6.1.2：
The Role of Administrators / 6.1.3：
Event-Based Systems With Scopes / 6.2：
Visibility and Scopes / 6.2.1：
Specification / 6.2.2：
Notification Dissemination / 6.2.3：
Duplicate Notifications / 6.2.4：
Dynamic Scopes / 6.2.5：
Attributes and Abstract Scopes / 6.2.6：
A Correct Implementation / 6.2.7：
Event-Based Components / 6.3：
Component Interfaces / 6.3.1：
Scope Interfaces / 6.3.2：
Example / 6.3.3：
Notification Mappings / 6.4：
Transmission Policies / 6.4.1：
Publishing Policy / 6.5.1：
Delivery Policy / 6.5.2：
Traverse Policy / 6.5.3：
Influencing Notification Dissemination / 6.5.4：
Engineering With Scopes / 6.6：
Development Process / 6.6.1：
Scope Graph Handling / 6.6.2：
Scope Graph Language / 6.6.3：
Implementation Strategies for Scoping / 6.7：
Scope Architectures / 6.7.1：
Comparing Architectures / 6.7.2：
Implement Scopes as Event Brokers / 6.7.3：
Integrate Scoping and Routing / 6.7.4：
Combining Different Implementations / 6.8：
Architectures and Scope Graphs / 6.8.1：
Bridging Architectures / 6.8.2：
Integration With Other Notification Services / 6.8.3：
Composite Events / 6.9：
Composite Event Detection / 7.1：
Composite Event Detectors / 7.4.1：
Composite Event Language / 7.4.2：
Detection Architectures / 7.5：
Centralized Detection / 7.5.1：
Distributed Detection / 7.5.2：
Advanced Topics / 7.6：
Security / 8.1：
Access Control Techniques / 8.1.1：
Secure Publish/Subscribe Model / 8.1.4：
Fault Tolerance / 8.1.5：
Fault Masking / 8.2.1：
Self-Stabilizing Publish/Subscribe Systems / 8.2.2：
Self-Stabilizing Content-Based Routing / 8.2.3：
Generic Self-Stabilization Through Periodic Rebuild / 8.2.4：
Congestion Control / 8.2.5：
The Congestion Problem / 8.3.1：
Congestion Control Algorithms / 8.3.2：
Mobility / 8.3.4：
Mobility Issues in Publish/Subscribe Middleware / 8.4.1：
Physical Mobility / 8.4.2：
Logical Mobility / 8.4.3：
Existing Notification Services / 8.4.4：
Standards / 9.1：
Corba Event and Notification Service / 9.1.1：
Jini / 9.1.2：
Java Message Service (JMS) / 9.1.3：
Data Distribution for Real-Time Systems (DDS) / 9.1.4：
WS Eventing and WS Notification / 9.1.5：
The High-Level Architecture (HLA) / 9.1.6：
Commercial Systems / 9.2：
IBM WebSphere MQ / 9.2.1：
TIBCO Rendezvous / 9.2.2：
Oracle Streams Advanced Queuing / 9.2.3：
Research Prototypes / 9.3：
Gryphon / 9.3.1：
Siena / 9.3.2：
JEDI / 9.3.3：
Rebeca / 9.3.4：
Hermes / 9.3.5：
Cambridge Event Architecture (CEA) / 9.3.6：
Elvin / 9.3.7：
READY / 9.3.8：
Narada Brokering / 9.3.9：
Outlook / 10：
References
Index
Introduction / 1：
Networked Computing / 1.1：
Middleware / 1.2：
12.

電子ブック
ＥＢ
12. Distributed Event-Based Systems
Gero Mühl, Ludger Fiege, Gero Mühl, Peter Pietzuch
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Networked Computing / 1.1：
Middleware / 1.2：
Event-Based Systems / 1.3：
Application Scenarios / 1.4：
Information Dissemination / 1.4.1：
Network Monitoring / 1.4.2：
Enterprise Application Integration / 1.4.3：
Mobile Systems / 1.4.4：
Ubiquitous systems / 1.4.5：
Putting Event-Based Systems Into Context / 1.5：
From Centralized to Internet-Scale Event Systems / 1.6：
Structure of the Book / 1.7：
Basics / 2：
Terminology / 2.1：
Events and Notifications / 2.1.1：
Producers and Consumers / 2.1.2：
Subscriptions and Filters / 2.1.3：
Event Notification Service / 2.1.4：
Models of Interaction / 2.2：
Request/Reply / 2.2.1：
Anonymous Request/Reply / 2.2.2：
Callback / 2.2.3：
Event-Based / 2.2.4：
Comparison / 2.2.5：
Interaction vs. Implementation / 2.2.6：
Notification Filtering Mechanisms / 2.3：
Channels / 2.3.1：
Subject-Based Filtering / 2.3.2：
Type-Based Filtering / 2.3.3：
Content-Based Filtering / 2.3.4：
A Model Distributed Notification Service / 2.4：
System Model / 2.4.1：
Architecture / 2.4.2：
Distributed Notification Routing / 2.4.3：
Specification of Event Systems / 2.5：
Formal Background / 2.5.1：
A Simple Event System / 2.5.2：
A Simple Event System With Ordering Requirements / 2.5.3：
Simple Event System With Advertisements / 2.5.4：
Further Reading / 2.6：
Content-Based Models and Matching / 3：
Content-Based Data and Filter Models / 3.1：
Tuples / 3.1.1：
Structured Records / 3.1.2：
Semistructured Records / 3.1.3：
Objects / 3.1.4：
Matching Algorithms / 3.2：
Brute Force / 3.2.1：
Counting Algorithm / 3.2.2：
Decision Trees / 3.2.3：
Binary Decision Diagrams / 3.2.4：
Efficient XML Matching / 3.2.5：
Routing Algorithm Framework / 3.3：
Atomic Steps of the Implementation / 4.2.1：
Notification Forwarding and Delivery / 4.2.2：
Avoidance of Duplicate and Spurious Notifications / 4.2.3：
Routing Table Updates / 4.2.4：
Valid and Monotone Valid Routing Algorithms / 4.3：
Valid Routing Algorithms / 4.3.1：
Monotone Valid Routing Algorithms / 4.3.2：
Valid Framework Instantiations / 4.4：
Content-Based Routing Algorithms / 4.5：
Flooding / 4.5.1：
Simple Routing / 4.5.2：
Identity-Based Routing / 4.5.3：
Covering-Based Routing / 4.5.4：
Merging-Based Routing / 4.5.5：
Discussion / 4.5.6：
Extensions of the Basic Routing Framework / 4.6：
Routing With Advertisements / 4.6.1：
Hierarchical Routing Algorithms / 4.6.2：
Rendezvous-Based Routing / 4.6.3：
Topology Changes / 4.6.4：
Joining and Leaving Clients / 4.6.5：
Routing in Cyclic Topologies / 4.6.6：
Exploiting IP Multicast / 4.6.7：
Topology Maintenance / 4.6.8：
Engineering of Event-Based Systems / 4.7：
Engineering Requirements / 5.1：
Application Examples / 5.1.1：
Requirements / 5.1.2：
Existing Support / 5.1.3：
Accessing Publish/Subscribe Functionality / 5.2：
Generic APIs / 5.2.1：
Domain-Specific APIs / 5.2.2：
Using the API / 5.3：
Patterns and Idioms / 5.3.1：
Emitting Notifications / 5.3.2：
Scoping / 5.4：
Controlling Cooperation / 6.1：
Implicit Coordination and Visibility / 6.1.1：
Explicit Control of Visibility / 6.1.2：
The Role of Administrators / 6.1.3：
Event-Based Systems With Scopes / 6.2：
Visibility and Scopes / 6.2.1：
Specification / 6.2.2：
Notification Dissemination / 6.2.3：
Duplicate Notifications / 6.2.4：
Dynamic Scopes / 6.2.5：
Attributes and Abstract Scopes / 6.2.6：
A Correct Implementation / 6.2.7：
Event-Based Components / 6.3：
Component Interfaces / 6.3.1：
Scope Interfaces / 6.3.2：
Example / 6.3.3：
Notification Mappings / 6.4：
Transmission Policies / 6.4.1：
Publishing Policy / 6.5.1：
Delivery Policy / 6.5.2：
Traverse Policy / 6.5.3：
Influencing Notification Dissemination / 6.5.4：
Engineering With Scopes / 6.6：
Development Process / 6.6.1：
Scope Graph Handling / 6.6.2：
Scope Graph Language / 6.6.3：
Implementation Strategies for Scoping / 6.7：
Scope Architectures / 6.7.1：
Comparing Architectures / 6.7.2：
Implement Scopes as Event Brokers / 6.7.3：
Integrate Scoping and Routing / 6.7.4：
Combining Different Implementations / 6.8：
Architectures and Scope Graphs / 6.8.1：
Bridging Architectures / 6.8.2：
Integration With Other Notification Services / 6.8.3：
Composite Events / 6.9：
Composite Event Detection / 7.1：
Composite Event Detectors / 7.4.1：
Composite Event Language / 7.4.2：
Detection Architectures / 7.5：
Centralized Detection / 7.5.1：
Distributed Detection / 7.5.2：
Advanced Topics / 7.6：
Security / 8.1：
Access Control Techniques / 8.1.1：
Secure Publish/Subscribe Model / 8.1.4：
Fault Tolerance / 8.1.5：
Fault Masking / 8.2.1：
Self-Stabilizing Publish/Subscribe Systems / 8.2.2：
Self-Stabilizing Content-Based Routing / 8.2.3：
Generic Self-Stabilization Through Periodic Rebuild / 8.2.4：
Congestion Control / 8.2.5：
The Congestion Problem / 8.3.1：
Congestion Control Algorithms / 8.3.2：
Mobility / 8.3.4：
Mobility Issues in Publish/Subscribe Middleware / 8.4.1：
Physical Mobility / 8.4.2：
Logical Mobility / 8.4.3：
Existing Notification Services / 8.4.4：
Standards / 9.1：
Corba Event and Notification Service / 9.1.1：
Jini / 9.1.2：
Java Message Service (JMS) / 9.1.3：
Data Distribution for Real-Time Systems (DDS) / 9.1.4：
WS Eventing and WS Notification / 9.1.5：
The High-Level Architecture (HLA) / 9.1.6：
Commercial Systems / 9.2：
IBM WebSphere MQ / 9.2.1：
TIBCO Rendezvous / 9.2.2：
Oracle Streams Advanced Queuing / 9.2.3：
Research Prototypes / 9.3：
Gryphon / 9.3.1：
Siena / 9.3.2：
JEDI / 9.3.3：
Rebeca / 9.3.4：
Hermes / 9.3.5：
Cambridge Event Architecture (CEA) / 9.3.6：
Elvin / 9.3.7：
READY / 9.3.8：
Narada Brokering / 9.3.9：
Outlook / 10：
References
Index
Introduction / 1：
Networked Computing / 1.1：
Middleware / 1.2：
13.

電子ブック
ＥＢ
13. Software verification and validation
Dolores R. Wallace
出版情報: SpringerLink Books - AutoHoldings , Gaithersburg, MD : U.S. Dept. of Commerce, National Institute of Standards and Technology, 1989
所蔵情報: loading…
目次情報: 続きを見る
Introduction / Chapter 1：
Managing Verification and Validation / Chapter 2：
The Axioms of Leadership / Section 2.1：
Planning / Section 2.2：
Establishing the V&V Requirements / Section 2.2.1：
Establishing the V&V Plan / Section 2.2.2：
Managing the Plan / Section 2.3：
Effectiveness Measures / Section 2.3.2：
Control Gates / Section 2.3.3：
Risk Management / Section 2.4：
Identify / Section 2.4.1：
Analyze / Section 2.4.2：
Plan / Section 2.4.3：
Track / Section 2.4.4：
Control / Section 2.4.5：
Risk Management Plan / Section 2.4.6：
Communication Structures / Section 2.5：
References
The Verification and Validation Life Cycle / Chapter 3：
Traceability Analysis / Section 3.1：
Interface Analysis / Section 3.2：
Phase Dependent Analysis / Section 3.3：
Requirements Analysis / Section 3.3.1：
Design Analysis / Section 3.3.2：
Code Analysis / Section 3.3.3：
Test Analysis / Section 3.3.4：
V&V Testing / Section 3.4：
Systems V&V / Chapter 4：
Appendix A
Index
Introduction / Chapter 1：
Managing Verification and Validation / Chapter 2：
The Axioms of Leadership / Section 2.1：
14.

電子ブック
ＥＢ
14. Do-All Computing in Distributed Systems
Chryssis Georgiou, Alex A. Shvartsman, Alex Allister Shvartsman
出版情報: Springer eBooks Computer Science , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
List of Figures
List of Symbols
Foreword / Michel Raynal
Authors' Preface
Introduction / 1：
Do-All Computing / 1.1：
Do-All and Adversity / 1.2：
Solving Do-All: Fault-Tolerance with Efficiency / 1.3：
Chapter Notes / 1.4：
Distributed Cooperation Problems: Models and Definitions / 2：
Model of Computation / 2.1：
Distributed Setting / 2.1.1：
Communication / 2.1.2：
Models of Adversity / 2.2：
Processor Failure Types / 2.2.1：
Network Partitions / 2.2.2：
Adversaries and their Behavior / 2.2.3：
Tasks and Do-All Computing / 2.3：
The Do-All Problem / 2.3.1：
The Omni-Do Problem / 2.3.2：
Measures of Efficiency / 2.4：
Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast / 2.5：
Adversarial Model / 3.1：
Lower and Upper Bounds for Abstract Models / 3.2：
Modeling Knowledge / 3.2.1：
Lower Bounds / 3.2.2：
Upper Bounds / 3.2.3：
Solving Do-All Using Reliable Multicast / 3.3：
Algorithm AN / 3.3.1：
Correctness of algorithm AN / 3.3.2：
Analysis of Algorithm AN / 3.3.3：
Analysis of Message-Passing Iterative Do-All / 3.3.4：
Open Problems / 3.4：
Synchronous Do-All with Crashes and Point-to-Point Messaging / 3.5：
The Gossip Problem / 4.1：
Combinatorial Tools / 4.2：
Communication Graphs / 4.2.1：
Sets of Permutations / 4.2.2：
The Gossip Algorithm / 4.3：
Description of Algorithm Gossip[subscript epsilon] / 4.3.1：
Correctness of Algorithm Gossip[subscript epsilon] / 4.3.2：
Analysis of Algorithm Gossip[subscript epsilon] / 4.3.3：
The Do-All Algorithm / 4.4：
Description of Algorithm Doall[subscript epsilon] / 4.4.1：
Correctness of Algorithm Doall[subscript epsilon] / 4.4.2：
Analysis of Algorithm Doall[subscript epsilon] / 4.4.3：
Synchronous Do-All with Crashes and Restarts / 4.5：
A Lower Bound on Work for Restartable Processors / 5.1：
Algorithm AR for Restartable Processors / 5.3：
Description of Algorithm AR / 5.3.1：
Correctness of Algorithm AR / 5.3.2：
Complexity Analysis of Algorithm AR / 5.3.3：
Synchronous Do-All with Byzantine Failures / 5.4：
Task Execution without Verification / 6.1：
Known Maximum Number of Failures / 6.2.1：
Unknown Maximum Number of Failures / 6.2.2：
Task Execution with Verification / 6.3：
Asynchrony and Delay-Sensitive Bounds / 6.3.1：
Adversarial Model and Complexity / 7.1：
Delay-Sensitive Lower Bounds on Work / 7.2：
Deterministic Delay-Sensitive Lower Bound / 7.2.1：
Delay-sensitive Lower Bound for Randomized Algorithms / 7.2.2：
Contention of Permutations / 7.3：
Contention and Oblivious Tasks Scheduling / 7.3.1：
Generalized Contention / 7.3.2：
Deterministic Algorithms Family DA / 7.4：
Construction and Correctness of Algorithm DA(q) / 7.4.1：
Complexity Analysis of Algorithm DA(q) / 7.4.2：
Permutation Algorithms Family PA / 7.5：
Algorithm Specification / 7.5.1：
Complexity Analysis / 7.5.2：
Analysis of Omni-Do in Asynchronous Partitionable Networks / 7.6：
A Group Communication Service and Notation / 8.1：
View-Graphs / 8.3：
Algorithm AX / 8.4：
Description of the Algorithm / 8.4.1：
Correctness of the Algorithm / 8.4.2：
Analysis of Algorithm AX / 8.5：
Work Complexity / 8.5.1：
Message Complexity / 8.5.2：
Analysis Under Adversary A[subscript F] / 8.5.3：
Competitive Analysis of Omni-Do in Partitionable Networks / 8.6：
Model of Adversity, Competitiveness and Definitions / 9.1：
Adversary A[subscript GR] / 9.1.1：
Measuring Competitiveness / 9.1.2：
Formalizing Computation Width / 9.1.3：
Algorithm RS and its Analysis / 9.2：
Description of Algorithm RS / 9.2.1：
Analysis of Algorithm RS / 9.2.2：
Deterministic Algorithms / 9.2.3：
Cooperation in the Absence of Communication / 9.3：
Adversity, Schedules, Waste, and Designs / 10.1：
Redundancy without Communication: a Lower Bound / 10.2：
Random Schedules / 10.3：
Derandomization via Finite Geometries / 10.4：
Related Cooperation Problems and Models / 10.5：
Do-All in Shared-Memory / 11.1：
Do-All with Broadcast Channels / 11.2：
Consensus and its Connection to Do-All / 11.3：
References
Index
List of Figures
List of Symbols
Foreword / Michel Raynal
15.

電子ブック
ＥＢ
15. Do-All Computing in Distributed Systems
Chryssis Georgiou, Alex A. Shvartsman, Alex Allister Shvartsman
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2008
所蔵情報: loading…
目次情報: 続きを見る
List of Figures
List of Symbols
Foreword / Michel Raynal
Authors' Preface
Introduction / 1：
Do-All Computing / 1.1：
Do-All and Adversity / 1.2：
Solving Do-All: Fault-Tolerance with Efficiency / 1.3：
Chapter Notes / 1.4：
Distributed Cooperation Problems: Models and Definitions / 2：
Model of Computation / 2.1：
Distributed Setting / 2.1.1：
Communication / 2.1.2：
Models of Adversity / 2.2：
Processor Failure Types / 2.2.1：
Network Partitions / 2.2.2：
Adversaries and their Behavior / 2.2.3：
Tasks and Do-All Computing / 2.3：
The Do-All Problem / 2.3.1：
The Omni-Do Problem / 2.3.2：
Measures of Efficiency / 2.4：
Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast / 2.5：
Adversarial Model / 3.1：
Lower and Upper Bounds for Abstract Models / 3.2：
Modeling Knowledge / 3.2.1：
Lower Bounds / 3.2.2：
Upper Bounds / 3.2.3：
Solving Do-All Using Reliable Multicast / 3.3：
Algorithm AN / 3.3.1：
Correctness of algorithm AN / 3.3.2：
Analysis of Algorithm AN / 3.3.3：
Analysis of Message-Passing Iterative Do-All / 3.3.4：
Open Problems / 3.4：
Synchronous Do-All with Crashes and Point-to-Point Messaging / 3.5：
The Gossip Problem / 4.1：
Combinatorial Tools / 4.2：
Communication Graphs / 4.2.1：
Sets of Permutations / 4.2.2：
The Gossip Algorithm / 4.3：
Description of Algorithm Gossip[subscript epsilon] / 4.3.1：
Correctness of Algorithm Gossip[subscript epsilon] / 4.3.2：
Analysis of Algorithm Gossip[subscript epsilon] / 4.3.3：
The Do-All Algorithm / 4.4：
Description of Algorithm Doall[subscript epsilon] / 4.4.1：
Correctness of Algorithm Doall[subscript epsilon] / 4.4.2：
Analysis of Algorithm Doall[subscript epsilon] / 4.4.3：
Synchronous Do-All with Crashes and Restarts / 4.5：
A Lower Bound on Work for Restartable Processors / 5.1：
Algorithm AR for Restartable Processors / 5.3：
Description of Algorithm AR / 5.3.1：
Correctness of Algorithm AR / 5.3.2：
Complexity Analysis of Algorithm AR / 5.3.3：
Synchronous Do-All with Byzantine Failures / 5.4：
Task Execution without Verification / 6.1：
Known Maximum Number of Failures / 6.2.1：
Unknown Maximum Number of Failures / 6.2.2：
Task Execution with Verification / 6.3：
Asynchrony and Delay-Sensitive Bounds / 6.3.1：
Adversarial Model and Complexity / 7.1：
Delay-Sensitive Lower Bounds on Work / 7.2：
Deterministic Delay-Sensitive Lower Bound / 7.2.1：
Delay-sensitive Lower Bound for Randomized Algorithms / 7.2.2：
Contention of Permutations / 7.3：
Contention and Oblivious Tasks Scheduling / 7.3.1：
Generalized Contention / 7.3.2：
Deterministic Algorithms Family DA / 7.4：
Construction and Correctness of Algorithm DA(q) / 7.4.1：
Complexity Analysis of Algorithm DA(q) / 7.4.2：
Permutation Algorithms Family PA / 7.5：
Algorithm Specification / 7.5.1：
Complexity Analysis / 7.5.2：
Analysis of Omni-Do in Asynchronous Partitionable Networks / 7.6：
A Group Communication Service and Notation / 8.1：
View-Graphs / 8.3：
Algorithm AX / 8.4：
Description of the Algorithm / 8.4.1：
Correctness of the Algorithm / 8.4.2：
Analysis of Algorithm AX / 8.5：
Work Complexity / 8.5.1：
Message Complexity / 8.5.2：
Analysis Under Adversary A[subscript F] / 8.5.3：
Competitive Analysis of Omni-Do in Partitionable Networks / 8.6：
Model of Adversity, Competitiveness and Definitions / 9.1：
Adversary A[subscript GR] / 9.1.1：
Measuring Competitiveness / 9.1.2：
Formalizing Computation Width / 9.1.3：
Algorithm RS and its Analysis / 9.2：
Description of Algorithm RS / 9.2.1：
Analysis of Algorithm RS / 9.2.2：
Deterministic Algorithms / 9.2.3：
Cooperation in the Absence of Communication / 9.3：
Adversity, Schedules, Waste, and Designs / 10.1：
Redundancy without Communication: a Lower Bound / 10.2：
Random Schedules / 10.3：
Derandomization via Finite Geometries / 10.4：
Related Cooperation Problems and Models / 10.5：
Do-All in Shared-Memory / 11.1：
Do-All with Broadcast Channels / 11.2：
Consensus and its Connection to Do-All / 11.3：
References
Index
List of Figures
List of Symbols
Foreword / Michel Raynal
16.

電子ブック
ＥＢ
16. Peer-to-Peer Computing for Mobile Networks
Maria Papadopouli, Henning Schulzrinne
出版情報: Springer eBooks Computer Science , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Wireless data communications / 1.1：
Mobile information access / 1.2：
Wireless Internet via APs / 1.2.1：
Infostations / 1.2.2：
Peer-to-Peer systems / 1.2.3：
Target mobile computing environment / 1.3：
High spatial locality of information and queriess / 1.3.1：
Heterogeneity in application requirements / 1.3.2：
Enhancement of information access / 1.3.3：
Resource sharing using 7DS / 1.4：
Overview of this monograph / 1.5：
Outline / 1.5.1：
7DS architecture for information sharing / 2：
Overview of 7DS architecture / 2.1：
Communication / 2.1.1：
Cache management / 2.1.2：
Power conservation / 2.1.3：
Preventing denial-of-service attacks / 2.2：
Encouraging cooperation / 2.3：
Micropayment mechanisms / 2.3.1：
Reputation mechanisms / 2.3.2：
Location-sensing using the peer-to-peer paradigm / 2.4：
Overview of CLS / 2.4.1：
Particle filter-based framework / 2.4.2：
Performance of CLS and other related systems / 2.4.3：
Applications using information sharing via 7DS / 2.5：
Web browsing / 2.5.1：
Notesharing and whiteboard tool / 2.5.2：
Multimedia traveling journal / 2.5.3：
Related mobile peer-to-peer computing systems / 2.6：
Conclusions / 2.7：
Performance analysis of information discovery and dissemination / 3：
Information discovery schemes / 3.1：
Simulation assumptions / 3.2：
Data dissemination benchmarks / 3.3：
Density of dataholders / 3.4：
Average delay / 3.5：
Scaling properties of data dissemination / 3.6：
Models of information dissemination / 3.7：
Simple epidemic model / 3.7.1：
Diffusion-controlled process / 3.7.2：
Discussion / 3.8：
Empirically-based measurements on wireless demand / 4：
Campus-wide wireless infrastructure / 4.1：
Monitoring and data acquisition / 4.3：
Packet header traces / 4.3.1：
HTTP traces / 4.3.2：
SNMP traces / 4.3.3：
SYSLOG traces / 4.3.4：
Privacy assurances / 4.3.5：
Client identification / 4.3.6：
State, history, visits and sessions / 4.4：
Wireless traffic demand at APs / 4.5：
Data acquisition / 4.5.1：
Comparative analysis of wireless traffic load at APs / 4.5.2：
Application-based characterization of wireless demand / 4.6：
Locality of web objects / 4.7：
HTTP requests model / 4.7.1：
Same-client repeated requests / 4.7.2：
Same-AP repeated requests / 4.7.3：
AP_coresident-client repeated requests / 4.7.4：
Same-building and campus-wide repeated requests / 4.7.5：
Modeling the wireless user demand / 4.8：
Client access patterns / 5.1：
Session duration / 5.2.1：
Transient sessions / 5.2.2：
Revisits / 5.2.3：
Roaming across APs / 5.3：
Arrivals of wireless clients at APs / 5.4：
Time-varying Poisson process / 5.4.1：
Arrival process of visits at wireless hotspots / 5.4.2：
Methodology for modeling user demand / 5.5：
Sessions and flows / 5.5.1：
Models of user demand / 5.5.2：
Syntrig: a synthetic traffic generator / 5.6：
Scalability and reusability in user demand models / 5.7：
Variation of the session arrival rate within a day / 5.7.1：
Variation of the session-level flow-related variables / 5.7.2：
Evaluation of user demand models / 5.8：
Statistical-based evaluation / 5.8.1：
Systems-based evaluation / 5.8.2：
Singular spectrum analysis of traffic at APs / 5.9：
Related work / 5.10：
Conclusions and future work / 5.11：
Mobile peer-to-peer computing / 6.1：
Wireless measurements and modeling / 6.1.2：
Directions for future research / 6.2：
Increasing capacity / 6.2.1：
Capacity planning / 6.2.2：
Network interface and channel selection / 6.2.3：
Monitoring / 6.2.4：
Bio-inspired computing networks / 6.3：
New horizons in cross-disciplinary research / 6.4：
Appendices
Appendix / A：
Wireless measurement-based data repositories / B：
References
Index
Introduction / 1：
Wireless data communications / 1.1：
Mobile information access / 1.2：
17.

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

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

電子ブック
ＥＢ
19. Peer-to-Peer Computing for Mobile Networks
Maria Papadopouli, Henning Schulzrinne
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Wireless data communications / 1.1：
Mobile information access / 1.2：
Wireless Internet via APs / 1.2.1：
Infostations / 1.2.2：
Peer-to-Peer systems / 1.2.3：
Target mobile computing environment / 1.3：
High spatial locality of information and queriess / 1.3.1：
Heterogeneity in application requirements / 1.3.2：
Enhancement of information access / 1.3.3：
Resource sharing using 7DS / 1.4：
Overview of this monograph / 1.5：
Outline / 1.5.1：
7DS architecture for information sharing / 2：
Overview of 7DS architecture / 2.1：
Communication / 2.1.1：
Cache management / 2.1.2：
Power conservation / 2.1.3：
Preventing denial-of-service attacks / 2.2：
Encouraging cooperation / 2.3：
Micropayment mechanisms / 2.3.1：
Reputation mechanisms / 2.3.2：
Location-sensing using the peer-to-peer paradigm / 2.4：
Overview of CLS / 2.4.1：
Particle filter-based framework / 2.4.2：
Performance of CLS and other related systems / 2.4.3：
Applications using information sharing via 7DS / 2.5：
Web browsing / 2.5.1：
Notesharing and whiteboard tool / 2.5.2：
Multimedia traveling journal / 2.5.3：
Related mobile peer-to-peer computing systems / 2.6：
Conclusions / 2.7：
Performance analysis of information discovery and dissemination / 3：
Information discovery schemes / 3.1：
Simulation assumptions / 3.2：
Data dissemination benchmarks / 3.3：
Density of dataholders / 3.4：
Average delay / 3.5：
Scaling properties of data dissemination / 3.6：
Models of information dissemination / 3.7：
Simple epidemic model / 3.7.1：
Diffusion-controlled process / 3.7.2：
Discussion / 3.8：
Empirically-based measurements on wireless demand / 4：
Campus-wide wireless infrastructure / 4.1：
Monitoring and data acquisition / 4.3：
Packet header traces / 4.3.1：
HTTP traces / 4.3.2：
SNMP traces / 4.3.3：
SYSLOG traces / 4.3.4：
Privacy assurances / 4.3.5：
Client identification / 4.3.6：
State, history, visits and sessions / 4.4：
Wireless traffic demand at APs / 4.5：
Data acquisition / 4.5.1：
Comparative analysis of wireless traffic load at APs / 4.5.2：
Application-based characterization of wireless demand / 4.6：
Locality of web objects / 4.7：
HTTP requests model / 4.7.1：
Same-client repeated requests / 4.7.2：
Same-AP repeated requests / 4.7.3：
AP_coresident-client repeated requests / 4.7.4：
Same-building and campus-wide repeated requests / 4.7.5：
Modeling the wireless user demand / 4.8：
Client access patterns / 5.1：
Session duration / 5.2.1：
Transient sessions / 5.2.2：
Revisits / 5.2.3：
Roaming across APs / 5.3：
Arrivals of wireless clients at APs / 5.4：
Time-varying Poisson process / 5.4.1：
Arrival process of visits at wireless hotspots / 5.4.2：
Methodology for modeling user demand / 5.5：
Sessions and flows / 5.5.1：
Models of user demand / 5.5.2：
Syntrig: a synthetic traffic generator / 5.6：
Scalability and reusability in user demand models / 5.7：
Variation of the session arrival rate within a day / 5.7.1：
Variation of the session-level flow-related variables / 5.7.2：
Evaluation of user demand models / 5.8：
Statistical-based evaluation / 5.8.1：
Systems-based evaluation / 5.8.2：
Singular spectrum analysis of traffic at APs / 5.9：
Related work / 5.10：
Conclusions and future work / 5.11：
Mobile peer-to-peer computing / 6.1：
Wireless measurements and modeling / 6.1.2：
Directions for future research / 6.2：
Increasing capacity / 6.2.1：
Capacity planning / 6.2.2：
Network interface and channel selection / 6.2.3：
Monitoring / 6.2.4：
Bio-inspired computing networks / 6.3：
New horizons in cross-disciplinary research / 6.4：
Appendices
Appendix / A：
Wireless measurement-based data repositories / B：
References
Index
Introduction / 1：
Wireless data communications / 1.1：
Mobile information access / 1.2：
20.

電子ブック
ＥＢ
20. Security for Wireless Sensor Networks
Donggang Liu, Sushil Jajodia, Peng Ning
出版情報: Springer eBooks Computer Science , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Wireless Sensor Network / 1.1：
Design Challenges / 1.2：
Security Issues in Sensor Networks / 1.3：
Broadcast Authentication / 1.3.1：
Pairwise Key Establishment / 1.3.2：
Security in Localization / 1.3.3：
Orgnization of the Book / 1.4：
[mu]TESLA Broadcast Authentication / 2：
Multi-Level [mu]TESLA / 2.2：
Scheme I: Predetermined Key Chain Commitment / 2.2.1：
Scheme II: Naive Two-Level [mu]TESLA / 2.2.2：
Scheme III: Fault Tolerant Two-Level [mu]TESLA / 2.2.3：
Scheme IV: DOS-Tolerant Two-Level [mu]TESLA / 2.2.4：
Scheme V: DOS-Resistant Two-Level [mu]TESLA / 2.2.5：
Scheme VI: Multi-Level [mu]TESLA / 2.2.6：
Experimental Results / 2.2.7：
Tree-Based [mu]TESLA / 2.3：
The Basic Approach / 2.3.1：
A Scheme for Long-Lived Senders / 2.3.2：
Distributing Parameter Certificates / 2.3.3：
Revoking [mu]TESLA Instances / 2.3.4：
Implementation and Evaluation / 2.3.5：
Summary / 2.4：
Key Pre-Distribution Techniques in Sensor Networks / 3：
Polynomial-Based Key Pre-Distribution / 3.1.1：
Probabilistic Key Pre-Distribution / 3.1.2：
Polynomial Pool-Based Key Pre-Distribution / 3.2：
Phase 1: Setup / 3.2.1：
Phase 2: Direct Key Establishment / 3.2.2：
Phase 3: Path Key Establishment / 3.2.3：
Key Pre-Distribution Using Random Subset Assignment / 3.3：
The Random Subset Assignment Scheme / 3.3.1：
Performance / 3.3.2：
Overheads / 3.3.3：
Security Analysis / 3.3.4：
Comparison with Previous Schemes / 3.3.5：
Hypercube-based Key Pre-Distribution / 3.4：
The Hypercube-Based Scheme / 3.4.1：
Dynamic Key Path Discovery / 3.4.2：
Overhead / 3.4.3：
Optimization of Polynomial Evaluation / 3.4.5：
Evaluation / 3.5.2：
Improving Pairwise Key Establishment Using Deployment Knowledge / 3.6：
Improving Key Pre-Distribution with Prior Deployment Knowledge / 4.1：
A Location-Aware Deployment Model / 4.1.1：
Closest Pairwise Keys Scheme / 4.1.2：
Closest Polynomials Pre-Distribution Scheme / 4.1.3：
Improving Key Pre-Distribution with Post Deployment Knowledge / 4.2：
Key Prioritization Using Post Deployment Knowledge / 4.2.1：
Improving Random Subset Assignment Scheme with Deployment Locations / 4.2.2：
Improving Key Pre-Distribution with Group Deployment Knowledge / 4.3：
Group-Based Deployment Model / 4.3.1：
A General Framework / 4.3.2：
Performance Analysis / 4.3.3：
Secure Localization / 4.3.4：
Localization in Sensor Networks / 5.1：
Pitfalls of Current Localization Schemes under Attacks / 5.2：
Attack-Resistant Location Estimation / 5.3：
Assumptions / 5.3.1：
Attack-Resistant Minimum Mean Square Estimation (MMSE) / 5.3.2：
Voting-Based Location Estimation / 5.3.3：
Simulation Evaluation / 5.3.4：
Implementation and Field Experiments / 5.3.6：
A Detector for Malicious Beacon Nodes / 5.4：
Detecting Malicious Beacon Signals / 5.4.1：
Filtering Replayed Beacon Signals / 5.4.2：
Revoking Malicious Beacon Nodes / 5.4.3：
Summary and Future Work / 5.4.4：
Future Work / 6.1：
References
Index
Introduction / 1：
Wireless Sensor Network / 1.1：
Design Challenges / 1.2：
21.

電子ブック
ＥＢ
21. Security for Wireless Sensor Networks
Donggang Liu, Sushil Jajodia, Peng Ning
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2007
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Wireless Sensor Network / 1.1：
Design Challenges / 1.2：
Security Issues in Sensor Networks / 1.3：
Broadcast Authentication / 1.3.1：
Pairwise Key Establishment / 1.3.2：
Security in Localization / 1.3.3：
Orgnization of the Book / 1.4：
[mu]TESLA Broadcast Authentication / 2：
Multi-Level [mu]TESLA / 2.2：
Scheme I: Predetermined Key Chain Commitment / 2.2.1：
Scheme II: Naive Two-Level [mu]TESLA / 2.2.2：
Scheme III: Fault Tolerant Two-Level [mu]TESLA / 2.2.3：
Scheme IV: DOS-Tolerant Two-Level [mu]TESLA / 2.2.4：
Scheme V: DOS-Resistant Two-Level [mu]TESLA / 2.2.5：
Scheme VI: Multi-Level [mu]TESLA / 2.2.6：
Experimental Results / 2.2.7：
Tree-Based [mu]TESLA / 2.3：
The Basic Approach / 2.3.1：
A Scheme for Long-Lived Senders / 2.3.2：
Distributing Parameter Certificates / 2.3.3：
Revoking [mu]TESLA Instances / 2.3.4：
Implementation and Evaluation / 2.3.5：
Summary / 2.4：
Key Pre-Distribution Techniques in Sensor Networks / 3：
Polynomial-Based Key Pre-Distribution / 3.1.1：
Probabilistic Key Pre-Distribution / 3.1.2：
Polynomial Pool-Based Key Pre-Distribution / 3.2：
Phase 1: Setup / 3.2.1：
Phase 2: Direct Key Establishment / 3.2.2：
Phase 3: Path Key Establishment / 3.2.3：
Key Pre-Distribution Using Random Subset Assignment / 3.3：
The Random Subset Assignment Scheme / 3.3.1：
Performance / 3.3.2：
Overheads / 3.3.3：
Security Analysis / 3.3.4：
Comparison with Previous Schemes / 3.3.5：
Hypercube-based Key Pre-Distribution / 3.4：
The Hypercube-Based Scheme / 3.4.1：
Dynamic Key Path Discovery / 3.4.2：
Overhead / 3.4.3：
Optimization of Polynomial Evaluation / 3.4.5：
Evaluation / 3.5.2：
Improving Pairwise Key Establishment Using Deployment Knowledge / 3.6：
Improving Key Pre-Distribution with Prior Deployment Knowledge / 4.1：
A Location-Aware Deployment Model / 4.1.1：
Closest Pairwise Keys Scheme / 4.1.2：
Closest Polynomials Pre-Distribution Scheme / 4.1.3：
Improving Key Pre-Distribution with Post Deployment Knowledge / 4.2：
Key Prioritization Using Post Deployment Knowledge / 4.2.1：
Improving Random Subset Assignment Scheme with Deployment Locations / 4.2.2：
Improving Key Pre-Distribution with Group Deployment Knowledge / 4.3：
Group-Based Deployment Model / 4.3.1：
A General Framework / 4.3.2：
Performance Analysis / 4.3.3：
Secure Localization / 4.3.4：
Localization in Sensor Networks / 5.1：
Pitfalls of Current Localization Schemes under Attacks / 5.2：
Attack-Resistant Location Estimation / 5.3：
Assumptions / 5.3.1：
Attack-Resistant Minimum Mean Square Estimation (MMSE) / 5.3.2：
Voting-Based Location Estimation / 5.3.3：
Simulation Evaluation / 5.3.4：
Implementation and Field Experiments / 5.3.6：
A Detector for Malicious Beacon Nodes / 5.4：
Detecting Malicious Beacon Signals / 5.4.1：
Filtering Replayed Beacon Signals / 5.4.2：
Revoking Malicious Beacon Nodes / 5.4.3：
Summary and Future Work / 5.4.4：
Future Work / 6.1：
References
Index
Introduction / 1：
Wireless Sensor Network / 1.1：
Design Challenges / 1.2：
22.

電子ブック
ＥＢ
22. Introduction to PHP for Scientists and Engineers
David R. Brooks
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Creating a Server-Side Environment for PHP / 1：
Getting Started / 1.1：
More Examples / 1.2：
Solving the Quadratic Equation / 1.2.1：
Preventing Multiple Submissions from a Form / 1.2.2：
Working with PHP / 2：
General Structure of PHP Scripts / 2.1：
Calculations with PHP / 2.2：
More about PHP File Input/Output / 2.3：
Another Example / 2.4：
PHP Arrays / 3：
Array Definition / 3.1：
Array Sorting / 3.2：
Stacks, Queues, and Line Crashers / 3.3：
The Quadratic Formula Revisited / 3.4：
Reading checkbox Values / 3.4.2：
Building a Histogram Array / 3.4.3：
Shuffle a Card Deck / 3.4.4：
Manage a Data File / 3.4.5：
Summary of Selected PHP Language Elements / 4：
Data Types and Operators / 4.1：
Data Types / 4.2.1：
Operators
Conditional Execution / 4.2：
if... then... else... Conditional Execution
Case-Controlled Conditional Execution / 4.2.2：
Loops / 4.3：
Count-Controlled Loops / 4.3.1：
Condition-Controlled Loops / 4.3.2：
Functions and Constructs / 4.4：
File Handling and I/O Functions / 4.4.1：
Math Constants and Functions / 4.4.2：
Array Functions and Constructs / 4.4.3：
Miscellaneous Functions and Constructs / 4.4.4：
Using PHP from a Command Line / 5：
The Command Line Environment / 5.1：
Is a Command Line Interface Useful? / 5.2：
Appendices
List of HTML and PHP Document Examples / A.1：
ASCII Characters for Windows PCs / A.2：
Exercises
Glossary
Index
Creating a Server-Side Environment for PHP / 1：
Getting Started / 1.1：
More Examples / 1.2：
23.

電子ブック
ＥＢ
23. Introduction to PHP for Scientists and Engineers
David R. Brooks
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Creating a Server-Side Environment for PHP / 1：
Getting Started / 1.1：
More Examples / 1.2：
Solving the Quadratic Equation / 1.2.1：
Preventing Multiple Submissions from a Form / 1.2.2：
Working with PHP / 2：
General Structure of PHP Scripts / 2.1：
Calculations with PHP / 2.2：
More about PHP File Input/Output / 2.3：
Another Example / 2.4：
PHP Arrays / 3：
Array Definition / 3.1：
Array Sorting / 3.2：
Stacks, Queues, and Line Crashers / 3.3：
The Quadratic Formula Revisited / 3.4：
Reading checkbox Values / 3.4.2：
Building a Histogram Array / 3.4.3：
Shuffle a Card Deck / 3.4.4：
Manage a Data File / 3.4.5：
Summary of Selected PHP Language Elements / 4：
Data Types and Operators / 4.1：
Data Types / 4.2.1：
Operators
Conditional Execution / 4.2：
if... then... else... Conditional Execution
Case-Controlled Conditional Execution / 4.2.2：
Loops / 4.3：
Count-Controlled Loops / 4.3.1：
Condition-Controlled Loops / 4.3.2：
Functions and Constructs / 4.4：
File Handling and I/O Functions / 4.4.1：
Math Constants and Functions / 4.4.2：
Array Functions and Constructs / 4.4.3：
Miscellaneous Functions and Constructs / 4.4.4：
Using PHP from a Command Line / 5：
The Command Line Environment / 5.1：
Is a Command Line Interface Useful? / 5.2：
Appendices
List of HTML and PHP Document Examples / A.1：
ASCII Characters for Windows PCs / A.2：
Exercises
Glossary
Index
Creating a Server-Side Environment for PHP / 1：
Getting Started / 1.1：
More Examples / 1.2：
24.

電子ブック
ＥＢ
24. End-to-End Quality of Service Over Heterogeneous Networks
Torsten; Diaz, Michel; Gabeiras, Jos? Enr?quez Braun, Torsten Braun, Thomas Staub
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Acronyms
Motivation and Basics / Torsten Braun ; Thomas Staub1：
Quality of Service and its Parameters / 1.1：
Delay and Delay Variations in End-to-End Packet Delivery / 1.1.1：
Bandwidth and Packet Loss Ratio / 1.1.2：
Applications' QoS Requirements / 1.2：
Types of Network Applications / 1.2.1：
QoS Requirements of Applications / 1.2.2：
Packet Scheduling in Network Elements / 1.3：
(Non)Work-Conserving Scheduling Disciplines / 1.3.1：
Fairness / 1.3.2：
Scheduling Disciplines / 1.3.3：
Packet Dropping / 1.3.4：
Quality-of-Service Architectures / 1.4：
Integrated Services / 1.4.1：
Differentiated Services / 1.4.2：
End-to-End QoS Mechanisms / 1.4.3：
Implementation and Performance of QoS-aware Applications / 1.5：
Prerequisites for Successful QoS Applications / 1.5.1：
Media Scaling / 1.5.2：
Applications' Performance Gain Due to QoS / 1.5.3：
Summary / 1.5.4：
Structure of the Book / 1.6：
QoS Measurements in IP-based Networks / Rene Serral-Gracia ; Jordi Domingo-Pascual ; Andrzej Beben ; Philippe Owezarski2：
Introduction / 2.1：
Measurement Metrics / 2.2：
Network Level / 2.2.1：
Call level / 2.2.2：
User Level / 2.2.3：
Measurement Techniques / 2.3：
Previous Considerations / 2.3.1：
Base Techniques / 2.3.2：
Active Measurements / 2.3.3：
Passive Measurements / 2.3.4：
Conclusions / 2.4：
Traffic Engineering / Luciano Lenzini ; Enzo Mingozzi ; Giovanni Stea3：
A Motivating Example / 3.1：
Multi-Protocol Label Switching Architecture / 3.3：
The Forwarding Component / 3.3.1：
The Control Component / 3.3.2：
MPLS Optimisation / 3.3.3：
MPLS-Based Traffic Engineering / 3.4：
Constraint-Based Routing / 3.4.1：
Explicit Route Signalling / 3.4.2：
Traffic Engineering Practices / 3.4.3：
Traffic Engineering and Quality of Service / 3.5：
QoS Support over MPLS / 3.5.1：
Traffic Engineering Extensions for DiffServ / 3.5.2：
Signalling / Ilaria Marchetti ; Antonio Pietrabissa ; Massimiliano Rossi ; Fernando Boavida ; Luis Cordeiro ; Edmundo Monteiro ; Marilia Curado3.6：
Session Initiation Protocol (SIP) / 4.1：
SIP and Its Value Propositions / 4.2.1：
Protocol Components / 4.2.2：
SIP Messages / 4.2.3：
Session Description / 4.2.4：
Establishment of an SIP Session / 4.2.5：
SIP's Extension / 4.2.6：
The Next Steps In Signalling (NSIS) / 4.3：
Background and Main Characteristics / 4.3.1：
Overview of Signalling Scenarios and Protocol Structure / 4.3.2：
The NSIS Layer Transport Protocol / 4.3.3：
Common Open Policy Service (COPS) / 4.4：
COPS Overview / 4.4.1：
Basic Model / 4.4.2：
COPS Protocol / 4.4.3：
COPS Messages / 4.4.4：
Common Operation / 4.4.5：
Using Examples: COPS for RSVP / 4.4.6：
Enhanced Transport Protocols / Nicolas Wambeke ; Ernesto Exposito ; Guillaume Jourjon ; Emmanuel Lochin4.5：
State of the Art of Transport Protocols / 5.1：
TCP and UDP / 5.2.1：
TCP Evolution / 5.2.2：
SCTP / 5.2.3：
DCCP / 5.2.4：
Discussion / 5.2.5：
Transport Mechanisms / 5.3：
Overview / 5.3.1：
Congestion-Control Mechanisms / 5.3.2：
Reliability Mechanisms / 5.3.3：
Enhanced Transport Protocol Mechanisms / 5.3.4：
TFRC and gTFRC, a QoS-Aware Congestion Control / 5.4.1：
Application-Aware Transport Mechanisms / 5.4.2：
The EuQoS System / Michel Diaz ; Jose Enriquez-Gabeiras ; Laurent Baresse ; Wojciech Burakowski ; Maria Angeles Callejo-Rodriguez ; Jorge Carapinha ; Olivier Dugeon ; Mathieu Gineste ; Florin Racaru ; Jaroslaw Sliwinski ; Halina Tarasiuk ; Markus Wulff5.5：
Architecture / 6.1：
Goals and Requirements / 6.2.1：
Functional Blocks and their Main Functions / 6.2.2：
Control Plane Elements: RM and RA / 6.2.3：
Provisioning, Invocation, and Operation, Administration and Management / 6.3：
Provisioning Process / 6.3.1：
Invocation Process / 6.3.2：
Operation, Administration and Management / 6.3.3：
End-to-End Classes of Service in Heterogeneous Networks / 6.4：
End-to-end Classes of Service in EuQoS / 6.4.1：
QoS Mechanisms and Algorithms for Specification of e2e Classes of Service / 6.4.2：
Implementation of e2e Classes of Service in Underlying Technologies / 6.4.3：
EuQoS Enhanced Transport Protocol / 6.5：
Enhanced Transport Protocol Services for EuQoS / 6.5.1：
Services for Streaming/Nonstreaming Applications / 6.5.3：
Multicast / 6.6：
Application Layer Multicast / 6.6.1：
Application Layer Multicast in the EuQoS System / 6.6.2：
Multicast Middleware / 6.6.3：
Introducing QoS to Multicast Middleware / 6.6.4：
Telemedicine Application / 6.7：
Telemedicine-the Case for Application-Driven QoS / 6.7.1：
Overview of Medigraf / 6.7.2：
Medigraf Adaptation to EuQoS / 6.7.3：
Summary and Outlook / 6.8：
Implementing Protocols on Network Simulators / Jana KrahenbuhlAppendix A：
Main Simulation Terms and Concepts / A.1：
Simulation Process / A.1.1：
Simulation Types / A.1.2：
Network Simulation / A.2：
Parallel/Distributed versus Serial Execution of Simulations / A.2.1：
Packet-Level, Fluid-Based and Hybrid Model Simulation / A.2.2：
Simulation Speedup / A.2.3：
Network Simulation in Research / A.2.4：
Simulation for Education Purposes / A.2.5：
Network Simulators / A.3：
GloMoSim and Qualnet / A.3.1：
JiST/SWANS / A.3.2：
Scalable Simulation Framework (SSF) and SSFNet / A.3.3：
OMNeT++ and OMNEST / A.3.4：
The Network Simulator ns-2 / A.4：
The Language Concept / A.4.1：
Hierarchical Structure / A.4.2：
First Steps-Simulation Script Template / A.4.3：
Nodes, Links and Traffic / A.4.4：
Wireless Networks / A.4.5：
Implementing Protocols with ns-2 / A.4.6：
Advice for Running ns-2 Simulations / A.4.7：
Analysing Methods / A.4.8：
Network Emulation Focusing on QoS-Oriented Satellite Communication / Laurent Dairaine ; Herve ThalmensyAppendix B：
Network Emulation Basics / B.1：
Introduction to Network Emulation / B.1.1：
What is Network Emulation? / B.1.2：
Why Use Network Emulation? / B.1.3：
Requirements for Emulation Systems / B.1.4：
Network Emulation System Approaches / B.1.5：
Case Study: Emulation of QoS-oriented Satellite Communication / B.2：
DVB Satellite Communications / B.2.1：
QoS Support for Satellite Network Systems / B.2.3：
Emulation of a DVB-S, DVB-RCS Satellite System / B.2.4：
References / B.3：
Index
Preface
Acknowledgements
Acronyms
25.

電子ブック
ＥＢ
25. End-to-End Quality of Service Over Heterogeneous Networks
Torsten; Diaz, Michel; Gabeiras, José Enríquez Braun, Torsten Braun, Thomas Staub, Michel Diaz, José Enríquez Gabeiras
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Acronyms
Motivation and Basics / Torsten Braun ; Thomas Staub1：
Quality of Service and its Parameters / 1.1：
Delay and Delay Variations in End-to-End Packet Delivery / 1.1.1：
Bandwidth and Packet Loss Ratio / 1.1.2：
Applications' QoS Requirements / 1.2：
Types of Network Applications / 1.2.1：
QoS Requirements of Applications / 1.2.2：
Packet Scheduling in Network Elements / 1.3：
(Non)Work-Conserving Scheduling Disciplines / 1.3.1：
Fairness / 1.3.2：
Scheduling Disciplines / 1.3.3：
Packet Dropping / 1.3.4：
Quality-of-Service Architectures / 1.4：
Integrated Services / 1.4.1：
Differentiated Services / 1.4.2：
End-to-End QoS Mechanisms / 1.4.3：
Implementation and Performance of QoS-aware Applications / 1.5：
Prerequisites for Successful QoS Applications / 1.5.1：
Media Scaling / 1.5.2：
Applications' Performance Gain Due to QoS / 1.5.3：
Summary / 1.5.4：
Structure of the Book / 1.6：
QoS Measurements in IP-based Networks / Rene Serral-Gracia ; Jordi Domingo-Pascual ; Andrzej Beben ; Philippe Owezarski2：
Introduction / 2.1：
Measurement Metrics / 2.2：
Network Level / 2.2.1：
Call level / 2.2.2：
User Level / 2.2.3：
Measurement Techniques / 2.3：
Previous Considerations / 2.3.1：
Base Techniques / 2.3.2：
Active Measurements / 2.3.3：
Passive Measurements / 2.3.4：
Conclusions / 2.4：
Traffic Engineering / Luciano Lenzini ; Enzo Mingozzi ; Giovanni Stea3：
A Motivating Example / 3.1：
Multi-Protocol Label Switching Architecture / 3.3：
The Forwarding Component / 3.3.1：
The Control Component / 3.3.2：
MPLS Optimisation / 3.3.3：
MPLS-Based Traffic Engineering / 3.4：
Constraint-Based Routing / 3.4.1：
Explicit Route Signalling / 3.4.2：
Traffic Engineering Practices / 3.4.3：
Traffic Engineering and Quality of Service / 3.5：
QoS Support over MPLS / 3.5.1：
Traffic Engineering Extensions for DiffServ / 3.5.2：
Signalling / Ilaria Marchetti ; Antonio Pietrabissa ; Massimiliano Rossi ; Fernando Boavida ; Luis Cordeiro ; Edmundo Monteiro ; Marilia Curado3.6：
Session Initiation Protocol (SIP) / 4.1：
SIP and Its Value Propositions / 4.2.1：
Protocol Components / 4.2.2：
SIP Messages / 4.2.3：
Session Description / 4.2.4：
Establishment of an SIP Session / 4.2.5：
SIP's Extension / 4.2.6：
The Next Steps In Signalling (NSIS) / 4.3：
Background and Main Characteristics / 4.3.1：
Overview of Signalling Scenarios and Protocol Structure / 4.3.2：
The NSIS Layer Transport Protocol / 4.3.3：
Common Open Policy Service (COPS) / 4.4：
COPS Overview / 4.4.1：
Basic Model / 4.4.2：
COPS Protocol / 4.4.3：
COPS Messages / 4.4.4：
Common Operation / 4.4.5：
Using Examples: COPS for RSVP / 4.4.6：
Enhanced Transport Protocols / Nicolas Wambeke ; Ernesto Exposito ; Guillaume Jourjon ; Emmanuel Lochin4.5：
State of the Art of Transport Protocols / 5.1：
TCP and UDP / 5.2.1：
TCP Evolution / 5.2.2：
SCTP / 5.2.3：
DCCP / 5.2.4：
Discussion / 5.2.5：
Transport Mechanisms / 5.3：
Overview / 5.3.1：
Congestion-Control Mechanisms / 5.3.2：
Reliability Mechanisms / 5.3.3：
Enhanced Transport Protocol Mechanisms / 5.3.4：
TFRC and gTFRC, a QoS-Aware Congestion Control / 5.4.1：
Application-Aware Transport Mechanisms / 5.4.2：
The EuQoS System / Michel Diaz ; Jose Enriquez-Gabeiras ; Laurent Baresse ; Wojciech Burakowski ; Maria Angeles Callejo-Rodriguez ; Jorge Carapinha ; Olivier Dugeon ; Mathieu Gineste ; Florin Racaru ; Jaroslaw Sliwinski ; Halina Tarasiuk ; Markus Wulff5.5：
Architecture / 6.1：
Goals and Requirements / 6.2.1：
Functional Blocks and their Main Functions / 6.2.2：
Control Plane Elements: RM and RA / 6.2.3：
Provisioning, Invocation, and Operation, Administration and Management / 6.3：
Provisioning Process / 6.3.1：
Invocation Process / 6.3.2：
Operation, Administration and Management / 6.3.3：
End-to-End Classes of Service in Heterogeneous Networks / 6.4：
End-to-end Classes of Service in EuQoS / 6.4.1：
QoS Mechanisms and Algorithms for Specification of e2e Classes of Service / 6.4.2：
Implementation of e2e Classes of Service in Underlying Technologies / 6.4.3：
EuQoS Enhanced Transport Protocol / 6.5：
Enhanced Transport Protocol Services for EuQoS / 6.5.1：
Services for Streaming/Nonstreaming Applications / 6.5.3：
Multicast / 6.6：
Application Layer Multicast / 6.6.1：
Application Layer Multicast in the EuQoS System / 6.6.2：
Multicast Middleware / 6.6.3：
Introducing QoS to Multicast Middleware / 6.6.4：
Telemedicine Application / 6.7：
Telemedicine-the Case for Application-Driven QoS / 6.7.1：
Overview of Medigraf / 6.7.2：
Medigraf Adaptation to EuQoS / 6.7.3：
Summary and Outlook / 6.8：
Implementing Protocols on Network Simulators / Jana KrahenbuhlAppendix A：
Main Simulation Terms and Concepts / A.1：
Simulation Process / A.1.1：
Simulation Types / A.1.2：
Network Simulation / A.2：
Parallel/Distributed versus Serial Execution of Simulations / A.2.1：
Packet-Level, Fluid-Based and Hybrid Model Simulation / A.2.2：
Simulation Speedup / A.2.3：
Network Simulation in Research / A.2.4：
Simulation for Education Purposes / A.2.5：
Network Simulators / A.3：
GloMoSim and Qualnet / A.3.1：
JiST/SWANS / A.3.2：
Scalable Simulation Framework (SSF) and SSFNet / A.3.3：
OMNeT++ and OMNEST / A.3.4：
The Network Simulator ns-2 / A.4：
The Language Concept / A.4.1：
Hierarchical Structure / A.4.2：
First Steps-Simulation Script Template / A.4.3：
Nodes, Links and Traffic / A.4.4：
Wireless Networks / A.4.5：
Implementing Protocols with ns-2 / A.4.6：
Advice for Running ns-2 Simulations / A.4.7：
Analysing Methods / A.4.8：
Network Emulation Focusing on QoS-Oriented Satellite Communication / Laurent Dairaine ; Herve ThalmensyAppendix B：
Network Emulation Basics / B.1：
Introduction to Network Emulation / B.1.1：
What is Network Emulation? / B.1.2：
Why Use Network Emulation? / B.1.3：
Requirements for Emulation Systems / B.1.4：
Network Emulation System Approaches / B.1.5：
Case Study: Emulation of QoS-oriented Satellite Communication / B.2：
DVB Satellite Communications / B.2.1：
QoS Support for Satellite Network Systems / B.2.3：
Emulation of a DVB-S, DVB-RCS Satellite System / B.2.4：
References / B.3：
Index
Preface
Acknowledgements
Acronyms
26.

電子ブック
ＥＢ
26. Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
A. Monnis, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , ACM, 1989
所蔵情報: loading…
27.

電子ブック
ＥＢ
27. Proceedings of the 2nd International Workshop on Web 2.0 for Software Engineering
Christoph Treude, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , New York, NY : ACM, 2011
所蔵情報: loading…
28.

電子ブック
ＥＢ
28. Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 2 - Volume 2
Michael Luck, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , International Foundation for Autonomous Agents and Multiagent Systems, 2010
所蔵情報: loading…
29.

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

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

電子ブック
ＥＢ
31. Guide to HTML, JavaScript and PHP
David R. Brooks
出版情報: Springer eBooks Computer Science , Springer London, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introducing HTML and JavaScript / 1：
Introducing the Tools / 1.1：
What Is an HTML Document? / 1.1.1：
What Is JavaScript? / 1.1.2：
How Do You Create HTML/JavaScript Documents? / 1.1.3：
Some Typographic Conventions Used in This Book / 1.1.4：
Where Can You Find More Information About HTML and JavaScript? / 1.1.5：
Your First HTML/JavaScript Documents / 1.2：
Accessing HTML Documents on the Web / 1.3：
Another Example / 1.4：
HTML Document Basics / 2：
Documents, Elements, Attributes, and Values / 2.1：
Essential Elements / 2.1.1：
Some Other Important Elements / 2.1.2：
HTML Syntax and Style / 2.2：
Using the script Element / 2.3：
Creating and Organizing a Web Site / 2.4：
Selecting and Using Colors / 2.5：
Using Cascading Style Sheets / 2.6：
HTML Tables, Forms, Lists, and Frames / 2.7：
The table Element / 3.1：
Basic Table Formatting / 3.1.1：
Subdividing Tables into Sections / 3.1.2：
Merging Cells Across Rows and Columns / 3.1.3：
The form and input Elements / 3.2：
Creating Pull-Down Lists / 3.3：
Combining Tables and Forms / 3.4：
E-Mailing the Contents of Forms / 3.5：
The List Elements / 3.6：
Using HTML Frames / 3.7：
More Examples / 3.8：
Selecting Cloud Types from a List of Possibilities / 3.8.1：
A Simple "Split Window" Application / 3.8.2：
Fundamentals of the JavaScript Language / 4：
Capabilities of JavaScript / 4.1：
Some Essential Terminology / 4.2：
Structure of JavaScript Code / 4.3：
JavaScript Statements / 4.3.1：
Statement Blocks / 4.3.2：
Comments / 4.3.3：
Data and Objects / 4.4：
Data Declarations and Variables / 4.4.1：
Data Types / 4.4.2：
Literals / 4.4.3：
Case Sensitivity / 4.4.4：
Objects and Methods for Input and Output / 4.4.5：
String Methods / 4.4.6：
Tokens, Operators, Expressions, and Statements / 4.5：
Tokens / 4.5.1：
Arithmetic Operators / 4.5.2：
The Assignment Operator / 4.5.3：
Shorthand Arithmetic/Assignment Operators / 4.5.4：
The JavaScript Math Object / 4.6：
Comparison Operators and Decision-Making Structures / 4.7：
Relational and Logical Operators / 4.7.1：
The if Construct (Branching Structures) / 4.7.2：
The switch Construct / 4.7.3：
Loop Structures / 4.8：
Count-Controlled Loops / 4.8.1：
Conditional Loops / 4.8.2：
Using JavaScript to Change Values in Form Fields / 4.9：
Solving the Quadratic Equation / 4.10：
Rectangular Rule Numerical Integration / 4.10.2：
Using Arrays in HTML/JavaScript / 5：
Basic Array Properties / 5.1：
Some Operations on Arrays / 5.2：
Manipulating Stacks and Queues / 5.2.1：
More about Array Methods / 5.2.2：
Creating Two-Dimensional Arrays / 5.4：
Using Arrays to Access the Contents of Forms / 5.5：
Accessing values of type="text" Fields / 5.5.1：
Accessing type="radio" and type="checkbox" Fields / 5.5.2：
Accessing Multiple Options Chosen in
Hiding the Contents of a JavaScript Script / 5.6：
Checking IDs and Passwords / 5.7：
Magic Squares / 5.7.2：
JavaScript Functions / 6：
The Purpose of Functions in Programming / 6.1：
Defining JavaScript Functions / 6.2：
Using JavaScript Functions With HTML Forms / 6.3：
Passing Numerical Values to a Function / 6.3.1：
Using Entire Forms as Input / 6.3.2：
Using Arrays to Return Output Values / 6.3.3：
Some Global Methods and Event Handlers / 6.4：
Global Methods / 6.4.1：
Using Event Handlers with Forms and Functions / 6.4.2：
Recursive Functions / 6.5：
Passing Values from One Document to Another / 6.6：
Revisiting the JavaScript sort () Methods / 6.7：
Dewpoint Temperature / 6.8：
Loan Repayment Schedule / 6.8.2：
Legendre Polynomials / 6.8.3：
Array-Derived Pull-Down Menus / 6.8.4：
Creating a "Password-Protected" HTML Document / 6.8.5：
Creating a Server-Side Environment with PHP / 7：
Getting Started with PHP / 7.1：
Preventing Multiple Submissions from a Form / 7.2：
Working with PHP / 8：
Structure of PHP Scripts / 8.1：
Calculations with PHP
More About PHP File Input/Output / 8.3：
Calculating Volumes of Solid Objects / 8.4：
Processing .bmp Image Files / 8.4.2：
Transforming and Displaying Images / 8.4.3：
Self-Contained HTML/JavaScript/PHP Documents / 8.4.4：
PHP Arrays / 9：
Array Definition / 9.1：
Array Sorting / 9.2：
Stacks, Queues, and Line Crashers / 9.3：
The Quadratic Formula Revisited / 9.4：
Reading checkbox Values / 9.4.2：
Building a Histogram Array / 9.4.3：
Shuffle a Card Deck / 9.4.4：
Manage a Data File / 9.4.5：
Recursive insertion Sort / 9.4.6：
Summary of Selected PHP Language Elements / 10：
Data Types and Operators / 10.1：
Operators / 10.1.1：
Conditional Execution / 10.2：
Case-Controlled Conditional Execution / 10.2.1：
Loops / 10.3：
Condition-Controlled Loops / 10.3.1：
Functions and Language Constructs / 10.4：
File Handling and I/O Functions / 10.4.1：
String Handling Functions / 10.4.2：
Math Constants and Functions / 10.4.3：
Array Functions and Language Constructs / 10.4.4：
Miscellaneous Functions and Constructs / 10.4.5：
Using PHP from a Command Line / 11：
Using Graphics with PHP / 12：
Introduction / 12.1：
Writing GD Graphics Applications for Displaying Data / 12.2：
Getting Started / 12.2.1：
Pie Charts / 12.2.2：
Horizontal Bar Charts / 12.2.3：
Vertical Bar Charts / 12.2.4：
Line Graphs / 12.2.5：
Summary of Some GD Graphics Functions / 12.3：
Create and Destroy Images / 12.3.1：
Draw Lines and Shapes / 12.3.2：
Display Text / 12.3.3：
Appendices
List of Document Examples / A.l：
Displaying Special Characters in an HTML Document / A.2：
ASCII Character Codes / A.3：
Strategies for Solving Computational Problems / A.4：
Exercises
Glossary
Index
Output Examples in Color
Introducing HTML and JavaScript / 1：
Introducing the Tools / 1.1：
What Is an HTML Document? / 1.1.1：
32.

電子ブック
ＥＢ
32. Guide to HTML, JavaScript and PHP
David R. Brooks
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2011
所蔵情報: loading…
目次情報: 続きを見る
Introducing HTML and JavaScript / 1：
Introducing the Tools / 1.1：
What Is an HTML Document? / 1.1.1：
What Is JavaScript? / 1.1.2：
How Do You Create HTML/JavaScript Documents? / 1.1.3：
Some Typographic Conventions Used in This Book / 1.1.4：
Where Can You Find More Information About HTML and JavaScript? / 1.1.5：
Your First HTML/JavaScript Documents / 1.2：
Accessing HTML Documents on the Web / 1.3：
Another Example / 1.4：
HTML Document Basics / 2：
Documents, Elements, Attributes, and Values / 2.1：
Essential Elements / 2.1.1：
Some Other Important Elements / 2.1.2：
HTML Syntax and Style / 2.2：
Using the script Element / 2.3：
Creating and Organizing a Web Site / 2.4：
Selecting and Using Colors / 2.5：
Using Cascading Style Sheets / 2.6：
HTML Tables, Forms, Lists, and Frames / 2.7：
The table Element / 3.1：
Basic Table Formatting / 3.1.1：
Subdividing Tables into Sections / 3.1.2：
Merging Cells Across Rows and Columns / 3.1.3：
The form and input Elements / 3.2：
Creating Pull-Down Lists / 3.3：
Combining Tables and Forms / 3.4：
E-Mailing the Contents of Forms / 3.5：
The List Elements / 3.6：
Using HTML Frames / 3.7：
More Examples / 3.8：
Selecting Cloud Types from a List of Possibilities / 3.8.1：
A Simple "Split Window" Application / 3.8.2：
Fundamentals of the JavaScript Language / 4：
Capabilities of JavaScript / 4.1：
Some Essential Terminology / 4.2：
Structure of JavaScript Code / 4.3：
JavaScript Statements / 4.3.1：
Statement Blocks / 4.3.2：
Comments / 4.3.3：
Data and Objects / 4.4：
Data Declarations and Variables / 4.4.1：
Data Types / 4.4.2：
Literals / 4.4.3：
Case Sensitivity / 4.4.4：
Objects and Methods for Input and Output / 4.4.5：
String Methods / 4.4.6：
Tokens, Operators, Expressions, and Statements / 4.5：
Tokens / 4.5.1：
Arithmetic Operators / 4.5.2：
The Assignment Operator / 4.5.3：
Shorthand Arithmetic/Assignment Operators / 4.5.4：
The JavaScript Math Object / 4.6：
Comparison Operators and Decision-Making Structures / 4.7：
Relational and Logical Operators / 4.7.1：
The if Construct (Branching Structures) / 4.7.2：
The switch Construct / 4.7.3：
Loop Structures / 4.8：
Count-Controlled Loops / 4.8.1：
Conditional Loops / 4.8.2：
Using JavaScript to Change Values in Form Fields / 4.9：
Solving the Quadratic Equation / 4.10：
Rectangular Rule Numerical Integration / 4.10.2：
Using Arrays in HTML/JavaScript / 5：
Basic Array Properties / 5.1：
Some Operations on Arrays / 5.2：
Manipulating Stacks and Queues / 5.2.1：
More about Array Methods / 5.2.2：
Creating Two-Dimensional Arrays / 5.4：
Using Arrays to Access the Contents of Forms / 5.5：
Accessing values of type="text" Fields / 5.5.1：
Accessing type="radio" and type="checkbox" Fields / 5.5.2：
Accessing Multiple Options Chosen in
Hiding the Contents of a JavaScript Script / 5.6：
Checking IDs and Passwords / 5.7：
Magic Squares / 5.7.2：
JavaScript Functions / 6：
The Purpose of Functions in Programming / 6.1：
Defining JavaScript Functions / 6.2：
Using JavaScript Functions With HTML Forms / 6.3：
Passing Numerical Values to a Function / 6.3.1：
Using Entire Forms as Input / 6.3.2：
Using Arrays to Return Output Values / 6.3.3：
Some Global Methods and Event Handlers / 6.4：
Global Methods / 6.4.1：
Using Event Handlers with Forms and Functions / 6.4.2：
Recursive Functions / 6.5：
Passing Values from One Document to Another / 6.6：
Revisiting the JavaScript sort () Methods / 6.7：
Dewpoint Temperature / 6.8：
Loan Repayment Schedule / 6.8.2：
Legendre Polynomials / 6.8.3：
Array-Derived Pull-Down Menus / 6.8.4：
Creating a "Password-Protected" HTML Document / 6.8.5：
Creating a Server-Side Environment with PHP / 7：
Getting Started with PHP / 7.1：
Preventing Multiple Submissions from a Form / 7.2：
Working with PHP / 8：
Structure of PHP Scripts / 8.1：
Calculations with PHP
More About PHP File Input/Output / 8.3：
Calculating Volumes of Solid Objects / 8.4：
Processing .bmp Image Files / 8.4.2：
Transforming and Displaying Images / 8.4.3：
Self-Contained HTML/JavaScript/PHP Documents / 8.4.4：
PHP Arrays / 9：
Array Definition / 9.1：
Array Sorting / 9.2：
Stacks, Queues, and Line Crashers / 9.3：
The Quadratic Formula Revisited / 9.4：
Reading checkbox Values / 9.4.2：
Building a Histogram Array / 9.4.3：
Shuffle a Card Deck / 9.4.4：
Manage a Data File / 9.4.5：
Recursive insertion Sort / 9.4.6：
Summary of Selected PHP Language Elements / 10：
Data Types and Operators / 10.1：
Operators / 10.1.1：
Conditional Execution / 10.2：
Case-Controlled Conditional Execution / 10.2.1：
Loops / 10.3：
Condition-Controlled Loops / 10.3.1：
Functions and Language Constructs / 10.4：
File Handling and I/O Functions / 10.4.1：
String Handling Functions / 10.4.2：
Math Constants and Functions / 10.4.3：
Array Functions and Language Constructs / 10.4.4：
Miscellaneous Functions and Constructs / 10.4.5：
Using PHP from a Command Line / 11：
Using Graphics with PHP / 12：
Introduction / 12.1：
Writing GD Graphics Applications for Displaying Data / 12.2：
Getting Started / 12.2.1：
Pie Charts / 12.2.2：
Horizontal Bar Charts / 12.2.3：
Vertical Bar Charts / 12.2.4：
Line Graphs / 12.2.5：
Summary of Some GD Graphics Functions / 12.3：
Create and Destroy Images / 12.3.1：
Draw Lines and Shapes / 12.3.2：
Display Text / 12.3.3：
Appendices
List of Document Examples / A.l：
Displaying Special Characters in an HTML Document / A.2：
ASCII Character Codes / A.3：
Strategies for Solving Computational Problems / A.4：
Exercises
Glossary
Index
Output Examples in Color
Introducing HTML and JavaScript / 1：
Introducing the Tools / 1.1：
What Is an HTML Document? / 1.1.1：
33.

電子ブック
ＥＢ
33. Access to Mobile Services
Xu Yang, Athman Bouguettaya
出版情報: Springer eBooks Computer Science , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Access to Broadcast M-services: Issues and Challenges / 2：
Broadcast based M-services / 2.1：
Efficient Access to M-services and Wireless Data / 2.2：
Example Scenario / 2.3：
Main Contributions of This Book / 2.4：
Traditional Data Access Methods / 3：
Basic Data Access Techniques / 3.1：
Index tree based access methods / 3.1.1：
Signature indexing / 3.1.2：
Hashing / 3.1.3：
Analytical Study / 3.2：
Basic Broadcast-based Wireless Environment / 3.2.1：
Cost model for index tree based access methods / 3.2.2：
Cost model for signature indexing / 3.2.3：
Cost model for hashing / 3.2.4：
Testbed / 3.3：
Practical Study / 3.4：
Simulation Settings / 3.4.1：
Simulation Results / 3.4.2：
Comparison / 3.4.3：
Summary / 3.5：
Adaptive Data Access Methods / 4：
Data Organization / 4.1：
Access Protocol / 4.2：
Cost Model / 4.3：
Derivation for Access and Tuning Times / 4.3.1：
Optimum Number of Partitions / 4.3.2：
Access and Tuning Times vs. the Number of Partitions / 4.4：
Comparisons for Access and Tuning Times / 4.4.2：
Average Time Overhead Comparison / 4.4.3：
Efficient Access to Simple M-services Using Traditional Methods / 4.4.4：
Access Methods / 5.1：
Index tree based methods / 5.1.1：
Signature Indexing / 5.1.2：
Analytical Model / 5.1.3：
Accessing M-service channel / 5.2.1：
Accessing data channel / 5.2.2：
Performance measurement of accessing fixed-size mobile services channel / 5.3：
Performance measurement of accessing varied-size mobile services channel / 5.3.2：
Performance measurement of accessing data channel / 5.3.3：
Semantic Access to Composite M-services / 5.3.4：
Broadcast-based M-services Infrastructure / 6.1：
System Roles / 6.1.1：
Interaction Model / 6.1.2：
Broadcast Content / 6.1.3：
Access M-services and Wireless Data / 6.1.4：
Semantics for M-services Systems / 6.2：
Access Action Tree / 6.2.2：
Traversing Algorithms / 6.2.3：
Multi-channel Access Method / 6.2.4：
Broadcast Channel Organization / 7：
Flat Broadcast / 7.1：
Selective Tuning / 7.2：
Indexed Broadcast / 7.3：
Predefined Index / 7.3.1：
Index Channel / 7.3.2：
Interleaved Index / 7.3.3：
Implementation and Practical Study / 7.3.4：
Implementation / 8.1：
Broadcast Server / 8.1.1：
Mobile Client / 8.1.2：
Experiments / 8.2：
Comparison of Analytical and Simulation Results / 8.2.1：
Comparison of Different Traversing Algorithms / 8.2.2：
Impact of Client Semantics / 8.2.3：
Open Problems / 8.2.4：
Complex Composite Services / 9.1：
Access Patterns / 9.2：
Service Composition Patterns / 9.3：
Automatic Service Composition / 9.4：
References
Index
Introduction / 1：
Access to Broadcast M-services: Issues and Challenges / 2：
Broadcast based M-services / 2.1：
34.

電子ブック
ＥＢ
34. Access to Mobile Services
Xu Yang, Athman Bouguettaya
出版情報: SpringerLink Books - AutoHoldings , Springer US, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Access to Broadcast M-services: Issues and Challenges / 2：
Broadcast based M-services / 2.1：
Efficient Access to M-services and Wireless Data / 2.2：
Example Scenario / 2.3：
Main Contributions of This Book / 2.4：
Traditional Data Access Methods / 3：
Basic Data Access Techniques / 3.1：
Index tree based access methods / 3.1.1：
Signature indexing / 3.1.2：
Hashing / 3.1.3：
Analytical Study / 3.2：
Basic Broadcast-based Wireless Environment / 3.2.1：
Cost model for index tree based access methods / 3.2.2：
Cost model for signature indexing / 3.2.3：
Cost model for hashing / 3.2.4：
Testbed / 3.3：
Practical Study / 3.4：
Simulation Settings / 3.4.1：
Simulation Results / 3.4.2：
Comparison / 3.4.3：
Summary / 3.5：
Adaptive Data Access Methods / 4：
Data Organization / 4.1：
Access Protocol / 4.2：
Cost Model / 4.3：
Derivation for Access and Tuning Times / 4.3.1：
Optimum Number of Partitions / 4.3.2：
Access and Tuning Times vs. the Number of Partitions / 4.4：
Comparisons for Access and Tuning Times / 4.4.2：
Average Time Overhead Comparison / 4.4.3：
Efficient Access to Simple M-services Using Traditional Methods / 4.4.4：
Access Methods / 5.1：
Index tree based methods / 5.1.1：
Signature Indexing / 5.1.2：
Analytical Model / 5.1.3：
Accessing M-service channel / 5.2.1：
Accessing data channel / 5.2.2：
Performance measurement of accessing fixed-size mobile services channel / 5.3：
Performance measurement of accessing varied-size mobile services channel / 5.3.2：
Performance measurement of accessing data channel / 5.3.3：
Semantic Access to Composite M-services / 5.3.4：
Broadcast-based M-services Infrastructure / 6.1：
System Roles / 6.1.1：
Interaction Model / 6.1.2：
Broadcast Content / 6.1.3：
Access M-services and Wireless Data / 6.1.4：
Semantics for M-services Systems / 6.2：
Access Action Tree / 6.2.2：
Traversing Algorithms / 6.2.3：
Multi-channel Access Method / 6.2.4：
Broadcast Channel Organization / 7：
Flat Broadcast / 7.1：
Selective Tuning / 7.2：
Indexed Broadcast / 7.3：
Predefined Index / 7.3.1：
Index Channel / 7.3.2：
Interleaved Index / 7.3.3：
Implementation and Practical Study / 7.3.4：
Implementation / 8.1：
Broadcast Server / 8.1.1：
Mobile Client / 8.1.2：
Experiments / 8.2：
Comparison of Analytical and Simulation Results / 8.2.1：
Comparison of Different Traversing Algorithms / 8.2.2：
Impact of Client Semantics / 8.2.3：
Open Problems / 8.2.4：
Complex Composite Services / 9.1：
Access Patterns / 9.2：
Service Composition Patterns / 9.3：
Automatic Service Composition / 9.4：
References
Index
Introduction / 1：
Access to Broadcast M-services: Issues and Challenges / 2：
Broadcast based M-services / 2.1：
35.

電子ブック
ＥＢ
35. Problem Solving for Wireless Sensor Networks . Garc?a-Hernando, Ana-Bel?n Garc?a-Hernando, Juan-Manuel L?pez-Navarro, Jos?-Fern?n . Mart?nez-Ortega, Aggeliki . Prayati, Luis Redondo-L?pez
Luis Redondo-L?pez, Ana-Bel?n
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Executive Summary / 1.1：
Structure of the Book / 1.2：
References
Radio-Frequency Technologies for WSNs / 2：
Bluetooth Technology (IEEE 802.15.1) / 2.1：
Wi-Fi Technology (IEEE 802.11.a/b/h/g) / 2.2：
UWB Technology (IEEE 802.15.3) / 2.3：
Wavenis Technology (EN300-220 and FCC15.247-Coronis Systems) / 2.4：
Wavenis' Main Characteristics / 2.4.1：
Wavenis' RF ASIC Solution / 2.4.2：
Wibree Technology (Nokia) / 2.5：
ZigBee Technology / 2.6：
ZigBee's Main Characteristics / 2.6.1：
ZigBee Networks / 2.6.2：
Zigbee Applications / 2.6.3：
ZigBee Promoters and Participants / 2.6.4：
ZigBee System-on-Chip (SoC) / 2.6.5：
Radio-Frequency Integrated Circuit Manufacturers / 2.6.6：
Hardware Platforms for WSNs / 3：
AVIDdirector / 3.1：
WMSNP / 3.2：
SmartMesh-XR / 3.3：
JN5121 / 3.4：
MeshScape / 3.5：
SensiNet / 3.6：
EnRoute / 3.7：
Tmote Sky / 3.8：
MICAx / 3.9：
BTnodes / 3.10：
Embedded Sensor Board / 3.11：
Scattergate and Scatternode / 3.12：
[mu]Nodes / 3.13：
Smart Tags / 3.14：
Wavecard, Waveflow, Wavetherm, Wavesense, and Wavefront / 3.15：
The Wavecard and Waveport Platforms / 3.15.1：
The Wavesense, Wavetherm, and Waveflow Platforms / 3.15.2：
The Wavefront Platform / 3.15.3：
eyesIFX / 3.16：
WSN Platforms' Comparative / 3.17：
Open Issues in Hardware Platforms for WSNs / 3.18：
Software Technologies in WSNs / 4：
Middleware Architectures for WSNs / 4.1：
Characteristics of WSN Middleware / 4.1.1：
Various Middleware WSN Approaches / 4.1.2：
Agent Technologies for WSN / 4.2：
Agent Technology and Models / 4.2.1：
Use of Agent Models in WSNs / 4.2.2：
Specific Proposals Applicable to WSNs / 4.2.3：
Design Strategies and Operation of WSN Software / 4.3：
Software Design Strategy in WSNs / 4.3.1：
Software Architecture in WSN / 4.3.2：
WSN Simulation Platforms / 4.4：
Importance and Challenges of WSN Simulators / 4.4.1：
Review of WSN Simulators / 4.4.2：
Conclusions on the Use of WSN Simulators for Research / 4.4.3：
Open Issues in Software Technologies / 4.5：
Software Design and Development for WSNs / 4.5.1：
Low-Level Detail Abstraction / 4.5.2：
Software Deployment and Operation in WSNs / 4.5.3：
Quality of Service (QoS) / 4.5.4：
Application Software / 4.5.5：
The Most Important Innovations Considering the Application Scenarios / 4.5.6：
Network Aspects and Deployment in WSNs / 5：
WSN Topologies and Deployment Methodologies / 5.1：
Self-Organization / 5.1.1：
Communication Protocol Architectures / 5.2：
Physical Layer / 5.2.1：
Data Link Layer / 5.2.2：
Network Layer / 5.2.3：
Transport Layer / 5.2.4：
Application Layer / 5.2.5：
Routing in WSN / 5.3：
Need for New Routing Protocols / 5.3.1：
Routing Techniques and Protocols in WSNs / 5.3.2：
WSN Performance: Quality of Service / 5.4：
An Increasing Interest in QoS for WSNs / 5.4.1：
Quality of Service in the WSN Context / 5.4.2：
QoS MAC Protocols / 5.4.3：
QoS Network Protocols / 5.4.4：
Open Issues in Network and Deployment Technologies / 5.5：
Standards and Safety Regulations for WSNs / 6：
Introduction to the Regulatory Aspects of WSNs / 6.1：
Electromagnetic Compatibility / 6.2：
Biological Effects of Radiation / 6.3：
Environmental Impact / 6.4：
Data Security and Privacy / 6.5：
European Research Projects Related to WSNs / 7：
UbiSec&Sens / 7.1：
CoBIs / 7.2：
WINNER / 7.3：
AWARE / 7.4：
Sensation / 7.5：
e-SENSE / 7.6：
WASP / 7.7：
MIMOSA / 7.8：
E2R / 7.9：
CRUISE / 7.10：
RUNES / 7.11：
Smart Messages / 7.12：
EYES / 7.13：
Embedded WiSeNts / 7.14：
[mu]SWn / 7.15：
WSN Application Scenarios / 8：
Application Fields for WSNs / 8.1：
Environmental Monitoring / 8.1.1：
Health Care / 8.1.2：
Security Domain / 8.1.3：
Additional Domains / 8.1.4：
The Three Most Prevailing WSN Application Scenarios / 8.2：
Multiple-Target Tracking / 8.2.1：
Surveillance / 8.2.2：
Vital Sign and Environmental Parameters / 8.2.3：
Technical Requirements / 8.2.4：
Index
Introduction / 1：
Executive Summary / 1.1：
Structure of the Book / 1.2：
36.

電子ブック
ＥＢ
36. Problem Solving for Wireless Sensor Networks . García-Hernando, Ana-Belén García-Hernando, Juan-Manuel López-Navarro, José-Fernán . Martínez-Ortega, Aggeliki . Prayati, Luis Redondo-López
Luis Redondo-López, Ana-Belén
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
Executive Summary / 1.1：
Structure of the Book / 1.2：
References
Radio-Frequency Technologies for WSNs / 2：
Bluetooth Technology (IEEE 802.15.1) / 2.1：
Wi-Fi Technology (IEEE 802.11.a/b/h/g) / 2.2：
UWB Technology (IEEE 802.15.3) / 2.3：
Wavenis Technology (EN300-220 and FCC15.247-Coronis Systems) / 2.4：
Wavenis' Main Characteristics / 2.4.1：
Wavenis' RF ASIC Solution / 2.4.2：
Wibree Technology (Nokia) / 2.5：
ZigBee Technology / 2.6：
ZigBee's Main Characteristics / 2.6.1：
ZigBee Networks / 2.6.2：
Zigbee Applications / 2.6.3：
ZigBee Promoters and Participants / 2.6.4：
ZigBee System-on-Chip (SoC) / 2.6.5：
Radio-Frequency Integrated Circuit Manufacturers / 2.6.6：
Hardware Platforms for WSNs / 3：
AVIDdirector / 3.1：
WMSNP / 3.2：
SmartMesh-XR / 3.3：
JN5121 / 3.4：
MeshScape / 3.5：
SensiNet / 3.6：
EnRoute / 3.7：
Tmote Sky / 3.8：
MICAx / 3.9：
BTnodes / 3.10：
Embedded Sensor Board / 3.11：
Scattergate and Scatternode / 3.12：
[mu]Nodes / 3.13：
Smart Tags / 3.14：
Wavecard, Waveflow, Wavetherm, Wavesense, and Wavefront / 3.15：
The Wavecard and Waveport Platforms / 3.15.1：
The Wavesense, Wavetherm, and Waveflow Platforms / 3.15.2：
The Wavefront Platform / 3.15.3：
eyesIFX / 3.16：
WSN Platforms' Comparative / 3.17：
Open Issues in Hardware Platforms for WSNs / 3.18：
Software Technologies in WSNs / 4：
Middleware Architectures for WSNs / 4.1：
Characteristics of WSN Middleware / 4.1.1：
Various Middleware WSN Approaches / 4.1.2：
Agent Technologies for WSN / 4.2：
Agent Technology and Models / 4.2.1：
Use of Agent Models in WSNs / 4.2.2：
Specific Proposals Applicable to WSNs / 4.2.3：
Design Strategies and Operation of WSN Software / 4.3：
Software Design Strategy in WSNs / 4.3.1：
Software Architecture in WSN / 4.3.2：
WSN Simulation Platforms / 4.4：
Importance and Challenges of WSN Simulators / 4.4.1：
Review of WSN Simulators / 4.4.2：
Conclusions on the Use of WSN Simulators for Research / 4.4.3：
Open Issues in Software Technologies / 4.5：
Software Design and Development for WSNs / 4.5.1：
Low-Level Detail Abstraction / 4.5.2：
Software Deployment and Operation in WSNs / 4.5.3：
Quality of Service (QoS) / 4.5.4：
Application Software / 4.5.5：
The Most Important Innovations Considering the Application Scenarios / 4.5.6：
Network Aspects and Deployment in WSNs / 5：
WSN Topologies and Deployment Methodologies / 5.1：
Self-Organization / 5.1.1：
Communication Protocol Architectures / 5.2：
Physical Layer / 5.2.1：
Data Link Layer / 5.2.2：
Network Layer / 5.2.3：
Transport Layer / 5.2.4：
Application Layer / 5.2.5：
Routing in WSN / 5.3：
Need for New Routing Protocols / 5.3.1：
Routing Techniques and Protocols in WSNs / 5.3.2：
WSN Performance: Quality of Service / 5.4：
An Increasing Interest in QoS for WSNs / 5.4.1：
Quality of Service in the WSN Context / 5.4.2：
QoS MAC Protocols / 5.4.3：
QoS Network Protocols / 5.4.4：
Open Issues in Network and Deployment Technologies / 5.5：
Standards and Safety Regulations for WSNs / 6：
Introduction to the Regulatory Aspects of WSNs / 6.1：
Electromagnetic Compatibility / 6.2：
Biological Effects of Radiation / 6.3：
Environmental Impact / 6.4：
Data Security and Privacy / 6.5：
European Research Projects Related to WSNs / 7：
UbiSec&Sens / 7.1：
CoBIs / 7.2：
WINNER / 7.3：
AWARE / 7.4：
Sensation / 7.5：
e-SENSE / 7.6：
WASP / 7.7：
MIMOSA / 7.8：
E2R / 7.9：
CRUISE / 7.10：
RUNES / 7.11：
Smart Messages / 7.12：
EYES / 7.13：
Embedded WiSeNts / 7.14：
[mu]SWn / 7.15：
WSN Application Scenarios / 8：
Application Fields for WSNs / 8.1：
Environmental Monitoring / 8.1.1：
Health Care / 8.1.2：
Security Domain / 8.1.3：
Additional Domains / 8.1.4：
The Three Most Prevailing WSN Application Scenarios / 8.2：
Multiple-Target Tracking / 8.2.1：
Surveillance / 8.2.2：
Vital Sign and Environmental Parameters / 8.2.3：
Technical Requirements / 8.2.4：
Index
Introduction / 1：
Executive Summary / 1.1：
Structure of the Book / 1.2：
37.

電子ブック
ＥＢ
37. Intelligent Document Retrieval
Udo Kruschwitz
出版情報: Springer eBooks Computer Science , Springer Netherlands, 2005
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
List of Figures
List of Tables
Introduction / 1：
Introductory Examples / 1.1：
Using Markup to Extract Knowledge / 1.2：
Applying the Extracted knowledge / 1.3：
Structure of the Book / 1.4：
The Model / Part I：
Related Work / 2：
Information Retrieval / 2.1：
Information Extraction / 2.2：
Clustering / 2.3：
Classification / 2.4：
Web Search Techniques / 2.5：
Ontologies / 2.6：
Layout Analysis / 2.7：
Web Search Studies / 2.8：
Navigating Concept Hierarchies / 2.9：
Dialogue Systems / 2.10：
Usability Issues / 2.11：
Concluding Remarks on Related Work / 2.12：
Data Analysis and Domain Model Construction / 3：
Documents / 3.1：
Concepts / 3.2：
A Domain Model Based on Concepts / 3.3：
Model Structure / 3.4：
Model Construction / 3.5：
Using the Model for Query Modification / 3.6：
Implementational Issues / 3.7：
Incorporating Additional Knowledge / 4：
Internal Knowledge / 4.1：
External Knowledge / 4.2：
A Dialogue System for Partially Structured Data / 5：
Dialogue as Movement in Space / 5.1：
Dialogue Example / 5.2：
Static vs. Dynamic Clusters / 5.3：
Real User Queries / 5.4：
Properties / 5.5：
Document Properties / 5.5.1：
System Properties / 5.5.2：
Goal Description / 5.5.3：
Dialogue / 5.6：
High Level Dialogue States / 5.6.1：
Low Level Dialogue States / 5.6.2：
Constructing Potential Choices / 5.6.3：
Dialogue Strategies / 5.6.4：
Customization / 5.6.5：
Practical Applications / Part II：
UKSearch - Intelligent Web Search / 6：
Indexing Web Pages / 6.1：
The UKSearch System / 6.2：
Indexing and Model Construction / 6.2.1：
Dialogue Strategy / 6.2.2：
Sample Domain 1: Essex University / 6.3：
Index Tables / 6.3.1：
Domain Model / 6.3.2：
Concepts it vs. Real User Queries / 6.3.3：
Sample Domain 2: BBC News / 6.4：
Adjusted Dialogue Strategy / 6.4.1：
UKSearch - Evaluation and Discussion / 6.5：
Log Analysis / 7.1：
System Setup / 7.1.1：
Results / 7.1.2：
Discussion / 7.1.3：
Investigating Domain Model Relations / 7.2：
Task and Setup / 7.2.1：
Task-Based Evaluation: Essex University / 7.2.2：
Search Tasks / 7.3.1：
Experimental Setup / 7.3.2：
Procedure / 7.3.3：
Task-Based Evaluation: BBC News / 7.3.4：
Experimental Setup and Procedure / 7.4.1：
YPA - Searching Classified Directories / 7.4.3：
System Overview / 8.1：
Indexing Classified Advertisements / 8.2：
Structure of the Backend / 8.2.1：
Domain Model Construction / 8.2.2：
Dialogue Strategy in the YPA / 8.3：
Dialogue Setup / 8.3.1：
Dialogue Function / 8.3.3：
Calculation of Potential Choices / 8.3.4：
Future Directions and Conclusions / 8.4：
Towards Evolving Domain Models / 9.1：
Dialogue Management / 9.2：
An Outlook on Future Evaluations / 9.3：
Conclusions / 9.4：
References
Index
Foreword
Preface
List of Figures
38.

電子ブック
ＥＢ
38. Intelligent Document Retrieval
Udo Kruschwitz
出版情報: SpringerLink Books - AutoHoldings , Springer Netherlands, 2005
所蔵情報: loading…
目次情報: 続きを見る
Foreword
Preface
List of Figures
List of Tables
Introduction / 1：
Introductory Examples / 1.1：
Using Markup to Extract Knowledge / 1.2：
Applying the Extracted knowledge / 1.3：
Structure of the Book / 1.4：
The Model / Part I：
Related Work / 2：
Information Retrieval / 2.1：
Information Extraction / 2.2：
Clustering / 2.3：
Classification / 2.4：
Web Search Techniques / 2.5：
Ontologies / 2.6：
Layout Analysis / 2.7：
Web Search Studies / 2.8：
Navigating Concept Hierarchies / 2.9：
Dialogue Systems / 2.10：
Usability Issues / 2.11：
Concluding Remarks on Related Work / 2.12：
Data Analysis and Domain Model Construction / 3：
Documents / 3.1：
Concepts / 3.2：
A Domain Model Based on Concepts / 3.3：
Model Structure / 3.4：
Model Construction / 3.5：
Using the Model for Query Modification / 3.6：
Implementational Issues / 3.7：
Incorporating Additional Knowledge / 4：
Internal Knowledge / 4.1：
External Knowledge / 4.2：
A Dialogue System for Partially Structured Data / 5：
Dialogue as Movement in Space / 5.1：
Dialogue Example / 5.2：
Static vs. Dynamic Clusters / 5.3：
Real User Queries / 5.4：
Properties / 5.5：
Document Properties / 5.5.1：
System Properties / 5.5.2：
Goal Description / 5.5.3：
Dialogue / 5.6：
High Level Dialogue States / 5.6.1：
Low Level Dialogue States / 5.6.2：
Constructing Potential Choices / 5.6.3：
Dialogue Strategies / 5.6.4：
Customization / 5.6.5：
Practical Applications / Part II：
UKSearch - Intelligent Web Search / 6：
Indexing Web Pages / 6.1：
The UKSearch System / 6.2：
Indexing and Model Construction / 6.2.1：
Dialogue Strategy / 6.2.2：
Sample Domain 1: Essex University / 6.3：
Index Tables / 6.3.1：
Domain Model / 6.3.2：
Concepts it vs. Real User Queries / 6.3.3：
Sample Domain 2: BBC News / 6.4：
Adjusted Dialogue Strategy / 6.4.1：
UKSearch - Evaluation and Discussion / 6.5：
Log Analysis / 7.1：
System Setup / 7.1.1：
Results / 7.1.2：
Discussion / 7.1.3：
Investigating Domain Model Relations / 7.2：
Task and Setup / 7.2.1：
Task-Based Evaluation: Essex University / 7.2.2：
Search Tasks / 7.3.1：
Experimental Setup / 7.3.2：
Procedure / 7.3.3：
Task-Based Evaluation: BBC News / 7.3.4：
Experimental Setup and Procedure / 7.4.1：
YPA - Searching Classified Directories / 7.4.3：
System Overview / 8.1：
Indexing Classified Advertisements / 8.2：
Structure of the Backend / 8.2.1：
Domain Model Construction / 8.2.2：
Dialogue Strategy in the YPA / 8.3：
Dialogue Setup / 8.3.1：
Dialogue Function / 8.3.3：
Calculation of Potential Choices / 8.3.4：
Future Directions and Conclusions / 8.4：
Towards Evolving Domain Models / 9.1：
Dialogue Management / 9.2：
An Outlook on Future Evaluations / 9.3：
Conclusions / 9.4：
References
Index
Foreword
Preface
List of Figures
39.

電子ブック
ＥＢ
39. Thesis Projects
Mikael Berndtsson, J?rgen Hansson, J?rgen Hansson, Bj?rn Lundell, Bj?rn Olsson, J?��rgen Hansson, Bj?��rn Lundell, Bj?��rn Olsson
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Concepts / Part I：
Introduction / 1：
Motivation and Purpose of the Book / 1.1：
Purposes of Thesis Projects / 1.2：
Actors in the Project / 1.3：
Process / 1.4：
Assessment Criteria / 1.5：
Reading Guidelines / 1.6：
Computer Science and Information Systems Research Projects / 2：
The Landscape of CS and IS / 2.1：
What is Research? / 2.2：
Research Methods / 2.3：
Linkage Between Research and Thesis Projects / 2.4：
Actors Involved, their Roles and Relationships / 3：
The Student / 3.1：
The Responsibilities of the Student / 3.1.1：
Projects with Multiple Students / 3.1.2：
The Supervisor / 3.2：
The Responsibilities of a Supervisor / 3.2.1：
Projects with Multiple Supervisors / 3.2.2：
The Examiner / 3.3：
The Examiner as Quality Evaluator / 3.3.1：
The Examiner as Quality Assuror / 3.3.2：
The Responsibilities of an Examiner / 3.3.3：
The Process - An Overview / Part II：
Developing your Project Proposal / 5：
Choosing a Subject Area / 5.1：
Start Early / 5.1.1：
How to Choose a Subject Area / 5.1.2：
Choose Problem to Focus on Within the Subject Area / 5.2：
Descriptive Projects / 5.2.1：
Theory Oriented Projects / 5.2.2：
Applied Projects / 5.2.3：
A Comparison of Theory and Practice / 5.2.4：
Assure Quality of Initial Ideas / 5.3：
Write and Submit a Project Proposal / 5.4：
Structure / 5.4.1：
Project Proposal Checklist / 5.4.2：
Quality Control of Project Proposal / 5.5：
Matching Supervisors and Students / 5.6：
References and Citations / 6：
Appropriate References / 6.1：
Citations / 6.2：
Improve your Learning (and Grade) / 6.3：
Developing your Aim / 7：
Meetings with Your Supervisor / 7.1：
Time Plan / 7.2：
Activities to Perform While Developing the Aim / 7.3：
Refine the Initial Aim / 7.3.1：
Develop the Arguments Behind the Aim / 7.3.2：
Write the Introduction / 7.3.3：
Developing your Objectives and Choosing Methods / 8：
Important Concepts / 8.1：
Addressing Validity and Reliability / 8.2：
Methods / 8.3：
Literature Analysis / 8.3.1：
Interview / 8.3.2：
Case Study / 8.3.3：
Survey / 8.3.4：
Implementation / 8.3.5：
Experiment / 8.3.6：
Summary / 8.3.7：
An Illustrative Analogy / 8.4：
A Four-Step Process / 8.5：
Develop Objectives / 8.5.1：
Identify Potential Methods / 8.5.2：
Choose Among the Potential Methods / 8.5.3：
Present Details of the Chosen Approach / 8.5.4：
Following the Objectives / 9：
Presenting and Analysing your Data / 10：
Presenting Non-Numerical Data / 10.1：
Presenting Data from a Literature Analysis / 10.1.1：
Presenting Data from Interviews and Questionnaires / 10.1.2：
Presenting Data from Implementations / 10.1.3：
Presenting Numerical Data / 10.2：
Using Tables and Graphs / 10.2.1：
Avoiding Misleading Graphs / 10.2.2：
Significance Tests / 10.2.3：
Analyse Your Data / 10.3：
What is a Good Result? / 10.3.1：
Drawing your Conclusions and Identifying Future Work / 11：
Summarising the Results / 11.1：
Putting the Results into Context / 11.2：
Evaluating the Process / 11.3：
Identifying Future Work / 11.4：
Presenting and Defending your Work Orally / 12：
Oral Presentation / 12.1：
Before the Presentation / 12.1.1：
The Presentation / 12.1.2：
What to Say / 12.1.3：
Handling Questions / 12.1.4：
Preparing for the Defence / 12.1.5：
Acting as Opponent / 12.2：
How to Act as Opponent / 12.2.1：
Preparing for Opposition / 12.2.2：
Prepare the Final Version of your Report / 12.3：
Supplements / Part III：
Information-Seeking and Use / 13：
Information Literacy for Computer Science / 13.1：
Information Searching, Seeking, and Behaviour / 13.2：
Search Techniques / 13.2.1：
A Session with INSPEC / 13.3：
What will you Find? / 13.3.1：
Boolean Commands / 13.3.2：
Information Structure / 13.3.3：
How to Get Hold of Documents / 13.3.4：
The Information Seeking-Process / 13.4：
Two Basic Strategies for Information Seeking / 13.5：
The Concept Map / 13.5.1：
Personal Research Information Management / 13.5.2：
The Report / 14：
Who is the Report for? / 14.1：
Requirements of the Report / 14.3：
Structure of the Report / 14.4：
Title Page / 14.4.1：
Abstract / 14.4.2：
Chapter 1 - Introduction Chapter / 14.4.3：
Chapter 2 - Background / 14.4.4：
Chapter 3 - Problem Description and Statement / 14.4.5：
Chapters 4-6 - The Core of your Report / 14.4.6：
Chapter 7 - Related Work / 14.4.7：
Chapter 8 - Conclusion / 14.4.8：
Style of the Report / 14.5：
Managing References / 14.6：
The List of References / 14.6.1：
Sources / 14.6.2：
Reference Style / 14.6.3：
References to Tables and Figures / 14.6.4：
Examination / 15：
The Examiner's Roles / 15.1：
What to Examine / 15.2：
Bibliography
Appendix
Index
Preface
Acknowledgements
Concepts / Part I：
40.

電子ブック
ＥＢ
40. Thesis Projects
Mikael Berndtsson, Jörgen Hansson, Jörgen Hansson, Björn Lundell, Björn Olsson, Jörgen Hansson, Björn Lundell, Björn Olsson, Bjö Lundell, B. Olsson
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgements
Concepts / Part I：
Introduction / 1：
Motivation and Purpose of the Book / 1.1：
Purposes of Thesis Projects / 1.2：
Actors in the Project / 1.3：
Process / 1.4：
Assessment Criteria / 1.5：
Reading Guidelines / 1.6：
Computer Science and Information Systems Research Projects / 2：
The Landscape of CS and IS / 2.1：
What is Research? / 2.2：
Research Methods / 2.3：
Linkage Between Research and Thesis Projects / 2.4：
Actors Involved, their Roles and Relationships / 3：
The Student / 3.1：
The Responsibilities of the Student / 3.1.1：
Projects with Multiple Students / 3.1.2：
The Supervisor / 3.2：
The Responsibilities of a Supervisor / 3.2.1：
Projects with Multiple Supervisors / 3.2.2：
The Examiner / 3.3：
The Examiner as Quality Evaluator / 3.3.1：
The Examiner as Quality Assuror / 3.3.2：
The Responsibilities of an Examiner / 3.3.3：
The Process - An Overview / Part II：
Developing your Project Proposal / 5：
Choosing a Subject Area / 5.1：
Start Early / 5.1.1：
How to Choose a Subject Area / 5.1.2：
Choose Problem to Focus on Within the Subject Area / 5.2：
Descriptive Projects / 5.2.1：
Theory Oriented Projects / 5.2.2：
Applied Projects / 5.2.3：
A Comparison of Theory and Practice / 5.2.4：
Assure Quality of Initial Ideas / 5.3：
Write and Submit a Project Proposal / 5.4：
Structure / 5.4.1：
Project Proposal Checklist / 5.4.2：
Quality Control of Project Proposal / 5.5：
Matching Supervisors and Students / 5.6：
References and Citations / 6：
Appropriate References / 6.1：
Citations / 6.2：
Improve your Learning (and Grade) / 6.3：
Developing your Aim / 7：
Meetings with Your Supervisor / 7.1：
Time Plan / 7.2：
Activities to Perform While Developing the Aim / 7.3：
Refine the Initial Aim / 7.3.1：
Develop the Arguments Behind the Aim / 7.3.2：
Write the Introduction / 7.3.3：
Developing your Objectives and Choosing Methods / 8：
Important Concepts / 8.1：
Addressing Validity and Reliability / 8.2：
Methods / 8.3：
Literature Analysis / 8.3.1：
Interview / 8.3.2：
Case Study / 8.3.3：
Survey / 8.3.4：
Implementation / 8.3.5：
Experiment / 8.3.6：
Summary / 8.3.7：
An Illustrative Analogy / 8.4：
A Four-Step Process / 8.5：
Develop Objectives / 8.5.1：
Identify Potential Methods / 8.5.2：
Choose Among the Potential Methods / 8.5.3：
Present Details of the Chosen Approach / 8.5.4：
Following the Objectives / 9：
Presenting and Analysing your Data / 10：
Presenting Non-Numerical Data / 10.1：
Presenting Data from a Literature Analysis / 10.1.1：
Presenting Data from Interviews and Questionnaires / 10.1.2：
Presenting Data from Implementations / 10.1.3：
Presenting Numerical Data / 10.2：
Using Tables and Graphs / 10.2.1：
Avoiding Misleading Graphs / 10.2.2：
Significance Tests / 10.2.3：
Analyse Your Data / 10.3：
What is a Good Result? / 10.3.1：
Drawing your Conclusions and Identifying Future Work / 11：
Summarising the Results / 11.1：
Putting the Results into Context / 11.2：
Evaluating the Process / 11.3：
Identifying Future Work / 11.4：
Presenting and Defending your Work Orally / 12：
Oral Presentation / 12.1：
Before the Presentation / 12.1.1：
The Presentation / 12.1.2：
What to Say / 12.1.3：
Handling Questions / 12.1.4：
Preparing for the Defence / 12.1.5：
Acting as Opponent / 12.2：
How to Act as Opponent / 12.2.1：
Preparing for Opposition / 12.2.2：
Prepare the Final Version of your Report / 12.3：
Supplements / Part III：
Information-Seeking and Use / 13：
Information Literacy for Computer Science / 13.1：
Information Searching, Seeking, and Behaviour / 13.2：
Search Techniques / 13.2.1：
A Session with INSPEC / 13.3：
What will you Find? / 13.3.1：
Boolean Commands / 13.3.2：
Information Structure / 13.3.3：
How to Get Hold of Documents / 13.3.4：
The Information Seeking-Process / 13.4：
Two Basic Strategies for Information Seeking / 13.5：
The Concept Map / 13.5.1：
Personal Research Information Management / 13.5.2：
The Report / 14：
Who is the Report for? / 14.1：
Requirements of the Report / 14.3：
Structure of the Report / 14.4：
Title Page / 14.4.1：
Abstract / 14.4.2：
Chapter 1 - Introduction Chapter / 14.4.3：
Chapter 2 - Background / 14.4.4：
Chapter 3 - Problem Description and Statement / 14.4.5：
Chapters 4-6 - The Core of your Report / 14.4.6：
Chapter 7 - Related Work / 14.4.7：
Chapter 8 - Conclusion / 14.4.8：
Style of the Report / 14.5：
Managing References / 14.6：
The List of References / 14.6.1：
Sources / 14.6.2：
Reference Style / 14.6.3：
References to Tables and Figures / 14.6.4：
Examination / 15：
The Examiner's Roles / 15.1：
What to Examine / 15.2：
Bibliography
Appendix
Index
Preface
Acknowledgements
Concepts / Part I：
41.

電子ブック
ＥＢ
41. Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
2nd International Conference on Energy-Efficient Computing and Networking 2011, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , New York, NY : ACM, 2011
所蔵情報: loading…
42.

電子ブック
ＥＢ
42. From P2P to Web Services and Grids
Ian J. Taylor
出版情報: Springer eBooks Computer Science , Springer London, 2005
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Distributed Systems
Peer-2-Peer Systems
Gnutella Scalability Security Freenet Jxta
P2P Deployment Using Jxta
Jini Distributed Object Deployment
Using Jini Grid Computing Web Services
Web Services Deployment OGSA
Introduction to Distributed Systems
Peer-2-Peer Systems
Gnutella Scalability Security Freenet Jxta
43.

電子ブック
ＥＢ
43. From P2P to Web Services and Grids
Ian J. Taylor, Andrew Harrison
出版情報: SpringerLink Books - AutoHoldings , Springer London, 2005
所蔵情報: loading…
目次情報: 続きを見る
Introduction to Distributed Systems
Peer-2-Peer Systems
Gnutella Scalability Security Freenet Jxta
P2P Deployment Using Jxta
Jini Distributed Object Deployment
Using Jini Grid Computing Web Services
Web Services Deployment OGSA
Introduction to Distributed Systems
Peer-2-Peer Systems
Gnutella Scalability Security Freenet Jxta
44.

電子ブック
ＥＢ
44. Self-* and P2P for Network Management
Clarissa Cassales Marquezan, Lisandro Zambenedetti Granville
出版情報: Springer eBooks Computer Science , Springer London, 2012
所蔵情報: loading…
45.

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

電子ブック
ＥＢ
46. Proceedings of the 2nd conference on Visualization '91
Russell Athay, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , IEEE, 1991
所蔵情報: loading…
47.

電子ブック
ＥＢ
47. Proceedings of the 1978 annual conference - Volume 2
Richard H. Austing, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , ACM, 1978
所蔵情報: loading…
48.

電子ブック
ＥＢ
48. Proceedings of the 2nd annual international conference on Systems documentation
John Browne, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , ACM, 1983
所蔵情報: loading…
49.

電子ブック
ＥＢ
49. Proceedings of the 2nd international conference on Supercomputing
J. Lenfant, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , ACM, 1988
所蔵情報: loading…
50.

電子ブック
ＥＢ
50. Proceedings of the 2nd international conference on Pragmatic web
Simon Buckingham Shum, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , ACM, 2007
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼