Exploring album structure for face recognition in online social networks

In this paper, we propose an album-oriented face-recognition model that exploits the album structure for face recognition in online social networks. Albums, usually associated with pictures of a small group of people at a certain event or occasion, provide vital information that can be used to effectively reduce the possible list of candidate labels. We show how this intuition can be formalized into a model that expresses a prior on how albums tend to have many pictures of a small number of people. We also show how it can be extended to include other information available in a social network. Using two real-world datasets independently drawn from Facebook, we show that this model is broadly applicable and can significantly improve recognition rates.     

Detecting stable locality-aware predicates

In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k$k$ rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k$k$-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.     

A parallel algorithm with enhancements via partial objective value cuts for cluster-based wireless sensor network design

In this paper, we develop a parallel algorithm for the solution of an integrated topology control and routing problem in Wireless Sensor Networks (WSNs). After presenting a mixed-integer linear optimization formulation for the problem, for its solution, we develop an effective parallel algorithm in a Master–Worker model that incorporates three parallelization strategies, namely low-level parallelism, domain decomposition, and multiple search (both cooperative and independent) in a single Master–Worker framework.     

Self-scaling cooperative discovery of service compositions in unstructured P2P networks

We propose an efficient technique for improving the performance of automatic and cooperative compositions in unstructured Peer-to-Peer networks during service discovery. The technique exploits a probabilistic forwarding algorithm that uses different sources of knowledge, such as network density and service grouping, to reduce the amount of messages exchanged in the network. The technique, analysed in several network configurations by using a simulator to observe resolution time, recall and message overhead, presents good performance especially in dense and large-scale service networks.     

Time-optimized contextual information forwarding in mobile sensor networks

We study on the forwarding of quality contextual information in mobile sensor networks (MSNs). Mobile nodes form ad-hoc distributed processing networks that produce accessible and quality-stamped information about the surrounding environment. Due to the dynamic network topology of such networks the context quality indicators seen by the nodes vary over time. A node delays the context forwarding decision until context of better quality is attained. Moreover, nodes have limited resources, thus, they have to balance between energy conservation and quality of context. We propose a time-optimized, distributed decision making model for forwarding context in a MSN based on the theory of optimal stopping. We compare our findings with certain context forwarding schemes found in the literature and pinpoint the advantages of the proposed model.     

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.     

PRIVACY LEAKAGE IN HEALTH SOCIAL NETWORKS

Members of health social networks may be susceptible to privacy leaks by the amount of information they leave behind. The threat to privacy increases when members of these networks reuse their pseudonyms in other social networks. The risk of re‐identifying users from such networks requires quantitative estimates to evaluate its magnitude. The estimates will enable managers and members of health social communities to take corrective measures. We introduce a new re‐identification attack, the social network attack, that takes advantage of the fact that users reuse their pseudonyms. To demonstrate the attack, we establish links between MedHelp and Twitter (two popular social networks) based on matching pseudonyms. We used Bayesian networks to model the re‐identification risk and used stylometric techniques to identify the strength of the links. On the basis of our model 7‐11. 8% of the MedHelp members in the sample population who reused their pseudonyms in Twitter were re‐identifiable compared with 1% who did not. The risk estimates were measured at the 5% risk threshold. Our model was able to re‐identify users with a sensitivity of 41% and specificity of 96%. The potential for re‐identification increases as more data is accumulated from these profiles, which makes the threat of re‐identification more serious.     

Inferring social nature of conversations from words: Experiments on a corpus of everyday telephone conversations

Language is being increasingly harnessed to not only create natural human–machine interfaces but also to infer social behaviors and interactions. In the same vein, we investigate a novel spoken language task, of inferring social relationships in two-party conversations: whether the two parties are related as family, strangers or are involved in business transactions. For our study, we created a corpus of all incoming and outgoing calls from a few homes over the span of a year. On this unique naturalistic corpus of everyday telephone conversations, which is unlike Switchboard or any other public domain corpora, we demonstrate that standard natural language processing techniques can achieve accuracies of about 88%, 82%, 74% and 80% in differentiating business from personal calls, family from non-family calls, familiar from unfamiliar calls and family from other personal calls respectively. Through a series of experiments with our classifiers, we characterize the properties of telephone conversations and find: (a) that 30 words of openings (beginnings) are sufficient to predict business from personal calls, which could potentially be exploited in designing context sensitive interfaces in smart phones; (b) our corpus-based analysis does not support Schegloff and Sack's manual analysis of exemplars in which they conclude that pre-closings differ significantly between business and personal calls – closing fared no better than a random segment; and (c) the distribution of different types of calls are stable over durations as short as 1–2 months. In summary, our results show that social relationships can be inferred automatically in two-party conversations with sufficient accuracy to support practical applications.     

An adaptive neural control scheme for articulatory synthesis of CV sequences

Reproducing the smooth vocal tract trajectories is critical for high quality articulatory speech synthesis. This paper presents an adaptive neural control scheme for such a task using fuzzy logic and neural networks. The control scheme estimates motor commands from trajectories of flesh-points on selected articulators. These motor commands are then used to reproduce the trajectories of the underlying articulators in a 2nd order dynamical system. Initial experiments show that the control scheme is able to manipulate the mass-spring based elastic tract walls in a 2-dimensional articulatory synthesizer and to realize efficient speech motor control. The proposed controller achieves high accuracy during on-line tracking of the lips, the tongue, and the jaw in the simulation of consonant–vowel sequences. It also offers salient features such as generality and adaptability for future developments of control models in articulatory synthesis.