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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

543 篇 工学
- 273 篇 计算机科学与技术...
- 263 篇 电气工程
- 130 篇 信息与通信工程
- 85 篇 软件工程
- 39 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 28 篇 仪器科学与技术
- 25 篇 生物医学工程（可授...
- 15 篇 机械工程
- 13 篇 测绘科学与技术
- 8 篇 网络空间安全
- 7 篇 生物工程
- 5 篇 航空宇航科学与技...
- 4 篇 交通运输工程
- 3 篇 光学工程
- 2 篇 建筑学
65 篇 理学
- 20 篇 数学
- 19 篇 系统科学
- 10 篇 物理学
- 10 篇 地球物理学
- 6 篇 生物学
- 2 篇 天文学
- 2 篇 地理学
- 2 篇 海洋科学
61 篇 医学
- 50 篇 临床医学
- 10 篇 基础医学(可授医学...
- 5 篇 特种医学
36 篇 管理学
- 35 篇 管理科学与工程(可...
12 篇 文学
- 12 篇 新闻传播学
5 篇 农学
- 4 篇 作物学
2 篇 军事学
2 篇 艺术学
1 篇 经济学

主题

2,071 篇 compression algo...
647 篇 image coding
488 篇 data compression
282 篇 encoding
222 篇 transform coding
220 篇 decoding
203 篇 algorithm design...
164 篇 dictionaries
155 篇 bandwidth
149 篇 video compressio...
142 篇 computer science
141 篇 hardware
131 篇 testing
119 篇 entropy
113 篇 wavelet transfor...
108 篇 bit rate
101 篇 quantization
100 篇 discrete cosine ...
99 篇 costs
97 篇 image reconstruc...

机构

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 篇 英文
15 篇 其他
14 篇 中文

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

共 2071 条记录，以下是41-50 订阅

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

详细简洁

排序：

Performance of lossless compression algorithms on voiceband data

Performance of lossless compression algorithms on voiceband ...

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： K.W. Ng A.J. Pollard L.R. Dacombe R.D. McLeod H.C. Card University of Manitoba Winnipeg MAN Canada Telecommunications Research Laboratory Winnipeg MAN Canada

Today's public switched telephone networks are being upgraded to use digital transmission and switching. The main disadvantage of digital transmission is the higher bandwidth required. To alleviate this problem, much research has been devoted into the compression of digitized voice signals. However, such compression techniques tend to have adverse effects on non-voice signals such as modems and faxes. This paper covers the performance of standard lossless compression algorithms on voiceband data signals.

关键词： Performance loss compression algorithms Modems Telephony Bandwidth Telecommunication switching Pulse modulation Phase change materials Testing ISDN

来源：评论

学校读者我要写书评

暂无评论

Group-Scheme: SIMD-based compression algorithms for web text data

Group-Scheme: SIMD-based compression algorithms for web text...

引用

IEEE International Conference on Big Data

作者： Xudong Zhang Wayne Xin Zhao Dongdong Shan Hongfei Yan Department of Computer Science and Technology Peking University Beijing China

compression algorithms have been quite important for data oriented tasks, especially in the era of Big Data. The rapid development of modern processors facilitates us with powerful SIMD instruction sets, which provides an opportunity for better performance. Although SIMD based optimization on compression have been explored in some studies [2, 7], these studies usually focus on modifying the existing algorithms to fit into the SIMD instruction. In this paper, we propose a compression framework with a novel storage layout format, which aims to improve instruction-level parallelizability of compression algorithms. By instantiating the framework, we design a novel compression algorithm family, called Group-Scheme, and present a parallelized version of Group-Scheme, called SIMD-Group-Scheme. We evaluate the proposed algorithms on two public TREC data sets. With very competitive performance on compression ratio and encoding speed, SIMD-Group-Scheme significantly outperforms the implementation without SIMD instructions and state-of-the-art algorithm (i.e. SIMD-G8IU [7]), w.r.t decoding speed.

关键词： Encoding Decoding Layout compression algorithms Arrays Indexes Program processors

来源：评论

学校读者我要写书评

暂无评论

A General Analytical Model for Spatial and Temporal Performance of Bitmap Index compression algorithms in Big Data

A General Analytical Model for Spatial and Temporal Performa...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Yinjun Wu Zhen Chen Yuhao Wen Junwei Cao Wenxun Zheng Ge Ma Research Institute of Information Technology Information Science and Technologies (TNList) Beijing China

Bitmap indexing is flexible to conduct boolean operations in data retrieval. Besides, the query processing based on bitmap indexing is also very fast. Therefore it has been widely used in various big data analytics platforms, such as Druid and Spark etc. However, bitmap index can consume a large amount of memory, which leads to the invention of different kinds of bitmap index compression algorithms without sacrificing temporal performance. In practice, we are often discommoded by choosing a proper algorithm when handling specific problems. Besides, after devising a new algorithm that may outperform existing ones, it is essential to evaluate its performance in theory. Without appropriate theoretical analysis, the deficit of a new algorithm can only be spotted until final experimental results are drawn, thus wasting much time and effort. In this paper, we propose a general analytical model to analyze both the spatial and temporal performance for bitmap index compression algorithms, which can be applied to analyze all kinds of algorithms derived from WAH (word-aligned hybrid). In this model, two types of distributed bitmaps, uniformly distributed bitmaps and clustered bitmaps, are used separately. In order to illustrate this model, several bitmap index compression algorithms are analyzed and compared with each other. algorithms herein are COMBAT (COMbining Binary And Ternary encoding), SECOMPAX (Scope Extended COMPAX) and CONCISE (Compressed 'n' Composable Integer Set), which are all derived from WAH. Evaluation results by MATLAB simulation about these algorithms are also presented. This paper paves the way for further researches on the performance evaluation of various bitmap index compression algorithms in the future.

关键词： Indexes Probability Mathematical model compression algorithms Encoding Analytical models Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Analysis of structured excitation codebooks used in CELP speech compression algorithms

Analysis of structured excitation codebooks used in CELP spe...

引用

Asilomar Conference on Signals, Systems & Computers

作者： W.R. Gardner LSI Logic Wireless Design Center Carlsbad CA USA

This paper presents an analysis of different suboptimal codebook excitation schemes used in code-excited linear prediction (CELP) speech compression algorithms. The problem of low rate, shape-gain vector quantization is formulated. Analyses of pulse codebooks, circularly recursive codebooks, algebraic codebooks, and vector sum codebooks are presented.

关键词： Speech analysis Algorithm design and analysis compression algorithms Vector quantization Testing Energy measurement Noise measurement Signal to noise ratio Large scale integration Logic design

来源：评论

学校读者我要写书评

暂无评论

Rate distortion performance of VQ and PVQ compression algorithms

Rate distortion performance of VQ and PVQ compression algori...

引用

Data compression Conference (DCC)

作者： K.M. Liang S.E. Budge R.W. Harris Electrical Engineering Department Utah State University Logan UT USA

Summary form only given. This paper investigates the performance for memoryless sources and sources with memory by using vector quantization to encode and decode the source data. By modeling an image to be a Markov source, the authors suggest a lower bound estimate of the rate-distortion function for the image with memory which can be used to evaluate the performance of VQ (Vector Quantization) and predictive VQ. For the latter, the residual image, which is the difference between the original and the predictive image, is used to generate codebooks. In the encoder, three previous encoded pixels are used to predict the current pixels. The errors between a codevector and the corresponding predictive vector are compared and the minimum criterion is used to select the codevector.< >

关键词： Rate-distortion compression algorithms Vector quantization Decoding Rate distortion theory Predictive models Prediction algorithms Encoding

来源：评论

学校读者我要写书评

暂无评论

A first step toward chromosome analysis by compression algorithms

A first step toward chromosome analysis by compression algor...

引用

International Symposium on Intelligence in Neural and Biological Systems, INBS

作者： E. Rivals J. Delahaye M. Dauchet O. Delgrange L.I.F.L. Université de Lille 1 Villeneuve d'Ascq France Service Informatique Université de Mons-Hainaut Mons Belgium

The authors use Kolmogorov complexity and compression algorithms to study DOS-DNA (DOS: defined ordered sequence). This approach gives quantitative and qualitative explanations of the regularities of apparently regular regions. The authors present the problem of the coding of approximate multiple tandem repeats in order to obtain compression. Then the authors describe an algorithm that allows one to find efficiently approximate multiple tandem repeats. Finally, the authors briefly describe some of their results.< >

关键词： Biological cells Algorithm design and analysis compression algorithms Sequences DNA Genomics Bioinformatics Humans Diseases Systematics

来源：评论

学校读者我要写书评

暂无评论

Lossless compression algorithms for Post-OPC IC Layout

Lossless Compression Algorithms for Post-OPC IC Layout

引用

IEEE International Conference on Image Processing

作者： Allan Gu Avideh Zakhor Department of Electrical Engineering and Computer Sciences University of California Berkeley CA USA

An important step in today's integrated circuit (IC) manufacturing is optical proximity correction (OPC). While OPC increases the fidelity of pattern transfer to the wafer, it also results in significant increase in IC layout file size. In this paper, we develop two techniques for compressing post-OPC layout data while remaining compliant with existing industry standard data formats such as OASIS and GDSII. The motivation for doing so is for the resulting compressed files to be viewed and edited by any industry standard CAD tools without a decoder. Our approach is to eliminate redundancies in the representation of the geometric data by finding repeating groups of polygons between multiple cells as well as within a cell. We refer to the former as "inter-cell sub-cell detection" and the later as "intra-cell sub-cell detection". Both problems are NP hard, and as such, we propose two sets of greedy algorithms to solve them. We show the results of our proposed inter-cell and intra-cell algorithms on actual 90nm, 130nm, and 180nm IC layouts.

关键词： compression algorithms Integrated circuit layout Photonic integrated circuits Optical losses Integrated circuit manufacture Integrated optics Manufacturing industries Standards development Decoding Greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Speech compression algorithms in mobile satellite systems

Speech compression algorithms in mobile satellite systems

引用

International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service (TELSIKS)

作者： M. Markovic B. Boskovic Institute of Applied Mathematics and Electronics Belgrade Serbia Belgrade Serbia

Development of modern satellite systems goes from the existing land-mobile systems (such as INMARSAT-M, INMARSAT-"mini-M", AMSC/TMI, OPTUS) towards truly mobile near-future systems (such as IRIDIUM, GLOBALSTAR, ICO, ACeS, Thuraya). Upcoming systems represent the personal communication systems with handheld terminals similar to the cellular mobile phones. One of the key technologies that enables this evolution is a design of the very low-bit rate speech compression algorithms providing a robust high-quality synthesized speech with a relative low delay. In most of the mentioned systems speech compression solutions based on the multi-band excitation (MBE) technology are used. In fact, this paper is dedicated to the overview of basic characteristics of the modern mobile satellite system with a special emphasis on the use of low-bit rate speech compression algorithms.

关键词： compression algorithms Satellite broadcasting Low earth orbit satellites Speech synthesis Telephony Delay Speech coding Personal communication networks TV Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Universal Data compression with Side Information at the Decoder by Using Traditional Universal Lossless compression algorithms

Universal Data Compression with Side Information at the Deco...

引用

IEEE International Symposium on Information Theory

作者： En-hui Yang Da-ke He Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada Thomas J. Watson Research Center IBM Yorktown Heights NY USA

ISBN: (纸本)9781424413973

In this paper we investigate universal data compression with side information at the decoder by leveraging traditional universal data compression algorithms. Specifically, consider a source network with feedback in which a finite alphabet source X = {X i } i=0 infin is to be encoded and transmitted, and another finite alphabet source Y = {Y i } i=0 infin available only to the decoder as the side information correlated with X. Assuming that the encoder and decoder share a uniform i.i.d. (independent and identically distributed) random database that is independent of (X, Y), we propose a string matching-based (variable-rate) block coding algorithm with a simple progressive encoder for the feedback source network. Instead of using standard joint typicality decoding, this algorithm derives its decoding rule from the codeword length function of a traditional universal lossless coding algorithm. As a result, neither the encoder nor the decoder assumes any prior knowledge of the joint distribution of (X, Y) or even the achievable rates. It is proven that for any (X, Y) in the class of all stationary, ergodic source-side information pairs with finite alphabet, the average number of bits per letter transmitted from the encoder to the decoder (compression rate) goes arbitrarily close to the conditional entropy rate H(X|Y) of X given Y asymptotically, and the average number of bits per letter transmitted from the decoder to the encoder (feedback rate) goes to 0 asymptotically.

关键词： Data compression Decoding compression algorithms Feedback Entropy Helium Block codes Communication systems Error probability Distributed databases

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Dictionary based Data compression algorithms for High Speed Networks

Performance Analysis of Dictionary based Data Compression Al...

引用

IEEE India Conference (INDICON)

作者： S. Subathra M. Sethuraman J. Vinosh Babu AU-KBC Research Center CEWiT India

Most of the data traversing corporate networks is redundant. The sources for this redundancy are the common language of the organization, business process flows and redundant internal application communications. The performance of the various applications running in a network is frequently constrained due to limited bandwidth, application contention and latency. By reducing the number of bytes that are transmitted across the WAN, data compression can potentially decrease network congestion, increase network effective capacity and communicate significantly larger amounts of data across an existing infrastructure. This paper describes the performance analysis of dictionary based data compression algorithm namely Molecular Sequence Reduction which delivers higher data compression rates, higher speed and scalability than the existing compression algorithms Lempel Ziv 77, Lempel Ziv Prediction.

关键词： Performance analysis Dictionaries Data compression High-speed networks Business communication Bandwidth Delay Wide area networks Scalability compression algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：