1 Stable 2-Pairs and (X; Y)-Intersection Graphs 2 Abstract Given two xed graphs X and Y , the (X; Y)-intersection graph of a graph G is a graph where 1. each vertex corresponds to a distinct induced subgraph in G that is iso-morphic to Y , and 2. two vertices are adjacent ii the intersection of their corresponding sub-graphs contains an induced subgraph isomorphic to X. This notion generalizes ...

in this paper we will determine the multiple point manifolds of certain self-transverse immersions in euclidean spaces. following the triple points, these immersions have a double point self-intersection set which is the image of an immersion of a smooth 5-dimensional manifold, cobordant to dold manifold $v^5$ or a boundary. we will show there is an immersion of $s^7times p^2$ in $mathbb{r}^{13...

This is a continuation of ``Bipartite Distance-regular Graphs, Part I''. We continue our study of the Terwilliger algebra T of a bipartite distance-regular graph. In this part we focus on the thin irreducible T-modules of endpoint 2 and on those distance-regular graphs for which every irreducible T-module of endpoint 2 is thin. 8. Introduction to Part II Let G ˆ …X ;E† denote a bipartite distan...

Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party set-intersection computation based-on anonymous IBE (identity-based encryption) scheme and its user private-keys blind generation techniques. Compared with related works, this construction is provably GUC(generalized un...

Private set operations allow correlation of sensitive data from multiple data owners. Although intensely researched, current solutions still exhibit limited scalability in terms of the supported maximum set size and number of sets. To address these issues, we propose a new approach to private set operations based on a combination of efficient secure multiparty computation and bloom filters, a s...