OpenRaiser/Intern-Atlas huggingface dataset:
An Improved Watchdog Technique Based On Power-Aware Hierarchical Design For Ids In Wireless Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

Preserving security and confidentiality in wireless sensor networks (WSN) are crucial. Wireless sensor networks in comparison with wired networks are more substantially vulnerable to attacks and intrusions. In WSN, a third person can eavesdrop to the information or link to the network. So, preventing these intrusions by detecting them has become one of the most demanding challenges. This paper, proposes an improved watchdog technique as an effective technique for detecting malicious nodes based on a power aware hierarchical model. This technique overcomes the common problems in the original Watchdog mechanism. The main purpose to present this model is reducing the power consumption as a key factor for increasing the network's lifetime. For this reason, we simulated our model with Tiny-OS simulator and then, compared our results with non hierarchical model to ensure the improvement. The results indicate that, our proposed model is better in performance than the original models and it has increased the lifetime of the wireless sensor nodes by around 2611.492 seconds for a network with 100 sensors.
A Novel Fuzzy Logic Based Adaptive Supertwisting Sliding Mode Control Algorithm for Dynamic Uncertain Systems
Venue: arXiv cs.AI 2012
Year: 2012

This paper presents a novel fuzzy logic based Adaptive Super-twisting Sliding Mode Controller for the control of dynamic uncertain systems. The proposed controller combines the advantages of Second order Sliding Mode Control, Fuzzy Logic Control and Adaptive Control. The reaching conditions, stability and robustness of the system with the proposed controller are guaranteed. In addition, the proposed controller is well suited for simple design and implementation. The effectiveness of the proposed controller over the first order Sliding Mode Fuzzy Logic controller is illustrated by Matlab based simulations performed on a DC-DC Buck converter. Based on this comparison, the proposed controller is shown to obtain the desired transient response without causing chattering and error under steady-state conditions. The proposed controller is able to give robust performance in terms of rejection to input voltage variations and load variations.
Point-Separable Classes of Simple Computable Planar Curves
Venue: arXiv cs.CG 2012
Year: 2012

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of finite lengths, parametrizations can be further required to be injective or even length-normalized. All of these four approaches to curves are classically equivalent. In this paper we investigate four different versions of computable curves based on these four approaches. It turns out that they are all different, and hence, we get four different classes of computable curves. More interestingly, these four classes are even point-separable in the sense that the sets of points covered by computable curves of different versions are also different. However, if we consider only computable curves of computable lengths, then all four versions of computable curves become equivalent. This shows that the definition of computable curves is robust, at least for those of computable lengths. In addition, we show that the class of computable curves of computable lengths is point-separable from the other four classes of computable curves.
L1 Splines for Robust, Simple, and Fast Smoothing of Grid Data
Venue: arXiv cs.NA 2012
Year: 2012

Splines are a popular and attractive way of smoothing noisy data. Computing splines involves minimizing a functional which is a linear combination of a fitting term and a regularization term. The former is classically computed using a (weighted) L2 norm while the latter ensures smoothness. Thus, when dealing with grid data, the optimization can be solved very efficiently using the DCT. In this work we propose to replace the L2 norm in the fitting term with an L1 norm, leading to automatic robustness to outliers. To solve the resulting minimization problem we propose an extremely simple and efficient numerical scheme based on split-Bregman iteration combined with DCT. Experimental validation shows the high-quality results obtained in short processing times.
Learning pseudo-Boolean k-DNF and Submodular Functions
Venue: arXiv cs.LG 2012
Year: 2012

