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

Blockchain and signcryption enabled asynchronous federated learning framework in fog computing

Digital Communications and Networks 2025年第02期 442-454页

作者： Zhou Zhou Youliang Tian Jinbo Xiong Changgen Peng Jing Li Nan Yang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology

Federated learning combines with fog computing to transform data sharing into model sharing, which solves the issues of data isolation and privacy disclosure in fog computing. However, existing studies focus on centralized single-layer aggregation federated learning architecture, which lack the consideration of cross-domain and asynchronous robustness of federated learning, and rarely integrate verification mechanisms from the perspective of incentives. To address the above challenges, we propose a Blockchain and Signcryption enabled Asynchronous Federated Learning(BSAFL) framework based on dual aggregation for cross-domain scenarios. In particular, we first design two types of signcryption schemes to secure the interaction and access control of collaborative learning between domains. Second, we construct a differential privacy approach that adaptively adjusts privacy budgets to ensure data privacy and local models' availability of intra-domain user. Furthermore, we propose an asynchronous aggregation solution that incorporates consensus verification and elastic participation using blockchain. Finally, security analysis demonstrates the security and privacy effectiveness of BSAFL, and the evaluation on real datasets further validates the high model accuracy and performance of BSAFL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to "DSTF: A diversified spatio-temporal feature extraction model for traffic flow prediction" [Neurocomputing 621 (2025) 129280] (Neurocomputing (2025) 621, (S0925231224020514), (10.1016/***.2024.129280))

引用

Neurocomputing 2025年 638卷

作者： Wang, Xing Wang, Xiaojun Huang, Faliang Zou, Fumin Liao, Lyuchao Zeng, Ruihao Fujian Normal University College of Computer and Cyber Security China Fujian Normal University Digital Fujian Institute of Big Data Security Technology China Nanning Normal University Guangxi Key Lab of Human-machine Interaction and Intelligent Decision China Fujian University of Technology Fujian Key Laboratory of Automotive Electronic and Electrical Drive Technology China The University of Sydney School of Civil Engineering Sydney Australia

The authors regret to inform that: (1) During the resubmission stage of the revised manuscript, in compliance with reviewers' recommendations to show standard deviations in the experimental results (In Section 5. Experiment implementation), a batch replacement operation (intended to replace "+" with "±" for data formatting) inadvertently replaced the "+" symbols in the mathematical formulas and the explanatory text with "±" symbols (In Section 3. Problem statement and Section 4. Methodology). (2) In proof stage, we sincerely apologize for failing to identify this issue during the final proofreading stage. Correction statement and details: As this error may affect readers' understanding, we request a corrigendum to rectify this error. In Section 3. Problem statement and Section 4. Methodology, all instances of "±" symbols within mathematical formulas and their explanatory text should be reverted to the original "+" symbols. The authors would like to apologize for any inconvenience caused. © 2025 The Authors

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Time-Driven UAV Deployment and Content Caching Approach for Multi-UAV-Enabled Consumer Electronics Network

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Zhang, Jianshan Yang, Xu Ming, Rui Luo, Haibo Wang, Xiaoding Piran, Md. Jalil Minjiang University School of Computer and Big Data Fuzhou350108 China Fujian Normal University College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Fuzhou350117 China Chinese Academy of Tropical Agricultural Sciences National Key Laboratory for Tropical Crop Breeding Institute of Tropical Bioscience and Biotechnology Sanya Research Institute Hainan Sanya572024 China Sejong University Department of Computer Science and Engineering Seoul05006 Korea Republic of

To address the problem of high delay due to the explosive growth of mobile data traffic in consumer electronics network (CEN), in this paper, we investigate the multiple-unmanned aerial vehicle (UAV)-enabled CEN content caching problem, focusing on minimizing content access delay by jointly optimizing UAV deployment, ground user (GU) access, and content caching while satisfying other resource constraints. We propose an algorithm based on alternating optimization for the scenario where multiple UAVs and base station (BS) collaborate to provide caching services. The algorithm attains a sub-optimal solution with a convergence guarantee by iteratively solving the three sub-problems derived from the decomposition of the target problem. First, a convex difference-based algorithm solves the UAV deployment sub-problem. Second, a greedy-based algorithm is used to solve the content caching sub-problem. Then, a continuous convex approximation algorithm based on the penalty function is used to solve the user access sub-problem. Finally, the above procedure is repeated to obtain a sub-optimal solution to the target problem. The proposed joint optimization algorithm is shown to outperform the benchmark algorithms in terms of average content access delay and cache hit ratio, as evidenced by numerical results. © 1975-2011 IEEE.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Any-Angle Routing Algorithm for Microfluidic Biochips Driven by Flow Path

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 978-988页

