OpenRaiser/Intern-Atlas huggingface dataset:
Remote Home Management: An alternative for working at home while away
Venue: arXiv cs.CY 2014
Year: 2014

Remote home management is one of the developing areas in current technology. In this paper we described how to manage and control home appliances using mobile phone, people can use this system to do things in their home from a far place before they reach home. For instance, user may start his/her room cooler or heater so that before they reach home the condition in the room will be conducive, also appliances like washing machine and cooker can be started and if the time taken for this appliances to perform a task is known that can also be set, so that if the time elapsed the appliance will automatically switch off itself. To control an appliance the user sends a command in form of SMS from his/her mobile phone to a computer which is connected to the appliance, once the message is received the computer will send the command to a microcontroller for controlling the appliance appropriately.
A Spatial Data Model for Moving Object Databases
Venue: arXiv cs.DB 2014
Year: 2014

Moving Object Databases will have significant role in Geospatial Information Systems as they allow users to model continuous movements of entities in the databases and perform spatio-temporal analysis. For representing and querying moving objects, and algebra with a comprehensive framework of User Defined Types together with a set of functions on those types is needed. Moreover, concerning real world applications, moving objects move along constrained environments like transportation networks so that an extra algebra for modeling networks is demanded, too. These algebras can be inserted in any data model if their designs are based on available standards such as Open Geospatial Consortium that provides a common model for existing DBMS's. In this paper, we focus on extending a spatial data model for constrained moving objects. Static and moving geometries in our model are based on Open Geospatial Consortium standards. We also extend Structured Query Language for retrieving, querying, and manipulating spatio-temporal data related to moving objects as a simple and expressive query language. Finally as a proof of concept, we implement a generator to generate data for moving objects constrained by a transportation network. Such a generator primarily aims at traffic planning applications.
Optimal number of users in Co-operative spectrum sensing in WRAN using Cyclo-Stationary Detector
Venue: arXiv cs.NI 2014
Year: 2014

Cognitive radio allows unlicensed users to access licensed frequency bands through dynamic spectrum access so as to reduce spectrum scarcity. This requires intelligent spectrum sensing techniques. This paper investigates the use of cyclo-stationary detector and performance evaluation for Digital Video Broadcast-Terrestrial (DVB-T) signals. Generally, DVB-T is specified in IEEE 802.22 standard in VHF and UHF TV broadcasting spectrum. Simulations results show that implementing co-operative spectrum sensing help in better utilization of resources. The paper further proposes to find number of optimal users in a scenario to optimize the detection probability and makes use of the particle swarm optimization (PSO) technique to find an optimum value of threshold.
An inertial forward-backward algorithm for monotone inclusions
Venue: arXiv cs.CV 2014
Year: 2014

In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method of Nesterov, but can be applied to a much larger class of problems including convex-concave saddle point problems and general monotone inclusions. We prove convergence of the algorithm in a Hilbert space setting and show that several recently proposed first-order methods can be obtained as special cases of the general algorithm. Numerical results show that the proposed algorithm converges faster than existing methods, while keeping the computational cost of each iteration basically unchanged.
Distributed Transformer Monitoring System Based On Zigbee Technology
Venue: arXiv cs.OH 2014
Year: 2014

A Distributed transformer networks remote monitoring system is developed and constructed,for monitor and record the parameters like temperature, oil level status, of a distribution transformer.The system consists of a micro controller based circuit,with solid-state components for handling sensors,power back-up,real time clock and data communication module which based on ZigBee protocol.
A Decomposition-based Architecture for Distributed Virtual Network Embedding
Venue: arXiv cs.NI 2014
Year: 2014

Network protocols have historically been developed on an ad-hoc basis, and cloud computing is no exception. A fundamental management protocol, not yet standardized, that cloud providers need to run to support wide-area virtual network services is the virtual network (VN) embedding protocol. In this paper, we use decomposition theory to provide a unifying architecture for the VN embedding problem. We show how our architecture subsumes existing solutions, and how it can be used by cloud providers to design a distributed VN embedding protocol that adapts to different scenarios, by merely instantiating different decomposition policies. We analyze key representative tradeoffs via simulation, and with our VN embedding testbed that uses a Linux system architecture to reserve virtual node and link capacities. In contrast with existing VN embedding solutions, we found that partitioning a VN request not only increases the signaling overhead, but may decrease cloud providers' revenue.
Spontaneous expression classification in the encrypted domain
Venue: arXiv cs.CV 2014
Year: 2014

