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

ACM/IEEE Symposium Architecture for Networking and Communications Systems, ANCS

作者： Eric Norige Alex X. Liu Eric Torng Dept. of Computer Science and Engineering Michigan State University East Lansing Michigan USA

ISBN: (纸本)9781479916405

Packet classification is the key mechanism for enabling many networking and security services. Ternary Content Addressable Memory (TCAM) has been the industrial standard for implementing high-speed packet classification because of its constant classification time. However, TCAM chips have small capacity, high power consumption, high heat generation, and large area size. This paper focuses on the TCAM-based Classifier compression problem: given a classifier C, we want to construct the smallest possible list of TCAM entries T that implement C. In this paper, we propose the Ternary Unification Framework (TUF) for this compression problem and three concrete compression algorithms within this framework. The framework allows us to find more optimization opportunities and design new TCAM-based classifier compression algorithms. Our experimental results show that the TUF can speed up the prior algorithm TCAM Razor by twenty times or more and leads to new algorithms that improve compression performance over prior algorithms by an average of 13.7% on our largest real life classifiers.

关键词： Data structures Boolean functions Merging Algorithm design and analysis compression algorithms IP networks Power demand

来源：评论

学校读者我要写书评

暂无评论

Compressibility variations of JPEG2000 compressed computed tomography

Compressibility variations of JPEG2000 compressed computed t...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Jean-Francois Pambrun Rita Noumeir Department of Electrical Engineering Ecole de technologie superieure (ETS)

ISBN: (纸本)9781457702150

compression is increasingly used in medical applications to enable efficient and universally accessible electronic health records. However, lossy compression introduces artifacts that can alter diagnostic accuracy, interfere with image processing algorithms and cause liability issues in cases of diagnostic errors. compression guidelines were introduced to mitigate these issues and foster the use of modern compression algorithms with diagnostic imaging. However, these guidelines are usually defined as maximum compression ratios for each imaging protocol and do not take compressibility variations due to image content into account. In this paper we have evaluated the compressibility of thousands of computed tomography slices of an anthropomorphic thoracic phantom acquired with different parameters. We have shown that exposure, slice thickness and reconstruction filters have a significant impact on compressibility suggesting that guidelines based solely on compression ratios may be inadequate.

关键词： Compressibility compression ratio JPEG X-Ray Computed Tomography reconstruction filter compression algorithms image processing algorithm Imaging Phantom diagnosis quality/standard

来源：评论

学校读者我要写书评

暂无评论

Identifying User Authentication Methods on Connections for SSH Dictionary Attack Detection

Identifying User Authentication Methods on Connections for S...

引用

IEEE Annual Computer Software and Applications Conference Workshops (COMPSACW)

作者： Akihiro Satoh Yutaka Nakamura Takeshi Ikenaga Kyushu Institute of Technology Kitakyushu Japan

A dictionary attack against SSH is a common security threat. Many published ways rely on network traffic to detect SSH dictionary attacks. This is because the connections of remote login, file transfer, and TCP/IP forwarding are visibly distinct from those of the attacks. However these ways incorrectly consider the connections of automated tasks as those of the attacks because of the mutual similarities. In this paper, we propose a new approach to identify user authentication methods on SSH connections and to remove connections that employ non-keystroke based authentication. This approach rests on two perspectives: (1) an SSH dictionary attack targets a host that provides keystroke based authentication, (2) automated tasks through SSH need to support non-keystroke based authentication. Thus, our proposal contributes to improvement in the detection accuracy of SSH dictionary attacks.

关键词： Authentication Protocols Dictionaries Ciphers Public key compression algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

Development of high performance wireless sensor node for acoustic applications

Development of high performance wireless sensor node for aco...

引用

IEEE International Conference on Green High Performance Computing (ICGHPC)

作者： A Arul Prabahar Centre for Development of Advanced Computing Juhu Maharashtra IN

