OpenRaiser/Intern-Atlas huggingface dataset:
Improving data utility in differential privacy and k-anonymity
Venue: arXiv cs.CR 2013
Year: 2013

We focus on two mainstream privacy models: k-anonymity and differential privacy. Once a privacy model has been selected, the goal is to enforce it while preserving as much data utility as possible. The main objective of this thesis is to improve the data utility in k-anonymous and differentially private data releases. k-Anonymity has several drawbacks. On the disclosure limitation side, there is a lack of protection against attribute disclosure and against informed intruders. On the data utility side, dealing with a large number of quasi-identifier attributes is problematic. We propose a relaxation of k-anonymity that deals with these issues. Differential privacy limits disclosure risk through noise addition. The Laplace distribution is commonly used for the random noise. We show that the Laplace distribution is not optimal: the same disclosure limitation guarantee can be attained by adding less noise. Optimal univariate and multivariate noises are characterized and constructed. Common mechanisms to attain differential privacy do not take into account the users prior knowledge; they implicitly assume zero initial knowledge about the query response. We propose a mechanism that focuses on limiting the knowledge gain over the prior knowledge. Microaggregation-based k-anonymity and differential privacy can be combined to produce microdata releases with the strong privacy guarantees of differential privacy and improved data accuracy. The last contribution delves into the relation between t-closeness and differential privacy. We see that for a specific distance and under some reasonable assumptions on the intruders knowledge, t-closeness leads to differential privacy.
Handover adaptation for dynamic load balancing in 3gpp long term evolution systems
Venue: arXiv cs.NI 2013
Year: 2013

The long-Term Evolution (LTE) of the 3GPP (3rd Generation Partnership Project) radio access network is in early stage of specification. Self-tuning and self-optimisation algorithms are currently studied with the aim of enriching the LTE standard. This paper investigates auto-tuning of LTE mobility algorithm. The auto-tuning is carried out by adapting handover parameters of each base station according to its radio load and the load of its adjacent cells. The auto-tuning alleviates cell congestion and balances the traffic and the load between cells by handing off mobiles close to the cell border from the congested cell to its neighbouring cells. Simulation results show that the auto-tuning process brings an important gain in both call admission rate and user throughput.
A heterogeneous many-core platform for experiments on scalable custom interconnects and management of fault and critical events, applied to many-process applications: Vol. II, 2012 technical report
Venue: arXiv cs.DC 2013
Year: 2013

This is the second of a planned collection of four yearly volumes describing the deployment of a heterogeneous many-core platform for experiments on scalable custom interconnects and management of fault and critical events, applied to many-process applications. This volume covers several topics, among which: 1- a system for awareness of faults and critical events (named LO|FA|MO) on experimental heterogeneous many-core hardware platforms; 2- the integration and test of the experimental hardware heterogeneous many-core platform QUoNG, based on the APEnet+ custom interconnect; 3- the design of a Software-Programmable Distributed Network Processor architecture (DNP) using ASIP technology; 4- the initial stages of design of a new DNP generation onto a 28nm FPGA. These developments were performed in the framework of the EURETILE European Project under the Grant Agreement no. 247846.
Constructing Hierarchical Image-tags Bimodal Representations for Word Tags Alternative Choice
Venue: arXiv cs.LG 2013
Year: 2013

This paper describes our solution to the multi-modal learning challenge of ICML. This solution comprises constructing three-level representations in three consecutive stages and choosing correct tag words with a data-specific strategy. Firstly, we use typical methods to obtain level-1 representations. Each image is represented using MPEG-7 and gist descriptors with additional features released by the contest organizers. And the corresponding word tags are represented by bag-of-words model with a dictionary of 4000 words. Secondly, we learn the level-2 representations using two stacked RBMs for each modality. Thirdly, we propose a bimodal auto-encoder to learn the similarities/dissimilarities between the pairwise image-tags as level-3 representations. Finally, during the test phase, based on one observation of the dataset, we come up with a data-specific strategy to choose the correct tag words leading to a leap of an improved overall performance. Our final average accuracy on the private test set is 100%, which ranks the first place in this challenge.
Building Bricks with Bricks, with Mathematica
Venue: arXiv cs.MS 2013
Year: 2013

