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

FHE4DMM: A Low-Latency distributed Matrix Multiplication With Fully Homomorphic Encryption

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2025年第4期36卷 645-658页

作者： Chen, Yi Hua, Qiang-Sheng Hong, Zixiao Zhu, Lin Jin, Hai Huazhong Univ Sci & Technol Sch Comp Sci & Technol Serv Comp Technol & Syst Lab Natl Engn Res Ctr Big Data Technol & Syst Wuhan 430074 Peoples R China

Fully Homomorphic Encryption (FHE) is a promising technology for secure, non-interactive outsourced computation. One notable method to increase the throughput of FHE-based outsourcing is batching, which typically involves large-scale matrix-matrix multiplications (MM). However, the substantial overhead inherent in existing FHE schemes poses a major challenge for processing these large-scale tasks, often resulting in insufficient memory or prolonged delays on a single machine, making it practically unviable. Utilizing multi-machine parallelism in cloud clusters for outsourced computation offers a natural solution to these obstacles. In this work, we propose FHE4DMM, a distributed algorithm that provides a unified view on encrypted matrices, accommodating various FHE schemes and any matrix dimensions, to accelerate large-scale encrypted MM. A key innovation is its reuse optimizations for parallelized homomorphic computations, which can offer valuable insights for broader FHE-based applications. We utilized FHE4DMM to conduct large-scale square ($4096\times 4096$4096x4096) and rectangular ($32768\times 32768,32768\times 16$32768x32768,32768x16 ) matrix multiplications on 256 machines, achieving computation time of 172.2 s and 76.1 s, respectively, while ensuring a 128-bit security level. For scalability, the experiments demonstrate that FHE4DMM achieves linear speedup for $2<^>{i}$2i ($i$i is from 0 to 6) machines across various matrix dimension cases. In addition, within the range of matrix dimensions that the state-of-the-art (SOTA) distributed FHE-MM algorithm (Huang et al. 2023) can handle, FHE4DMM attains a maximum speedup of 16.62x. To assess its practical performance, FHE4DMM is applied in a basic multi-layer feedforward network. We used 64 machines to perform secure outsourced inference on MNIST and CIFAR-10 datasets with encrypted models and data. Compared to using the SOTA, our method achieved speedups of up to 3.54x and 4.22x respectively, with the MM module

关键词： Homomorphic encryption distributed algorithm distributed algorithm matrix-matrix multiplication (MM) matrix-matrix multiplication (MM)

来源：评论

学校读者我要写书评

暂无评论

Core Maintenance on Dynamic Graphs: A distributed Approach Built on H-Index

引用

IEEE TRANSACTIONS ON BIG DATA 2024年第5期10卷 595-608页

作者： Hua, Qiang-Sheng Wang, Hongen Jin, Hai Shi, Xuanhua Huazhong Univ Sci & Technol Key Lab Serv Comp Technol & Syst Sch Comp Sci & TechnolKey Lab Cluster & Grid Com Natl Engn Res CtrBig Data Technol & Syst Lab Wuhan 430074 Peoples R China

Core number is an essential tool for analyzing graph structure. Graphs in the real world are typically large and dynamic, requiring the development of distributed algorithms to refrain from expensive I/O operations and the maintenance algorithms to address dynamism. Core maintenance updates the core number of each vertex upon the insertion/deletion of vertices/edges. Although the state-of-the-art distributed maintenance algorithm (Weng et al.(similar to)2022) can handle multiple edge insertions/deletions simultaneously, it still has two aspects to improve. (I) Parallel processing is not allowed when inserting/removing edges with the same core number, reducing the degree of parallelism and raising the number of rounds. (II) During the implementation phase, only one thread is assigned to the vertices with the same core number, leading to the inability to fully utilize the distributed computing power. Furthermore, the h-index (Lu, et al. 2016) based distributed core decomposition algorithm (Montresor et al. 2013) can fully utilize the distributed computing power where all vertices can be processed in parallel. However, it requires all vertices to recompute their core numbers upon graph changes. In this article, we propose a distributed core maintenance algorithm based on h-index, which circumvents the issues of algorithm (Weng et al.(similar to)2022). In addition, our algorithm avoids core numbers recalculation where the numbers do not change. In comparison to the state-of-the-art distributed maintenance algorithm (Weng et al.(similar to)2022), the time speedup ratio is at least 100 in the scenarios of both insertion and deletion. Compared to the distributed core decomposition algorithm (Montresor et al. 2013), the average time speedup ratios are 2 and 8 for the cases of insertion and deletion, respectively.

