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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,068 篇 compression algo...
642 篇 image coding
489 篇 data compression
282 篇 encoding
218 篇 decoding
216 篇 transform coding
203 篇 algorithm design...
164 篇 dictionaries
154 篇 bandwidth
148 篇 video compressio...
142 篇 computer science
140 篇 hardware
130 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
108 篇 bit rate
99 篇 quantization
98 篇 costs
98 篇 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,042 篇 英文
14 篇 中文
12 篇 其他

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

共 2068 条记录，以下是2051-2060 订阅

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

详细简洁

排序：

H-Tree: A data structure for fast path-retrieval in rooted trees.

H-Tree: A data structure for fast path-retrieval in rooted t...

引用

Current Trends in Computer Science (ENC), Mexican International Conference on

作者： Akram Shehadi Saynez Maria Josefa Somodevilla Manuel Martin Ortiz Ivo H. Pineda Facultad de Ciencias de la Computación Benemérita Universidad Autónoma de Puebia Puebla Mexico

When repeatedly searching on a depth-first or breath-first search fashion, some nodes are visited many times, as every search requires to start at the root. By providing a way to arrange the data in a different manner and using a hash table as the primary data structure, it is possible to get average lookup times of a path, from the root to any node in constant time, although a disadvantage arises when looking at the memory needs of the approach. We propose a structure called H-tree created to reduce the time to extract a path from a rooted tree.

关键词： Tree data structures Cities and towns Data mining Huffman coding Legged locomotion Computer science Data structures Algorithm design and analysis compression algorithms Buildings

来源：评论

学校读者我要写书评

暂无评论

Data warehousing of vehicle trajectory

Data warehousing of vehicle trajectory

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Baicheng Tang Guicheng Shen Cailin Zhang School of information Beijing Wuzi University Beijing Beijing Province China

ISBN: (纸本)9781479983544

With the rising number of vehicles equipped with GPS system, a lot of vehicle trajectories are produced every day. At present researchers begin to study the vehicles' trajectory data. But the current trajectory compression technology cannot be very simple and will lose much information. Therefore, this paper puts forward a data warehousing design of vehicle trajectory. It can store compressed vehicle trajectory, simplify the data volume, and save the feature points. Thus, it provides a sound base for finding useful information from vehicle trajectory.

关键词： Vehicles Trajectory Data warehouses Roads Global Positioning System compression algorithms Data mining

来源：评论

学校读者我要写书评

暂无评论

IP header translation protocol design and implementation to a post wireless network service

IP header translation protocol design and implementation to ...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Jong Tak Park Dae In Choi Su Yeon Kim Hyun K Kahng Department of Electronic & Information Engineering Korea University Seoul South Korea MOBILAB(Mobile Lab) Daegu South Korea

The use of wireless internet increased rapidly due to the wireless network technology development such as Wibro, LTE and the extension supply of wireless terminals. A special quality of wireless network that is used by many people in an Access-Point increased overhead and lowered the service quality. When we look at All-IP network realization based on a single protocol and transition of address system to IPv6, the problem becomes more serious. To address these issues, many header compression algorithms have been proposed over decades. However, the past Header compression algorithms are not suitable for the current wireless environment. The proposed ROHC has problems that an increased demand for computing power by increasing complexity of the compression algorithms. In this paper, our proposal is that we can reduce overhead and increase efficiency of network by contracting IP header through IP header translation in a gateway. In order to test this proposal, we implemented a Testbed in which we conducted the experiment in the 802.11b wireless with 11Mbps. Then we compared the results to efficiency along with IP payload size. The results shows that we can reduce the transmission delay time by 67.9% and improve network efficiency by 42.54%. In the event that this suggestion applies to IPv6, we can expect more positive effect.

关键词： IP networks Protocols Payloads Wireless networks Logic gates compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Length of minimal forbidden words on a stationary ergodic source

Length of minimal forbidden words on a stationary ergodic so...

引用

IEEE International Symposium on Information Theory

作者： Takahiro Ota Hiroyoshi Morita Department of Electronic Engineering Nagano Prefectural Institute of Technology Ueda Nagano Japan Graduate School of Information Systems University of Electro-Communications Chofu Tokyo Japan

