Data deduplication is the specialized and resent compression technology in the cloud computing. In hybrid cloud server storing of repeated data courses many storage management challenges. The data deduplication overcome this challenges by reduce the copy of data and save the space in the cloud service provider (CSP). It also saves the bandwidth of the storage cloud. This deduplication method pr...

We present a relatively simple description of binary, definable subsets models weakly quasi-o-minimal theories. In particular, we closely describe linear orders and prove weak version the monotonicity theorem. also that quasi-o-minimality theory with respect to one order implies any other such order.

study of validity of implications of proofs is among fundamental discussions in both usul al-fiqh and fiqh. authorized conjectural proofs (amarat) and practical principles can have indirect juristic implications as they have direct ones. investigation of validity of such indirect implications and effects is entitled investigation of validity of implications of proofs. some usulis hold that impl...

We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all minimal subsets of a given DL-Lite knowledge base that have a given consequence. We show that for theDL-Litecore,DL-Litekrom andDLLiteHN horn fragments such minimal subsets are efficiently enumerable with polynomial dela...

Reasoning with inconsistent ontologies is to use an inconsistency reasoner to get meaningful answers from inconsistent ontologies. In this paper, we propose an improved inconsistency reasoner which selects some consistent subsets by using minimal inconsistent sets(MIS) and a resolution method to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a ...

We present several complexity results related to generation and counting of all circuits of an independence system. Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously. We are interested in the circuits of this system, the so-called m...

Call an hypergraph, that is a family of subsets (edges) from a finite vertex set, an exact transversal hypergraph iff each of its minimal transversals, i.e., minimal vertex subsets that intersect each edge, meets each edge in a singleton. We show that such hypergraphs are recognizable in polynomial time and that their minimal transversals as well as their maximal independent sets can be generat...

The study of minimal complements in a group or semigroup was initiated by Nathanson. notion and being complement leads to the co-minimal pairs which considered prior work authors. In this article, we type subsets integers free abelian groups higher rank can be part pair. We show that majority lacunary sequences have property. From conditions established, one any infinite subset finitely generat...