OpenRaiser/Intern-Atlas huggingface dataset:
Flexible Dynamic Information Flow Control in the Presence of Exceptions
Venue: arXiv cs.CR 2012
Year: 2012

We describe a new, dynamic, floating-label approach to language-based information flow control. A labeled IO monad, LIO, keeps track of a current label and permits restricted access to IO functionality. The current label floats to exceed the labels of all data observed and restricts what can be modified. Unlike other language-based work, LIO also bounds the current label with a current clearance that provides a form of discretionary access control. Computations may encapsulate and pass around the results of computations with different labels. In addition, the LIO monad offers a simple form of labeled mutable references and exception handling. We give precise semantics and prove confidentiality and integrity properties of a call-by-name λ-calculus and provide an implementation in Haskell.
On the Generalized Delay-Capacity Tradeoff of Mobile Networks with Lévy Flight Mobility
Venue: arXiv cs.NI 2012
Year: 2012

In the literature, scaling laws for wireless mobile networks have been characterized under various models of node mobility and several assumptions on how communication occurs between nodes. To improve the realism in the analysis of scaling laws, we propose a new analytical framework. The framework is the first to consider a Lévy flight mobility pattern, which is known to closely mimic human mobility patterns. Also, this is the first work that allows nodes to communicate while being mobile. Under this framework, delays ($\bar{D}$) to obtain various levels of per-node throughput $(λ)$ for Lévy flight are suggested as $\bar{D}(λ) = O(\sqrt{\min (n^{1+α} λ, n^2)})$, where Lévy flight is a random walk of a power-law flight distribution with an exponent $α\in (0,2]$. The same framework presents a new tighter tradeoff $\bar{D}(λ) = O(\sqrt{\max (1,nλ^3)})$ for \textit{i.i.d.} mobility, whose delays are lower than existing results for the same levels of per-node throughput.
Ensemble Properties of RVQ-Based Limited-Feedback Beamforming Codebooks
Venue: arXiv cs.IT 2012
Year: 2012

The ensemble properties of Random Vector Quantization (RVQ) codebooks for limited-feedback beamforming in multi-input multi-output (MIMO) systems are studied with the metrics of interest being the received SNR loss and mutual information loss, both relative to a perfect channel state information (CSI) benchmark. The simplest case of unskewed codebooks is studied in the correlated MIMO setting and these loss metrics are computed as a function of the number of bits of feedback ($B$), transmit antenna dimension ($N_t$), and spatial correlation. In particular, it is established that: i) the loss metrics are a product of two components -- a quantization component and a channel-dependent component; ii) the quantization component, which is also common to analysis of channels with independent and identically distributed (i.i.d.) fading, decays as $B$ increases at the rate $2^{-B/(N_t-1)}$; iii) the channel-dependent component reflects the condition number of the channel. Further, the precise connection between the received SNR loss and the squared singular values of the channel is shown to be a Schur-convex majorization relationship. Finally, the ensemble properties of skewed codebooks that are generated by skewing RVQ codebooks with an appropriately designed fixed skewing matrix are studied. Based on an estimate of the loss expression for skewed codebooks, it is established that the optimal skewing matrix is critically dependent on the condition numbers of the effective channel (product of the true channel and the skewing matrix) and the skewing matrix.
Data Mining on Educational Domain
Venue: arXiv cs.DB 2012
Year: 2012

Educational data mining (EDM) is defined as the area of scientific inquiry centered around the development of methods for making discoveries within the unique kinds of data that come from educational settings, and using those methods to better understand students and the settings which they learn in. Data mining enables organizations to use their current reporting capabilities to uncover and understand hidden patterns in vast databases. As a result of this insight, institutions are able to allocate resources and staff more effectively. In this paper, we present a real-world experiment conducted in Shree Rayeshwar Institute of Engineering and Information Technology (SRIEIT) in Goa, India. Here we found the relevant subjects in an undergraduate syllabus and the strength of their relationship. We have also focused on classification of students into different categories such as good, average, poor depending on their marks scored by them by obtaining a decision tree which will predict the performance of the students and accordingly help the weaker section of students to improve in their academics. We have also found clusters of students for helping in analyzing student's performance and also improvising the subject teaching in that particular subject.
A Secure Dynamic Job Scheduling on Smart Grid using RSA Algorithm
Venue: arXiv cs.OS 2012
Year: 2012

