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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,075 篇 compression algo...
647 篇 image coding
492 篇 data compression
283 篇 encoding
219 篇 transform coding
218 篇 decoding
203 篇 algorithm design...
164 篇 dictionaries
155 篇 bandwidth
148 篇 video compressio...
142 篇 computer science
141 篇 hardware
130 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
108 篇 bit rate
100 篇 costs
99 篇 quantization
99 篇 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,048 篇 英文
14 篇 中文
13 篇 其他

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

共 2075 条记录，以下是621-630 订阅

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

详细简洁

排序：

2-3-4 Combination for Parallel compression on the K Computer

2-3-4 Combination for Parallel Compression on the K Computer

引用

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： Chongke Bi Kenji Ono RIKEN

The development of supercomputers has successfully helped us to carry on complicated simulation with exploded size of dataset. For visualizing such kind of large-scale dataset, reducing the data size by using compression methods is one of the most useful approach. Moreover, parallelization of compression algorithm can greatly improve the efficiency and resolve the limitation of memory size. However, in parallel compression algorithm, interprocessor communication is indispensable, while it is also a bottleneck problem, especially for the general cases that the number of processors is not power-of-two. Parallel POD (proper orthogonal decomposition) compression algorithm is such an example, the number of time steps must be power-of-two for the binary swap scheme. A method that can fully resolve this problem with low computational cost will be very popular. In this paper, we proposed such an approach called 2-3-4 combination approach, which can be simply implemented and also reach high performance of parallel computing algorithms. Furthermore, our method can obtain the best balance among all parallel computing processors. This is achieved by transferring the non-power-of-two problem into power-of-two problem to fully use the best balance feature of binary swap method. We evaluate our approach through applying it to the parallel POD compression algorithm on the K computer.

关键词： Program processors Computers Vectors compression algorithms Parallel processing Binary trees Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Test Patterns compression Technique Based on a Dedicated SAT-Based ATPG

Test Patterns Compression Technique Based on a Dedicated SAT...

引用

Euromicro Symposium on Digital System Design

作者： Jiří Balcárek Petr Fišer Jan Schmidt Faculty of Information Technology Czech Technical University in Prague Prague Prague Czech Republic

In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method is targeted to systems on chip (SoCs)provided with the P1500 test standard. The RESPIN architecture can be used for test patterns decompression. The main idea is based on finding the best overlap of test patterns during the test generation, unlike other methods, which are based on efficient overlapping of pre-generated test patterns. The proposed algorithm takes advantage of an implicit test representation as SAT problem instances. The results of test patterns compression obtained for standard ISCAS'85 and `89benchmark circuits are shown and compared with competitive test compression methods.

关键词： Circuit faults Benchmark testing Test pattern generators System-on-a-chip compression algorithms

来源：评论

学校读者我要写书评

暂无评论

LZ4r - A New Fast compression Algorithm for High-Speed Data Storage Systems

LZ4r - A New Fast Compression Algorithm for High-Speed Data ...

引用

Data compression Conference (DCC)

作者： Rui Chen Lihao Xu Mathworks Inc. Natick MA Wayne State University Detroit MI

LZ4 data compression algorithm is the current state-of-art compression algorithm in the high speed compression algorithm class, and has been adopted and integrated by lots modern high-speed data storage systems. We propose a fast lossless compression algorithm, named LZ4r. A new format of the data sequence is designed, and by integrating it into the proposed algorithm, a better compression ratio than LZ4 is achieved. Numerous evaluation tests are conducted with different sets of data corpus. The results consistently show that LZ4r gains a significant improvement in compression ratio than LZ4, with a similar high compression speed. Although LZ4r is slower than LZ4 in decompression speed, the decompression speed of LZ4r is still fast enough not to reduce the overall performance of the system. Thus, LZ4r can become a practical and competitive alternative or replacement of LZ4 in many high-speed data storage systems to improve the overall performance and lower the overall cost. More details about LZ4r algorithm design and performance evaluation can be found at [1].

关键词： Performance evaluation Costs Buffer storage Data compression compression algorithms

来源：评论

学校读者我要写书评

暂无评论

A compression Algorithm For The Hierarchical Subband Representations Of the image sequences

A Compression Algorithm For The Hierarchical Subband Represe...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： L. Margarit R.C. Zaciu Applied Electronics Department University of Politehnica Bucharest Romania

来源：评论

学校读者我要写书评

暂无评论

Map and Trie based compression Algorithm for Data Transmission

Map and Trie based Compression Algorithm for Data Transmissi...

引用

International Conference on Innovative Mechanisms for Industry Applications (ICIMIA)

作者： Suyash Ghuge National Institute of Technology Mangalore Karnataka India

ISBN: (数字)9781728141671

ISBN: (纸本)9781728141688

In-text compression algorithms, a set of symbols as alphabets are defined. These alphabets are the basic building blocks of the language. Traditionally 8-bit ASCII characters are chosen as alphabets. In this paper, an approach that chooses larger symbols as alphabets is proposed. For example, in the case of the English language, a set of words and special characters are chosen as alphabets. In the case of HTML documents, HTML tags are included along with alphabets from the English language described before. Better compression results can be achieved since words have larger byte size than individual ASCII characters but still get mapped to similar-sized encodings. Compressing the data to be transmitted across networks implies less usage of network bandwidth, faster transmission of data, sending several data files over a single transfer and faster reading and writing of data. Thus, the transmission of a compressed file is cost-effective and also saves time in communication. The results prove that the proposed approach gives better file size compression concerning the compression ratio when compared with state-of-the-art algorithms.

