Discriminative pattern mining in software fault detection

We present a method to enhance fault localization for software systems based on a frequent pattern mining algorithm. Our method is based on a large set of test cases for a given set of programs in which faults can be detected. The test executions are recorded as function call trees. Based on test oracles the tests can be classified into successful and failing tests. A frequent pattern mining algorithm is used to identify frequent subtrees in successful and failing test executions. This information is used to rank functions according to their likelihood of containing a fault. The ranking suggests an order in which to examine the functions during fault analysis. We validate our approach experimentally using a subset of Siemens benchmark programs.

Predicting fault inflow in iterative software development processes: an industrial evaluation

This paper addresses the need for accurate predictions on the fault inflow, i.e. the number of faults found in the consecutive project weeks, in highly iterative processes. In such processes, in contrast to waterfall-like processes, fault repair and development of new features run almost in parallel. Given accurate predictions on fault inflow, managers could dynamically re-allocate resources between these different tasks in a more adequate way. Furthermore, managers could react with process improvements when the expected fault inflow is higher than desired. This study suggests software reliability growth models (SRGMs) for predicting fault inflow. Originally developed for traditional processes, the performance of these models in highly iterative processes is investigated. Additionally, a simple linear model is developed and compared to the SRGMs. The paper provides results from applying these models on fault data from three different industrial projects. One of the key findings of this study is that some SRGMs are applicable for predicting fault inflow in highly iterative processes. Moreover, the results show that the simple linear model represents a valid alternative to the SRGMs, as it provides reasonably accurate predictions and performs better in many cases.

Dimension and coverage of multiple-models structures using clustering techniques

In this work a method for building multiple-model structures is presented. A clustering algorithm that uses data from the system is employed to define the architecture of the multiple-model, including the size of the region covered by each model, and the number of models. A heating ventilation and air conditioning system is used as a testbed of the proposed method.

Hybrid fault detection and isolation in an heater bank of an HVAC system

In this work a hybrid technique that includes probabilistic and optimization based methods is presented. The method is applied, both in simulation and by means of real-time experiments, to the heating unit of a Heating, Ventilation Air Conditioning (HVAC) system. It is shown that the addition of the probabilistic approach improves the fault diagnosis accuracy.

Multiple-model fault tolerant control of terminal unites of HVAC Systems

In this work, a fault-tolerant control scheme is applied to a air handling unit of a heating, ventilation and air-conditioning system. Using the multiple-model approach it is possible to identify faults and to control the system under faulty and normal conditions in an effective way. Using well known techniques to model and control the process, this work focuses on the importance of the cost function in the fault detection and its influence on the reconfigurable controller. Experimental results show how the control of the terminal unit is affected in the presence a fault, and how the recuperation and reconfiguration of the control action is able to deal with the effects of faults.

Fault tolerance of Mobius cubes under two forbidden fault set models

An n-dimensional Mobius cube, 0MQ(n) or 1MQ(n), is a variation of n-dimensional cube Q(n) which possesses many attractive properties such as significantly smaller communication delay and stronger graph-embedding capabilities. In some practical situations, the fault tolerance of a distributed memory multiprocessor system can be measured more precisely by the connectivity of the underlying graph under forbidden fault set models. This article addresses the connectivity of 0MQ(n)/1MQ(n), under two typical forbidden fault set models. We first prove that the connectivity of 0MQ(n)/1MQ(n) is 2n - 2 when the fault set does not contain the neighborhood of any vertex as a subset. We then prove that the connectivity of 0MQ(n)/1MQ(n) is 3n - 5 provided that the neighborhood of any vertex as well as that of any edge cannot fail simultaneously These results demonstrate that 0MQ(n)/1MQ(n) has the same connectivity as Q(n) under either of the previous assumptions.

Water adsorption on O-covered Ru{0001}: coverage-dependent change from dissociation to molecular adsorption

When water is coadsorbed with oxygen at coverages above 0.25ML an intact water species is observed in high resolution X-ray photoelectron spectroscopy up to 220 K, which is significantly more stable than intact water on the clean surface. The presence of this species causes a shift in the O 1s binding energy of the pre-adsorbed oxygen, which indicates the formation of hydrogen bonds between the two adsorbates. Low coverages of oxygen induce partial dissociation and recombinative desorption in the same temperature range, which illustrates that desorption temperatures alone cannot be used to determine whether water is molecularly intact or not.

The surface geometries of the medium and high coverage carbon monoxide structures c(2 × 4)–(2CO) and p(root7- x root7)R19°–(4CO) structure

The surface geometries of the p (root7- x root7)R19degrees-(4CO) and c(2 x 4)-(2CO) layers on Ni {111} and the clean Ni {111} surface were determined by low energy electron diffraction structure analysis. For the clean surface small but significant contractions of d(12) and d(23) (both 2.02 Angstrom) were found with respect to the bulk interlayer distance (2.03 Angstrom). In the c(2 x 4)-(2CO) structure these distances are expanded, with values of d(12) = 2.08 Angstrom and d(23) = 2.06 Angstrom and buckling of 0.08 and 0.02 Angstrom, respectively, in the first and second layer. CO resides near hcp and fcc hollow sites with relatively large lateral shifts away from the ideal positions leading to unequal C-Ni bond lengths between 1.76 and 1.99 Angstrom. For the p(root7- x root7-)R19'-(4CO) layer two best fit geometries were found, which agree in most of their atomic positions, except for one out of four CO molecules, which is either near atop or between bridge and atop. The remaining three molecules reside near hcp and fcc sites, again with large lateral deviations from their ideal positions. The average C Ni bond length for these molecules is, however, the same as for CO on hollow sites at low coverage. The average CNi bond length at hollow sites, the interlayer distances, and buckling in the first Ni layer are similar to the c(2 x 4)(2CO) geometry, only the buckling in the second layer (0.08 Angstrom) is significantly larger. Lateral and vertical shifts of the Ni atoms in the first layer lead to unsymmetric environments for the CO molecules, which can be regarded as an imprint of the chiral p(root7- x root7-)R19degrees lattice geometry onto the substrate.

Implementing intelligent cores using processor virtualization for fault tolerance

Processor virtualization for process migration in distributed parallel computing systems has formed a significant component of research on load balancing. In contrast, the potential of processor virtualization for fault tolerance has been addressed minimally. The work reported in this paper is motivated towards extending concepts of processor virtualization towards ‘intelligent cores’ as a means to achieve fault tolerance in distributed parallel computing systems. Intelligent cores are an abstraction of the hardware processing cores, with the incorporation of cognitive capabilities, on which parallel tasks can be executed and migrated. When a processing core executing a task is predicted to fail the task being executed is proactively transferred onto another core. A parallel reduction algorithm incorporating concepts of intelligent cores is implemented on a computer cluster using Adaptive MPI and Charm ++. Preliminary results confirm the feasibility of the approach.

Intelligent agents for fault tolerance: from multi-agent simulation to cluster-based implementation

Recent research in multi-agent systems incorporate fault tolerance concepts, but does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely 'Intelligent Agents'. A task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator, and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.