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

IEEE International Conference on Networking, Architecture and Storage (NAS 2015)

作者： Grawinkel, Matthias Mardaus, Michael Suess, Tim Brinkmann, Andre Johannes Gutenberg Univ Mainz Zentrum Datenverarbeitung Mainz Germany

ISBN: (纸本)9781467378918

Great efforts are made to store data in a secure, reliable, and authentic way in large storage systems. Specialized, system specific clients help to achieve these goals. Nevertheless, often standard tools for hashing, compressing, and encrypting data are arranged in transparent pipelines. We analyze the potential of Unix shell pipelines with several high-speed and high-compression algorithms that can be used to achieve data security, reduction, and authenticity. Furthermore, we compare the pipelines of standard tools against a house made pipeline implemented in C++ and show that there is great potential for performance improvement.

关键词： pipeline Cache Memory System piping performance boost compression algorithms master tool Unix shell potential Data Security

来源：评论

学校读者我要写书评

暂无评论

Improved quadtree algorithm based on joint coding for piecewise smooth image compression

Improved quadtree algorithm based on joint coding for piecew...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： R. Shukla P.L. Dragotti M. Do M. Vetterli Audo-Wsual Communications Lobontory Swiss Federal Institute of Technology Switzerland Ecole Polytechnique Federale de Lausanne Lausanne VD CH Audio-Visual Commun. Lab. Swiss Fed. Inst. of Technol. Lausanne Switzerland Department of EECS University of California Berkeley Berkeley CA USA

We present a novel coding algorithm based on the tree structured segmentation, which achieves oracle like rate-distortion (R-D) behavior for a simple class of signals, namely piecewise polynomials in the high bit rate regime. We consider a R-D optimization framework, which employs optimal bit allocation strategy among different signal segments to achieve the best tradeoff between description complexity and approximation quality. First, we describe the basic idea of the algorithm for the 1D case. It can be shown that the proposed compression algorithm based on an optimal binary tree segmentation achieves the oracle like R-D behavior (D(R)/spl sim/c/sub 0/2/sup -c1R/) with the computational cost of the order O(NlogN). We then show the extension of the scheme to the 2D case with the similar R-D behavior without sacrificing the computational ease. Finally, we conclude with some experimental results.

关键词： Image coding Image segmentation Bit rate Binary trees Computational efficiency Polynomials Pharmaceutical technology Rate-distortion compression algorithms Redundancy

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for high compression rates focalized on electrical power quality signals

引用

HELIYON 2021年第3期7卷 e06475页

作者： Ruiz, Milton Simani, Silvio Inga, Esteban Jaramillo, Manuel Univ Politecn Salesiana Quito Ecuador BUnivers Ferrara Ferrara Italy

This research proposes a high-performance algorithm for the compression rate of electrical power quality signals, using wavelet transformation. To manage the massive amount of data the telecommunications networks are constantly acquiring it is necessary to study techniques for data compression, which will save bandwidth and reduce costs extensively by avoiding having massive data storage facilities. First biorthogonal wavelet level six transform is applied, however after compression, the reconstructed signal will have a different amplitude and it will be shifted when compared to the original one. Then, normalization is used (for amplitude correction between the original signal and reconstructed one) by multiplying the reconstructed signal by the result of the division between the original signal maximum magnitude and the reconstructed signal maximum magnitude. Thirdly, the ripple in the reconstructed signal is eliminated by applying a moving average filter. Finally, the shifting is corrected by finding the difference between the maximum points in a cycle of the original signal and the reconstructed one. After the compression algorithm was performed the best rates are 99.803% for compression rate, RTE 99.9479%, NMSE 0.000434, and Cross-Correlation 0.999925. Finally, this works presents two new performance criteria, compression time and recovery time, both of them in a real scenario will determinate how fast the algorithm can perform.

关键词： compression algorithms Data compression Data processing Power quality (PQ) Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Algorithmic complexity of financial motions

引用

RESEARCH IN INTERNATIONAL BUSINESS AND FINANCE 2014年 30卷 336-347页

作者： Brandouy, Olivier Delahaye, Jean-Paul Ma, Lin Zenil, Hector Univ Paris 01 Sorbonne Grad Business Sch IAE Paris France Univ Lille 1 Lab Informat Fondamentale Lille Villeneuve Dascq France Univ Lille 1 Ecol Univ Management Villeneuve Dascq France Univ Paris 1 Pantheon Sorbonne IHPST Paris France Univ Sheffield Dept Comp Sci Sheffield S Yorkshire England

