Dynamics of Information Systems: Algorithmic Approaches Front Cover

Dynamics of Information Systems: Algorithmic Approaches

  • Length: 338 pages
  • Edition: 2013
  • Publisher:
  • Publication Date: 2013-09-30
  • ISBN-10: 1461475813
  • ISBN-13: 9781461475811
  • Sales Rank: #11581956 (See Top 100 Books)
Description

Dynamics of Information Systems: Algorithmic Approaches (Springer Proceedings in Mathematics & Statistics)

Dynamics of Information Systems: Algorithmic Approaches presents recent developments and results found by participants of the Fourth International Conference on the Dynamics of Information Systems, which took place at the University of Florida, Gainesville FL, USA on February 20-22, 2012. The purpose of this conference was to bring together scientists and engineers from industry, government, and universities to exchange knowledge and results in a broad range of topics relevant to the theory and practice of the dynamics of information systems.​​​Dynamics of Information plays an increasingly critical role in our society. The influence of information on social, biological, genetic, and military systems must be better understood to achieve large advances in the capability and understanding of these systems. Applications are widespread and include: detection of terrorist networks, design of highly efficient businesses, computer networks, quantum entanglement, genome modeling, multi-robotic systems, and industrial and manufacturing safety.

The book contains state-of-the-art work on theory and practice relevant to the dynamics of information systems. It covers algorithmic approaches to numerical computations with infinite and infinitesimal numbers; presents important problems arising in service-oriented systems, such as dynamic composition and analysis of modern service-oriented information systems and estimation of customer service times on a rail network from GPS data; addresses the complexity of the problems arising in stochastic and distributed systems; and discusses modulating communication for improving multi-agent learning convergence. Network issues—in particular minimum-risk maximum-clique problems, vulnerability of sensor networks, influence diffusion, community detection, and link prediction in social network analysis, as well as a comparative analysis of algorithms for transmission network expansion planning—are described in later chapters.

Table of Contents

Chapter 1: Numerical Computations with Infinite and Infinitesimal Numbers: Theory and Applications
Chapter 2: Dynamic Composition and Analysis of Modern Service-Oriented Information Systems
Chapter 3: Estimating Customer Service Times on a Rail Networkfrom GPS Data
Chapter 4: A Risk-Averse Game-Theoretic Approach to Distributed Control
Chapter 5: Static Teams and Stochastic Games
Chapter 6: A Framework for Coordination in Distributed Stochastic Systems: Output Feedback and Performance Risk Aversion
Chapter 7: Modulating Communication to Improve Multi-agent Learning Convergence
Chapter 8: Minimum-Risk Maximum Clique Problem
Chapter 9: Models for Assessing Vulnerability in Imperfect Sensor Networks
Chapter 10: Minimum Connected Sensor Cover and Maximum-Lifetime Coverage in Wireless Sensor Networks
Chapter 11: Influence Diffusion, Community Detection, and Link Prediction in Social Network Analysis
Chapter 12: Comparative Analysis of Local Search Strategiesfor Transmission Network Expansion Planning

To access the link, solve the captcha.