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

arXiv 2021年

作者： Wu, Wansen Chang, Tao Li, Xinmeng Yin, Quanjun Zhu, Jiancheng The College of Systems Engineering National University of Defense Technology Hunan Changsha410073 China National Key Laboratory of Parallel and Distributed Processing College of Computer Science and Technology National University of Defence Technology Changsha410073 China

Vision-Language Navigation (VLN) tasks require an agent to follow human language instructions to navigate in previously unseen environments. This challenging field involving problems in natural language processing, computer vision, robotics, etc., has spawn many excellent works focusing on various VLN tasks. This paper provides a comprehensive survey and an insightful taxonomy of these tasks based on the different characteristics of language instructions in these tasks. Depending on whether the navigation instructions are given for once or multiple times, this paper divides the tasks into two categories, i.e., single-turn and multi-turn tasks. For single-turn tasks, we further subdivide them into goal-oriented and route-oriented based on whether the instructions designate a single goal location or specify a sequence of multiple locations. For multi-turn tasks, we subdivide them into passive and interactive tasks based on whether the agent is allowed to question the instruction or not. These tasks require different capabilities of the agent and entail various model designs. We identify progress made on the tasks and look into the limitations of existing VLN models and task settings. Finally, we discuss several open issues of VLN and point out some opportunities in the future, i.e., incorporating knowledge with VLN models and implementing them in the real physical world. © 2021, CC BY.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

On design of cluster and grid computing environment toolkit for bioinformatics applications

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3326卷 82-87页

作者： Yang, Chao-Tung Kuo, Yu-Lun Li, Kuan-Ching Gaudiot, Jean-Luc High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung 40744 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung 43301 Taiwan Parallel and Scalable Computer Architecture Laboratory Dept. of Electrical Engineering and Computer Science University of California - Irvine Irvine CA 92697 United States

In this paper, we present BioGrid, a novel computing resource that combines advantages of grid computing technology with bioinformatics parallel applications. The grid environment permits the sharing of a large amount of idle computing resources and data. The investigation of bioinformatics demands orders of magnitude of computing resources and in parallel, the biological data are growing in such a high speed. By using BioGrid, we plan to integrate and share resources and biological data using the grid computing technology. Still in this paper, the well-known FASTA application is performed as matter of testing and analysis in our grid computing platform, as goal to show the improved efficiency and reduced computation time. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

An Effective Design to Improve the Efficiency of DPUs on FPGA

An Effective Design to Improve the Efficiency of DPUs on FPG...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Yutian Lei Qingyong Deng Saiqin Long Shaohui Liu Sangyoon Oh The Key Laboratory of Hunan Province for Internet of Things and Information Security The School of Computer Science Science and Technology on Parallel and Distributed Processing Laboratory Xiangtan University Xiangtan China The Artificial Intelligence Center PengCheng Laboratory shenzhen China Ajou University Suwon-si Republic of Korea

The following topics are dealt with: cloud computing; learning (artificial intelligence); resource allocation; security of data; mobile computing; neural nets; optimisation; parallel processing; scheduling; and storag... 详细信息

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

关键词： Deep learning Schedules Multicore processing Logic gates Throughput Acceleration Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

FedNAT: Byzantine-robust Federated Learning through Activation-based Attention Transfer

FedNAT: Byzantine-robust Federated Learning through Activati...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Mengxin Wang Liming Fang Kuiqi Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Nanjing University of Aeronautics and Astronautics Shenzhen Research Institute Shenzhen China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China

