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

International Symposium on parallel Processing

作者： R. Lin K. Nakano S. Olariu M.C. Pinotti J.L. Schwing A.Y. Zomaya Department of Computer Science SUNY Geneseo Geneseo NY USA Department of Electrical and Computer Engineering Nagoya Institute of Technology Nagoya Japan Department of Computer Science Old Dominion University Norfolk VA USA Parallel Computing Research Lab Department of Electrical and ElectronicEng University of Western Australia Perth Australia

The task of computing binary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. The paper describes a scalable VLSI architecture for the BPS problem. The authors adopt as the central theme of this effort, the recognition of the fact that the broadcast delay incurred by a signal propagating along a bus is, at best, linear in the distance traversed. Thus, one of the design criteria is to keep buses as short as possible. In this context, the main contribution is to show that one can use short buses in conjunction with shift switching to obtain a scalable VLSI architecture for the BPS problem.

关键词： Very large scale integration Switches Broadcasting parallel processing Computer architecture Propagation delay Communication switching Computer science USA Councils Registers

来源：评论

学校读者我要写书评

暂无评论

Atomic-action-based Contrastive Network for Weakly Supervised Temporal Language Grounding

Atomic-action-based Contrastive Network for Weakly Supervise...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Hongzhou Wu Yifan Lyu Xingyu Shen Xuechen Zhao Mengzhu Wang Xiang Zhang Zhigang Luo Parallel and Distributed Processing Lab National University of Defense Technology Changsha China Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China School of Computer National University of Defense Technology Changsha China Institute for Quantum Information and the State Key Lab of High Performance Computing National University of Defense Technology Changsha China

As one knows, an event often consists of several actions while each action is atomic. Inspired by this insight, we propose a novel framework named Atomic-action-based Contrastive Network model (ACN) for weakly supervised temporal language grounding task to localize the query-related event moment in an untrimmed video, without access to any temporal annotations. Specifically, ACN first determines the accurate moment boundary of each action in a query-agnostic way. This can adequately exploit homogeneous visual cues while impeding the heterogeneity of the query from hurting the atomicity of visual action, i.e., action boundary. To effectively localize the query-related event, we seek the discriminative words in the given query, and explore a composite-grained contrastive module to retrieve those corresponding atomic actions in the common latent space across modalities. This boosts feature discrimination of visual event segment to remove irrelevant action video segments. Experiments on two popular datasets show the efficacy of our model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Symmetric Encryption for Cloud Storage

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Sy...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Panyu Wu Zhenfu Cao Jiachen Shen Xiaolei Dong Yihao Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan

Since data outsourcing poses privacy concerns with data leakage, searchable symmetric encryption (SSE) has emerged as a powerful solution that enables clients to perform query operations on encrypted data while preserving their privacy. Dynamic SSE schemes have been proposed to handle update operations. However, it is shown that updates might increase the risk of information leakage. Meanwhile, to meet the requirement of real-world applications, it is desirable to have the searchable encryption scheme which supports both multiple clients and multi-keyword queries. To address these issues, this paper proposes MMDSSE, a multi-client forward secure dynamic SSE scheme that supports multi-keyword queries. MMDSSE allows the clients narrow down the results by providing an arbitrary subset of the entire archive, and thus suitable for cloud storage environment. Security analysis and experimental evaluations show that MMDSSE is secure and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

大规模科学计算性能评估的FFT标准

大规模科学计算性能评估的FFT标准

引用

第8届全国并行计算大会

作者：侯晓吻唐渊 Department of Computer Science and Engineering Beijing University of Posts and TelecommunicationsBe Lab.of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080China

在大规模科学计算中，对整个系统性能评估的正确与否已经越来越成为成功掏建系统不可小视的一环，现代超级计算机(千亿次，万亿次)的性能测试与评估最常用的一个测试基准程序就是所谓的LINPACK。当今超级计算界的TOP500排名也主要是基于... 详细信息