Grid computing is a computation methodology using group of clusters connected over high-speed networks that involves coordinating and sharing computational power, data storage and network resources. Integrating a set of clusters of workstations into one large computing environment can improve the availability of computing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. A secure scheduling model is presented, that performs job grouping activity at runtime. In a Grid environment, security is necessary because grid is a dynamic environment and participates are independent bodies with different policies, objectives and requirements. Authentication should be verified for Grid resource owners as well as resource requesters before they are allowed to join in scheduling activities. In order to achieve secure resource and job scheduling including minimum processing time and maximum resource utilization, A Secure Resource by using RSA algorithm on Networking and Job Scheduling model with Job Grouping strategy(JGS) in Grid Computing has been proposed. The result shows significant improvement in the processing time of jobs and resource utilization as compared to dynamic job grouping (DJG) based scheduling on smart grids (SG).
Security Architecture for Cluster based Ad Hoc Networks
Venue: arXiv cs.CR 2012
Year: 2012

Mobile Ad hoc Networks (MANETs) are subject to various kinds of attacks. Deploying security mechanisms is difficult due to inherent properties of ad hoc networks, such as the high dynamics of their topology, restricted bandwidth, and limited resources in end device. With such dynamicity in connectivity and limited resources it is not possible to deploy centralized security solution but distribution solution. The paper proposes architectural security concept in distributed manner where network is divided into clusters with one cluster head node each. This cluster head node also act as a router providing proactive hidden routing by using Steganographic methods for inter-cluster security. Besides cipher method is used to provide intra-cluster security. The proposed secure architecture specifies operational view of cluster head as a router that provides trust, anonymity and confidentiality through Steganography and Cryptography respectively.
Performance Study of Localization Techniques in Wireless Body Area Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

One of the major issues in Wireless Body Area Sensor Networks (WBASNs) is efficient localization. There are various techniques for indoor and outdoor environments to locate a person. This study evaluating and compares performance of optimization schemes in indoor environments for optimal placement of wireless sensors, where patients can perform their daily activities. In indoor environments, the performance comparison between Distance Vector-Hop algorithm, Ring Overlapping Based on Comparison Received Signal Strength Indicator (ROCRSSI), Particle filtering and Kalman filtering based location tracking techniques, in terms of localization accuracy is estimated. Results show that particle filtering outperforms all. GPS and several techniques based on GSMlocation tracking schemes are proposed for outdoor environments. Hidden Markov GSM based location tracking scheme efficiently performs among all, in terms of location accuracy and computational overheads.
Optimal Euclidean spanners: really short, thin and lanky
Venue: arXiv cs.DS 2012
Year: 2012

In a seminal STOC'95 paper, titled "Euclidean spanners: short, thin and lanky", Arya et al. devised a construction of Euclidean $(1+\eps)$-spanners that achieves constant degree, diameter $O(\log n)$, and weight $O(\log^2 n) \cdot ω(MST)$, and has running time $O(n \cdot \log n)$. This construction applies to $n$-point constant-dimensional Euclidean spaces. Moreover, Arya et al. conjectured that the weight bound can be improved by a logarithmic factor, without increasing the degree and the diameter of the spanner, and within the same running time. This conjecture of Arya et al. became a central open problem in the area of Euclidean spanners. In this paper we resolve the long-standing conjecture of Arya et al. in the affirmative. Specifically, we present a construction of spanners with the same stretch, degree, diameter, and running time, as in Arya et al.'s result, but with optimal weight $O(\log n) \cdot ω(MST)$. Moreover, our result is more general in three ways. First, we demonstrate that the conjecture holds true not only in constant-dimensional Euclidean spaces, but also in doubling metrics. Second, we provide a general tradeoff between the three involved parameters, which is tight in the entire range. Third, we devise a transformation that decreases the lightness of spanners in general metrics, while keeping all their other parameters in check. Our main result is obtained as a corollary of this transformation.
Telerobotic Pointing Gestures Shape Human Spatial Cognition
Venue: arXiv cs.HC 2012
Year: 2012

This paper aimed to explore whether human beings can understand gestures produced by telepresence robots. If it were the case, they can derive meaning conveyed in telerobotic gestures when processing spatial information. We conducted two experiments over Skype in the present study. Participants were presented with a robotic interface that had arms, which were teleoperated by an experimenter. The robot could point to virtual locations that represented certain entities. In Experiment 1, the experimenter described spatial locations of fictitious objects sequentially in two conditions: speech condition (SO, verbal descriptions clearly indicated the spatial layout) and speech and gesture condition (SR, verbal descriptions were ambiguous but accompanied by robotic pointing gestures). Participants were then asked to recall the objects' spatial locations. We found that the number of spatial locations recalled in the SR condition was on par with that in the SO condition, suggesting that telerobotic pointing gestures compensated ambiguous speech during the process of spatial information. In Experiment 2, the experimenter described spatial locations non-sequentially in the SR and SO conditions. Surprisingly, the number of spatial locations recalled in the SR condition was even higher than that in the SO condition, suggesting that telerobotic pointing gestures were more powerful than speech in conveying spatial information when information was presented in an unpredictable order. The findings provide evidence that human beings are able to comprehend telerobotic gestures, and importantly, integrate these gestures with co-occurring speech. This work promotes engaging remote collaboration among humans through a robot intermediary.
How good are MatLab, Octave and Scilab for Computational Modelling?
Venue: arXiv cs.MS 2012
Year: 2012

