共查询到20条相似文献，搜索用时 31 毫秒
1.
《Information processing & management》2005,41(5):1175-1192
Block-sorting is an innovative compression mechanism introduced in 1994 by Burrows and Wheeler. It involves three steps: permuting the input one block at a time through the use of the Burrows–Wheeler transform (bwt); applying a move-to-front (mtf) transform to each of the permuted blocks; and then entropy coding the output with a Huffman or arithmetic coder. Until now, block-sorting implementations have assumed that the input message is a sequence of characters. In this paper we extend the block-sorting mechanism to word-based models. We also consider other recency transformations, and are able to show improved compression results compared to mtf and uniform arithmetic coding. For large files of text, the combination of word-based modeling, bwt, and mtf-like transformations allows excellent compression effectiveness to be attained within reasonable resource costs. 相似文献
2.
This paper presents a size reduction method for the inverted file, the most suitable indexing structure for an information retrieval system (IRS). We notice that in an inverted file the document identifiers for a given word are usually clustered. While this clustering property can be used in reducing the size of the inverted file, good compression as well as fast decompression must both be available. In this paper, we present a method that can facilitate coding and decoding processes for interpolative coding using recursion elimination and loop unwinding. We call this method the unique-order interpolative coding. It can calculate the lower and upper bounds of every document identifier for a binary code without using a recursive process, hence the decompression time can be greatly reduced. Moreover, it also can exploit document identifier clustering to compress the inverted file efficiently. Compared with the other well-known compression methods, our method provides fast decoding speed and excellent compression. This method can also be used to support a self-indexing strategy. Therefore our research work in this paper provides a feasible way to build a fast and space-economical IRS. 相似文献
3.
将 Julia曲线"按正方形形状以多种方式进行量化,并将量化的 Julia曲线 "用于分形图像压缩编码,改变了分形图像压缩编码以变化的压缩编码字典进行编码的缺点。此外,还建立了一个小型的常用字典,用以加速分形图像的压缩编码。实验结果表明, Julia曲线 "能很好地拼贴所要编码的图像,并具有分形图像的解码优点。 相似文献
4.
5.
小波变换和多级树集合分裂算法(SPIHT)在合成孔径雷达(SAR)图像压缩方面取得了良好的效果,但SPIHT编码方法的复杂性制约了压缩速率的提高.针对SPIHT编码速度慢和占用内存大的问题,提出一种改进的无链表SPIHT算法,以提高编码运算速度,减少资源占用量,使其适于硬件实现.实验结果表明,该方法能达到与原算法相同的压缩效果,而运算速度大大提高,适于实时实现. 相似文献
6.
One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, codes with certain algebraic structures are preferred for both theoretical and practical reasons. In this work we focus on the class of constacyclic codes to first generate all constacyclic codes exhaustively over small finite fields of order up to 9 to create a database of best constacyclic codes. We will then use this database as a building block for a search algorithm for new quasi-twisted codes. Our search on constacyclic codes has revealed 16 new codes, i.e. codes with better parameters than currently best-known linear codes. Given that constacyclic codes are well known, this is a surprising result. Moreover, using the standard constructions of puncturing, shortening or extending a given code, we also derived 55 additional new codes from these constacyclic codes. Hence, we achieved improvements on 71 entries in the database of best-known codes. We use a search strategy that is comprehensive, i.e. it computes every constacyclic code for a given length and shift constant, and it avoids redundantly examining constacyclic codes that are equivalent to either cyclic codes or other constacyclic codes. 相似文献
7.
针对分形编码算法编码时间太长、精度控制需要细分等缺点提出对编码图像进行分级逼近的新的分形编码算法．对这一思想的可行性在理论上进行了有益的探索,给出了该算法成立的理论基础,并得出了任给一图像,都可以找出一组压缩变换,使得从任意图像出发,经该组变换压缩迭代后重构原始图像的新的构造性证明．给出一个新的具体实现分形编码的算法．实验表明,在提高压缩比和图像恢复质量的同时,运算时间也大大缩短 相似文献
8.
A bidirectional delta file is a novel concept, introduced in this paper, for a two way delta file. Previous work focuses on single way differential compression called forwards and backwards delta files. Here we suggest to efficiently combine them into a single file so that the combined file is smaller than the combination of the two individual ones. Given the bidirectional delta file of two files S and T and the original file S, one can decode it in order to produce T. The same bidirectional delta file is used together with the file T in order to reconstruct S. This paper presents two main strategies for producing an efficient bidirectional delta file in terms of the memory storage it requires; a quadratic time, optimal, dynamic programming algorithm, and a linear time, greedy algorithm. Although the dynamic programming algorithm often produces better results than the greedy algorithm, it is impractical for large files, and it is only used for theoretical comparisons. Experiments between the implemented algorithms and the traditional way of using both forwards and backwards delta files are presented, comparing their processing time and their compression performance. These experiments show memory storage savings of about 25% using this bidirectional delta approach as compared to the compressed delta file constructed using the traditional way, while preserving approximately the same processing time for decoding. 相似文献
9.
Reza Gharibi Amir Hossein Rasekh Mohammad Hadi Sadreddini Seyed Mostafa Fakhrahmad 《Information processing & management》2018,54(6):1058-1076
Bug reports are an essential part of a software project's life cycle since resolving them improves the project's quality. When a new bug report is received, developers usually need to reproduce the bug and perform code review to locate the bug and assign it to be fixed. However, the huge number of bug reports and the increasing size of software projects make this process tedious and time-consuming. To solve this issue, bug localization techniques try to rank all the source files of a project with respect to how likely they are to contain a bug. This process reduces the search space of source files and helps developers to find relevant source files quicker. In this paper, we propose a multi-component bug localization approach that leverages different textual properties of bug reports and source files as well as the relations between previously fixed bug reports and a newly received one. Our approach uses information retrieval, textual matching, stack trace analysis, and multi-label classification to improve the performance of bug localization. We evaluate the performance of the proposed approach on three open source software projects (i.e., AspectJ, SWT, and ZXing) and the results show that it can rank appropriate source files for more than 52% of bugs by recommending only one source file and 78% by recommending ten files. It also improves the MRR and MAP values compared to several existing state-of-the-art bug localization approaches. 相似文献
10.
11.
分形图像编码是目前可达到的压缩比最高的编码技术,但由于编码时间长阻碍了它的发展。本文首先介绍了分形理论和提升小波变换理论,提出快速提升小波变换结合快速分形编码的混合编码方法。实验结果表明,该算法加快了图像的编码速度,同时压缩比也有很大提高。 相似文献
12.
H.264帧内预测算法改进 总被引：1，自引：0，他引：1
帧内预测是H.264视频编解码标准中重要的组成部分,它能够显著提高压缩比率,但是大大提高了计算复杂度,很难运用到实时传输中,因此,如何提高运算速率是改进算法的核心问题。提出了一种快速模式选择算法,在保证图像质量的情况下较大地提高了帧内编码速度。 相似文献
13.
14.
对如何优化地方性新闻搜索进行了探讨,通过运用IKAnalyzer所提供的开源程序对每个网站的源代码中的中文进行分词处理,再利用TF-IDF算法对每个网站的关键词进行权重的计算,由高到低列出关键词向量。将这些网站的关键词向量逐一与标准关键词向量进行比较,从而将网站进行分类处理。以达到快速准确的搜索目的。 相似文献
15.
空间通信具有资源受限和差错率高等特点。国际空间数据系统顾问委员会（CCSDS）所制定的图像数据压缩标准（IDC)）一种应用于空间通信的图像编码标准。但该标准未能利用序列的时域相关性,仅适用于图像编码,不适应于空间视频通信。因此,结合运动补偿时域滤波,提出了一种基于CCSDS IDC的可伸缩性视频编码算法以及一种新颖的动态帧分组算法。实验结果表明：该算法具有良好的编码性能,并能适应于空间通信网带宽的动态变化。 相似文献
16.
We investigate the relationship between patenting activity and the population size of metropolitan areas in the United States over the last two decades (1980-2001). We find a clear superlinear effect, whereby new patents are granted disproportionately in larger urban centers, thus showing increasing returns in inventing activity with respect to population size. We characterize this relation quantitatively as a power law with an exponent larger than unity. This phenomenon is commensurate with the presence of larger numbers of inventors in larger metropolitan areas, which we find follows a quantitatively similar superlinear relationship to population, while the productivity of individual inventors stays essentially constant across metropolitan areas. We also find that structural measures of the patent co-authorship network although weakly correlated to increasing rates of patenting, are not enough to explain them. Finally, we show that R&D establishments and employment in other creative professions also follow superlinear scaling relations to metropolitan population size, albeit possibly with different exponents. 相似文献
17.
Looking to the Internet for models of governance 总被引：3，自引：0，他引：3
If code is law then standards bodies are governments. This flawed but powerful metaphor suggests the need to examine more closely those standards bodies that are defining standards for the Internet. In this paper we examine the International Telecommunications Union, the Institute for Electrical and Electronics Engineers Standards Association, the Internet Engineering Task Force, and the World Wide Web Consortium. We compare the organizations on the basis of participation, transparency, authority, openness, security and interoperability. We conclude that the IETF and the W3C are becoming increasingly similar. We also conclude that the classical distinction between standards and implementations is decreasingly useful as standards are embodies in code – itself a form of speech or documentation. Recent Internet standards bodies have flourished in part by discarding or modifying the implementation/standards distinction. We illustrate that no single model is superior on all dimensions. The IETF is not effectively scaling, struggling with its explosive growth with the creation of thousands of working groups. The IETF coordinating body, the Internet Society, addressed growth by reorganization that removed democratic oversight. The W3C, initially the most closed, is becoming responsive to criticism and now includes open code participants. The IEEE SA and ITU have institutional controls appropriate for hardware but too constraining for code. Each organization has much to learn from the others. 相似文献
18.
The ability to separate and analyze chemical species with high resolution, sensitivity, and throughput is central to the development of microfluidics systems. Deterministic lateral displacement (DLD) is a continuous separation method based on the transport of species through an array of obstacles. In the case of force-driven DLD (f-DLD), size-based separation can be modelled effectively using a simple particle-obstacle collision model. We use a macroscopic model to study f-DLD and demonstrate, via a simple scaling, that the method is indeed predominantly a size-based phenomenon at low Reynolds numbers. More importantly, we demonstrate that inertia effects provide the additional capability to separate same size particles but of different densities and could enhance separation at high throughput conditions. We also show that a direct conversion of macroscopic results to microfluidic settings is possible with a simple scaling based on the size of the obstacles that results in a universal curve. 相似文献
19.
A new method of index term dictionary compression in an inverted-file-orientated database is discussed. A technique of word coding that generates short fixed-length codes obtained from the index terms themselves by analysis of monogram and bigram statistical distributions is described. Transformation of the index term dictionary into a code dictionary preserves a word-to-word discrimination with a rate of three synonyms per 1300 terms, at compression ratio up to 90% and at low cost in terms of the CPU time expenditure. When applied in computer network environment, it offers substantial savings in communication channel utilization at negligible response time degradation. Experimental data for 26,113 index term dictionary of the New York Times Info Bank available via a computer network are presented. 相似文献
20.
In wireless communications, the channel is typically modeled as a random, linear, time-varying system that spreads the transmitted signal in both time and frequency due to multi-path propagation and Doppler effects. Estimated channel parameters allow system designers to develop coherent receivers that increase the system performance. In this paper, we show how time-frequency analysis can be used to model and estimate the time-varying channel of a multi-carrier spread spectrum (MCSS) system using a complex quadratic sequence as the spreading code. We will show that for this spreading code, the effects of time delays and Doppler frequency shifts, caused by the mobility of environment objects, can be combined and represented effectively as time shifts. The discrete evolutionary transform (DET), as a time-frequency analysis method, enables us to estimate the effective time shifts via a spreading function and to use them to equalize the channel. Using the effective time shifts, the time-varying channel can be represented simply as linear-time invariant system by embedding the Doppler shifts that characterize the time-varying channel into effective time shifts. The channel parameters are used to estimate the data bit sent. To illustrate the performance of the proposed method we perform several simulations with different levels of channel noise, jammer interference, and Doppler frequency shifts. 相似文献