A taxonomy of privacy-preserving record linkage techniques

The process of identifying which records in two or more databases correspond to the same entity is an important aspect of data quality activities such as data pre-processing and data integration. Known as record linkage, data matching or entity resolution, this process has attracted interest from researchers in fields such as databases and data warehousing, data mining, information systems, and machine learning. Record linkage has various challenges, including scalability to large databases, accurate matching and classification, and privacy and confidentiality. The latter challenge arises because commonly personal identifying data, such as names, addresses and dates of birth of individuals, are used in the linkage process. When databases are linked across organizations, the issue of how to protect the privacy and confidentiality of such sensitive information is crucial to successful application of record linkage.     

A survey on interference management techniques in femtocell self-organizing networks

The femtocell concept is an emerging technology for deploying the next generation of the wireless networks, aiming at indoor coverage enhancement, increasing capacity, and offloading the overlay macrocell traffic. Nevertheless, one of the most critical issues in femtocells is the potential interference between nearby femtocells and from femtocells to macrocells or to mobile handsets, thus mitigating the overall system capacity.In this paper, we have discussed mechanisms which can be deployed to lessen the interference and increase the user capacity. Therefore, we provide a survey on the different interference and resource management techniques in Self-Organizing Network according to specifics classification criteria. These techniques derive from the following approaches: power control, proper cell planning, frequency reuse, OFDMA, self-configuration and self-optimization, conventional TDD, etc. These techniques can be applied separately and can be used as hybrid. A qualitative comparison among the different approaches and techniques is provided at the end of this paper.     

A survey on routing techniques in underwater wireless sensor networks

Underwater Wireless Sensor Networks (UWSNs) are finding different applications for offshore exploration and ocean monitoring. In most of these applications, the network consists of significant number of sensor nodes deployed at different depths throughout the area of interest. The sensor nodes located at the sea bed cannot communicate directly with the nodes near the surface level; they require multi-hop communication assisted by appropriate routing scheme. However, this appropriateness depends not only on network resources and application requirements but also on environmental constraints. All these factors provide a platform where a resource-aware routing strategy plays a vital role to fulfill the different application requirements with dynamic environmental conditions. Realizing the fact, significant attention has been given to construct a reliable scheme, and many routing protocols have been proposed in order to provide an efficient route discovery between the sources and the sink. In this paper, we present a review and comparison of different algorithms, proposed recently in order to fulfill this requirement. The main purpose of this study is to address the issues like data forwarding, deployment and localization in UWSNs under different conditions. Later on, all of these are classified into different groups according to their characteristics and functionalities.     

A survey of wormhole routing techniques in direct networks

Several research contributions and commercial ventures related to wormhole routing, a switching technique used in direct networks, are discussed. The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail. By its nature, wormhole routing is particularly susceptible to deadlock situations, in which two or more packets may block one another indefinitely. Several approaches to deadlock-free. routing, along with a technique that allows multiple virtual channels to share the same physical channel, are described. In addition, several open issues related to wormhole routing are discussed     

A survey of techniques for remote access to home networks and resources

Consumer Electronics devices are becoming network enabled, and along with smart phones and personal computers, they are all interconnected in home networks with broadband Internet connectivity. This sets the opportunity of making the home network, its devices and content accessible from the Internet, allowing the home owners to remotely access their connected home any time, any place, using any device. This paper provides a holistic overview of the “Remote Acces” topic, presenting all the problems and issues that make it challenging in different contexts, and most importantly analyzing six techniques and methods for enabling the remote access scenarios. It is a guide created by the combination of scientific research, extensive industrial experiences and first hand participation in relevant standardization activities.     

Asynchronous privacy-preserving iterative computation on peer-to-peer networks