在大规模科学计算中，对整个系统性能评估的正确与否已经越来越成为成功掏建系统不可小视的一环，现代超级计算机(千亿次，万亿次)的性能测试与评估最常用的一个测试基准程序就是所谓的LINPACK。当今超级计算界的TOP500排名也主要是基于LINPACK峰值的，但我们在实际应用中发现，LINPACK峰值高并不等于超级计算机/并行机的利用率/并行效率一定也高。本文指出了LINPACK测试程序包自身的局限性，进而提出一个大规模科学计算性能测试与评估的FFT标准,并对影响并行FFT算法性能的一些主要因素进行分析，结合一套完善的软件包“FFTH”以满足此类需求。

关键词：科学计算并行计算基准程序程序测试

来源：评论

学校读者我要写书评

暂无评论

Scalable hardware-algorithms for Binary prefix sums 13th

引用

13th International parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on parallel and Distributed Processing, SPDP 1999

作者： Lin, R. Nakano, K. Olariu, S. Pinotti, M.C. Schwing, J.L. Zomaya, A.Y. Department of Computer Science SUNY Geneseo GeneseoNY14454 United States Department of Electrical and Computer Engineering Nagoya Institute of Technology Showa-ku Nagoya466-8555 Japan Department of Computer Science Old Dominion University NorfolkVA23529 United States I.E.I C.N.R Pisa Italy Department of Computer Science Central Washington University EllensburgWA98926 United States Parallel Computing Research Lab Dept of Electrical and Electronic Eng University of Western Australia Perth Australia

ISBN: (纸本)3540658319

The main contribution of this work is to propose a number of broadcast efficient VLSI architectures for computing the sum and the prefix sums of a wk-bit, k ≥ 2, binary sequence using, as basic building blocks, linear arrays of at most w2 shift switches. An immediate consequence of this feature is that in our designs broadcasts are limited to buses of length at most w2 making them eminently practical. Using our design, the sum of a wk-bit binary sequence can be obtained in the time of2k-2 broadcasts, using 2wk−2 + O(wk−3) blocks, while the corresponding prefix sums can be computed in 3k-4 broadcasts using (k + 2)Wk−2 + O(kwk−3) blocks. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Binary sequences

来源：评论

学校读者我要写书评

暂无评论

Z-Inspection®: A Process to Assess Trustworthy AI

IEEE Transactions on Technology and Society

引用

IEEE Transactions on Technology and Society 2021年第2期2卷 83-97页

作者： Zicari, Roberto V. Brodersen, John Brusseau, James Dudder, Boris Eichhorn, Timo Ivanov, Todor Kararigas, Georgios Kringen, Pedro McCullough, Melissa Moslein, Florian Mushtaq, Naveed Roig, Gemma Sturtz, Norman Tolle, Karsten Tithi, Jesmin Jahan Van Halem, Irmhild Westerlund, Magnus Frankfurt Big Data Lab Goethe University Frankfurt Frankfurt Germany Department of Public Health Section of General Practice and Research Unit for General Practice Faculty of Health and Medical Sciences University of Copenhagen Copenhagen Denmark Philosophy Department Pace University New YorkNY United States Department of Computer Science University of Copenhagen Copenhagen Denmark Department of Physiology Faculty of Medicine University of Iceland Iceland Institute of the Law and Regulation of Digitalization Philipps-University Marburg Marburg Germany Parallel Computing Labs Intel Labs Santa ClaraCA United States Department of Computer Science Arcada University of Applied Sciences Helsinki Finland Primary Health Care Research Unit Copenhagen1014 Denmark

The ethical and societal implications of artificial intelligence systems raise concerns. In this article, we outline a novel process based on applied ethics, namely, Z-Inspection®, to assess if an AI system is trustworthy. We use the definition of trustworthy AI given by the high-level European Commission's expert group on AI. Z-Inspection® is a general inspection process that can be applied to a variety of domains where AI systems are used, such as business, healthcare, and public sector, among many others. To the best of our knowledge, Z-Inspection® is the first process to assess trustworthy AI in practice. © 2020 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Haptic intelligent interfaces for NAO robot hand control

Haptic intelligent interfaces for NAO robot hand control

引用

International Conference on Advanced Mechatronic Systems (ICAMechS)

