OpenRaiser/Intern-Atlas huggingface dataset:
Exploiting Sparse Dynamics For Bandwidth Reduction In Cooperative Sensing Systems
Venue: arXiv cs.IT 2012
Year: 2012

Recently, there has been a significant interest in developing cooperative sensing systems for certain types of wireless applications. In such systems, a group of sensing nodes periodically collect measurements about the signals being observed in the given geographical region and transmit these measurements to a central node, which in turn processes this information to recover the signals. For example, in cognitive radio networks, the signals of interest are those generated by the primary transmitters and the sensing nodes are the secondary users. In such networks, it is critically important to be able to reliably determine the presence or absence of primary transmitters in order to avoid causing interference. The standard approach to transmit these measurements from sensor the nodes to the fusion center has been to use orthogonal channels. Such an approach quickly places a burden on the control-channel-capacity of the network that would scale linearly in the number of cooperating sensing nodes. In this paper, we show that as long as one condition is satisfied: the dynamics of the observed signals are sparse, i.e., the observed signals do not change their values very rapidly in relation to the time-scale at which the measurements are collected, we can significantly reduce the control bandwidth of the system while achieving the full (linear) bandwidth performance.
Adaptive Layered Approach using Machine Learning Techniques with Gain Ratio for Intrusion Detection Systems
Venue: arXiv cs.CR 2012
Year: 2012

Intrusion Detection System (IDS) has increasingly become a crucial issue for computer and network systems. Optimizing performance of IDS becomes an important open problem which receives more and more attention from the research community. In this work, A multi-layer intrusion detection model is designed and developed to achieve high efficiency and improve the detection and classification rate accuracy .we effectively apply Machine learning techniques (C5 decision tree, Multilayer Perceptron neural network and Naïve Bayes) using gain ratio for selecting the best features for each layer as to use smaller storage space and get higher Intrusion detection performance. Our experimental results showed that the proposed multi-layer model using C5 decision tree achieves higher classification rate accuracy, using feature selection by Gain Ratio, and less false alarm rate than MLP and naïve Bayes. Using Gain Ratio enhances the accuracy of U2R and R2L for the three machine learning techniques (C5, MLP and Naïve Bayes) significantly. MLP has high classification rate when using the whole 41 features in Dos and Probe layers.
Performance Evaluation of Different Techniques for texture Classification
Venue: arXiv cs.CV 2012
Year: 2012

Texture is the term used to characterize the surface of a given object or phenomenon and is an important feature used in image processing and pattern recognition. Our aim is to compare various Texture analyzing methods and compare the results based on time complexity and accuracy of classification. The project describes texture classification using Wavelet Transform and Co occurrence Matrix. Comparison of features of a sample texture with database of different textures is performed. In wavelet transform we use the Haar, Symlets and Daubechies wavelets. We find that, thee Haar wavelet proves to be the most efficient method in terms of performance assessment parameters mentioned above. Comparison of Haar wavelet and Co-occurrence matrix method of classification also goes in the favor of Haar. Though the time requirement is high in the later method, it gives excellent results for classification accuracy except if the image is rotated.
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
Venue: arXiv cs.CR 2012
Year: 2012

There has been considerable recent interest in "cloud storage" wherein a user asks a server to store a large file. One issue is whether the user can verify that the server is actually storing the file, and typically a challenge-response protocol is employed to convince the user that the file is indeed being stored correctly. The security of these schemes is phrased in terms of an extractor which will recover or retrieve the file given any "proving algorithm" that has a sufficiently high success probability. This paper treats proof-of-retrievability schemes in the model of unconditional security, where an adversary has unlimited computational power. In this case retrievability of the file can be modelled as error-correction in a certain code. We provide a general analytical framework for such schemes that yields exact (non-asymptotic) reductions that precisely quantify conditions for extraction to succeed as a function of the success probability of a proving algorithm, and we apply this analysis to several archetypal schemes. In addition, we provide a new methodology for the analysis of keyed POR schemes in an unconditionally secure setting, and use it to prove the security of a modified version of a scheme due to Shacham and Waters under a slightly restricted attack model, thus providing the first example of a keyed POR scheme with unconditional security. We also show how classical statistical techniques can be used to evaluate whether the responses of the prover are accurate enough to permit successful extraction. Finally, we prove a new lower bound on storage and communication complexity of POR schemes.
Polymatroids and polyquantoids
Venue: arXiv cs.IT 2012
Year: 2012