关键词： Data compression Dictionaries compression algorithms Bandwidth Channel coding Decoding

来源：评论

学校读者我要写书评

暂无评论

A Feature Oriented Framework and Enhanced Assessments for Imaging compression*

A Feature Oriented Framework and Enhanced Assessments for Im...

引用

International Image Processing, Applications and Systems Conference (IPAS)

作者： Jesse Redford Xingjie Li University of North Carolina Charlotte Charlotte NC USA

ISBN: (数字)9781728175744

ISBN: (纸本)9781728175751

This paper offers a new feature-oriented compression algorithm for flexible reduction of data redundancy commonly found in images and videos streams. Using a combination of image segmentation and face detection techniques as a preprocessing step, we derive a compression framework to adaptively treat `feature' and `ground' while balancing the total compression and quality of `feature' regions. We demonstrate the utility of a feature compliant compression algorithm (FC-SVD), a revised peak signal-to-noise ratio PSNR assessment, and a relative quality ratio to control artificial distortion. The goal of this investigation is to provide new contributions to image and video processing research via multi-scale resolution and the block-based adaptive singular value decomposition.

关键词： Image segmentation Image coding PSNR Training data Video compression compression algorithms Videos

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Biomedical signal compression with time- and subject-adaptive dictionary for wearable devices

Biomedical signal compression with time- and subject-adaptiv...

引用

IEEE Workshop on Machine Learning for Signal Processing

作者： Valentina Vadori Enrico Grisan Michele Rossi Dept. of Information Engineering University of Padova Italy

ISBN: (纸本)9781509007479

Wearable devices allow the seamless and inexpensive gathering of biomedical signals such as electrocardiograms (ECG), photoplethysmograms (PPG), and respiration traces (RESP). They are battery operated and resource constrained, and as such need dedicated algorithms to optimally manage energy and memory. In this work, we design SAM, a Subject-Adaptive (lossy) compression technique for physiological quasi-periodic signals. It achieves a substantial reduction in their data volume, allowing efficient storage and transmission, and thus helping extend the devices' battery life. SAM is based upon a subject-adaptive dictionary, which is learned and refined at runtime exploiting the time-adaptive self-organizing map (TASOM) unsupervised learning algorithm. Quantitative results show the superiority of our scheme against state-of-the-art techniques: compression ratios of up to 35-, 70- and 180-fold are generally achievable respectively for PPG, ECG and RESP signals, while reconstruction errors (RMSE) remain within 2% and 7% and the input signal morphology is preserved.

关键词： Dictionaries Neurons Indexes Training Runtime compression algorithms Quantization (signal)

来源：评论

学校读者我要写书评

暂无评论

compression algorithm for infrared hyperspectral sounder data

Compression algorithm for infrared hyperspectral sounder dat...

引用

Data compression Conference (DCC)

作者： I. Gladkova L. Roytman M. Goldberg City College of New York New York NY USA NESDIS National Oceanic and Atmospheric Administration Washington D.C. DC USA

Summary form only given. The research is undertaken by NOAA/NESDIS, for its GOES-R Earth observation satellite series, to be launched in the 2013 time frame, to enable greater distribution of its scientific data, both within the US and internationally. We have developed a new lossless algorithm for compression of the signals from NOAA's environmental satellites using current spacecraft to simulate data from the upcoming GOES-R instrument, and focusing on Aqua Spacecraft's AIRS (atmospheric infrared sounder) instrument in our case study. The AIRS is a high resolution instrument which measures infrared radiances at 2378 wavelengths ranging from 3.74-15.4 /spl mu/m. The AIRS takes 90 measurements as it scans 48.95 degrees perpendicular to the satellite's orbit every 2.667 seconds. We use Level 1A digital count data granules, which represent 6 minutes (or 135 scans) of measurements. Therefore, our data set consists of a 90/spl times/135/spl times/1502 cube of integers ranging from 12-14 bits. Our compression algorithm consists of the following steps: 1) channel partitioning; 2) adaptive clustering; 3) projection onto principal directions; 4) entropy coding of the residuals.

关键词： compression algorithms Hyperspectral imaging Instruments Extraterrestrial measurements Wavelength measurement Space vehicles Atmospheric measurements Artificial satellites Atmospheric modeling Atmospheric waves

来源：评论

学校读者我要写书评

暂无评论

Polynomial Based Representation for DNA Sequence compression and Search

Polynomial Based Representation for DNA Sequence Compression...

引用

IEEE Punecon

作者： Waqar Ahmad Khan Aftab Khan University of Engineering and Technology (UET) Peshawar Pakistan

ISBN: (数字)9781728196008

ISBN: (纸本)9781728196015

Data compression plays an important role in lesser expensive resource consumption. It is also cumbersome to send a huge amount of data through the network. The data compression techniques help in optimizing physical storage devices as well as it makes easy to transfer the compressed data or file faster through internet or network. Deoxyribonucleic acid or DNA is biological traits presents in human and almost all other living organisms. The DNA contains the genetic information of the living organisms. In this research, various compression algorithms for DNA sequences are studied and compared. The scheme proposed here for compression is the use of a burrows wheeler compression technique. Our proposed algorithm is the modification of the Burrows Wheeler compression Algorithm (BWCA). The lexicographical sorting of the matrix is replaced by the polynomial base representation of the bases of DNA. This method reduces the time for compression positively. Validation was performed on various datasets that concur the efficiency of the proposed scheme.

关键词： DNA Graphics processing units Matrices Organisms Mathematical model compression algorithms Sorting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 59 60 61 62 63 64 65 66 67 68 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：