To date, most facial expression analysis have been based on posed image databases and is carried out without being able to protect the identity of the subjects whose expressions are being recognised. In this paper, we propose and implement a system for classifying facial expressions of images in the encrypted domain based on a Paillier cryptosystem implementation of Fisher Linear Discriminant Analysis and k-nearest neighbour (FLDA + kNN). We present results of experiments carried out on a recently developed natural visible and infrared facial expression (NVIE) database of spontaneous images. To the best of our knowledge, this is the first system that will allow the recog-nition of encrypted spontaneous facial expressions by a remote server on behalf of a client.
Publicly Verifiable Secret Sharing Using Non-Abelian Groups
Venue: arXiv cs.CR 2014
Year: 2014

In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over abelian groups. In this paper we develop similar methods over non-abelian groups.
Doubles and Negatives are Positive (in Self-Assembly)
Venue: arXiv cs.ET 2014
Year: 2014

In the abstract Tile Assembly Model (aTAM), the phenomenon of cooperation occurs when the attachment of a new tile to a growing assembly requires it to bind to more than one tile already in the assembly. Often referred to as ``temperature-2'' systems, those which employ cooperation are known to be quite powerful (i.e. they are computationally universal and can build an enormous variety of shapes and structures). Conversely, aTAM systems which do not enforce cooperative behavior, a.k.a. ``temperature-1'' systems, are conjectured to be relatively very weak, likely to be unable to perform complex computations or algorithmically direct the process of self-assembly. Nonetheless, a variety of models based on slight modifications to the aTAM have been developed in which temperature-1 systems are in fact capable of Turing universal computation through a restricted notion of cooperation. Despite that power, though, several of those models have previously been proven to be unable to perform or simulate the stronger form of cooperation exhibited by temperature-2 aTAM systems. In this paper, we first prove that another model in which temperature-1 systems are computationally universal, namely the restricted glue TAM (rgTAM) in which tiles are allowed to have edges which exhibit repulsive forces, is also unable to simulate the strongly cooperative behavior of the temperature-2 aTAM. We then show that by combining the properties of two such models, the Dupled Tile Assembly Model (DTAM) and the rgTAM into the DrgTAM, we derive a model which is actually more powerful at temperature-1 than the aTAM at temperature-2. Specifically, the DrgTAM, at temperature-1, can simulate any aTAM system of any temperature, and it also contains systems which cannot be simulated by any system in the aTAM.
Image processing using miniKanren
Venue: arXiv cs.CV 2014
Year: 2014

An integral image is one of the most efficient optimization technique for image processing. However an integral image is only a special case of delayed stream or memoization. This research discusses generalizing concept of integral image optimization technique, and how to generate an integral image optimized program code automatically from abstracted image processing algorithm. In oder to abstruct algorithms, we forces to miniKanren.
Game Theory Explorer - Software for the Applied Game Theorist
Venue: arXiv cs.GT 2014
Year: 2014

This paper presents the "Game Theory Explorer" software tool to create and analyze games as models of strategic interaction. A game in extensive or strategic form is created and nicely displayed with a graphical user interface in a web browser. State-of-the-art algorithms then compute all Nash equilibria of the game after a mouseclick. In tutorial fashion, we present how the program is used, and the ideas behind its main algorithms. We report on experiences with the architecture of the software and its development as an open-source project.
A Novel Scheme for Downlink Opportunistic Interference Alignment
Venue: arXiv cs.IT 2014
Year: 2014

In this paper we propose a downlink codebook-based opportunistic interference alignment (OIA) in a three-cell MIMO system. A codebook composed of multiple transmit vector sets is utilized to improve the multiuser selection diversity. The sum rate increases as the size of the codebook grows. In addition, during the user selection, effective channel gain and alignment metric are combined to generate a novel criterion, which improves the system performance, especially at low SNR. Furthermore, a threshold-based feedback approach is introduced to reduce the feedback load in the proposed scheme. Both the analytical results and simulations show that the proposed scheme provides significant improvement in terms of sum rates with no feedback load growth and slight increase of complexity.
JSAI: Designing a Sound, Configurable, and Efficient Static Analyzer for JavaScript
Venue: arXiv cs.PL 2014
Year: 2014

We describe JSAI, an abstract interpreter for JavaScript. JSAI uses novel abstract domains to compute a reduced product of type inference, pointer analysis, string analysis, integer and boolean constant propagation, and control-flow analysis. In addition, JSAI allows for analysis control-flow sensitivity (i.e., context-, path-, and heap-sensitivity) to be modularly configured without requiring any changes to the analysis implementation. JSAI is designed to be provably sound with respect to a specific concrete semantics for JavaScript, which has been extensively tested against existing production-quality JavaScript implementations. We provide a comprehensive evaluation of JSAI's performance and precision using an extensive benchmark suite. This benchmark suite includes real-world JavaScript applications, machine-generated JavaScript code via Emscripten, and browser addons. We use JSAI's configurability to evaluate a large number of analysis sensitivities (some well-known, some novel) and observe some surprising results. We believe that JSAI's configurability and its formal specifications position it as a useful research platform to experiment on novel sensitivities, abstract domains, and client analyses for JavaScript.
Quick Safari Through Software Design
Venue: arXiv cs.SE 2014
Year: 2014