An anti-dictionary is in particular useful for data compression, and it consists of minimal forbidden words for a given string. We derive the average length M n of minimal forbidden words in strings of length n under a stationary ergodic source with entropy H which takes values on a finite alphabet. For the string length n, we prove, log n/M n = H, in probability, as n rarr infin. We use the Wyner-Ziv result, with respect to connection between entropy and recurrence-time for ergodic processes, to prove the theorem. Its validity is shown by simulation results on a memoryless binary information source.

关键词： Data compression Entropy Arithmetic Data engineering Information systems compression algorithms Automata Assembly Video compression Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Mining Circuit Lower Bound Proofs for Meta-algorithms

Mining Circuit Lower Bound Proofs for Meta-algorithms

引用

Annual IEEE Conference on Computational Complexity

作者： Ruiwen Chen Valentine Kabanets Antonina Kolokolova Ronen Shaltiel David Zuckerman School of Computing Science Simon Fraser University Burnaby BC Canada Dept. of Computer Science Memorial University of Newfoundland St. John's NL Canada Dept. of Computer Science University of Haifa Haifa Israel Dept. of Computer Science University of Texas Austin TX USA

We show that circuit lower bound proofs based on the method of random restrictions yield non-trivial compression algorithms for “easy” Boolean functions from the corresponding circuit classes. The compression problem is defined as follows: given the truth table of an n-variate Boolean function f computable by some unknown small circuit from a known class of circuits, find in deterministic time poly(2 n ) a circuit C (no restriction on the type of C) computing f so that the size of C is less than the trivial circuit size 2 n /n. We get nontrivial compression for functions computable by AC 0 circuits, (de Morgan) formulas, and (read-once) branching programs of the size for which the lower bounds for the corresponding circuit class are known. These compression algorithms rely on the structural characterizations of “easy” functions, which are useful both for proving circuit lower bounds and for designing “meta-algorithms” (such as Circuit-SAT). For (de Morgan) formulas, such structural characterization is provided by the “shrinkage under random restrictions” results [52], [21], strengthened to the “high-probability” version by [48], [26], [33]. We give a new, simple proof of the “high-probability” version of the shrinkage result for (de Morgan) formulas, with improved parameters. We use this shrinkage result to get both compression and #SAT algorithms for (de Morgan) formulas of size about n 2 . We also use this shrinkage result to get an alternative proof of the recent result by Komargodski and Raz [33] of the average-case lower bound against small (de Morgan) formulas. Finally, we show that the existence of any non-trivial compression algorithm for a circuit class C ⊆ P/poly would imply the circuit lower bound NEXP ⊈ C. This complements Williams's result [55] that any non-trivial Circuit-SAT algorithm for a circuit class C would imply a superpolynomial lower bound against C for a language in NEXP1.

关键词： Algorithm design and analysis Boolean functions compression algorithms Generators Educational institutions Partitioning algorithms Cryptography

来源：评论

学校读者我要写书评

暂无评论

A compact representation for stereoscopic sequences with NTSC spectral compatibility

A compact representation for stereoscopic sequences with NTS...

引用

International Conference on Pattern Recognition

作者： F. Labonte C.T. Le Dinh P. Cohen Perception and Robotics Laboratory Ecole Polytechnique de Montreal Canada

This paper describes a new compression method for interlaced stereoscopic image sequences, which compacts the stereo information into the spectral space of a single NTSC channel. The left and right fields of the stereoscopic pairs are each decomposed into a lowpass and a highpass components. High-frequency components are limited to an area of fixation, thus allowing a reduction of their spectral extent. A composite video signal is then formed by positioning the different components in the available spectral space through filtering and modulation. Compatibility of the produced signal with the NTSC standard is ensured by using the same spectral region for the chrominance information and the same colour subcarrier. Good quality results are obtained with relatively simple 2D separable spatial filters at a reasonable computational cost.

关键词： Layout Image coding compression algorithms Spatial resolution Image sequences Telerobotics Humans Orbital robotics Laboratories Filtering

来源：评论

学校读者我要写书评

暂无评论

Bit-plane Golomb coding for sources with Laplacian distributions

Bit-plane Golomb coding for sources with Laplacian distribut...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： R. Yu C.C. Ko S. Rahardja X. Lin ASTAR Laboratories for Information Technology Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Laboratories for Information Technology Agency for Science Technology and Research Singapore

This paper presents a bit-plane coding algorithm for Laplacian distributed sources that are commonly encountered in signal compression applications. By exploiting the statistical characteristics of the sources, the proposed algorithm achieves a rate-distortion performance that is essentially comparable to an optimal nonscalable scalar quantizer, while at the same time operates at a complexity level suitable for most practical implementations.

