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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Jianfeng Zhang, Ying Jia, Riheng Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology) Ministry of Education China School of Computer Science and Technology Zhejiang Normal University China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

ISBN: (纸本)157735897X

Federated Learning (FL) mitigates privacy leakage in decentralized machine learning by allowing multiple clients to train collaboratively locally. However, dynamic mobile networks with high mobility, intermittent connectivity, and bandwidth limitation severely hinder model updates to the cloud server. Although previous studies have typically addressed user mobility issue through task reassignment or predictive modeling, frequent migrations may result in high communication overhead. Addressing this challenge involves not only dealing with resource constraints, but also finding ways to mitigate the challenges posed by user migrations. We therefore propose a intertemporal incentive framework, FedCross, which ensures the continuity of FL tasks by migrating interrupted training tasks to feasible mobile devices. FedCross comprises two distinct stages: Specifically, in Stage 1, we address the task allocation problem across regions under resource constraints by employing a multi-objective migration algorithm to quantify the optimal task receivers. Moreover, we adopt evolutionary game theory to capture the dynamic decision-making of users, forecasting the evolution of user proportions across different regions to mitigate frequent migrations. In Stage 2, we utilize a procurement auction mechanism to allocate rewards among base stations, ensuring that those providing high-quality models receive optimal compensation. This approach incentivizes sustained user participation, thereby ensuring the overall feasibility of FedCross. Finally, experimental results validate the theoretical soundness of FedCross and demonstrate its significant reduction in communication overhead. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized Federated Learning 39

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Hu, Gangqiang Lu, Jianfeng Han, Jianmin Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Zhejiang Normal University China School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

ISBN: (纸本)157735897X

Due to the sensitivity of data, Federated Learning (FL) is employed to enable distributed machine learning while safeguarding data privacy and accommodating the requirements of various devices. However, in the context of semi-decentralized FL, clients’ communication and training states are dynamic. This variability arises from local training fluctuations, heterogeneous data distributions, and intermittent client participation. Most existing studies primarily focus on stable client states, neglecting the dynamic challenges inherent in real-world scenarios. To tackle this issue, we propose a TRust-Aware clIent scheduLing mechanism called TRAIL, which assesses client states and contributions, enhancing model training efficiency through selective client participation. We focus on a semi-decentralized FL framework where edge servers and clients train a shared global model using unreliable intra-cluster model aggregation and inter-cluster model consensus. First, we propose an adaptive hidden semi-Markov model to estimate clients’ communication states and contributions. Next, we address a client-server association optimization problem to minimize global training loss. Using convergence analysis, we propose a greedy client scheduling algorithm. Finally, our experiments conducted on real-world datasets demonstrate that TRAIL outperforms state-of-the-art baselines, achieving an improvement of 8.7% in test accuracy and a reduction of 15.3% in training loss. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Study on Semi-Supervised Semantic Segmentation of Ship Flame Images

A Study on Semi-Supervised Semantic Segmentation of Ship Fla...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Junwei Wan Yaojie Chen XueCong Zheng Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China

In addressing the challenges of limited semantic labeling data and imprecise segmentation regions prevalent in the semantic segmentation of ship flame images, this study introduces a semi-supervised semantic segmentation method tailored for ship flame images. This approach is grounded in the principles of pairwise similarity with strong-weak perturbations. Adopting a pseudo-label self-learning strategy, the method employs weak-strong perturbation pairwise similarity, ensuring the propagation of high-confidence predictions during label generation, and thereby enhancing performance. Additionally, to tackle the inherent difficulties presented by smoke enveloping and obscuring flame regions in ship images, we have conceived a Vertical Continuity Feature Enhancement module. This module empowers the model to discern more explicit inter-class boundaries. Empirical evaluations on our proprietary dataset substantiate the superiority of our method, registering an improvement of 4.12 percentage points in mIoU over other semi-supervised approaches. Such results attest to the efficacy of the proposed pairwise similarity approach and the Vertical Continuity Feature Enhancement module in flame semantic segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FedCross: Intertemporal Federated Learning Under Evolutionary Games

arXiv

引用

arXiv 2024年

作者： Lu, Jianfeng Zhang, Ying Jia, Riheng Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China School of Computer Science and Technology Zhejiang Normal University China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

Federated Learning (FL) mitigates privacy leakage in decentralized machine learning by allowing multiple clients to train collaboratively locally. However, dynamic mobile networks with high mobility, intermittent connectivity, and bandwidth limitation severely hinder model updates to the cloud server. Although previous studies have typically addressed user mobility issue through task reassignment or predictive modeling, frequent migrations may result in high communication overhead. Addressing this challenge involves not only dealing with resource constraints, but also finding ways to mitigate the challenges posed by user migrations. We therefore propose an intertemporal incentive framework, FedCross, which ensures the continuity of FL tasks by migrating interrupted training tasks to feasible mobile devices. Specifically, FedCross comprises two distinct stages. In Stage 1, we address the task allocation problem across regions under resource constraints by employing a multi-objective migration algorithm to quantify the optimal task receivers. Moreover, we adopt evolutionary game theory to capture the dynamic decision-making of users, forecasting the evolution of user proportions across different regions to mitigate frequent migrations. In Stage 2, we utilize a procurement auction mechanism to allocate rewards among base stations, ensuring that those providing high-quality models receive optimal compensation. This approach incentivizes sustained user participation, thereby ensuring the overall feasibility of FedCross. Finally, experimental results validate the theoretical soundness of FedCross and demonstrate its significant reduction in communication overhead. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized Federated Learning