Privacy preserving algorithms allow several participants to compute a global function collaboratively without revealing local information to each other. Examples of applications include trust management, collaborative filtering, and ranking algorithms such as PageRank. Most solutions that can be proven to be privacy preserving theoretically are not appropriate for highly unreliable, large scale, distributed environments such as peer-to-peer (P2P) networks because they either require centralized components, or a high degree of synchronism among the participants. At the same time, in P2P networks privacy preservation is becoming a key requirement. Here, we propose an asynchronous privacy preserving communication layer for an important class of iterative computations in P2P networks, where each peer periodically computes a linear combination of data stored at its neighbors. Our algorithm tolerates realistic rates of message drop and delay, and node churn, and has a low communication overhead. We perform simulation experiments to compare our algorithm to related work. The problem we use as an example is power iteration (a method used to calculate the dominant eigenvector of a matrix), since eigenvector computation is at the core of several practical applications. We demonstrate that our novel algorithm also converges in the presence of realistic node churn, message drop rates and message delay, even when previous synchronized solutions are able to make almost no progress.     

无线传感网离群点检测技术研究综述

无线传感器网络(wireless sensor network,WSN)受电池能量、计算能力、通信能力和内存空间及传感数据多维特征的限制,传统的离群点检测技术不能直接应用于WSN,因此出现了一系列针对WSN的离群点检测技术.对已有的WSN离群点检测技术进行了概述,根据各离群点检测技术的特征进行了分类和分析,并结合现有技术的缺陷和需求,展望了WSN离群点检测技术的未来研究方向和目标.     

Random-data perturbation techniques and privacy-preserving data mining

Privacy is becoming an increasingly important issue in many data-mining applications. This has triggered the development of many privacy-preserving data-mining techniques. A large fraction of them use randomized data-distortion techniques to mask the data for preserving the privacy of sensitive data. This methodology attempts to hide the sensitive data by randomly modifying the data values often using additive noise. This paper questions the utility of the random-value distortion technique in privacy preservation. The paper first notes that random matrices have predictable structures in the spectral domain and then it develops a random matrix-based spectral-filtering technique to retrieve original data from the dataset distorted by adding random values. The proposed method works by comparing the spectrum generated from the observed data with that of random matrices. This paper presents the theoretical foundation and extensive experimental results to demonstrate that, in many cases, random-data distortion preserves very little data privacy. The analytical framework presented in this paper also points out several possible avenues for the development of new privacy-preserving data-mining techniques. Examples include algorithms that explicitly guard against privacy breaches through linear transformations, exploiting multiplicative and colored noise for preserving privacy in data mining applications.     

A survey on expert finding techniques

Finding experts in specified areas is an important task and has attracted much attention in the information retrieval community. Research on this topic has made significant progress in the past few decades and various techniques have been proposed. In this survey, we review the state-of-the-art methods in expert finding and summarize these methods into different categories based on their underlying algorithms and models. We also introduce the most widely used data collection for evaluating expert finding systems, and discuss future research directions.     

A survey on clustering algorithms for wireless sensor networks

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.     

A survey on service-oriented middleware for wireless sensor networks

Wireless sensor networks (WSN) are used for many applications such as environmental monitoring, infrastructure security, healthcare applications, and traffic control. The design and development of such applications must address many challenges dictated by WSN characteristics on one hand and the targeted applications on the other. One of the emerging approaches used for relaxing these challenges is using service-oriented middleware (SOM). Service-oriented computing, in general, aims to make services available and easily accessible through standardized models and protocols without having to worry about the underlying infrastructures, development models, or implementation details. SOM could play an important role in facilitating the design, development, and implementation of service-oriented systems. This will help achieve interoperability, loose coupling, and heterogeneity support. Furthermore, SOM approaches will provision non-functional requirements like scalability, reliability, flexibility, and Quality of Service (QoS) assurance. This paper surveys the current work in SOM and the trends and challenges to be addressed when designing and developing these solutions for WSN.     

A scheme for privacy-preserving data dissemination