In this work we solve a special case of the problem of building an n-dimensional parallelepiped using a given set of n-dimensional parallelepipeds. Consider the identity x^3 = x(x-1)(x-2)+3x(x-1+x). For sufficiently large x, we associate with x^3 a cube with edges of size x, with x(x-1)(x-2) a parallelepiped with edges x, x-1, x-2, with 3x(x-1+x) three parallelepipeds of edges x, x-1, 1, and with x a parallelepiped of edges x, 1, 1. The problem we takle is the actual construction of the cube using the given parallelepipeds. In [DDNP90] it was shown how to solve this specific problem and all similar instances in which a (monic) polynomial is expressed as a linear combination of a persistent basis. That is to say a sequence of polynomials q_0 = 1, and q_k(x) = q_{k-1}(x)(x-r_k) for k > 0. Here, after [Fil10], we deal with a multivariate version of the problem with respect to a basis of polynomials of the same degree (binomial basis). We show that it is possible to build the parallelepiped associated with a multivariate polynomial P(x_1, ..., x_n)=(x_1- s_1)...(x_n-s_n) with integer roots, using the parallelepipeds described by the elements of the basis. We provide an algorithm in Mathematica to solve the problem for each n. Moreover, for n = 2, 3, 4 (in the latter case, only when a projection is possible) we use Mathematica to display a step by step construction of the parallelepiped P(x1,...,x_n).
Introducing Memory and Association Mechanism into a Biologically Inspired Visual Model
Venue: arXiv cs.AI 2013
Year: 2013

A famous biologically inspired hierarchical model firstly proposed by Riesenhuber and Poggio has been successfully applied to multiple visual recognition tasks. The model is able to achieve a set of position- and scale-tolerant recognition, which is a central problem in pattern recognition. In this paper, based on some other biological experimental results, we introduce the Memory and Association Mechanisms into the above biologically inspired model. The main motivations of the work are (a) to mimic the active memory and association mechanism and add the 'top down' adjustment to the above biologically inspired hierarchical model and (b) to build up an algorithm which can save the space and keep a good recognition performance. The new model is also applied to object recognition processes. The primary experimental results show that our method is efficient with much less memory requirement.
Detect adverse drug reactions for drug Alendronate
Venue: arXiv cs.CE 2013
Year: 2013

Adverse drug reaction (ADR) is widely concerned for public health issue. In this study we propose an original approach to detect the ADRs using feature matrix and feature selection. The experiments are carried out on the drug Simvastatin. Major side effects for the drug are detected and better performance is achieved compared to other computerized methods. The detected ADRs are based on the computerized method, further investigation is needed.
Multiple-Level Power Allocation Strategy for Secondary Users in Cognitive Radio Networks
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we propose a multiple-level power allocation strategy for the secondary user (SU) in cognitive radio (CR) networks. Different from the conventional strategies, where SU either stays silent or transmit with a constant/binary power depending on the busy/idle status of the primary user (PU), the proposed strategy allows SU to choose different power levels according to a carefully designed function of the receiving energy. The way of the power level selection is optimized to maximize the achievable rate of SU under the constraints of average transmit power at SU and average interference power at PU. Simulation results demonstrate that the proposed strategy can significantly improve the performance of SU compared to the conventional strategies.
Perform wordcount Map-Reduce Job in Single Node Apache Hadoop cluster and compress data using Lempel-Ziv-Oberhumer (LZO) algorithm
Venue: arXiv cs.DC 2013
Year: 2013

Applications like Yahoo, Facebook, Twitter have huge data which has to be stored and retrieved as per client access. This huge data storage requires huge database leading to increase in physical storage and becomes complex for analysis required in business growth. This storage capacity can be reduced and distributed processing of huge data can be done using Apache Hadoop which uses Map-reduce algorithm and combines the repeating data so that entire data is stored in reduced format. The paper describes performing a wordcount Map-Reduce Job in Single Node Apache Hadoop cluster and compress data using Lempel-Ziv-Oberhumer (LZO) algorithm.
Power Allocation Strategies in Energy Harvesting Wireless Cooperative Networks
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, a wireless cooperative network is considered, in which multiple source-destination pairs communicate with each other via an energy harvesting relay. The focus of this paper is on the relay's strategies to distribute the harvested energy among the multiple users and their impact on the system performance. Specifically, a non-cooperative strategy is to use the energy harvested from the i-th source as the relay transmission power to the i-th destination, to which asymptotic results show that its outage performance decays as logSNR over SNR. A faster decaying rate, 1 over SNR, can be achieved by the two centralized strategies proposed this the paper, where the water filling based one can achieve optimal performance with respect to several criteria, with a price of high complexity. An auction based power allocation scheme is also proposed to achieve a better tradeoff between the system performance and complexity. Simulation results are provided to confirm the accuracy of the developed analytical results and facilitate a better performance comparison.
Simulation of wireless dynamic source routing protocol with IP traffic flow analysis, memory efficiency and increased throughput
Venue: arXiv cs.NI 2013
Year: 2013

