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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,854 篇 会议
211 篇 期刊文献
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

540 篇 工学
- 274 篇 计算机科学与技术...
- 259 篇 电气工程
- 130 篇 信息与通信工程
- 85 篇 软件工程
- 40 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 29 篇 仪器科学与技术
- 22 篇 生物医学工程（可授...
- 16 篇 机械工程
- 12 篇 测绘科学与技术
- 8 篇 网络空间安全
- 7 篇 生物工程
- 6 篇 航空宇航科学与技...
- 4 篇 光学工程
- 4 篇 交通运输工程
- 2 篇 建筑学
66 篇 理学
- 21 篇 数学
- 19 篇 系统科学
- 11 篇 物理学
- 9 篇 地球物理学
- 6 篇 生物学
- 2 篇 天文学
- 2 篇 地理学
- 2 篇 海洋科学
60 篇 医学
- 51 篇 临床医学
- 8 篇 基础医学(可授医学...
- 5 篇 特种医学
36 篇 管理学
- 35 篇 管理科学与工程(可...
12 篇 文学
- 12 篇 新闻传播学
5 篇 农学
- 4 篇 作物学
3 篇 艺术学
2 篇 军事学
1 篇 经济学

主题

2,068 篇 compression algo...
642 篇 image coding
489 篇 data compression
282 篇 encoding
218 篇 decoding
216 篇 transform coding
203 篇 algorithm design...
164 篇 dictionaries
154 篇 bandwidth
148 篇 video compressio...
142 篇 computer science
140 篇 hardware
130 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
108 篇 bit rate
99 篇 quantization
98 篇 costs
98 篇 discrete cosine ...
96 篇 pixel

机构

9 篇 hewlett packard ...
6 篇 school of electr...
5 篇 department of co...
5 篇 technion israel ...
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...

作者

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,042 篇 英文
14 篇 中文
12 篇 其他

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

共 2068 条记录，以下是1951-1960 订阅

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

详细简洁

排序：

Enterprise text processing: a sparse matrix approach

Enterprise text processing: a sparse matrix approach

引用

International Conference on Information Technology: Coding and Computing (ITCC)

作者： N. Goharian T. El-Ghazawi D. Grossman Illinois Institute of Technology Chicago IL USA George Mason University Fairfax VA USA

ISBN: (纸本)0769510620

Documents, both internal and related publicly available, are now considered a corporate asset. The potential to efficiently and accurately search such documents is of great significance. We demonstrate the application of sparse matrix-vector multiplication algorithms for text storage and retrieval as a means of supporting efficient and accurate text processing. As many parallel sparse matrix-vector multiplication algorithms exist, such an information retrieval approach lends itself to parallelism. This enables us to attack the problem of parallel information retrieval, which has resisted good scalability. We use sparse matrix compression algorithms and compare the storage of a subcollection of the commonly used NIST TREC corpus with a traditional inverted index. We demonstrate query processing using a sparse matrix-vector multiplication algorithm. Our results indicate that our approach saves approximately 35% of the total storage requirements for the inverted index. Additionally to improve accuracy, we develop a novel matrix based relevance feedback technique as well as a proximity search algorithm. The results of our experiment to incorporate proximity search capability into the system also indicate 35% less storage for the sparse matrix over the inverted index.

关键词： Text processing Sparse matrices Information retrieval compression algorithms Scalability NIST Query processing Feedback Web sites Books

来源：评论

学校读者我要写书评

暂无评论

CP based OFDM Radar Range Reconstruction under the Background of Fragmented Spectrum (Poster)

CP based OFDM Radar Range Reconstruction under the Backgroun...

引用

International Conference on Information Fusion

作者： Xinyu Liu Tianxian Zhang Qiao Shi Lingjiang Kong School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu Sichuan China

ISBN: (数字)9780996452786

ISBN: (纸本)9781728118406

In this paper, considering the limitation of spectrum resource scarcity to the classical CP-OFDM method in the radar applications, a range reconstruction model based on CP-OFDM is investigated on the background of fragmented spectrum. To match the bandwidth of available fragmented spectrums, original OFDM subcarriers are arbitrarily divided into several resource blocks (RB) and modulated into the desired frequency sub-bands firstly. Then, a sufficient cyclic prefix (CP) is added to each resource block OFDM pulse to guarantee the inter-range-cell interference (IRCI) free in our constructed transceiver signal model. Besides, a range compression algorithm is presented, acquiring nearly zero sidelobes in the range profile. Analysis about the point spread function with zero doppler of RB-CP-OFDM and simulation results about the range reconstruction show that the proposed method can provide satisfactory performances.

关键词： OFDM Bandwidth Frequency modulation Interference Transceivers compression algorithms Simulation

来源：评论

学校读者我要写书评

暂无评论

TreeZip: A New Algorithm for Compressing Large Collections of Evolutionary Trees

TreeZip: A New Algorithm for Compressing Large Collections o...

引用

Data compression Conference (DCC)

作者： Suzanne J. Matthews Seung-Jin Sul Tiffani L. Williams Department of Computer Science & Engineering Texas A and M University USA

ISBN: (纸本)9781424464258;9780769539942

The primary advantage of TreeZip is its use of semantic compression, which allows us to uniquely store tree relationship information. Phylogenetic trees are stored in a format known as a Newick representation, which uses nested parentheses to represent the evolutionary relationships (or subtrees) within a phylogenetic tree. TreeZip uses two universal hashing functions in order to represent compactly all of the shared evolutionary relationships in the tree collection. In our previous work, we have used successively universal hash functions in our HashCS and HashRF algorithms that build consensus trees and topological distance matrices, respectively. Once the hash table is constructed, the TreeZip then writes the compressed file depicting the information contained in the collection of phylogenetic trees.

关键词： Phylogeny compression algorithms Data compression Computer science Data engineering Organisms History Standards development Testing Robustness

来源：评论

学校读者我要写书评

暂无评论

A hardware/software reconfigurable architecture for adaptive wireless image communication

A hardware/software reconfigurable architecture for adaptive...

引用

Asia and South Pacific Design Automation Conference

作者： D. Panigrahi C.N. Taylor S. Dey Department of Electrical and Computer Engineering University of California San Diego USA

ISBN: (纸本)0769514413

With the projected significant growth in mobile internet and multimedia services, there is a strong demand for next-generation appliances capable of wireless image communication. One of the major bottlenecks in enabling wireless image communication is the high energy requirement, which may surpass the current and future capabilities of battery technologies. Past studies have shown that the bottlenecks can be overcome by developing adaptive multimedia compression algorithms which can adapt to dynamic channel conditions and service requirements. We present an application-specific hardware/software reconfigurable architecture to support adaptive image compression algorithms. We present a design methodology which considers co-design between adaptive algorithms and architectural design leading to a reconfigurable architecture for image compression algorithms. Codesign of the proposed architecture aims not only at performance and power efficient implementation, but also towards fast and efficient run-time adaptation of an adaptive image compression algorithm.

关键词： Hardware Reconfigurable architectures Image coding Wireless communication Image communication Web and internet services Home appliances Batteries compression algorithms Software algorithms

来源：评论

学校读者我要写书评

暂无评论

A Pipelined Fast 2D-DCT Accelerator for FPGA-based SoCs

A Pipelined Fast 2D-DCT Accelerator for FPGA-based SoCs

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Antonino Tumeo Matteo Monchiero Gianluca Palermo Fabrizio Ferrandi Donatella Sciuto Dipartimento di Elettronica e Informazione Politecnico di Milano Milan Italy

ISBN: (纸本)9780769528960

Multimedia applications, and in particular the encoding and decoding of standard image and video formats, are usually a typical target for systems-on-chip (SoC). The bi-dimensional discrete cosine transformation (2D-DCT) is a commonly used frequency transformation in graphic compression algorithms. Many hardware implementations, adopting disparate algorithms, have been proposed for field programmable gate arrays (FPGA). These designs focus either on performance or area, and often do not succeed in balancing the two aspects. In this paper, we present a design of a fast 2D-DCT hardware accelerator for a FPGA-based SoC. This accelerator makes use of a single seven stages 1D-DCT pipeline able to alternate computation for the even and odd coefficients in every cycle. In addition, it uses special memories to perform the transpose operations. Our hardware takes 80 clock cycles at 107MHz to generate a complete 8times8 2D DCT, from the writing of the first input sample to the reading of the last result (including the overhead of the interface logic). We show that this architecture provides optimal performance/area ratio with respect to several alternative designs.

关键词： Hardware Field programmable gate arrays Multimedia systems Image coding Decoding Video compression Frequency Graphics compression algorithms Pipelines

来源：评论

学校读者我要写书评

暂无评论

Combining motion estimation with feature extraction in MPEG video coders

Combining motion estimation with feature extraction in MPEG ...

引用

EUROMICRO Conference

作者： P. Baglietto A.L. Frisiani DIST-University of Genoa Genoa Italy

General purpose motion estimation algorithms do not exploit the information available about the fixed characteristics of the video sequences in specific application domains. In this paper we propose to take advantage of such information to develop efficient video compression algorithms and we apply the proposed approach to the highway monitoring application domain. The proposed approach allows also extracting selected features at the video compression level and more specifically those features related to object movements.

关键词： Motion estimation Feature extraction Transform coding Video compression Road transportation Video sequences Monitoring Electrical capacitance tomography MPEG standards compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Observations on Compressing Text Files of Varying Length

Observations on Compressing Text Files of Varying Length

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Mohammad Hjouj Btoush Jawed Siddiqi Babak Akhgar Ziad Dawahdeh Sheffield Hallam University UK Mutah University Jordan

The paper compares different data compression algorithms of text files: LZW, Huffman, fixed-length code (FLC), and Huffman after using fixed-length code (HFLC). We compare these algorithms on different text files of different sizes in terms of compression scales of: size, ratio, time (speed), and entropy. Our evaluation reveals that initially for smaller size files the simplest algorithm namely LZW performs worst for first two scales than the more complex Huffman algorithm but as the size of the text increases interestingly the position is reversed. Moreover for the scales time and entropy LZW performs better than Huffmans but for larger files once again the position is reversed.

关键词： Data compression Probability Entropy compression algorithms Compressors Encoding Image storage Video compression Image coding Binary trees

来源：评论

学校读者我要写书评

暂无评论

Fully Convolutional Network for Removing DCT Artefacts From Images

Fully Convolutional Network for Removing DCT Artefacts From ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Patryk Najgebauer Rafał Scherer Leszek Rutkowski Częstochowa University of Technology Częstochowa Poland Information Technology Institute University of Social Sciences Lodz Poland

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

Image compression is one of the essential methods of image processing. Its most prominent advantage is the significant reduction of image size allowing for more efficient storage and transfer. However, lossy compression is associated with the loss of some image details in favor of reducing its size. In compressed images, the deficiencies are manifested by noticeable defects in the form of artifacts; the most common are block artifacts, ringing effect, or blur. In this article, we propose three models of fully convolutional networks with different configurations and examine their abilities in reducing compression artifacts. In the experiments, we research the extent to which the results are improved for models that will process the image in a similar way to the compression algorithm, and whether the initialization with predefined filters would allow for better image reconstruction than developed solely during learning.

关键词： Image coding Discrete cosine transforms Transform coding compression algorithms Neural networks Noise measurement Kernel

来源：评论

学校读者我要写书评

暂无评论

On-the-fly rendering of losslessly compressed irregular volume data

On-the-fly rendering of losslessly compressed irregular volu...

引用

IEEE Conference on Visualization

作者： Chuan-Kai Yang T. Mitra Tzi-Cker Chiueh Department of Computer Science State University of New York Stony Brook Stony Brook NY USA

Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to alleviate the disk I/O overhead associated with rendering a large tetrahedral mesh is to reduce the I/O bandwidth requirement through compression. Existing tetrahedral mesh compression algorithms focus only on compression efficiency and cannot be readily integrated into the mesh rendering process, and thus demand that a compressed tetrahedral mesh be decompressed before it can be rendered into a 2D image. This paper presents an integrated tetrahedral mesh compression and rendering algorithm called Gatun, which allows compressed tetrahedral meshes to be rendered incrementally as they are being decompressed, thus leading to an efficient irregular grid rendering pipeline. Both compression and rendering algorithms in Gatun exploit the same local connectivity information among adjacent tetrahedra, and thus can be tightly integrated into a unified implementation framework. Our tetrahedral compression algorithm is specifically designed to facilitate the integration with an irregular grid renderer without any compromise in compression efficiency. A unique performance advantage of Gatun is its ability to reduce the runtime memory footprint requirement by releasing memory allocated to tetrahedra as early as possible.

关键词： Rendering (computer graphics) Image coding compression algorithms Bandwidth Algorithm design and analysis Streaming media Head Lead compounds Pipelines Chromium

来源：评论

学校读者我要写书评

暂无评论

On the use of words as source alphabet symbols in PPM

On the use of words as source alphabet symbols in PPM

引用

Data compression Conference (DCC)

作者： J. Adiego P. de la Fuente Departmento de Informática Universidad de Valladolid Valladolid Spain

Summary form only given. We explore the use of words as the basic unit in PPM. Our goal has been carried out following two different ways: (1) we have added an additional previous layer to PPM that allows to replace words by two bytes codewords, and then these codewords will be codified with a conventional PPM; and (2) we have modified PPM so that it considers the words like symbols instead of characters, thus this PPM variation will make their predictions on consecutive words sequences handling words. Experimental results show that both techniques improve character-based compressors (including the PPM version used and adapted in the prototypes) for files of size greater than 1 Mb, due to the overload in storing the vocabulary. Prototype 1 accomplished compression in the same time but requiring slightly more memory (closest to PPMDi as the size grows) and it is about 5000% faster and it uses a 92% less of memory than PPMZ. Prototype 2 demanding much more time and memory and it is similar to the PPMZ, one of the better PPM variations

关键词： Prototypes compression algorithms Compressors Vocabulary HTML Data compression

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共207页 << < 192 193 194 195 196 197 198 199 200 201 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：