potato image segmentation is an important part of image-based potato defect detection. this paper presents a robust potato color image segmentation through a combination of a fuzzy rule based system, an image thresholding based on genetic algorithm (ga) optimization and morphological operators. the proposed potato color image segmentation is robust against variation of background, distance and ...

The task of fault detection is important when dealing with failures of crucial nature. After detection of faults in a system, it is advisable to suggest maintenance action before occurrence of a failure. Fault detection may be done by observing various symptoms of the system during its operational stage. Sometimes, symptoms cannot be quantified easily but can be expressed in linguistic terms. S...

AB STRACT. The role of inferencing with uncertainty is becoming more important in rule-based expert systems (ES) , since knowledge given by a human expert is often uncertain or imprecise. We have succeeded in designing a VLSI chip which can perform an entire inference process based on fuzzy logic. The design of the VLSI fuzzy inference engine emphasizes simplicity, extensibility, and efficiency...

Probabilistic model checking is a powerful formal verification method that can ensure the correctness of real-life systems that exhibit stochastic behaviour. The work presented in this thesis aims to solve the scalability challenge of probabilistic model checking, by developing, for the first time, fully-automated compositional verification techniques for probabilistic systems. The contribution...

This paper shows the use of Fingrams –Fuzzy Inference-grams– aimed at unveiling graphically some hidden details in the usual behavior of the precise fuzzy modeling algorithm FURIA –Fuzzy Unordered Rule Induction Algorithm–. FURIA is recognized as one of the most outstanding fuzzy rule-based classification methods attending to accuracy. Although FURIA usually produces compact rule bases, with lo...

We present a general framework to support the compositional verification of timed systems using the interactive theorem prover PVS. The framework is based on timed traces that are an abstraction of the timed semantics of flat UML state machines. We define a compositional proof rule for parallel composition and prove its soundness in PVS. After composition, a hiding rule can be applied to hide i...