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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Multistate Satellite System Reliability Optimization Based on Improved compression Inference Algorithm and Bayesian Network

Multistate Satellite System Reliability Optimization Based o...

引用

Congress on Evolutionary Computation

作者： Xiaohu Zheng Xianqi Chen Wen Yao Xiaoqian Chen Longqi Yang Yazhong Luo College of Aerospace Science and Engineering National University of Defense Technology Changsha China Chinese Academy of Military Science National Innovation Institute of Defense Technology Beijing China

No doubt that the proper design of satellite system reliability is one of the most important issues in satellite system engineering. In order to optimize the satellite reliability, the reliability optimization method is studied in this paper based on compression algorithm, Bayesian Network (BN) and Particle Swarm Optimization (PSO). Firstly, the improved compression inference algorithm (ICIA) is proposed to model the BN reliability model of multistate system based on the existing compression and inference algorithms. Then, the reliability optimization problem is formulated, which is a typical discrete optimization problem with the discrete reliability measured in the number of each component's units as design variables. The process of optimization, based on the BN reliability model of multistate satellite system will be achieved by PSO. The efficacy of the proposed method is demonstrated in a microsatellite system reliability optimization, which verifies the importance of satellite reliability optimization in decreasing the cost of satellite development.

关键词： Satellites Optimization Inference algorithms Reliability engineering compression algorithms Analytical models

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of Lempel-Ziv Compressed and Encrypted Text: The Statistics of compression

Cryptanalysis of Lempel-Ziv Compressed and Encrypted Text: T...

引用

International Symposium on Wireless Communication Systems (ISWCS)

作者： Parker Boyce Willie K. Harrison Department of Electrical and Computer Engineering University of Colorado Colorado Springs Colorado Springs CO Department of Electrical and Computer Engineering Brigham Young University Provo UT

Modern secure communication systems typically follow a pattern at the transmitter of first compression encoding followed by encryption, and then additional encoders to mitigate the effects of channel noise, etc. One of the purposes of the compression algorithm is to remove statistical information about the plaintext, so as to render the ciphertext impervious to statistical attacks. It is well known, however, that in practice there is no such thing as a universal compression algorithm; thus, some statistical information about the plaintext tends to survive the compression process. In this paper, we consider Lempel-Ziv Welch compression and analyze its effectiveness in removing statistical information from English plaintext. Specifically, we present several techniques for exploiting the structure of the compression algorithm to launch a successful statistical attack on compressed and encrypted data. All attacks are ciphertext only and one of them relies on linear programming. Although our attacks indicate that an eavesdropper may require additional ciphertext to carry out a successful attack if compression is used, the specific adaptive nature of the Lempel-Ziv compression technique leaves its own statistics on the message, which can be exploited by an attacker.

关键词： Encryption Encoding Hidden Markov models compression algorithms Ciphers Wireless communication

来源：评论

学校读者我要写书评

暂无评论

The Performances of the Fixed Constraints Transform Applied in Text compression Experimental Results and Comparisons

The Performances of the Fixed Constraints Transform Applied ...

引用

International Conference on Electronics, Computers and Artificial Intelligence (ECAI)

作者： Radu Rădescu Andrei Petru Bărar Applied Electronics and Information Engineering University “Politehnica” of Bucharest Bucharest Romania Technical Department Gemini Solutions Romania Bucharest Romania

ISBN: (纸本)9781538649022;9781538649015

The Fixed Constraints Transform (FCT) encodes the text based on a dictionary. This dictionary is used to accomplish the connections between the words in the text and their corresponding transforms. The dictionary is generated one time and it is saved in a binary form for a better word-indexing speed. This method is strictly designed for text compression and it has maximum performances when the text has normal formatting - in a phrase, only the first word starts with upper case, and it continues with lower case. Because the algorithm is based on modification of the words in the text, on unaltered signs of punctuation, on spaces and other special characters, the algorithms performance is given by the ratio between the number of letters in the text and the total number of characters. FCT has close performances with other frequently used transforms - Star, Burrows-Wheeler, etc. - in terms of compression, but it has better execution speed. The applied algorithms of lossless data compression for testing are: RLE (Run-Length Encoding), arithmetic, PPMd (Prediction by Partial Matching), BZip2, Deflate (WinZip), LAMA, and RAR. The following indicators of compression performance were measured: the requested time for transform generation, the compression rate, and the requested time for compression. The text files used for evaluating the performance are from the Calgary Corpus. FCT leads to compression performances close to the ones obtained by the usual transforms used as pre-compression methods (BWT, Star Transform and derivatives). FCT is suited for the use of a chain of processors that have as purpose lossless data compression. The transform itself does not do a performing compression, but - most important - it helps a compression algorithm applied after it with the fact that it eliminates some redundant information and specific features to the idioms written in a certain language. FCT is an efficient method of data processing with notable results that can be very easily i