Federated learning (FL) is a decentralized machine learning framework that prioritizes privacy by allowing clients to train statistical models without sharing their private data, thus eliminating the impact of data fortresses. However, the presence of Byzantine attacks, such as data poisoning and backdoor attack, threatens the robustness of FL schemes. Currently, existing mainstream defense methods are susceptible to multiple adaptive attacks, some of which even violate the privacy principle of FL. Furthermore, these defense schemes become less robust when subjected to targeted poisoning attacks with highly non-IID data distributions. In this work, we propose FedNAT, a novel Byzantine-robust FL framework for whittling away these limitations mentioned above. Specifically, FedNAT first performs a privacy-respecting attention refinement on the activation layer outputs of the local uploads. Then, the server scores the local attentions by calculating their Wasserstein distances and clusters them through the k-median algorithm for global attention aggregation, thus rejecting poisoned local attentions for untargeted attacks. After this process, the global attention is transferred to local attention through the FedNAT loss function, which erases backdoors through the distillation concept. We conduct a comprehensive experimental evaluation to demonstrate that FedNAT significantly outperforms existing robust FL schemes in defending against Byzantine poisoning attacks under both IID and highly non-IID data proportions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Physiologically based speech synthesis 92

Physiologically based speech synthesis

引用

Proceedings of the 6th International Conference on Neural Information processing Systems

作者： Makoto Hirayama Eric Vatikiotis-Bateson Kiyoshi Honda Yasuharu Koike Mitsuo Kawato ATR Human Information Processing Research Laboratories Soraku-gun Kyoto Japan ATR Auditory and Visual Perception Research Laboratories ATR Human Information Processing Research Laboratories Soraku-gun Kyoto Japan and Laboratory of Parallel Distributed Processing Research Institute for Electronic Science Hokkaido University Sapporo Hokkaido Japan

ISBN: (纸本)9781558602748

This study demonstrates a paradigm for modeling speech production based on neural networks. Using physiological data from speech utterances, a neural network learns the forward dynamics relating motor commands to muscles and the ensuing articulator behavior that allows articulator trajectories to be generated from motor commands constrained by phoneme input strings and global performance parameters. From these movement trajectories, a second neural network generates PARCOR parameters that are then used to synthesize the speech acoustics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Grid and Cooperative Computing - GCC 2004 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Hai Jin Yi Pan Nong Xiao Jianhua Sun

ISBN: (数字)9783540302087

ISBN: (纸本)9783540235644

Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computer science and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.

关键词： Theory of Computation Computer Communication Networks Operating Systems Software Engineering Information Systems Applications (incl. Internet) Information Storage and Retrieval

来源：评论

学校读者我要写书评

暂无评论

Audio Tagging by Cross Filtering Noisy Labels

arXiv

引用

arXiv 2020年

作者： Zhu, Boqing Xu, Kele Kong, Qiuqiang Wang, Huaimin Peng, Yuxing Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha410073 China Centre for Vision Speech and Signal Processing University of Surrey GuildfordGU2 7XH United Kingdom

—High quality labeled datasets have allowed deep learning to achieve impressive results on many sound analysis tasks. Yet, it is labor-intensive to accurately annotate large amount of audio data, and the dataset may contain noisy labels in the practical settings. Meanwhile, the deep neural networks are susceptive to those incorrect labeled data because of their outstanding memorization ability. In this paper, we present a novel framework, named CrossFilter, to combat the noisy labels problem for audio tagging. Multiple representations (such as, Logmel and MFCC) are used as the input of our framework for providing more complementary information of the audio. Then, though the cooperation and interaction of two neural networks, we divide the dataset into curated and noisy subsets by incrementally pick out the possibly correctly labeled data from the noisy data. Moreover, our approach leverages the multitask learning on curated and noisy subsets with different loss function to fully utilize the entire dataset. The noisy-robust loss function is employed to alleviate the adverse effects of incorrect labels. On both the audio tagging datasets FSDKaggle2018 and FSDKaggle2019, empirical results demonstrate the performance improvement compared with other competing approaches. On FSDKaggle2018 dataset, our method achieves state-of-the-art performance and even surpasses the ensemble models. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing Temporal Alignment with Autoencoder Regularization

Enhancing Temporal Alignment with Autoencoder Regularization

引用

International Joint Conference on Neural Networks

作者： Liquan Nie Yuanyuan Wang Xiang Zhang Xuhui Huang Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Department of Basic Courses Army Officer Academy Department of Computer Science and Technology College of Computer National University of Defense Technology

