2009 Third IEEE International Conference on Self-Adaptive and Self-Organizing Systems

14-18 Sept. 2009

Filter Results

Displaying Results 1 - 25 of 51
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (10 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (155 KB)
    Freely Available from IEEE
  • Message from the General Chairs

    Publication Year: 2009, Page(s):ix - x
    Request permission for commercial reuse | PDF file iconPDF (76 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Committee Chairs

    Publication Year: 2009, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (81 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Steering Committee

    Publication Year: 2009, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (65 KB)
    Freely Available from IEEE
  • Technical Meeting Committee

    Publication Year: 2009
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • Keynote

    Publication Year: 2009, Page(s): xvi
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (63 KB)

    Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Patterns of Delegate MAS

    Publication Year: 2009, Page(s):1 - 9
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Delegate MAS has been proposed and investigated as an integrated coordination technique for so-called self-organizing coordination-and-control applications. Delegate MAS consist of three types of light weight, ant-like agents that assist domain agents in their coordination tasks - the types are exploration, intention and feasibility ants. The technique is especially suitable for distributed applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dissecting Self-* Properties

    Publication Year: 2009, Page(s):10 - 19
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (246 KB) | HTML iconHTML

    The scale and complexity of distributed systems have steadily grown in the recent years. Management of this complexity has drawn attention towards systems that can automatically maintain themselves throughout different scenarios. These systems have been described with many terms, such as self-healing, self-stabilizing, self-organizing, self-adaptive, self-optimizing, self-protecting, and self-mana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed W-Learning: Multi-Policy Optimization in Self-Organizing Systems

    Publication Year: 2009, Page(s):20 - 29
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    Large-scale agent-based systems are required to self-optimize towards multiple, potentially conflicting, policies of varying spatial and temporal scope. As a result, not all agents may be implementing all policies at all times, resulting in agent heterogeneity. As agents share their operating environment, significant dependencies can arise between agents and therefore between policy implementation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays

    Publication Year: 2009, Page(s):30 - 39
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and delays. This incurs a significant bandwidth cost. We propose the forward feedback protocol (FFP) which only routes a single copy of the message a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Myconet: A Fungi-Inspired Model for Superpeer-Based Peer-to-Peer Overlay Topologies

    Publication Year: 2009, Page(s):40 - 50
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (487 KB) | HTML iconHTML

    Unstructured peer-to-peer networks can be extremely flexible, but, because of size, complexity, and high variability in peers' capacity and reliability, it is a continuing challenge to build peer-to-peer systems that are resilient to failure and effectively manage their available resources. We present Myconet, an approach to superpeer overlay construction inspired by the sophisticated, robust, roo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swarming Polyagents Executing Hierarchical Task Networks

    Publication Year: 2009, Page(s):51 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    Swarming agents often operate in benign geographic topologies that let them explore alternative trajectories with minor variations that the agent dynamics then amplify for improved performance. In this paper we demonstrate the deployment of swarming agents in the non-metric and discontinuous topology of a process graph. We align our research with traditional AI approaches and focus on hierarchical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Organization of Patrolling-Ant Algorithms

    Publication Year: 2009, Page(s):61 - 70
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB) | HTML iconHTML

    We consider here multi-agent patrolling as the task for a group of agents to repeatedly visit all the cells of a discrete environment. Wagner et al. have introduced patrolling ant algorithms, where each agent can only mark and move according to its local perception of the environment. Among various results, it has been experimentally observed that for some algorithms the agents often self-organize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swarming Geographic Event Profiling, Link Analysis, and Prediction

    Publication Year: 2009, Page(s):71 - 81
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (539 KB) | HTML iconHTML

    Geographically embedded processes with hidden origins are often observable in events they generate. It is common practice in criminological forensics to reverse simple equation-based models of trajectories that link the origin with its events to derive a probability estimate of a common origin location. This approach requires that linked events are manually extracted from larger event data sets. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of Self-adaptation Mechanisms in a Swarm of Logistic Agents

    Publication Year: 2009, Page(s):82 - 91
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (933 KB) | HTML iconHTML

    We are interested in addressing the problem of coordinating a large number of simple agents in order to achieve a given task. Stated in this way, the question leads naturally to the Swarm Intelligence field. In this paper we use a new type of model, directly inspired by Kaneko's coupled map gas model which we have adapted to the multi-agent system paradigm, so as to tackle this generic objective. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimising Sensor Layouts for Direct Measurement of Discrete Variables

    Publication Year: 2009, Page(s):92 - 102
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB) | HTML iconHTML

    An optimal sensor layout is attained when a limited number of sensors are placed in an area such that the cost of the placement is minimized while the value of the obtained information is maximized. In this paper, we discuss the optimal sensor layout design problem from first principles, show how an existing optimization criterion (maximum entropy of the measured variables) can be derived, and com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Biologically-Inspired Construction of Connected k-Hop Dominating Sets in Wireless Sensor Networks

    Publication Year: 2009, Page(s):103 - 114
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    Connected k-hop dominating sets (CkDS) have various applications in wireless sensor networks. They are for example used to alleviate the broadcast storm problem or to achieve an adjustable amount of area coverage while maintaining connectivity. In this paper, we propose a novel protocol for the construction of CkDS in wireless sensor networks drawing inspiration from the flight behavior of oviposi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organization of Very Large Sensor Networks Based on Small-worlds Principles

    Publication Year: 2009, Page(s):115 - 125
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (514 KB) | HTML iconHTML

    We study networks consisting of a very large number of tiny and inexpensive sensors and introduce SWAS (Small-Worlds of Anonymous Sensors), an algorithm combining self-organization based upon small-worlds principles and Medium Access Control based upon a stack protocol for VLSNs and we report on a preliminary study of the algorithm. The nodes of Very Large Sensor Networks (VLSN) have limited resou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generic Self-Adaptation to Reduce Design Effort for System-on-Chip

    Publication Year: 2009, Page(s):126 - 135
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (682 KB) | HTML iconHTML

    We investigate a generic self-adaptation method to reduce the design effort for system-on-chip (SoC). Previous self-adaptation solutions at chip-level use circuitries which have been specially designed for the current problem by hand, leading to an elaborate and inflexible design process, requiring specially trained engineers, and making design reuse difficult. On the other hand, a generic self-ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theoretical Examination of a Self-Adaptation Approach to Improve the Real-Time Capabilities in Multi-Threaded Microprocessors

    Publication Year: 2009, Page(s):136 - 143
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    Our aim is to investigate the possibility to control the throughput (IPC rate) of a thread running on a multithreaded microprocessor by a closed feedback loop. We showed in previous experimental studies the practability of this approach. In this paper we discuss the control theory approach from a mathematical point of view. We develop a formal model of a general purpose multi-threaded microprocess... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.