A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification problems. The derived algorithms include αexpansion graph cut techniques merely as a special case, have guaranteed optimality properties even in cases where α-expansion techniques fail to do so and can provide very tig...

The exemplar-based data clustering problem can be formulated as minimizing an energy function defined on a Markov random field (MRF). However, most algorithms for optimizing MRF energy function can’t be directly applied to the task of clustering, as the problem has a high-order energy function. In this paper, we first show that the high order energy function for the clustering problem can be si...

In this work structural reliability assessment is presented for structures with uncertain loads and material properties. Uncertain variables are modeled as fuzzy random variables and Interval Monte Carlo Simulation along with interval finite element method is used to evaluate failure probability. Interval Monte Carlo is compared with existing search algorithms used in the reliability assessment...

Statistical control charts are useful tools in monitoring the state of a manufacturing process. Control charts are used to plot process data and compare it to the limits set for the process. Points plotting outside these limits indicate an out-of-control condition. Standard control charting procedures, however, are limited in that they cannot take into account the case when data is of a fuzzy n...

This paper presents a practical analytical approach to evaluating continuous, monotonic functions of independent fuzzy numbers. The approach is based on a parametric α-cut representation of fuzzy numbers and allows for the inclusion of parameter uncertainties into mathematical models.

Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...

During the last years, the concept of input congestion and technical ineff-ciency in data envelopment analysis (DEA), have been investigated by manyresearchers. The motivation of this paper is to present models which obtain thedecreased output value due to input congestion and technical ineciency. More-over, we extend the models to estimate input congestion, technical ineciencyand output reduct...

We propose an holographic k-essence and dilaton models of dark energy. The correspondence between the k-essence and dilaton energy densities with the holographic density, allows the reconstruction of the potential and the fields for the k-essence and dilaton models in flat FRW background. For the proposed infrared cut-off the reconstruction was made for the two cases of the constant α: for α < ...

We consider the approximability of k-way Hypergraph Cut problem: the input is an edge-weighted hypergraph G = (V, E) and an integer k and the goal is to remove a min-weight subset of the edges such that the residual graph has at least k connected components. When G is a graph this problem admits a 2(1 − 1/k)-approximation [8], however, there has been no non-trivial approximation ratio for gener...