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

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Sun, Bowen Luo, Lailong Li, Shangsen Chen, Yingwen Guo, Deke College of Computer National University of Defense Technology China National University of Defense Technology Science and Technology on Information Systems Engineering Laboratory China College of Computer National University of Defense Technology National Lab for Parallel and Distributed Processing China

ISBN: (纸本)9781665494571

Cold data contributes a large portion of the big data today and is usually stored in secondary storage. Various sketch data structures are implemented to represent the stored elements and provide constant-time membership queries. Considering the large volume and infrequent access of cold data, we envision three rationales of cold data representation: 1) parallelized insertion, 2) accurate representation, and 3) constant-time query/deletion. The existing sketches, however, fail to achieve these rationales simultaneously. To this end, we propose a novel sketch named parallelized cuckoo Filter (PCF) in this paper. PCF divides the standard cuckoo filter into multiple homogenous segments. An additional hash function is introduced to assign an element to a segment. The element will be inserted into the selected segment. With such a design, element insertions in PCF can be naturally parallelized. Besides, as a variant of the cuckoo filter, PCF naturally realizes the accurate representation and constant-time query/deletion requirements. Comprehensive experiments further indicate that PCF achieves the three rationales simultaneously. © 2021 IEEE.

关键词： Hash functions Smart cities Big Data Data structures Standards

来源：评论

学校读者我要写书评

暂无评论

Messages from the Program Co-chairs: NAS 2009

Proceedings - 2009 IEEE International Conference on Networki...

引用

Proceedings - 2009 IEEE International Conference on Networking, Architecture, and Storage, NAS 2009 2009年 xii页

作者： Zhu, Yifeng Fang, Liang Hu, Weiwu University of Maine United States National Lab of Parallel and Distributed Processing China Chinese Academy of Science China

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of parallel Prefix Adders in FPGA Implementation of EAC

A Comparative Study of Parallel Prefix Adders in FPGA Implem...

引用

Euromicro Symposium on Digital System Design

作者： Feng Liu Fariborz Fereydouni Forouzandeh Otmane Ait Mohamed Gang Chen Xiaoyu Song Qingping Tan Parallel Distributed Processing National Laboratory Hunan China National Lab of Parallel Distributed processing Hunan China ECE department Concordia University Montreal Quebec Canada Lingcore Lab Portland OR USA ECE department Portland State University Portland OR USA

Several regular parallel trees have been proposed over the years to optimize logic depth, area, fan-out and interconnect count for logic circuits. In this paper, we propose a comparative study of different parallel prefix trees used in the design of a new end-around carry (EAC) adder targeting FPGA technology. This new adder is based on the fast 128-bit binary floating-point EAC adder which has been implemented in the IBM POWER6 microprocessor's fused multiply-add unit. The parallel prefix tree implemented on the IBM's EAC adder is a Kogge-Stone tree which has been chosen for its high performance and its low power consumption. Our comparative study highlights the main performance differences among fourteen different architecture configurations when targeting an FPGA EAC adder design. We focus on the area requirements and the critical path delay of these designs. Our experimental results show that there is one architecture configuration with the lower area requirement and the higher performance.

关键词： Field programmable gate arrays Adders Microprocessors distributed processing Logic circuits Delay Testing Digital systems Design methodology Design optimization

来源：评论

学校读者我要写书评

暂无评论

Shuffle-Efficient distributed Locality Sensitive Hashing on Spark

Shuffle-Efficient Distributed Locality Sensitive Hashing on ...

引用

IEEE Conference on Computer Communications Workshops

作者： Wanxin Zhang Dongsheng Li Ying Xu Yiming Zhang National Lab for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467399562

Locality Sensitive Hashing (LSH) is an important indexing technique for approximate similarity search in high-dimensional spaces. An obvious limitation of LSH approaches is the lack of capability and scalability to deal with massive data. This paper proposes a distributed variant of LSH called Spark-LSH, which is implemented on Apache Spark, a well-known distributed computing framework. We design a shuffle-efficient indexing scheme for the Spark-LSH, which can reduce the data shuffle and improve the network efficiency when constructing the hash table indices. Furthermore, we propose a location-aware querying scheme to improve the query performance. Experiments show that the Spark-LSH scheme can reduce the network shuffle overhead remarkably and accelerate the query significantly.

关键词： Locality Sensitive Hashing Spark Shuffle

来源：评论

学校读者我要写书评

暂无评论

An enhanced smart copying (ESC) method for the reconstruction of missing audio packets

An enhanced smart copying (ESC) method for the reconstructio...

引用

International Conference on Communications, Circuits and Systems (ICCCAS)

作者： Wei Keng Ng J. Absar S. George C.T. Lau B. Premkumar Parallel & Distributed Processing Lab School of Computer Engineering Nanyang Technological University Singapore STMicroelectronics and University of Pavia Singapore

The paper describes an improved statistical approach for the reconstruction of missing audio packets. We demonstrate that the proposed enhanced smart copying method can successfully reconstruct lost packets with a much reduced computational time (approximately 21 times faster), while giving better quality as compared to the existing scheme. This efficiency is achieved by avoiding the direct inversion of a large matrix and requires no explicit solution for the coefficients of the underlying autoregressive model.

关键词： Microelectronics Asia Streaming media Phase change materials distributed processing Concurrent computing distributed computing Signal reconstruction Signal processing Digital signal processing

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution 3