作者： Youlin, Pan Shuai, Guo Xing, Huang Genggeng, Liu College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

Continuous-flow microfluidic biochips (CFMBs) have become a hot research topic in recent years due to their ability to perform biochemical assays automatically and efficiently. For the first time, PathDriver+ takes the requirements of the actual fluid transportation into account in the design process of CFMBs and implements the actual fluid transport and removal, and plans separate flow paths for each transport task, which have been neglected in previous work. However, PathDriver+ does not take full advantage of the flexibility of CFMBs routing because it only considers the optimization of flow channel length for the global routing in the mesh model, except for the detailed routing. In addition, PathDriver+ only considers the X architecture, while the existing work shows that the any-angle routing can utilize the routing resources more efficiently and shorten the flow channel length. To address the above issues, we propose a flow path-driven arbitrary angle routing algorithm, which can improve the utilization of routing resources and reduce the flow channel length while considering the actual fluid transportation requirements. The proposed algorithm constructs a search graph based on constrained Delaunay triangulation to improve the search efficiency of routing solutions while ensuring the routing quality. Then, a Dijkstra-based flow path routing method is used on the constructed search graph to generate a routing result with a short channel length quickly. In addition, in the routing process, channel reuse strategy and intersection optimization strategy are proposed for the flow path reuse and intersection number optimization problems, respectively, to further improve the quality of routing results. The experimental results show that compared with the latest work PathDriver+, the length of channels, the number of ports used, and the number of channel intersections are significantly reduced by 33.21%, 11.04%, and 44.79%, respectively, and the channel reuse rate is i

关键词： High level synthesis

来源：评论

学校读者我要写书评

暂无评论

Control Logic Routing for Continuous-Flow Microfluidic Biochips Based on Deep Reinforcement Learning

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 950-962页

作者： Cai, Huayang Huang, Xing Liu, Genggeng College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

With the advancement of electronic design automation, continuous-flow microfluidic biochips have become one of the most promising platforms for biochemical experiments. This chip manipulates fluid samples in milliliters or nanoliters by utilizing internal microvalves and microchannels, and thus automatically performs basic biochemical experiments, such as mixing and detection. To achieve the correct bioassay function, the microvalves deployed inside the chip are usually managed by a multiplexer-based control logic, and valves receive control signals from a core input through the control channel for accurate switching. Since biochemical reactions typically require high sensitivity, the length of control paths connecting each valve needs to be reduced to ensure immediate signal propagation, and thus to reduce the signal propagation delay. In addition, to reduce the fabrication cost of chips, a vital issue to be addressed in the logic architecture design is how to effectively reduce the total channel length within the control logic. To address the above issues, we propose a deep reinforcement learning-based control logic routing algorithm to minimize the signal propagation delay and total control channel length, thereby automatically constructing an efficient control channel network. The algorithm employs the dueling deep Q-network architecture as the agent of the deep reinforcement learning framework to evaluate the tradeoff between signal propagation delay and total channel length. Besides, the diagonal channel routing is implemented for the first time for control logic, thus fundamentally improving the efficiency of valve switching operations and reducing the fabrication cost of the chip. The experimental results demonstrate that the proposed algorithm can effectively construct a high-performance and low-cost control logic architecture. © 2025 Science Press. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

THC-DL: Three-Party Homomorphic Computing Delegation Learning for Secure Optimization

引用

IEEE Internet of Things Journal 2025年

作者： Yang, Ze Tian, Youliang Xiong, Jinbo Niu, Kun Li, Mengqian Zhang, Xinyu Ma, Jianfeng Guizhou University Guizhou Provincial Key Laboratory of Cryptography and Blockchain Technology College of Computer Science and Technology Guiyang550025 China Guizhou University College of Big Data and Information Engineering Guiyang550025 China Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou350117 China Xidian University State Key Laboratory of Integrated Services Network Xi’an710071 China Xidian University State Key Laboratory of Integrated Services Network School of Cyber Engineering Xi’an710071 China