This paper describes a design of wireless sensor network node (WSN node) for the purpose of voice based applications. For implementing voice based WSN, wireless sensor nodes should be capable of capturing voice, processing it and transmitting it over RF (Radio Frequency) channel. Common WSN applications handle few bytes of data over wireless network. Acoustic WSN applications deal with high data rate voice. Acoustic WSN applications require high performance WSN nodes to accomplish capturing and processing voice. This paper explains how to make high performance WSN nodes by incorporating Digital Signal Processing (DSP) chip with the WSN node and how to implement suitable speech processing algorithm on it. The bottle neck arisen due to usage of DSP chip on WSN node is high power consumption. The techniques which are adopted to reduce the power consumption of DSP chip are described in this paper. The design of hardware is based on ultra low power DSP chip to improve the battery operating time of the WSN node.

关键词： Wireless sensor networks Digital signal processing Speech Batteries Speech coding compression algorithms Codecs

来源：评论

学校读者我要写书评

暂无评论

ZipStream: Improving dependability in dynamic partial reconfiguration

ZipStream: Improving dependability in dynamic partial reconf...

引用

International Design and Test Workshop

作者： Stefano Di Carlo Giulio Gambardella Trong Huynh Bao Paolo Prinetto Daniele Rolfo Pascal Trotta Politecnico di Torino Dipartimento di Automatica e Informatica Torino Italy

Dynamic Partial Reconfiguration allows to dynamically change the behaviour of a portion of the FPGAs by downloading new information in the configuration memory of the device. Since modern Systems-on-Programmable-Chips (SoPCs) make extensive use of this feature, many reconfigurable area are placed in the device, with several configurations for each area. This comes at a cost in terms of dependability of the system and of memory occupation. The proposed methodology focuses on increasing the dependability of partially reconfigurable systems by safely storing compressed configuration data inside the FPGA.

关键词： Field programmable gate arrays Encoding Decoding Hardware Table lookup compression algorithms Software

来源：评论

学校读者我要写书评

暂无评论

Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm

Effective Variable-Length-to-Fixed-Length Coding via a Re-Pa...

引用

Data compression Conference (DCC)

作者： Satoshi Yoshida Takuya Kida Graduate School of Information Science and Technology Hokkaido University Sapporo Japan

Summary form only given. We address the problem of improving variable-length-to-fixed-length codes (VF codes). A VF code is an encoding scheme that uses a fixed-length code, and thus, one can easily access the compressed data. However, conventional VF codes usually have an inferior compression ratio to that of variable-length codes. Although a method proposed by T. Uemura et al. in 2010 achieves a good compression ratio comparable to that of gzip, it is very time consuming. In this study, we propose a new VF coding method that applies a fixed-length code to the set of rules extracted by the Re-Pair algorithm, proposed by N. J. Larsson and A. Moffat in 1999. The Re-Pair algorithm is a simple off-line grammar-based compression method that has good compression-ratio performance with moderate compression speed. Moreover, we present several experimental results to show that the proposed coding is superior to the existing VF coding.

关键词： Pattern matching Encoding Educational institutions Data compression Information science compression algorithms Workstations

来源：评论

学校读者我要写书评

暂无评论

Saving Time in a Program Robustness Evaluation

Saving Time in a Program Robustness Evaluation

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Joao Gramacho Dolores Rexachs Emilio Luque Computer Architecture and Operating Systems Department Universitat Autònoma de Barcelona Barcelona Spain

ISBN: (纸本)9781479914449

The risk of having a program execution corrupted by transient faults is growing as computer processors are using more transistors, are becoming denser and are operating at lower voltages. This risk is multiplied when we take into account High Performance Computing with its hundreds or thousands of processors working together to solve a single problem. To evaluate how program executions behave in presence of transient faults we have proposed the concept of robustness against transient faults. This concept can be used to determine the more significant parts of a program with respect to the risk of misbehavior by transient faults for further study of improvement. The robustness concept can also be used as a metric to compare different approaches applied to a program to make it less likely of producing corrupted results. In this work we present why and how is possible to simplify a fraction of a program's robustness by taking into account the repetition of sequences of instructions. The simplified analysis obtains the exact same result as a full program robustness evaluation (exhaustively and without estimations). By simplifying the analysis we were able to reduce in up to 192 times our previously published robustness analysis time and also were able to evaluate larger programs in feasible time (unimaginable by using executions in a fault injection capable environment).