关键词： Laplace equations Image coding Scalability Video compression Laboratories Information technology Application software Rate-distortion compression algorithms Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Mining Frequent Itemsets

An Algorithm for Mining Frequent Itemsets

引用

International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)

作者： Raudel Hernandez Leon Airel Perez Suarez Claudia Feregrino Uribe Zobeida Jezabe Guzman Zavaleta Advanced Technologies Application Center CENATAV CUBA Optics and Electronics National Institute for Astrophysics INAOE MEXICO Instituto Nacional de Astrofisica Optica y Electronica Puebla Puebla MX National Institute for Astrophysics Optics and Electronics INAOE MEXICO

In this paper, we propose a new algorithm for mining frequent itemsets. This algorithm is named AMFI (Algorithm for Mining Frequent Itemsets). This algorithm compresses the data while maintaining the necessary semantics for the frequent itemsets mining problem and it is more efficient that traditional compression algorithms. The AMFI efficiency is based on a compressed vertical binary representation of the data and on a very fast support count. AMFI performs a breadth first search through equivalence classes. We compare our proposal with an implementation using PackBits algorithm.

关键词： Data mining Itemsets compression algorithms Electronic mail Dairy products Iterative algorithms Optical computing Automatic control Astrophysics Proposals

来源：评论

学校读者我要写书评

暂无评论

Competitive learning/reflected residual vector quantization for coding angiogram images

Competitive learning/reflected residual vector quantization ...

引用

IEEE International Conference on Image Processing

作者： W.A.H. Mourn H. Al-Duwaish M.A.U. Khan Dept. of Electr. Eng. King Fahd Univ. of Pet. & Miner. Dhahran Saudi Arabia Department of Electrical Engineering King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

Medical images need to be compressed for the purpose of storage/transmission of a large volume of medical data. Reflected residual vector quantization (RRVQ) has emerged recently as one of the computationally cheap compression algorithms. RRVQ, which is a lossy compression scheme, was introduced as an alternative design algorithm for residual vector quantization (RVQ) structure (a structure famous for providing progressive quantization). However, RRVQ is not guaranteed to reach global minimum. It was found that it has a higher probability to diverge when used with nonGaussian and nonLaplacian image sources such as angiogram images. By employing competitive learning neural network in the codebook design process, we tried to obtain a stable and convergent algorithm. This paper deals with employing competitive learning neural network in RRVQ design algorithm that results in competitive learning RRVQ algorithm for the RVQ structure. Simulation results indicate that the new proposed algorithm is indeed convergent with high probability and provides peak signal-to-noise ratio (PSNR) of approximately 32 dB for an-giogram images at an average encoding bit rate of 0.25 bits per pixel.

关键词： Vector quantization Image coding Algorithm design and analysis Biomedical imaging Image storage Neural networks Image converters PSNR compression algorithms Process design

来源：评论

学校读者我要写书评

暂无评论

Software and Hardware Integrated Accelerators for Hadoop Appliance

Software and Hardware Integrated Accelerators for Hadoop App...

引用

International Conference on Applied Machine Learning (ICAML)

作者： Yuan Meng Jun Yang Jun Li Shengkai Wang Xiao Zhang School of Information Science and Engineering Yunnan University Kunming Yunnan China

ISBN: (纸本)9781665421263

With the development of the Internet, the data center for next-generation must be capable of data processing at PB/s level, ensuring a high throughput of the storage and network. This paper displays the design of the hardware accelerator for tuning the throughput of the storage and network. First, we illustrate the importance of a lossless data compression algorithm for data-intense applications based on the analysis of the characteristics of the Hadoop distributed system. Second, we effectively implement Deflate compression algorithm on the FPGA. The experimental results show that the compression speed of the Deflate compression algorithm hardware accelerator can reach 2.44 Gb/S, and the compression ratio is 2.08 on the Calgary standard evaluation set. Finally, we propose a hardware/software integration architecture to combine Deflate compression algorithm hardware accelerator and Hadoop distributed system. This architecture also incorporated the unique design of semaphore and shared-memory mechanism. The overall design can double the performance of a single mapping process and retain good scalability.

关键词： Scalability Computer architecture Throughput Software compression algorithms Hardware acceleration Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共207页 << < 198 199 200 201 202 203 204 205 206 207 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：