OpenRaiser/Intern-Atlas huggingface dataset:
Determination of RF source power in WPSN using modulated backscattering
Venue: arXiv cs.OH 2012
Year: 2012

A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants, at different locations. During RF transmission energy consumed by critically energy-constrained sensor nodes in a WSN is related to the life time system, but the life time of the system is inversely proportional to the energy consumed by sensor nodes. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints. In this we are going to investigate the system analytically. To obtain interference-free communication connectivity with the WPSN nodes number of RF sources is determined and analyzed in terms of output power and the transmission frequency of RF sources, network size, RF source and WPSN node characteristics. The results of this paper reveal that communication coverage and RF Source Power can be practically maintained in WPSN through careful selection of design parameters
Analytical Study of Hexapod miRNAs using Phylogenetic Methods
Venue: arXiv cs.CE 2012
Year: 2012

MicroRNAs (miRNAs) are a class of non-coding RNAs that regulate gene expression. Identification of total number of miRNAs even in completely sequenced organisms is still an open problem. However, researchers have been using techniques that can predict limited number of miRNA in an organism. In this paper, we have used homology based approach for comparative analysis of miRNA of hexapoda group .We have used Apis mellifera, Bombyx mori, Anopholes gambiae and Drosophila melanogaster miRNA datasets from miRBase repository. We have done pair wise as well as multiple alignments for the available miRNAs in the repository to identify and analyse conserved regions among related species. Unfortunately, to the best of our knowledge, miRNA related literature does not provide in depth analysis of hexapods. We have made an attempt to derive the commonality among the miRNAs and to identify the conserved regions which are still not available in miRNA repositories. The results are good approximation with a small number of mismatches. However, they are encouraging and may facilitate miRNA biogenesis for
Neural Network Approach for Eye Detection
Venue: arXiv cs.CV 2012
Year: 2012

Driving support systems, such as car navigation systems are becoming common and they support driver in several aspects. Non-intrusive method of detecting Fatigue and drowsiness based on eye-blink count and eye directed instruction controlhelps the driver to prevent from collision caused by drowsy driving. Eye detection and tracking under various conditions such as illumination, background, face alignment and facial expression makes the problem complex.Neural Network based algorithm is proposed in this paper to detect the eyes efficiently. In the proposed algorithm, first the neural Network is trained to reject the non-eye regionbased on images with features of eyes and the images with features of non-eye using Gabor filter and Support Vector Machines to reduce the dimension and classify efficiently. In the algorithm, first the face is segmented using L*a*btransform color space, then eyes are detected using HSV and Neural Network approach. The algorithm is tested on nearly 100 images of different persons under different conditions and the results are satisfactory with success rate of 98%.The Neural Network is trained with 50 non-eye images and 50 eye images with different angles using Gabor filter. This paper is a part of research work on "Development of Non-Intrusive system for real-time Monitoring and Prediction of Driver Fatigue and drowsiness" project sponsored by Department of Science & Technology, Govt. of India, New Delhi at Vignan Institute of Technology and Sciences, Vignan Hills, Hyderabad.
OTS/CafeOBJ2JML: An attempt to combine Design By Contract with Behavioral Specifications
Venue: arXiv cs.SE 2012
Year: 2012

Design by Constract (DBC) has influenced the development of formal specification languages that allow the mix of specification and implementation code, like Eiffel, the Java Modeling Language (JML) and Spec#. Meanwhile algebraic specification languages have been developing independently and offer full support for specification and verification of design for large and complex systems in a mathematical rigorous way. However there is no guarantee that the final implementation will comply to the specification. In this paper we proposed the use of the latter for the specification and verification of the systems design and then by presenting a translation between the two, the use of the former to ensure that the implementation respects the specification and thus enjoy the verified properties.
Distributed Connectivity of Wireless Networks
Venue: arXiv cs.NI 2012
Year: 2012

We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set of $n$ points in the plane, and b) scheduling it efficiently in the SINR model of interference. The nodes must converge on a solution in a distributed manner, having no means of communication beyond the sole wireless channel. We give distributed connectivity algorithms that run in time $O(poly(\log Δ, \log n))$, where $Δ$ is the ratio between the longest and shortest distances among nodes. Given that algorithm without prior knowledge of the instance are essentially limited to using uniform power, this is close to best possible. Our primary aim, however, is to find efficient structures, measured in the number of slots used in the final schedule of the links. Our main result is algorithms that match the efficiency of centralized solutions. Specifically, the networks can be scheduled in $O(\log n)$ slots using (arbitrary) power control, and in $O(\log n (\log\log Δ+ \log n))$ slots using a simple oblivious power scheme. Additionally, the networks have the desirable properties that the latency of a converge-cast and of any node-to-node communication is optimal $O(\log n)$ time.
A hybrid clustering algorithm for data mining
Venue: arXiv cs.DB 2012
Year: 2012

