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

7th IEEE International Conference on Smart Cloud, SmartCloud 2022

作者： He, Yuqi Lai, Zhiquan Ran, Zhejiang Zhang, Lizhi Li, Dongsheng National University of Defense Technology National Key Laboratory of Parallel and Distributed Processing College of Computer Changsha China

ISBN: (数字)9781665451796

ISBN: (纸本)9781665451796

The existing graph neural network (GNN) systems adopt sample-based training on large-scale graphs over multiple GPUs. Although they support large-scale graph training, large data loading overhead is still a bottleneck. In this work, we propose SCGraph, a method that supports GPU high-speed feature caching. We classify the graph vertices sorted by out-degrees. For high out-degree vertices, we set grading caches via different GPUs to increase the overall cache content through NVLink high-speed data transmission between them. For low out-degree vertices, we expand training vertices' neighborhood in advance to regenerate cache. We evaluate SCGraph against two state-of-the-art industrial GNN frameworks, i.e., DGL and PaGraph on two datasets Reddit and ogbn-products. Experimental results show that SCGraph achieves up to 1.83× performance speedup over the state-of-the-art baselines. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

YFLM: An Improved Levenberg-Marquardt Algorithm for Global Bundle Adjustment 41st

YFLM: An Improved Levenberg-Marquardt Algorithm for Global ...

引用

41st Computer Graphics International Conference, CGI 2024

作者： Peng, Jiaxin Li, Tao Jiang, Qin Liu, Jie Wang, Ruibo Laboratory of Software Engineering for Complex Systems School of Computer Science National University of Defense Technology Hunan Changsha410073 China Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Hunan Changsha410073 China

ISBN: (纸本)9783031820205

The conventional Levenberg-Marquardt (LM) algorithm is a state-of-the-art trust-region optimization method for solving bundle adjustment problems in the Structure-from-Motion community, which not only takes advantage of the fast convergence of the Gauss-Newton method, but also the stability of the gradient descent method when approaching optimal solutions. However, the damping ratio of LM is simply provided by trial-and-error, which causes slow convergence rate for large-scale problems. This paper proposes the Yamashita-Fukushima LM (YFLM) algorithm to reduce the time complexity for global bundle adjustment, where the damping factor is determined by Yamashita and Fukushima’s method. YFLM dynamically calculates a more reasonable and optimal damping ratio according to the newest reprojection error. The experimental results show that the YFLM algorithm outperforms the conventional LM algorithm for most public bundle adjustment datasets. Besides this, the convergence of the YFLM algorithm is also evaluated with different σ∈(0,2]. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Damping

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning with Diverse Samples 26

Contrastive Learning with Diverse Samples

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Wu, Lilei Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781643684369

Unsupervised visual representation learning has gained much attention from the computer vision community because of the recent contrastive learning achievements. Current work mainly adopts instance discrimination as the pretext task, which treats every single instance as a different class (negative) and uses a collection of data augmentation techniques to generate more examples (positive) for each class. The idea is straightforward and efficient but will generally cause similar instances to be classified into different classes. Such problem has been defined as 'class collision' in some previous works and is shown to hurt the representation ability. Motivated by this observation, we present a solution to address this issue by filtering similar negative examples from each mini-batch. Concretely, we model the problem as a Determinantal Point Process (DPP) so that similar instances can be filtered stochastically, and diverse samples are expected to be sampled for contrastive training. Besides, we further introduce a priority term for each instance, which indicates the hardness of its positives, so that instances with more hard positives are more likely to be sampled for contributing to the optimization. Our sampling can be efficiently implemented in a feed-forward manner and further accelerated by our encouraged complement DPP. Extensive experimental results demonstrate our priority over the standard setup of contrastive learning. © 2023 The Authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A relative coordinate based distributed sparse-preserving matrix factorization approach towards self-stabilizing network location service - Withdrawn

引用

IEEE Transactions on parallel and distributed Systems 2023年 1-1页

作者： Fu, Yongquan Wang, Yijie Pei, Xiaoqiang Li, Xiaoyong Science and Technology Laboratory of Parallel and Distributed Processing National University of Defense Technology China

