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

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

来源：评论

学校读者我要写书评

暂无评论

HyperDiff: Masked Diffusion Model with High-efficient Transformer for Hyperspectral Image Cross-Scene Classification

HyperDiff: Masked Diffusion Model with High-efficient Transf...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Zhang, Pei Wang, Dong Wu, Chanyue Yang, Jing Kang, Lei Bai, Zongwen Li, Ying Shen, Qiang School of Computer Science Northwestern Polytechnical University Xi'an China Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data Yan'an University Yan'an China School of Automation and Software Engineering Shanxi University Taiyuan China Qingdao Topscomm Communication Co. Ltd. Qingdao China Department of Computer Science Aberystwyth University Aberystwyth United Kingdom

ISBN: (纸本)9798350368741

Hyperspectral Image (HSI) cross-scene classification is a challenging task in remote sensing, particularly when real-time processing of Target Domain (TD) HSI is required, and data cannot be reused for training. While deep learning methods have shown promising results, the generalization ability of HSI representations remains limited, mainly due to class label imbalance. This paper introduces a dual-stage learning framework based on transfer learning to enhance classification accuracy in the TD. The framework includes a self-supervised learning stage and a supervised fine-tuning stage. The self-supervised stage focuses on learning robust representations by leveraging inherent structures within HSI data, while the fine-tuning stage uses training labels to extract semantic information. A masked diffusion model predicts masked tokens from unmasked ones, capturing both high-level structures and fine details in HSI data. An efficient spatiospectral Transformer, which removes self-attention from the decoder, is proposed to enhance the self-supervised process. This design allows mask tokens to obtain information from visible tokens without interacting with each other, reducing sequence length and computational costs. By decoding each mask token conditionally independently, only a subset of masked tokens is processed. Extensive experiments on two public HSI datasets demonstrate that the proposed method outperforms state-of-the-art techniques. © 2025 IEEE.

关键词： Cross-scene classification Diffusion model Hyperspectral image Transformer

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Semantic Feature Interaction network for Semantic Change Detection in Remote Sensing Images

引用

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2025年

作者： Zhang, Yuhang Zhang, Wuxia Ding, Songtao Wu, Siyuan Lu, Xiaoqiang Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an710121 China Xi'an University of Technology College of Computer Science and Engineering Shaanxi Xi'an710048 China Fuzhou University College of Physics and Information Engineering Fuzhou350002 China

Semantic Change Detection (SCD) in Remote Sensing Images (RSI) aims to identify changes in the type of Land Cover/Land Use (LCLU) corresponding to changed areas in RSI. The "from-to" information of the acquired image has more profound practical significance than Binary Change Detection (BCD). However, most deep learning-based SCD algorithms do not fully exploit the spatial-temporal information of multi-level features, leading to challenges in extracting LCLU features in complex changing scenes. To address these issues, we propose a Spatial-Temporal Semantic Feature Interaction network (STS-FINet) to improve the performance of SCD in RSI. The proposed STS-FINet comprises a Multi-Scale Feature Extraction Encoder (MS-FEE), a Transformer-based Multi-Level Feature Interaction module (TML-FI), and a Multi-Level Feature Fusion Decoder (ML-FFD). The MS-FEE extracts deep semantic and differential information from the RSI. The TML-FI is designed to mine the spatial-temporal information by extracting long-range dependencies and spatial information from multi-level features to improve spatial perception. Moreover, Mixed Spatial Reasoning Convolution block (MixSrc) is presented to enrich the spatial information by extracting the multi-scale features, thus improving the model's capability to interpret complex changing scenes. Finally, ML-FFD integrates the multi-level features, resulting in the generation of the semantic change map. The effectiveness of the proposed STS-FINet is verified on two high-resolution RSI datasets. Experimental results show that the proposed STS-FINet achieves better change detection performance than SOTA methods. © 2008-2012 IEEE.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

Rethinking attention mechanism for enhanced pedestrian attribute recognition

引用

Neurocomputing 2025年 639卷

作者： Wu, Junyi Huang, Yan Gao, Min Niu, Yuzhen Chen, Yuzhong Wu, Qiang Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou350108 China Engineering Research Center of BigData Intelligence Ministry of Education Fujian Fuzhou350108 China Australian Artificial Intelligence Institute University of Technology Sydney SydneyNSW2007 Australia Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou University Fujian Fuzhou350108 China School of Electrical and Data Engineering University of Technology Sydney SydneyNSW2007 Australia

Pedestrian Attribute Recognition (PAR) plays a crucial role in various computer vision applications, demanding precise and reliable identification of attributes from pedestrian images. Traditional PAR methods, though effective in leveraging attention mechanisms, often suffer from the lack of direct supervision on attention, leading to potential overfitting and misallocation. This paper introduces a novel and model-agnostic approach, Attention-Aware Regularization (AAR), which rethinks the attention mechanism by integrating causal reasoning to provide direct supervision of attention maps. AAR employs perturbation techniques and a unique optimization objective to assess and refine attention quality, encouraging the model to prioritize attribute-specific regions. Our method demonstrates significant improvement in PAR performance by mitigating the effects of incorrect attention and fostering a more effective attention mechanism. Experiments on standard datasets showcase the superiority of our approach over existing methods, setting a new benchmark for attention-driven PAR models. © 2025 The Authors

关键词： Perturbation techniques

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on Adaptive Perturbation on Federated Graph Learning 25

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on ...

引用

Proceedings of the ACM on Web Conference 2025

作者： Ken Li Bin Shi Jiazhe Wei Bo Dong School of Computer Science and Technology Xi'an Jiaotong University Xi'an China and Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an China School of Computer Science and Technology Xi'an Jiaotong University Xi'an China and Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China School of Distance Education Xi'an Jiaotong University Xi'an China and Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China

ISBN: (纸本)9798400712746

Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What's more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the *** address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client's local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom de

关键词： backdoor attacks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：