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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,081 篇 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,053 篇 英文
14 篇 中文
13 篇 其他

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

共 2081 条记录，以下是721-730 订阅

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

详细简洁

排序：

Lossless Segment Based DNA compression

Lossless Segment Based DNA Compression

引用

International Conference on Electronic Computer Technology

作者： T V Mridula Philip Samuel Department of Computer Science Cochin University of Science and Technology India School of Engineering Cochin University of Science and Technology India

This paper introduces a new Lossless Segment Based DNA compression (LSBD) method for compressing the DNA sequences. It stores the individual gene position in a compressed file. Since LSBD method performs a gene wise compression, further processing of compressed data reduces memory usage. The biggest advantage of this algorithm is that it enables part by part decompression and can work on any sized data. Here the method identifies individual gene location and then constructs triplets that are mapped to an eight bit number. The individual gene information is stored in a pointer table and a pointer is provided to corresponding location in the compressed file. The LSBD technique appropriately compresses the non-base characters and performs well on repeating sequences.

关键词： DNA compression algorithms Bioinformatics Memory management Genomics Approximation algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

BWT-based Data Preprocessing for LZW

BWT-based Data Preprocessing for LZW

引用

International Conference on Multimedia and Signal Processing (CMSP)

作者： Bin Li Guiqiang Ni Jianxin Luo Xue Zhang Institute of Command Automation PLA University of Science & Technology Nanjing Jiangsu China

In this paper we propose a BWT-based LZW algorithm for reducing the compressed size and the compression time. BWT and MTF can expose potential redundancies in a given input and then significantly improve the compression ratio of LZW. In order to avoid the poor matching speed of LZW on long runs of the same character, we propose a variant of RLE named RLE-N. RLE-N does not affect the compression ratio, but it contributes LZW to reduce the execution time obviously. The experimental results show that our algorithm performs well on normal files.

关键词： Context Dictionaries Signal processing algorithms Transforms compression algorithms Data compression Sorting

来源：评论

学校读者我要写书评

暂无评论

A Method to Ensure the Confidentiality of the Compressed Data

A Method to Ensure the Confidentiality of the Compressed Dat...

引用

International Conference on Data compression, Communications and Processing

作者： M. Oguzhan Kulekci National Research Institute of Electronics & Cryptology Turkey

The usual way of ensuring the confidentiality of the compressed data is to encrypt it with a standard encryption algorithm such as the AES. However, the cost of encryption not only brings an additional computational complexity, but also lacks the flexibility to perform pattern matching on the compressed data, which is an active research topic in stringology. In this study, we investigate the secure compression solutions, and propose a practical method to keep contents of the compressed data hidden. The method is based on the Burrows - Wheeler transform ({BWT}) such that a randomly selected permutation of the input symbols are used as the lexicographical ordering during the construction. The motivation is the observation that on BWT of an input data it is not possible to perform a successful search nor construct any part of it without the correct knowledge of the character ordering. %Capturing that secret ordering from the BWT is hard. The proposed method is supposed to be is an elegant alternative to the standard encryption approaches with the advantage of supporting the compressed pattern matching, while still pertaining the confidentiality. When the input data is homophonic such that the frequencies of the symbols are flat and the alphabet is sufficiently large, it is possible to unify compression and security in a single framework with the proposed technique instead of the two - level compress - then - encrypt paradigm.

关键词： Encryption Pattern matching Encoding Transforms compression algorithms

来源：评论

学校读者我要写书评

暂无评论

A delayed input DFA optimized algorithm of bounding default path

A delayed input DFA optimized algorithm of bounding default ...

引用

IEEE International Conference on Computer Science and Automation Engineering (CSAE)

作者： Jin Qu Rongcai Zhao Peng Liu Zishuang Li Qin Li National Digital Switching System Engineering and Technological Research and Development Center Zhengzhou Henan China Zheng Zhou Light Industry Vocational College Zhengzhou Henan China

To improve the storage space of finite automata on regular expression matching, the paper researches the main idea of the delayed input DFA algorithm based on bounding default path, and analyses the algorithm problem when bounding small length default path. Then we propose optimized algorithm based on weight first principle and node first principle and assess them on the actual rule set, the results show that the optimized algorithm could effectively improve the compression ratio when the default path is bounded small.

关键词： Algorithm design and analysis Doped fiber amplifiers Linux Filtering algorithms Automata compression algorithms Memory management

来源：评论

学校读者我要写书评

暂无评论

Optimizing alphabet using genetic algorithms

Optimizing alphabet using genetic algorithms

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Jan Platos Pavel Kromer Department of Computer Science FEECS VSB-Technical University of Ostrava Ostrava Poruba Czech Republic

Data compression algorithms were usually designed for data processing symbol by symbol. The input symbols of these algorithms are usually taken from the ASCII table, i.e. the size of the input alphabet is 256 symbols which are representable by 8-bit numbers. Several other techniques were developed-syllable-based compression, which uses the syllable as a basic compression symbol, and word-based compression, which uses words as basic symbols. These three approaches are strictly bounded and no overlap is allowed. This may be a problem because it may be helpful to have an overlap between them and use a character-based approach with a few symbols as a sequence of characters. This paper describes an algorithm that looks for the optimal alphabet for different text files. The alphabet may contain characters and 2-grams.