关键词： Transforms Dictionaries compression algorithms Neural networks Data compression Encoding Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of compression Methods for Impedance and Field Potential Signals of Cardiomyocytes 44

Comparison of Compression Methods for Impedance and Field Po...

引用

44th Computing in Cardiology Conference (CinC)

作者： Guyot, Pauline Batista, Levy Djermoune, El-Hadi Moureaux, Jean-Marie Bastogne, Thierry Doerr, Leo Beckler, Matthias Univ Lorraine CRAN UMR 7039 Vandoeuvre Les Nancy France CNRS CRAN UMR 7039 Vandoeuvre Les Nancy France INRIA BIGS Vandoeuvre Les Nancy France CYBERnano Villers Les Nancy France NANION Munich Germany

ISBN: (纸本)9781538645550;9781538666302

We present in this paper an extensive comparison of compression methods adapted to impedance and field potential signals of cardiomyocytes. Different combinations of the traditional scheme of lossy compression have been tested and other original methods such as compressed sensing were implemented as well. All algorithms are assessed on several criteria such as compression ratio, distortion of the data, etc. We show that the selected method presents the ability and reliability to compress sensitive data with a compression ratio greater than 5: 1 while preserving the relevant information content of the recorded data.

关键词： Impedance Entropy Compressed sensing Sensors Databases Dictionaries compression algorithms impedance compression algorithms Compressed sensing Dictionaries as Topic entropy Database Sensors Cardiac Myocytes compression ratio lossy compression Sensitive data

来源：评论

学校读者我要写书评

暂无评论

LZ4m: A Fast compression Algorithm for In-Memory Data

LZ4m: A Fast Compression Algorithm for In-Memory Data

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Kwon, Se-Jun Kim, Sang-Hoon Kim, Hyeong-Jun Kim, Jin-Soo Sungkyunkwan Univ Coll Informat & Commun Engn Seoul South Korea Korea Adv Inst Sci & Technol Sch Comp Daejeon South Korea

Compressing in-memory data is a cost-effective solution for dealing with the memory demand from data-intensive applications. This paper proposes a fast data compression algorithm for in-memory data that improves perfo... 详细信息

ISBN: (纸本)9781509055449

关键词： Encoding compression algorithms Memory management Conferences Consumer electronics Data compression Electronic mail

来源：评论

学校读者我要写书评

暂无评论

An Approach of Algorithmic Clustering Based on String compression to Identify Bird Songs Species in Xeno-canto Database 3

An Approach of Algorithmic Clustering Based on String Compre...

引用

3rd International Conference on Frontiers of Signal Processing (ICFSP)

作者： Sarasa, Guillermo Granados, Ana Rodriguez, Francisco B. Univ Autonoma Madrid Escuela Politecn Super Madrid Spain Univ Complutense Madrid CES Felipe II Madrid Aranjuez Spain

ISBN: (纸本)9781538610381

In this work, we analyze the usefulness of the normalized compression distance (NCD) as a similarity measure to bird species identification through audio samples. As a first approach we review the effect of different compression methods from 7z and CompLearn Toolkit, over subsets of bird audio samples obtained from the xeno-canto database. The performance of each compression method was measured applying hierarchical clustering and projection mapping to the distance matrix, and later on, measuring the quality of both of them. Our results are very promising and show that the identification of a bird species among multiples audio samples is possible through NCD-basedon clustering.

关键词： data mining normalized compression distance clustering dendrogram bird sound classification silhouette coefficient multidimensional projections compression algorithms similarity

来源：评论

学校读者我要写书评

暂无评论

Impact of the Acquisition Time on ECG compression-Based Biometric Identification Systems 8th

Impact of the Acquisition Time on ECG Compression-Based Biom...

引用

8th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA)

作者： Carvalho, Joao M. Bras, Susana Ferreira, Jacqueline Soares, Sandra C. Pinho, Armando J. Univ Aveiro Dept Elect Telecommun & Informat IEETA Aveiro Portugal Univ Aveiro Dept Educ & Psychol Aveiro Portugal Univ Coimbra Fac Med IBILI Coimbra Portugal Univ Aveiro CINTESIS UA Aveiro Portugal Karolinska Inst Dept Clin Neurosci Stockholm Sweden

ISBN: (纸本)9783319588384;9783319588377

The ECG signal conveys desirable characteristics for biometric identification (universality, uniqueness, measurability, acceptability and circumvention avoidance). However, based on the current literature review, there are no results that evaluate the number of heartbeats needed for personal identification. This information is undoubtedly useful when building a biometric identification system - any system should ask participants to provide data for identification, using the smallest time interval that is possible, for practical reasons. In this paper, we aim at exploring this topic using a measure of similarity based on the Kolmogorov Complexity, called the Normalized Relative compression (NRC). To attain the goal, we built finite-context models to represent each individual a compression-based approach that has been shown successful for several other pattern recognition applications like image similarity, DNA sequences or authorship attribution.

