Distributed Computing and Internet Technology

Name: Distributed Computing and Internet Technology | 7th International Conference, ICDCIT 2011, Bhubaneshwar, India, February 9-12, 2011, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

7th International Conference, ICDCIT 2011, Bhubaneshwar, India, February 9-12, 2011, Proceedings

Raja Natarajan Adegboyega Ojo(Herausgeber*in)

Springer (Verlag)

Erschienen am 2. Februar 2011

XIII, 325 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-19056-8 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title
Preface
Organization
Table of Contents
Invited Talks
An Overview of Membrane Computing
Introduction
The Basic Model
Variants of the Basic Model
Complexity Aspects
Active Membranes
Uniformity and Semi-uniformity
Avoiding Polarizations
Discussion
Extensions, Applications
Comparison with Related Areas
Implementation Efforts
References
Protecting Critical Infrastructures While Preserving Each Organization's Autonomy
Introduction
Problem Statement and Related Work
CII Security Requirements
Related Work
The PolyOrBAC Security Framework
Specifying Local Security Policies with OrBAC
Managing Interactions between Organizations
Expressing and Checking WS Interactions with e-Contracts
Experiment and Lesson Learnt
Conclusion
References
Computations and Interaction
Introduction
Process Theory
Regular Processes
Pushdown and Context-Free Processes
Computable Processes
Conclusion
References
Scribbling Interactions with a Formal Foundation
Introduction
Background: Modelling Interactions through Protocols
Overview of Scribble
Scribble Examples
Formal Foundations of Scribble
Development Framework
General Concepts
Concrete Design
Related Work and Conclusion
References
Open Government in Policy Development: From Collaborative Scenario Texts to Formal Policy Models
From Technology-Driven E-Government to Open Government
Current Deficiencies in Open Government
OCOPOMO: A New Approach to Integrate Open Collaboration in Policy Development
The Project
The Approach in More Detail
Overall Architecture for the ICT Toolbox
Current Status of Related Developments
Concluding Remarks
References
Linear Process Algebra
Background
Chu Spaces as Generalized Linear Algebra
Linear Processes
Processes as Transformable Entities
Linear Process Algebra
The Curry-Howard Correspondence with Boolean Algebra
Example Terms
Laws
Beyond Petri Nets
References
Distributed Computing
Jump-Start Cloud: Efficient Deployment Framework for Large-Scale Cloud Applications
Introduction
Jump-Start Cloud Deployment Overview
Fast Cloud Application Deployment
Fast VM Installation and Differentiation
Cloud Application Deployment
Image Distribution for Application QoS
Pre-deployment
Background Deployment
On-Demand Deployment
Experimental Results
Experimental Data
Conclusions
References
Capacity Estimation in HPC Systems: Simulation Approach
Introduction
Job Load Characterization
Simulation Setup
Simulation Results
Conclusions and Future Work
References
A Multi-Granular Lock Model for Distributed Object Oriented Databases Using Semantics
Introduction
Related Works
Conflicts among Design Time Requests
Conflicts between Runtime Requests and Design Time Requests
Proposed Scheme
Concurrency among Design Time Requests
Concurrency between Design Time Requests and Runtime Requests
Correctness of the Algorithm
Conclusion
References
Contention-Free Many-to-Many Communication Scheduling for High Performance Clusters
Introduction
Our Contribution
System Model
Problem Formulation
Proposed Solution
CSM Module Description
Lower Bound on the Total Migration Time
Algorithm Partial Shuffle Transfer (PST)
Analysis of Algorithm PST
Algorithm Large Data Transfer (LDT)
Analysis of Algorithm LDT
Algorithm Small Data Transfer (SDT)
Analysis of Algorithm SDT
Discussion on Hierarchical Schedule Generation
Conclusion
References
Recursive Competitive Equilibrium Approach for Dynamic Load Balancing a Distributed System
Introduction
Competitive Equilibrium Theory
Recursive Competitive Equilibrium Theory
Proposed Distributed System Model
Competitive Equilibrium Approach for Static Load Balancing
Algorithm CES
Complexity of Algorithm CES
Dynamic Load Balancing
Recursive Competitive Equilibrium Approach for Dynamic Load Balancing
Experimental Results
Nash Equilibrium Scheme (NES)
Effect of System Utilization
Effect of Bias
Effect of Exchange Period
Conclusions
References
Sensor Networks
Smoothed Functional and Quasi-NewtonAlgorithms for Routing in Multi-stage QueueingNetwork with Constraints
Introduction
Routing in Multi-stage Queueing Network - Problem Formulation
Smoothed Functional Algorithms for Constrained Routing
Gradient SF Algorithm
Newton-SF Algorithm
Quasi-Newton Algorithms
Quasi-Newton SF Algorithm
Simulation Results
Conclusion
References
An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks
Introduction
A Graph Theoretic Model of the SMET Problem
Summary of Previous Work
Kruskal-Incremental Power Greedy Heuristic
Experimental Results
Conclusion
References
kth Order Geometric Spanners for Wireless Ad Hoc Networks
Introduction
kth Order Geometric Spanners
kth Order Relative Neighborhood Graph (k-RNG)
kth Order Gabriel Graph (k-GG)
kth Order Delaunay Graph (k-Del)
kth Order Yao Graph (k-Yao)
Simulation and Analysis
Conclusion
References
Robust and Distributed Range-Free Localization Using Anchor Nodes with Varying Communication Range for Three Dimensional Wireless Sensor Networks
Introduction
Related Work
Proposed Localization Algorithm
Network Model and Assumptions
Beacon Point Selection
Position Calculation
Error Detection and Correction
Algorithm
Simulation Results
Fixed vs. Variable Communication Range
Mobility Model
Error Correction
Average Localization Time
Robustness (Average Localization Error)
Conclusion and Future Work
References
Internet Technologies and Applications
Decision Support Web Service
Introduction
Related Work
Architecture
X-UDDI
APIs of X-UDDI
Publishing API of DSWS
Inquiry API of DSWS
Example
Publishing the Service in the X-UDDI
Finding a DSWS
Conclusion
References
A Scalable Architecture for Real-Time Online Data Access
Introduction
Previous Work
Design and Implementation
Results
Conclusions
References
Socially Responsive Resource Usage: A Protocol
Introduction
Ethics on Resource Usage
Participating Entities
The Protocol
Adaptive Protocol
Related Work
Conclusion
References
An Automated HSV Based Text Tracking System from Complex Color Video
Introduction
Related Work
Overview of the Approach
Shot Detection
Key Frame Selection
Frame Based Text Localizer
Text Localization in Key Frames Using Bi-directional Prediction
Performance of the Proposed System
Shot Detection Accuracy and Speed of Processing
Text Detection Accuracy
Processing Speed
Conclusion
References
Security
Enhanced Insider Threat Detection Model that Increases Data Availability
Introduction
Related Work
The Effect of Knowledgebase and Lifetime of Data Items
Ordering Access Sequence
Tasks as a Batch of Transactions
Limitations and Possible Solutions
Providing Incorrect Values of Data Items
Tasks Executing a Transaction at a Time
Choosing the Sequence with the Lowest Risk
Conclusions and Future Work
References
Checking Anonymity Levels for Anonymized Data
Introduction
Related Work
The PRUDENT
Verification Algorithm
Verifying for k-Anonymity
Verifying for l-Diversity
Verifying for (a, k) Anonymity
Experimentation
PRUDENT Vs. Privacy FP- Tree
k-Anonymity
l-Diversity
(a, k) - Anonymity
Conclusions
References
Chaos Based Image Encryption Scheme Based on Enhanced Logistic Map
Introduction
Logistic Map
ProposedScheme
Key Generation
Rotation and XORing
Nonlinear Diffusion
Alternative zig-zag Diffusion
Performance and Security Analysis
Histogram Analysis
Statistical Analysis
Differential Analysis
Key Space Analysis
Avalanche Criterion
Information Entropy Analysis
Conclusion
References
Bio-inspired Computing
Matrix Insertion-Deletion Systems for Bio-Molecular Structures
Introduction
Preliminaries
Matrix Insertion-Deletion Systems
Representing Bio-Molecular Structures
Ambiguity Issues in Gene Sequences
Universality of Matrix Insertion-Deletion Systems
Conclusion
References
Artificial Bee Colony Based Sensor Deployment Algorithm for Target Coverage Problem in 3-D Terrain
Introduction
Related Work
Problem Definition
Sensor Coverage
Mean of Location Points
Simple Coverage
k-Coverage
Q-Coverage
Cluster Formation
Proposed Approach
Behavior of Bees in Nature
Proposed Method
Results and Discussion
Impact of Varying k and Q
Impact of Varying Number of Sensor Nodes
Impact of Varying Number of Targets
Sensitivity Analysis
Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken