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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,075 篇 compression algo...
647 篇 image coding
492 篇 data compression
283 篇 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,048 篇 英文
14 篇 中文
13 篇 其他

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

共 2075 条记录，以下是841-850 订阅

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

详细简洁

排序：

Multiresolution distance volumes for progressive surface compression

Multiresolution distance volumes for progressive surface com...

引用

International Symposium on 3D Data Processing Visualization and Transmission

作者： D. Laney M. Bertram M. Duchaineau N. Max U.C. Davis Department of Applied Science University of California Davis USA University of Kaiserslautern Kaiserslautern Germany Lawrence Livemore National Laboratory Livermore CA USA U.C. Davis Department of Applied Science

We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topology and arbitrary numbers of components within a single multiresolution data structure. This data structure elegantly handles topological modification at high compression rates. Our method does not require the costly and sometimes infeasible base mesh construction step required by subdivision surface approaches. We present several improvements over previous attempts at compressing signed-distance functions, including an O(n) distance transform, a zero set initialization method for triangle meshes, and a specialized thresholding algorithm. We demonstrate the potential of sampled distance volumes for surface compression and progressive reconstruction for complex high genus surfaces.

关键词： Surface reconstruction Surface waves Topology Wavelet coefficients Data structures compression algorithms Encoding Spline Laboratories Visualization

来源：评论

学校读者我要写书评

暂无评论

Deployment of IPv6 robust header compression profiles 1 and 2

Deployment of IPv6 robust header compression profiles 1 and ...

引用

Mexican International Conference on Computer Science (ENC)

作者： A. Minaburo L. Toutain L. Nuaymi ENST de bretagne Rennes France

The use of interactive services in a low bandwidth link leads to a weak performance because of the large size of encapsulations. The performance could be increased using a header compression algorithm. The IETF ROHC working group has defined a new header compression algorithm used in low bandwidth links with high-level errors. This paper gives a description of the proposed infrastructure for ROHC and the differences between the profile 1 and profile 2 based profiles that are used. The results are based on our IPv6 ROHC implementation.

关键词： Robustness compression algorithms Redundancy Bandwidth Radio link Land mobile radio cellular systems Transport protocols TCPIP Bit error rate Encapsulation

来源：评论

学校读者我要写书评

暂无评论

An MCMC Approach to Lossy compression of Continuous Sources

An MCMC Approach to Lossy Compression of Continuous Sources

引用

Data compression Conference (DCC)

作者： Dror Baron Tsachy Weissman Electrical Engineering Department Technion-Israel Institute of Technology Haifa Israel Department of Electrical Engineering University of Stanford Stanford CA USA

ISBN: (纸本)9781424464258

Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on a finite reproduction alphabet that grows with the input length. Our algorithm asymptotically achieves the optimum rate distortion (RD) function universally for stationary ergodic continuous amplitude sources. However, the large alphabet slows down the convergence to the RD function, and is thus an impediment in practice. We thus propose an MCMC-based algorithm that uses a (smaller) adaptive reproduction alphabet. In addition to computational advantages, the reduced alphabet accelerates convergence to the RD function, and is thus more suitable in practice.

关键词： Image coding Convergence compression algorithms Statistical distributions Rate-distortion Impedance Acceleration Vector quantization Entropy coding Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

compression Techniques Used in Iot: A Comparitive Study

Compression Techniques Used in Iot: A Comparitive Study

引用

International Conference on New Trends in Computing Sciences (ICTCS)

作者： Salam Hamdan Arafat Awaian Sufyan Almajali Princess Sumaya University for Tecnology Amman Jordan

Due to the improvement of technology, most of the devices used nowadays are connected to the internet, therefore a huge amount of data is generated, transmitted, and used by these devices. In general, these devices are limited in resources such as memory, processors, and battery lifetime. Reducing the data size reduces the energy required to process this data, minimizes the storage of this, data and the energy required to transmit this data. The need for applying data compression techniques on these devices will come in handy. This paper provides a survey and a comparative study among most commonly used IoT compression techniques. The study addresses the techniques in terms of different attributes such as the compression type, lossless or lossy, the limitations of the compression technique, the location of where the compression is applied, and the implementation of the compression technique.