An efficient local address generation for the block-cyclic d...

引用

3rd International Conference on Algorithms and Architectures for parallel processing, ICA3PP 1997

作者： Kwon, Oh-Young Kim, Tae-Geun Han, Tack-Don Yang, Sung-Bong Kim, Shin-Dug Distributed Computing Lab. Systems Engineering Research Institute 1 Ueun-dong Yusong-gu Taejon305-333 Korea Republic of Parallel Processing System Laboratory Dept. of Computer Science Yonsei University Seoul120-749 Korea Republic of

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time ΔM table generation method is faster than other algorithms in ΔM table generation time and access time for 10,000 array elements. © 1997 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

Modelling with relational calculus of object and component systems - RCOS

Modelling with relational calculus of object and component s...

引用

作者： Chen, Zhenbang Hannousse, Abdel Hakim Van Hung, Dang Knoll, Istvan Li, Xiaoshan Liu, Zhiming Liu, Yang Nan, Qu Okika, Joseph C. Ravn, Anders P. Stolz, Volker Yang, Lu Zhan, Naijun International Institute for Software Technology United Nations University China Faculty of Science and Technology University of Macau Department of Computer Science Aalborg University Denmark Lab. of Computer Science Institute of Software CAS China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540852883

This chapter presents a formalization of functional and behavioural requirements, and a refinement of requirements to a design for CoCoME using the Relational Calculus of Object and Component Systems (rCOS). We give a model of requirements based on an abstraction of the use cases described in Chapter 3.2. Then the refinement calculus of rCOS is used to derive design models corresponding to the top level designs of Chapter 3.4. We demonstrate how rCOS supports modelling different views and their relationships of the system and the separation of concerns in the development. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

A simple algorithm implementation for pattern-matching with bounded gaps in genomic and proteomic sequences, on the grid egee platform, using an intuitive user interface

A simple algorithm implementation for pattern-matching with ...

引用

5th IFIP Conference on Artificial Intelligence Applications and Innovations, AIAI 2009

作者： Vegoudakis, K.I. Margaritis, K.G. Maglaveras, N. Department of Applied Informatics Parallel and Distributed Processing Laboratory University of Macedonia 156 Egnatia str. P.O. Box 1591 54006 Thessaloniki Greece Lab of Medical Informatics Health Sciences Faculty Aristotle University AUTH PB 323 54124 Thessaloniki Greece

In the last decade an unprecedented development in bioinformatics has been observed. An extremely high number of organisms have been sequenced and included in genomic databases. The huge amount of data produced needs to be stored and processed for further analysis. Scientists, have researched algorithms for finding complicated patterns in DNA sequences, but there is a need for computational power and large storage systems, in order to implement specific algorithms in as many as possible DNA sequences stored in large Databases and save the results produced for future use. Recently, a number of pattern matching algorithms that allowing gaps have been introduced and Grid is an emerging technology that seems to be helpful in this kind of biomedical research. In this paper, we present our effort towards the construction of a user friendly Interface for accessing the Grid EGEE platform. The Interface is a specific one and was built to perform Pattern-Matching with Bounded Gaps in Genomic and Proteomic Sequences. The algorithm and the Interface is tested with small and large DNA and protein sequences as an input, downloaded from a gene and protein repository, NCBI (National Center for Biotechnology Information) and the gathered results produced are presented.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

FINT: FIELD-AWARE INTERACTION NEURAL NETWORK FOR CTR PREDICTION

arXiv

引用

arXiv 2021年

作者： Zhao, Zhishan Yang, Sen Liu, Guohui Feng, Dawei Xu, Kele iQIYI Inc. China National Key Lab of Parallel and Distributed Processing Changsha China National University of Defense Technology Changsha China

As a critical component for online advertising and marketing, click-through rate (CTR) prediction has drawn lots of attention from both industry and academia. Recently, deep learning has become the mainstream methodological choice for CTR. Despite sustainable efforts have been made, existing approaches still pose several challenges. On the one hand, high-order interaction between the features is under-explored. On the other hand, high-order interactions may neglect the semantic information from the low-order fields. In this paper, we proposed a novel prediction method, named FINT, that employs the Field-aware INTeraction layer which explicitly captures high-order feature interactions while retaining the low-order field information. To empirically investigate the effectiveness and robustness of the FINT, we perform extensive experiments on the three realistic databases: KDD2012, Criteo and Avazu. The obtained results demonstrate that the FINT can significantly improve the performance compared to the existing methods, without increasing the amount of computation required. Moreover, the proposed method brought about 2.72% increase to the advertising revenue of iQIYI, a big online video app through A/B testing. To better promote the research in CTR field, we released our code as well as reference implementation at: https://***/zhishan01/FINT. © 2021, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

An enhanced smart copying (ESC) method for the reconstruction of missing audio packets 1

An enhanced smart copying (ESC) method for the reconstructio...

引用

1st International Conference on Communications, Circuits and Systems, ICCCAS 2002

作者： Ng, Wei Keng Absar, J. George, S. Lau, C.T. Premkumar, B. Parallel and Distributed Processing Lab. School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore639798 Singapore ST Microelectronics Asia Pacific Pte. Ltd. Telectech Park Science Park 2 20 Science Park Road #01-28/30 Singapore117674 Singapore

ISBN: (纸本)0780375475

关键词： Signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：