检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,861 篇 会议
213 篇 期刊文献
1 篇 学位论文

馆藏范围

2,075 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

546 篇 工学
- 272 篇 电气工程
- 269 篇 计算机科学与技术...
- 132 篇 信息与通信工程
- 81 篇 软件工程
- 38 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 27 篇 仪器科学与技术
- 24 篇 生物医学工程（可授...
- 14 篇 机械工程
- 13 篇 测绘科学与技术
- 8 篇 网络空间安全
- 7 篇 航空宇航科学与技...
- 7 篇 生物工程
- 5 篇 交通运输工程
- 3 篇 光学工程
- 3 篇 土木工程
63 篇 理学
- 19 篇 数学
- 19 篇 系统科学
- 11 篇 物理学
- 10 篇 地球物理学
- 6 篇 生物学
- 2 篇 地理学
- 2 篇 海洋科学
- 2 篇 统计学（可授理学、...
58 篇 医学
- 48 篇 临床医学
- 9 篇 基础医学(可授医学...
- 3 篇 特种医学
36 篇 管理学
- 35 篇 管理科学与工程(可...
12 篇 文学
- 12 篇 新闻传播学
5 篇 农学
- 4 篇 作物学
2 篇 军事学
1 篇 经济学
1 篇 艺术学

主题

2,075 篇 compression algo...
655 篇 image coding
493 篇 data compression
285 篇 encoding
226 篇 transform coding
221 篇 decoding
206 篇 algorithm design...
164 篇 dictionaries
157 篇 bandwidth
151 篇 video compressio...
144 篇 hardware
143 篇 computer science
131 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
110 篇 bit rate
102 篇 costs
102 篇 quantization
97 篇 frequency
97 篇 image reconstruc...

机构

9 篇 hewlett packard ...
6 篇 school of electr...
5 篇 department of co...
5 篇 department of el...
5 篇 david samoff res...
5 篇 microsoft resear...
5 篇 institute of com...
4 篇 information syst...
4 篇 faculty of scien...
4 篇 university of ca...
4 篇 school of inform...
4 篇 univ las palmas ...
4 篇 institute of sig...
4 篇 department of el...
4 篇 xerox corporatio...
4 篇 department of el...
4 篇 department of co...
4 篇 department of co...
4 篇 department of el...
4 篇 department of co...

作者

9 篇 a. mukherjee
8 篇 en-hui yang
7 篇 w. wolf
6 篇 m. vetterli
6 篇 radu rădescu
6 篇 h. lekatsas
5 篇 chulhee lee
5 篇 k. sayood
5 篇 p.l. dragotti
5 篇 xiaolin wu
5 篇 martin burtscher
5 篇 barrios yubal
5 篇 a. ortega
5 篇 n. chaddha
5 篇 sarmiento robert...
5 篇 yuan xie
5 篇 d. kirovski
4 篇 beatrice arvinti
4 篇 jan platos
4 篇 s. dandapat

语言

2,047 篇 英文
14 篇 中文
13 篇 其他

检索条件"主题词=compression algorithms"

共 2075 条记录，以下是1681-1690 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Lossless compression of ECG signals

Lossless compression of ECG signals

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Z. Arnavut E. Plaku

In this paper the authors study the compression techniques for electrocardiogram (ECG) signals based on Block Sorting Techniques. They introduce a new and faster block transformation than the Burrows and Wheeler Transformation (BWT), and later compare them for ECG data compression. They show that their algorithm yields better compression gain than the Burrows and Wheeler's algorithm (BWA), Gzip and the Shorten waveform coder for lossless ECG data compression.

关键词： Electrocardiography Sorting Data compression Image coding compression algorithms Biomedical computing Digital systems

来源：评论

学校读者我要写书评

暂无评论

Improving text compression ratios with the Burrows-Wheeler transform

Improving text compression ratios with the Burrows-Wheeler t...

引用

Data compression Conference (DCC)

作者： H. Kruse A. Mukherjee Department of Computer Science University of Central Florida Orlando FL USA

[Summary form only given]. In this paper we describe several methods that can be used to improve the compression ratio of compression algorithms based an the Burrows-Wheeler transform, as implemented in 'bzip2', when used in combination with English language text files. We first briefly describe the Burrows-Wheeler transform and some of its strengths and weaknesses. We then describe our implementations of enhancements and test results. All of our enhancements are implemented in the form of pre- and postprocessing algorithms that are used in addition to the transform. The use of our algorithms has resulted in improvements in compression ratios of up to 20% over bzip2. The first method involves changing the order of characters in the character set encoding of the input file. We describe different ways to improve the encoding order. A more elaborate method involves minimizing the contextual differences between subsequent codes, using an optimized encoding order obtained by solving a traveling salesman problem. In the second method we replaced frequently occurring bigrams by single unused character codes, in order to better utilize the available character encoding space. In most cases this method did not result in improvements in the compression ratio. The final method is a refinement of the method we presented in "Preprocessing Text to Improve compression Ratios", DCC 98. A common English language dictionary is used to preprocess input text and replace English words with encodings that are more easily compressible by bzip2. In this paper we describe optimizations to our original method to further improve the compression ratio. We also show practical ways to use our method on wide-area networks like the Internet, and easy ways to solve the problem of dictionary distribution and caching.

关键词： Encoding Natural languages Optimization methods Dictionaries compression algorithms Testing Traveling salesman problems Space exploration Data preprocessing IP networks

来源：评论

学校读者我要写书评

暂无评论

A general-purpose compression scheme for databases

A general-purpose compression scheme for databases

引用

Data compression Conference (DCC)

作者： A. Cannane H.E. Williams J. Zobel Department of Computer Science RMIT University Melbourne Australia

Summary form only given. Current adaptive compression schemes such as GZIP and COMPRESS are impractical for database compression as they do not allow random access to individual records. A compression algorithm for general-purpose database systems must address the problem of randomly accessing and individually decompressing records, while maintaining compact storage of data. The SEQUITUR algorithm of Nevill-Manning et al., (1994, 1996, 1997) also adaptively compresses data, achieving excellent compression but with significant main-memory requirements. A preliminary version of SEQUITUR used a semi-static modelling approach to achieve slightly worse compression than the adaptive approach. We describe a new variant of the semi-static SEQUITUR algorithm, RAY, that reduces main-memory use and allows random-access to databases. RAY models repetition in sequences by progressively constructing a hierarchical grammar with multiple passes through the data. The multiple pass approach of RAY uses statistics on character pair repetition, or digram frequency, to create rules in the grammar. While our preliminary implementation is not especially fast, the multi-pass approach permits reductions in compression time, at the cost of affecting compression performance, by limiting the number of passes. We have found that RAY has practicable main-memory requirements and achieves better compression than an efficient Huffmann scheme and popular adaptive compression techniques. Moreover, our scheme allows random access to data and is not restricted to databases of text.

关键词： Data compression IEEE Computer Society Press Computer science compression algorithms Database systems Statistics Frequency Costs

来源：评论

学校读者我要写书评

暂无评论

Near-lossless embedded compression algorithm for cost reduction in DTV receivers

Near-lossless embedded compression algorithm for cost reduct...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： M. Van der Schaar-Mitrea P.H.N. De With Video Communication Department Philips Research Laboratories Briarcliff Manor USA Fac. Computer Engineering University of Mannheim Mannheim Germany

We present a novel near-lossless technique to reduce the memory costs of an MPEG-2 decoder with a factor of almost 6, by recompressing the I- and P-reference pictures prior to memory storage for motion compensation.

关键词： compression algorithms Digital TV Transform coding Image coding Decoding Quantization Costs Bit rate Motion compensation Digital video broadcasting

来源：评论

学校读者我要写书评

暂无评论

Joint compression and detection in the wavelet domain

Joint compression and detection in the wavelet domain

引用

Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Jun Tian R.O. Wells Computational Mathematics Laboratory Rice University Houston TX USA

The wavelet transform provides a hierarchical structure that enables processing image data in the compressed wavelet domain. In this paper we propose a method to perform image compression and target detection simultaneously. We incorporate a two parameter constant false alarm rate detector into a wavelet-based image compression algorithm and achieve the joint compression and detection.

关键词： Wavelet domain Image coding Discrete wavelet transforms Signal processing algorithms Wavelet coefficients Continuous wavelet transforms Wavelet transforms Mathematics Target recognition compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Word-based compression methods for large text documents

Word-based compression methods for large text documents

引用

Data compression Conference (DCC)

作者： J. Dvorsky J. Pokorny V. Snasel Computer Science Department Palacky University Olomouc Olomouc Czech Republic Department of Software Engineering Charles University Prague Czech Republic

Summary form only given. We present a new compression method, called WLZW, which is a word-based modification of classic LZW. The algorithm is two-phase, it uses only one table for words and non-words (so called tokens), and a single data structure for the lexicon is usable as a text index. The length of words and non-words is restricted. This feature improves the compress ratio achieved. Tokens of unlimited length alternate, when they are read from the input stream. Because of restricted length of tokens alternating of tokens is corrupted, because some tokens are divided into several parts of same type. To save alternating of tokens two special tokens are created. They are empty word and empty non-word. They contain no character. Empty word is inserted between two non-words and empty non-word between two words. Alternating of tokens is saved for all sequences of tokens. The alternating of tokens is an important piece of information. With this knowledge the kind of the next token can be predicted. One selected (so-called victim) non-word can be deleted from input stream. An algorithm to search the victim is also presented. In the decompression phase, a deleted victim is recognized as an error in alternating of words and non-words in sequence. The algorithm was tested on many texts in different formats (ASCII, RTF). The Canterbury corpus, a large set, was used as a standard for publication results. The compression ratio achieved is fairly good, on average 25%-22%. Decompression is very fast. Moreover, the algorithm enables evaluation of database queries in given text. This supports the idea of leaving data in the compressed state as long as possible, and to decompress it when it is necessary.

关键词： compression algorithms Data compression Software engineering Computer science Spatial databases Data structures Testing Standards publication Conference management Image coding

来源：评论

学校读者我要写书评

暂无评论

Data compression using long common strings

Data compression using long common strings

引用

Data compression Conference (DCC)

作者： J. Bentley D. McIlroy Bell Laboratories Murray Hill NJ USA Department of Computer Science Dartmouth College Hanover NH USA

We describe a precompression algorithm that effectively represents any long common strings that appear in a file. The algorithm interacts well with standard compression algorithms that represent shorter strings that are near in the input text. Our experiments show that some real data sets do indeed contain many long common strings. We extend the fingerprint mechanisms of our algorithm to a program that identifies long common strings in an input file. This program gives interesting insights into the structure of real data files that contain long common strings.

关键词： Data compression compression algorithms Fingerprint recognition

来源：评论

学校读者我要写书评

暂无评论

Data compression for the next-generation space telescope

Data compression for the next-generation space telescope

引用

Data compression Conference (DCC)

作者： M.A. Nieto-Santisteban D.J. Fixsen J.D. Offenberg R.J. Hanisch H.S. Stockman Space Telescope Science Institute MD USA Raytheon STX Corporation Lanham MD USA

Summary form only given. The next-generation space telescope (NGST) will produce about 600 GB/day, assuming we use the NASA yardstick 8k/spl times/8k NIR camera (16 bits/pixel), save and transmit 64 non-destructive read-outs per image, and the camera is in continuous use (about 80 observations/day, 10/sup 3/ s each). However, with an L2 halo orbit, the NASA NGST study estimates a downlink rate of 5.35 GB/day using X-band. Clearly the volume of data to downlink must be reduced by at least a factor of 100. Astronomical images are noisy. This fact makes them difficult to compress by lossless compression algorithms such as Huffman, Lempel-Ziv, run-length, or arithmetic code. However, they also have the virtue of showing similar values among adjacent pixels. Techniques such as Rice's algorithm (Rice et al., 1993) and derivatives (White and Becker, 1998; Stiavelli and White, 1997) can take advantage of this. We present the way in which some of these compression techniques would work with NGST images. Unfortunately, these lossless algorithms give us compression ratios that still exceed the telemetry guidelines. We have also looked into the feasibility of doing lossy compression by scaling the original image prior to the lossless compression. Under this scheme, we find substantial data reduction with a negligible effect on the data quality.

关键词： Data compression Telescopes Image coding NASA Cameras Downlink Pixel compression algorithms Arithmetic Telemetry

来源：评论

学校读者我要写书评

暂无评论

An improved TIN compression using Delaunay triangulation

An improved TIN compression using Delaunay triangulation

引用

Pacific Conference on Computer Graphics and Applications

作者： Yang-Soo Kim Dong-Gyu Park Ho-Youl Jung Hwan-Gue Cho Jang-Jun Dong Keum-Jung Ku Department of Computer Science Pusan National University busan South Korea busan South Korea

In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper is based on that most of 2.5 dimensional terrain connection are very similar to plane-projected Delaunay triangulation of their vertex set. We only need to keep the vertex coordinates and a few edges that are not included in the Delaunay edges. We present an efficient encoding method for the set of edges using vertex reordering and general bracketing algorithm. Also we propose progressive visualization method for web-based GIS. In the experiments, the method was examined on several TIN data with various resolutions, which were generated by five typical terrain simplification algorithms. The connectivity information of common terrain data could be compressed by 0.23 bits per vertex.

关键词： Tin Geographic Information Systems Geometry Computer science Electronic mail Data visualization Rain compression algorithms Encoding Strips

来源：评论

学校读者我要写书评

暂无评论

Fast multi-match Lempel-Ziv

Fast multi-match Lempel-Ziv

引用

Data compression Conference (DCC)

作者： M.S. Pinho W.A. Finamore W.A. Pearlman Rensselaer Polytechnic Institute Troy NY USA Pontifícia Universidade Católica Rio de Janeiro Brazil

Summary form only given. One of the most popular encoders in the literature is the LZ78, which was proposed by Ziv and Lempel (1978). We establish a recursive way to find the longest m-tuple match. We prove the following theorem that shows how to obtain a longest (m+1)-tuple match from the longest m-tuple match. It shows that a (m+1)-tuple match is the concatenation of the first (m-1) words of the m-tuple match with the next longest double match. Therefore, the longest (m+1)-tuple match can be found using the m-tuple match and a procedure to compute the longest double match. Our theorem is as follows. Let A be a source alphabet, let A* be the set of all finite strings of A, and D/spl sub/A*, such that if x/spl isin/D then all prefixes of x belong to D. Let u denote a one-sided infinite sequence. If b/sub 1//sup m/ is the longest m-tuple match in u, with respect to D, then there is a longest (m+1)-tuple match b/spl circ//sub 1//sup m+1/, such that b/spl circ//sub i/=b/sub i/,/spl forall/i/spl isin/{1,...m-1}. We implemented the fast mmLZ and the results show a improvement in compression of around 5% over the LZW, in the Canterbury Corpus (Arnold and Bell, 1997) with little extra computational cost.

关键词： Dictionaries Encoding Algorithm design and analysis Computational efficiency Data compression Numerical analysis compression algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共208页 << < 165 166 167 168 169 170 171 172 173 174 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：