By Topic

2011 First International Conference on Data Compression, Communications and Processing

21-24 June 2011

Filter Results

Displaying Results 1 - 25 of 52
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (439 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (140 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (117 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2011, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (72 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2011, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • Reviewer list

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • An Axiomatic Approach to the Notion of Similarity of Individual Sequences and Their Classification

    Publication Year: 2011, Page(s):3 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    An axiomatic approach to the notion of similarity of sequences, that seems to be natural in many cases (e.g. Phylogenetic analysis), is proposed. Despite of the fact that it is not assume that the sequences are a realization of a probabilistic process (e.g. a variable-order Markov process), it is demonstrated that any classifier that fully complies with the proposed similarity axioms must be based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic Optimal Lossless Compression via the CSE Technique

    Publication Year: 2011, Page(s):11 - 18
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    A novel loss less compression algorithm known as compression by sub string enumeration (CSE) is analyzed and modified. The CSE compression algorithm is a block-based, off-line method, as is the case with enumerative codes and the block-sorting compression scheme. First, we propose an encoding model that achieves asymptotic optimality for stationary ergodic sources. The codeword length attained by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Online Algorithm for Lightweight Grammar-Based Compression

    Publication Year: 2011, Page(s):19 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    Grammar-based compression is a well-studied technique for constructing a small context-free grammar (CFG) uniquely deriving a given text. In this paper, we present an online algorithm for lightweight grammar-based compression. Our algorithm is based on the LCA algorithm [Sakamoto et al. 2004] which guarantees nearly optimum compression ratio and space. LCA, however, is an offline algorithm and req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Non-stationary Prediction, Optimization and Mixing for Data Compression

    Publication Year: 2011, Page(s):29 - 37
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    In this paper an approach to modelling nonstationary binary sequences, i.e., predicting the probability of upcoming symbols, is presented. After studying the prediction model we evaluate its performance in two non-artificial test cases. First the model is compared to the Laplace and Krichevsky-Trofimov estimators. Secondly a statistical ensemble model for compressing Burrows-Wheeler-Transform outp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache Friendly Burrows-Wheeler Inversion

    Publication Year: 2011, Page(s):38 - 42
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (175 KB) | HTML iconHTML

    The Burrows-Wheeler transform permutes the symbols of a string such that the permuted string can be compressed effectively with fast, simple techniques. Inversion of the transform is a bottleneck in practice. Inversion takes linear time, but, for each symbol decoded, folklore says that a random access into the transformed string (and so a CPU cache-miss) is necessary. In this paper we show how to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Approach to QoS Monitoring in the Cloud

    Publication Year: 2011, Page(s):45 - 51
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (557 KB) | HTML iconHTML

    The availability of a dependable (i.e. reliable and timely) QoS monitoring facility is key for the real take up of cloud computing, since - by allowing organizations to receive the full value of cloud computing services - it would increase the level of trust they would place in this emerging technology. In this paper, we present a dependable QoS monitoring facility which relies on the "as a Servic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overload Control through Multiprocessor Load Sharing in ATCA Architecture

    Publication Year: 2011, Page(s):52 - 57
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (407 KB) | HTML iconHTML

    This work will deal with overload control schemes within ATCA modules achieving IMS functionalities and exploiting the cooperation between processors. A performance evaluation will be carried out on two algorithms aimed at optimizing multiple processors workload within ATCA boards performing incoming traffic control. The driving policy of the first algorithm consists in a continuous estimation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multithread Content Based File Chunking System in CPU-GPGPU Heterogeneous Architecture

    Publication Year: 2011, Page(s):58 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (767 KB) | HTML iconHTML

    The fast development of Graphics Processing Unit (GPU) leads to the popularity of General-purpose usage of GPU (GPGPU). So far, most modern computers are CPU-GPGPU heterogeneous architecture and CPU is used as host processor. In this work, we promote a multithread file chunking prototype system, which is able to exploit the hardware organization of the CPU-GPGPU heterogeneous computer and determin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Natural Language Compression per Blocks

    Publication Year: 2011, Page(s):67 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    We present a new natural language compression method: Semi-adaptive Two Byte Dense Code (STBDC). STBDC performs compression per blocks. It means that the input is divided into the several blocks and each of the blocks is compressed separately according to its own statistical model. To avoid the redundancy the final vocabulary file is composed as the sequence of the changes in the model of the two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Straight-Line Programs: A Practical Test

    Publication Year: 2011, Page(s):76 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    We present an improvement of Rytter's algorithm that constructs a straight-line program for a given text and show that the improved algorithm is optimal in the worst case with respect to the number of AVL-tree rotations. Also we compare Rytter's and ours algorithms on various data sets and provide a comparative analysis of compression ratio achieved by these algorithms, by LZ77 and by LZW. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Backwards Search in Context Bound Text Transformations

    Publication Year: 2011, Page(s):82 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (651 KB) | HTML iconHTML

    The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and self-indexing methods used today. A key to the versatility of the BWT is the ability to search for patterns directly in the transformed text. A backwards search for a pattern P can be performed on a transformed text by iteratively determining the range of suffixes that match P. The search can be further... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern Matching on Sparse Suffix Trees

    Publication Year: 2011, Page(s):92 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (205 KB) | HTML iconHTML

    We consider a compact text index based on evenly spaced sparse suffix trees of a text [9]. Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start at block boundaries. We propose a new pattern matching algorithm on this structure. The algorithm is based on a notion of suffix links different from that of [9] and o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quick Estimation of Data Compression and De-duplication for Large Storage Systems

    Publication Year: 2011, Page(s):98 - 102
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    Many new storage systems provide some form of data reduction. In a recent paper we investigate how compression and de-duplication can be mixed in primary storage systems serving active data. In this paper we try to answer the question someone would ask before upgrading to a new, data reduction enabled storage server: how much storage savings the new system would offer for the data I have stored ri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Implementation of Block Motion Estimation Algorithms in Video Encoders

    Publication Year: 2011, Page(s):103 - 107
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (179 KB) | HTML iconHTML

    Block matching algorithms (BMA) are central to optimal frame prediction for motion estimation in video compression. This paper focuses on the efficiency of Hierarchical Search (HS) algorithms. The research proposed two new combinations of fast algorithms like Small Diamond-shaped Search Pattern (SDSP) and Square-Shaped Search Pattern (SSSP) with a three-level Hierarchical algorithm at different le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compression-Based Similarity

    Publication Year: 2011, Page(s):111 - 118
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB) | HTML iconHTML

    First we consider pair-wise distances for literal objects consisting of finite binary files. These files are taken to contain all of their meaning, like genomes or books. The distances are based on compression of the objects concerned, normalized, and can be viewed as similarity distances. Second, we consider pair-wise distances between names of objects, like "red" or "christianity." In this case ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The E-healthcare Point of Diagnosis Implementation as a First Instance

    Publication Year: 2011, Page(s):121 - 124
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (557 KB) | HTML iconHTML

    A new challenge in the biomedical engineering is the remote patient monitoring by web applications. This paper proposes a first instance of diagnosis that guide the patients to a first medical point, with the advantage of a flexible structure, suitable for the next web developers, like students from bioinformatics universities. These kinds of applications stand for a sub-component of the telemedic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless Connectivity for Remote Objective Monitoring of Bio-signals

    Publication Year: 2011, Page(s):125 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB) | HTML iconHTML

    In Remote Objective Monitoring of Bio-Signals(ROMOBS) project, an automated near real-time remote health-monitoring device is being developed. The goal of this device is to measure blood flow parameters (systolic/diastolic blood pressure, heart rate, etc.), report the measurement results to a medical centre, and get the response back to the outpatient, all in an autonomous fashion. The objective o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.