We prove that any submodular function f: {0,1}^n -> {0,1,...,k} can be represented as a pseudo-Boolean 2k-DNF formula. Pseudo-Boolean DNFs are a natural generalization of DNF representation for functions with integer range. Each term in such a formula has an associated integral constant. We show that an analog of Hastad's switching lemma holds for pseudo-Boolean k-DNFs if all constants associated with the terms of the formula are bounded. This allows us to generalize Mansour's PAC-learning algorithm for k-DNFs to pseudo-Boolean k-DNFs, and hence gives a PAC-learning algorithm with membership queries under the uniform distribution for submodular functions of the form f:{0,1}^n -> {0,1,...,k}. Our algorithm runs in time polynomial in n, k^{O(k \log k / ε)}, 1/εand log(1/δ) and works even in the agnostic setting. The line of previous work on learning submodular functions [Balcan, Harvey (STOC '11), Gupta, Hardt, Roth, Ullman (STOC '11), Cheraghchi, Klivans, Kothari, Lee (SODA '12)] implies only n^{O(k)} query complexity for learning submodular functions in this setting, for fixed epsilon and delta. Our learning algorithm implies a property tester for submodularity of functions f:{0,1}^n -> {0, ..., k} with query complexity polynomial in n for k=O((\log n/ \loglog n)^{1/2}) and constant proximity parameter ε.
Minimizing Electricity Theft using Smart Meters in AMI
Venue: arXiv cs.NI 2012
Year: 2012

Global energy crises are increasing every moment. Every one has the attention towards more and more energy production and also trying to save it. Electricity can be produced through many ways which is then synchronized on a main grid for usage. The main issue for which we have written this survey paper is losses in electrical system. Weather these losses are technical or non-technical. Technical losses can be calculated easily, as we discussed in section of mathematical modeling that how to calculate technical losses. Where as nontechnical losses can be evaluated if technical losses are known. Theft in electricity produce non-technical losses. To reduce or control theft one can save his economic resources. Smart meter can be the best option to minimize electricity theft, because of its high security, best efficiency, and excellent resistance towards many of theft ideas in electromechanical meters. So in this paper we have mostly concentrated on theft issues.
Monitoring and Controlling Power using Zigbee Communications
Venue: arXiv cs.NI 2012
Year: 2012

Smart grid is a modified form of electrical grid where generation, transmission, distribution and customers are not only connected electrically but also through strong communication network with each other as well as with market, operation and service provider. For achieving good communication link among them, it is very necessary to find suitable protocol. In this paper, we discuss different hardware techniques for power monitoring, power management and remote power controlling at home and transmission side and also discuss the suitability of Zigbee for required communication link. Zigbee has major role in monitoring and direct load controlling for efficient power utilization. It covers enough area needed for communication and it works on low data rate of 20Kbps to 250Kbps with minimum power consumption. This paper describes the user friendly control home appliances, power on/off through the internet, PDA using Graphical User Interface (GUI) and through GSM cellular mobile phone.
Energy Efficient Wireless Communication using Genetic Algorithm Guided Faster Light Weight Digital Signature Algorithm (GADSA)
Venue: arXiv cs.CR 2012
Year: 2012

In this paper GA based light weight faster version of Digital Signature Algorithm (GADSA) in wireless communication has been proposed. Various genetic operators like crossover and mutation are used to optimizing amount of modular multiplication. Roulette Wheel selection mechanism helps to select best chromosome which in turn helps in faster computation and minimizes the time requirements for DSA. Minimization of number of modular multiplication itself a NP-hard problem that means there is no polynomial time deterministic algorithm for this purpose. This paper deals with this problem using GA based optimization algorithm for minimization of the modular multiplication. Proposed GADSA initiates with an initial population comprises of set of valid and complete set of individuals. Some operators are used to generate feasible valid offspring from the existing one. Among several exponents the best solution reached by GADSA is compared with some of the existing techniques. Extensive simulations shows competitive results for the proposed GADSA.
Performance Analysis of Hierarchical Routing Protocols in Wireless Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

This work focusses on analyzing the optimization strategies of routing protocols with respect to energy utilization of sensor nodes in Wireless Sensor Network (WSNs). Different routing mechanisms have been proposed to address energy optimization problem in sensor nodes. Clustering mechanism is one of the popular WSNs routing mechanisms. In this paper, we first address energy limitation constraints with respect to maximizing network life time using linear programming formulation technique. To check the efficiency of different clustering scheme against modeled constraints, we select four cluster based routing protocols; Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP), and Distributed Energy Efficient Clustering (DEEC). To validate our mathematical framework, we perform analytical simulations in MATLAB by choosing number of alive nodes, number of dead nodes, number of packets and number of CHs, as performance metrics.
Simulation Analysis of IEEE 802.15.4 Non-beacon Mode at Varying Data Rates
Venue: arXiv cs.NI 2012
Year: 2012

IEEE 802.15.4 standard is designed for low power and low data rate applications with high reliability. It operates in beacon enable and non-beacon enable modes. In this work, we analyze delay, throughput, load, and end-to-end delay of nonbeacon enable mode. Analysis of these parameters are performed at varying data rates. Evaluation of non beacon enabled mode is done in a 10 node network. We limit our analysis to non beacon or unslotted version because, it performs better than other. Protocol performance is examined by changing different Medium Access Control (MAC) parameters. We consider a full size MAC packet with payload size of 114 bytes. In this paper we show that maximum throughput and lowest delay is achieved at highest data rate.
Improved Separations of Regular Resolution from Clause Learning Proof Systems
Venue: arXiv cs.LO 2012
Year: 2012

We prove that the graph tautology formulas of Alekhnovich, Johannsen, Pitassi, and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. We also prove that these graph tautology formulas can be refuted by polynomial size DPLL proofs with clause learning, even when restricted to greedy, unit-propagating DPLL search. We prove similar results for the guarded, xor-fied pebbling tautologies which Urquhart proved are hard for regular resolution.
`CodeAliker' - Plagiarism Detection on the Cloud
Venue: arXiv cs.OH 2012
Year: 2012

Plagiarism is a burning problem that academics have been facing in all of the varied levels of the educational system. With the advent of digital content, the challenge to ensure the integrity of academic work has been amplified. This paper discusses on defining a precise definition of plagiarized computer code, various solutions available for detecting plagiarism and building a cloud platform for plagiarism disclosure. 'CodeAliker', our application thus developed automates the submission of assignments and the review process associated for essay text as well as computer code. It has been made available under the GNU's General Public License as a Free and Open Source Software.
Locating the Source of Diffusion in Large-Scale Networks
Venue: arXiv cs.SI 2012
Year: 2012

How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks--such as the Internet or the human social graph--it is usually infeasible to observe the state of all nodes in a network. We show that it is fundamentally possible to estimate the location of the source from measurements collected by sparsely-placed observers. We present a strategy that is optimal for arbitrary trees, achieving maximum probability of correct localization. We describe efficient implementations with complexity O(N^α), where α=1 for arbitrary trees, and α=3 for arbitrary graphs. In the context of several case studies, we determine how localization accuracy is affected by various system parameters, including the structure of the network, the density of observers, and the number of observed cascades.
Towards a Formalization of the OSGi Component Framework
Venue: arXiv cs.SE 2012
Year: 2012

We present a formalization of the OSGi component framework. Our formalization is intended to be used as a basis for describing behavior of OSGi based systems. Furthermore, we describe specification formalisms for describing properties of OSGi based systems. One application is its use for behavioral types. Potential uses comprise the derivation of runtime monitors, checking compatibility of component composition, discovering components using brokerage services and checking the compatibility of implementation artifacts towards a specification.
Survey and Analysis of Production Distributed Computing Infrastructures
Venue: arXiv cs.DC 2012
Year: 2012

This report has two objectives. First, we describe a set of the production distributed infrastructures currently available, so that the reader has a basic understanding of them. This includes explaining why each infrastructure was created and made available and how it has succeeded and failed. The set is not complete, but we believe it is representative. Second, we describe the infrastructures in terms of their use, which is a combination of how they were designed to be used and how users have found ways to use them. Applications are often designed and created with specific infrastructures in mind, with both an appreciation of the existing capabilities provided by those infrastructures and an anticipation of their future capabilities. Here, the infrastructures we discuss were often designed and created with specific applications in mind, or at least specific types of applications. The reader should understand how the interplay between the infrastructure providers and the users leads to such usages, which we call usage modalities. These usage modalities are really abstractions that exist between the infrastructures and the applications; they influence the infrastructures by representing the applications, and they influence the ap- plications by representing the infrastructures.
Musings on Encodings and Expressiveness
Venue: arXiv cs.LO 2012
Year: 2012

This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition with other definitions of encoding and expressiveness found in the literature, and illustrate it on a case study: comparing the expressive power of CCS and CSP.
A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
Venue: arXiv cs.FL 2012
Year: 2012

In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semi-totalistic CA capable of simulating any boolean circuit on this aperiodic tiling.
Privacy Preserving Record Linkage via grams Projections
Venue: arXiv cs.DB 2012
Year: 2012

Record linkage has been extensively used in various data mining applications involving sharing data. While the amount of available data is growing, the concern of disclosing sensitive information poses the problem of utility vs privacy. In this paper, we study the problem of private record linkage via secure data transformations. In contrast to the existing techniques in this area, we propose a novel approach that provides strong privacy guarantees under the formal framework of differential privacy. We develop an embedding strategy based on frequent variable length grams mined in a private way from the original data. We also introduce personalized threshold for matching individual records in the embedded space which achieves better linkage accuracy than the existing global threshold approach. Compared with the state-of-the-art secure matching schema, our approach provides formal, provable privacy guarantees and achieves better scalability while providing comparable utility.
Time- and space-efficient evaluation of the complex exponential function using series expansion
Venue: arXiv cs.DS 2012
Year: 2012

An algorithm for the evaluation of the complex exponential function is proposed which is quasi-linear in time and linear in space. This algorithm is based on a modified binary splitting method for the hypergeometric series and a modified Karatsuba method for the fast evaluation of the exponential function. The time complexity of this algorithm is equal to that of the ordinary algorithm for the evaluation of the exponential function based on the series expansion: O(M(n)log(n)^2).
Towards Steganography Detection Through Network Traffic Visualisation
Venue: arXiv cs.CR 2012
Year: 2012

The paper presents initial step toward new network anomaly detection method that is based on traffic visualisation. The key design principle of the proposed approach is the lack of direct, linear time dependencies for the created network traffic visualisations. The method's feasibility is demonstrated in network steganography environment by presenting steg-tomography methodology and developing the dedicated visualisation tool. To authors' best knowledge this is the first utilization of network traffic visualisations for steganalysis purposes.
On Achievable Degrees of Freedom for MIMO X Channels
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, the achievable DoF of MIMO X channels for constant channel coefficients with $M_t$ antennas at transmitter $t$ and $N_r$ antennas at receiver $r$ ($t,r=1,2$) is studied. A spatial interference alignment and cancelation scheme is proposed to achieve the maximum DoF of the MIMO X channels. The scenario of $M_1\geq M_2\geq N_1\geq N_2$ is first considered and divided into 3 cases, $3N_2<M_1+M_2<2N_1+N_2$ (Case $A$), $M_1+M_2\geq2N_1+N_2$ (Case $B$), and $M_1+M_2\leq3N_2$ (Case $C$). With the proposed scheme, it is shown that in Case $A$, the outer-bound $\frac{M_1+M_2+N_2}{2}$ is achievable; in Case $B$, the achievable DoF equals the outer-bound $N_1+N_2$ if $M_2>N_1$, otherwise it is 1/2 or 1 less than the outer-bound; in Case $C$, the achievable DoF is equal to the outer-bound $2/3(M_1+M_2)$ if $(3N_2-M_1-M_2)\mod 3=0$, and it is 1/3 or 1/6 less than the outer-bound if $(3N_2-M_1-M_2)\mod 3=1 \mathrm{or} 2$. In the scenario of $M_t\leq N_r$, the exact symmetrical results of DoF can be obtained.
More than Word Frequencies: Authorship Attribution via Natural Frequency Zoned Word Distribution Analysis
Venue: arXiv cs.CL 2012
Year: 2012

With such increasing popularity and availability of digital text data, authorships of digital texts can not be taken for granted due to the ease of copying and parsing. This paper presents a new text style analysis called natural frequency zoned word distribution analysis (NFZ-WDA), and then a basic authorship attribution scheme and an open authorship attribution scheme for digital texts based on the analysis. NFZ-WDA is based on the observation that all authors leave distinct intrinsic word usage traces on texts written by them and these intrinsic styles can be identified and employed to analyze the authorship. The intrinsic word usage styles can be estimated through the analysis of word distribution within a text, which is more than normal word frequency analysis and can be expressed as: which groups of words are used in the text; how frequently does each group of words occur; how are the occurrences of each group of words distributed in the text. Next, the basic authorship attribution scheme and the open authorship attribution scheme provide solutions for both closed and open authorship attribution problems. Through analysis and extensive experimental studies, this paper demonstrates the efficiency of the proposed method for authorship attribution.
Parallelization of Maximum Entropy POS Tagging for Bahasa Indonesia with MapReduce
Venue: arXiv cs.DC 2012
Year: 2012

In this paper, MapReduce programming model is used to parallelize training and tagging proceess in Maximum Entropy part of speech tagging for Bahasa Indonesia. In training process, MapReduce model is implemented dictionary, tagtoken, and feature creation. In tagging process, MapReduce is implemented to tag lines of document in parallel. The training experiments showed that total training time using MapReduce is faster, but its result reading time inside the process slow down the total training time. The tagging experiments using different number of map and reduce process showed that MapReduce implementation could speedup the tagging process. The fastest tagging result is showed by tagging process using 1,000,000 word corpus and 30 map process.
Evaluating Ontology Matching Systems on Large, Multilingual and Real-world Test Cases
Venue: arXiv cs.AI 2012
Year: 2012

In the field of ontology matching, the most systematic evaluation of matching systems is established by the Ontology Alignment Evaluation Initiative (OAEI), which is an annual campaign for evaluating ontology matching systems organized by different groups of researchers. In this paper, we report on the results of an intermediary OAEI campaign called OAEI 2011.5. The evaluations of this campaign are divided in five tracks. Three of these tracks are new or have been improved compared to previous OAEI campaigns. Overall, we evaluated 18 matching systems. We discuss lessons learned, in terms of scalability, multilingual issues and the ability do deal with real world cases from different domains.