OpenRaiser/Intern-Atlas huggingface dataset:
Cognitive Radios: A Survey of Methods for Channel State Prediction
Venue: arXiv cs.NI 2013
Year: 2013

This paper discusses the need for Cognitive Radio ability in view of the physical scarcity of wireless spectrum for communication. A background of the Cognitive Radio technology is presented and the aspect of 'channel state prediction' is focused upon. Hidden Markov Models (HMM) have been traditionally used to model the wireless channel behavior but it suffers from certain limitations. We discuss few techniques of channel state prediction using machine-learning methods and will extend the Conditional Random Field (CRF) procedure to this field.
Parallelization of Loops with Variable Distance Data Dependences
Venue: arXiv cs.PL 2013
Year: 2013

The extent of parallelization of a loop is largely determined by the dependences between its statements. While dependence free loops are fully parallelizable, those with loop carried dependences are not. Dependence distance is a measure of absolute difference between a pair of dependent iterations. Loops with constant distance data dependence, because of uniform distance between the dependent iterations, lead to easy partitioning of the iteration space and hence they have been successfully dealt with. Parallelization of loops with variable distance data dependences is a considerably difficult problem. It is our belief that partitioning the iteration space in such loops cannot be done without examining solutions of the corresponding Linear Diophantine Equations. Focus of this work is to study variable distance data dependences and examine the relation between dependent iterations. Our analysis based on parametric solution leads to a mathematical formulation capturing dependence between iterations. Our approach shows the existence of reasonable exploitable parallelism in variable distance data dependences loops with multiple LDEs.
An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing
Venue: arXiv cs.LO 2013
Year: 2013

We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration $\langle p, \varrho\rangle$, but we treat it as two relative independent part: the structural part $p$ and the quantum part $\varrho$, because the establishment of a sound and complete theory is dependent on the structural properties of the structural part $p$. We let the quantum part $\varrho$ be the outcomes of execution of $p$ to examine and observe the function of the basic theory of quantum mechanics. We establish not only a strong bisimularity for quantum processes, but also a weak bisimularity to model the silent step and abstract internal computations in quantum processes. The relationship between quantum bisimularity and classical bisimularity is established, which makes an axiomatization of quantum processes possible. An axiomatization for quantum processes called qACP is designed, which involves not only quantum information, but also classical information and unifies quantum computing and classical computing. qACP can be used easily and widely for verification of most quantum communication protocols.
Ants: Mobile Finite State Machines
Venue: arXiv cs.DC 2013
Year: 2013

Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where $n$ mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that the agents are controlled by a (randomized) finite state machine: they possess a constant-size memory and are able to communicate with each other through constant-size messages. Despite the restriction to constant-size memory, we show that their collaborative performance remains the same by presenting a distributed algorithm that matches a lower bound established by Feinerman et al. on the run-time of any ANTS algorithm.
An Efficient Method for Recognizing the Low Quality Fingerprint Verification by Means of Cross Correlation
Venue: arXiv cs.CV 2013
Year: 2013

In this paper, we propose an efficient method to provide personal identification using fingerprint to get better accuracy even in noisy condition. The fingerprint matching based on the number of corresponding minutia pairings, has been in use for a long time, which is not very efficient for recognizing the low quality fingerprints. To overcome this problem, correlation technique is used. The correlation-based fingerprint verification system is capable of dealing with low quality images from which no minutiae can be extracted reliably and with fingerprints that suffer from non-uniform shape distortions, also in case of damaged and partial images. Orientation Field Methodology (OFM) has been used as a preprocessing module, and it converts the images into a field pattern based on the direction of the ridges, loops and bifurcations in the image of a fingerprint. The input image is then Cross Correlated (CC) with all the images in the cluster and the highest correlated image is taken as the output. The result gives a good recognition rate, as the proposed scheme uses Cross Correlation of Field Orientation (CCFO = OFM + CC) for fingerprint identification.
Entropy Assessment of Windows OS Performance Counters
Venue: arXiv cs.CR 2013
Year: 2013

The security of many cryptographic constructions depends on random number generators for providing unpredictable keys, nonces, initialization vectors and other parameters. Modern operating systems implement cryptographic pseudo-random number generators (PRNGs) to fulfill this need. Performance counters and other system parameters are often used as a low-entropy source to initialize (seed) the generators. We perform an experiment to analyze all performance counters in standard installation of Microsoft Windows 7 operating system, and assess their suitability as entropy sources. Besides selecting top 19 counters, we analyze their mutual information (independence) as well as robustness in the virtual environment. Final selection contains 14 counters with sufficient overall entropy for practical applications.
Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
Venue: arXiv cs.AI 2013
Year: 2013

We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting the initial query into a union of conjunctive queries. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator, and define properties of rewriting operators that ensure the correctness of the algorithm. Then, we focus on piece-unifiers, which provide a rewriting operator with the desired properties. Finally, we propose an implementation of this framework and report some experiments.
Chaotic Arithmetic Coding for Secure Video Multicast
Venue: arXiv cs.MM 2013
Year: 2013

Arithmetic Coding (AC) is widely used for the entropy coding of text and video data. It involves recursive partitioning of the range [0,1) in accordance with the relative probabilities of occurrence of the input symbols. A data (image or video) encryption scheme based on arithmetic coding called as Chaotic Arithmetic Coding (CAC) has been presented in previous works. In CAC, a large number of chaotic maps can be used to perform coding, each achieving Shannon optimal compression performance. The exact choice of map is governed by a key. CAC has the effect of scrambling the intervals without making any changes to the width of interval in which the codeword must lie, thereby allowing encryption without sacrificing any coding efficiency. In this paper, we use a redundancy in CAC procedure for secure multicast of videos where multiple users are distributed with different keys to decode same encrypted file. By encrypting once, we can generate multiple keys, either of which can be used to decrypt the encoded file. This is very suitable for video distribution over Internet where a single video can be distributed to multiple clients in a privacy preserving manner.
Using Social Information for Flow Allocation in MANETs
Venue: arXiv cs.NI 2013
Year: 2013

Adhoc networks enable communication between distributed, mobile wireless nodes without any supporting infrastructure. In the absence of centralized control, such networks require node interaction, and are inherently based on cooperation between nodes. In this paper, we use social and behavioral trust of nodes to form a flow allocation optimization problem. We initialize trust using information gained from users' social relationships (from social networks) and update the trusts metric over time based on observed node behaviors. We conduct analysis of social trust using real data sets and used it as a parameter for performance evaluation of our frame work in ns-3. Based on our approach we obtain a significant improvement in both detection rate and packet delivery ratio using social trust information when compared to behavioral trust alone. Further, we observe that social trust is critical in the event of mobility and plays a crucial role in bootstrapping the computation of trust.
Infrastructure Logicielle d un Environnement Hospitalier Intelligent
Venue: arXiv cs.CY 2013
Year: 2013

The impact of new technologies in the field of healthcare has been proven to be satisfactory in improving the quality of care and services for patients. The hospital environment is undoubtedly one of the environments where human or hardware errors can cause harmful damage. It is therefore very useful for the sector to be at the forefront of technology and use the strongest and most efficient means since it is supposed to be an environment of reliability, trust and is legally responsible for ensuring the confidentiality of all patient information. In this project we have proposed and developed a smart hospital enviornement that allows both, detecting patien fall and send alerts to the suitable parties, and securing patien stored data through RFID technology.
Doomsday Equilibria for Omega-Regular Games
Venue: arXiv cs.GT 2013
Year: 2013

Two-player games on graphs provide the theoretical frame- work for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of omega-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.
Android Note Manager Application for People with Visual Impairment
Venue: arXiv cs.HC 2013
Year: 2013

With the outburst of smart-phones today, the market is exploding with various mobile applications. This paper proposes an application using which visually impaired people can type a note in Grade 1 Braille and save it in the external memory of their smart-phone. The application also shows intelligence by activating reminders and/or calling certain contacts based on the content in the notes.
Mining Software Repair Models for Reasoning on the Search Space of Automated Program Fixing
Venue: arXiv cs.SE 2013
Year: 2013

This paper is about understanding the nature of bug fixing by analyzing thousands of bug fix transactions of software repositories. It then places this learned knowledge in the context of automated program repair. We give extensive empirical results on the nature of human bug fixes at a large scale and a fine granularity with abstract syntax tree differencing. We set up mathematical reasoning on the search space of automated repair and the time to navigate through it. By applying our method on 14 repositories of Java software and 89,993 versioning transactions, we show that not all probabilistic repair models are equivalent.
The Hot Bit I: The Szilard-Landauer Correspondence
Venue: arXiv cs.IT 2013
Year: 2013

We present a precise formulation of a correspondence between information and thermodynamics that was first observed by Szilard, and later studied by Landauer. The correspondence identifies available free energy with relative entropy, and provides a dictionary between information and thermodynamics. We precisely state and prove this correspondence. The paper should be broadly accessible since we assume no prior knowledge of information theory, developing it axiomatically, and we assume almost no thermodynamic background.
Systems of Systems Modeled by a Hierarchical Part-Whole State-Based Formalism
Venue: arXiv cs.SE 2013
Year: 2013

The paper presents an explicit state-based modeling approach aimed at modeling Systems of Systems behavior. The approach allows to specify and verify incrementally safety and liveness rules without using model checking techniques. The state-based approach allows moreover to use the system behavior directly as an interface, greatly improving the effectiveness of the recursive composition needed when assembling Systems of Systems. Such systems are, at the same time, both parts and wholes, thus giving a formal characterization to the notion of Holon.
System-of-Systems Complexity
Venue: arXiv cs.SE 2013
Year: 2013

The global availability of communication services makes it possible to interconnect independently developed systems, called constituent systems, to provide new synergistic services and more efficient economic processes. The characteristics of these new Systems-of-Systems are qualitatively different from the classic monolithic systems. In the first part of this presentation we elaborate on these differences, particularly with respect to the autonomy of the constituent systems, to dependability, continuous evolution, and emergence. In the second part we look at a SoS from the point of view of cognitive complexity. Cognitive complexity is seen as a relation between a model of an SoS and the observer. In order to understand the behavior of a large SoS we have to generate models of adequate simplicity, i.e, of a cognitive complexity that can be handled by the limited capabilities of the human mind. We will discuss the importance of properly specifying and placing the relied-upon message interfaces between the constituent systems that form an open SoS and discuss simplification strategies that help to reduce the cognitive complexity.
Challenges for modelling and analysis in embedded systems and systems-of-systems design
Venue: arXiv cs.SE 2013
Year: 2013

Over the last decade we have witnessed an increasing use of data processing in embedded systems. Where in the past the data processing was limited (if present at all) to the handling of a small number of "on-off control signals", more recently much more complex sensory data is being captured, processed and used to improve system performance and dependability. The advent of systems-of-systems aggravates the use of more and more data, for instance, by bringing together data from several independent sources, allowing, in principle, for even better performing systems. However, this ever stronger data-orientation brings along several challenges in system design, both technically and organisationally, and also forces manufacturers to think beyond their traditional field of expertise. In this short paper, I will address these new design challenges, through a number of examples. The paper finishes with concrete challenges for supporting tools and techniques for system design in this new context.
SoS contract verification using statistical model checking
Venue: arXiv cs.SE 2013
Year: 2013

Exhaustive formal verification for systems of systems (SoS) is impractical and cannot be applied on a large scale. In this paper we propose to use statistical model checking for efficient verification of SoS. We address three relevant aspects for systems of systems: 1) the model of the SoS, which includes stochastic aspects; 2) the formalization of the SoS requirements in the form of contracts; 3) the tool-chain to support statistical model checking for SoS. We adapt the SMC technique for application to heterogeneous SoS. We extend the UPDM/SysML specification language to express the SoS requirements that the implemented strategies over the SoS must satisfy. The requirements are specified with a new contract language specifically designed for SoS, targeting a high-level English- pattern language, but relying on an accurate semantics given by the standard temporal logics. The contracts are verified against the UPDM/SysML specification using the Statistical Model Checker (SMC) PLASMA combined with the simulation engine DESYRE, which integrates heterogeneous behavioral models through the functional mock-up interface (FMI) standard. The tool-chain allows computing an estimation of the satisfiability of the contracts by the SoS. The results help the system architect to trade-off different solutions to guide the evolution of the SoS.
A coordination model for ultra-large scale systems of systems
Venue: arXiv cs.SY 2013
Year: 2013

The ultra large multi-agent systems are becoming increasingly popular due to quick decay of the individual production costs and the potential of speeding up the solving of complex problems. Examples include nano-robots, or systems of nano-satellites for dangerous meteorite detection, or cultures of stem cells for organ regeneration or nerve repair. The topics associated with these systems are usually dealt within the theories of intelligent swarms or biologically inspired computation systems. Stochastic models play an important role and they are based on various formulations of the mechanical statistics. In these cases, the main assumption is that the swarm elements have a simple behaviour and that some average properties can be deduced for the entire swarm. In contrast, complex systems in areas like aeronautics are formed by elements with sophisticated behaviour, which are even autonomous. In situations like this, a new approach to swarm coordination is necessary. We present a stochastic model where the swarm elements are communicating autonomous systems, the coordination is separated from the component autonomous activity and the entire swarm can be abstracted away as a piecewise deterministic Markov process, which constitutes one of the most popular model in stochastic control. Keywords: ultra large multi-agent systems, system of systems, autonomous systems, stochastic hybrid systems.
Structural Weights in Ontology Matching
Venue: arXiv cs.AI 2013
Year: 2013

Ontology matching finds correspondences between similar entities of different ontologies. Two ontologies may be similar in some aspects such as structure, semantic etc. Most ontology matching systems integrate multiple matchers to extract all the similarities that two ontologies may have. Thus, we face a major problem to aggregate different similarities. Some matching systems use experimental weights for aggregation of similarities among different matchers while others use machine learning approaches and optimization algorithms to find optimal weights to assign to different matchers. However, both approaches have their own deficiencies. In this paper, we will point out the problems and shortcomings of current similarity aggregation strategies. Then, we propose a new strategy, which enables us to utilize the structural information of ontologies to get weights of matchers, for the similarity aggregation task. For achieving this goal, we create a new Ontology Matching system which it uses three available matchers, namely GMO, ISub and VDoc. We have tested our similarity aggregation strategy on the OAEI 2012 data set. Experimental results show significant improvements in accuracies of several cases, especially in matching the classes of ontologies. We will compare the performance of our similarity aggregation strategy with other well-known strategies
Periodicity Extraction using Superposition of Distance Matching Function and One-dimensional Haar Wavelet Transform
Venue: arXiv cs.CV 2013
Year: 2013

Periodicity of a texture is one of the important visual characteristics and is often used as a measure for textural discrimination at the structural level. Knowledge about periodicity of a texture is very essential in the field of texture synthesis and texture compression and also in the design of frieze and wall papers. In this paper, we propose a method of periodicity extraction from noisy images based on superposition of distance matching function (DMF) and wavelet decomposition without de-noising the test images. Overall DMFs are subjected to single-level Haar wavelet decomposition to obtain approximate and detailed coefficients. Extracted coefficients help in determination of periodicities in row and column directions. We illustrate the usefulness and the effectiveness of the proposed method in a texture synthesis application.
SBML for optimizing decision support's tools
Venue: arXiv cs.CE 2013
Year: 2013

Many theoretical works and tools on epidemiological field reflect the emphasis on decision-making Tools by both public health and the scientific community, which continues to increase. Indeed, in the epidemiological field, modeling tools are proving a very important way in helping to make decision. However, the variety, the large volume of data and the nature of epidemics lead us to seek solutions to alleviate the heavy burden imposed on both experts and developers. In this paper, we present a new approach: the passage of an epidemic model realized in Bio-PEPA to a narrative language using the basics of SBML language. Our goal is to allow on one hand, epidemiologists to verify and validate the model, and the other hand, developers to optimize the model in order to achieve a better model of decision making. We also present some preliminary results and some suggestions to improve the simulated model.
An Algorithm to Solve the Equal-Sum-Product Problem
Venue: arXiv cs.DM 2013
Year: 2013

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their product. An examination of the use of Binary Search Trees in implementing the algorithm into a working program is given. In addition an application of the algorithm for searching possible extra exceptional values of the equal-sum-product problem is explored after demonstrating a link between these numbers and the Sophie Germain primes.
A Comparative Study of Histogram Equalization Based Image Enhancement Techniques for Brightness Preservation and Contrast Enhancement
Venue: arXiv cs.CV 2013
Year: 2013

Histogram Equalization is a contrast enhancement technique in the image processing which uses the histogram of image. However histogram equalization is not the best method for contrast enhancement because the mean brightness of the output image is significantly different from the input image. There are several extensions of histogram equalization has been proposed to overcome the brightness preservation challenge. Contrast enhancement using brightness preserving bi-histogram equalization (BBHE) and Dualistic sub image histogram equalization (DSIHE) which divides the image histogram into two parts based on the input mean and median respectively then equalizes each sub histogram independently. This paper provides review of different popular histogram equalization techniques and experimental study based on the absolute mean brightness error (AMBE), peak signal to noise ratio (PSNR), Structure similarity index (SSI) and Entropy.