arXiv

引用

arXiv 2024年

Due to the sensitivity of data, Federated Learning (FL) is employed to enable distributed machine learning while safeguarding data privacy and accommodating the requirements of various devices. However, in the context of semidecentralized FL, clients' communication and training states are dynamic. This variability arises from local training fluctuations, heterogeneous data distributions, and intermittent client participation. Most existing studies primarily focus on stable client states, neglecting the dynamic challenges inherent in real-world scenarios. To tackle this issue, we propose a TRust-Aware clIent scheduLing mechanism called TRAIL, which assesses client states and contributions, enhancing model training efficiency through selective client participation. We focus on a semi-decentralized FL framework where edge servers and clients train a shared global model using unreliable intra-cluster model aggregation and inter-cluster model consensus. First, we propose an adaptive hidden semi- Markov model to estimate clients' communication states and contributions. Next, we address a client-server association optimization problem to minimize global training loss. Using convergence analysis, we propose a greedy client scheduling algorithm. Finally, our experiments conducted on real-world datasets demonstrate that TRAIL outperforms state-of-the-art baselines, achieving an improvement of 8.7% in test accuracy and a reduction of 15.3% in training loss. © 2024, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing Model-Driven Federated Learning for Rational and Data-Efficient in Social Mobile Network

引用

IEEE Network 2024年

作者： Lu, Jianfeng Zhang, Ying Cao, Shuqin Wang, Wei Tang, Changbing Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China Zhejiang Normal University College of Physics and Electronic Information Engineering Jinhua321004 China

With the rise of data-intensive services in mobile networks, the demand for intelligent and efficient learning frameworks has grown exponentially. Federated Learning (FL), as an emerging paradigm, enables decentralized edge devices to collaboratively train large models without sharing raw data, ensuring privacy preservation. However, deploying FL in resource-constrained mobile environments faces significant challenges, such as free-riding and malicious behavior. These challenges hinder model performance and raise concerns about data integrity and inter-user cooperation. To address these issues, we propose a layered dynamic framework for social mobile networks, called FedSMN, which aims to enhance the generalization ability of collaboratively trained large models in FL environments. FedSMN leverages Bayesian inference to evaluate user behavior and employs evolutionary game theory to simulate dynamic interactions, thereby optimizing cooperation strategies and reducing communication overhead. Unlike traditional approaches that assume fully rational actors, FedSMN accounts for irrational behavior and fluctuating resources, designing an efficient incentive mechanism to improve data utilization. Extensive experiments on large-scale datasets demonstrate that FedSMN increases model accuracy by 21% and reduces communication overhead by 49%, paving the way for scalable, intelligent mobile networks powered by large models. © 1986-2012 IEEE.

关键词： Collaborative learning

来源：评论

学校读者我要写书评

暂无评论

PACE: Reputation-Driven Hierarchical Incentive Mechanism for Trusted Healthcare Transactions in Model Marketplace

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Lu, Jianfeng Dou, Xiaochi Rathore, Bharati Jhaveri, Rutvij H. Seid, Abegaz Mohammed Erbad, Aiman Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Ministry of Education Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology China United Kingdom Pandit Deendayal Energy University Department of Computer Science and Engineering School of Technology India Hamad Bin Khalifa University College of Science and Engineering Doha Qatar Qatar University College of Engineering Doha Qatar

Federated learning-based model marketplaces have the potential to securely leverage healthcare data for efficient healthcare transactions. However, the willingness to participate in this marketplace is severely hindered by self-interested model sellers, who maximize their personal gains via distorting the quality of their models. To this end, we propose a rePutation-driven hierArchical inCentive mEchanism, called PACE, which combines contract cooperation and game pricing to motivate model sellers to be honest, thereby improving the sustainability of the model marketplace via two-layer cooperation. Specifically, at the training layer, we design a reward payment rule based on multidimensional contracts, while at the trading layer, we use a competitive market pricing game to develop the accuracy pricing rule. In particular, the above rules cleverly combine the fine-grained model sellers' reputations with the willingness of healthcare devices to indirectly affect the model sellers' utilities. Theoretically, we prove that PACE can effectively incentivize model sellers to truthfully report model quality while satisfying both individual rationality and incentive compatibility with a fairness guarantee. Experimental results conducted on four real-world datasets show that our PACE improves the global performance by up to 12.85% and reduces the global loss by at least 19.23% compared with the state-of-the-art baselines. © 1975-2011 IEEE.

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

Generative Multi-View HRRP Recognition Based on Cascade Generation and Fusion Network

Generative Multi-View HRRP Recognition Based on Cascade Gene...

引用

IEEE International Conference on Radar

