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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,082 篇 compression algo...
649 篇 image coding
492 篇 data compression
284 篇 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,054 篇 英文
14 篇 中文
13 篇 其他

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

共 2082 条记录，以下是511-520 订阅

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

详细简洁

排序：

Using Inter-file Similarity to Improve Intra-file compression

Using Inter-file Similarity to Improve Intra-file Compressio...

引用

IEEE International Conference on Services Economics (SE)

作者： Angelos Molfetas Anthony Wirth Justin Zobel Department of Computing and Information Systems The University of Melbourne

In storage systems with vast numbers of files, compression techniques should exploit of inter-file similarity, while allowing for near-atomic access to individual files. In differential compression, collections of files are compressed by identifying shared common strings. Therefore, some files are represented largely by references to strings in other files. In addition, a file in the collection can be (further) compressed by identifying common strings within the file itself. At the cost of decompression latency, but a possible gain in compression effectiveness, an LZ-style within-file compressor could resolve these references to other files. To quantify the compression gain, we experiment with a variety of file collections, from emails to source code, and test against multiple measures. If the LZ scheme honors the inter-file references, then there is only minimal improvement. If the LZ algorithm replaces inter-file references with intra-file references, then up to 3% compression improvement is witnessed for mildly similar files, and over 200% improvement for highly similar files.

关键词： Electronic mail Encoding Dictionaries Encyclopedias Indexes Measurement compression algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Customizable compression Architecture for Efficient Configuration in CGRAs

Customizable Compression Architecture for Efficient Configur...

引用

Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Syed M.A.H. Jafri Adeel Tajammul Masoud Daneshtalab Ahmed Hemani Kolin Paul Peeter Ellervee Juha Plosila Hannu Tenhunen Turku Centre for Computer Science Royal Institute of Technology Sweden University of Turku Finland Indian Institute of Technology Delhi Tallin University of Technology Estonia

Today, Coarse Grained Reconfigurable Architectures (CGRAs) host multiple applications. Novel CGRAs allow each application to exploit runtime parallelism and time sharing. Although these features enhance the power and silicon efficiency, they significantly increase the configuration memory overheads. As a solution to this problem researchers have employed statistical compression, intermediate compact representation, and multicasting. Each of these techniques has different properties, and is therefore best suited for a particular class of applications. However, existing research only deals with these methods separately. In this paper we propose a morphable compression architecture that interleaves these techniques in a unique platform.

关键词： Computer architecture Multicast communication Software Hardware Educational institutions Silicon compression algorithms

来源：评论

学校读者我要写书评

暂无评论

compression Schemes for Similarity Queries

Compression Schemes for Similarity Queries

引用

Data compression Conference (DCC)

作者： Idoia Ochoa Amir Ingber Tsachy Weissman Dept. of Electrical Engineering Stanford University Stanford CA

ISBN: (纸本)9781479934188

We consider compression of sequences in a database so that similarity queries can be performed efficiently in the compressed domain. The fundamental limits for this problem setting, which characterize the trade off between compression rate and reliability of the answers to the queries, have been characterized in past work. However, how to approach these limits in practice has remained largely unexplored. Recently, we proposed a scheme for this task that is based on existing lossy compression algorithms, for the general case where the similarity measure satisfies a triangle inequality. Although it was shown that it achieves the fundamental limits for some cases, it is suboptimal in general. In this paper we propose a new scheme that also uses lossy compression algorithms as a building block, but with a carefully chosen distortion measure that is different than the one defining the similarity between sequences. The new scheme significantly improves the compression rate compared to the previously proposed scheme in many cases. For example, for binary sources and Hamming similarity measure, simulation results show a compression rate close to the fundamental limit, and an improvement over the previously proposed scheme of up to 55% (for the same reliability). The results shed light on the fact that compression for similarity identification is inherently different than classical lossy compression.

关键词： Databases Distortion measurement Loss measurement compression algorithms Reliability Vectors Random variables

来源：评论

学校读者我要写书评

暂无评论

Parallel POD compression of Time-Varying Big Datasets Using m-Swap on the K Computer

Parallel POD Compression of Time-Varying Big Datasets Using ...

引用

IEEE International Conference on Services Economics (SE)

作者： Chongke Bi Kenji Ono Lu Yang RIKEN Kobe Japan Kyoto University Kyoto Japan

Thanks to the supercomputer, more and more complicated simulations are successfully achieved. On the other hand, to analyze and understand the intrinsic properties of the big datasets from the simulations is an urgent research for scientists. However, the explosive size of the big datasets makes such kind of task difficult. Therefore, reduction of the size of the big datasets becomes an important topic, in which data compression and parallel computing are the two key techniques. In this paper, we presented a parallel data compression approach to reduce the size of time-varying big datasets. Firstly, we employ the proper orthogonal decomposition (POD) method for compression. The POD method can extract the underlying features of datasets to greatly reduce the size of big datasets. Meanwhile, the compressed datasets can be decompressed linearly. This feature can help scientists to interactively visualize big datasets for analysis. Then, we introduced a novel m-swap method to effectively parallelize the POD compression algorithm. The m-swap method can reach a high performance through fully using all parallel computing processors. In another word, no idle processors exist in the parallel compression process. Furthermore, the m-swap method can greatly reduce the cost of interprocessor communication. This is achieved by controlling the data transfer among 2m processors to obtain the best balance of computation cost of these processors. Finally, the effectiveness of our method will be demonstrated through compressing several time-varying big datasets on the K computer with ten thousands of processors.