We survey the main applications of algorithmic (Kolmogorov) complexity to the problem of price dynamics in financial markets. Westress the differences between these works and put forward a general algorithmic framework in order to highlight its potential forfinancial data analysis. This framework is "general" in the sensethat it is not constructed on the common assumption that pricevariations are predominantly stochastic in nature. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Algorithmic information theory Kolmogorov complexity Financial returns Market efficiency compression algorithms Informationtheory randomness Price movements Algorithmic probability

来源：评论

学校读者我要写书评

暂无评论

FaceCerts

FaceCerts

引用

Data compression Conference 2003 (DCC2003)

作者： Kirovski, D Jojic, N Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)0769518966

Summary form only given. The proposed electronic systems for personal ID verification need to connect to a remote database and retrieve a stored photo for the comparison with the image on the ID. Unlike these systems, FaceCerts is an off-line person identification system that relies on public-key cryptography for provable security, while deploying a standard-quality low-cost color printing process. The basic requirement for the face compression algorithm in this system is discussed. A simple printing and scanning process combined with the face compression and matching software provides strong reliability of the FaceCerts system, resulting in relatively low likelihood of false negatives and cryptographically strong likelihood of a false positive. © 2003 IEEE.

关键词： Character recognition compression algorithms Cryptography Face detection Image coding Intrusion detection Principal component analysis Printers Printing Public key

来源：评论

学校读者我要写书评

暂无评论

Analysis the Functions of Wavelet Transform to Compress Content in Television Production 13

Analysis the Functions of Wavelet Transform to Compress Cont...

引用

13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET)

作者： Patlaenko, Nikolay OS Popovs Odessa Natl Acad Telecommun Kovalska Str 1-3 UA-65029 Odesa Ukraine

ISBN: (纸本)9786176078067

This paper provides the results of researches in a large class of wavelet transformations, in particular, were investigated such types of wavelets as Haar, Daubechies, coiflets, Mayer's, biorthogonals. Dependences of compression ratio are analyzed on the relation with a PSNR. There were objectively compared the qualitative characteristics of the compressed image with respect to traditional compression methods in terms of compression efficiency.

关键词： The wavelet transform image compression compression algorithms classification algorithms signal/noise ratio the analysis of compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Joint source-channel MMSE-decoding of speech parameters 25

Joint source-channel MMSE-decoding of speech parameters

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Heinen, S Vary, P Aachen Univ Technol Inst Commun Syst & Data Proc Aachen Germany

ISBN: (纸本)0780362934

For speech transmission in digital land mobile telephony, effective compression algorithms have to be used to achieve a high bandwidth efficiency. Furthermore, a variety of adverse transmission effects make it necessary to employ powerful error control techniques to keep bit error rates tolerable low and thus to guarantee a high speech quality. Speech compression is designed to remove irrelevancy and redundancy from the speech signal. Yet measuring the statistical properties of speech parameters extracted by practical compression schemes shows, that a considerable amount of redundancy still remains, either in terms of non-uniform distribution or due to time-correlation of parameters extracted from subsequent speech segments. In this contribution, we propose a new Minimum Mean Square Error (MMSE) decoder for block-oriented trellis codes, that is able to exploit the time-correlation of subsequent parameter sets. The decoder yields non-discrete speech parameter Mean Square (MS) estimates. Thus it combines two recently published approaches to exploit residual redundancy: Source Controlled Channel Decoding (SCCD) [1] and Soft Bit Source Decoding (SBSD) [2] in one algorithm.

关键词： VOCAL PARAMETERS redundancy decoders Speech TIME DEPENDENCE Speech transmission compression algorithms Voice Signal Mean square error correlation parameter

来源：评论

学校读者我要写书评

暂无评论

A Single-level Implementation for a Fast Direct Method of Moments Solver on Electrically Large Scattering Problems using a GPU based Reduced Singular Value Decomposition block LU Factorization

A Single-level Implementation for a Fast Direct Method of Mo...

引用

USNC-URSI Radio Science Meeting (Joint with AP-S Symposium) Proceedings

作者： Horn, M. Killian, T. Faircloth, D. IERUS Technol Huntsville AL USA

ISBN: (纸本)9781479978175

