Fault Tree Analysis (FTA) as a Probabilistic Risk Assessment (PRA) method is used to identify basic causes leading to an undesired event, to represent logical relation of these basic causes in leading to the event, and finally to calculate the probability of occurrence of this event. To conduct a quantitative FTA, one needs a fault tree along with failure data of the Basic Events (BEs). Someti...

This paper discusses the problem of selecting the minimal set of events to be communicated between decentralized supervisory controllers in order for the behavior of a controller system to match a given specification. This optimization problem is known to be computationally difficult, so this paper discusses the problem of approximating this set of communicated events. It is shown how the commu...

We study the problem k-Set Splitting in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k), improving on the best currently known running time of O∗(8k). This is done by showing that a non-trivial instance must have a small minimal Set Cover, and using this to reduce the problem to a series of small instances of Max Sat. We also give a linear kernel containin...

SUMMARY Component importance analysis is a key part of the system reliability quantification process. It enables the weakest areas of a system to be identified and indicates modifications, which will improve the system reliability. Although a wide range of importance measures have been developed, the majority of these measures are strictly for coherent system analysis. Non-coherent systems can ...

A new result report for Mascot search results is described. A greedy set cover algorithm is used to create a minimal set of proteins, which is then grouped into families on the basis of shared peptide matches. Protein families with multiple members are represented by dendrograms, generated by hierarchical clustering using the score of the nonshared peptide matches as a distance metric. The pept...

We study the problem k-SET SPLITTING in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k), improving on the best currently known running time of O∗(8k). This is done by showing that a non-trivial instance must have a small minimal SET COVER, and using this to reduce the problem to a series of small instances of MAX SAT. We also give a linear kernel containin...

Hemodynamic measurements were recorded every 30 minutes in 4 (porcine model) trials of 4 hours. Animals received a 0.5mg/kg endotoxin infusion over the first 30 minutes and underwent zero-balance continuous veno-venous filtration with 0.7m large pore substrate (80kDa cut-off) from 60 minutes onwards [1]. Subject-specific CVS models were fitted to 34 sets of data from the four trials. Each data ...

Background: HbA1C has been a known predictor and diagnostic test for diabetes type 2. However, this test has not yet been widely studied in GDM and more importantly no cutoff point has been defined for HbA1C in GDM. We investigated the efficacy of screening during first and second trimester of pregnancy and defined appropriate cutoff points according to HbA1C and FBS for predicting maternal GDM...

Sufficient conditions are given for an elementary quotient of the kth Dilworth truncation of a matroid M to be the kth Dilworth truncation of a quotient of M. As special cases, contractions of Dilworth truncations and principal truncations by connected flats of Dilworth truncations are characterised as Dilworth truncations of certain matroids. As an application of the theory it is shown that th...

The cut sets of a graph are special vertices whose removal disconnects the graph. They fundamental in study binomial edge ideals, since they encode their minimal primary decomposition. We introduce class accessible graphs as with unmixed ideal and form an set system. prove that is Cohen-Macaulay we conjecture converse holds. settle for large classes graphs, including chordal traceable providing...