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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1941-1950 订阅

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

详细简洁

排序：

Distortion Characterization of Compressed Hyperspectral Imagery through Band Add-On Modified Spectral Angle Mapper Distance Metrics

Distortion Characterization of Compressed Hyperspectral Imag...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： C. Lastri B. Aiazzi S. Baronti L. Alparone CNR Area della Ricerca di Firenze IFAC-CNR: Institute Applied Physics Nello Carrara Sesto Fiorentino Italy Department Electronics & Telecommunications University of Florence Florence Italy

来源：评论

学校读者我要写书评

暂无评论

Compressed Cache Layout Aware Prefetching

Compressed Cache Layout Aware Prefetching

引用

International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Niloofar Charmchi Caroline Collange André Seznec Inria IRISA

The speed gap between CPU and memory is impairing performance. Cache compression and hardware prefetching are two techniques that could confront this bottleneck by decreasing last level cache misses. However, compression and prefetching have positive interactions, as prefetching benefits from higher cache capacity and compression increases the effective cache size. This paper proposes Compressed cache Layout Aware Prefetching (CLAP) to leverage the recently proposed sector-based compressed cache layouts such as SCC or YACC to create a synergy between compressed cache and prefetching. The idea of this approach is to prefetch contiguous blocks that can be compressed and co-allocated together with the requested block on a miss access. Prefetched blocks that share storage with existing blocks do not need to evict a valid existing entry; therefore, CLAP avoids cache pollution. In order to decide the co-allocatable blocks to prefetch, we propose a compression predictor. Based on our experimental evaluations, CLAP reduces the number of cache misses by 12% and improves performance by 4% on average, comparing to a compressed cache.

关键词： Prefetching Layout Hardware Compaction Pollution Benchmark testing compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Compressed by the suffix tree

Compressed by the suffix tree

引用

Data compression Conference (DCC)

作者： M. Senft Charles University Praque Czech Republic

A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising inefficiency. The match they are searching for from the root down the suffix tree can be obtained for free from the suffix tree construction algorithm! This observation suggests that the output of this compression method is in a way just a description of the suffix tree construction for the input string. If taken one step further this leads to the idea that there exists a whole family of compression methods replacing the input string with a description of the suffix tree construction for this string. This family contains some (multi-)dictionary methods not dissimilar to those of Bloom or Hoang ***., as well as some prediction by partial matching variants. We give the general description of this family along with details about some of its members, discuss implementation issues and show some early experimental results. A possible application to other suffix structures like the compact directed acyclic word graph is also outlined.

关键词： Dictionaries Tree graphs Tree data structures Data compression Sorting Mathematics Physics Inspection Algorithm design and analysis compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Variable step search algorithm for motion estimation

Variable step search algorithm for motion estimation

引用

IEEE International Symposium on Information Theory

作者： Z.Q. Cai V.N. Tran Department of Communication & Electronic Engineering Royal Melbourne Institute of Technology Melbourne Australia

Motion estimation (ME) is a key technique in interframe coding. It is the basis of most compression algorithms for video compression, such as the CCITT standard H. 261, and MPEG 2. The performance of ME is decided by two factors: (1) the estimation exactitude; and (2) the computational load. The full search algorithm is the optimal one for the first factor, but it requires extensive computations. To reduce the computational complexity, many efficient search algorithms have been proposed. The one step at a time search (OSATS) is the second most efficient algorithm, but it becomes inefficient when the search window is greater than 4 pels/frame. The aim of this paper is to overcome this disadvantage.

关键词： Motion estimation Variable structure systems Australia compression algorithms Video compression Computational complexity Computational modeling Video coding Measurement standards Displacement measurement

来源：评论

学校读者我要写书评

暂无评论

Adaptive segmentation of DNA sequences using SBC Technique: A novel Algorithm

Adaptive segmentation of DNA sequences using SBC Technique: ...

引用

International Conference on Computing and Networking Technology (ICCNT)

作者： V. Hari prasad P.V. Kumar D. Vasumathi Jawaharlal Nehru Technological Jawaharlal Nehru Technological University Andhra Pradesh India Osmania University Hyderabad Andhra Pradesh India Department of CSE JNTU CEH Hyderabad Andhra Pradesh India

ISBN: (纸本)9781467356930

