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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

546 篇 工学
- 276 篇 计算机科学与技术...
- 263 篇 电气工程
- 131 篇 信息与通信工程
- 84 篇 软件工程
- 41 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 29 篇 仪器科学与技术
- 23 篇 生物医学工程（可授...
- 15 篇 机械工程
- 12 篇 测绘科学与技术
- 8 篇 网络空间安全
- 7 篇 生物工程
- 6 篇 航空宇航科学与技...
- 5 篇 交通运输工程
- 4 篇 光学工程
- 3 篇 土木工程
68 篇 理学
- 22 篇 数学
- 19 篇 系统科学
- 11 篇 物理学
- 9 篇 地球物理学
- 7 篇 生物学
- 2 篇 化学
- 2 篇 天文学
- 2 篇 地理学
60 篇 医学
- 50 篇 临床医学
- 9 篇 基础医学(可授医学...
- 5 篇 特种医学
36 篇 管理学
- 35 篇 管理科学与工程(可...
12 篇 文学
- 12 篇 新闻传播学
5 篇 农学
- 4 篇 作物学
2 篇 军事学
2 篇 艺术学
1 篇 经济学

主题

2,080 篇 compression algo...
647 篇 image coding
493 篇 data compression
284 篇 encoding
219 篇 transform coding
218 篇 decoding
203 篇 algorithm design...
164 篇 dictionaries
155 篇 bandwidth
147 篇 video compressio...
142 篇 computer science
141 篇 hardware
131 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
108 篇 bit rate
99 篇 costs
99 篇 quantization
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,054 篇 英文
14 篇 中文
12 篇 其他

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

共 2080 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

Proposed Texture compression Algorithm Based on Fractal Wavelet Theory

Proposed Texture Compression Algorithm Based on Fractal Wave...

引用

International Conference on Computational Intelligence and Multimedia Applications

作者： B. Sankaragomathi L. Ganesan S. Arumugam EIE National Engineering College Kovilpatti Tamil Nadu India CSE Department Alagappa Chettiar College of Engineering and Technology Karaikudi India Research AKCE Tamil Nadu India

ISBN: (纸本)9780769530505;0769530508

The proposed texture compression algorithm is based on a block-wise approach, where each block is subjected to the modified fractal compression method and is partly represented by Haar wavelet or Laplacian pyramid. In our new method, the advantage of the local fractal compression algorithm is taken for 4*4 blocks compressed independently. To overcome the problem of quad tree structure, we use regular partitioning of compressed block to 2*2 range blocks R. The local domain pool for compressed block consists of only one domain block being the whole compressed block D = B. The resulting fractal code is subjected to further compression using Haar wavelet or Laplacian Pyramid.

关键词： compression algorithms Fractals Image coding Laplace equations Surface reconstruction Surface texture Educational institutions Image storage Vector quantization Hardware

来源：评论

学校读者我要写书评

暂无评论

Parallel Lossless Data compression Based on the Burrows-Wheeler Transform

Parallel Lossless Data Compression Based on the Burrows-Whee...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Jeff Gilchrist Aysegul Cuhadar Department Systems & Computer Engineering Carleton University Canada

In this paper, we present parallel algorithms for lossless data compression based on the Burrows-Wheeler transform (BWT) block-sorting technique. We investigate the performance of using data parallelism and task parallelism for both multi-threaded and message-passing programming. The output produced by the parallel algorithms is fully compatible with their sequential counterparts. To balance the workload among processors we develop a task scheduling strategy. An extensive set of experiments is performed with a shared memory NUMA system using up to 120 processors and on a distributed memory cluster using up to 100 processors. Our experimental results show that significant speedup can be achieved with both data parallel and task parallel methodologies. These algorithms will greatly reduce the amount of time it takes to compress large amounts of data while the compressed data remains in a form that users without access to multiple processor systems can still use.

关键词： Data compression Clustering algorithms Sorting Image coding compression algorithms Image reconstruction Parallel algorithms Parallel processing System testing Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of FPGA-based Systolic Array for LZ Data compression

Design and Implementation of FPGA-based Systolic Array for L...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Mohamed A. Abd El ghany Aly E. Salama Ahmed H. Khalil Electronics Department German University in Cairo Cairo Egypt Electronics and Communication Department Cairo University Cairo Egypt

Hardware implementation of data compression algorithms is receiving increasing attention due to exponentially expanding network traffic and digital data storage usage. Among lossless data compression algorithms for hardware implementation, Lempel-Ziv algorithm is one of the most widely used. The main objective of this paper is to enhance the efficiency of systolic-array approach for implementation of Lempel-Ziv algorithm. The proposed implementation is area and speed efficient. The compression rate is increased by more than 40% and the design area is decreased by more than 30%. The effect of the selected buffer's size on the compression ratio is analyzed. An FPGA implementation of the proposed design is carried out. It verifies that data can be compressed and decompressed on-the-fly.

关键词： Systolic arrays Data compression Hardware compression algorithms Computer aided manufacturing CADCAM Field programmable gate arrays Computer architecture Dictionaries Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A Reconfigurable Broadcast Scan compression Scheme Using Relaxation Based Test Vector Decompos

A Reconfigurable Broadcast Scan Compression Scheme Using Rel...

引用

Asian Test Symposium (ATS)

作者： Aiman H. El-Maleh Mustafa Imran Ali Ahmad A. Al-Yamani King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

An effective reconfigurable broadcast scan compression scheme that employs test set partitioning and relaxation-based test vector decomposition is proposed. Given a constraint on the number of tester channels, the technique classifies the test set into acceptable and bottleneck vectors. The bottleneck vectors are then decomposed into a set of vectors that meet the given constraint. The acceptable and decomposed test vectors are partitioned into the smallest number of partitions while satisfying the tester channels constraint to reduce the decompressor area. Thus, the technique by construction satisfies a given tester channels constraint at the expense of increased test vector count and number of partitions, offering a tradeoff between test compression, test application time and test decompression circuitry area. Experimental results demonstrate that the proposed technique achieves better compression ratios compared to other test compression techniques.

关键词： Broadcasting Circuit testing Fault detection Automatic test pattern generation Decoding Petroleum Minerals DH-HEMTs compression algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Simple Statistical Algorithm for Biological Sequence compression

A Simple Statistical Algorithm for Biological Sequence Compr...

引用

Data compression Conference (DCC)

作者： Minh Duc Cao Trevor I. Dix Lloyd Allison Chris Mears Faculty of Information Technology Monash University Australia

This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is maintained to estimate the probability distribution of the next symbol in the sequence to be encoded. Expert probabilities are combined to obtain the final distribution. The resulting information sequence provides insight for further study of the biological sequence. Each symbol is then encoded by arithmetic coding. Experiments show that our algorithm outperforms existing compressors on typical DNA and protein sequence datasets while maintaining a practical running time

关键词： Sequences DNA compression algorithms Biological information theory Compressors Biological system modeling Genomics Bioinformatics Probability distribution Organisms

来源：评论

学校读者我要写书评

暂无评论

compression as Data Transformation

Compression as Data Transformation

引用

Data compression Conference (DCC)

作者： Kiem-Phong Vo Shannon Laboratory AT and T Laboratories Florham Park NJ USA

Summary form only given. Conventional compression techniques exploit general redundancy features in data to compress them. For example, Huffman or Lempel-Ziv techniques compresses data by statistical modeling or string matching while the Burrows-Wheeler Transform simply sorts data by context to improve compressibility. On the other hand, data can often be compressed better by exploiting their specific features. For example, columns or fields in a database table tend to be sparse, but not rows. Techniques have been developed to either group related table columns or compute dependency among them to transform data and enhance compressibility. The Vcodex data transformation platform provides a framework to develop and use such data transforms. That is, it treats compression techniques as invertible data transforms that can be composed together for specific tasks. In this way, data transformation remains general and can include techniques for encryption and others.

关键词： Context modeling Spatial databases Data processing compression algorithms Cryptography Standardization Hardware Software standards Application software Stability

来源：评论

学校读者我要写书评

暂无评论

A Nonlinear Contour Preserving Transform for Geometrical Image compression

A Nonlinear Contour Preserving Transform for Geometrical Ima...

引用

International Machine Vision and Image Processing Conference (IMVIP)

作者： W. Van Aerschot M. Jansen A. Bultheel Computer Science Dept. K. U. Leuven Heverlee Belgium

Recently the performance of nonlinear transforms have been given a lot of attention to overcome the suboptimal n- terms approximation power of tensor product wavelet methods on higher dimensions. The suboptimal performance prevails when those transforms are used for a sparse representation of functions consisting of smoothly varying areas separated by smooth contours. This paper introduces a method creating normal meshes with nonsubdivision connectivity to approximate the nonsmoothness of such images efficiently. From a domain decomposition viewpoint, the method is a triangulation refinement method preserving contours. The so-called normal offset decomposition searches from the midpoint of the edges in the previous approximation along the normal direction until it pierces the surface that represents the image and adds the piercing points to the approximation. The transform is nonlinear as it depends on the actual image. In this paper, we propose a normal offset based compression algorithm for digital images. The discrete setting causes the transform to become redundant. We also propose a model to encode the obtained coefficients. We show rate distortion curves and compare the results with the JPEG2000 encoder.

关键词： Image coding Wavelet transforms Discrete transforms Computer science Rate-distortion Machine vision Image processing Tensile stress compression algorithms Digital images

来源：评论

学校读者我要写书评

暂无评论

Instruction Trace compression for Rapid Instruction Cache Simulation

Instruction Trace Compression for Rapid Instruction Cache Si...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Andhi Janapsatya Aleksandar Ignjatovic Sri Parameswaran Joerg Henkel Computer Science and Engineering The University of New South Wales Sydney NSW Australia School of CSE and NICTA University of New South Wales Sydney NSW Australia Dept. of Computer Science Karlsruhe University Karlsruhe Germany

ISBN: (纸本)9783981080124

Modern application specific instruction set processors (ASIPs) have customizable caches, where the size, associativity and line size can all be customized to suit a particular application. To find the best cache size suited for a particular embedded system, the applications) is/are executed, traces obtained, and caches simulated. Typically, program trace files can range from a few megabytes to several gigabytes. Simulation of cache performance using large program trace files is a time consuming process. In this paper, a novel instruction cache simulation methodology that can operate directly on a compressed program trace file without the need for decompression is presented. This feature allowed our simulation methodology to have an average speed up of 9.67 times compared to the existing state of the art tool (Dinero IV cache simulator), for a range of applications from the Mediabench suite

关键词： Process design Application specific processors Embedded system Performance analysis compression algorithms Computer science Australia Application software Energy consumption Cache memory

来源：评论

学校读者我要写书评

暂无评论

An Efficient Data compression Algorithm for Semantic-Based Ubiquitous Computing Applications

An Efficient Data Compression Algorithm for Semantic-Based U...

引用

International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM)