Withdrawn. IEEE

关键词： Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

ParTransgrid: A scalable parallel preprocessing tool for unstructured-grid cell-centered computational fluid dynamics applications

ParTransgrid: A scalable parallel preprocessing tool for uns...

引用

作者： Zhang, Jian Liu, Jie Zhou, Naichun Tang, Jing He, Xie Chen, Jianqiang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Computational Aerodynamics Institute China Aerodynamics Research and Development Center Mianyang China

The development of a basic scalable preprocessing tool is the key routine to accelerate the entire computational fluid dynamics (CFD) workflow toward the exascale computing era. In this work, a parallel preprocessing tool, called ParTransgrid, is developed to translate the general grid format like CFD General Notation System into an efficient distributed mesh data format for large-scale parallel computing. Through ParTransgrid, a flexible face-based parallel unstructured mesh data structure designed in Hierarchical Data Format can be obtained to support various cell-centered unstructured CFD solvers. The whole parallel preprocessing operations include parallel grid I/O, parallel mesh partition, and parallel mesh migration, which are linked together to resolve the run-time and memory consumption bottlenecks for increasingly large grid size problems. An inverted index search strategy combined with a multi-master-slave communication paradigm is proposed to improve the pairwise face matching efficiency and reduce the communication overhead when constructing the distributed sparse graph in the phase of parallel mesh partition. And we present a simplified owner update rule to fast the procedure of raw partition boundaries migration and the building of shared faces/nodes communication mapping list between new sub-meshes with an order of magnitude of speed-up. Experiment results reveal that ParTransgrid can be easily scaled to billion-level grid CFD applications, the preparation time for parallel computing with hundreds of thousands of cores is reduced to a few minutes. © 2021 John Wiley & Sons, Ltd.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Accelerating Federated Learning by Selecting Beneficial Herd of Local Gradients

arXiv

引用

arXiv 2024年

作者： Luo, Ping Deng, Xiaoge Wen, Ziqing Sun, Tao Li, Dongsheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

Federated Learning (FL) is a distributed machine learning framework in communication network systems. However, the systems’ Non-Independent and Identically distributed (Non-IID) data negatively affect the convergence efficiency of the global model, since only a subset of these data samples are beneficial for model convergence. In pursuit of this subset, a reliable approach involves determining a measure of validity to rank the samples within the dataset. In this paper, We propose the BHerd strategy which selects a beneficial herd of local gradients to accelerate the convergence of the FL model. Specifically, we map the distribution of the local dataset to the local gradients and use the Herding strategy to obtain a permutation of the set of gradients, where the more advanced gradients in the permutation are closer to the average of the set of gradients. These top portion of the gradients will be selected and sent to the server for global aggregation. We conduct experiments on different datasets, models and scenarios by building a prototype system, and experimental results demonstrate that our BHerd strategy is effective in selecting beneficial local gradients to mitigate the effects brought by the Non-IID dataset, thus accelerating model convergence. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Fast flow field prediction of pollutant leakage diffusion based on deep learning

引用

Environmental Science and Pollution Research 2024年第36期31卷 49393-49412页

作者： YunBo, Wan Zhong, Zhao Jie, Liu KuiJun, Zuo Yong, Zhang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Computational Aerodynamics Institute China Aerodynamics Research and Development Center Mianyang621000 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China School of Aeronautics Northwestern Polytechnical University Xi’an710072 China

Abstract: Predicting pollutant leakage and diffusion processes is crucial for ensuring people’s safety. While the deep learning method offers high simulation efficiency and superior generalization, there is currently a lack of research on predicting pollutant leakage and diffusion flow field using deep learning. Therefore, it is necessary to conduct further studies in this area. This paper introduces a two-level network method to model the flow characteristics of pollutant diffusion. The proposed method in this study demonstrates a significant enhancement in flow field prediction accuracy compared to traditional deep learning methods. Moreover, it improves computational efficiency by over 800 times compared to traditional computational fluid dynamics (CFD) methods. Unlike conventional CFD methods that require grid expansion to calculate all operation conditions, the deep learning method is not confined by grid limitations. While deep learning methods may not entirely replace CFD methods, they can serve as a valuable supplementary tool, expanding the versatility of CFD methods. The findings of this research establish a robust foundation for incorporating deep learning methods in addressing pollutant leakage and diffusion challenges. Graphical abstract: A deep learning method for simulating pollutant leakage diffusion. (Figure presented.) © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

