OpenRaiser/Intern-Atlas huggingface dataset:
An Approach to Log Management: Prototyping a Design of Agent for Log Harvesting
Venue: arXiv cs.NI 2011
Year: 2011

This paper describes a work in progress implementing a solution for harvesting and transporting information logs from network devices in a e-science environment. The system is composed for servers, agents, active devices and a transporting protocol. This document describes the state of development of agents. Agents capture logs from devices, normalize, reduce and cataloged them by using metadata. Once all these processes are done, they transmit the cataloged data by using Transportation Protocol to a warehouse server. Also an agent use orchestration parameters to transmit modified logs to a data warehouse server. These parameters can be received from orchestration applications such as Taverna. The operation of the agents and the communication protocol solve some of the deficiencies of traditional logs management protocols. Finally, we show some test realized over the new prototype.
On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors
Venue: arXiv cs.IT 2011
Year: 2011

Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based on a generalization of Sidon sequences. In particular we will consider perfect codes for these type of errors.
Randomness Quality of CI Chaotic Generators: Applications to Internet Security
Venue: arXiv cs.CR 2011
Year: 2011

Due to the rapid development of the Internet in recent years, the need to find new tools to reinforce trust and security through the Internet has became a major concern. The discovery of new pseudo-random number generators with a strong level of security is thus becoming a hot topic, because numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators. At the conference Internet`09, we have described a generator based on chaotic iterations, which behaves chaotically as defined by Devaney. In this paper, the proposal is to improve the speed and the security of this generator, to make its use more relevant in the Internet security context. To do so, a comparative study between various generators is carried out and statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.
On the design of a family of CI pseudo-random number generators
Venue: arXiv cs.CR 2011
Year: 2011

Chaos and its applications in the field of secure communications have attracted a lot of attention. Chaos-based pseudo-random number generators are critical to guarantee security over open networks as the Internet. We have previously demonstrated that it is possible to define such generators with good statistical properties by using a tool called "chaotic iterations", which depends on an iteration function. An approach to find update functions such that the associated generator presents a random-like and chaotic behavior is proposed in this research work. To do so, we use the vectorial Boolean negation as a prototype and explain how to modify this iteration function without deflating the good properties of the associated generator. Simulation results and basic security analysis are then presented to evaluate the randomness of this new family of generators.
Two Squares of Opposition: for Analytic and Synthetic Propositions
Venue: arXiv cs.OH 2011
Year: 2011

In the paper I prove that there are two squares of opposition. The unconventional one is built up for synthetic propositions. There a, i are contrary, a, o (resp. e, i) are contradictory, e, o are subcontrary, a, e (resp. i, o) are said to stand in the subalternation.
On the Stability Region of Multi-Queue Multi-Server Queueing Systems with Stationary Channel Distribution
Venue: arXiv cs.IT 2011
Year: 2011

In this paper, we characterize the stability region of multi-queue multi-server (MQMS) queueing systems with stationary channel and packet arrival processes. Toward this, the necessary and sufficient conditions for the stability of the system are derived under general arrival processes with finite first and second moments. We show that when the arrival processes are stationary, the stability region form is a polytope for which we explicitly find the coefficients of the linear inequalities which characterize the stability region polytope.
Steganography: a class of secure and robust algorithms
Venue: arXiv cs.CR 2011
Year: 2011

This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains.
Generic Environments in Coq
Venue: arXiv cs.LO 2011
Year: 2011

We introduce a library which provides an abstract data type of environments, as a functor parameterized by a module defining variables, and a function which builds environments for such variables with any Type of type. Usual operations over environments are defined, along with an extensive set of basic and more advanced properties. Moreover, we give an implementation using lists satisfying all the required properties.
An Identity for Kernel Ridge Regression
Venue: arXiv cs.LG 2011
Year: 2011

This paper derives an identity connecting the square loss of ridge regression in on-line mode with the loss of the retrospectively best regressor. Some corollaries about the properties of the cumulative loss of on-line ridge regression are also obtained.
Enhanced Inter-Cell Interference Coordination Challenges in Heterogeneous Networks
Venue: arXiv cs.NI 2011
Year: 2011

3GPP LTE-Advanced has started a new study item to investigate Heterogeneous Network (HetNet) deployments as a cost effective way to deal with the unrelenting traffic demand. HetNets consist of a mix of macrocells, remote radio heads, and low-power nodes such as picocells, femtocells, and relays. Leveraging network topology, increasing the proximity between the access network and the end-users, has the potential to provide the next significant performance leap in wireless networks, improving spatial spectrum reuse and enhancing indoor coverage. Nevertheless, deployment of a large number of small cells overlaying the macrocells is not without new technical challenges. In this article, we present the concept of heterogeneous networks and also describe the major technical challenges associated with such network architecture. We focus in particular on the standardization activities within the 3GPP related to enhanced inter-cell interference coordination.
Using Taxonomies to Facilitate the Analysis of the Association Rules
Venue: arXiv cs.DB 2011
Year: 2011

The Data Mining process enables the end users to analyze, understand and use the extracted knowledge in an intelligent system or to support in the decision-making processes. However, many algorithms used in the process encounter large quantities of patterns, complicating the analysis of the patterns. This fact occurs with association rules, a Data Mining technique that tries to identify intrinsic patterns in large data sets. A method that can help the analysis of the association rules is the use of taxonomies in the step of post-processing knowledge. In this paper, the GART algorithm is proposed, which uses taxonomies to generalize association rules, and the RulEE-GAR computational module, that enables the analysis of the generalized rules.
HandsInAir: A Wearable System for Remote Collaboration
Venue: arXiv cs.HC 2011
Year: 2011

We present HandsInAir, a real-time collaborative wearable system for remote collaboration. The system is developed to support real world scenarios in which a remote mobile helper guides a local mobile worker performing a physical task. HandsInAir implements a novel approach to support mobility of remote collaborators. This approach allows the helper to perform gestures without having to touch tangible objects, requiring little environment support. The system consists of two parts: the helper part and the worker part. The two parts are connected via a wireless network and the collaboration partners communicate with each other via audio and visual links. In this paper, we review related work, describe technical implementation of the system and envision future work for further improvements.
Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach
Venue: arXiv cs.SI 2011
Year: 2011

A "community" in a social network is usually understood to be a group of nodes more densely connected with each other than with the rest of the network. This is an important concept in most domains where networks arise: social, technological, biological, etc. For many years algorithms for finding communities implicitly assumed communities are nonoverlapping (leading to use of clustering-based approaches) but there is increasing interest in finding overlapping communities. A barrier to finding communities is that the solution concept is often defined in terms of an NP-complete problem such as Clique or Hierarchical Clustering. This paper seeks to initiate a rigorous approach to the problem of finding overlapping communities, where "rigorous" means that we clearly state the following: (a) the object sought by our algorithm (b) the assumptions about the underlying network (c) the (worst-case) running time. Our assumptions about the network lie between worst-case and average-case. An average case analysis would require a precise probabilistic model of the network, on which there is currently no consensus. However, some plausible assumptions about network parameters can be gleaned from a long body of work in the sociology community spanning five decades focusing on the study of individual communities and ego-centric networks. Thus our assumptions are somewhat "local" in nature. Nevertheless they suffice to permit a rigorous analysis of running time of algorithms that recover global structure. Our algorithms use random sampling similar to that in property testing and algorithms for dense graphs. However, our networks are not necessarily dense graphs, not even in local neighborhoods. Our algorithms explore a local-global relationship between ego-centric and socio-centric networks that we hope will provide a fruitful framework for future work both in computer science and sociology.
Equilibria of Channel Selection Games in Parallel Multiple Access Channel
Venue: arXiv cs.GT 2011
Year: 2011

In this paper, we study the decentralized parallel multiple access channel (MAC) when transmitters selfishly maximize their individual spectral efficiency by selecting a single channel to transmit. More specifically, we investigate the set of Nash equilibria (NE) of decentralized networks comprising several transmitters communicating with a single receiver that implements single user decoding. This scenario is modeled as a one-shot game where the players (the transmitters) have discrete action sets (the channels). We show that the corresponding game has always at least one NE in pure strategies, but, depending on certain parameters, the game might possess several NE. We provide an upper bound for the maximum number of NE as a function of the number of transmitters and available channels. The main contribution of this paper is a mathematical proof of the existence of a Braess-type paradox. In particular, it is shown that under the assumption of a fully loaded network, when transmitters are allowed to use all the available channels, the corresponding sum spectral efficiency achieved at the NE is lower or equal than the sum spectral efficiency achieved when transmitters can use only one channel. A formal proof of this observation is provided in the case of small networks. For general scenarios, we provide numerical examples that show that the same effect holds as long as the network is kept fully loaded. We conclude the paper by considering the case of successive interference cancellation at the receiver. In this context, we show that the power allocation vectors at the NE are capacity maximizers. Finally, simulations are presented to verify our theoretical results.
A Multipath TCP model for ns-3 simulator
Venue: arXiv cs.NI 2011
Year: 2011

We present an implementation of Multipath TCP (MPTCP) under the NS-3 open source network simulator. MPTCP is a promising extension of TCP currently considered by the recent eponymous IETF working group, with the objective of improving the performance of TCP, especially its robustness to variable network conditions. We describe this new protocol, its main functions and our implementation in NS-3. Besides this implementation compliant to the current versions of the IETF drafts, we have also added and compared various packet reordering mechanisms. We indeed notice that such mechanisms highly improve the performance of MPTCP. We believe that our implementation could be useful for future works in MPTCP performance evaluation, especially to compare packet reordering algorithms or coupling congestion control mechanisms between subfows.
Bootstrapping Intrinsically Motivated Learning with Human Demonstrations
Venue: arXiv cs.LG 2011
Year: 2011

This paper studies the coupling of internally guided learning and social interaction, and more specifically the improvement owing to demonstrations of the learning by intrinsic motivation. We present Socially Guided Intrinsic Motivation by Demonstration (SGIM-D), an algorithm for learning in continuous, unbounded and non-preset environments. After introducing social learning and intrinsic motivation, we describe the design of our algorithm, before showing through a fishing experiment that SGIM-D efficiently combines the advantages of social learning and intrinsic motivation to gain a wide repertoire while being specialised in specific subspaces.
Fast DOA estimation using wavelet denoising on MIMO fading channel
Venue: arXiv cs.NI 2011
Year: 2011

This paper presents a tool for the analysis, and simulation of direction-of-arrival (DOA) estimation in wireless mobile communication systems over the fading channel. It reviews two methods of Direction of arrival (DOA) estimation algorithm. The standard Multiple Signal Classification (MUSIC) can be obtained from the subspace based methods. In improved MUSIC procedure called Cyclic MUSIC, it can automatically classify the signals as desired and undesired based on the known spectral correlation property and estimate only the desired signal's DOA. In this paper, the DOA estimation algorithm using the de-noising pre-processing based on time-frequency conversion analysis was proposed, and the performances were analyzed. This is focused on the improvement of DOA estimation at a lower SNR and interference environment. This paper provides a fairly complete image of the performance and statistical efficiency of each of above two methods with QPSK signal.
Recent Trends and Research Issues in Video Association Mining
Venue: arXiv cs.MM 2011
Year: 2011

With the ever-growing digital libraries and video databases, it is increasingly important to understand and mine the knowledge from video database automatically. Discovering association rules between items in a large video database plays a considerable role in the video data mining research areas. Based on the research and development in the past years, application of association rule mining is growing in different domains such as surveillance, meetings, broadcast news, sports, archives, movies, medical data, as well as personal and online media collections. The purpose of this paper is to provide general framework of mining the association rules from video database. This article is also represents the research issues in video association mining followed by the recent trends.
Faked states attack and quantum cryptography protocols
Venue: arXiv cs.CR 2011
Year: 2011

Leveraging quantum mechanics, cryptographers have devised provably secure key sharing protocols. Despite proving the security in theory, real-world application falls short of the ideal. Last year, cryptanalysts completed an experiment demonstrating a successful eavesdropping attack on commercial quantum key distribution (QKD) systems. This attack exploits a weakness in the typical real-world implementation of quantum cryptosystems. Cryptanalysts have successfully attacked several protocols. In this paper, we examine the Kak quantum cryptography protocol and how it may perform under such attacks.
Enhancing Data Security by Making Data Disappear in a P2P Systems
Venue: arXiv cs.CR 2011
Year: 2011

This paper describes the problem of securing data by making it disappear after some time limit, making it impossible for it to be recovered by an unauthorized party. This method is in response to the need to keep the data secured and to protect the privacy of archived data on the servers, Cloud and Peer-to-Peer architectures. Due to the distributed nature of these architectures, it is impossible to destroy the data completely. So, we store the data by applying encryption and then manage the key, which is easier to do as the key is small and it can be hidden in the DHT (Distributed hash table). Even if the keys in the DHT and the encrypted data were compromised, the data would still be secure. This paper describes existing solutions, points to their limitations and suggests improvements with a new secure architecture. We evaluated and executed this architecture on the Java platform and proved that it is more secure than other architectures.
SocialCloud: Using Social Networks for Building Distributed Computing Services
Venue: arXiv cs.DC 2011
Year: 2011

In this paper we investigate a new computing paradigm, called SocialCloud, in which computing nodes are governed by social ties driven from a bootstrapping trust-possessing social graph. We investigate how this paradigm differs from existing computing paradigms, such as grid computing and the conventional cloud computing paradigms. We show that incentives to adopt this paradigm are intuitive and natural, and security and trust guarantees provided by it are solid. We propose metrics for measuring the utility and advantage of this computing paradigm, and using real-world social graphs and structures of social traces; we investigate the potential of this paradigm for ordinary users. We study several design options and trade-offs, such as scheduling algorithms, centralization, and straggler handling, and show how they affect the utility of the paradigm. Interestingly, we conclude that whereas graphs known in the literature for high trust properties do not serve distributed trusted computing algorithms, such as Sybil defenses---for their weak algorithmic properties, such graphs are good candidates for our paradigm for their self-load-balancing features.
A Novel Approach for Password Authentication Using Bidirectional Associative Memory
Venue: arXiv cs.CR 2011
Year: 2011

Password authentication is a very important system security procedure to gain access to user resources. In the Traditional password authentication methods a server has check the authenticity of the users. In our proposed method users can freely select their passwords from a predefined character set. They can also use a graphical image as password. The password may be a character or an image it will be converted into binary form and the binary values will be normalized. Associative memories have been used recently for password authentication in order to overcome drawbacks of the traditional password authentication methods. In this paper we proposed a method using Bidirectional Associative Memory algorithm for both alphanumeric (Text) and graphical password. By doing so the amount of security what we provide for the user can be enhanced. This paper along with test results show that converting user password in to Probabilistic values and giving them as input for BAM improves the security of the system
Secrecy Degrees of Freedom of MIMO Broadcast Channels with Delayed CSIT
Venue: arXiv cs.IT 2011
Year: 2011

The degrees of freedom (DoF) of the two-user Gaussian multiple-input and multiple-output (MIMO) broadcast channel with confidential message (BCC) is studied under the assumption that delayed channel state information (CSI) is available at the transmitter. We characterize the optimal secrecy DoF (SDoF) region and show that it can be achieved by a simple artificial noise alignment (ANA) scheme. The proposed scheme sends the confidential messages superposed with the artificial noise over several time slots. Exploiting delayed CSI, the transmitter aligns the signal in such a way that the useful message can be extracted at the intended receiver but is completely drowned by the artificial noise at the unintended receiver. The proposed scheme can be interpreted as a non-trivial extension of Maddah-Ali Tse (MAT) scheme and enables us to quantify the resource overhead, or equivalently the DoF loss, to be paid for the secrecy communications.
The Spatial Nearest Neighbor Skyline Queries
Venue: arXiv cs.DB 2011
Year: 2011

User preference queries are very important in spatial databases. With the help of these queries, one can found best location among points saved in database. In many situation users evaluate quality of a location with its distance from its nearest neighbor among a special set of points. There has been less attention about evaluating a location with its distance to nearest neighbors in spatial user preference queries. This problem has application in many domains such as service recommendation systems and investment planning. Related works in this field are based on top-k queries. The problem with top-k queries is that user must set weights for attributes and a function for aggregating them. This is hard for him in most cases. In this paper a new type of user preference queries called spatial nearest neighbor skyline queries will be introduced in which user has some sets of points as query parameters. For each point in database attributes are its distances to the nearest neighbors from each set of query points. By separating this query as a subset of dynamic skyline queries N2S2 algorithm is provided for computing it. This algorithm has good performance compared with the general branch and bound algorithm for skyline queries.
X-pire! - A digital expiration date for images in social networks
Venue: arXiv cs.CR 2011
Year: 2011

The Internet and its current information culture of preserving all kinds of data cause severe problems with privacy. Most of today's Internet users, especially teenagers, publish various kinds of sensitive information, yet without recognizing that revealing this information might be detrimental to their future life and career. Unflattering images that can be openly accessed now and in the future, e.g., by potential employers, constitute a particularly important such privacy concern. We have developed a novel, fast, and scalable system called X-pire! that allows users to set an expiration date for images in social networks (e.g., Facebook and Flickr) and on static websites, without requiring any form of additional interaction with these web pages. Once the expiration date is reached, the images become unavailable. Moreover, the publishing user can dynamically prolong or shorten the expiration dates of his images later, and even enforce instantaneous expiration. Rendering the approach possible for social networks crucially required us to develop a novel technique for embedding encrypted information within JPEG files in a way that survives JPEG compression, even for highly optimized implementations of JPEG post-processing with their various idiosyncrasies as commonly used in such networks. We have implemented our system and conducted performance measurements to demonstrate its robustness and efficiency.