investigation of reliability characteristics under fuzzy environments is proposed in this paper. fuzzy weibull distribution and lifetimes of components are using it described. formulas of a fuzzy reliability function, fuzzy hazard function and their α-cut set are presented. furthermore, the fuzzy functions of series systems and parallel systems are discussed, respectively. finally, some numeric...

Determining the minimum dominating set in connected graphs is one of most difficult problems defined as NP-hard. In this problem, it aimed to determine important nodes that can influence all via number on graph. study, an efficient near optimal algorithm showing a deterministic approach has been developed different from approximation algorithms mentioned literature for discovering set. The O(n3...

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

Full terms and conditions of use:

Investigation of reliability characteristics under fuzzy environments is proposed in this paper. Fuzzy Weibull distribution and lifetimes of components are using it described. Formulas of a fuzzy reliability function, fuzzy hazard function and their α-cut set are presented. Furthermore, the fuzzy functions of series systems and parallel systems are discussed, respectively. Finally, some num...

This paper provides an analysis of capacitated network design cut–set polyhedra. We give a complete linear description of the cut–set polyhedron of the single commodity – single facility capacitated network design problem. Then we extend the analysis to single commodity – multifacility and multicommodity – multifacility capacitated network design problems. Valid inequalities described here are ...

In this article, we provide an overview on how the maximum weighted stable set problem can be solved exactly with Branch & Cut techniques. In addition, we provide selected references to other exact methods. We start with a brief introduction of the stable set problem and a few basic definitions but assuming that the reader is already familiar with the basic concepts. The main stress of this art...

We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase set theory as a theory of pointed graphs (following a paradigm due to P. Aczel) by interpreting set-theoretic equality as bisimilarity, and show that in thi...