Optimizing Yinyang K-Means Algorithm on ARMv8 Many-Core CPUs 22nd

Optimizing Yinyang K-Means Algorithm on ARMv8 Many-Core CPU...

引用

22nd International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2022

作者： Zhou, Tianyang Wang, Qinglin Yin, Shangfei Hao, Ruochen Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783031226762

K-Means algorithm is one of the most common clustering algorithms widely applied in various data analysis applications. Yinyang K-Means algorithm is a popular enhanced K-Means algorithm that avoids most unnecessary calculations using triangle inequality. However, Yinyang K-Means algorithm is time-consuming when the problem size is large. Due to the influence of performance and energy-efficiency, ARM CPUs have appeared in high performance computing. Therefore, it is very interesting to accelerate Yinyang K-Means algorithm on ARM CPUs. In this paper, we propose an efficient parallel implementation of Yinyang K-Means algorithm on ARMv8 many-core CPUs by means of vectorization, NUMA affinity memory optimization and data layout optimization. The experiment on two ARMv8 many-core CPUs has shown that our implementation can achieve up to 5.6 times faster than the open-source multi-threaded one of Yinyang K-Means algorithm. To the best of our knowledge, this is the first work that studies the optimization of Yinyang K-Means algorithms on ARMv8 CPUs. © 2023, Springer Nature Switzerland AG.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Federated Prediction-Powered Inference from Decentralized Data

arXiv

引用

arXiv 2024年

作者： Luo, Ping Deng, Xiaoge Wen, Ziqing Sun, Tao Li, Dongsheng The National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

In various domains, the increasing application of machine learning allows researchers to access inexpensive predictive data, which can be utilized as auxiliary data for statistical inference. Although such data are often unreliable compared to gold-standard datasets, Prediction-Powered Inference (PPI) has been proposed to ensure statistical validity despite the unreliability. However, the challenge of ‘data silos’ arises when the private gold-standard datasets are non-shareable for model training, leading to less accurate predictive models and invalid inferences. In this paper, we introduces the Federated Prediction-Powered Inference (Fed-PPI) framework, which addresses this challenge by enabling decentralized experimental data to contribute to statistically valid conclusions without sharing private information. The Fed-PPI framework involves training local models on private data, aggregating them through Federated Learning (FL), and deriving confidence intervals using PPI computation. The proposed framework is evaluated through experiments, demonstrating its effectiveness in producing valid confidence intervals. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Broadcast Authentication Protocol in Wireless Sensor Networks

引用

Chinese Journal of Electronics 2023年第2期18卷 368-372页

作者： Xin Zhao Xiaodong Wang Wanrong Yu Xingming Zhou National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

Broadcast authentication is a critical security service in wireless sensor networks. A protocol named $\mu\text{TESLA}$ [1] has been proposed to provide efficient authentication service for such networks. However, when applied to applications such as time synchronization and fire alarm in which broadcast messages are sent infrequently, $\mu\text{TESLA}$ encounters problems of wasted key resources and slow message verification. This paper presents a new protocol named GBA (Generalized broadcast authentication), for efficient broadcast authentication in these applications. GBA utilizes the one-way key chain mechanism of $\mu\text{TESLA}$ , but modifies the keys and time intervals association, and changes the key disclosure mechanism according to the message transmission model in these applications. The proposed technique can take full use of key resources, and shorten the message verification time to an acceptable level. The analysis and experiments show that GBA is more efficient and practical than $\mu\text{TESLA}$ in applications with various message transmission models.

关键词： Wireless sensor networks Analytical models Protocols Authentication Synchronization Security Message authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：