An adequate level of trust must be established between prospective partners before an interaction can begin. In asymmetric trust relationships, one of the interacting partners is stronger. The weaker partner can gain a higher level of trust by disclosing private information. Dissemination of sensitive data owned by the weaker partner starts at this moment. The stronger partner can propagate data to others, who may then choose to spread data further. The proposed scheme for privacy-preserving data dissemination enables control of data by their owner (such as a weaker partner). It relies on the ideas of bundling sensitive data with metadata, an apoptosis of endangered bundles, and an adaptive evaporation of bundles in suspect environments. Possible applications include interactions among patients and healthcare providers, customers and businesses, researchers, and suppliers of their raw data. They will contribute to providing privacy guarantees, which are indispensable for the realization of the promise of pervasive computing.     

A survey of pricing for integrated service networks

Advances in technology have greatly increased the demand for a single integrated service network that can provide multiple service classes for different user requirements. For such a multiple-service network, congestion control is one of the key issues to be addressed. However, without an appropriate mechanism to encourage end users to use the network properly, over-utilization and congestion are unavoidable. For this problem, it is widely accepted that pricing is a proper tool to manage congestion, encourage network growth, and allocate resource to users in a fair manner. However, how to charge for the traffic and at what price is still under study. In this paper, we first briefly review the state of the art and technological growth of congestion control for integrated service networks (ISN). Subsequently, we present a summary of the recent developments on various pricing policies and different charging and billing schemes that have been proposed for ATM and Internet Differentiated Services. Some architecture and implementation issues are also discussed. Finally, some future trends are identified.     

A hybrid approach for privacy-preserving RFID tags

Recently, there have been a considerable amount of works for privacy-preserving RFID tags. However, most existing schemes have a common, inherent problem in the fact that in order to identify only one single tag they require a linear computational complexity on the system side. This problem makes use of the schemes impractical in large-scale RFID deployments. We propose a new scheme for privacy-preserving RFID tags which combines the classical challenge-response mechanism with the idea of one-time pads in a simple but practical way. Our technique has a number of crucial advantages. It supports mutual authentication between reader and tag. It also supports untraceability with no information leakage. Furthermore, the scheme we present requires only one cryptographic operation to identify one device among N, which is an important benefit in large-scale RFID systems.     

A survey of techniques for inference under uncertainty

The field of automated inference under uncertainty is too large and too young for elegant, unified presentation. We present, rather, a discussion of the principal techniques under some broad classifications. For the most important or least known techniques, we present, as appendices, introductory tutorials in order to give the reader some idea of the basic methods involved; other techniques we describe more briefly. First, after this introduction, we must cover some basic terms and philosophical ideas.     

A survey on independence-based Markov networks learning

The problem of learning the Markov network structure from data has become increasingly important in machine learning, and in many other application fields. Markov networks are probabilistic graphical models, a widely used formalism for handling probability distributions in intelligent systems. This document focuses on a technology called independence-based learning, which allows for the learning of the independence structure of Markov networks from data in an efficient and sound manner, whenever the dataset is sufficiently large, and data is a representative sample of the target distribution. In the analysis of such technology, this work surveys the current state-of-the-art algorithms, discussing its limitations, and posing a series of open problems where future work may produce some advances in the area, in terms of quality and efficiency.     

随机进程代数新技术综述

本文以PEPA语言为例,对近年来发展起来的随机进程代数的缓解状态空间爆炸问题的新技术做一个综述．     

A survey on participating media rendering techniques

Rendering participating media is important for a number of domains, ranging from commercial applications (entertainment, virtual reality) to simulation systems (driving, flying, and space simulators) and safety analyses (driving conditions, sign visibility). This article surveys global illumination algorithms for environments including participating media. It reviews both appearance-based and physically-based media methods, including the single-scattering and the more general multiple-scattering techniques. The objective of the survey is the characterization of all these methods: identification of their base techniques, assumptions, limitations, and range of utilization. It concludes with some reflections about the suitability of the methods depending on the specific application involved, and possible future research lines.