When studying entropy functions of multivariate probability distributions, polymatroids and matroids emerge. Entropy functions of pure multiparty quantum states give rise to analogous notions, called here polyquantoids and quantoids. Polymatroids and polyquantoids are related via linear mappings and duality. Quantum secret sharing schemes that are ideal are described by selfdual matroids. Expansions of integer polyquantoids to quantoids are studied and linked to that of polymatroids.
On U-Statistics and Compressed Sensing II: Non-Asymptotic Worst-Case Analysis
Venue: arXiv cs.IT 2012
Year: 2012

In another related work, U-statistics were used for non-asymptotic "average-case" analysis of random compressed sensing matrices. In this companion paper the same analytical tool is adopted differently - here we perform non-asymptotic "worst-case" analysis. Simple union bounds are a natural choice for "worst-case" analyses, however their tightness is an issue (and questioned in previous works). Here we focus on a theoretical U-statistical result, which potentially allows us to prove that these union bounds are tight. To our knowledge, this kind of (powerful) result is completely new in the context of CS. This general result applies to a wide variety of parameters, and is related to (Stein-Chen) Poisson approximation. In this paper, we consider i) restricted isometries, and ii) mutual coherence. For the bounded case, we show that k-th order restricted isometry constants have tight union bounds, when the measurements m = \mathcal{O}(k (1 + \log(n/k))). Here we require the restricted isometries to grow linearly in k, however we conjecture that this result can be improved to allow them to be fixed. Also, we show that mutual coherence (with the standard estimate \sqrt{(4\log n)/m}) have very tight union bounds. For coherence, the normalization complicates general discussion, and we consider only Gaussian and Bernoulli cases here.
FuturICT - The Road towards Ethical ICT
Venue: arXiv cs.CY 2012
Year: 2012

The pervasive use of information and communication technology (ICT) in modern societies enables countless opportunities for individuals, institutions, businesses and scientists, but also raises difficult ethical and social problems. In particular, ICT helped to make societies more complex and thus harder to understand, which impedes social and political interventions to avoid harm and to increase the common good. To overcome this obstacle, the large-scale EU flagship proposal FuturICT intends to create a platform for accessing global human knowledge as a public good and instruments to increase our understanding of the information society by making use of ICT-based research. In this contribution, we outline the ethical justification for such an endeavor. We argue that the ethical issues raised by FuturICT research projects overlap substantially with many of the known ethical problems emerging from ICT use in general. By referring to the notion of Value Sensitive Design, we show for the example of privacy how this core value of responsible ICT can be protected in pursuing research in the framework of FuturICT. In addition, we discuss further ethical issues and outline the institutional design of FuturICT allowing to address them.
Optimized Quality Factor of Fractional Order Analog Filters with Band-Pass and Band-Stop Characteristics
Venue: arXiv cs.SY 2012
Year: 2012

Fractional order (FO) filters have been investigated in this paper, with band-pass (BP) and band-stop (BS) characteristics, which can not be achieved with conventional integer order filters with orders lesser then two. The quality factors for symmetric and asymmetric magnitude response have been optimized using real coded Genetic Algorithm (GA) for a user specified center frequency. Parametric influence of the FO filters on the magnitude response is also illustrated with credible numerical simulations.
Top Down Approach to find Maximal Frequent Item Sets using Subset Creation
Venue: arXiv cs.DB 2012
Year: 2012

Association rule has been an area of active research in the field of knowledge discovery. Data mining researchers had improved upon the quality of association rule mining for business development by incorporating influential factors like value (utility), quantity of items sold (weight) and more for the mining of association patterns. In this paper, we propose an efficient approach to find maximal frequent itemset first. Most of the algorithms in literature used to find minimal frequent item first, then with the help of minimal frequent itemsets derive the maximal frequent itemsets. These methods consume more time to find maximal frequent itemsets. To overcome this problem, we propose a navel approach to find maximal frequent itemset directly using the concepts of subsets. The proposed method is found to be efficient in finding maximal frequent itemsets.
Demonstrating the Usefulness of CAELinux for Computer Aided Engineering using an Example of the Three Dimensional Reconstruction of a Pig Liver
Venue: arXiv cs.MS 2012
Year: 2012