ISBN: (纸本)9781509006212

Temporal alignment aligns two temporal sequences and is quite challenging due to drastic differences among temporal sequences and source data from different views. Canonical time warping (CTW) has shown great potential in temporal alignment tasks because it can reduce data redundancy by transforming high-dimensional data to a lower-dimensional subspace via canonical correlation analysis (CCA). However, CTW cannot uncover the underlying nonlinear structure embedded in the dataset. In this paper, we propose an autoencoder regularized canonical time warping method (AECTW) to overcome this drawback. Specifically, AECTW enhances lower-dimensional representation of each sequence by incorporating an autoencoder regularization, meanwhile reveals the nonlinear structure of features by explicit nonlinear transformation. By these strategies, AECTW significantly boosts CTW in temporal alignment tasks. Experiments on both synthetic data and two practical human action datasets demonstrate that AECTW outperforms the representative DTW-based methods.

关键词： NONLINEAR STRUCTURES data redundancy Dataset synthetic data Alignment Warping Structural properties Canonical Religious Missions Data sources

来源：评论

学校读者我要写书评

暂无评论

An Efficient Label Routing on High-Radix Interconnection Networks

An Efficient Label Routing on High-Radix Interconnection Net...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Fei Lei Dezun Dong Xiangke Liao College of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing National University of Defense Technology China Collaborative Innovation Center of High Performance Computing National University of Defense Technology China

ISBN: (纸本)9781538632086

Cost-effective adaptive routing has a significant impact on overall performance for high-radix hierarchical topologies, such as Dragonfly, which achieve a lower network diameter than traditional topologies, Torus and Fat tree, but exhibit a lower degree of adaptiveness for shortest-path rout- ing. Existing adaptive routing methods for those hierarchical topologies improve the adaptiveness by increasing path length, i.e. local or global adaptive routing, and thus suffer from complex and costly deadlock avoidance. This work aims to maximize the routing adaptiveness at the minimum cost of deadlock avoidance. We propose a label routing method for high-radix hierarchical networks. This label routing utilizes a co-design methodology and coordinates the two pipelines, input queue and routing computation, in the router microarchitec- ture. Packets in the input buffer are labeled by our routing algorithm depending on network states. We reorganize the input buffer and develop a label routing algorithm, named Green-Red Routing, GRR. GRR relaxes the requirement of using virtual channels to eliminate routing deadlock, and mitigates buffer resources dedicated to deadlock avoidance. GRR manages the buffer resources and balance its utilization elaborately, and achieve fully adaptive routing efficiently. We conduct extensive experiments to evaluate the performance of GRR on Dragonfly and compare it with state-of-the-art works. The results show that GRR achieves 10%-35% higher performance than existing routing algorithms under most traffic patterns.

关键词： Routing System recovery Network topology Topology Resource management Adaptive systems Organizations

来源：评论

学校读者我要写书评

暂无评论

Improving unsupervised domain adaptation by reducing bi-level feature redundancy

arXiv

引用

arXiv 2020年

作者： Wang, Mengzhu Zhang, Xiang Lan, Long Wang, Wei Tan, Huibin Luo, Zhigang Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China Institute for Quantum State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China DUT-RU International School of Information Science & Engineering Dalian University of Technology DalianLiaoning116000 China Department of Science and Technology on Parallel and Distributed Processing National University of Defense Technology Changsha China

Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignore this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific features with a transferable decorrelated normalization module, which preserves specific domain information whilst easing the side effect of feature redundancy on the sequel domain-invariance. In the second level, domain-invariant feature redundancy caused by domain-shared representation is further mitigated via an alternative brand orthogonality for better generalization. These two novel aspects can be easily plugged into any BN-based backbone neural networks. Specifically, simply applying them to ResNet50 has achieved competitive performance to the state-of-the-arts on five popular benchmarks. Our code will be available at https://***/dreamkily/gUDA. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：