Delegation Learning(DL) flourishes data sharing, enabling agents to delegate data to the cloud for model training. To preserve privacy, homomorphic encryption (HE) offers an effective solution for privacy-preserving machine learning (PPML) in delegation learning, yet faces critical challenges in functionality (non-linear activation support), practicality (ciphertext blow-up from iterative computations), and security (data leakage risks caused by public knowledge of the mathematical principles applied in model training). To tackle these challenges, we propose THC-DL, a three-party HE framework addressing these challenges holistically for the first time. We elaborately design the ciphertext secure comparison (DL-CSC) protocol to satisfy secure comparison with private inputs, enabling efficient non-linear operations with O(1) communication complexity that reduces runtime to 12.5% of the DGK (Dolev-Greensmith-Kent protocol, the well-known comparison protocol). Second, we construct a Truncation-Mapping (Tru-Map) scheme, a mechanism that transforms input data by truncating and mapping it into a domain that facilitates more efficient processing, and the addition of truncated mapped data to resolve ciphertext blow-up by adaptively scaling ciphertexts during iterative training, ensuring correctness. Third, we formalize data leakage risks in HE-based quadratic convex optimization (standard in ML) and apply THC-DL to construct a secure optimization scheme. Theoretical analysis confirms THC-DL’s resilience against input recovery attacks, even when adversaries exploit public model parameters. Experiments on a real-world platform validate DL-CSC’s efficiency and scalability while reducing the computational complexity and communication complexity from O(n) to O(1) where n denotes the length of the input bits. © 2014 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Li, Xinying Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

D-FGNAE: Decentralized Federated Graph Normalized AutoEncoder 19th

D-FGNAE: Decentralized Federated Graph Normalized AutoEncode...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Liang, Yuting Cai, Weixin Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Graphs widely exist in real-world, and Graph Neural Networks (GNNs) have exhibited exceptional efficacy in graph learning in diverse fields. With the strengthening of data privacy protection worldwide in recent years, Federated graph neural networks (FedGNNs) have gained increasing attention in academia and industry owing to their ability to train the model in a collaborative manner while complying with the privacy protection regulations. However, in federated learning, the non-independent and identically distributed (non-IID) problem of local data possessed by multiple participants can significantly undermine model accuracy. We propose a new Decentralized Federated Graph Normalized AutoEncoder (D-FGNAE). First, the model is designed as a decentralized federated learning framework with dynamically assigned tripartite roles. This design eliminates the fixed server role found in traditional federated learning, enhances system fault tolerance, avoids single points of failure, and protects model privacy. Second, the splitting and correcting of calculation by layer in the model, along with the special design of the normalization layer, effectively tackle the non-IID problem in both the structural and attribute aspects. Experimental results on real-world networks demonstrate the effectiveness of D-FGNAE, which can achieve nearly the same accuracy as the centralized model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Zhang, Yunan Wang, Chaohui Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

UGCM-LU: A Unified Stream and Batch Graph Computing Model with Local Update for Community Detection 19th

UGCM-LU: A Unified Stream and Batch Graph Computing Model w...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Li, Hong Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Unified stream and batch computing (USBC) aims to incorporate stream and batch computation into a unified framework, thereby enabling the development of a one-stop solution for stream and batch data processing and enhancing the generalization of the framework. However, research on unified graph computing models (UGCMs) faces several challenges. First, existing UGCMs need to consider all graph information in the cache during the incremental update phase, thus leading to decreased execution efficiency. Second, existing UGCMs use fixed bytes to store nodes without considering the actual space occupied by nodes resulting in wasted memory when dealing with large graphs. This paper proposes a UGCM with Local Updates for community detection (UGCM-LU). We first implement a local update strategy to consider partial information of the graph to achieve incremental updates. Secondly, we also designed a byte-compression-based module to store graph data according to the space occupied by nodes. The experimental results show the effectiveness and efficiency of the model in real-world and artificial networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lutetium alloys

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：