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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

546 篇 工学
- 272 篇 电气工程
- 269 篇 计算机科学与技术...
- 132 篇 信息与通信工程
- 81 篇 软件工程
- 38 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 27 篇 仪器科学与技术
- 24 篇 生物医学工程（可授...
- 14 篇 机械工程
- 13 篇 测绘科学与技术
- 8 篇 网络空间安全
- 7 篇 航空宇航科学与技...
- 7 篇 生物工程
- 5 篇 交通运输工程
- 3 篇 光学工程
- 3 篇 土木工程
63 篇 理学
- 19 篇 数学
- 19 篇 系统科学
- 11 篇 物理学
- 10 篇 地球物理学
- 6 篇 生物学
- 2 篇 地理学
- 2 篇 海洋科学
- 2 篇 统计学（可授理学、...
58 篇 医学
- 48 篇 临床医学
- 9 篇 基础医学(可授医学...
- 3 篇 特种医学
36 篇 管理学
- 35 篇 管理科学与工程(可...
12 篇 文学
- 12 篇 新闻传播学
5 篇 农学
- 4 篇 作物学
2 篇 军事学
1 篇 经济学
1 篇 艺术学

主题

2,075 篇 compression algo...
655 篇 image coding
493 篇 data compression
285 篇 encoding
226 篇 transform coding
221 篇 decoding
206 篇 algorithm design...
164 篇 dictionaries
157 篇 bandwidth
151 篇 video compressio...
144 篇 hardware
143 篇 computer science
131 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
110 篇 bit rate
102 篇 costs
102 篇 quantization
97 篇 frequency
97 篇 image reconstruc...

机构

9 篇 hewlett packard ...
6 篇 school of electr...
5 篇 department of co...
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...
4 篇 department of co...

作者

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

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

共 2075 条记录，以下是631-640 订阅

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

详细简洁

排序：

A compression algorithm using mis-aligned side-information

A compression algorithm using mis-aligned side-information

引用

IEEE International Symposium on Information Theory

作者： Nan Ma Kannan Ramchandran David Tse Wireless Foundations Department of Electrical Engineering and Computer Sciences University of California Berkeley USA

We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a simple algorithm to compress the source sequence when the side-information is present at both the encoder and decoder. A key attribute of the algorithm is that it encodes the edits contained in runs of different extents separately. For small insertion and deletion probabilities, the compression rate of the algorithm is shown to be asymptotically optimal.

关键词： Decoding Entropy compression algorithms Synchronization Bioinformatics Genomics Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Threshold compression for 3G scalable monitoring

Threshold compression for 3G scalable monitoring

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Suk-Bok Lee Dan Pei MohammadTaghi Hajiaghayi Ioannis Pefkianakis Songwu Lu He Yan Zihui Ge Jennifer Yates Mario Kosseifi Carnegie Mellon University USA AT and T Laboratories USA University of Maryland USA UCLA USA AT and T Network Services USA

ISBN: (纸本)9781467307734;9781467307758

We study the problem of scalable monitoring of operational 3G wireless networks. Threshold-based performance monitoring in large 3G networks is very challenging for two main factors: large network scale and dynamics in both time and spatial domains. A fine-grained threshold setting (e.g., perlocation hourly) incurs prohibitively high management complexity, while a single static threshold fails to capture the network dynamics, thus resulting in unacceptably poor alarm quality (up to 70% false/miss alarm rates). In this paper, we propose a scalable monitoring solution, called threshold-compression that can characterize the location- and time-specific threshold trend of each individual network element (NE) with minimal threshold setting. The main insight is to identify groups of NEs with similar threshold behaviors across location and time dimensions, forming spatial-temporal clusters to reduce the number of thresholds while maintaining acceptable alarm accuracy in a large-scale 3G network. Our evaluations based on the operational experience on a commercial 3G network have demonstrated the effectiveness of the proposed solution. We are able to reduce the threshold setting up to 90% with less than 10% false/miss alarms.

关键词： Monitoring Accuracy Throughput Clustering algorithms Complexity theory Downlink compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Investigating Randomness of the LZSS compression Algorithm

Investigating Randomness of the LZSS Compression Algorithm

引用

International Conference on Computer Science and Service System (CSSS)

作者： Weiling Chang Xiaochun Yun Nanning Li Xiuguo Bao National Computer Network and Information Security Management Center Beijing China

ISBN: (纸本)9781467307215

Random Number Generators play a critical role in a number of important applications. In practice, statistical testing is employed to gather evidence that a generator indeed produces numbers that appear to be random. In this paper, we address the issue on the random property of compressed data via LZSS compression algorithm. Our test results suggest that the output of LZSS has bad randomness. We also investigate the randomization methods using the LZSS. A pseudo-random sequence generator (PRNG), L12RC4, inspired by the LZSS compression algorithm and RC4 stream cipher, was presented and implemented. The result of the NIST and Diehard test suite indicate that the L12RC4 is a good PRNG, and so it seems to be sound and may be suitable for use in some cryptographic applications. We also found that the probability distribution of the index value frequency is associated with the compression pass and INDEX_BIT_COUNT value. As for one pass mode, the greater INDEX_BIT_COUNT value, the more uniformly distributed, and the double pass mode has better uniformity than the one pass mode.

关键词： Generators NIST Indexes Probability distribution Cryptography compression algorithms Data compression

来源：评论

学校读者我要写书评

暂无评论

On the Viability of compression for Reducing the Overheads of Checkpoint/Restart-Based Fault Tolerance

On the Viability of Compression for Reducing the Overheads o...

引用

International Conference on Parallel Processing (ICPP)

作者： Dewan Ibtesham Dorian Arnold Patrick G. Bridges Kurt B. Ferreira Ron Brightwell Department of Computer Science University of New Mexico Albuquerque NM USA Scalable System Software Department Sandia National Laboratories Albuquerque NM USA

The increasing size and complexity of high performance computing (HPC) systems have led to major concerns over fault frequencies and the mechanisms necessary to tolerate these faults. Previous studies have shown that state-of-the-field checkpoint/restart mechanisms will not scale sufficiently for future generation systems. Therefore, optimizations that reduce checkpoint overheads are necessary to keep checkpoint/restart mechanisms effective. In this work, we demonstrate that checkpoint data compression is a feasible mechanism for reducing checkpoint commit latencies and storage overheads. Leveraging a simple model for checkpoint compression viability, we show: (1) checkpoint data compression is feasible for many types of scientific applications expected to run on extreme scale systems, (2) checkpoint compression viability scales with checkpoint size, (3) user-level versus system-level checkpoints bears little impact on checkpoint compression viability, and (4) checkpoint compression viability scales with application process count. Lastly, we describe the impact that checkpoint compression might have on future generation extreme scale systems.

关键词： Data compression Checkpointing Libraries Benchmark testing compression algorithms Mathematical model Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Lossless compression of electromyographic signal

Lossless compression of electromyographic signal

引用

Biomedical Engineering International Conference (BMEiCON)

作者： Phinitnan Chanasabaeng Boonying Charoen Jarin Paphangkorakit Department of Electrical Engineering Faculty of Engineering Khon Kaen University Khon Kaen Thailand Department of Oral Biology Faculty of Dentistry Khon Kaen University Khon Kaen Thailand

ISBN: (纸本)9781467348904

For long-term electromyographic (EMG) signal acquisition, data compression can be used to reduce the original data to a smaller size. This reduction decreases the bandwidth and energy used during transmission. Storing the compressed data on storage media also uses less space. This study aims to determine suitable lossless compression algorithms for EMG signal on small embedded devices. These devices have much less processing power than laboratory-sized devices thus a proper tool has to be carefully chosen. Various algorithms are studied with a set of simulated and real EMG signals. The performances of the algorithms are measured and compared. The memory requirement of the algorithms are also recorded for future reference. The result shows that the LPC based algorithms performs very well with EMG signal. The average compression ratio of these tools are 2.44. While BWT and LZMA algorithms are comparable to LPC in term of CR, these tools are very complex and have a much higher resource requirement. In this study, FLAC outperforms other compression tools with average CR of 2.61. This tool is fast and consumes slightly more resource than a much simpler scheme like SHN. For the standard LPC modeling, choosing an order of the model greater than 4 produces insignificant benefit. The simpler SHN scheme performs 4.2% better than the best LPC.

关键词： Electromyography Data compression Internet Conferences Educational institutions Prediction algorithms compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on image compression algorithm based on Rectangle Segmentation and storage with sparse matrix

Research on image compression algorithm based on Rectangle S...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Shengli Chen Xiaoxin Cheng Jiapin Xu School of Electronics and Information Engineering Sichuan University Chengdu Sichuan China

The Quarter-tree decomposition of image compression method characters with relative simplicity and fast calculation, however compression ratio is not very high. In order to overcome this flaw, one new segmentation method named the Rectangle Segmentation is proposed, in which adjacent pixel points satisfying consistency condition are viewed as the same image block. Also, without the restriction of square which abides to 2 n , the image block can be rectangle which reduces the amount of block, and improves the compression ratio. Image compression ratio can be further augmented by combining the storage method of sparse matrix. Therefore, a new image compression algorithm is proposed named the Rectangle Segmentation and Sparse Matrix Storage(RSSMS) compression algorithm. Simulation results indicate that the compression ratios of images using the new algorithm is 25.19% higher than those using the Quarter-tree decomposition method.

关键词： Image coding Image segmentation Sparse matrices Image reconstruction compression algorithms PSNR Gray-scale

来源：评论

学校读者我要写书评

暂无评论

A compression-Based Hybrid MLC/SLC Management Technique for Phase-Change Memory Systems

A Compression-Based Hybrid MLC/SLC Management Technique for ...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Hyung Gyu Lee Seungcheol Baek Jongman Kim Chrysostomos Nicopoulos School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta USA Department of Electrical and Computer Engineering University of Cyprus Nicosia Cyprus

The storage density of PCM has been demonstrated to double through the employment of Multi-Level Cell (MLC) PCM arrays. However, this increase in capacity comes at the expense of increased latency (both read and write) and decreased long-term endurance, as compared to the more conventional Single-Level Cell (SLC) PCM. These negative traits of MLCs detract from the potentially invaluable storage benefits. This paper introduces a compression-based hybrid MLC/SLC PCM management technique that aims to combine the performance edge of SLCs with the higher capacity of MLCs in a hybrid environment. Our trace-driven simulations with real application workloads demonstrate that the proposed technique achieves 3.6X performance enhancement and 72% energy reduction, on average, as compared with MLC-only configurations, while always providing the same effective capacity as the MLC-only mode.

关键词： Phase change materials Memory management Microprocessors Resistance compression algorithms Engines

来源：评论

学校读者我要写书评

暂无评论

Dynamic bounded-error data compression and aggregation in wireless sensor network

Dynamic bounded-error data compression and aggregation in wi...

引用

IEEE SENSORS

作者： Yu-Hao Chen Niang-Ying Huang Yu-Hsien Chu Meng-Han Li Ray-I Chang Chia-Hui Wang Department of Engineering Science National Taiwan University Taipei Taiwan Department of Computer Science & Information Engineering Ming Chuan University Taipei Taiwan

ISBN: (纸本)9781457717666

Energy supply is the critical issue in wireless sensor networks (WSNs), as the transmission of the data is the largest energy consumption especially. Our previous work, BEDCA, shows that the power consumption and information loss could be balanced by bounded-error compression and aggregation. The error bound is equally assigned to each node. However, this error distribution rule may be unpractical due to the node degrees incident to each sensor are not equivalent. In this paper, we propose D-BEDCA which improves BEDCA by assigning the error bound dynamically according to the structure of WSNs. It stresses on the coefficient of variation (CV) from datasets to set the fitted error bound to each node. We design four different proportions to assign the error bound for comparisons. The experiments show that the power consumption of transmission can be reduced when the error bound is assigned in according to the data correlation. When the error bound is set as 6% (the error rate is about 0.5 bit-perbyte), D-BEDCA can reduce over 47% transmission data than BEDCA.

关键词： Correlation Wireless sensor networks Tin Data compression compression algorithms Electrocardiography Data communication

来源：评论

学校读者我要写书评

暂无评论

Mother wavelet selecting method for selective mapping technique ECG compression

Mother wavelet selecting method for selective mapping techni...

引用

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON

作者： Yotaka Chompusri Kobchai Dejhan Surapun Yimman Faculty of Engineering King Mongkut's Institute of Technology Ladkmbang Thailand Faculty of Applied Science King Mongkuts University of Technology North Bangkok Thailand

The electrocardiogram compression method presented in this research processes the residual signal which is the difference between the original signal and the reference signal. The residual signal is transformed to wavelet domain and then the redundant information is eliminated in wavelet domain. The selection of mother wavelet is one of main factor to maintain the important data in wavelet domain. The difference type of mother wavelet has its own shape and its own characteristic. Therefore this affects to the performance of compression. This work compares the efficiency of compression algorithm by using difference type of Mother Wavelet. The test shows that no mother wavelet which is the best for all ECG. Thereby, reducing the time consuming for selection the proper mother wavelet, the Best of Four Method is introduced. This algorithm uses four types of mother wavelet to be competitors, `db1', `db2', `db9' and `bior2.4'. The result shows that the selected mother wavelet types have the good performance on overall tested signals. Moreover, the `db1' mother wavelet has the best performance on more than a half of all signals.

关键词： Electrocardiography Wavelet domain Biomedical engineering Discrete wavelet transforms compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Open source algorithm for storage area and temporally optimized run length coding for image compression technology used in biomedical imaging

Open source algorithm for storage area and temporally optimi...

引用

International Conference on Open Source Systems and Technologies (ICOSST)

作者： Muhammad Bilal Akhtar Qamar-ul-Islam Department of Communication Systems Engineering Institute of Space Technology Islamabad Pakistan

The objective of this paper is to prove the significance of the optimized run length coding algorithm for biomedical imaging technology and open source the idea behind the optimized algorithm in a comprehensive way. An optimized scheme for entropy encoding part of JPEG image compression by modifying the run length encoding method has been provided by the authors for a Space Research Program at Institute of Space technology (IST). The same has been observed to produce a large amount of saving in terms of memory required for Biomedical compressed images. In JPEG (Joint Photographic Experts Group) image compression algorithm run length coding performs the actual compression by removing the redundancy from transformed and quantized image data. Using the fact that the preceding processes of run length coding produces a large number of zeros the original run length coding uses an ordered pair (a, b), where `a' is the length of consecutive zeros preceding the ASCII character `b'. The proposed run length encoding scheme removes the unintended redundancy by using an ordered pair only when a zero occurs. The proposed encoding scheme does not alter the PSNR value for the algorithm. Using Matlab simulation, the proposed scheme has been tested on various biomedical images over a range of quantization (quality) factor and the results confirmed the effectiveness of the new run length encoding scheme in reducing the run length encoded data size and processing time delay.

关键词： Image coding Transform coding Quantization Discrete cosine transforms Algorithm design and analysis Biomedical imaging compression algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：