Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In general, given k (preprocessed) sets, with totally n elements, we will show how to compute their intersection in expected time O(n/ √ w + kr), where r is the ...

In this paper we consider the problem of privately computing the set-intersection (private matching) of sets, as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual set. In threshold set-i...

Ordered Binary Decision Diagrams (OBDDs for short) are popular dynamic data structures for Boolean functions. In some modern applications, we have to handle such huge graphs that the usual explicit representations by adjacency lists or adjacency matrices are infeasible. To deal with such huge graphs, OBDD-based graph representations and algorithms have been investigated. Although the size of OB...

Secure computation of the set intersection functionality allows n parties to find the intersection between their datasets without revealing anything else about them. An efficient protocol for such task could have multiple potential applications, in commerce, health-care, and security. However, all currently known secure set intersection protocols for n > 2 parties have computational costs that ...

Ontology is a requirement engineering product and the key to knowledge discovery. It includes the terminology to describe a set of facts, assumptions, and relations with which the detailed meanings of vocabularies among communities can be determined. This is a qualitative content analysis research. This study has made use of ontology for the first time to discover the knowledge of vaccine in Ir...

For a binary code of length v, a v-word w produces by a set of codewords {w, . . . , w} ✓ if for all i = 1, . . . , v, we have wi 2 {w i , . . . , w i }. We call a code r-secure frameproof of size t if | | = t and for any v-word that is produced by two sets C1 and C2 of size at most r, then the intersection of these sets is non-empty. A d-biclique cover of size v of a graph G is a collection of...

An intriguing theme in graph theory is that of the intersection graph of a family of subsets of a set: the vertices of the graph are represented by the subsets of the family and adjacency is defined by a non-empty intersection of the corresponding subsets. Prime examples are interval graphs and chordal graphs. An interval graph is the intersection graph of a family of closed intervals on the re...

An attack graph is a data structure representing how an attacker can chain together multiple attacks to expand their influence within a network (often in an attempt to reach some set of goal states). Restricting attack graph size is vital for the execution of high degree polynomial analysis algorithms. However, we find that the most widely-cited and recently-used ‘condition/exploit’ attack grap...

In this paper we consider the problem of privately computing the intersection of sets (setintersection), as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual threshold set. In threshold ...

In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in P n+1 , starting with a single set-theoretic complete intersection monomial curve in P n. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing.