OpenRaiser/Intern-Atlas huggingface dataset:
Achieving the Optimal Steaming Capacity and Delay Using Random Regular Digraphs in P2P Networks
Venue: arXiv cs.NI 2013
Year: 2013

In earlier work, we showed that it is possible to achieve $O(\log N)$ streaming delay with high probability in a peer-to-peer network, where each peer has as little as four neighbors, while achieving any arbitrary fraction of the maximum possible streaming rate. However, the constant in the $O(log N)$ delay term becomes rather large as we get closer to the maximum streaming rate. In this paper, we design an alternative pairing and chunk dissemination algorithm that allows us to transmit at the maximum streaming rate while ensuring that all, but a negligible fraction of the peers, receive the data stream with $O(\log N)$ delay with high probability. The result is established by examining the properties of graph formed by the union of two or more random 1-regular digraphs, i.e., directed graphs in which each node has an incoming and an outgoing node degree both equal to one.
SilentSense: Silent User Identification via Dynamics of Touch and Movement Behavioral Biometrics
Venue: arXiv cs.CR 2013
Year: 2013

With the increased popularity of smartphones, various security threats and privacy leakages targeting them are discovered and investigated. In this work, we present \ourprotocoltight, a framework to authenticate users silently and transparently by exploiting dynamics mined from the user touch behavior biometrics and the micro-movement of the device caused by user's screen-touch actions. We build a "touch-based biometrics" model of the owner by extracting some principle features, and then verify whether the current user is the owner or guest/attacker. When using the smartphone, the unique operating dynamics of the user is detected and learnt by collecting the sensor data and touch events silently. When users are mobile, the micro-movement of mobile devices caused by touch is suppressed by that due to the large scale user-movement which will render the touch-based biometrics ineffective. To address this, we integrate a movement-based biometrics for each user with previous touch-based biometrics. We conduct extensive evaluations of our approaches on the Android smartphone, we show that the user identification accuracy is over 99%.
Artificial Intelligence Based Cognitive Routing for Cognitive Radio Networks
Venue: arXiv cs.NI 2013
Year: 2013

Cognitive radio networks (CRNs) are networks of nodes equipped with cognitive radios that can optimize performance by adapting to network conditions. While cognitive radio networks (CRN) are envisioned as intelligent networks, relatively little research has focused on the network level functionality of CRNs. Although various routing protocols, incorporating varying degrees of adaptiveness, have been proposed for CRNs, it is imperative for the long term success of CRNs that the design of cognitive routing protocols be pursued by the research community. Cognitive routing protocols are envisioned as routing protocols that fully and seamless incorporate AI-based techniques into their design. In this paper, we provide a self-contained tutorial on various AI and machine-learning techniques that have been, or can be, used for developing cognitive routing protocols. We also survey the application of various classes of AI techniques to CRNs in general, and to the problem of routing in particular. We discuss various decision making techniques and learning techniques from AI and document their current and potential applications to the problem of routing in CRNs. We also highlight the various inference, reasoning, modeling, and learning sub tasks that a cognitive routing protocol must solve. Finally, open research issues and future directions of work are identified.
A complementary construction using mutually unbiased bases
Venue: arXiv cs.IT 2013
Year: 2013

We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We also sketch an algorithm to uniquely generate these sequences. The pairwise squared inner-product of members of the sequence set is shown to be $\frac{1}{2}$. Moreover, a subset of the set can be viewed as a codebook that asymptotically achieves $\sqrt{\frac{3}{2}}$ times the Welch bound.
Haptic Science and Technology
Venue: arXiv cs.HC 2013
Year: 2013

Haptic technology, or haptics, is a tactile feedback technology which takes advantage of a user's sense of touch by applying forces, vibrations, and/or motions upon the user. This mechanical stimulation may be used to assist in the creation of virtual objects (objects existing only in a computer simulation), for control of such virtual objects, and for the enhancement of the remote control of machines and devices. It has been described as for the sense of touch what computer graphics does for vision. Although haptic devices are capable of measuring bulk or reactive forces that are applied by the user, it should not be confused with touch or tactile sensors that measure the pressure or force exerted by the user to the interface.
A new kind of complexity
Venue: arXiv cs.CC 2013
Year: 2013

A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that instances are easy to compute but if input to the function is vague the description of a function is exponentially complex. This property puts a new light on randomness especially on the random oracle model with a couple of practical examples of random oracle implementation. Consequently, there is a new interesting viewpoint on computational complexity in general.
Infinite probability computation by cyclic explanation graphs
Venue: arXiv cs.PL 2013
Year: 2013

Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to compute an infinite sum of probabilities for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for probabilistic context free grammars (PCFGs) to probabilistic logic programs. Given a top-goal, we search for all proofs with tabling and obtain an explanation graph which compresses them and may be cyclic. We then convert the explanation graph to a set of linear probability equations and solve them by matrix operation. The solution gives us the probability of the top-goal, which, in nature, is an infinite sum of probabilities. Our general approach to prefix probability computation through tabling not only allows to deal with non-PCFGs such as probabilistic left-corner grammars (PLCGs) but has applications such as plan recognition and probabilistic model checking and makes it possible to compute probability for probabilistic models describing cyclic relations. To appear in Theory and Practice of Logic Programming (TPLP).
Distributed Sensing and Transmission of Sporadic Random Samples in a Multiple-Access Channel
Venue: arXiv cs.IT 2013
Year: 2013

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a network of sensors and transmitted with finite energy to a common receiver via an additive white Gaussian noise asynchronous multiple-access channel. Transmission makes use of a perfect causal feedback link to the encoder connected to each sensor. A retransmission protocol inspired by the classical scheme in [1] applied to the transmission of single and bi-variate analog samples analyzed in [2] and [3] is extended to the more general network scenario, for which asymptotic upper-bounds on the reconstruction error are provided. Both the upper and lower-bounds show that collaboration can be achieved through energy accumulation under certain circumstances. In order to investigate the practical performance of the proposed retransmission protocol we provide a numerical evaluation of the upper-bounds in the non-asymptotic energy regime using low-order quantization in the sensors. The latter includes a minor modification of the protocol to improve reconstruction fidelity. Numerical results show that an increase in the size of the network brings benefit in terms of performance, but that the gain in terms of energy efficiency diminishes quickly at finite energies due to a non-coherent combining loss.
The Harmony Platform
Venue: arXiv cs.SE 2013
Year: 2013

According to Wikipedia, The Mining Software Repositories (MSR) field analyzes the rich data available in software repositories, such as version control repositories, mailing list archives, bug tracking systems, issue tracking systems, etc. to uncover interesting and actionable information about software systems, projects and software engineering. The MSR field has received a great deal of attention and has now its own research conference : http://www.msrconf.org/. However performing MSR studies is still a technical challenge. Indeed, data sources (such as version control system or bug tracking systems) are highly heterogeneous. Moreover performing a study on a lot of data sources is very expensive in terms of execution time. Surprisingly, there are not so many tools able to help researchers in their MSR quests. This is why we created the Harmony platform, as a mean to assist researchers in performing MSR studies.
Botnet economics and devising defence schemes from attackers own reward processes
Venue: arXiv cs.CR 2013
Year: 2013

This paper focuses on botnet economics and design of defensive strategies. It takes the view that by combining scarce information on the attackers business models, with rational economic analysis of these business processes, one can identify design rules for economic defense mechanisms which the target can implement, often in a cheap way in addition to technical means. A short survey of game theory in the security area, is followed by a real case of an Internet casino. This leads to develop a model, applicable to this case and others, which is presented first qualitatively then quantitatively. This allows carrying out different analyses based on different equilibrium or termination principles; the ones studied are reward break-even analysis, and Max-Min analysis from game theory, for the target and the attackers. On that basis, a number of specific economic and information led defense strategies are identified which can be further studied using the model and specific adaptations to other data or cases.
Multiparameter Monitoring and Fault Indication Using Inductive Power Transfer System
Venue: arXiv cs.OH 2013
Year: 2013

The paper aims at demonstrating communication capabilities of IPT. For this data communication is performed between two modules using the concept of IPT. IPT was deemed to be the best solution to the system houses a multi parameter acquisition module such as temperature, speed, voltage, current and data transfer from the motor. The receiver side is another microcontroller coupled to an inductive coil that gets the data and displays in the LCD. A brief background to IPT Inductive Power Transfer technology and its applications is given and the design criteria for the paper are defined in detail. To be accurate, IPT data communication helps to reduce unnecessary wire connections and data is transmitted without any touch. Further the paper can be enhanced by looking for fault analysis inside the motor. This can be done by analyzing various parameters of the motor. A novel two-way IPT communication system was designed, which worked on the concept of pulsing the system on and off to send data serially. The paper involves transmission of data through inductive flux without any contact between the two modules. Further as no frequency tunings or any calibration is required between different modules a single system can be used with multiple clients. This reduces a lot of hazards such as interference with other modules and RF transmitters in the vicinity.
Majority Rule for Belief Evolution in Social Networks
Venue: arXiv cs.AI 2013
Year: 2013

In this paper, we study how an agent's belief is affected by her neighbors in a social network. We first introduce a general framework, where every agent has an initial belief on a statement, and updates her belief according to her and her neighbors' current beliefs under some belief evolution functions, which, arguably, should satisfy some basic properties. Then, we focus on the majority rule belief evolution function, that is, an agent will (dis)believe the statement iff more than half of her neighbors (dis)believe it. We consider some fundamental issues about majority rule belief evolution, for instance, whether the belief evolution process will eventually converge. The answer is no in general. However, for random asynchronous belief evolution, this is indeed the case.
A General, Tractable and Accurate Model for a Cascade of Caches
Venue: arXiv cs.NI 2013
Year: 2013

Performance evaluation of caching systems is an old and widely investigated research topic. The research community is once again actively working on this topic because the Internet is evolving towards new transfer modes, which envisage to cache both contents and instructions within the network. In particular, there is interest in characterizing multi-cache systems, in which requests not satisfied by a cache are forwarded to other caches. In this field, this paper contributes as follows. First, we devise a simple but accurate approximate analysis for caches fed by general "renewal" traffic patterns. Second, we characterize and model the traffic statistics for the output (miss) stream. Third, we show in the simple example case of tandem caches how the resulting output stream model can be conveniently exploited to analyze the performance of subsequent cache stages. The main novelty of our work stems in the ability to handle traffic patterns beyond the traditional independent reference model, thus permitting simple assessment of cascade of caches as well as improved understanding of the phenomena involved in cache hierarchies.
Application of Expurgated PPM to Indoor Visible Light Communications - Part II: Access Networks
Venue: arXiv cs.IT 2013
Year: 2013

Providing network access for multiple users in a visible light communication (VLC) system that utilizes white light emitting diodes (LED) as sources requires new networking techniques adapted to the lighting features. In this paper we introduce two multiple access techniques using expurgated PPM (EPPM) that can be implemented using LEDs and support lighting features such as dimming. Multilevel symbols are used to provide M-ary signaling for multiple users using multilevel EPPM (MEPPM). Using these multiple-access schemes we are able to control the optical peak to average power ratio (PAPR) in the system, and hereby control the dimming level. In the first technique, the M-ary data of each user is first encoded using an optical orthogonal code (OOC) assigned to the user, and the result is fed into a EPPM encoder to generate a multilevel signal. The second multiple access method uses sub-sets of the EPPM constellation to apply MEPPM to the data of each user. While the first approach has a larger Hamming distance between the symbols of each user, the latter can provide higher bit-rates for users in VLC systems using bandwidth-limited LEDs.
An Exploratory Data Survey of Drug Name Incidence and Prevalence From the FDA's Adverse Event Reporting System, 2004 to 2012Q2
Venue: arXiv cs.CE 2013
Year: 2013

Drug Names, Population Level Surveillance and the FDA's Adverse Event Reporting System: An Exploratory Data Survey of Drug Name Incidence and Prevalence, 2004-2012Q2 Purpose: To count and monitor the drug names reported in the publicly available version of the Federal Adverse Event Reporting System (FAERS) from 2004 to 2012Q2 in a maximized sensitivity relational model. Methods: Data mining and data modeling was conducted and event based summary statistics with plots were created from over nine continuous years of continuous FAERS data. Results: This FAERS model contains 344,452 individual drug names and 432,541,994 count references which occurred across 4,148,761 human subjects in the 34 quarter study period. Plots for the top 100 scoring drug name references are reported by year and quarter; the top 100 drug names contain 143,384,240 references or 33% of all drug name references over 34 quarters of continuous FAERS data. Conclusions: While FAERS contains many drugs and adverse event reports, its data pertains to very few of them. Drug name incidence lends timely and effective surveillance of large populations of Averse Event Reports and does not require the cause of the AE, nor its validity to be known to detect a mass poisoning.
Performance Analysis and Optimal Power Allocation for Linear Receivers Based on Superimposed Training
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we derive a performance comparison between two training-based schemes for Multiple-Input Multiple-Output (MIMO) systems. The two schemes are thetime-division multiplexing scheme and the recently proposed data-dependent superimposed pilot scheme. For both schemes, a closed-form expressions for the Bit Error Rate (BER) is provided. We also determine, for both schemes, the optimal allocation of power between pilot and data that minimizes the BER.
Non-monotonic Pre-fixed Points and Learning
Venue: arXiv cs.LO 2013
Year: 2013

We consider the problem of finding pre-fixed points of interactive realizers over arbitrary knowledge spaces, obtaining a relative recursive procedure. Knowledge spaces and interactive realizers are an abstract setting to represent learning processes, that can interpret non-constructive proofs. Atomic pieces of information of a knowledge space are stratified into levels, and evaluated into truth values depending on knowledge states. Realizers are then used to define operators that extend a given state by adding and possibly removing atoms: in a learning process states of knowledge change nonmonotonically. Existence of a pre-fixed point of a realizer is equivalent to the termination of the learning process with some state of knowledge which is free of patent contradictions and such that there is nothing to add. In this paper we generalize our previous results in the case of level 2 knowledge spaces and deterministic operators to the case of omega-level knowledge spaces and of non-deterministic operators.
A Coinductive Approach to Proof Search
Venue: arXiv cs.LO 2013
Year: 2013

We propose to study proof search from a coinductive point of view. In this paper, we consider intuitionistic logic and a focused system based on Herbelin's LJT for the implicational fragment. We introduce a variant of lambda calculus with potentially infinitely deep terms and a means of expressing alternatives for the description of the "solution spaces" (called Böhm forests), which are a representation of all (not necessarily well-founded but still locally well-formed) proofs of a given formula (more generally: of a given sequent). As main result we obtain, for each given formula, the reduction of a coinductive definition of the solution space to a effective coinductive description in a finitary term calculus with a formal greatest fixed-point operator. This reduction works in a quite direct manner for the case of Horn formulas. For the general case, the naive extension would not even be true. We need to study "co-contraction" of contexts (contraction bottom-up) for dealing with the varying contexts needed beyond the Horn fragment, and we point out the appropriate finitary calculus, where fixed-point variables are typed with sequents. Co-contraction enters the interpretation of the formal greatest fixed points - curiously in the semantic interpretation of fixed-point variables and not of the fixed-point operator.
The four-in-a-tree problem in triangle-free graphs
Venue: arXiv cs.DM 2013
Year: 2013

The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time $O(n^4)$ whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question: what does a triangle-free graph look like if no induced tree covers four given vertices? Our main result says that any such graph must have the "same structure", in a sense to be defined precisely, as a square or a cube. We provide an $O(nm)$-time algorithm that given a triangle-free graph $G$ together with four vertices outputs either an induced tree that contains them or a partition of $V(G)$ certifying that no such tree exists. We prove that the problem of deciding whether there exists a tree $T$ covering the four vertices such that at most one vertex of $T$ has degree at least 3 is NP-complete.
Automated Thermal Face recognition based on Minutiae Extraction
Venue: arXiv cs.CV 2013
Year: 2013

In this paper an efficient approach for human face recognition based on the use of minutiae points in thermal face image is proposed. The thermogram of human face is captured by thermal infra-red camera. Image processing methods are used to pre-process the captured thermogram, from which different physiological features based on blood perfusion data are extracted. Blood perfusion data are related to distribution of blood vessels under the face skin. In the present work, three different methods have been used to get the blood perfusion image, namely bit-plane slicing and medial axis transform, morphological erosion and medial axis transform, sobel edge operators. Distribution of blood vessels is unique for each person and a set of extracted minutiae points from a blood perfusion data of a human face should be unique for that face. Two different methods are discussed for extracting minutiae points from blood perfusion data. For extraction of features entire face image is partitioned into equal size blocks and the total number of minutiae points from each block is computed to construct final feature vector. Therefore, the size of the feature vectors is found to be same as total number of blocks considered. A five layer feed-forward back propagation neural network is used as the classification tool. A number of experiments were conducted to evaluate the performance of the proposed face recognition methodologies with varying block size on the database created at our own laboratory. It has been found that the first method supercedes the other two producing an accuracy of 97.62% with block size 16X16 for bit-plane 4.
Compact Representations of Extended Causal Models
Venue: arXiv cs.AI 2013
Year: 2013

Judea Pearl was the first to propose a definition of actual causation using causal models. A number of authors have suggested that an adequate account of actual causation must appeal not only to causal structure, but also to considerations of normality. In earlier work, we provided a definition of actual causation using extended causal models, which include information about both causal structure and normality. Extended causal models are potentially very complex. In this paper, we show how it is possible to achieve a compact representation of extended causal models.
A GPU Implementation for Two-Dimensional Shallow Water Modeling
Venue: arXiv cs.DC 2013
Year: 2013

In this paper, we present a GPU implementation of a two-dimensional shallow water model. Water simulations are useful for modeling floods, river/reservoir behavior, and dam break scenarios. Our GPU implementation shows vast performance improvements over the original Fortran implementation. By taking advantage of the GPU, researchers and engineers will be able to study water systems more efficiently and in greater detail.