Data clustering is a process of arranging similar data into groups. A clustering algorithm partitions a data set into several groups such that the similarity within a group is better than among groups. In this paper a hybrid clustering algorithm based on K-mean and K-harmonic mean (KHM) is described. The proposed algorithm is tested on five different datasets. The research is focused on fast and accurate clustering. Its performance is compared with the traditional K-means & KHM algorithm. The result obtained from proposed hybrid algorithm is much better than the traditional K-mean & KHM algorithm.
Language-Constraint Reachability Learning in Probabilistic Graphs
Venue: arXiv cs.AI 2012
Year: 2012

The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, given a probabilistic graph we adopted the language-constraint reachability method to compute the probability of possible interconnections that may exists between two nodes. Each of these connections may be viewed as feature, or a factor, between the two nodes and the corresponding probability as its weight. Each observed link is considered as a positive instance for its corresponding link label. Given the training set of observed links a L2-regularized Logistic Regression has been adopted to learn a model able to predict unobserved link labels. The experiments on a real world collaborative filtering problem proved that the proposed approach achieves better results than that obtained adopting classical methods.
Turing-equivalent automata using a fixed-size quantum memory
Venue: arXiv cs.CC 2012
Year: 2012

In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from their classical counterparts (Arthur-Merlin proof system and alternating Turing machine, respectively,) by augmenting them with a fixed-size quantum register. We focus on space-bounded computation, and obtain the following surprising results: Both of them with constant-space are Turing-equivalent. More specifically, we show that for any Turing-recognizable language, there exists a constant-space weak-qAM system, (the nonmembers do not need to be rejected with high probability), and we show that any Turing-recognizable language can be recognized by a constant-space qATM even with one-way input head. For strong proof systems, where the nonmembers must be rejected with high probability, we show that the known space-bounded classical private protocols can also be simulated by our public qAM system with the same space bound. Besides, we introduce a strong version of qATM: The qATM that must halt in every computation path. Then, we show that strong qATMs (similar to private ATMs) can simulate deterministic space with exponentially less space. This leads to shifting the deterministic space hierarchy exactly by one-level. The method behind the main results is a new public protocol cleverly using its fixed-size quantum register. Interestingly, the quantum part of this public protocol cannot be simulated by any space-bounded classical protocol in some cases.
A Literature Review of Code Clone Analysis to Improve Software Maintenance Process
Venue: arXiv cs.SE 2012
Year: 2012