Today in fast technology development in wireless mobile adhoc network there is vast scope for research. As it is known that wireless communication for mobile network has many application areas like routing services, security services etc. The mobile adhoc network is the wireless network for communication in which the mobile nodes are organized without any centralized administrator. There are many Manet routing protocols like reactive, proactive, hybrid etc. In this paper the reactive Manet routing protocol like DSR is simulated for traffic analysis for 50 mobile nodes for IP traffic flows. Also throughput is analyzed for DSR and ER-DSR protocol. And finally the memory utilized during simulation of DSR and ER-DSR is evaluated in order to compare both.
Identifying change patterns in software history
Venue: arXiv cs.SE 2013
Year: 2013

Traditional algorithms for detecting differences in source code focus on differences between lines. As such, little can be learned about abstract changes that occur over time within a project. Structural differencing on the program's abstract syntax tree reveals changes at the syntactic level within code, which allows us to further process the differences to understand their meaning. We propose that grouping of changes by some metric of similarity, followed by pattern extraction via antiunification will allow us to identify patterns of change within a software project from the sequence of changes contained within a Version Control System (VCS). Tree similarity metrics such as a tree edit distance can be used to group changes in order to identify groupings that may represent a single class of change (e.g., adding a parameter to a function call). By applying antiunification within each group we are able to generalize from families of concrete changes to patterns of structural change. Studying patterns of change at the structural level, instead of line-by-line, allows us to gain insight into the evolution of software.
Design of Information and Telecommunication Systems with the Usage of the Multi-Layer Graph Model
Venue: arXiv cs.NI 2013
Year: 2013

Considered in the paper is the overlaid nature of modern telecommunication networks and expediency of usage the multi-layer graph model for its design. General statement of design problem is given. The design method in general using multi-layer graph model and its application for a typical information and telecommunication system is proposed.
Generalized Quasi-Cyclic Codes Over $\mathbb{F}_q+u\mathbb{F}_q$
Venue: arXiv cs.IT 2013
Year: 2013

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC codes, quasi-cyclic (QC) codes over $\mathbb{F}_q+u\mathbb{F}_q$ are also discussed briefly in this paper.
Approximate dynamic programming using fluid and diffusion approximations with applications to power management
Venue: arXiv cs.LG 2013
Year: 2013

Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide the approximate solution only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? The goal of this paper is to propose an approach using the solutions to associated fluid and diffusion approximations. In order to illustrate this approach, the paper focuses on an application to dynamic speed scaling for power management in computer processors.
Crossing the Reality Gap: a Short Introduction to the Transferability Approach
Venue: arXiv cs.RO 2013
Year: 2013

In robotics, gradient-free optimization algorithms (e.g. evolutionary algorithms) are often used only in simulation because they require the evaluation of many candidate solutions. Nevertheless, solutions obtained in simulation often do not work well on the real device. The transferability approach aims at crossing this gap between simulation and reality by \emph{making the optimization algorithm aware of the limits of the simulation}. In the present paper, we first describe the transferability function, that maps solution descriptors to a score representing how well a simulator matches the reality. We then show that this function can be learned using a regression algorithm and a few experiments with the real devices. Our results are supported by an extensive study of the reality gap for a simple quadruped robot whose control parameters are optimized. In particular, we mapped the whole search space in reality and in simulation to understand the differences between the fitness landscapes.
Solution of Rectangular Fuzzy Games by Principle of Dominance Using LR-type Trapezoidal Fuzzy Numbers
Venue: arXiv cs.AI 2013
Year: 2013

Fuzzy Set Theory has been applied in many fields such as Operations Research, Control Theory, and Management Sciences etc. In particular, an application of this theory in Managerial Decision Making Problems has a remarkable significance. In this Paper, we consider a solution of Rectangular Fuzzy game with pay-off as imprecise numbers instead of crisp numbers viz., interval and LR-type Trapezoidal Fuzzy Numbers. The solution of such Fuzzy games with pure strategies by minimax-maximin principle is discussed. The Algebraic Method to solve Fuzzy games without saddle point by using mixed strategies is also illustrated. Here, pay-off matrix is reduced to pay-off matrix by Dominance Method. This fact is illustrated by means of Numerical Example.
Trapezoidal Fuzzy Numbers for the Transportation Problem
Venue: arXiv cs.AI 2013
Year: 2013

