We use stochastic geometry to analyze the performance of a partial decode-and-forward (PDF) relaying scheme applied in a user-assisted relaying setting, where an active user relays data through another idle user in uplink cellular communication. We present the geometric model of a network deploying user-assisted relaying and propose two geometric cooperation policies for fast and slow fading ch...

Among mobile users, ad-hoc social network (ASN) is becoming a popular platform to connect and share their interests anytime anywhere. Many researchers and computer scientists investigated ASN architecture, implementation, user experience, and different profile matching algorithms to provide better user experience in ad-hoc social network. We emphasize that strength of an ad-hoc social network d...

Semantic knowledge has been adopted recently for SMT preprocessing, decoding and evaluation, in order to be able to compare sentences based on their meaning rather than on mere lexical and syntactic similarity. Little attention has been paid to semantic knowledge in the context of integrating fuzzy matches from a translation memory with SMT. We present work in progress which focuses on semantic...

Knowledge Base Population (KBP) tasks, such as slot filling, show the particular importance of entity-oriented automatic relevant document acquisition. Rich, diverse and reliable relevant documents satisfy the fundamental requirement that a KBP system explores the nature of an entity. Towards the bottleneck problem between comprehensiveness and definiteness of acquisition, we propose a collabor...

When applying rules produced by induction from training examples to a test example, there are three possible cases that demand different actions: (i) no match; (ii) single match; and (iii) multiple match. Existing techniques for dealing with the "rst and third cases are exclusively based on probability estimation. However, when there are continuous attributes in the example space, and if these ...

This paper proposes a new double-private protocol for fuzzy matching and -fuzzy matching. Many works have been done for private database search in which the keyword that a user inputs for the search is concealed to the database owner. In these database searches, the exactly matched data are returned to the user. Fuzzy matching has been proposed in which not exactly matched but nearly matched da...