关键词： Core maintenance distributed algorithm dynamic graphs h-index

来源：评论

学校读者我要写书评

暂无评论

A Proximal ADMM-Based distributed Optimal Energy Management Approach for Smart Grid With Stochastic Wind Power

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2024年第5期71卷 2157-2170页

作者： Zhou, Yuan Shi, Xinli Guo, Luyao Wen, Guanghui Cao, Jinde Southeast Univ Sch Cyber Sci Engn Nanjing 210096 Peoples R China Southeast Univ Sch Math Nanjing 210096 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China

In this paper, we address a novel and comprehensive social welfare maximization (SWM) problem for the optimal energy management in a smart grid. The objective is to maximize the total social welfare of dispatchable devices in the smart grid while satisfying certain constraints. Each device in the smart grid is required to meet its local power constraints, and the system as a whole maintains supply-demand balance, taking into account transmission losses and stochastic output power. To facilitate distributed algorithm design, we initially transform the SWM problem into an equivalent dual problem, which is a distributed composite optimization problem. Subsequently, a novel fully distributed proximal alternating direction method of multipliers (PADMM) is proposed, where each agent can autonomously select non-coordinated step size parameters based solely on local information, independent of other agents and the network structure. Detailed convergence analysis is provided, and a worst-case (O)(1/k) convergence rate is established in the non-ergodic sense. Finally, several numerical experiments are conducted to confirm the effectiveness of the proposed algorithm.

关键词： Convergence Energy management Generators Energy storage Wind power generation Smart grids distributed algorithms ADMM optimal energy management smart grids distributed algorithm convergence rate

来源：评论

学校读者我要写书评

暂无评论

distributed topology control of multiple ISAC-UAVs for mobile search teams in unknown 3-D terrains

引用

AD HOC NETWORKS 2025年 169卷

作者： Luo, Xijian Xie, Jun Xiong, Liqin Liu, Yaqun He, Yuan Army Engn Univ Coll Command & Control Engn Nanjing 210007 Jiangsu Peoples R China

In emergency communication scenarios, the deployment of multiple unmanned aerial vehicles (UAVs) can rapidly provide communication coverage and restore network connectivity. Though existing research has paid attention to the issue of maintaining connectivity in multi-UAV networks, there are still some problems that have not been fully addressed. This paper investigates the scenario of deploying multiple UAVs with integrated sensing and communications (ISAC) abilities to provide data collection and communication coverage services for ground mobile users in a search mission. The aim is to maximize the sum of data collected from all users and minimize the adjustment cost of the UAV network while ensuring Backbone network connectivity during the search. By modeling the effect of 3-D terrains, the simulation environment presented in this paper is more realistic. Moreover, this paper assumes that the terrain within the search area is unknown, thus the search trajectory of the mobile user is also unknown. Asa consequence, centralized methods are infeasible. Accordingly, this paper proposes a distributed dynamic adjustment scheme, named QoS-Connectivity-Guaranteed distributed Adjustment (QCDA), to ensure both quality of service and network connectivity. The efficiency of the proposed scheme is validated through simulations, and its performance in terms of data collection, communication satisfaction ratio, the number of active UAVs as well as the adjustment cost of the UAV network is better than the baselines.

关键词： Integrated sensing and communications distributed algorithm Connectivity maintenance 3-D terrain model

来源：评论

学校读者我要写书评

暂无评论

Virtual Agents-Based Attack-Resilient distributed Control for Islanded AC Microgrid

引用

IEEE ACCESS 2025年 13卷 15825-15839页

作者： Zhang, Jun Mohiuddin, Sheik M. Qi, Junjian South Dakota State Univ McComish Dept Elect Engn & Comp Sci Brookings SD 57007 USA Pacific Northwest Natl Lab Energy & Environm Directorate Richland WA 99354 USA

