OpenRaiser/Intern-Atlas huggingface dataset:
Reduction of Field Loss by a Video Processing System
Venue: arXiv cs.MM 2014
Year: 2014

Streaming of 60 de-interlaced fields per second digital uncompressed video with 720x480 resolution without a loss of video fields is one of the desired technologies by scientists in biomechanics. If it is possible to stream digital uncompressed video without dropped video fields, then a sophisticated computer analysis of the transmitted via IEEE 1394a connection video is possible. Such process is used in biomechanics when it is important to analyze athletes performance via streaming digital uncompressed video to a computer and then analyzing it using specific software such as Arial Performance Analysis Systems.
Wireless Backhaul Node Placement for Small Cell Networks
Venue: arXiv cs.IT 2014
Year: 2014

Small cells have been proposed as a vehicle for wireless networks to keep up with surging demand. Small cells come with a significant challenge of providing backhaul to transport data to(from) a gateway node in the core network. Fiber based backhaul offers the high rates needed to meet this requirement, but is costly and time-consuming to deploy, when not readily available. Wireless backhaul is an attractive option for small cells as it provides a less expensive and easy-to-deploy alternative to fiber. However, there are multitude of bands and features (e.g. LOS/NLOS, spatial multiplexing etc.) associated with wireless backhaul that need to be used intelligently for small cells. Candidate bands include: sub-6 GHz band that is useful in non-line-of-sight (NLOS) scenarios, microwave band (6-42 GHz) that is useful in point-to-point line-of-sight (LOS) scenarios, and millimeter wave bands (e.g. 60, 70 and 80 GHz) that are recently being commercially used in LOS scenarios. In many deployment topologies, it is advantageous to use aggregator nodes, located at the roof tops of tall buildings near small cells. These nodes can provide high data rate to multiple small cells in NLOS paths, sustain the same data rate to gateway nodes using LOS paths and take advantage of all available bands. This work performs the joint cost optimal aggregator node placement, power allocation, channel scheduling and routing to optimize the wireless backhaul network. We formulate mixed integer nonlinear programs (MINLP) to capture the different interference and multiplexing patterns at sub-6 GHz and microwave band. We solve the MINLP through linear relaxation and branch-and-bound algorithm and apply our algorithm in an example wireless backhaul network of downtown Manhattan.
Survey On Scheduling And Radio Resources Allocation In Lte
Venue: arXiv cs.NI 2014
Year: 2014

This paper focuses on an essential task of the enhanced NodeB eNodeB element in LTE architecture, the Radio Resource Manager RRM, which aims to accept or reject requests for connection to the network based on some constraints and ensuring optimal distribution of radio resources between Users Equipments UEs. Its main functionalities include Admission Control AC and Packet Scheduling PS. This paper will center mainly on the PS part of the RRM task, which performs the radio resource allocation in both uplink and downlink directions. Several approaches and algorithms have been proposed in the literature to address this need ie : allocate resources efficiently, the diversity and multitude of algorithms is related to the factors considered for the optimal management of radio resource, specifically, the traffic type and the QoS Quality of Service requested by the UE. In this article, an art's state of the radio resource allocation strategies and a detailed study of several scheduling algorithms proposed for LTE (uplink and downlink) are made. Therefore, we offer our evaluation and criticism.
A New Clustering Approach for Anomaly Intrusion Detection
Venue: arXiv cs.DC 2014
Year: 2014

Recent advances in technology have made our work easier compare to earlier times. Computer network is growing day by day but while discussing about the security of computers and networks it has always been a major concerns for organizations varying from smaller to larger enterprises. It is true that organizations are aware of the possible threats and attacks so they always prepare for the safer side but due to some loopholes attackers are able to make attacks. Intrusion detection is one of the major fields of research and researchers are trying to find new algorithms for detecting intrusions. Clustering techniques of data mining is an interested area of research for detecting possible intrusions and attacks. This paper presents a new clustering approach for anomaly intrusion detection by using the approach of K-medoids method of clustering and its certain modifications. The proposed algorithm is able to achieve high detection rate and overcomes the disadvantages of K-means algorithm.
Linear Batch Codes
Venue: arXiv cs.IT 2014
Year: 2014

