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

Multi-agent Collaboration for Vehicular Task Offloading Using Federated Deep Reinforcement Learning

IEEE Transactions on Mobile computing 2025年

作者： Chen, Xing Xiao, Bohuai Lin, Xinyu Chen, Zheyi Min, Geyong Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science ExeterEX4 4QF United Kingdom

Mobile Edge computing (MEC) distributes resources such as computing, storage, and bandwidth to the side close to users, which can provide low-latency services to in-vehicle users, thus promising a more efficient and safer driving environment. However, due to the dynamic scale of vehicle and the variability of resource requirements, it is a significant challenge to quickly obtain effective task offloading in large-scale vehicle scenarios. The existing studies generally adopt the centralized decision-making method, with long decision-making time and high computational overhead, which cannot effectively achieve good offloading decisions in large-scale scenarios. To address these problems, we propose a Multi-agent Collaborative Method for vehicular task offloading using Federated Deep Reinforcement Learning called MCM-FDRL. First, each vehicle as an agent, independently makes offloading decisions based on local information. Next, the offloading decision model of each vehicle is obtained through federated reinforcement learning training. At runtime, an effective vehicle offloading plan can be gradually developed through multi-agent collaboration. Using two real-world datasets, experiments show that the MCM-FDRL has good adaptability and scalability. Moreover, compared to the state-of-the-art methods, the task's average response time of the MCM-FDRL is reduced by 9.75%-64.90%, respectively. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Medical Image Segmentation Based on 3d Pdc with Swin Transformer

SSRN

引用

SSRN 2025年

作者： Fan, Lin Ding, Xiaojia Wang, Zhongmin Wang, Hai Zhang, Rong School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China The School of Information Science and Technology Northwest University Shaanxi Xi’an710121 China

3D medical image segmentation is vital for disease diagnosis and effective treatment strategies. Despite the advancements in Convolutional Neural networks (CNN), their fixed receptive fields constrain global context modeling, leading to suboptimal performance, particularly with complex shapes and multi-scale variations. Transformer enhances the global modeling capability through self-attention mechanism. However, challenges persist in capturing fine-grained local features and extracting edge features. To overcome these issues, In this study, a dual-path encoder is proposed, which consists of a 3D PDC and a Swin Transformer and is combined with a CNN for the decoder. The 3D PDC module extracts local features by calculating the differences between neighboring pixels. To improve the ability of capturing edge structures, three 3D PDC variants (3D CPDC, 3D APDC, and 3D RPDC) are proposed to optimize the processing ability of complex edges, multi-directional edges, and multi-scale structures, respectively. After performance evaluation, the selected CARV combinations (3D CPDC, 3D APDC, 3D RPDC, and 3D ordinary convolution) achieve a compromise between high segmentation accuracy and low computational cost. The Swin Transformer encoder captures global context using a hierarchical shift-window mechanism, while the CNN decoder fuses features progressively to produce precise pixel-level segmentation. The proposed method exceeds the performance of existing state-of-the-art techniques, as shown by experiments conducted on the BTCV, FLARE21, and AMOS22 datasets. © 2025, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

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

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan 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 Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Relative influence maximization in competitive social networks

引用

Science China(information Sciences) 2017年第10期60卷 252-254页

作者： Dingda YANG Xiangwen LIAO Huawei SHEN Xueqi CHENG Guolong CHEN College of Physics and Information Engineering Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Institute of Computing Technology Chinese Academy of Sciences

In many realistic scenarios,such as political election and viral marketing,two opposite opinions,i.e.,positive opinion and negative opinion,spread simultaneously in the same social networks[1,2].Consequently,to achiev... 详细信息

关键词： net RIM Relative influence maximization in competitive social networks Figure

来源：评论

学校读者我要写书评

暂无评论

MLXR: multi-layer obstacle-avoiding X-architecture Steiner tree construction for VLSI routing

引用

Science China(information Sciences) 2017年第1期60卷 211-213页

作者： Xing HUANG Wenzhong GUO Genggeng LIU Guolong CHEN College of Mathematics and Computer Sciences Fuzhou University Key Laboratory of Network Computing and Intelligent Information Processing (Fujian Province) Fuzhou University

Dear editor,Rectilinear Steiner minimal tree(RSMT)has been widely used in several modern very large scale integration(VLSI)circuit design *** of its importance,it has been fully studied in the past *** addition,the density of modern VLSI chips has increased *** today’s VLSI designs,there are increasingly more obstacles,such as IP blocks and pre-routed nets,these

关键词： VLSI MLXR multi-layer obstacle-avoiding X-architecture Steiner tree construction for VLSI routing tree

来源：评论

学校读者我要写书评

暂无评论

Meta-path and Meta-schema Hierarchical Aggregation for Heterogeneous Graph Neural networks 10

Meta-path and Meta-schema Hierarchical Aggregation for Heter...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wu, Ling Gao, Pingping Guo, Kun Fujian Key Laboratory of Network Computing and Intelligent Information Processing China

ISBN: (纸本)9798331520861

