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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An Optimization Method of WebP Images Lossy compression Algorithm for FPGAs

An Optimization Method of WebP Images Lossy Compression Algo...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yaqian Zhao Zhenhua Guo Baoyu Fan Kai Gao Li Wang Fang Cao Inspur Electronic Information Industry Co. Ltd. Jinan China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

To improve the efficiency of WebP images lossy compression algorithm for heterogeneous accelerating based on FPGAs in data center server, this paper proposed an optimization method of WebP image lossy compression algorithm for FPGAs. By adopting the optimization method of this paper, the overall throughput performance of WebP heterogeneous acceleration solution based on OpenCL language can be up to 281MPixel/s. The energy efficiency ratio is 2.29x higher than Intel Xeon E5-2690v3 processor. Compare with the industry-leading WebP heterogeneous acceleration solution of Xilinx and CTAccel, the throughput performance of this paper is 2.5x better than Xilinx and 1.8x better than CTAccel. Finally, this paper improves the utilization of RAM resources according to the characteristics of the RAM block in the FPGA.

关键词： Field programmable gate arrays compression algorithms Image coding Pipeline processing Quantization (signal) Acceleration Transforms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards a calibrated corpus for compression testing

Towards a calibrated corpus for compression testing

引用

Data compression Conference (DCC)

作者： M.R. Titchener P.M. Fenwick M.C. Chen Department of Computer Science University of Auckland Auckland New Zealand

Summary form only given. A mini-corpus of twelve 'calibrated' binary-data files have been produced for systematic evaluation of compression algorithms. These are generated within the framework of a deterministic theory of string complexity. Here the T-complexity of a string x (measured in taugs) is defined as C/sub T/(x/sub i/)=/spl Sigma//sub i/log/sub 2/(k/sub i/+1), where the positive integers k/sub i/ are the T-expansion parameters for the corresponding string production process. C/sub T/(x) is observed to be the logarithmic integral of the total information content I/sub x/ of x (measured in nats), i.e., C/sub T/(x)=li(I/sub x/). The average entropy is H~/sub x/=I/sub x//|x|, i.e., the total information content divided by the length of x. Thus C/sub T/(x)=li(H~/sub x//spl times/|x|). Alternatively, the information rate along a string may be described by an entropy function H/sub x/(n),0/spl les/n/spl les/|x| for the string. Assuming that H/sub x/(n) is continuously integrable along the length of the x, then I/sub x/=/spl int//sub 0//sup |/x|H/sub x/(n)/spl delta/n. Thus C/sub T/(x)=li(/spl int//sub 0//sup |/x|H/sub x/(n)/spl delta/n). Solving for H/sub x/(n): that is differentiating both sides and rearranging, we get: H/sub x/(n)=(/spl delta/C/sub T/(x|n)//spl delta/n)/spl times/log/sub e/(li/sup -1/(C/sub T/(x|/sub n/))). With x being in fact discrete, and the T-complexity function being computed in terms of the discrete T-augmentation steps, we may accordingly re-express the equation in terms of the T-prefix increments: /spl delta/n/spl ap//spl Delta//sub i/|x|=k/sub i/|p/sub i/|; and from the definition of C/sub T/(x): /spl delta/C/sub T/(x) is replaced by /spl Delta//sub i/C/sub T/(x)=log/sub 2/(k/sub i/+1). The average slope over the i-th T-prefix p/sub i/ increment is then simply (/spl Delta//sub i/C/sub T/(x))/(/spl Delta//sub i/|x|)=(log/sub 2/(k/sub i/+1))/(k/sub i/|p/sub i/|). The entropy function is now replaced by a discrete approximation.

关键词： Testing Entropy Tin Compressors Computer science compression algorithms Production Network address translation Information rates Logic

来源：评论

学校读者我要写书评

暂无评论

A cycle compression algorithm for CRMA high-speed networks

A cycle compression algorithm for CRMA high-speed networks

引用

IEEE International Conference on Communications (ICC)

作者： N.-F. Huang C.-S. Chang G.-K. Ma Department of Computer Science National Tsing Hua University Hsinchu Taiwan Advanced Technology Center Computer and Communications Research Laboratories Hsinchu Taiwan

Cyclic-reservation multiple-access (CRMA) is an access scheme for high-speed local and metropolitan area networks based on a dual-bus configuration. In CRMA, the headend generates the reserve commands periodically. It is proved that the problem of finding a shortest cycle for a CRMA reservation (called a cycle compression problem) is NP-complete by showing that it is equivalent to the interval coloring problem. An O(n/sup 2/) approximation algorithm is proposed to solve this problem, where n is the number of stations in the network.< >

关键词： compression algorithms High-speed networks Computer science Metropolitan area networks Mice Delay Approximation algorithms Local area networks

来源：评论

学校读者我要写书评

暂无评论

Content-Aware Partial compression for Big Textual Data Analysis Acceleration

Content-Aware Partial Compression for Big Textual Data Analy...

引用

IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Dapeng Dong John Herbert Mobile and Internet Systems Laboratory and Insight Centre for Data Analytic National University of Ireland Cork Cork Ireland

