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

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

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

TFGDA: exploring topology and feature alignment in semi-supervised graph domain adaptation through robust clustering 24

TFGDA: exploring topology and feature alignment in semi-supe...

引用

Proceedings of the 38th International Conference on Neural Information processing Systems

作者： Jun Dan Weiming Liu Chunfeng Xie Hua Yu Shunjie Dong Yanchao Tan Zhejiang University Queen Mary University of London Dalian University of Technology Shanghai Jiao Tong University Fuzhou University and Engineering Research Center of Big Data Intelligence Ministry of Education and Fujian Key Laboratory of Network Computing and Intelligent Information Processing

ISBN: (纸本)9798331314385

Semi-supervised graph domain adaptation, as a branch of graph transfer learning, aims to annotate unlabeled target graph nodes by utilizing transferable knowledge learned from a label-scarce source graph. However, most existing studies primarily concentrate on aligning feature distributions directly to extract domain-invariant features, while ignoring the utilization of the intrinsic structure information in graphs. Inspired by the significance of data structure information in enhancing models' generalization performance, this paper aims to investigate how to leverage the structure information to assist graph transfer learning. To this end, we propose an innovative framework called TFGDA. Specially, TFGDA employs a structure alignment strategy named STSA to encode graphs' topological structure information into the latent space, greatly facilitating the learning of transferable features. To achieve a stable alignment of feature distributions, we also introduce a SDA strategy to mitigate domain discrepancy on the sphere. Moreover, to address the overfitting issue caused by label scarcity, a simple but effective RNC strategy is devised to guide the discriminative clustering of unlabeled nodes. Experiments on various benchmarks demonstrate the superiority of TFGDA over SOTA methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Label Distribution Learning with Correlation Information

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Lin, Yaojin Guo, Wenzhong Ding, Weiping College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Zhangzhou363000 China School of Information Science and Technology Nantong University Nantong226019 China

Label distribution learning quantifies the label space for each instance and has widely applicability in different fields. However, most existing works primarily focus on label correlation, but they still have a limitation in capturing instance correlation. Meanwhile, traditional label distribution learning operates on individual labels sequentially, leading to limitation in applying common features. Therefore, in this paper, we propose a novel approach for label distribution learning with correlation information i.e. instance correlation and label correlation. Specifically, the instance correlation and label correlation are identified by an optimization function and Pearson correlation coefficient, respectively. Besides, we conduct $\ell_{2,1}-$norm regularization to exploit common features. Comprehensive experiments manifest the superiority of our proposed approach against other well-established label distribution learning algorithms. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

DDoS Detection and Defense Based on FLAD and SDN

DDoS Detection and Defense Based on FLAD and SDN

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Jie Dong Wenyu Fang Wanling Zheng Jinkun Liu Yanhua Liu College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China

ISBN: (数字)9798350356328

ISBN: (纸本)9798350356335

In order to achieve more efficient and accurate DDoS detection while ensuring data privacy, this paper proposes a DDoS detection method based on FLAD. Firstly, this paper uses the FLAD algorithm to train a global DDoS detection model without leaving local traffic data, protecting the privacy and security of traffic data between different hosts, and improving aggregation efficiency by dynamically adjusting the aggregation weights to adapt to different sub-dataset increments. Secondly, a DDoS traffic detection method based on the integration of LSTM and CNN is proposed, which extracts and analyzes the temporal correlation of traffic data by calculating the statistical characteristics of traffic data within a time period, to achieve real-time detection of traffic feature data. Again, combined with the concept of SDN, real-time defense against DDoS based on ODL-API is implemented, and precise matching of DDoS detection results with network entity information is achieved, realizing the technology of real-time and precise issuance of multiple flow rules, effectively blocking DDoS malicious attack traffic, protecting important entities in the topology, and maintaining stable traffic in the topology. This paper focuses on solving the detection problem of DDoS traffic data increments and uneven data distribution through the FLAD algorithm. Experimental results show that the proposed method improves the accuracy of DDoS attack detection by more than 4% and the F1 Score by more than 7% compared to the FedAvg aggregation algorithm.

关键词： Training Data privacy network topology Denial-of-service attack Feature extraction Real-time systems Topology Labeling Computer crime Long short term memory

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Structure-Guided Graph Generation for Multi-View Semi-Supervised Classification

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Chen, Zhaoliang Zou, Ying Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Department of Computer Science Hong Kong Baptist University Hong Kong

Graph convolutional network has emerged as a focal point in machine learning because of its robust graph processing capability. Most existing graph convolutional network-based approaches are designed for single-view data, yet in many practical scenarios, data is represented through multiple views. Although the ability of graph convolutional network is undeniable, the quality of graph directly affects its performance. Moreover, the process of graph generation with traditional nearest neighbor in traditional multi-view learning actually amplifies the influence of different information on performance across these views. To tackle the aforementioned challenges, this paper proposes a multi-scale graph generation deep learning framework, called multi-scale semi-supervised graph generation based multi-view classification, consisting of two modules: edge sampling and path sampling. The former aims to generate an adjacency graph by selecting edges based on the maximum likelihood among graphs from different views. Meanwhile, the latter seeks to construct adjacency graphs according to the characteristics of paths within the graphs. Extensive experimental results robustly demonstrate the superior performance of our proposed framework, compared to other state-of-the-art multi-view semi-supervised approaches. © 2024, The Authors. All rights reserved.

关键词： Self-supervised 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

来源：评论

学校读者我要写书评

暂无评论

A Novel DDoS Detection Model for SDN Using Single-Class Cluster Oversampling and Weighted Ensemble Method

A Novel DDoS Detection Model for SDN Using Single-Class Clus...

引用

International Conference on network Protocols

作者： Hao Zhang Shuqi Wu Jie Pan Zhi Wang Xiaolong Sun College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou China

ISBN: (数字)9798350351712

ISBN: (纸本)9798350351729

The centralized control plane characteristic of Software Defined networking (SDN) makes it a prime target for Distributed Denial of Service (DDoS) attacks. A significant issue in network traffic data is the severe imbalance between background traffic and various types of DDoS attack traffic. To address this challenge, we propose a novel DDoS detection model based on single-class cluster oversampling and weighted ensemble method. Initially, we design a multi-strategy feature selection using variance inflation factor and recursive feature elimination. Next, we construct a single-class cluster model based on the spatial distribution of samples, and create minority class samples independently within each cluster. Finally, detection results are determined using the weight vector of each base classifier in ensemble learning. The proposed DDoS detection model's performance is validated through simulations of various DDoS attack scenarios in an SDN environment. Experimental results indicate that the proposed strategy exhibits superior performance, showing improvements in precision, recall, and F1 score compared to state-of-the-art techniques.

关键词： Interpolation Protocols Telecommunication traffic Denial-of-service attack Feature extraction Vectors Data models Ensemble learning Computer crime Software defined networking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：