Availability of more and more DNA sequences in the biological databases their size is exponentially growing and it is very hard to maintain and process such data in intra and internetworking systems. Hence need of compression is playing a predominant role in the real vogue. In this connection many algorithms are arrived but some of them achieved bountiful and others are not due to specificity of text encoded in a DNA. Performance analysis is developed based on repetitive and non repetitive sequences of bases in DNA. Existing algorithms may run in Best case if the sequence may contains tandem repeats and compression ratios are computed in terms of bits per bases. Our proposed SBC (splinter Binary compression) technique is developed based on the comparative study of existing techniques and it achieves one of best compression ratios in an average of 1.142 bits/bases which is on par existing techniques. In addition to if we can apply of our technique on both repetitive and non repetitive sequences of genomes also it may give same compression rate in an average in all the cases Definitely our one will become one of the lossless in valuable technique in bio informatics era.

关键词： DNA Genomics Bioinformatics Image coding Educational institutions Biological information theory compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Segment-Parallel Predictor for FPGA-Based Hardware Compressor and Decompressor of Floating-Point Data Streams to Enhance Memory I/O Bandwidth

Segment-Parallel Predictor for FPGA-Based Hardware Compresso...

引用

Data compression Conference (DCC)

作者： Kentaro Sano Kazuya Katahira Satoru Yamamoto Graduate School of Information Sciences University of Tohoku Sendai Japan

ISBN: (纸本)9781424464258;9780769539942

This paper presents segment-parallel prediction for high-throughput compression and decompression of floating-point data streams on an FPGA-based LBM accelerator. In order to enhance the actual memory I/O bandwidth of the accelerator, we focus on the prediction-based compression of floating-point data streams. Although hardware implementation is essential to high-throughput compression, the feedback loop in the decompressor is a bottleneck due to sequential predictions necessary for bit reconstruction. We introduce a segment-parallel approach to the 1D polynomial predictor to achieve the required throughput for decompression. We evaluate the compression ratio of the segment-parallel cubic prediction with various encoders of prediction difference.

关键词： Hardware Bandwidth Arithmetic Field programmable gate arrays Throughput Computational fluid dynamics Concurrent computing Parallel processing compression algorithms Feedback loop

来源：评论

学校读者我要写书评

暂无评论

An improved T-decomposition algorithm

An improved T-decomposition algorithm

引用

International Conference on Information, Communications and Signal Processing

作者： Jia Yang U. Speidel Department of Computer Science University of Auckland New Zealand

ISBN: (纸本)0780381858

The bijective relationship between T-Code sets and finite strings discovered by Nicolescu and Titchener is of interest not only in coding, but also in information measurement and lately in content-based retrieval. Their T-decomposition algorithm that accomplishes the mapping from the string to the T-code set was implemented in 1996 by Wackrow and Titchener. This paper introduces a new algorithm that permits faster T-decomposition. Initial experimental results are also given.

关键词： Decoding Content based retrieval Entropy Computer science Information retrieval compression algorithms Area measurement Particle measurements Search engines Counting circuits

来源：评论

学校读者我要写书评

暂无评论

On Power and Performance Tradeoff of L2 Cache compression

On Power and Performance Tradeoff of L2 Cache Compression

引用

IEEE Asia Pacific Conference on Circuits and Systems

作者： Chandrika Jena Tim Mason Tom Chen Dept. of ECE Colorado State University

ISBN: (纸本)9781424474547

This paper presents the power-performance trade off of three different cache compression algorithms. Cache compression improves performance, since the compressed data increases the effective cache capacity by reducing the cache misses. The unused memory cells can be put into sleep mode to save static power. The increased performance and saved power due to cache compression must be more than the delay and power consumption added due to CODEC (Compressor and Decompressor) block respectively. Among the studied algorithms, powerdelay characteristic of Frequent Pattern compression (FPC) is found to be the most suitable for cache compression.

关键词： Delay Codecs Decoding Encoding Transistors compression algorithms Shift registers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Real-time posture and activity recognition

Real-time posture and activity recognition

引用

Workshop on Motion and Video Computing

作者： L.B. Ozer W. Wolf Department of Electrical Engineering Princeton University Princeton NJ USA

We propose an algorithm for human posture and activity recognition for uncompressed and compressed (MPEG) video inputs. A real-time compression domain technique is developed to recognize different postures such as standing, pointing left/right, opening arms, etc. by using an eigenspace representation of human silhouettes obtained from AC-DCT coefficients. The system stores frames with specific postures and finds the global activity of the human body in the compressed domain. In the uncompressed domain, this information is used as an input for the activity/gesture recognition algorithm. The first part of our approach is invariant to changes in intensity, color and textures and has the advantage of using the available data in the standard compression algorithms. The second part of the system can recognize activities in a set of frames starting with a recognized posture that is classified as a reference movement by the system. A prototype system has been developed with two camera nodes; each consists of a standard camera and a video processing board.

关键词： Surveillance Video compression Humans Cameras Transform coding Remote monitoring Image coding Real time systems compression algorithms Video recording

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：