关键词： Data compression Batteries compression algorithms Temperature dependence Servers Indexes Machine learning

来源：评论

学校读者我要写书评

暂无评论

Dictionary-based English text compression using word endings

Dictionary-based English text compression using word endings

引用

Data compression Conference (DCC)

作者： Jeehong Yang Serap A. Savari EECS Department University of Michigan Ann Arbor MI USA

In this paper, we propose an dictionary-based English text compression algorithm; we name it star word ending (StarWE) because of certain similarities to the StarNT algorithm. Furthermore, StarWE borrows techniques that are used in WRT such as EOL coding, punctuation mark modeling, and n-gram matching. The main difference between StarWE and StarNT is in the division of the external dictionary; StarWE divides it by word endings so that the compressor would be able to obtain some of the tag information

关键词： Dictionaries compression algorithms Frequency Data compression

来源：评论

学校读者我要写书评

暂无评论

Optimization of the compression Ratio of the Modified Algorithm of Decomposition Electromyographic Signals by a Superimposed Coding

Optimization of the Compression Ratio of the Modified Algori...

引用

International IEEE Conference on Signal-Image Technologies and Internet-Based System

作者： Aimé Joseph Oyobé-Okassa Pierre Elé EPM of Masuku Franceville Gabon

The purpose of the compression is the minimization of the data storage space, the transmission time or the bandwidth. If the wavelets and specifically wavelets packets bases provide an appropriate framework for the selection of an optimal representation of electromyographic (EMG) signals, the choice of encoding method optimizes the compression ratio without altering the compressed data. In compression, it is usual to fix as goal either a compression ratio to achieve or a minimum acceptable quality of the reconstructed signal. In this work, the novelty is that we have obtained the compression ratio without fixing anything, and the results obtained are better than those given by the modified compression algorithm proposed in [6] as association of coding methods was not used there.

关键词： Electromyography Discrete wavelet transforms Channel coding compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Integrating Online compression to Accelerate Large-Scale Data Analytics Applications

Integrating Online Compression to Accelerate Large-Scale Dat...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Tekin Bicer Jian Yin David Chiu Gagan Agrawal Karen Schuchardt Computer Science and Engineering Ohio State University USA Pacific Northwest National Laboratories USA Washington State University USA

ISBN: (纸本)9781467360661

Compute cycles in high performance systems are increasing at a much faster pace than both storage and wide-area bandwidths. To continue improving the performance of large-scale data analytics applications, compression has therefore become promising approach. In this context, this paper makes the following contributions. First, we develop a new compression methodology, which exploits the similarities between spatial and/or temporal neighbors in a popular climate simulation dataset and enables high compression ratios and low decompression costs. Second, we develop a framework that can be used to incorporate a variety of compression and decompression algorithms. This framework also supports a simple API to allow integration with an existing application or data processing middleware. Once a compression algorithm is implemented, this framework automatically mechanizes multi-threaded retrieval, multi-threaded data decompression, and the use of informed prefetching and caching. By integrating this framework with a data-intensive middleware, we have applied our compression methodology and framework to three applications over two datasets, including the Global Cloud-Resolving Model (GCRM) climate dataset. We obtained an average compression ratio of 51.68%, and up to 53.27% improvement in execution time of data analysis applications by amortizing I/O time by moving compressed data.

关键词： Prefetching compression algorithms Data models Middleware Meteorology Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Entropy Adaptive On-Line compression

Entropy Adaptive On-Line Compression

引用

IEEE International Symposium on Network Computing and Applications

作者： Shlomi Dolev Sergey Frenkel Marina Kopeetsky Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva Israel Institute of Informatics Problems Russian Academy of Sciences Moscow Russia Department of Software Engineering Shamoon College of Engineering Beer-Sheva Israel

Self-Organization is based on adaptivity. Adaptivity should start with the very basic fundamental communication tasks such as encoding the information to be transmitted or stored. Obviously, the less signal transmitted the less energy in transmission used. In this paper we present a novel on-line and entropy adaptive compression scheme for streaming unbounded length inputs. The scheme extends the window dictionary Lempel-Ziv compression, is adaptive and is tailored to on-line compress inputs with non stationary entropy. Specifically, the window dictionary size is changed in an adaptive manner to fit the current best compression rate for the input. On-line Entropy Adaptive compression scheme (EAC), that is introduced and analyzed in this paper, examines all possible sliding window sizes over the next input portion to choose the optimal window size for this portion, a size that implies the best compression ratio. The size found is then used in the actual compression of this portion. We suggest an adaptive encoding scheme, which optimizes the parameters block by block, and base the compression performance on the optimality proof of Lempel Ziv algorithm when applied to blocks. The EAC scheme was tested over files of different types (docx, ppt, jpeg, xls) and over synthesized files that were generated as segments of homogeneous Markov Chains. Our experiments demonstrate that the EAC scheme typically provides a higher compression ratio than LZ77 does, when examined in the scope of on-line per-block compression of transmitted (or compressed) files.

关键词： Entropy Dictionaries Encoding Data compression compression algorithms Training Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Level Steganography Aided with compression

Multi-Level Steganography Aided with Compression

引用

International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)

作者： Mohamed Yousif Elmahi Talat M.Wahbi Computer Scinece Deparment University of El Imam El Mahdi Kosti Sudan Computer Scinece Deparment Sudan University of Science and Technology Khartoum Sudan

ISBN: (数字)9781728110066

ISBN: (纸本)9781728110073

Steganography is one of the information hiding Techniques that hide a message inside another message without drawing any suspicion. In this research, multilevel steganography techniques proposed with two levels, level one text steganography, and level two is image steganography. In level, one uses a new approach that is based on the Pseudo-Random Number Generation (PRNG) to embed the secret message into a Cover-text that generated randomly. Level Two uses a cover image to embed the message by using the LSB insertion technique that produces the Stego-image. Between these levels, the compression process (Huffman compression Algorithm) reduces the size of level one output and passed to level two. The model uses two secret keys at both ends for authentication. At the receiver side, different reverse operations have been carried out to get back the original information. A lot of experiment to test a variety of measurements such as the capacity and quality of the proposed model showed.

关键词： Image coding compression algorithms Receivers Mathematical model PSNR Linguistics Image quality

来源：评论

学校读者我要写书评

暂无评论

Less is more: Increasing the scope of hardware debugging with compression

Less is more: Increasing the scope of hardware debugging wit...

引用

Panhellenic Conference on Electronics and Telecommunications (PACET)

作者： Fotis Kostarelos George Charitopoulos Dionisios N. Pnevmatikatos School of Electrical and Computer Engineering Technical University of Crete Chania Greece

ISBN: (纸本)9781538622889

In this work we consider the slow and tedious phase of hardware debugging in FPGAs. The process of hardware debugging is normally done via Internal Logic Analyzer (ILA) circuits, which add user observability in internal FPGA signals. The user first defines the target for debugging signal and a triggering condition. Then the ILA stores traces of it in trace buffers, these traces are finally transferred to a host PC for the user to observe. The user also has to consider the limited FPGA memory resources, which result in small-sized trace buffers, an important restriction of hardware debugging. In this paper, we attempt to increase the scope of hardware tracing, i.e. the number of samples written on the trace buffers, with the use of compression. We use the LZW algorithm and find that we can increase the debugging signals number of recorded samples by 90%, i.e. have double the amount of useful data with the same memory usage. On the memory plane we conclude that, for the same number of recorded samples, our architecture uses less than half the resources compared to the standard Xilinx ILA block for signal tracing.

关键词： Debugging Hardware Dictionaries compression algorithms Field programmable gate arrays Data compression Memory management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：