This is a short tutorial about different software design methodologies.
Pervasive Image Computation: A Mobile Phone Application for getting Information of the Images
Venue: arXiv cs.MM 2014
Year: 2014

Although many of the information processing systems are text-based, much of the information in the real life is generally multimedia objects, so there is a need to define and standardize the frame works for multimedia-based information processing systems. In this paper we consider the application of such a system namely pervasive image computation system, in which the user uses the cellphone for taking the picture of the objects, and he wants to get some information about them. We have implemented two architectures, the first one, called online architecture, which the user sends the picture to the server and server sends the picture information directly back to him. In the second one, which is called offline architecture, the user uploads the image in one public image database such as Flickr and sends the ID of the image in this database to the server. The server processes the image and adds the information of the image in the database, and finally the user can connect to the database and download the image information. The implementation results show that these architectures are very flexible and could be easily extended to be used in more complicated pervasive multimedia systems.
Effects of Spatial Randomness on Locating a Point Source with Distributed Sensors
Venue: arXiv cs.IT 2014
Year: 2014

Most studies that consider the problem of estimating the location of a point source in wireless sensor networks assume that the source location is estimated by a set of spatially distributed sensors, whose locations are fixed. Motivated by the fact that the observation quality and performance of the localization algorithm depend on the location of the sensors, which could be randomly distributed, this paper investigates the performance of a recently proposed energy-based source-localization algorithm under the assumption that the sensors are positioned according to a uniform clustering process. Practical considerations such as the existence and size of the exclusion zones around each sensor and the source will be studied. By introducing a novel performance measure called the estimation outage, it will be shown how parameters related to the network geometry such as the distance between the source and the closest sensor to it as well as the number of sensors within a region surrounding the source affect the localization performance.
High Speed Railway Wireless Communications: Efficiency v.s. Fairness
Venue: arXiv cs.IT 2014
Year: 2014

High speed railways (HSRs) have been deployed widely all over the world in recent years. Different from traditional cellular communication, its high mobility makes it essential to implement power allocation along the time. In the HSR case, the transmission rate depends greatly on the distance between the base station (BS) and the train. As a result, the train receives a time varying data rate service when passing by a BS. It is clear that the most efficient power allocation will spend all the power when the train is nearest from the BS, which will cause great unfairness along the time. On the other hand, the channel inversion allocation achieves the best fairness in terms of constant rate transmission. However, its power efficiency is much lower. Therefore, the power efficiency and the fairness along time are two incompatible objects. For the HSR cellular system considered in this paper, a trade-off between the two is achieved by proposing a temporal proportional fair power allocation scheme. Besides, near optimal closed form solution and one algorithm finding the $ε$-optimal allocation are presented.
Absorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel
Venue: arXiv cs.IT 2014
Year: 2014

In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from sets of mutually orthogonal Latin squares (MOLS) with cyclic structure. For lowering the error-floors, our approach is twofold: First, we give an exhaustive classification of so-called absorbing sets that may occur in the factor graphs of the given codes. These purely combinatorial substructures are known to be the main cause of decoding errors in the error-floor region over the AWGN channel by decoding with the standard sum-product algorithm (SPA). Second, based on this classification, we exploit the specific structure of the presented codes to eliminate the most harmful absorbing sets and derive powerful constraints for the proper choice of code parameters in order to obtain codes with an optimized error-floor performance.
DecLiNe -- Models for Decay of Links in Networks
Venue: arXiv cs.SI 2014
Year: 2014

The prediction of graph evolution is an important and challenging problem in the analysis of networks and of the Web in particular. But while the appearance of new links is part of virtually every model of Web growth, the disappearance of links has received much less attention in the literature. To fill this gap, our approach DecLiNe (an acronym for DECay of LInks in NEtworks) aims to predict link decay in networks, based on structural analysis of corresponding graph models. In analogy to the link prediction problem, we show that analysis of graph structures can help to identify indicators for superfluous links under consideration of common network models. In doing so, we introduce novel metrics that denote the likelihood of certain links in social graphs to remain in the network, and combine them with state-of-the-art machine learning methods for predicting link decay. Our methods are independent of the underlying network type, and can be applied to such diverse networks as the Web, social networks and any other structure representable as a network, and can be easily combined with case-specific content analysis and adopted for a variety of social network mining, filtering and recommendation applications. In systematic evaluations with large-scale datasets of Wikipedia we show the practical feasibility of the proposed structure-based link decay prediction algorithms.
A really simple approximation of smallest grammar
Venue: arXiv cs.DS 2014
Year: 2014

