Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.

Understanding the socio-economic distribution of multiple deprivation: An application of self-organising maps

In this paper we seek to contribute to recent efforts to develop and implement multi-dimensional approaches to social exclusion by applying self-organising maps (SOMs) to a set of material deprivation indicators from the Irish component of EU-SILC. The first stage of our analysis involves the identification of sixteen clusters that confirm the multi-dimensional nature of deprivation in contemporary Ireland and the limitations of focusing solely on income. In going beyond this mapping stage, we consider both patterns of socio-economic differentiation in relation to cluster membership and the extent to which such membership contributes to our understanding of economic stress. Our analysis makes clear the continuing importance of traditional forms of stratification relating to factors such as income, social class and housing tenure in accounting for patterns of multiple deprivation. However, it also confirms the role of acute life events and life cycle and location influences. Most importantly, it demonstrates that conclusions relating to the relative impact of different kinds of socio-economic influences are highly dependent on the form of deprivation being considered. Our analysis suggests that debates relating to the extent to which poverty and social exclusion have become individualized should take particular care to distinguish between different kinds of outcomes. Further analysis demonstrates that the SOM approach is considerably more successful than a comparable latent class analysis in identifying those exposed to subjective economic stress. (C) 2010 International Sociological Association Research Committee 28 on Social Stratification and Mobility. Published by Elsevier Ltd. All rights reserved.

Mapping patterns of multiple deprivation using self-organising maps: An application to EU-SILC data for Ireland

The development of conceptual frameworks for the analysis of social exclusion has somewhat out-stripped related methodological developments. This paper seeks to contribute to filling this gap through the application of self-organising maps (SOMs) to the analysis of a detailed set of material deprivation indicators relating to the Irish case. The SOM approach allows us to offer a differentiated and interpretable picture of the structure of multiple deprivation in contemporary Ireland. Employing this approach, we identify 16 clusters characterised by distinct profiles across 42 deprivation indicators. Exploratory analyses demonstrate that, controlling for equivalised household income, SOM cluster membership adds substantially to our ability to predict subjective economic stress. Moreover, in comparison with an analogous latent class approach, the SOM analysis offers considerable additional discriminatory power in relation to individuals' experience of their economic circumstances. The results suggest that the SOM approach could prove a valuable addition to a 'methodological platform' for analysing the shape and form of social exclusion. (c) 2009 Elsevier Inc. All rights reserved.

Algorithms for Self-Healing Networks

Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never have node failures. Instead, these networks should be able to admit small, and maybe, periodic failures and still recover like skin heals from a cut. This process, where the network can recover itself by maintaining key invariants in response to attack by a powerful adversary is what we call \emph{self-healing}. Here, we present several fast and provably good distributed algorithms for self-healing in reconfigurable dynamic networks. Each of these algorithms have different properties, a different set of gaurantees and limitations. We also discuss future directions and theoretical questions we would like to answer. %in the final dissertation that this document is proposed to lead to.

A simulation model of self-organising evolvability in software systems

The evolvability of a software artifact is its capacity for producing heritable or reusable variants; the inverse quality is the artifact's inertia or resistance to evolutionary change. Evolvability in software systems may arise from engineering and/or self-organising processes. We describe our 'Conditional Growth' simulation model of software evolution and show how, it can be used to investigate evolvability from a self-organisation perspective. The model is derived from the Bak-Sneppen family of 'self-organised criticality' simulations. It shows good qualitative agreement with Lehman's 'laws of software evolution' and reproduces phenomena that have been observed empirically. The model suggests interesting predictions about the dynamics of evolvability and implies that much of the observed variability in software evolution can be accounted for by comparatively simple self-organising processes.

Using self-organising feature maps for the control of artificial organisms

Variations on the standard Kohonen feature map can enable an ordering of the map state space by using only a limited subset of the complete input vector. Also it is possible to employ merely a local adaptation procedure to order the map, rather than having to rely on global variables and objectives. Such variations have been included as part of a hybrid learning system (HLS) which has arisen out of a genetic-based classifier system. In the paper a description of the modified feature map is given, which constitutes the HLSs long term memory, and results in the control of a simple maze running task are presented, thereby demonstrating the value of goal related feedback within the overall network.