CAELinux is a Linux distribution which is bundled with free software packages related to Computer Aided Engineering (CAE). The free software packages include software that can build a three dimensional solid model, programs that can mesh a geometry, software for carrying out Finite Element Analysis (FEA), programs that can carry out image processing etc. Present work has two goals: 1) To give a brief description of CAELinux 2) To demonstrate that CAELinux could be useful for Computer Aided Engineering, using an example of the three dimensional reconstruction of a pig liver from a stack of CT-scan images. One can note that instead of using CAELinux, using commercial software for reconstructing the liver would cost a lot of money. One can also note that CAELinux is a free and open source operating system and all software packages that are included in the operating system are also free. Hence one can conclude that CAELinux could be a very useful tool in application areas like surgical simulation which require three dimensional reconstructions of biological organs. Also, one can see that CAELinux could be a very useful tool for Computer Aided Engineering, in general.
Green Cellular Wireless Networks: Where to Begin?
Venue: arXiv cs.NI 2012
Year: 2012

Conventional cellular wireless networks were designed with the purpose of providing high throughput for the user and high capacity for the service provider, without any provisions of energy efficiency. As a result, these networks have an enormous Carbon footprint. In this note, we describe the sources of the inefficiencies in such networks. First we quantify how much Carbon footprint such networks generate. We also discuss how much more mobile traffic is expected to increase so that this Carbon footprint will even increase tremendously more. We then discuss specific sources of inefficiency and potential sources of improvement at the physical layer as well as higher layers of the communication protocol hierarchy. In particular, considering that most of the energy inefficiency in wireless cellular networks is at the base stations, we discuss multi-tier networks and point to the potential of exploiting mobility patterns in order to use base station energy judiciously.
Transition-Based Dependency Parsing With Pluggable Classifiers
Venue: arXiv cs.CL 2012
Year: 2012

In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose classifier without other changes to the parsing algorithm. In practice, however, it often takes substantial software engineering to bridge between the different representations used by two software packages. Here we present extensions to MaltParser that allow the drop-in use of any classifier conforming to the interface of the Weka machine learning package, a wrapper for the TiMBL memory-based learner to this interface, and experiments on multilingual dependency parsing with a variety of classifiers. While earlier work had suggested that memory-based learners might be a good choice for low-resource parsing scenarios, we cannot support that hypothesis in this work. We observed that support-vector machines give better parsing performance than the memory-based learner, regardless of the size of the training set.
A Chaos-based Image Encryption Scheme using Chaotic Coupled Map Lattices
Venue: arXiv cs.CR 2012
Year: 2012

In recent years, information security essential in various arenas like internet communication, multimedia systems, medical imaging, tele-medicine and military communication. However, most of them faced with some problems such as the lack of robustness and security. In this letter, after reviewing the main points of the chaotic trigonometric maps and the coupled map lattices, we introduce the scheme of chaos-based image encryption based on coupled map lat tices. The scheme decreases periodic effect of the ergodic dynamical systems in the chaos-based image encryption. To evaluate the security of the encrypted image of this scheme, the key space analysis, the correlation of two adjacent pixels and differential attack were performed. This scheme tries to improve the problem of failure of encryption such as small key space and level of security.
TrackMeNot-so-good-after-all
Venue: arXiv cs.IR 2012
Year: 2012

TrackMeNot is a Firefox plugin with laudable intentions - protecting your privacy. By issuing a customizable stream of random search queries on its users' behalf, TrackMeNot surmises that enough search noise will prevent its users' true query profiles from being discerned. However, we find that clustering queries by semantic relatedness allows us to disentangle a nontrivial subset of true user queries from TrackMeNot issued noise.
Stochastic Superoptimization
Venue: arXiv cs.PF 2012
Year: 2012

We formulate the loop-free, binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all possible programs to find one that is an optimization of a given target program. Although our method sacrifices com- pleteness, the scope of programs we are able to reason about, and the quality of the programs we produce, far exceed those of existing superoptimizers. Beginning from binaries com- piled by llvm -O0 for 64-bit X86, our prototype implemen- tation, STOKE, is able to produce programs which either match or outperform the code sequences produced by gcc with full optimizations enabled, and, in some cases, expert handwritten assembly.
Partition Tree Weighting
Venue: arXiv cs.IT 2012
Year: 2012

This paper introduces the Partition Tree Weighting technique, an efficient meta-algorithm for piecewise stationary sources. The technique works by performing Bayesian model averaging over a large class of possible partitions of the data into locally stationary segments. It uses a prior, closely related to the Context Tree Weighting technique of Willems, that is well suited to data compression applications. Our technique can be applied to any coding distribution at an additional time and space cost only logarithmic in the sequence length. We provide a competitive analysis of the redundancy of our method, and explore its application in a variety of settings. The order of the redundancy and the complexity of our algorithm matches those of the best competitors available in the literature, and the new algorithm exhibits a superior complexity-performance trade-off in our experiments.
On complexity of regular realizability problems
Venue: arXiv cs.CC 2012
Year: 2012

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem equivalent to L under disjunctive reductions on nondeterministic log space. It implies that for any level of polynomial hierarchy there exists complete RR problem under polynomial reductions.
A Framework For Performance Evaluation Of ASIPS In Network-Based IDS
Venue: arXiv cs.NI 2012
Year: 2012