关键词： Robustness Transient analysis Registers Program processors Computer architecture compression algorithms Absorption

来源：评论

学校读者我要写书评

暂无评论

Lossless Embedded compression Algorithm with Context-based Error Compensation for Video Application

Lossless Embedded Compression Algorithm with Context-based E...

引用

IEEE 16th International Symposium on Consumer Electronics (ISCE)

作者： Jeong, Hyerim Kim, Jaehyun Lee, Kyohyuk Yoo, Kiwon Kim, Jaemoon Samsung Elect DMC R&D Ctr Suwon South Korea

ISBN: (纸本)9781467313568

With the increase of image resolution in video application, the memory bandwidth is a critical problem in video coding. An embedded compression algorithm is a technique that can compress the frame data when stored in memory. It is possible to reduce memory requirements. In this paper, we propose a lossless embedded compression algorithm with context-based error compensation to reduce the memory bandwidth requirement. Experimental results have shown at least 50% memory bandwidth reduction on average and the data reduction ratio of the proposed algorithm is up to 5% higher than previously proposed lossless embedded compression algorithm [2].

关键词： compression algorithms Error compensation memory bandwidth image resolution Lossless embedding Videotapes deceleration rate memory requirements

来源：评论

学校读者我要写书评

暂无评论

Learning Based Screen Image compression

Learning Based Screen Image Compression

引用

14th IEEE International Workshop on Multimedia Signal Processing (MMSP)

作者： Yang, Huan Lin, Weisi Deng, Chenwei Nanyang Technol Univ Sch Comp Engn Singapore Singapore

ISBN: (纸本)9781467345729

There are usually two components in computer screen images: textual and pictorial parts. The pictorial part can be compressed efficiently by classical coding approaches (e. g. JPEG, JPEG2000), while the compression of the textual part is still far away from being satisfactory for the reason that the textual content is usually of high-frequency. In this paper, a learning approach is used to construct a tailored dictionary for text representation. Based on the learned dictionary, a novel screen image compression algorithm is proposed through adopting different basis functions for the textual and pictorial components respectively. The screen images are firstly segmented into textual and pictorial parts. Then we employ traditional discrete cosine transformation (DCT) to facilitate the compression of pictorial part, while the learned dictionary is used to represent the textual part in screen images. Experimental results demonstrate the effectiveness of the proposed compression algorithm.

关键词： Screen text representation compression algorithms Dictionaries as Topic Image compression Data compression JPEG compression image compression algorithm High frequency images

来源：评论

学校读者我要写书评

暂无评论

Dynamic-CoMPI: dynamic optimization techniques for MPI parallel applications

引用

JOURNAL OF SUPERCOMPUTING 2012年第1期59卷 361-391页

作者： Filgueira, Rosa Carretero, Jesus Singh, David E. Calderon, Alejandro Nunez, Alberto Univ Carlos III Madrid Dept Comp Sci Madrid Spain

This work presents an optimization of MPI communications, called Dynamic-CoMPI, which uses two techniques in order to reduce the impact of communications and non-contiguous I/O requests in parallel applications. These techniques are independent of the application and complementaries to each other. The first technique is an optimization of the Two-Phase collective I/O technique from ROMIO, called Locality aware strategy for Two-Phase I/O (LA-Two-Phase I/O). In order to increase the locality of the file accesses, LA-Two-Phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal I/O data communication schedule. The main purpose of this technique is the reduction of the number of communications involved in the I/O collective operation. The second technique, called Adaptive-CoMPI, is based on run-time compression of MPI messages exchanged by applications. Both techniques can be applied on every application, because both of them are transparent for the users. Dynamic-CoMPI has been validated by using several MPI benchmarks and real HPC applications. The results show that, for many of the considered scenarios, important reductions in the execution time are achieved by reducing the size and the number of the messages. Additional benefits of our approach are the reduction of the total communication time and the network contention, thus enhancing, not only performance, but also scalability.

关键词： MPI library Parallel techniques Clusters architectures compression algorithms Collective I/O Adaptive systems Heuristics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：