With deep learning's advancement in recent years, heterogeneous graph neural networks (HGNNs) have drawn a lot of interest. They are a group of deep learning models specifically designed for handling heterogeneous graph data, in which nodes and edges are of various types and all nodes are assumed to have either direct or indirect associations. A metaschema, which serves as a thorough and unified blueprint for the heterogeneous graph, elegantly connects varied node types to other heterogeneous nodes via multiple heterogeneous edges with rich sematincs. However, many existing methods that utilize meta-schema to mine heterogeneous information often focus on the different meta-relationships inside the schema, limiting the meta-schema to describing only the local relational semantics. To better utilize meta-schema for efficiently integrating different heterogeneous information, we organize them into a hierarchical structure(i.e., hierarchical meta-schema), with all types of nodes distributed across different layers. The layers are interconnected through heterogeneous relationships. The target type is placed at the final layer and others are arranged hierarchically in the front according to the heterogeneous relationships defined in the meta-schema. During information aggregation, according to the hierarchical meta-schema, the information of each layer is gradually aggregated to the target type on the final layer from far to near via the attention mechanism. Moreover, metapaths regularly begin and end with the same type and help to define complex structures and semantic. Therefore, we also consider the semantic information of neighbors based on metapaths within the proposed hierarchical meta-schema to enhance the complex semantics among nodes of the same-type that may be lacking in the meta-schema. Finally, we proposed a meta-path and meta-schema hierarchical aggregation for heterogeneous graph neural network model, named HGNN-MMHA. And we may allow the meta-schema to not

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

MOAL: Multi-view Out-of-distribution Awareness Learning

引用

Neural networks 2025年 190卷

作者： Xuzheng Wang Zihan Fang Shide Du Wenzhong Guo Shiping Wang College of Computer and Data Science Fuzhou University Fuzhou 350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350108 China

Multi-view learning integrates data from multiple sources to enhance task performance by improving data quality. However, existing approaches primarily focus on intra-distribution data learning and consequently fail to identify out-of-distribution instances effectively. This paper introduces a method to improve the perception of out-of-distribution data in multi-view situations. First, we employ multi-view consistency and complementarity principles to develop sub-view complementarity representation learning and multi-view consistency fusion layers, thereby enhancing the model’s perception ability to typical intra-distribution features. Additionally, we introduce a specialized multi-view training loss and an agent mechanism tailored for out-of-distribution scenarios, facilitating the ability to differentiate between known and new or anomalous instances effectively. The proposed approach enhances the recognition of out-of-distribution data by improving intra-distribution feature representations and minimizing the entropy associated with out-of-distribution instances. Experimental results on multiple multi-view datasets simulating out-of-distribution scenarios confirm the effectiveness of MOLA, which consistently outperforms all baselines with average accuracy improvements of over 5%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

XGRouter： high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of Computer Science 2015年第4期9卷 576-594页

作者： Genggeng LIU Wenzhong GUO Rongrong LI Yuzhen NIU Guolong CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350116 China

This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.

关键词： global routing overflow total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An adaptive offloading framework for Android applications in mobile edge computing

引用

Science China(information Sciences) 2019年第8期62卷 114-130页

作者： Xing CHEN Shihong CHEN Yun MA Bichun LIU Ying ZHANG Gang HUANG College of Mathematics and Computer Science Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University School of Software Tsinghua University Key Laboratory of High Confidence Software Technologies Ministry of Education

Mobile edge computing(MEC) provides a fresh opportunity to significantly reduce the latency and battery energy consumption of mobile applications. It does so by enabling the offloading of parts of the applications on mobile edges, which are located in close proximity to the mobile devices. Owing to the geographical distribution of mobile edges and the mobility of mobile devices, the runtime environment of MEC is highly complex and dynamic. As a result, it is challenging for application developers to support computation offloading in MEC compared with the traditional approach in mobile cloud computing, where applications use only the cloud for offloading. On the one hand, developers have to make the offloading adaptive to the changing environment, where the offloading should dynamically occur among available computation *** the other hand, developers have to effectively determine the offloading scheme each time the environment changes. To address these challenges, this paper proposes an adaptive framework that supports mobile applications with offloading capabilities in MEC. First, based on our previous study(DPartner), a new design pattern is proposed to enable an application to be dynamically offloaded among mobile devices, mobile edges,and the cloud. Second, an estimation model is designed to automatically determine the offloading *** this model, different parts of the application may be executed on different computation nodes. Finally, an adaptive offloading framework is implemented to support the design pattern and the estimation model. We evaluate our framework on two real-world applications. The results demonstrate that our approach can aid in reducing the response time by 8%–50% and energy consumption by 9%–51% for computation-intensive applications.

关键词： computation offloading software adaptation mobile edge computing application refactoring Android

来源：评论

学校读者我要写书评

暂无评论

Asymptotic solution of a wide moving jam to a class of higher-order viscous traffic flow models

引用

Applied Mathematics and Mechanics(English Edition) 2018年第5期39卷 609-622页

作者： Chunxiu WU College of Mathematics and Computer Science Quanzhou Normal UniversityQuanzhou 362000Fujian ProvinceChina Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000Fujian ProvinceChina Key Laboratory of Intelligent Computing and Information Processing Quanzhou 362000Fujian ProvinceChina

The boundary-layer method is used to study a wide moving jam to a class of higher-order viscous models. The equations for characteristic parameters are derived to determine the asymptotic solution. The sufficient and essential conditions for the wide moving jam formation are discussed in detail, respectively, and then used to prove or disprove the existence of the wide moving jam solutions to many well-known higher-order models. It is shown that the numerical results agree with the analytical results.

关键词： higher-order traffic flow model wide moving jam boundary-layer method,weighted essentially nonoscillatory （WENO） scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：