Due to its dependence on a communication network, distributed secondary control of microgrids is susceptible to denial-of-service (DoS) attacks in channel shutdown mode, which may negatively impact the network connectivity and thus deteriorate the coordination and power sharing among distributed generators (DGs). Honeypot is a common method for cyber deception by introducing fake targets. However, in the context of microgrid, the misleading information spread by honeypots will also impact the system performance. This paper proposes an attack-resilient distributed control for AC microgrids utilizing virtual agents (VAs) to counteract both DoS edge and node attacks. The VAs are designed to not impact the system's steady state during normal operation but to share information among neighboring real agents and serve as dummy targets for DoS attacks. The control with VAs is implemented by a primal-dual gradient-based distributed algorithm to efficiently obtain a practical solution for voltage/frequency regulation and power sharing. The simulation results on a 4-DG test system and a modified IEEE 34-bus system show that 1) VAs do not impact the normal functionality of the test system, and 2) deploying VAs can enhance the resilience of the microgrid control against DoS edge and node attacks.

关键词： Microgrids Decentralized control Voltage control Reactive power Frequency control Denial-of-service attack Communication networks Steady-state Network topology Laplace equations AC microgrid cooperative control denial-of-service (DoS) attack distributed algorithm distributed control primal-dual gradient resilience virtual agent

来源：评论

学校读者我要写书评

暂无评论

Initialization-free distributed Network Size Estimation via Implicit-explicit Discretization Method

引用

INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2025年第2期23卷 664-673页

作者： Lee, Donggil Lim, Yoonseob Incheon Natl Univ Dept Elect Engn Incheon 22012 South Korea Korea Inst Sci & Technol KIST Artificial Intelligence & Robot Inst Seoul 02792 South Korea

This paper proposes a distributed algorithm for estimating the network size, which refers to the total number of agents in a network. Our approach is based on an optimization problem, where the solution corresponds to the network size and the objective function can be decomposed into individual agents' objectives. This enables the use of distributed methods such as the primal-dual gradient method. We focus on a continuous-time primal-dual gradient method and adapt it using an implicit-explicit scheme to run in discrete time. This approach eliminates the need for small step sizes and ensures rapid convergence. Unlike existing methods that require specific initial values, our method can provide the network size regardless of the initial values, making it robust to network changes.

关键词： distributed algorithm implicit-explicit discretization network size estimation primal-dual method

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient distributed Learning via Sparse and Adaptive Stochastic Gradient

引用

IEEE TRANSACTIONS ON BIG DATA 2025年第1期11卷 234-246页

作者： Deng, Xiaoge Li, Dongsheng Sun, Tao Lu, Xicheng Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China

Gradient-based optimization methods implemented on distributed computing architectures are increasingly used to tackle large-scale machine learning applications. A key bottleneck in such distributed systems is the high communication overhead for exchanging information, such as stochastic gradients, between workers. The inherent causes of this bottleneck are the frequent communication rounds and the full model gradient transmission in every round. In this study, we present SASG, a communication-efficient distributed algorithm that enjoys the advantages of sparse communication and adaptive aggregated stochastic gradients. By dynamically determining the workers who need to communicate through an adaptive aggregation rule and sparsifying the transmitted information, the SASG algorithm reduces both the overhead of communication rounds and the number of communication bits in the distributed system. For the theoretical analysis, we introduce an important auxiliary variable and define a new Lyapunov function to prove that the communication-efficient algorithm is convergent. The convergence result is identical to the sublinear rate of stochastic gradient descent, and our result also reveals that SASG scales well with the number of distributed workers. Finally, experiments on training deep neural networks demonstrate that the proposed algorithm can significantly reduce communication overhead compared to previous methods.

关键词： Servers Stochastic processes Quantization (signal) Training Convergence Computational modeling Adaptation models Adaptive aggregation distributed algorithm efficient communication gradient sparsification stochastic gradient descent

来源：评论

学校读者我要写书评

暂无评论

Game theory-based peer-to-peer energy storage sharing for multiple bus charging stations: A real-time distributed cooperative framework

引用

JOURNAL OF ENERGY STORAGE 2025年 109卷

