This paper proposes an efficient cut set approach to enumerate the subsets cut groups (SCG) from apriori knowledge of minimal cutsets of a network. These SCG block a given amount of flow through the network despite the network being (s, t) connected and are being used to evaluate capacity related reliability (CRR) by employing any sum of disjoint product approach. For each minimal cutset and a ...

Reaction systems were introduced by Ehrenfeucht and Rozenberg with biochemical applications in mind. The model is suitable for the study of subset functions, that is, functions from the set of all subsets of a finite set into itself. In this study the number of resources of a reaction system is essential for questions concerning generative capacity. While all functions (with a couple of trivial...

Interfacial charge transport and mobility have been studied in system-spanning nanodroplet clusters formed in water-in-oil microemulsions stabilized by non-ionic-ionic surfactant mixtures. An unexpectedly large reduction in the counterion mobility was derived from a two-step adsorption process which described the Langmuir-plot-like conductivity isotherm remarkably well. It also conformed very s...

Distributed key generation cryptosystems has a major content called distributed key generation (DKG) protocol. This protocol allows number of participants of group to generate a set of keys such as private key and public key without determining some trusted participants. Only authorized subgroups of participants are capable to regenerate or implement the private key and the public key is an out...

Let R be a commutative ring with identity and Mbe a unitary R-module. In this paper we generalize the conceptmultiplicatively closed subset of R and we study some propertiesof these genaralized subsets of M. Among the many results in thispaper, we generalize some well-known theorems about multiplicativelyclosed subsets of R to these generalized subsets of M. Alsowe show that some other well-kno...

This paper surveys some recent results on the generation of implicitly given hypergraphs and their applications in Boolean and integer programming, data mining, reliability theory, and combinatorics. Given a monotone property π over the subsets of a finite set V , we consider the problem of incrementally generating the family Fπ of all minimal subsets satisfying property π, when π is given by a...

We study (h)-minimal configurations in Aubry-Mather theory, where h belongs to a complete metric space of functions. Such minimal configurations have definite rotation number. We establish the existence of a set of functions, which is a countable intersection of open everywhere dense subsets of the space and such that for each element h of this set and each rational number α, the following prop...