Analysing text-based data has become increasingly important due to the importance of text from sources such as social media, web contents, web searches. The growing volume of such data creates challenges for data analysis including efficient and scalable algorithm, effective computing platforms and energy efficiency. compression is a standard method for reducing data size but current standard compression algorithms are destructive to the organisation of data contents. This work introduces Content-aware, Partial compression (CaPC) for text using a dictionary-based approach. We simply use shorter codes to replace strings while maintaining the original data format and structure, so that the compressed contents can be directly consumed by analytic platforms. We evaluate our approach with a set of real-world datasets and several classical MapReduce jobs on Hadoop. We also provide a supplementary utility library for Hadoop, hence, existing MapReduce programs can be used directly on the compressed datasets with little or no modification. In evaluation, we demonstrate that CaPC works well with a wide variety of data analysis scenarios, experimental results show ~30% average data size reduction, and up to ~32% performance increase on some I/O intensive jobs on an in-house Hadoop cluster. While the gains may seem modest, the point is that these gains are 'for free' and act as supplementary to all other optimizations.

关键词： Dictionaries Data analysis compression algorithms Motion pictures Encoding Libraries Internet

来源：评论

学校读者我要写书评

暂无评论

A Reference Frame compression Scheme via AVS Perceptual Lossless compression in Video Coding

A Reference Frame Compression Scheme via AVS Perceptual Loss...

引用

Ubiquitous Communication (Ucom), International Conference on

作者： Meng Wu Huanbang Chen Fuzheng Yang Haitao Yang Junkai Feng Multimedia Communication Lab Xidian University Xi'an China HiSilicon Shenzhen China

ISBN: (数字)9798350374216

ISBN: (纸本)9798350374223

Video coding systems have enormous external memory bandwidth requirements, especially for ultra-high-definition (UHD) applications. However, due to cost and power constraints, the available bandwidth in video devices is limited. Consequently, reducing the required memory bandwidth is of paramount importance. In this paper, a lossy reference frame compression scheme is proposed to address this challenge. It includes two core technologies: 1) an address table storage scheme for random accessibility and 2) low complexity AVS Perceptual Lossless compression (PLC) compression algorithm. Under fixed compression ratios of 2:1 and 1.5:1, the proposed scheme achieves a $64 \times 4$ block-level random access. Rigorous subjective and objective quality assessments verify the feasibility of the proposed solution. Experimental results demonstrate that the BD-Rate of luma is 0.81% and 0.2% for the 2:1 and 1.5:1 compression ratios, respectively, indicating a negligible impact on compression efficiency. This significant reduction in memory bandwidth requirements is achieved while preserving the video quality.

关键词： Video coding Costs Multimedia systems Memory management Bandwidth Streaming media Quality assessment Complexity theory compression algorithms Video recording

来源：评论

学校读者我要写书评

暂无评论

A character elimination algorithm for lossless data compression

A character elimination algorithm for lossless data compress...

引用

Data compression Conference (DCC)

作者： M. Hosang

Summary form only given. We present a detailed description of a lossless compression algorithm intended for use on files with non-uniform character distributions. This algorithm takes advantage of the relatively small distances between character occurrences once we remove the less frequent characters. This allows it to create a compressed version of the file that, when decompressed, is an exact copy of the file that was compressed. We begin by performing a Burrows-Wheeler (1994) Transform (BWT) on the file. The algorithm scans this BWT file to create a character frequency model for the compression phase. To deal with the issue of bit encoding, we write every number as a byte or sequence of bytes to the compressed file and run an arithmetic encoder after the file has been compiled.

关键词： Data compression Encoding Arithmetic compression algorithms Frequency Writing Decoding

来源：评论

学校读者我要写书评

暂无评论

An Experiment Study on Text Transformation for compression Using Stoplists and Frequent Words

An Experiment Study on Text Transformation for Compression U...

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Jirapond Tadrat Veera Boonjing Software Systems Engineering LaboratoryDepartment of Mathematics and Computer Science Science King Mongkut's Institute of Technology Ladkrabang Thailand

The paper presents a new text transform algorithm suitable for embedding in compression algorithms. The strategy the new algorithm employed to increase performance of text compression is to replace words with predefined codes. Instead of using a huge dictionary containing exhaustive words as in previous works, the new algorithm uses a list of stoplists and/or frequent words. The research devised different encoding schemes for such a list. It then made experiments of using these schemes with different compression algorithms on standard texts. The result shows that each scheme gives increasing compression when using with specific compression algorithms.

关键词： Dictionaries Encoding compression algorithms Natural languages Information technology Software systems Systems engineering and theory Laboratories Mathematics Computer science

来源：评论

学校读者我要写书评

暂无评论

Online compression of ASCII files

Online compression of ASCII files

引用

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

作者： J. Istle P. Mandelbaum E. Regentova Department of Electrical and Computer Engineering University of Nevada Las Vegas Las Vegas NV USA

The paper discusses a technique for on-line compression of ASCII files. There is a need for fast compression technique that can also produce no overhead data, and with a set amount of memory. Current text compression methods are possibly far superior with some of the characteristics, but none meet all of these needs. The proposed compression scheme uses multiple static dictionaries and a pre-generated variable length code. The method compresses text files of various sizes to approximately 60 percent of their original size.

关键词： Dictionaries Frequency compression algorithms Table lookup Information technology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：