When designing model-based fault-diagnosis systems, the use of consistency relations (also called e.g. parity relations) is a common choice. Different subsets are sensitive to different subsets of faults, and thereby isolation can be achieved. This paper presents an algorithm for finding a small set of submodels that can be used to derive consistency relations with highest possible diagnosis ca...

When designing model-based fault-diagnosis systems, the use of consistency relations (also called e.g. parity relations) is a common choice. Different subsets are sensitive to different subsets of faults, and thereby isolation can be achieved. This paper presents an algorithm for finding a small set of submodels that can be used to derive consistency relations with highest possible diagnosis ca...

Decomposing graphs into simpler graphs is one of the central concerns of graph theory. Investigations have revealed deep concepts such as modular decomposition, tree width or rank width, which measure—in different ways—the structural complexity of a graph’s topology. Courcelle and others have shown that such concepts can be used to obtain efficient algorithms for families of graphs that are ame...

A novel mineral slurry assaying method combining visible and near-infrared reflectance spectroscopy and traditional X-ray fluorescence has recently been developed. The improved method is capable of high-frequency assaying of slurry grades in zinc and copper flotation, thus being able to reveal possible rapid oscillations in the grades. In this study, the new measurements are used to detect osci...

In this paper we propose novel methods for compression and recovery of multilinear data under limited sampling. We exploit the recently proposed tensorSingular Value Decomposition (t-SVD)[1], which is a group theoretic framework for tensor decomposition. In contrast to popular existing tensor decomposition techniques such as higher-order SVD (HOSVD), t-SVD has optimality properties similar to t...

In the paper a probabilistic approach to quality assessment of image processing algorithms is proposed. Presented scalar measure can be used for any colour space and gives very similar results regardless on the image content. It can be an interesting supplement to existing image quality metrics in applications where the details of the processing algorithm are known. Its good correlation with su...

in this paper, we use modified laplace decomposition method to solving initial value problems (ivp) of the second order ordinary differential equations. theproposed method can be applied to linear and nonlinearproblems

Many real discrete optimization problems (DOPs) are NP -hard and contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. Large DOPs can be solved due to their special structure using decomposition approaches. An important example of decomposition approaches is tree decomposition with local decomposition algorithms using the special...