作者： Qiang Zhou Bingqian Yu Yanhua Wang Liang Zhang Le Zheng Difan Zou Xin Zhang School of Information and Electronics Beijing Institute of Technology Beijing China Beijing Key Laboratory of Embedded Real-Time Information Processing Technology Beijing China Department of Computer Science University of Hong Kong Hongkong China HKU Musketeers Foundation Institute of Data Science University of Hong Kong Hongkong China

ISBN: (数字)9798350362381

ISBN: (纸本)9798350362398

High-resolution range profile (HRRP) is critical for radar target recognition. However, HRRP data for non-cooperative targets are often sparsely collected, leading to limited performance of HRRP target recognition methods. To address the issue of sparse view target recognition, we propose a generative multi-view HRRP recognition (GMVR) model. Firstly, by leveraging the pattern learning and generation ability of deep generative models (DGMs), we propose a viewpoint feature expansion module (VFEM) to generate multi-view features adjacent to sparse viewpoints. Subsequently, based on feature-level fusion, we proposed a multi-view feature fusion module (MVFM). Aided by attention mechanisms, the generated features can be adaptively integrated, thereby reducing the decision bias caused by single-viewpoint HRRP samples. Additionally, we employ transfer learning to mitigate the small sample problem caused by sparse viewpoints. Experimental results demonstrate that the proposed method outperforms various comparison methods, achieving optimal performance.

关键词： Adaptation models Attention mechanisms Target recognition Transfer learning Radar Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Radar HRRP Open Set Recognition Using Hierarchical Prototype Learning

Radar HRRP Open Set Recognition Using Hierarchical Prototype...

引用

IEEE International Conference on Radar

作者： Yichen Liu Yanhua Wang Liang Zhang Binhua Yu Xiaojing Yang Yu-ang Zhang Le Zheng Difan Zou School of Information and Electronics Beijing Institute of Technology Beijing China Beijing Key Laboratory of Embedded Real-Time Information Processing Technology Beijing China Department of Computer Science University of Hong Kong Hongkong China HKU Musketeers Foundation Institute of Data Science University of Hong Kong Hongkong China

ISBN: (数字)9798350362381

ISBN: (纸本)9798350362398

High-resolution range profiles (HRRP) are increasingly employed in radar automatic target recognition (RATR). In practical applications of RATR, the environment is open and dynamic, and the recognition model is likely to encounter targets of unseen categories. However, traditional methods focus on a close-set scenario, where all categories in the test set are known during training. To bridge this gap, this paper proposes an open-set recognition (OSR) method based on hierarchical classification, developed from prototype learning. This method improves the generalization performance for recognizing known categories and identifies unknown categories while providing information about how the unknown categories relate to the known ones. Specifically, first, a four-layer category hierarchy is built based on prior knowledge to guide the training and testing stages. Next, we propose a hierarchical prototype loss (HPL) to constrain the feature space extracted by the prototype network so that the feature distribution of objects is consistent with the hierarchical category structure. Lastly, the trained prototype network makes predictions following the hierarchical structure. This operation could provide relationship information between the unknown and known categories. Extensive experiments on measured HRRP data validate the effectiveness of our proposed method for open-set recognition.

关键词： Training Bridges Target recognition Prototypes Radar Feature extraction Testing

来源：评论

学校读者我要写书评

暂无评论

RAS2P: Remote Attestation via Self-Measurement for SGX-based Platforms

RAS2P: Remote Attestation via Self-Measurement for SGX-based...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Ren, Zhengwei Li, Xueting Deng, Li Tong, Yan Xu, Shiwei Tang, Jinshan Wuhan University of Science and Technology School of Computer Science and Technology Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Wuhan University of Science and Technology School of Computer Science and Technology Wuhan China Agricultural University College of Informatics Huazhong Wuhan China George Mason University College of Health and Human Services Department of Health Administration and Policy Fairfax United States

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Remote Attestation (RA) is a security service by which a Verifier (Vrf) can verify the platform state of a remote Prover (Prv). However, in most existing RA schemes, the Prv might be vulnerable to denial of service (DoS) attacks due to the interactive challenge-response methodology while there is no authentication about the challenge. Worse, many schemes cannot effectively detect mobile malware that can be inactive during the on-demand attestation launched by the Vrf. In this paper, we propose a self-measurement RA for SGX-based platforms, which can effectively mitigate DoS attacks and defend against mobile malware. To this end, a two-way identity authentication is first enforced between the Prv and Vrf with the help of a blockchain system, in which a shared session key is also generated. Secondly, trigger conditions of measurements on the Prv's side are time points generated by the Prv self instead of Vrf's requests. The Vrf can retrieve multiple self-measurement results during one execution of the protocol to monitor the Prv's platform over a period of time continuously, which can detect mobile malware effectively. Our scheme utilizes SGX to provide the runtime protection for sensitive information such as session key, self-measurement code, time points of self-measurements, and self-measurement results, making a higher security guarantee. In addition, the session key, time points of self-measurements, and self-measurement code can be changed or upgraded, making our scheme more flexible and scalable. The simulation implementation and results show that our scheme is feasible and practical. © 2022 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：