In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size O(g log (N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is linear assuming that the alphabet Sigma of the input string can be identified with numbers from 1,ldots, N^c for some constant c. Algorithms with such an approximation guarantee and running time are known, however all of them were non-trivial and their analyses were involved. The here presented algorithm computes the LZ77 factorisation and transforms it in phases to a grammar. In each phase it maintains an LZ77-like factorisation of the word with at most l factors as well as additional O(l) letters, where l was the size of the original LZ77 factorisation. In one phase in a greedy way (by a left-to-right sweep and a help of the factorisation) we choose a set of pairs of consecutive letters to be replaced with new symbols, i.e. nonterminals of the constructed grammar. We choose at least 2/3 of the letters in the word and there are O(l) many different pairs among them. Hence there are O(log N) phases, each of them introduces O(l) nonterminals to a grammar. A more precise analysis yields a bound O(l log(N/l)). As l \leq g, this yields the desired bound O(g log(N/g)).
A hybrid formalism to parse Sign Languages
Venue: arXiv cs.CL 2014
Year: 2014

Sign Language (SL) linguistic is dependent on the expensive task of annotating. Some automation is already available for low-level information (eg. body part tracking) and the lexical level has shown significant progresses. The syntactic level lacks annotated corpora as well as complete and consistent models. This article presents a solution for the automatic annotation of SL syntactic elements. It exposes a formalism able to represent both constituency-based and dependency-based models. The first enable the representation the structures one may want to annotate, the second aims at fulfilling the holes of the first. A parser is presented and used to conduct two experiments on the solution. One experiment is on a real corpus, the other is on a synthetic corpus.
Connectivity in Dense Networks Confined within Right Prisms
Venue: arXiv cs.NI 2014
Year: 2014

We consider the probability that a dense wireless network confined within a given convex geometry is fully connected. We exploit a recently reported theory to develop a systematic methodology for analytically characterizing the connectivity probability when the network resides within a convex right prism, a polyhedron that accurately models many geometries that can be found in practice. To maximize practicality and applicability, we adopt a general point-to-point link model based on outage probability, and present example analytical and numerical results for a network employing $2 \times 2$ multiple-input multiple-output (MIMO) maximum ratio combining (MRC) link level transmission confined within particular bounding geometries. Furthermore, we provide suggestions for extending the approach detailed herein to more general convex geometries.
An Optimal-Dimensionality Sampling Scheme on the Sphere with Fast Spherical Harmonic Transforms
Venue: arXiv cs.IT 2014
Year: 2014

We develop a sampling scheme on the sphere that permits accurate computation of the spherical harmonic transform and its inverse for signals band-limited at $L$ using only $L^2$ samples. We obtain the optimal number of samples given by the degrees of freedom of the signal in harmonic space. The number of samples required in our scheme is a factor of two or four fewer than existing techniques, which require either $2L^2$ or $4L^2$ samples. We note, however, that we do not recover a sampling theorem on the sphere, where spherical harmonic transforms are theoretically exact. Nevertheless, we achieve high accuracy even for very large band-limits. For our optimal-dimensionality sampling scheme, we develop a fast and accurate algorithm to compute the spherical harmonic transform (and inverse), with computational complexity comparable with existing schemes in practice. We conduct numerical experiments to study in detail the stability, accuracy and computational complexity of the proposed transforms. We also highlight the advantages of the proposed sampling scheme and associated transforms in the context of potential applications.
Circuit-Aware Design of Energy-Efficient Massive MIMO Systems
Venue: arXiv cs.IT 2014
Year: 2014

Densification is a key to greater throughput in cellular networks. The full potential of coordinated multipoint (CoMP) can be realized by massive multiple-input multiple-output (MIMO) systems, where each base station (BS) has very many antennas. However, the improved throughput comes at the price of more infrastructure; hardware cost and circuit power consumption scale linearly/affinely with the number of antennas. In this paper, we show that one can make the circuit power increase with only the square root of the number of antennas by circuit-aware system design. To this end, we derive achievable user rates for a system model with hardware imperfections and show how the level of imperfections can be gradually increased while maintaining high throughput. The connection between this scaling law and the circuit power consumption is established for different circuits at the BS.