Transportation Problem is an important problem which has been widely studied in Operations Research domain. It has been often used to simulate different real life problems. In particular, application of this Problem in NP Hard Problems has a remarkable significance. In this Paper, we present the closed, bounded and non empty feasible region of the transportation problem using fuzzy trapezoidal numbers which ensures the existence of an optimal solution to the balanced transportation problem. The multivalued nature of Fuzzy Sets allows handling of uncertainty and vagueness involved in the cost values of each cells in the transportation table. For finding the initial solution of the transportation problem we use the Fuzzy Vogel Approximation Method and for determining the optimality of the obtained solution Fuzzy Modified Distribution Method is used. The fuzzification of the cost of the transportation problem is discussed with the help of a numerical example. Finally, we discuss the computational complexity involved in the problem. To the best of our knowledge, this is the first work on obtaining the solution of the transportation problem using fuzzy trapezoidal numbers.
Modeling Human Mobility and its Applications in Routing in Delay-Tolerant Networks: a Short Survey
Venue: arXiv cs.NI 2013
Year: 2013

Human mobility patterns are complex and distinct from one person to another. Nevertheless, motivated by tremendous potential benefits of modeling such patterns in enabling new mobile services and technologies, researchers have attempted to capture salient characteristics of human mobility. In this short survey paper, we review some of the major techniques for modeling humans' co-location, as well as predicting human location and trajectory. Further, we review one of the most important application areas of such models, namely, routing in delay-tolerant networks.
Link Based Session Reconstruction: Finding All Maximal Paths
Venue: arXiv cs.DB 2013
Year: 2013

This paper introduces a new method for the session construction problem, which is the first main step of the web usage mining process. Through experiments, it is shown that when our new technique is used, it outperforms previous approaches in web usage mining applications such as next-page prediction.
Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles
Venue: arXiv cs.NI 2013
Year: 2013

We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wireless ad hoc sensor networks. It is a simple routing protocol that can easily be combined with any other greedy routing algorithm to obtain delivery guarantee. The efficiency of HBR increases if the network is sparse and contains obstacles. The space necessary to store the additional routing information at a node u is on average not larger than the size necessary to store the IDs of the neighbors of u. The amount of work to setup the complete data structure is on average proportional to flooding the entire network log(n) times, where n is the total number of sensor nodes. We evaluate the performance of HBR in combination with two simple energy-aware geographic greedy routing algorithms based on physical coordinates and virtual coordinates, respectively. Our simulations show that the difference between using HBR and a weighted shortest path to escape a dead-end is only a few percent in typical cases.
Distance domination, guarding and vertex cover for maximal outerplanar graph
Venue: arXiv cs.CG 2013
Year: 2013

This paper discusses a distance guarding concept on triangulation graphs, which can be associated with distance domination and distance vertex cover. We show how these subjects are interconnected and provide tight bounds for any n-vertex maximal outerplanar graph: the 2d-guarding number, g_{2d}(n) = n/5; the 2d-distance domination number, gamma_{2d}(n) = n/5; and the 2d-distance vertex cover number, beta_{2d}(n) = n/4.
Mitigating Epidemics through Mobile Micro-measures
Venue: arXiv cs.SI 2013
Year: 2013

Epidemics of infectious diseases are among the largest threats to the quality of life and the economic and social well-being of developing countries. The arsenal of measures against such epidemics is well-established, but costly and insufficient to mitigate their impact. In this paper, we argue that mobile technology adds a powerful weapon to this arsenal, because (a) mobile devices endow us with the unprecedented ability to measure and model the detailed behavioral patterns of the affected population, and (b) they enable the delivery of personalized behavioral recommendations to individuals in real time. We combine these two ideas and propose several strategies to generate such recommendations from mobility patterns. The goal of each strategy is a large reduction in infections, with a small impact on the normal course of daily life. We evaluate these strategies over the Orange D4D dataset and show the benefit of mobile micro-measures, even if only a fraction of the population participates. These preliminary results demonstrate the potential of mobile technology to complement other measures like vaccination and quarantines against disease epidemics.
On the Topology of the Facebook Page Network
Venue: arXiv cs.SI 2013
Year: 2013

The Facebook Page Network (FPN) is a platform for Businesses, Public Figures and Organizations (BPOs) to connect with individuals and other BPOs in the digital space. For over a decade scale-free networks have most appropriately described a variety of seemingly disparate physical, biological and social real-world systems unified by similar network properties such as scale-invariance, growth via a preferential attachment mechanism, and a power law degree distribution P(k) = ck^-λ where typically 2<λ<3. In this paper we show that both the Facebook Page Network and its BPO-BPO subnetwork suggest power law and scale-free characteristics. We argue that social media analysts must consider the logarithmic and non-linear properties of social media audiences of scale.