Abstract
IndLog is a general purpose Prolog-based Inductive Logic Programming (ILP) system. It is theoretically based on the Mode Directed Inverse Entailment and has several distinguishing features that makes it adequate for a wide range of applications. To search efficiently through large hypothesis spaces, IndLog uses original features like lazy evaluation of examples and Language Level Search. IndLog is applicable in numerical domains using the lazy evaluation of literals technique and Model Validation and Model Selection statistical-based techniques. IndLog has a MPI/LAM interface that enables its use in parallel or distributed environments, essential for Multi-relational Data Mining applications. Parallelism may be used in three flavours: splitting of the data among the computation nodes; parallelising the search through the hypothesis space and; using the different computation nodes to do theory-level search. IndLog has been applied successfully to major ILP literature datasets from the Life Sciences, Engineering, Reverse Engineering, Economics, Time-Series modelling to name a few.

Abstract
In this paper we propose the mutable consensus protocol, a pragmatic and theoretically appealing approach to enhance the performance of distributed consensus. First, an apparently inefficient protocol is developed using the simple stubborn channel abstraction for unreliable message passing. Then, performance is improved by introducing judiciously chosen finite delays in the implementation of channels. Although this does not compromise correctness, which rests on an asynchronous system model, it makes it likely that the transmission of some messages is avoided and thus the message exchange pattern at the network level changes noticeably. By choosing different delays in the underlying stubborn channels, the mutable consensus protocol can actually be made to resemble several different protocols. Besides presenting the mutable consensus protocol and four different mutations, we evaluate in detail the particularly interesting permutation gossip mutation, which allows the protocol to scale gracefully to a large number of processes by balancing the number of messages to be handled by each process with the number of communication steps required to decide. The evaluation is performed using a realistic simulation model which accurately reproduces resource consumption in real systems.

Abstract
The basic motivation of component based development is to replace conventional programming by the composition of reusable off-the-shelf units, externally coordinated through a network of connecting devices, to achieve a common goal. This paper introduces a new relational model for software connectors and discusses some preliminary work on its implementation in Haskell. The proposed model adopts a coordination point of view in order to deal with components' temporal and spatial decoupling and, therefore, to provide support for looser levels of inter-component dependency and effective external control.

Abstract
The paper presents a framework to evaluate dependability of PROFIBUS-DP networks. An hierarchical modeling approach is proposed, which considers both the effects of permanent and transient faults. Stochastic Petri Nets are used as the modelling technique to obtain dependability models with emphasis in the use of analytical/numerical methods to provide model's solutions. In scenarios where its difficult to apply this approach, compact simulation models are derived.

Abstract
Voltage stability plays a very important role during the planning and design stages of an electric power network as well as during the system operation. In the last years in various countries worldwide, several power network collapses (blackouts) caused by voltage problems have been reported. This can be produced by a lack of sufficient reactive power reserve during heavy load or by the occurrence of severe contingencies. In this paper it is studied and analysed the influence of the load models in the dynamic voltage stability assessment of an electric power system. It was used the BPA test power network. A severe contingency situation was simulated to perform the study. The automatic voltage regulators of the generating units and the turbine speed governors were modelled as well as the transformer taps. The simulation results were obtained using the commercial transient software package EUROSTAG. Finally some conclusions that provide a better understanding of the voltage collapse phenomena are pointed out.

Abstract
In this paper we provide a different way to estimate matrices B and D, in subspace identification algorithms. The starting point was the method proposed by Van Overschee and De Moor [10] - the only one applying subspace ideas to the estimation of those matrices. We have derived new (and simpler) expressions and we found that the method proposed by Van Overschee and De Moor [10] can be rewritten as a weighted least squares problem, involving the future outputs and inputs.