In this article we test the accuracy of three platforms used in computational modelling: MatLab, Octave and Scilab, running on i386 architecture and three operating systems (Windows, Ubuntu and Mac OS). We submitted them to numerical tests using standard data sets and using the functions provided by each platform. A Monte Carlo study was conducted in some of the datasets in order to verify the stability of the results with respect to small departures from the original input. We propose a set of operations which include the computation of matrix determinants and eigenvalues, whose results are known. We also used data provided by NIST (National Institute of Standards and Technology), a protocol which includes the computation of basic univariate statistics (mean, standard deviation and first-lag correlation), linear regression and extremes of probability distributions. The assessment was made comparing the results computed by the platforms with certified values, that is, known results, computing the number of correct significant digits.
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star
Venue: arXiv cs.FL 2012
Year: 2012

We study the state complexity of boolean operations and product (concatenation, catenation) combined with star. We derive tight upper bounds for the symmetric differences and differences of two languages, one or both of which are starred, and for the product of two starred languages. We prove that the previously discovered bounds for the union and the intersection of languages with one or two starred arguments, for the product of two languages one of which is starred, and for the star of the product of two languages can all be met by the recently introduced universal witnesses and their variants.
On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized in terms of the rank of the channel matrices. It is shown that \emph{linear precoding} with Han-Kobayashi type of rate-splitting, i.e., splitting the information-bearing symbols of each user into common and private parts, is sufficient to achieve all the rate pairs in the derived capacity region. The capacity result is applied to obtain an achievable rate region for the double-unicast networks with random network coding at the intermediate nodes, which can be modeled by the two-user MIMO linear deterministic IC studied. It is shown that the newly proposed achievable region is strictly larger than the existing regions in the literature.
High-throughput Genome-wide Association Analysis for Single and Multiple Phenotypes
Venue: arXiv cs.CE 2012
Year: 2012

The variance component tests used in genomewide association studies of thousands of individuals become computationally exhaustive when multiple traits are analysed in the context of omics studies. We introduce two high-throughput algorithms -- CLAK-CHOL and CLAK-EIG -- for single and multiple phenotype genome-wide association studies (GWAS). The algorithms, generated with the help of an expert system, reduce the computational complexity to the point that thousands of traits can be analyzed for association with millions of polymorphisms in a course of days on a standard workstation. By taking advantage of problem specific knowledge, CLAK-CHOL and CLAK-EIG significantly outperform the current state-of-the-art tools in both single and multiple trait analysis.
I/O-Efficient Dynamic Planar Range Skyline Queries
Venue: arXiv cs.DS 2012
Year: 2012

We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \textit{3-sided range skyline reporting queries} in $\bigO (\log_{2B^ε} n + \frac{t}{B^{1-ε}})$ I/Os and updates in $\bigO (\log_{2B^ε} n)$ I/Os, using $\bigO (\frac{n}{B^{1-ε}})$ blocks of space, for $n$ input planar points, $t$ reported points, and parameter $0 \leq ε\leq 1$. We obtain the result by extending Sundar's priority queues with attrition to support the operations \textsc{DeleteMin} and \textsc{CatenateAndAttrite} in $\bigO (1)$ worst case I/Os, and in $\bigO(1/B)$ amortized I/Os given that a constant number of blocks is already loaded in main memory. Finally, we show that any pointer-based static data structure that supports \textit{dominated maxima reporting queries}, namely the difficult special case of 4-sided skyline queries, in $\bigO(\log^{\bigO(1)}n +t)$ worst case time must occupy $Ω(n \frac{\log n}{\log \log n})$ space, by adapting a similar lower bounding argument for planar 4-sided range reporting queries.
Some Euler-type formulas for planar graphs
Venue: arXiv cs.DM 2012
Year: 2012

The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems
Venue: arXiv cs.LO 2012
Year: 2012

