2011 First International Conference on Data Compression, Communications and Processing最新文献_第4页

An Online Algorithm for Lightweight Grammar-Based Compression 一种基于语法的在线轻量级压缩算法

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.40

Shirou Maruyama, M. Takeda, Masaya Nakahara, H. Sakamoto

引用次数: 44

A Generic Intrusion Detection and Diagnoser System Based on Complex Event Processing 基于复杂事件处理的通用入侵检测诊断系统

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.43

M. Ficco, L. Romano

引用次数: 50

Intrusion Tolerant Approach for Denial of Service Attacks to Web Services Web服务拒绝服务攻击的入侵容忍方法

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.44

M. Ficco, M. Rak

引用次数: 31

Multithread Content Based File Chunking System in CPU-GPGPU Heterogeneous Architecture CPU-GPGPU异构架构下基于内容的多线程文件分块系统

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.20

Zhi Tang, Y. Won

引用次数: 12

Natural Language Compression per Blocks 每个块的自然语言压缩

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.25

P. Procházka, J. Holub

引用次数: 3

A Review of DNA Microarray Image Compression DNA微阵列图像压缩研究进展

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.21

Miguel Hernández-Cabronero, Ian Blanes, J. Serra-Sagristà, M. Marcellin

引用次数: 5

Hierarchical Type Classes and Their Entropy Functions 分层类型类及其熵函数

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.36

J. Kieffer

{"title":"Hierarchical Type Classes and Their Entropy Functions","authors":"J. Kieffer","doi":"10.1109/CCP.2011.36","DOIUrl":"https://doi.org/10.1109/CCP.2011.36","url":null,"abstract":"For each $j geq 1$, if $T_j$ is the finite rooted binary tree with $2^j$ leaves, the hierarchical type class of binary string $x$ of length $2^j$ is obtained by placing the entries of $x$ as label son the leaves of $T_j$ and then forming all permutations of $x$according to the permutations of the leaf labels under all isomorphisms of tree $T_j$ into itself. The set of binary strings of length $2^j$ is partitioned into hierarchical type classes, and in each such class, all of the strings have the same type $(n_0^j, n_1^j)$, where $n_0^j, n_1^j$ are respectively the numbers of zeroes and ones in the strings. Let $p(n_0^j, n_1^j)$ be the probability vector $(n_0^j/2^j, n_1^j/2^j)$belonging to the set ${cal P}_2$ of all two-dimensional probability vectors. For each $j geq 1$, and each of the $2^j+1$ possible types $(n_0^j, n_1^j)$, a hierarchical type class ${cal S}(n_0^j, n_1^j)$is specified. Conditions are investigated under which there will exist a function $h:{cal P}_2to [0, infty)$ such that for each $pin {cal P}_2$, if ${(n_0^j, n_1^j):jgeq 1}$ is any sequence of types for which $p(n_0^j, n_1^j) to p$, then the sequence ${2^{-j}log_2({rm card}({cal S}(n_0^j, n_1^j))):j geq 1}$converges to $h(p)$. Such functions $h$, called hierarchical entropy functions, play the same role in hierarchical type class coding theory that the Shannon entropy function on ${cal P}_2$ does in traditional type class coding theory, except that there are infinitely many hierarchical entropy functions but only one Shannon entropy function. One of the hierarchical entropy functions $h$ that is studied is a self-affine function for which a closed-form expression is obtained making use of an iterated function system whose attractor is the graph of $h$.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130835446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Electrophysiological Data Processing Using a Dynamic Range Compressor Coupled to a Ten Bits A/D Convertion Port 使用一个动态范围压缩机耦合到一个10位a /D转换端口的电生理数据处理

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.24

F. Babarada, C. Ravariu, A. Janel

引用次数: 3

Pattern Matching on Sparse Suffix Trees 稀疏后缀树的模式匹配

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-03-14 DOI: 10.1109/CCP.2011.45

R. Kolpakov, G. Kucherov, Tatiana Starikovskaya

引用次数: 14

An Axiomatic Approach to the Notion of Similarity of Individual Sequences and Their Classification 单个序列相似性概念的公理化方法及其分类

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-02-27 DOI: 10.1109/CCP.2011.29

J. Ziv

引用次数: 2