In an application, where a client wants to obtain many elements from a large database, it is often desirable to have some load balancing. Batch codes (introduced by Ishai et al. in STOC 2004) make it possible to do exactly that: the large database is divided between many servers, so that the client has to only make a small number of queries to every server to obtain sufficient information to reconstruct all desired elements. Other important parameters of the batch codes are total storage and the number of servers. Batch codes also have applications in cryptography (namely, in the construction of multi-query computationally-private information retrieval protocols). In this work, we initiate the study of linear batch codes. These codes, in particular, are of potential use in distributed storage systems. We show that a generator matrix of a binary linear batch code is also a generator matrix of classical binary linear error-correcting code. This immediately yields that a variety of upper bounds, which were developed for error-correcting codes, are applicable also to binary linear batch codes. We also propose new methods to construct large linear batch codes from the smaller ones.
Reset Complexity of Ideal Languages
Venue: arXiv cs.FL 2014
Year: 2014

We present a new characteristic of a regular ideal language called reset complexity. We find some bounds on the reset complexity in terms of the state complexity of a given language. We also compare the reset complexity and the state complexity for languages related to slowly synchronizing automata and study uniqueness question for automata yielding the minimum of reset complexity.
Asymptotics of Fingerprinting and Group Testing: Capacity-Achieving Log-Likelihood Decoders
Venue: arXiv cs.IT 2014
Year: 2014

We study the large-coalition asymptotics of fingerprinting and group testing, and derive explicit decoders that provably achieve capacity for many of the considered models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal), and both for informed and uninformed settings. For fingerprinting, we show that if the pirate strategy is known, the Neyman-Pearson-based log-likelihood decoders provably achieve capacity, regardless of the strategy. The decoder built against the interleaving attack is further shown to be a universal decoder, able to deal with arbitrary attacks and achieving the uninformed capacity. This universal decoder is shown to be closely related to the Lagrange-optimized decoder of Oosterwijk et al. and the empirical mutual information decoder of Moulin. Joint decoders are also proposed, and we conjecture that these also achieve the corresponding joint capacities. For group testing, the simple decoder for the classical model is shown to be more efficient than the one of Chan et al. and it provably achieves the simple group testing capacity. For generalizations of this model such as noisy group testing, the resulting simple decoders also achieve the corresponding simple capacities.
Modelling of Walking Humanoid Robot With Capability of Floor Detection and Dynamic Balancing Using Colored Petri Net
Venue: arXiv cs.RO 2014
Year: 2014

Most humanoid robots have highly complicated structure and design of robots that are very similar to human is extremely difficult. In this paper, modelling of a general and comprehensive algorithm for control of humanoid robots is presented using Colored Petri Nets. For keeping dynamic balance of the robot, combination of Gyroscope and Accelerometer sensors are used in algorithm. Image processing is used to identify two fundamental issues: first, detection of target or an object which robot must follow; second, detecting surface of the ground so that walking robot could maintain its balance just like a human and shows its best performance. Presented model gives high-level view of humanoid robot's operations.
Construction A of Lattices over Number Fields and Block Fading Wiretap Coding
Venue: arXiv cs.IT 2014
Year: 2014

We propose a lattice construction from totally real and CM fields, which naturally generalizes the Construction A of lattices from $p$-ary codes obtained from the cyclotomic field $\mathbb{Q}(ζ_p)$, $p$ a prime, which in turn contains the so-called Construction A of lattices from binary codes as a particular case. We focus on the maximal totally real subfield $\mathbb{Q}(ζ_{p^r}+ζ_{p}^{-r})$ of the cyclotomic field $\mathbb{Q}(ζ_{p^r})$, $r\geq 1$. Our construction has applications to coset encoding of algebraic lattice codes, and we detail the case of coset encoding of block fading wiretap codes.
Comparative Analysis On Some Possible Partnership Schemes of Global IP Exchange Providers
Venue: arXiv cs.NI 2014
Year: 2014

IP eXchange or IPX is GSMA proposal for IP interconnection model which supports multi services to offer end-to-end QoS, security, interoperability, SLAs through a dedicated connection. There are some possible partnership schemes between IPX providers such as peering mode, semi-hosted mode, full-hosted mode, or combination between these modes. The implementation of the schemes will be case-by-case basis with some considerations based on, but not limited to, IPX Providers network asset, coverage, services, features offer, commercial offer, and customers. For an IPX provider to become competitive in IPX business and become a global IPX hub, some value added should be considered such as cost efficiency and great network performance. To achieve it, an IPX provider could implement some strategies such as build network sinergy between them and partners to develop IPX Service as single offering, offer their customers with bundled access network and services. An IPX provider should also consider their existing customer-based that can be a benefit to their bargaining position to other potential IPX provider partners to determine price and business scheme for partnership.
Improving Performance of Routing Protocols Using MRP Framework
Venue: arXiv cs.NI 2014
Year: 2014