作者： Michele Ruta Tommaso Di Noia Eugenio Di Sciascio Floriano Scioscia Politecnico di Bari Bari Italy

We present an efficient compression algorithm specifically devised and implemented to reduce size of document instances expressed in various ontological languages, and specifically targeted at DIG 1.1 syntax. Motivation derives from a widespread exploitation of Knowledge Representation formalisms in innovative ubiquitous computing contexts. In carried out tests, the compressor we present showed better compression rates than currently available general-purpose XML compression tools.

关键词： Data compression Ubiquitous computing Wireless sensor networks XML Radiofrequency identification Mobile computing Mobile communication Bandwidth compression algorithms Context

来源：评论

学校读者我要写书评

暂无评论

Tree Partitioning compression of Piecewise Polynomial Functions

Tree Partitioning Compression of Piecewise Polynomial Functi...

引用

Asilomar Conference on Signals, Systems & Computers

作者： Arian Maleki Morteza Shahram Department of Electrical Engineering University of Stanford USA

In this paper compression of piecewise polynomial functions is considered. The importance of this class of functions is due to the fact that most of the signals observed in the nature are piecewise smooth and piecewise polynomials provide an efficient model for representing piecewise smooth signals. We compute the e-entropy of the class of piecewise polynomials and show that the rate-distortion behavior of the traditional compression algorithms is far from optimum. Then we will discuss the binary partitioning algorithm, and will demonstrate that with a simple modification of this algorithm, it is possible to get close to the optimal performance. Moreover, this modification will retain all the advantages of the binary tree algorithms such as simplicity, automatic parameter selection and extension to higher dimensions.

关键词： Polynomials Partitioning algorithms Rate-distortion Binary trees Image coding Dynamic programming Statistics compression algorithms Bit rate Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：