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.

Isolation and partial characterisation of acid phosphatase isozymes from dormant oilseed of Corylus avellana L.

The acid phosphatase (orthophosphoric-monoester phosphohydrolase, EC 3.1.3.2) complement from dormant hazel (Corylus avellana L.) seeds was found to exhibit significant electrophoretic heterogeneity partially attributable to the presence of distinct molecular forms. In axiferous tissue, total acid phosphatase activity increased in a biphasic fashion during chilling, a treatment necessary to alleviate seed dormancy. Three acid phosphatase isozymes were isolated from cotyledons of dormant hazel seeds by successive ammonium sulphate precipitation, size-exclusion, Concanavalin A affinity, cation- and anion-exchange chromatographies resulting in 75-, 389- and 191-fold purification (APase1, APase2, APase3, respectively). The three glycosylated isoforms were isolated to catalytic homogeneity as determined by electrophoretic, kinetic and heat-inactivation studies. The native acid phosphatase complement of hazel seeds had an apparent Mr of 81.5±3.5 kDa as estimated by size-exclusion chromatography, while the determined pI values were 5.1 (APase1), 6.9 (APase2) and 7.3 (APase3). The optimum pH for p-nitrophenyl phosphate hydrolysis was pH 3 (APase1), pH 5.6 (APase2) and pH 6 (APase3). The hazel isozymes hydrolysed a variety of phosphorylated substrates in a non-specific manner, exhibiting low Km and the highest specificity constant (Vmax/Km) for pyrophosphate. They were not primary phytases since they could not initiate phytic acid hydrolysis, while APase2 and APase3 had significant phospho-tyrosine phosphatase activity. Inorganic phosphate was a competitive inhibitor, while activity was significantly impaired in the presence of vanadate and fluoride.

Isolation and characterisation of phytase from dormant Corylus avellana seeds

Phytase (myo-inositol-1,2,3,4,5,6-hexakisphosphate phosphohydrolase, EC 3.1.3.26), which catalyses the step-wise hydrolysis of phytic acid, was purified from cotyledons of dormant Corylus avellana L. seeds. The enzyme was separated from the major soluble acid phosphatase by successive (NH4)2SO4 precipitation, gel filtration and cation exchange chromatography resulting in a 300-fold purification and yield of 7.5%. The native enzyme positively interacted with Concanavalin A suggesting that it is putatively glycosylated. After size exclusion chromatography and SDS–PAGE it was found to be a monomeric protein with molecular mass 72±2.5 kDa. The hazel enzyme exhibited optimum activity for phytic acid hydrolysis at pH 5 and, like other phytases, had broad substrate specificity. It exhibited the lowest Km (162 μM) and highest specificity constant (Vmax/Km) for phytic acid, indicating that this is the preferred in vivo substrate. It required no metal ion as a co-factor, while inorganic phosphate and fluoride competitively inhibited enzymic activity (Ki=407 μM and Ki=205 μM, respectively).

Burn-in policies for products having dormant states

Many systems might have a long time dormant period, during which the systems are not operated. For example, most building services products are installed while a building is constructed, but they are not operated until the building is commissioned. Warranty terms for such products may cover the time starting from their installation times to the end of their warranty periods. Prior to the commissioning of the building, the building services products are protected by warranty although they are not operating. Developing optimal burn-in policies for such products is important when warranty cost is analysed. This paper considers two burn-in policies, which incur different burn-in costs, and have different burn-in effects on the products. A special case about the relationship between the failure rates of the products at the dormant state and at the operating state is presented. Numerical examples compare the mean total warranty costs of these two burn-in policies.

Burn in policies for products having dormant states

Constructing a building is a long process which can take several years. Most building services products are installed while a building is constructed, but they are not operated until the building is commissioned. The warranty term for the building service systems may cover the time starting from their installation to the end of the warranty period. Prior to the commissioning of the building, the building services systems are protected by warranty although they are not operated. The bum in time for such systems is important when warranty costs is analyzed. In this paper, warranty cost models for products with burn in periods are presented. Two burn in policies are developed to optimize the total mean warranty cost. A special case on the relationship between the failure rates of the product at the dormant state and at the I operating state is presented.

Warranty cost analysis for products with a dormant state

Most building services products are installed while a building is constructed, but they are not operated until the building is commissioned. The warranty of the products may cover the time starting from their installation to the end of the warranty period. Prior to the commissioning of the building, the products are at a dormant mode (i.e., not operated) but protected by the warranty. For such products, both the usage intensity and the failure patterns are different from those with continuous usage intensity and failure patterns. This paper develops warranty cost models for repairable products with a dormant mode from both the manufacturer's and buyer's perspectives. Relationships between the failure patterns at the dormant mode and at the operational mode are also discussed. Numerical examples and sensitivity analysis are used to demonstrate the applicability of the methodology derived in the paper.

Cross validation and segment support for stereo belief propagation

Typically, algorithms for generating stereo disparity maps have been developed to minimise the energy equation of a single image. This paper proposes a method for implementing cross validation in a belief propagation optimisation. When tested using the Middlebury online stereo evaluation, the cross validation improves upon the results of standard belief propagation. Furthermore, it has been shown that regions of homogeneous colour within the images can be used for enforcing the so-called "Segment Constraint". Developing from this, Segment Support is introduced to boost belief between pixels of the same image region and improve propagation into textureless regions.

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.

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.