These days MANET is an amazing remarkably altering or rising technology, for the reason that of its elite nature of scattered mobile devices and self motivated network topology. The mobile adhoc routing protocol follows several principles in wireless MANETs. The up to date and novel applications based on wireless technology are being produced in the private as well as commercial sectors. A lot of challenges which are facing wireless MANETs like network stability, security, energy efficiency and performance analysis etc. At present wireless adhoc network get much more attention because of its accessibility everywhere. As a result researchers produce several routing protocols. In this paper first of all we analyzed the performance investigation of wireless routing protocols on the basis of ROH, throughput, end to end delay and PDR. After that we proposed an Mixed Routing Protocol framework which improve performance.
A Link-based Approach to Entity Resolution in Social Networks
Venue: arXiv cs.IR 2014
Year: 2014

Social networks initially had been places for people to contact each other, find friends or new acquaintances. As such they ever proved interesting for machine aided analysis. Recent developments, however, pivoted social networks to being among the main fields of information exchange, opinion expression and debate. As a result there is growing interest in both analyzing and integrating social network services. In this environment efficient information retrieval is hindered by the vast amount and varying quality of the user-generated content. Guiding users to relevant information is a valuable service and also a difficult task, where a crucial part of the process is accurately resolving duplicate entities to real-world ones. In this paper we propose a novel approach that utilizes the principles of link mining to successfully extend the methodology of entity resolution to multitype problems. The proposed method is presented using an illustrative social network-based real-world example and validated by comprehensive evaluation of the results.
Multi-Trial Guruswami-Sudan Decoding for Generalised Reed--Solomon Codes
Venue: arXiv cs.IT 2014
Year: 2014

An iterated refinement procedure for the Guruswami-Sudan list decoding algorithm for Generalised Reed-Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of closest codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity. We provide a detailed description of the module minimisation, reanalysing the Mulders-Storjohann algorithm and drawing new connections to both Alekhnovich's algorithm and Lee-O'Sullivan's. Furthermore, we show how to incorporate the re-encoding technique of Kötter and Vardy into our iterative algorithm.
Importance and Techniques of Information Hiding : A Review
Venue: arXiv cs.CR 2014
Year: 2014

Information or data is very crucial resource to us. Thus securing the information becomes all the more necessary. The communication media through which we send data does not provide data security, so other methods of securing data are required. Information hiding plays a very crucial role today. It provided methods for encrypting the information so that it becomes unreadable for any unintended user. This paper reviews the techniques that exist for data hiding and how can these be combined to provide another level of security.
Change Detection with Compressive Measurements
Venue: arXiv cs.IT 2014
Year: 2014

Quickest change point detection is concerned with the detection of statistical change(s) in sequences while minimizing the detection delay subject to false alarm constraints. In this paper, the problem of change point detection is studied when the decision maker only has access to compressive measurements. First, an expression for the average detection delay of Shiryaev's procedure with compressive measurements is derived in the asymptotic regime where the probability of false alarm goes to zero. Second, the dependence of the delay on the compression ratio and the signal to noise ratio is explicitly quantified. The ratio of delays with and without compression is studied under various sensing matrix constructions, including Gaussian ensembles and random projections. For a target ratio of the delays after and before compression, a sufficient condition on the number of measurements required to meet this objective with prespecified probability is derived.
Decreasing Weighted Sorted $\ell_1$ Regularization
Venue: arXiv cs.CV 2014
Year: 2014

We consider a new family of regularizers, termed {\it weighted sorted $\ell_1$ norms} (WSL1), which generalizes the recently introduced {\it octagonal shrinkage and clustering algorithm for regression} (OSCAR) and also contains the $\ell_1$ and $\ell_{\infty}$ norms as particular instances. We focus on a special case of the WSL1, the {\sl decreasing WSL1} (DWSL1), where the elements of the argument vector are sorted in non-increasing order and the weights are also non-increasing. In this paper, after showing that the DWSL1 is indeed a norm, we derive two key tools for its use as a regularizer: the dual norm and the Moreau proximity operator.
Shrinkage Optimized Directed Information using Pictorial Structures for Action Recognition
Venue: arXiv cs.CV 2014
Year: 2014

In this paper, we propose a novel action recognition framework. The method uses pictorial structures and shrinkage optimized directed information assessment (SODA) coupled with Markov Random Fields called SODA+MRF to model the directional temporal dependency and bidirectional spatial dependency. As a variant of mutual information, directional information captures the directional information flow and temporal structure of video sequences across frames. Meanwhile, within each frame, Markov random fields are utilized to model the spatial relations among different parts of a human body and the body parts of different people. The proposed SODA+MRF model is robust to view point transformations and detect complex interactions accurately. We compare the proposed method against several baseline methods to highlight the effectiveness of the SODA+MRF model. We demonstrate that our algorithm has superior action recognition performance on the UCF action recognition dataset, the Olympic sports dataset and the collective activity dataset over several state-of-the-art methods.
A DC programming approach for constrained two-dimensional non-guillotine cutting problem
Venue: arXiv cs.CE 2014
Year: 2014

We investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reformulate this problem as a DC program and solve it by DCA. The performance of the approach is compared with the standard solver CPLEX.
Defacing the map: Cartographic vandalism in the digital commons
Venue: arXiv cs.CY 2014
Year: 2014

This article addresses the emergent phenomenon of carto-vandalism, the intentional defacement of collaborative cartographic digital artefacts in the context of volunteered geographic information. Through a qualitative analysis of reported incidents in WikiMapia and OpenStreetMap, a typology of this kind of vandalism is outlined, including play, ideological, fantasy, artistic, and industrial carto-vandalism, as well as carto-spam. Two families of counter-strategies deployed in amateur mapping communities are discussed. First, the contributors organise forms of policing, based on volunteered community involvement, patrolling the maps and reporting incidents. Second, the detection of carto-vandalism can be supported by automated tools, based either on explicit rules or on machine learning.
Computer Simulation Codes for the Quine-McCluskey Method of Logic Minimization
Venue: arXiv cs.OH 2014
Year: 2014

The Quine-McCluskey method is useful in minimizing logic expressions for larger number of variables when compared with minimization by Karnaugh Map or Boolean algebra. In this paper, we have tried to put together all of the computer codes which are available on the internet, edited and modified them as well as rewritten some parts of those collected codes our self, which are used in the implementation of the Quine- McCluskey method. A brief introduction and the logic of this method are discussed following which the codes have been provided. The Quine-McCluskey Method has been implemented using computer languages like C and C++ using some amount of variations. Our effort is to list them all, so that the readers well versed in any of the particular computer language will find it easy to follow the code written in that particular language.
Distance function of D numbers
Venue: arXiv cs.AI 2014
Year: 2014

Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance for identification algorithms based on the evidential theory of Dempster-Shafer. However, some conditions lead to limitations in practical application for Dempster-Shafer theory, such as exclusiveness hypothesis and completeness constraint. To overcome these shortcomings, a novel theory called D numbers theory is proposed. A distance function of D numbers is proposed to measure the distance between two D numbers. The distance function of D numbers is an generalization of distance between two BPAs, which inherits the advantage of Dempster-Shafer theory and strengthens the capability of uncertainty modeling. An illustrative case is provided to demonstrate the effectiveness of the proposed function.
Knowledge-Based Automatic Generation of Linear Algebra Algorithms and Code
Venue: arXiv cs.MS 2014
Year: 2014

This dissertation focuses on the design and the implementation of domain-specific compilers for linear algebra matrix equations. The development of efficient libraries for such equations, which lie at the heart of most software for scientific computing, is a complex process that requires expertise in a variety of areas, including the application domain, algorithms, numerical analysis and high-performance computing. Moreover, the process involves the collaboration of several people for a considerable amount of time. With our compilers, we aim to relieve the developers from both designing algorithms and writing code, and to generate routines that match or even surpass the performance of those written by human experts.
Generalized version of the support vector machine for binary classification problems: supporting hyperplane machine
Venue: arXiv cs.LG 2014
Year: 2014

In this paper there is proposed a generalized version of the SVM for binary classification problems in the case of using an arbitrary transformation x -> y. An approach similar to the classic SVM method is used. The problem is widely explained. Various formulations of primal and dual problems are proposed. For one of the most important cases the formulae are derived in detail. A simple computational example is demonstrated. The algorithm and its implementation is presented in Octave language.
Solving The Longest Overlap Region Problem for Noncoding DNA Sequences with GPU
Venue: arXiv cs.DC 2014
Year: 2014

Early hardware limitations of GPU (lack of synchronization primitives and limited memory caching mechanisms) can make GPU-based computation inefficient. Now Bio-technologies bring more chances to Bioinformatics and Biological Engineering. Our paper introduces a way to solve the longest overlap region of non-coding DNA sequences on using the Compute Unified Device Architecture (CUDA) platform Intel(R) Core(TM) i3- 3110m quad-core. Compared to standard CPU implementation, CUDA performance proves the method of the longest overlap region recognition of noncoding DNA is an efficient approach to high-performance bioinformatics applications. Studies show the fact that efficiency of GPU performance is more than 20 times speedup than that of CPU serial implementation. We believe our method gives a cost-efficient solution to the bioinformatics community for solving longest overlap region recognition problem and other related fields.