In recent years there has been considerable advancement in solving large-scale electromagnetic scattering problems using fast direct solve techniques with the traditional Rao-Wilton-Glisson (RWG) Method of Moments (MoM) computational framework, and extensions to Higher Order Basis Functions (HOBF) over curvilinear elements. The direct solve techniques are typically formulated with compression algorithms such as Adaptive-Cross-Approximation (ACA/ACA+). Early attempts for PEC bodies on the CPU (J. Shaeffer, IEEE Trans. Ant. and Prop., vol. 56, no. 8, pp. 2306?313, Aug. 2008) and dielectric composite bodies on both the CPU and GPU (M. A. Horn, T. N. Killian, and D. L. Faircloth, 2014 IEEE Ant. and Prop. Society International Symposium (APSURSI), Memphis, TN, 2014, pp. 1630?631) implemented a Single-level (SL) block clustering scheme in which ACA/ACA+ is used for compression in both the fill and block LU factorization. More recent attempts implement Multi-level (ML) block clustering schemes utilizing hierarchical matrix (H -Matrix) theory (W. Chai and D. Jiao, 2010 IEEE Ant. and Prop. Society International Symposium (APSURSI), Toronto, ON, 2010, pp. 1?). ML schemes rely on the compression preserving properties of the Reduced Singular Value Decomposition (rSVD) and thus do not employ ACA/ACA+ during block LU factorization.

关键词： METHOD OF MOMENTS Lutetium Moment of force factorization BASTION compression algorithms central processing units Singular value decomposition Scheme GRAPPER PICK UP Graphics Processing Unit Fasting INSTITUTE OF ELECTRICAL AND ELECTRONIC ENGINEERS Ants

来源：评论

学校读者我要写书评

暂无评论

Using Finite Moment Rate of Innovation for LIDAR Waveform Complexity Estimation

Using Finite Moment Rate of Innovation for LIDAR Waveform Co...

引用

44th Asilomar Conference on Signals, Systems and Computers

作者： Castorena, J. Creusere, C. D. Voelz, D. Klipsch Sch Elect & Comp Engn Las Cruces NM 88003 USA

ISBN: (纸本)9781424497218

LIDAR sensing collects data to obtain detailed topographical information about a region. A major challenge here is the large amount of data that needs to be collected for accurate surface reconstruction which in turn imposes significant storage, processing and transmission requirements. Current efforts to solve this problem have been focusing on applying compression algorithms to the range measurements. This process, however, requires the collection of large amounts of data, most of which is ultimately discarded. Instead, our approach is to apply a compressive sensing paradigm to sparsely sample the scene using the estimated pulse complexity to characterize the scene complexity, thus determining the number of samples needed for accurate reconstruction. As a first step towards this goal, we characterize here the individual laser return pulses for scenes of varying complexity, assuming that the pulses are composed by a finite number of innovations. Each scene is thus sampled at a rate that is much lower than the traditional Nyquist/Shannon limit. Our results show that accurate classifications of waveform and scene complexity with the simple nearest neighbor classifier are obtained using the proposed algorithm.

关键词： Technological Innovations waveforms Surface reconstruction Lidar Pulses compression algorithms Ranging measurements Legumes Complexity ON-SCENE large volume data Nearest neighbor Finite Data Collection Methods

来源：评论

学校读者我要写书评

暂无评论

DAC: Dedup-Assisted compression Scheme for Improving Lifetime of NAND Storage Systems 20

DAC: Dedup-Assisted Compression Scheme for Improving Lifetim...

引用

20th Conference and Exhibition on Design, Automation and Test in Europe (DATE)

作者： Park, Jisung Lee, Sungjin Kim, Jihong Seoul Natl Univ Seoul South Korea Inha Univ Incheon South Korea

ISBN: (纸本)9783981537093

Thanks to an aggressive scaling of semiconductor devices, the capacity of NAND flash-based solid-state-drives (SSDs) has increased greatly. However, this benefit comes at the expense of a serious degradation of NAND device's lifetime. In order to improve the lifetime of flash-based SSDs, various data reduction techniques, such as deduplication, lossless compression, and delta compression, are rapidly adopted to SSDs. Although each technique has been extensively studied, efficiently combining these techniques in a synergistic fashion was not thoroughly investigated. In this paper, we propose a novel dedup-assisted compression (DAC) scheme that integrates existing data reduction techniques so that potential benefits of individual ones can be maximized while overcoming their inherent limitations. By doing so, DAC greatly reduces the amount of write traffic sent to SSDs. DAC also requires negligible resources by utilizing existing hardware modules. Our evaluation results show that the proposed DAC decreases the amount of written data by up to 30% over a simple integration of deduplication and lossless compression.

关键词： Entropy Hardware Encoding Engines compression algorithms Pattern matching Data compression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：