Software systems are getting more complex as the system grows where maintaining such system is a primary concern for the industry. Code clone is one of the factors making software maintenance more difficult. It is a process of replicating code blocks by copy-and-paste that is common in software development. In the beginning stage of the project, developers find it easy and time consuming though it has crucial drawbacks in the long run. There are two types of researchers where some researchers think clones lead to additional changes during maintenance phase, in later stage increase the overall maintenance effort. On the other hand, some researchers think that cloned codes are more stable than non cloned codes. In this study, we discussed Code Clones and different ideas, methods, clone detection tools, related research on code clone, case study.
Deterministic Polynomial Factoring and Association Schemes
Venue: arXiv cs.CC 2012
Year: 2012

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the generalized Riemann hypothesis (GRH). In this work we improve the state of the art by focusing on prime degree polynomials; let n be the degree. If (n-1) has a `large' r-smooth divisor s, then we find a nontrivial factor of f(x) in deterministic poly(n^r,log q) time; assuming GRH and that s > sqrt{n/(2^r)}. Thus, for r = O(1) our algorithm is polynomial time. Further, for r > loglog n there are infinitely many prime degrees n for which our algorithm is applicable and better than the best known; assuming GRH. Our methods build on the algebraic-combinatorial framework of m-schemes initiated by Ivanyos, Karpinski and Saxena (ISSAC 2009). We show that the m-scheme on n points, implicitly appearing in our factoring algorithm, has an exceptional structure; leading us to the improved time complexity. Our structure theorem proves the existence of small intersection numbers in any association scheme that has many relations, and roughly equal valencies and indistinguishing numbers.
Enforcing Access Control in Virtual Organizations Using Hierarchical Attribute-Based Encryption
Venue: arXiv cs.CR 2012
Year: 2012

Virtual organizations are dynamic, inter-organizational collaborations that involve systems and services belonging to different security domains. Several solutions have been proposed to guarantee the enforcement of the access control policies protecting the information exchanged in a distributed system, but none of them addresses the dynamicity characterizing virtual organizations. In this paper we propose a dynamic hierarchical attribute-based encryption (D-HABE) scheme that allows the institutions in a virtual organization to encrypt information according to an attribute-based policy in such a way that only users with the appropriate attributes can decrypt it. In addition, we introduce a key management scheme that determines which user is entitled to receive which attribute key from which domain authority.
A Colonel Blotto Gladiator Game
Venue: arXiv cs.GT 2012
Year: 2012

We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators' strengths. Each team's strategy consists of the allocation of its total strength among its gladiators. We find the Nash equilibria and the value of this class of games and show how they depend on the total strength of teams and the number of gladiators in each team. To do this, we study interesting majorization-type probability inequalities concerning linear combinations of Gamma random variables. Similar inequalities have been used in models of telecommunications and research and development.
Distributed Traffic Signal Control for Maximum Network Throughput
Venue: arXiv cs.SY 2012
Year: 2012

We propose a distributed algorithm for controlling traffic signals. Our algorithm is adapted from backpressure routing, which has been mainly applied to communication and power networks. We formally prove that our algorithm ensures global optimality as it leads to maximum network throughput even though the controller is constructed and implemented in a completely distributed manner. Simulation results show that our algorithm significantly outperforms SCATS, an adaptive traffic signal control system that is being used in many cities.
On the Cross-Correlation of a $p$-ary m-Sequence and its Decimated Sequences by $d=\frac{p^n+1}{p^k+1}+\frac{p^n-1}{2}$
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, for an odd prime $p$ such that $p\equiv 3\bmod 4$, odd $n$, and $d=(p^n+1)/(p^k+1)+(p^n-1)/2$ with $k|n$, the value distribution of the exponential sum $S(a,b)$ is calculated as $a$ and $b$ run through $\mathbb{F}_{p^n}$. The sequence family $\mathcal{G}$ in which each sequence has the period of $N=p^n-1$ is also constructed. The family size of $\mathcal{G}$ is $p^n$ and the correlation magnitude is roughly upper bounded by $(p^k+1)\sqrt{N}/2$. The weight distribution of the relevant cyclic code $\mathcal{C}$ over $\mathbb{F}_p$ with the length $N$ and the dimension ${\rm dim}_{\mathbb{F}_p}\mathcal{C}=2n$ is also derived. Our result includes the case in \cite{Xia} as a special case.
Good covers are algorithmically unrecognizable
Venue: arXiv cs.CG 2012
Year: 2012

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were studied intensively. Our main result is that intersection patterns of good covers are algorithmically unrecognizable. More precisely, the intersection pattern of a good cover can be stored in a simplicial complex called nerve which records which subfamilies of the good cover intersect. A simplicial complex is topologically d-representable if it is isomorphic to the nerve of a good cover in R^d. We prove that it is algorithmically undecidable whether a given simplicial complex is topologically d-representable for any fixed d \geq 5. The result remains also valid if we replace good covers with acyclic covers or with covers by open d-balls. As an auxiliary result we prove that if a simplicial complex is PL embeddable into R^d, then it is topologically d-representable. We also supply this result with showing that if a "sufficiently fine" subdivision of a k-dimensional complex is d-representable and k \leq (2d-3)/3, then the complex is PL embeddable into R^d.
What Should Developers Be Aware Of? An Empirical Study on the Directives of API Documentation
Venue: arXiv cs.SE 2012
Year: 2012

Application Programming Interfaces (API) are exposed to developers in order to reuse software libraries. API directives are natural-language statements in API documentation that make developers aware of constraints and guidelines related to the usage of an API. This paper presents the design and the results of an empirical study on the directives of API documentation of object-oriented libraries. Its main contribution is to propose and extensively discuss a taxonomy of 23 kinds of API directives.
Publication Induced Research Analysis (PIRA) - Experiments on Real Data
Venue: arXiv cs.DL 2012
Year: 2012

This paper describes the first results obtained by implementing a novel approach to rank vertices in a heterogeneous graph, based on the PageRank family of algorithms and applied here to the bipartite graph of papers and authors as a first evaluation of its relevance on real data samples. With this approach to evaluate research activities, the ranking of a paper/author depends on that of the papers/authors citing it/him or her. We compare the results against existing ranking methods (including methods which simply apply PageRank to the graph of papers or the graph of authors) through the analysis of simple scenarios based on a real dataset built from DBLP and CiteseerX. The results show that in all examined cases the obtained result is most pertinent with our method which allows to orient our future work to optimizing the execution of this algorithm.
Analysis and study on text representation to improve the accuracy of the Normalized Compression Distance
Venue: arXiv cs.IT 2012
Year: 2012

The huge amount of information stored in text form makes methods that deal with texts really interesting. This thesis focuses on dealing with texts using compression distances. More specifically, the thesis takes a small step towards understanding both the nature of texts and the nature of compression distances. Broadly speaking, the way in which this is done is exploring the effects that several distortion techniques have on one of the most successful distances in the family of compression distances, the Normalized Compression Distance -NCD-.
Revisiting Waiting Times in DNA evolution
Venue: arXiv cs.DM 2012
Year: 2012

Transcription factors are short stretches of DNA (or $k$-mers) mainly located in promoters sequences that enhance or repress gene expression. With respect to an initial distribution of letters on the DNA alphabet, Behrens and Vingron consider a random sequence of length $n$ that does not contain a given $k$-mer or word of size $k$. Under an evolution model of the DNA, they compute the probability $\mathfrak{p}_n$ that this $k$-mer appears after a unit time of 20 years. They prove that the waiting time for the first apparition of the $k$-mer is well approximated by $T_n=1/\mathfrak{p}_n$. Their work relies on the simplifying assumption that the $k$-mer is not self-overlapping. They observe in particular that the waiting time is mostly driven by the initial distribution of letters. Behrens et al. use an approach by automata that relaxes the assumption related to words overlaps. Their numerical evaluations confirms the validity of Behrens and Vingron approach for non self-overlapping words, but provides up to 44% corrections for highly self-overlapping words such as $\mathtt{AAAAA}$. We devised an approach of the problem by clump analysis and generating functions; this approach leads to prove a quasi-linear behaviour of $\mathfrak{p}_n$ for a large range of values of $n$, an important result for DNA evolution. We present here this clump analysis, first by language decomposition, and next by an automaton construction; finally, we describe an equivalent approach by construction of Markov automata.
Monitoring Software Reliability using Statistical Process Control An Ordered Statistics Approach
Venue: arXiv cs.SE 2012
Year: 2012

The nature and complexity of software have changed significantly in the last few decades. With the easy availability of computing power, deeper and broader applications are made. It has been extremely necessary to produce good quality software with high precession of reliability right in the first place. Olden day's software errors and bugs were fixed at a later stage in the software development. Today to produce high quality reliable software and to keep a specific time schedule is a big challenge. To cope up the challenge many concepts, methodology and practices of software engineering have been evolved for developing reliable software. Better methods of controlling the process of software production are underway. One of such methods to assess the software reliability is using control charts. In this paper we proposed an NHPP based control mechanism by using order statistics with cumulative quantity between observations of failure data using mean value function of exponential distribution.
MIPS code compression
Venue: arXiv cs.OH 2012
Year: 2012

MIPS machine code is very structured: registers used before are likely to be used again, some instructions and registers are used more heavily than others, some instructions often follow each other and so on. Standard file compression utilities, such as gzip and bzip2, does not take full advantage of the structure because they work on byte-boundaries and don't see the underlying instruction fields. My idea is to filter opcodes, registers and immediates from MIPS binary code into distinct streams and compress them individually to achieve better compression ratios. Several different ways to split MIPS code into streams are considered. The results presented in this paper shows that a simple filter can reduce final compressed size by up to 10 % with gzip and bzip2.
Modeling and Analysis of Abnormality Detection in Biomolecular Nano-Networks
Venue: arXiv cs.IT 2012
Year: 2012

A scheme for detection of abnormality in molecular nano-networks is proposed. This is motivated by the fact that early diagnosis, classification and detection of diseases such as cancer play a crucial role in their successful treatment. The proposed nano-abnormality detection scheme (NADS) comprises of a two-tier network of sensor nano-machines (SNMs) in the first tier and a data gathering node (DGN) at the sink. The SNMs detect the presence of competitor cells as abnormality that is captured by variations in parameters of a nano-communications channel. In the second step, the SNMs transmit micro-scale messages over a noisy micro communications channel (MCC) to the DGN, where a decision is made upon fusing the received signals. The detection performance of each SNM is analyzed by setting up a Neyman-Pearson test. Next, taking into account the effect of the MCC, the overall performance of the proposed NADS is quantified in terms of probabilities of misdetection and false alarm. A design problem is formulated, when the optimized concentration of SNMs in a sample is obtained for a high probability of detection and a limited probability of false alarm.