We combine quantified differential dynamic logic (QdL) for reasoning about the possible behavior of distributed hybrid systems with temporal logic for reasoning about the temporal behavior during their operation. Our logic supports verification of temporal and non-temporal properties of distributed hybrid systems and provides a uniform treatment of discrete transitions, continuous evolution, and dynamic dimensionality-changes. For our combined logic, we generalize the semantics of dynamic modalities to refer to hybrid traces instead of final states. Further, we prove that this gives a conservative extension of QdL for distributed hybrid systems. On this basis, we provide a modular verification calculus that reduces correctness of temporal behavior of distributed hybrid systems to non-temporal reasoning, and prove that we obtain a complete axiomatization relative to the non-temporal base logic QdL. Using this calculus, we analyze temporal safety properties in a distributed air traffic control system where aircraft can appear dynamically.
LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions
Venue: arXiv cs.LO 2012
Year: 2012

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes the view on these formalisms as logics of (generalized) inductive definitions. The goal of this paper is to study a deductive inference method for PC(ID), which is the propositional fragment of FO(ID). We introduce a formal proof system based on the sequent calculus (Gentzen-style deductive system) for this logic. As PC(ID) is an integration of classical propositional logic and propositional inductive definitions, our sequent calculus proof system integrates inference rules for propositional calculus and definitions. We present the soundness and completeness of this proof system with respect to a slightly restricted fragment of PC(ID). We also provide some complexity results for PC(ID). By developing the proof system for PC(ID), it helps us to enhance the understanding of proof-theoretic foundations of FO(ID), and therefore to investigate useful proof systems for FO(ID).
Automated Training and Maintenance through Kinect
Venue: arXiv cs.CV 2012
Year: 2012

In this paper, we have worked on reducing burden on mechanic involving complex automobile maintenance activities that are performed in centralised workshops. We have presented a system prototype that combines Augmented Reality with Kinect. With the use of Kinect, very high quality sensors are available at considerably low costs, thus reducing overall expenditure for system design. The system can be operated either in Speech mode or in Gesture mode. The system can be controlled by various audio commands if user opts for Speech mode. The same controlling can also be done by using a set of Gestures in Gesture mode. Gesture recognition is the task performed by Kinect system. This system, bundled with RGB and Depth camera, processes the skeletal data by keeping track of 20 different body joints. Recognizing Gestures is done by verifying user movements and checking them against predefined condition. Augmented Reality module captures real-time image data streams from high resolution camera. This module then generates 3D model that is superimposed on real time data.
Efficient Prediction of DNA-Binding Proteins Using Machine Learning
Venue: arXiv cs.CV 2012
Year: 2012

DNA-binding proteins are a class of proteins which have a specific or general affinity to DNA and include three important components: transcription factors; nucleases, and histones. DNA-binding proteins also perform important roles in many types of cellular activities. In this paper we describe machine learning systems for the prediction of DNA- binding proteins where a Support Vector Machine and a Cascade Correlation Neural Network are optimized and then compared to determine the learning algorithm that achieves the best prediction performance. The information used for classification is derived from characteristics that include overall charge, patch size and amino acids composition. In total 121 DNA- binding proteins and 238 non-binding proteins are used to build and evaluate the system. For SVM using the ANOVA Kernel with Jack-knife evaluation, an accuracy of 86.7% has been achieved with 91.1% for sensitivity and 85.3% for specificity. For CCNN optimized over the entire dataset with Jack knife evaluation we report an accuracy of 75.4%, while the values of specificity and sensitivity achieved were 72.3% and 82.6%, respectively.
Training Optimization for Energy Harvesting Communication Systems
Venue: arXiv cs.IT 2012
Year: 2012

Energy harvesting (EH) has recently emerged as an effective way to solve the lifetime challenge of wireless sensor networks, as it can continuously harvest energy from the environment. Unfortunately, it is challenging to guarantee a satisfactory short-term performance in EH communication systems because the harvested energy is sporadic. In this paper, we consider the channel training optimization problem in EH communication systems, i.e., how to obtain accurate channel state information to improve the communication performance. In contrast to conventional communication systems, the optimization of the training power and training period in EH communication systems is a coupled problem, which makes such optimization very challenging. We shall formulate the optimal training design problem for EH communication systems, and propose two solutions that adaptively adjust the training period and power based on either the instantaneous energy profile or the average energy harvesting rate. Numerical and simulation results will show that training optimization is important in EH communication systems. In particular, it will be shown that for short block lengths, training optimization is critical. In contrast, for long block lengths, the optimal training period is not too sensitive to the value of the block length nor to the energy profile. Therefore, a properly selected fixed training period value can be used.