Abstract
This paper presents a transformer failure diagnosis system based on Dissolved Gases Analysis that was developed by using a new methodology for extracting fuzzy rules from Kohonen Self-Organizing Map. Firstly, the Kohonen net was trained in order to capture the knowledge from a database of faulty transformers inspected in service. Once the knowledge was captured during the learning stage, it was transformed into the form of Zero-order Takagi-Sugeno fuzzy rules. In the form of fuzzy rules, the relationship between the variables of the system became explicit which have led to a more reliable diagnosis system. Additionally to the extraction of the fuzzy system, a fuzzyfication process was applied in the fuzzy system output. Experimental results demonstrated the efficiency of the diagnosis system proposed that had superior results as compared with other conventional and intelligent methods.

Abstract
This paper discusses the development of a Multi-Agent Systems (MAS) technology-based platform with potential applications in management and simulation processes in power systems. In order to explore some of the features of MAS, a new methodology is proposed to assess power systems reliability based on Monte Carlo simulation (MCS), exploiting the benefits of the distributed artificial intelligence area and, mainly, the use of the distributed capacity in two ways: building autonomous behaviors to the applications and mitigating computational effort. Through the use of this technology, it was possible to divide the MCS algorithm into distinct tasks and submit them to the agents' processing. Two different approaches to solve generating capacity reliability problems based on chronological MCS illustrate the potential of MAS in power systems reliability assessment.

Abstract
After the digital switchover, a secondary access of the so-called TV White Spaces should not interfere with primary users, such as DVB-T systems and local wireless microphone devices. One consensual method for secondary spectrum users to avoid interference is to combine geo-location database with spectrum sensing. This paper describes an experimental platform that combines wireless microphone sensors with a web-based geo-location database access. Software defined radios and Internet technologies are the enabling tools in use. From test trials in a real scenario, the platform was capable to update a list of vacant channel from the geo-location database, using reliable information from blind sensing algorithms. © 2012 IIMC Ltd.

Abstract
In this paper we introduce a framework to represent robot task plans based on Petri nets. Our approach enables modelling a robot task, analysing its qualitative and quantitative properties and using the Petri net representation for actual plan execution. The overall model is obtained from the composition of simple models, leading to a modular approach. Analysis is applied to a closed loop between the robot controller and the environment Petri net models. We focus here on the quantitative properties, captured by stochastic Petri net models. Furthermore, we introduce a method to identify the environment and action layer parameters of the stochastic Petri net models from real data, improving the significance of the model. The framework building blocks and a single-robot task model are detailed. Results of a case study with simulated soccer robots show the ability of the framework to provide a systematic modelling tool, and of determining, through well-known analysis methods for stochastic Petri nets, relevant properties of the task plan applied to a particular environment.

Abstract
In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [13], we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation (up-to), which is helpful for automation. © 2012 Elsevier B.V.

Abstract
Future advanced embedded computing systems are expected to dynamically adapt applications' behavior and runtime system according to, e.g., usage contexts, operating environments, resources' availability, and battery energy levels. Besides application's functionalities provided by high-level and/or executable binary codes, code for specifying strategies/policies to extend typical functionalities with adaptability behavior is required. A domain-specific language, able to program this adaptability behavior, will allow developers to specify strategies for adaptation, will improve portability, and will help tools to map those strategies to the target system. This paper presents our recent ideas for programming strategies focused on runtime adaptability. The ideas are exposed using extensions to LARA, an aspect-oriented programming language, agnostic to the target language and system. We show examples of using LARA to specify strategies and we comment on the possible implementations to make viable those strategies.