Simulated annealing technique for fast learning of SOM networks

The Self-Organizing Map (SOM) is a popular unsupervised neural network able to provide effective clustering and data visualization for multidimensional input datasets. In this paper, we present an application of the simulated annealing procedure to the SOM learning algorithm with the aim to obtain a fast learning and better performances in terms of quantization error. The proposed learning algorithm is called Fast Learning Self-Organized Map, and it does not affect the easiness of the basic learning algorithm of the standard SOM. The proposed learning algorithm also improves the quality of resulting maps by providing better clustering quality and topology preservation of input multi-dimensional data. Several experiments are used to compare the proposed approach with the original algorithm and some of its modification and speed-up techniques.

Real-time identification and modelling in pervasive mining

This paper introduces an architecture for identifying and modelling in real-time at a copper mine using new technologies as M2M and cloud computing with a server in the cloud and an Android client inside the mine. The proposed design brings up pervasive mining, a system with wider coverage, higher communication efficiency, better fault-tolerance, and anytime anywhere availability. This solution was designed for a plant inside the mine which cannot tolerate interruption and for which their identification in situ, in real time, is an essential part of the system to control aspects such as instability by adjusting their corresponding parameters without stopping the process.

Healable Polymer Systems

Polymers are used in many everyday technologies and their degradation due to environmental exposure has lead to great interest in materials which can heal and repair themselves. In order to design new self healing polymers it's important to understand the fundamental healing mechanisms behind the material.Healable Polymer Systems will outline the key concepts and mechanisms underpinning the design and processing of healable polymers, and indicate potential directions for progress in the future development and applications of these fascinating and potentially valuable materials. The book covers the different techniques developed successfully to date for both autonomous healable materials (those which do not require an external stimulus to promote healing) and rehealable or remendable materials (those which only recover their original physical properties if a specific stimulus is applied). These include the encapsulated-monomer approach, reversible covalent bond formation, irreversible covalent bond formation and supramolecular self-assembly providing detailed insights into their chemistry.Written by leading experts, the book provides polymer scientists with a compact and readily accessible source of reference for healable polymer systems.

Design, synthesis and computational modelling of aromatic tweezer-molecules as models for chain-folding polymer blends

Novel 'tweezer-type' complexes that exploit the interactions between pi-electron-rich pyrenyl groups and pi-electron deficient diimide units have been designed and synthesised. The component molecules leading to complex formation were accessed readily from commercially available starting materials through short and efficient syntheses. Analysis of the resulting complexes, using the visible charge-transfer band, revealed association constants that increased sequentially from 130 to 11,000 M-1 as increasing numbers of pi-pi-stacking interactions were introduced into the systems. Computational modelling was used to analyse the structures of these complexes, revealing low-energy chain-folded conformations for both components, which readily allow close, multiple pi-pi-stacking and hydrogen bonding to be achieved. In this paper, we give details of our initial studies of these complexes and outline how their behaviour could provide a basis for designing self-healing polymer blends for use in adaptive coating systems. (C) 2008 Elsevier Ltd. All rights reserved.

Norms-based simulation for personalised service provision

User interfaces have the primary role of enabling access to information meeting individual users' needs. However, the user-systems interaction is still rigid, especially in support of complex environments where various types of users are involved. Among the approaches for improving user interface agility, we present a normative approach to the design interfaces of web applications, which allow delivering users personalized services according to parameters extracted from the simulation of norms in the social context. A case study in an e-Government context is used to illustrate the implications of the approach.

Nested parallelism for multi-core HPC systems using Java

Since its introduction in 1993, the Message Passing Interface (MPI) has become a de facto standard for writing High Performance Computing (HPC) applications on clusters and Massively Parallel Processors (MPPs). The recent emergence of multi-core processor systems presents a new challenge for established parallel programming paradigms, including those based on MPI. This paper presents a new Java messaging system called MPJ Express. Using this system, we exploit multiple levels of parallelism - messaging and threading - to improve application performance on multi-core processors. We refer to our approach as nested parallelism. This MPI-like Java library can support nested parallelism by using Java or Java OpenMP (JOMP) threads within an MPJ Express process. Practicality of this approach is assessed by porting to Java a massively parallel structure formation code from Cosmology called Gadget-2. We introduce nested parallelism in the Java version of the simulation code and report good speed-ups. To the best of our knowledge it is the first time this kind of hybrid parallelism is demonstrated in a high performance Java application. (C) 2009 Elsevier Inc. All rights reserved.

On the maximal connected component of hypercube with faulty vertices (II)

evaluating the fault tolerance of an interconnection network, it is essential to estimate the size of a maximal connected component of the network at the presence of faulty processors. Hypercube is one of the most popular interconnection networks. In this paper, we prove that for ngreater than or equal to6, an n-dimensional cube with a set F of at most (4n-10) failing processors has a component of size greater than or equal to2"-\F-3. This result demonstrates the superiority of hypercube in terms of the fault tolerance.

A lower bound on the size of k-neighborhood in generalized cubes

The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 <= k <= 3n - 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results. (c) 2005 Elsevier Inc. All rights reserved.

Healable supramolecular polymers

This mini-review details the recent development of self-healing and mendable polymeric materials which take advantage of the reversible characteristics of non-covalent interactions during their physical recovery process. Supramolecular polymer systems which undergo spontaneous (autonomous) healing, as well as those which require external stimuli to initiate the healing process (healable/mendable), are introduced and discussed. Supramolecular polymers offer key advantages over alternative approaches, as these materials can typically withstand multiple healing cycles without substantial loss of performance, as a consequence of the highly directional and fully reversible non-covalent interactions present within the polymer matrix.

Rejoinder to 'Performance of different synchronisation measures in real data: A case study on electroencephalograhic signals

We agree with Duckrow and Albano [Phys. Rev. E 67, 063901 (2003)] and Quian Quiroga et al. [Phys. Rev. E 67, 063902 (2003)] that mutual information (MI) is a useful measure of dependence for electroencephalogram (EEG) data, but we show that the improvement seen in the performance of MI on extracting dependence trends from EEG is more dependent on the type of MI estimator rather than any embedding technique used. In an independent study we conducted in search for an optimal MI estimator, and in particular for EEG applications, we examined the performance of a number of MI estimators on the data set used by Quian Quiroga et al. in their original study, where the performance of different dependence measures on real data was investigated [Phys. Rev. E 65, 041903 (2002)]. We show that for EEG applications the best performance among the investigated estimators is achieved by k-nearest neighbors, which supports the conjecture by Quian Quiroga et al. in Phys. Rev. E 67, 063902 (2003) that the nearest neighbor estimator is the most precise method for estimating MI.