作者： Shi, Jinkai Zhang, Weige Bao, Yan Gao, David Wenzhong Fan, Senyong Beijing Jiaotong Univ Natl Act Distribut Network Technol Res Ctr NANTEC Shang Yuan Cun 3 Beijing 100044 Peoples R China Univ Denver Dept Elect & Comp Engn Denver CO 80208 USA

The rapid development of electric buses has promoted a significant increase in bus charging stations. Fast charging and high charging demand increase the electricity costs for charging stations. To improve economic benefits and reduce reliance on the utility grid, energy sharing among multiple charging stations integrated with the battery energy storage system and PV generation can be a potential solution. This paper proposes a game theory-based real-time energy storage sharing for multiple bus charging stations to optimize tie-line powers and energy scheduling within the stations cooperatively. Considering uncertainties of arrival time and energy consumption, a real-time correction bus charging strategy is developed. To protect privacy and improve computational efficiency, we present a fully distributed mechanism and accelerated gradient algorithm for an equilibrium solution. In addition, we propose a cost allocation approach based on net load correlation and the contribution of energy storage systems to promote the development of the alliance. The proposed model and algorithm are applied to a real-world bus charging station in Beijing, China. The results show that P2P energy sharing reduces electricity consumption and saves 13.03% of the total cost. It is reflected that the parallel distributed algorithm reduces convergence time and the optimal solution approaches that of centralized methods.

关键词： Charging stations Game theory Energy cooperation Battery energy storage system distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage distributed Task Assignment algorithm Based on Contract Net Protocol for Multi-UAV Cooperative Reconnaissance Task Reassignment in Dynamic Environments

引用

SENSORS 2023年第18期23卷 7980-7980页

作者： Wang, Gang Lv, Xiao Yan, Xiaohu Naval Univ Engn Coll Comp Engn Wuhan 430033 Peoples R China Shenzhen Polytech Univ Sch Undergrad Educ Shenzhen 518055 Peoples R China

Multi-UAV systems have been widely used in reconnaissance, disaster relief, communication, and other fields. However, many dynamic events can cause a partial failure of the original mission during the mission execution process, in which case task reassignment should be carried out. How to reassign resources and tasks in multi-dynamic, multi-target, and multi-constraint events becomes a core issue in the enhancement of combat efficiency. This paper establishes a model of multi-UAV cooperative reconnaissance task reassignment that comprehensively considers various dynamic factors such as UAV performance differences, size of target areas, and time window constraints. Then, a two-stage distributed task assignment algorithm (TS-DTA) is presented to achieve multi-task reassignment in dynamic environments. Finally, this paper verifies the effectiveness of the TS-DTA algorithm through simulation experiments and analyzes its performance through comparative experiments. The experimental results show that the TS-DTA algorithm can efficiently solve the task reassignment problem in dynamic environments while effectively reducing the communication burden of UAV formations.

关键词： multi-UAVs task reassignment distributed algorithm two stage contract net protocol

来源：评论

学校读者我要写书评

暂无评论

Spatial barycentric coordinates based distributed formation control for multi-agent systems

引用

ISA TRANSACTIONS 2025年 156卷 333-343页

作者： Li, Fangyuan Ning, Jialing Liu, Hui Zhang, Yubo Liu, Yanhong Zhengzhou Univ Sch Elect & Informat Engn Zhengzhou Peoples R China Robot Percept & Control Engn Res Ctr Henan Prov Zhengzhou Peoples R China China United Network Commun Co Ltd Beijing Peoples R China

Many applications of multi-agent systems have to execute some tasks in certain formations, while not all nodes have access to localization technologies such as GPS. This paper investigates the problem of formation control for multi-agent systems in three-dimensional space relying on distances between nodes and positions of anchor nodes. The position information of all nodes is represented using generalized spatial barycentric coordinates, and the condition that the formation shape can be uniquely represented by the barycentric coordinates is given. Then, based on this representation method, a distributed spatial formation algorithm is proposed to guide all agents from their initial positions towards the desired ones. Finally, simulation studies have been presented to validate the effectiveness and correctness of the proposed algorithm and design conditions.

关键词： Formation control distributed algorithm Barycentric coordinates Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：