关键词： Program processors Image coding Vectors Three-dimensional displays compression algorithms Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Embedding and retrieving patient's identification and compression of ECG signal

Embedding and retrieving patient's identification and compre...

引用

IEEE Students' Technology Symposium (TechSym)

作者： Basudev Halder S. S. Bose N. Mishra S. Mitra Department of Information Technology Neotia Institute of Technology Management & Science W.B India Department of Electronics Affiliated to University of Calcutta Kolkata W.B. India

In this paper, the authors propose a new ECG compression algorithm which embeds patient's identification inside the ECG data. The compressed file contains only ASCII characters. The proposed scheme also allows the decompression technique where the original ECG waveform can be exactly reconstructed and retrieve patient's identification from the ECG signal. The whole module has been applied to various ECG data of all the 12 leads taken from PTB diagnostic database (PTB-DB) of physioNet (***) and gives a highly compressed result that can be stored using far less digital space without distorting important ECG characteristics which are essential for proper medical diagnosis. Moreover, the compression, embedding, decompression and retrieving of data are achieved in a series of sequential, simplistic logical processes that can be easily executed. It is observed that the proposed algorithm gives a high compression ratio (CR=7.3593, an excellent Quality Score (QS=1362) and very low difference between original and reconstructed ECG signal (PRD=O.0054).

关键词： Electrocardiography Arrays Medical treatment Data compression Watermarking compression algorithms

来源：评论

学校读者我要写书评

暂无评论

The performance of the Daubechies mother wavelets on ECG compression

The performance of the Daubechies mother wavelets on ECG com...

引用

International Symposium on Electronics and Telecommunications (ISETC)

作者： B. Arvinti M. Costache Physical Foundations of Engineering “Politehnica” University of Timisoara Timisoara Romania

Electrocardiograms (ECG) display important information about the cardiac activity of the human heart. An early diagnosis can be significantly improved through long-term remote monitoring of the patient. This involves large quantities of data to be transmitted to a physician for interpretation. Therefore, reliable compression algorithms have to be developed. The performance of a compression method based on the Discrete Wavelet Transform has been tested using the Daubechies family of mother wavelets as a main parameter. Simulations have been performed on a significant number of ECG signals, the results being displayed for performance evaluation.

关键词： Electrocardiography Discrete wavelet transforms Signal to noise ratio compression algorithms Remote monitoring

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Burrows Wheeler Transform based image compression algorithm for multimedia applications

Evaluation of Burrows Wheeler Transform based image compress...

引用

International Conference on Advances in Communication and Computing Technologies (ICACACT)

作者： C.D. Rawat Smita Rao Dept. Of Extc VESIT Mumbai

compression is a technique to reduce the quantity of data without excessively reducing the quality. The transmission and storing of compressed multimedia data is much faster and more efficient than original uncompressed data. There are various techniques and standards for multimedia data compression, especially for image compression. They are either lossless or lossy techniques. Arithmetic and Huffman coding are two of the widely used lossless compression techniques. Burrows Wheeler Transform(BWT) is a sorting technique which when used with the available compression algorithms can considerably increase the compression ratio. Here a hybrid compression model using BWT with Arithmetic Coding(AC) and Huffman Coding is analysed for image compression and improvement in overall compression is documented.

关键词： Image coding Transforms Huffman coding Multimedia communication Indexes compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Operational Capability and Suitability of Image compression Methods for Different Applications

Operational Capability and Suitability of Image Compression ...

引用

IEEE Canadian Conference on Electrical and Computer Engineering

作者： Azadeh Safari Fujimi Bentley Yinan Kong Department of Engineering Macquarie University Sydney Australia

ISBN: (纸本)9781479931026

Image compression is one of the most widely used groups of signal processing schemes in real-time applications. There are various algorithms for compressing images, each with pros and cons. Each method of data compression behaves differently for various types of data, thus a review of the common image algorithms seems necessary to compare the compression ratio, compression and decompression time, and generated file sizes. This paper aims to provide an insight into the characteristics of commonly used image-compression algorithms. Each algorithm is tested with controlled test images to determine the operational capabilities of each algorithm for different test cases. Subsequently, the performance of each algorithm is simulated and compared with other methods. Discussions on how algorithms behave with various test images are given in detail. The desired outcome of this study is a clear description of compression algorithms, and determining the suitability of each algorithm for different applications.

关键词： Data compression operating performance Image compression algorithms compression algorithms data types suitability images CASING INSPECTION signal processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：