No abstract

No abstract

No abstract

No abstract

Semantic text similarity (STS) uses specific test collections as its performance evaluation measurement. The test collections consist of text pairs with the same meaning even though in different text form. The existence is scarce compared with information retrieval (IR) test collections. This paper investigates the possibility to reuse IR test collections for STS tasks. Text pairs are derived from the relevant pair of IR test collections. Latent semantic analysis (LSA) and explicit semantic analysis (ESA) evaluate Glasgow's test collections, which are provided by ACM SIGIR community. Jaccard index measures the lexical similarity. Recall metric measures retrievability of recycling test collection with two existing test collections, Microsoft research paraphrase corpus and Microsoft research video description corpus, as evaluation baselines. Evaluation yields a promising outcome; the evaluated test collections have low Jaccard index and their recall values between the two baselines.

No abstract

Some types of social networking applications installed in the mobile devices require users to share own locations while using them. Adversaries glean users' private information through shared locations via social networking application and public available geographic data. In this paper, we propose a user sensitive privacy-preserving location sharing system to avoid leaking. Users define sensitivity profiles to transform the public available geographic data into personal obfuscate region maps. Shared locations from obfuscate region maps provide close enough coordinates for application to use, but disconnected correlation between exact public available geographic data and user's actual location to prevent malicious tracking.

SUMMARYIn this letter, we reveal redundant control traffic in the optimized link state routing protocol (OLSR) for MANET. Topology control (TC) messages, which occupy a part of control traffic in OLSR, are used to exchange topology information with other nodes. TC messages are generated and forwarded by only nodes that have been selected as multipoint relays (MPRs) by at least one neighbor node. These nodes selected as MPRs are called TC message senders in this letter. One of solutions to reduce the number of TC messages is to reduce the number of TC message senders. We describe a non-distributed algorithm to minimize the number of TC message senders. Through simulation of static-node scenarios, we show 18% to 37% of TC message senders in RFC-based OLSR are redundant. By eliminating redundant TC message senders, the number of TC packets, each of which contains one or more TC messages, is also reduced from 19% to 46%. We also show that high density scenarios have more redundancy than low density scenarios. This observation can help to consider a cooperative MPR selection in OLSR.