Causal discovery studies the problem of mining causal relationships between variables from data, which is of primary interest in science. During the past decades, significant amount of progresses have been made toward this fundamental data mining paradigm. Recent years, as the availability of abundant large-sized and complex observational data, the constrain-based approaches have gradually attr...

The availability of complete algorithms for constraint-based mining of formal concepts (e.g., frequent ones) enables to process large boolean datasets and can be used in many application domains. Considering noisy data, it seems important to extend formal concepts towards fault-tolerance. We embed formal concept extraction into a more general framework for constraint-based mining of bi-sets, i....

In this research, a mathematics model is proposed to describe the mission availability for bounded-cumulative-downtime system. In the proposed model, the cumulative downtime and cumulative uptime are considered as constraints simultaneously. The mission availability can be defined as the probability that all repairs do not exceed the bounded cumulative downtime constraint of such system before ...

the present paper deals with development of a simulation model for the performance evaluation of feed water system of a thermal power plant using markov birth-death process and probabilistic approach. in present paper, the feed water system consists of four subsystems. after drawing transition diagram for feed water system, differential equations are developed and then solved recursively using ...

Summary: FBA-SimVis is a VANTED plug-in for the constraintbased analysis of metabolic models with special focus on the visual exploration of metabolic flux data resulting from model analysis. The program provides a user-friendly environment for model reconstruction, constraint-based model analysis, and interactive visualisation of the simulation results. With the ability to quantitatively analy...

Due to the availability of powerful SAT solvers, propositional encoding is a successful technique of solving constraint systems over finite domains. As these domains are often flat and non-structured, the CO4 compiler aims to extend this concept by enriching the underlying domain with user-defined algebraic data types. Syntactically, CO4 is a subset of Haskell and allows to specify constraint s...

The form of representations is typically considered to be conditioned by three things: the nature and availability of domain regularities, the perceptual and cognitive abilities of individuals, and the properties of the medium used to construct a representation. This paper reports on an experimental investigation of a fourth constraint on representational form; communicative use. Subjects were ...

We propose the use of Soft Constraints as a natural way to model Service Oriented Architecture. In the framework, constraints are used to model components and connectors and constraint aggregation is used to represent their interactions. The “quality of a service” is measured and considered when performing queries to service providers. Some examples consist in the levels of cost, performance an...