作者： Octavian Melinte Luige Vladareanu Ligia Munteanu Hongnian Yu Shuang Cang Zeng-Guang Hou Gui-Bin Bian Hongbo Wang Dept. Robotics and Mechatronics Institute of Solid Mechanics of Romanian Academy Bucharest Romania Engineering and Computing Bournemouth University Dorset UK State Key Laboratory of Management and Control for Complex Systems Chinese Academy of Sciences Beijing China Parallel Robot and Mechatronic Sys. Lab. Yanshan University Qinhuangdao China

The paper presents a new approach on haptic interface control for NAO robotic hand. The haptic teleoperation of NAO robot hand raises some issues, mapping the haptic device dynamic being the most important. The mapping was achieved through Neural Network by determining a dynamic gain of robot haptic feedback. The results lead to the achievement of the haptic intelligent interfaces for the NAO robot hand control which can be integrated into an innovative haptic robot control system.

关键词： Decision support systems Humanoid robots Haptic interfaces Economic indicators Joints Mechatronics

来源：评论

学校读者我要写书评

暂无评论

GraphBLAS: C++ Iterators for Sparse Matrices

GraphBLAS: C++ Iterators for Sparse Matrices

引用

IEEE International Symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Benjamin Brock Scott McMillan Aydı n Buluç Timothy G. Mattson José E. Moreira EECS Department University of California Berkeley CA Software Engineering Institute Carnegie Mellon University Pittsburgh PA Computational Research Department Lawrence Berkeley National Laboratory Berkeley CA Parallel Computing Lab Intel Ocean Park WA IBM Thomas J. Watson Research Center Yorktown Heights NY

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

Iteration over opaque, generic data structures is an important feature of many C++ libraries. Aggressive compiler optimization and inlining enables generic C++ iterators to iterate over complex data structures with performance comparable to that of hand-tuned code with C-language (raw) pointers. In this paper, we describe the sparse matrix iterators in the current draft of the C++ GraphBLAS API, their support for a variety of backend data formats, and implementation strategies we have considered. We compare performance of these iterators to that of hand-tuned iteration with raw pointers, showing that our iterators introduce minimal overhead. We consider extensions to our iterator design for interoperability with the draft C++ Graph Library proposal and to support different semantics for iterating over sparse matrices (by row, by column, by specific diagonals, etc.).

关键词： Distributed processing Conferences Semantics C++ languages Data structures Libraries Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Preface

Workshop Proceedings - 32nd Annual Conference on Artificial ...

引用

Workshop Proceedings - 32nd Annual Conference on Artificial Intelligence, KI 2009 - Workshop on Planning, Scheduling, Design, and Configuration, PuK 2009 2009年 78-78页

作者： Brinkmann, André Eikerling, Heinz-Josef Aziz, M. Zaheer Paderborn Center for Parallel Computing Germany Siemens AG SIS C-LAB Germany GET Lab. Paderborn University Germany

来源：评论

学校读者我要写书评

暂无评论

The GraphBLAS 3.0 Project

The GraphBLAS 3.0 Project

引用

IEEE International Symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Raye Kimmerer Timothy G. Mattson Scott McMillan Benjamin Brock Erik Welch Michel Pelletier José E. Moreira JuliaLab Massachusetts Institute of Technology Cambridge MA Human Learning Group Ocean Park WA Software Engineering Institute Carnegie Mellon University Parallel Computing Lab Intel Santa Clara CA NVIDIA Corporation Austin TX Graphegon Portland OR IBM Thomas J. Watson Research Center Yorktown Heights NY

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

The GraphBLAS C API is mature with an updated specification (version 2.1) and a compliant implementation (SuiteSparse GraphBLAS). We are now focused on GraphBLAS 3.0; the next major GraphBLAS revision. Potential changes include: (1) a separate math spec to make new language bindings easier to write, (2) better support for user-defined types, rank promotion, and enhanced non-blocking execution, (3) expanded scope of GraphBLAS to address a wider range of applications, and (4) support for complex heterogeneous and distributed systems.

关键词： Distributed processing Conferences Oral communication Libraries

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：