关键词： Genetic algorithms Data compression Biological cells compression algorithms Dictionaries Algorithm design and analysis Genetics

来源：评论

学校读者我要写书评

暂无评论

A Direct Web Page Templates Detection Method

A Direct Web Page Templates Detection Method

引用

International Conference on Internet Technology and Applications (iTAP)

作者： Su-bin Xie Bin Liang Wen-chang Shi Zhao-hui Liang Xiu-mei Yu Lei Zhang

Currently, a large number of web sites are generated from web templates so as to improve the productivity of web sites construction. However, the prevalence of web templates has a negative impact on the efficiency of search engine in many aspects, including the relevance judgment of web IR and resource usage of analysis tool. In this paper, we present a direct and fast method to detect pages of the same template by DOM tree characteristics. After analyzing and compressing DOM tree nodes of the HTML page, our method generates a hash value digest, also called fingerprint, for each page to identify its DOM structure. In addition, we also introduce some other page features to aid in judging the page template type. Through experimental evaluations over thirty thousand sub-domains, we show that our approach can obtain the analysis results rapidly but with a high accuracy rate above 95 percents.

关键词： HTML Web pages Fingerprint recognition Search engines compression algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

Generating Aspect-oriented Multi-Document Summarization with Event-aspect model 11

Generating Aspect-oriented Multi-Document Summarization with...

引用

Conference on empirical methods in natural language processing

作者： Peng Li Yinglin Wang Wei Gao Jing Jiang Shanghai Jiao Tong University Chinese University of Hong Kong Singapore Management University

ISBN: (纸本)9781937284114

In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sentences into aspects. We then use extended LexRank algorithm to rank the sentences in each cluster. We use Integer Linear Programming for sentence selection. Key features of our method include automatic grouping of semantically related sentences and sentence ranking based on extension of random walk model. Also, we implement a new sentence compression algorithm which use dependency tree instead of parser tree. We compare our method with four baseline methods. Quantitative evaluation based on Rouge metric demonstrates the effectiveness and advantages of our method.

关键词： Integer linear programming autogeneration Adjudication compression algorithms Parser laser Doppler anemometry Anterior interventricular branch of left coronary artery Left-sided displacement of abomasum Quantitative Evaluation Random walk

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Andre Burkovski Sebastian Klenk Gunther Heidemann Department for Intelligent Systems University of Stuttgart Stuttgart Germany

The Normalized compression Distance (NCD) has gained considerable interest in pattern recognition as a similarity measure applicable to unstructured data of very different domains, such as text, DNA sequences, or images. NCD uses existing compression programs such as gzip to compute similarity between objects. NCD has unique features: It does not require any prior knowledge, data preprocessing, feature extraction, domain adaptation or any parameter settings. Further, the NCD can be applied to symbolic data and raw signals alike. In this paper we decompose the NCD and introduce a method to measure compression-based similarity without the need to use compression. The Length Delimiting Dictionary Distance (LD 3 ) takes the one component essential in compression methods, the dictionary generation, and strips the NCD of all dispensable components. The LD 3 performs "compression based pattern recognition without compression", keeping all of the above benefits of the NCD while achieving better speed and recognition rates. We first review the NCD, introduce LD 3 as the "essence" of NCD, and evaluate the LD 3 based on language tree experiments, authorship recognition, and genome phylogeny data.

关键词： Dictionaries Complexity theory Pattern recognition Compressors Measurement compression algorithms Image coding

来源：评论

学校读者我要写书评

暂无评论

Evolving alphabet using genetic algorithms

Evolving alphabet using genetic algorithms

引用

World Congress on Nature & Biologically Inspired Computing (NaBIC)

作者： Jan Platos Pavel Kromer Department of Computer Science FEECS VSB-Technical University of Ostrava Ostrava Poruba Czech Republic

Data compression algorithms were usually designed for data processing symbol by symbol. Symbols are usually characters or bytes, but several other techniques may be used. The most well-known approach is using syllables or words as symbols. Another approach is to take 2-grams, 3-grams or any n-grams as a symbols. All these approaches has pros and cons, but none of them is the best for any file. This paper describes approach of evolving alphabet from characters and 2-grams, which is optimal for compressed text files. The efficiency of the approach will be tested on three compression algorithms.

关键词： Genetic algorithms compression algorithms Encoding Data compression Dictionaries Image coding Biological cells

来源：评论

学校读者我要写书评

暂无评论

Performance Measurement of XML compression algorithms for DSRC Messages

Performance Measurement of XML Compression Algorithms for DS...

引用

Conference on Local Computer Networks (LCN)

作者： Sabit Sayeed Ramiro Liscano Allauddin Ahmad SITE University of Ottawa Canada Faculty of Engineering and Applied Science University of Ontario Institute of Technology (UOIT) Canada

The DSRC standard gives the provision to process messages in XML format instead of the default binary encoding scheme. Although, use of XML encoding provides flexibility, it also introduces bandwidth communication overhead since the message size will increase and end to end communication delay since processing time will also increase. There are many proposed XML compression algorithms to decrease message size but few have been tested for processing and communication delays for inter vehicle communication. In this paper, performance measurements for various compression algorithms on DSRC messages are presented.

关键词： Measurement XML compression algorithms Encoding Testing Delay estimation Bandwidth Vehicles Redundancy Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：