Managing community membership information in a small-world grid

As the Grid matures the problem of resource discovery across communities, where resources now include computational services, is becoming more critical. The number of resources available on a world-wide grid is set to grow exponentially in much the same way as the number of static web pages on the WWW. We observe that the world-wide resource discovery problem can be modelled as a slowly evolving very-large sparse-matrix where individual matrix elements represent nodes’ knowledge of one another. Blocks in the matrix arise where nodes offer more than one service. Blocking effects also arise in the identification of sub-communities in the Grid. The linear algebra community has long been aware of suitable representations of large, sparse matrices. However, matrices the size of the world-wide grid potentially number in the billions, making dense solutions completely intractable. Distributed nodes will not necessarily have the storage capacity to store the addresses of any significant percentage of the available resources. We discuss ways of modelling this problem in the regime of a slowly changing service base including phenomena such as percolating networks and small-world network effects

In-depth analysis of the Naming Game dynamics: the homogeneous mixing case

Language emergence and evolution has recently gained growing attention through multi-agent models and mathematical frameworks to study their behavior. Here we investigate further the Naming Game, a model able to account for the emergence of a shared vocabulary of form-meaning associations through social/cultural learning. Due to the simplicity of both the structure of the agents and their interaction rules, the dynamics of this model can be analyzed in great detail using numerical simulations and analytical arguments. This paper first reviews some existing results and then presents a new overall understanding.Comment: 30 pages, 19 figures (few in reduced definition). In press in IJMP

Sharp transition towards shared vocabularies in multi-agent systems

What processes can explain how very large populations are able to converge on the use of a particular word or grammatical construction without global coordination? Answering this question helps to understand why new language constructs usually propagate along an S-shaped curve with a rather sudden transition towards global agreement. It also helps to analyze and design new technologies that support or orchestrate self-organizing communication systems, such as recent social tagging systems for the web. The article introduces and studies a microscopic model of communicating autonomous agents performing language games without any central control. We show that the system undergoes a disorder/order transition, going trough a sharp symmetry breaking process to reach a shared set of conventions. Before the transition, the system builds up non-trivial scale-invariant correlations, for instance in the distribution of competing synonyms, which display a Zipf-like law. These correlations make the system ready for the transition towards shared conventions, which, observed on the time-scale of collective behaviors, becomes sharper and sharper with system size. This surprising result not only explains why human language can scale up to very large populations but also suggests ways to optimize artificial semiotic dynamics.Comment: 12 pages, 4 figure

Self-organization in Communicating Groups: the emergence of coordination, shared references and collective intelligence\ud

The present paper will sketch the basic ideas of the complexity paradigm, and then apply them to social systems, and in particular to groups of communicating individuals who together need to agree about how to tackle some problem or how to coordinate their actions. I will elaborate these concepts to provide an integrated foundation for a theory of self-organization, to be understood as a non-linear process of spontaneous coordination between actions. Such coordination will be shown to consist of the following components: alignment, division of labor, workflow and aggregation. I will then review some paradigmatic simulations and experiments that illustrate the alignment of references and communicative conventions between communicating agents. Finally, the paper will summarize the preliminary results of a series of experiments that I devised in order to observe the emergence of collective intelligence within a communicating group, and interpret these observations in terms of alignment, division of labor and workflow

Computer-Aided System for Wind Turbine Data Analysis

Context: The current work on wind turbine failure detection focuses on researching suitable signal processing algorithms and developing efficient diagnosis algorithms. The laboratory research would involve large and complex data, and it can be a daunting task. Aims: To develop a Computer-Aided system for assisting experts to conduct an efficient laboratory research on wind turbine data analysis. System is expected to provide data visualization, data manipulation, massive data processing and wind turbine failure detection. Method: 50G off-line SCADA data and 4 confident diagnosis algorithms were used in this project. Apart from the instructions from supervisor, this project also gained help from two experts from Engineering Department. Java and Microsoft SQL database were used to develop the system. Results: Data visualization provided 6 different charting solutions and together with robust user interactions. 4 failure diagnosis solutions and data manipulations were provided in the system. In addition, dedicated database server and Matlab API with Java RMI were used to resolve the massive data processing problem. Conclusions: Almost all of the deliverables were completed. Friendly GUI and useful functionalities make user feel more comfortable. The final product does enable experts to conduct an efficient laboratory research. The end of this project also gave some potential extensions of the system

Formal Aspects of Grid Brokering

Coordination in distributed environments, like Grids, involves selecting the most appropriate services, resources or compositions to carry out the planned activities. Such functionalities appear at various levels of the infrastructure and in various means forming a blurry domain, where it is hard to see how the participating components are related and what their relevant properties are. In this paper we focus on a subset of these problems: resource brokering in Grid middleware. This paper aims at establishing a semantical model for brokering and related activities by defining brokering agents at three levels of the Grid middleware for resource, host and broker selection. The main contribution of this paper is the definition and decomposition of different brokering components in Grids by providing a formal model using Abstract State Machines

A study of System Interface Sets (SIS) for the host, target and integration environments of the Space Station Program (SSP)

System interface sets (SIS) for large, complex, non-stop, distributed systems are examined. The SIS of the Space Station Program (SSP) was selected as the focus of this study because an appropriate virtual interface specification of the SIS is believed to have the most potential to free the project from four life cycle tyrannies which are rooted in a dependance on either a proprietary or particular instance of: operating systems, data management systems, communications systems, and instruction set architectures. The static perspective of the common Ada programming support environment interface set (CAIS) and the portable common execution environment (PCEE) activities are discussed. Also, the dynamic perspective of the PCEE is addressed