Nowadays efficient usage of high-tech security tools and appliances is considered as an important criterion for security improvement of computer networks. Based on this assumption, Intrusion Detection and Prevention Systems (IDPS) have key role for applying the defense in depth strategy. In this situation, by increasing network bandwidth in addition to increasing number of threats, Network-based IDPSes have been faced with performance challenge for processing of huge traffic in the networks. A general solution for this bottleneck is exploitation of efficient hardware architectures for performance improvement of IDPS. In this paper a framework for analysis and performance evaluation of application specific instruction set processors is presented for usage in application of attack detection in Networkbased Intrusion Detection Systems(NIDS). By running this framework as a security application on V850, OR1K, MIPS32, ARM7TDMI and PowerPC32 microprocessors, their performance has been evaluated and analyzed. For performance improvement, the compiler optimization levels are employed and at the end; base on O2 optimization level a new combination of optimization flags is presented. The experiments show that the framework results 18.10% performance improvements for pattern matching on ARM7TDMI microprocessors.
Hidden cliques and the certification of the restricted isometry property
Venue: arXiv cs.CC 2012
Year: 2012

Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy this property with optimal parameters are mainly obtained via probabilistic arguments. Deciding whether a given matrix satisfies the restricted isometry property is a non-trivial computational problem. Indeed, we show in this paper that restricted isometry parameters cannot be approximated in polynomial time within any constant factor under the assumption that the hidden clique problem is hard. Moreover, on the positive side we propose an improvement on the brute-force enumeration algorithm for checking the restricted isometry property.
From user requirements to UML class diagram
Venue: arXiv cs.SE 2012
Year: 2012

The transition from user requirements to UML diagrams is a difficult task for the designer especially when he handles large texts expressing these needs. Modeling class Diagram must be performed frequently, even during the development of a simple application. This paper proposes an approach to facilitate class diagram extraction from textual requirements using NLP techniques and domain ontology.
An Evaluation of Arabic Language Learning Websites
Venue: arXiv cs.OH 2012
Year: 2012

As a result of ICT development and the increasingly growing use of the Internet in particular, practices of language teaching and learning are about to evolve significantly. Our study focuses on the Arabic language, and aims to explore and evaluate Arabic language learning websites. To reach these goals, we propose in a first step, to define an evaluation model, based on a set of criteria for assessing the quality of websites dedicated to teaching and learning Arabic. We subsequently apply our model on a set of Arabic sites available on the web and give an assessment of these web sites. We finally discuss their strengths and limitations.
A Scienceographic Comparison of Physics Papers from the arXiv and viXra Archives
Venue: arXiv cs.DL 2012
Year: 2012

arXiv is an e-print repository of papers in physics, computer science, and biology, amongst others. viXra is a newer repository of e-prints on similar topics. Scienceography is the study of the writing of science. In this work we perform a scienceographic comparison of a selection of papers from the physics section of each archive. We provide the first study of the viXra archive and describe key differences on how science is written by these communities.
Estimation of Effort in Software Cost Analysis for Heterogenous Dataset using Fuzzy Analogy
Venue: arXiv cs.SE 2012
Year: 2012

One of the significant objectives of software engineering community is to use effective and useful models for precise calculation of effort in software cost estimation. The existing techniques cannot handle the dataset having categorical variables efficiently including the commonly used analogy method. Also, the project attributes of cost estimation are measured in terms of linguistic values whose imprecision leads to confusion and ambiguity while explaining the process. There are no definite set of models which can efficiently handle the dataset having categorical variables and endure the major hindrances such as imprecision and uncertainty without taking the classical intervals and numeric value approaches. In this paper, a new approach based on fuzzy logic, linguistic quantifiers and analogy based reasoning is proposed to enhance the performance of the effort estimation in software projects dealing with numerical and categorical data. The performance of this proposed method illustrates that there is a realistic validation of the results while using historical heterogeneous dataset. The results were analyzed using the Mean Magnitude Relative Error (MMRE) and indicates that the proposed method can produce more explicable results than the methods which are in vogue.