关键词： Kolmogorov Complexity Biometric identification Finite-context models Similarity metrics compression algorithms ECG

来源：评论

学校读者我要写书评

暂无评论

Alternative algorithms Involving Alphabetical Coding and Limited Length Encoding in Lossless Data compression of Text Files

Alternative Algorithms Involving Alphabetical Coding and Lim...

引用

International Symposium on Fundamentals of Electrical Engineering (ISFEE)

作者： Radescu, Radu Univ Politehn Bucuresti Fac Elect Telecommun & Informat Technol Appl Elect & Informat Engn Dept 1-3 Iuliu Maniu Blvd RO-061071 Bucharest Romania

ISBN: (纸本)9781467395755

Coding algorithms are generally aimed at minimizing the output code length encoding speed once the code has been designed. Moreover, most codes use a binary alphabet. This paper examines other issues related to coding, such as additional constraints imposed on the channel. Code generation will be considered where there is a limit on code words. Limits the application of such systems is a practical example of data compression where fast decoding is essential. When all code words correspond to a single word in memory (usually 32 bits, but there are situations that take 64-bit) can be used canonical decoding. If the deadline cannot be guaranteed, however, required the use of slower decoding methods. This paper also deals with the alphabetic code generation, where lexicographic arrangement of words by their code symbols must correspond to the original order in which the symbols were taken coding system. When an alphabetic code is used to compress a database that can be sorted in the same, order they would have had if the database records were first decompressed and then sorted. It also corresponds to alphabetic code trees binary search trees, which have applications in a wide variety of search problems. Assumption that the symbols are sorted by probability is not suitable for this scenario. The problem of finding codes for non-binary alphabets channel will be examined in detail. The subsequent experimental results cover the problem of alphabetic coding and of limited length coding.

关键词： Data compression Source coding compression algorithms Adaptive coding Text processing

来源：评论

学校读者我要写书评

暂无评论

A Novel Architecture for LZS S compression of Configuration Bitstreams Within FPGA 20

A Novel Architecture for LZS S Compression of Configuration ...

引用

20th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Isa, Radek Matousek, Jiri CESNET Zspo Zikova 4 Prague 16000 6 Czech Republic

ISBN: (纸本)9781538604724

Partial run-time reconfigurability of current FPGAs has been shown to be beneficial in many application domains. However, utilization of this feature is limited by the time it takes to reconfigure a selected part of an FPGA. This is commonly addressed by compression of a configuration bitstream, often using LZSS algorithm. To allow speeding up the reconfiguration also in self-adaptive architectures, bitstream compression has to be done within FPGA. Therefore, this paper presents a novel architecture of an LZSS compression engine that is able to achieve very low resource utilization or throughput several times higher than similar architectures, while keeping the other parameter as well as compression ratio at acceptable level. The presented architecture is generic, thus the user can tune the input token size and the size of buffers to achieve desired characteristics. The paper also includes an evaluation of a trade-off among the size of input token, the size of buffers utilized in LZSS algorithm, and a compression ratio for several configuration bitstreams. This evaluation can help the user to select the right set of parameters for the architecture.

关键词： Field programmable gate arrays Throughput Engines Table lookup Resource management compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Lossless compression of CAN Traffic Logs 25

Efficient Lossless Compression of CAN Traffic Logs

引用

25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

作者： Gazdag, Andras Buttyan, Levente Szalay, Zsolt Budapest Univ Technol & Econ Dept Networked Syst & Serv Lab Cryptog & Syst Secur Budapest Hungary Budapest Univ Technol & Econ Fac Transportat Engn & Vehicle Engn Dept Automot Technol Budapest Hungary

ISBN: (纸本)9781538632123

In this paper, we propose a compression method that allows for the efficient storage of large amounts of CAN traffic data, which is needed for the forensic investigations of accidents caused by cyber attacks on vehicles. compression of recorded CAN traffic also reduces the time (or bandwidth) needed to off-load that data from the vehicle. In addition, our compression method allows analysts to perform log analysis on the compressed data, therefore, it contributes to reduced analysis time and effort. We achieve this by performing semantic compression on the CAN traffic logs, rather than simple syntactic compression. Our compression method is lossless, thus preserving all information for later analysis. Besides all the above advantages, the compression ratio that we achieve is better than the compression ratio of state-of-the-art syntactic compression methods, such as gzip.

关键词： Semantics Accidents Forensics Protocols compression algorithms Syntactics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：