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

2025 IEEE International Conference on Mechatronics, ICM 2025

作者： Hu, Chuanqi Wang, Jin Chen, Yikai Chen, Yonghang Zheng, Zhi Meng, Jun Lu, Guodong Zhejiang University State Key Laboratory of Fluid Power and Mechatronic Systems Hangzhou310058 China Zhejiang University Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Hangzhou310058 China Robotics Research Center of Yuyao City Ningbo315400 China National Elite Institute of Engineering Chongqing University Chongqing401135 China School of Mechanical Engineering Zhejiang University Hangzhou310058 China College of Electrical Engineering Zhejiang University Hangzhou310027 China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou310027 China

ISBN: (纸本)9798331533892

This paper presents a trajectory tracking algorithm designed for autonomous quadrotors to navigate complex dy-namic environments that is resilient to collision disturbances. Since it combines Model Predictive Contouring Control (MPCC) with the capabilities of neural networks, our method is named MPCC Integrated with Neural Augmentation (MINA). By equip-ping the quadrotor with PVDF piezoelectric sensors, we achieve real-time perception of collision forces and utilize S4D-Conv Adaptive Net Architecture (SANA) for state computation, a network that integrates the advantages of S4D and convolutional kernels to enhance the accuracy of state predictions. We incorporate the predicted results into the MPCC framework to optimize the thrust output of the quadrotor for the next time step, ensuring precise trajectory tracking. Experimental validation demonstrates the reliability and effectiveness of our algorithm, providing an innovative solution for autonomous flight and trajectory tracking of quadrotors in complex dynamic environments. © 2025 IEEE.

关键词： Flight paths

来源：评论

学校读者我要写书评

暂无评论

Virtualizing Next-Generation Programmable Networks: Techniques, Use Cases, and Promising Future Directions

引用

IEEE Network 2025年第3期39卷 148-155页

作者： Chen, Xiang Du, Hongyang Liu, Wenjing Liu, Hongyan Zhang, Jianshan Yang, Xu Zhang, Dong Wu, Chunming Liu, Xuan Niyato, Dusit Zhejiang University College of Computer Science and Technology Hangzhou310027 China The University of Hong Kong Department of Electrical and Electronic Engineering Pokfulam Hong Kong Zhejiang Media Group Hangzhou310005 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Fuzhou350108 China Fuzhou University College of Computer and Data Science Fuzhou350108 China Yangzhou University College of Information Engineering College of Artificial Intelligence Yangzhou225009 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore

For decades, network virtualization plays a crucial role in modern networks, e.g., 6G mobile networks: tenants construct arbitrary virtual networks on the same physical network. However, production networks are becoming programmable and need more ways of network configurations. So prior techniques like SDN hypervisors are deprecated since they cannot configure programmable networks. In response, a new category of network virtualization techniques has emerged recently to virtualize programmable networks, i.e., programmable network hypervisors (PNHs). This article first reviews this trend to comprehensively survey PNHs. To understand their benefits, we build a testbed with hardware switches and sophisticated topologies. Our testbed experiments stress-test hypervisors and demonstrate that they outperform prior works with higher acceptance ratios of virtual networks under large-scale scenarios and heavy loads. Finally, we highlight the open issues of these techniques to shed light on the future directions in this promising topic. © 1986-2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

SRv6-INT Enabled Network Monitoring and Measurement: Toward High-Yield Network Observability for Digital Twin 3rd

SRv6-INT Enabled Network Monitoring and Measurement: Toward...

引用

3rd International Conference on Machine Learning, Cloud computing and intelligent Mining, MLCCIM 2024

作者： Zhang, Xu Feng, Chuan Han, Pengchao Liu, Wei Gong, Xiaoxue Zhang, Qiupei Guo, Lei School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China School of Information Engineering Guangdong University of Technology Guangzhou510006 China

ISBN: (纸本)9789819616978

Network monitoring and measurement is an important part of realizing the network digital twin. However, it introduces the problem of high cost when obtaining the status data of physical networks. Therefore, to efficiently achieve network observability, we first introduce potential techniques and network scenarios for implementing network measurements. Then, a High-Yield Segment Routing over IPv6 based In-band Network Telemetry (HY-SRv6-INT) system is proposed in this paper. In particular, we design the HY-SRv6-INT system architecture. It consists of IPv6 switches implemented by the P4 language and a Software-Defined Networking (SDN) controller containing the HY-SRv6-INT application. Next, we experimentally demonstrate a packet-level path-associated network measurement process. In addition, the performance of the HY-SRv6-INT system is also quantitatively evaluated to verify its advantages. Finally, we discuss some research challenges and open issues for future network telemetry. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

GBFRS: Robust Fuzzy Rough Sets via Granular-ball computing

arXiv

引用

arXiv 2025年

作者： Xia, Shuyin Lian, Xiaoyu Sang, Binbin Wang, Guoyin Gao, Xinbo Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China College of Computer and Information Science the National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China

Fuzzy rough set theory is effective for processing datasets with complex attributes, supported by a solid mathematical foundation and closely linked to kernel methods in machine learning. Attribute reduction algorithms and classifiers based on fuzzy rough set theory exhibit promising performance in the analysis of high-dimensional multivariate complex data. However, most existing models operate at the finest granularity, rendering them inefficient and sensitive to noise, especially for high-dimensional big data. Thus, enhancing the robustness of fuzzy rough set models is crucial for effective feature selection. Muiti-garanularty granular-ball computing, a recent development, uses granular-balls of different sizes to adaptively represent and cover the sample space, performing learning based on these granular-balls. This paper proposes integrating multi-granularity granular-ball computing into fuzzy rough set theory, using granular-balls to replace sample points. The coarse-grained characteristics of granular-balls make the model more robust. Additionally, we propose a new method for generating granular-balls, scalable to the entire supervised method based on granular-ball computing. A forward search algorithm is used to select feature sequences by defining the correlation between features and categories through dependence functions. Experiments demonstrate the proposed model’s effectiveness and superiority over baseline methods. The source codes and datasets are both available on the public link: https://***/lianxiaoyu724/GBFRS Copyright © 2025, The Authors. All rights reserved.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

K-ON: Stacking Knowledge On the Head Layer of Large Language Model

arXiv

引用

arXiv 2025年

作者： Guo, Lingbing Zhang, Yichi Bo, Zhongpu Chen, Zhuo Sun, Mengshu Zhang, Zhiqiang Zhang, Wen Chen, Huajun College of Computer Science and Technology Zhejiang University China ZJU-Ant Group Joint Lab of Knowledge Graph China Ant Group China School of Software Technology Zhejiang University China Zhejiang Key Laboratory of Big Data Intelligent Computing China

Recent advancements in large language models (LLMs) have significantly improved various natural language processing (NLP) tasks. Typically, LLMs are trained to predict the next token, aligning well with many NLP tasks. However, in knowledge graph (KG) scenarios, entities are the fundamental units and identifying an entity requires at least several tokens. This leads to a granularity mismatch between KGs and natural languages. To address this issue, we propose K-ON, which integrates KG knowledge into the LLM by employing multiple head layers for next k-step prediction. K-ON can not only generate entity-level results in one step, but also enables contrastive loss against entities, which is the most powerful tool in KG representation learning. Experimental results show that K-ON outperforms state-of-the-art methods that incorporate text and even the other modalities. Copyright © 2025, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Based Framework for Privacy-Preserving Machine Learning 24th

An Encoder-Based Framework for Privacy-Preserving Machine L...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wu, Jiayun Ren, Wei Zhang, Xianchao Zheng, Xianghan School of Computer Science China University of Geosciences Wuhan430074 China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China Ministry of Education Chengdu China Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province Jiaxing University Jiaxing China Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing University Jiaxing China College of Computer and Big Data Fuzhou University Fujian Fuzhou China School of Information and Intelligent Engineering Sanya College Hainan China

ISBN: (纸本)9789819615506

As a data-driven science, machine learning requires vast amounts of training data and computational resources. However, for highly privacy-sensitive data, it is crucial to protect the privacy of the data during both the training and utilization of machine learning models. In this paper, we propose a privacy-preserving machine learning approach using autoencoders and differential privacy mechanisms to safeguard data privacy while minimizing the impact on data availability. Specifically, we augment logistic regression and ResNet18 models with different architectures of autoencoders to perform data encryption? without compromising the machine learning tasks. Additionally, we employ differential privacy mechanisms to introduce gradient perturbations in the encoding part of the autoencoder, enhancing the algorithm’s security and further protecting data privacy. We also design the cosine similarity between the encoded and original data as a metric for evaluating data privacy, considering model performance, privacy budget, and data privacy collectively to balance data availability and privacy. Extensive experiments conducted on MNIST, CIFAR-10, PathMNIST, and BloodMNIST datasets demonstrate that for simple logistic regression models handling easily classifiable datasets, employing simple autoencoder structures can enhance classification accuracy, with significant performance impact after adding differential privacy. For ResNet18, utilizing convolutional autoencoders for data encryption generally has minimal impact on model classification performance and can even improve accuracy in most cases. Adding differential privacy has minor effects on model classification performance. Selecting appropriate model structures and privacy budgets for different usage scenarios can ensure both data availability and privacy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

MEFA-Net: A mask enhanced feature aggregation network for polyp segmentation

引用

Computers in Biology and Medicine 2025年 186卷 109601-109601页

作者： Ke, Xiao Chen, Guanhong Liu, Hao Guo, Wenzhong Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350116 China

Accurate polyp segmentation is crucial for early diagnosis and treatment of colorectal cancer. This is a challenging task for three main reasons: (i) the problem of model overfitting and weak generalization due to the multi-center distribution of data;(ii) the problem of interclass ambiguity caused by motion blur and overexposure to endoscopic light;and (iii) the problem of intraclass inconsistency caused by the variety of morphologies and sizes of the same type of polyps. To address these challenges, we propose a new high-precision polyp segmentation framework, MEFA-Net, which consists of three modules, including the plug-and-play Mask Enhancement Module (MEG), Separable Path Attention Enhancement Module (SPAE), and Dynamic Global Attention Pool Module (DGAP). Specifically, firstly, the MEG module regionally masks the high-energy regions of the environment and polyps through a mask, which guides the model to rely on only a small amount of information to distinguish between polyps and background features, avoiding the model from overfitting the environmental information, and improving the robustness of the model. At the same time, this module can effectively counteract the "dark corner phenomenon" in the dataset and further improve the generalization performance of the model. Next, the SPAE module can effectively alleviate the inter-class fuzzy problem by strengthening the feature expression. Then, the DGAP module solves the intra-class inconsistency problem by extracting the invariance of scale, shape and position. Finally, we propose a new evaluation metric, MultiColoScore, for comprehensively evaluating the segmentation performance of the model on five datasets with different domains. We evaluated the new method quantitatively and qualitatively on five datasets using four metrics. Experimental results show that MEFA-Net significantly improves the accuracy of polyp segmentation and outperforms current state-of-the-art algorithms. Code posted on https://***/

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

VFLMonitor: Defending One-Party Hijacking Attacks in Vertical Federated Learning

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4828-4843页

作者： Xu, Xiangrui Zhao, Yiwen Han, Yufei Zhu, Yongsheng Han, Zhen Xu, Guangquan Wang, Bin Ji, Shouling Wang, Wei Qingdao University of Science and Technology School of Information Science and Technology Qingdao266061 China University of Southern California Thomas Lord Department of Computer Science Los AngelesCA90007 United States INRIA Brittany Rennes35042 France Institute of Computing Technologies China Academy of Railway Sciences Corporation Ltd. Beijing100081 China Beijing Jiaotong University Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China College of Intelligence and Computing Tianjin300072 China Network and Data Security Hangzhou310053 China Zhejiang University College of Computer Science and Technology Zhejiang 310058 China Xi’an Jiaotong University Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an710049 China

Vertical Federated Learning (VFL) is susceptible to various one-party hijacking attacks, such as Replay and Generation attacks, where a single malicious client can manipulate the model to produce attacker-specified results, thereby compromising its reliability in real-world deployments. In this paper, we first uncover the underlying mechanisms of these attacks and observe that successful attacks induce significant discrepancies in the embedding-label associations across different clients. We establish a theoretical framework demonstrating how these discrepancies can serve as reliable indicators for detecting hijacking attempts. Building upon this insight, we propose VFLMonitor, a robust defense mechanism that leverages these embedding-label discrepancies to detect and mitigate hijacking attacks. Specifically, VFLMonitor identifies suspicious queries by analyzing differences in label estimations from multiple clients and applies a majority voting rule to correct or filter out these malicious queries. Moreover, VFLMonitor introduces a novel regularization strategy during training to reduce intra-class variance in embeddings, thereby enhancing their discriminative power and improving defense effectiveness. Extensive experiments were conducted on 5 real-world datasets against 2 different attack types under 3 attack scenarios. The results demonstrate that VFLMonitor can effectively identify and exclude potential hijacked requests in all types of one-party hijacking attacks, while maintaining a meager false positive rate for legitimate queries. © 2005-2012 IEEE.

关键词： Training Servers Electronic mail Artificial intelligence Reliability theory Predictive models Federated learning data models Computational modeling Collaboration

来源：评论

学校读者我要写书评

暂无评论

Small Signal Stability-Guaranteed Moving Target Defense Against Load Redistribution Attack On IoT-based Smart Grid

引用

IEEE Internet of Things Journal 2025年第11期12卷 17413-17429页

作者： Wang, Bingdong Zhang, Zhenyong Wang, Mufeng Liu, Mengxiang Ye, Rui Deng, Ruilong Zhang, Xin Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China China Industrial Control Systems Cyber Emergency Response Team Beijing100040 China University of Sheffield Department of Automatic Control and System Engineering Sheffield United Kingdom Guizhou Power Grid Co. Ltd. Intelligent Operation Center China Zhejiang University State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Hangzhou310027 China Huzhou Institute of Industrial Control Technology Huzhou313000 China

Moving target defense (MTD) is a promising approach to defend against load redistribution attacks on the internet-of-things (IoT)-based smart grid networks by probing the distorted state estimates with the distributed flexible AC transmission system. However, existing studies mainly focus on optimizing the performance of MTD and ignore the safety effect of it on the system’s operation. In this paper, we fill this gap by deeply analyzing the effect of MTD on the small signal stability and aim to alleviate the negative impact and guarantee its defending performance simultaneously. Firstly, the stability is formally described using the eigenvalue sensitivity. The relationship between the MTD-induced perturbation (MTDper) and the stability criteria is derived. Secondly, a new indicator is proposed to measure the effectiveness of MTDper. Thirdly, a constrained optimization problem is formulated to compute the bound of MTDper for guaranteeing the small signal stability. In addition, a surprising finding is that the stability margin can be improved and enhanced by optimizing the value of MTDper without losing the MTD’s effectiveness. Finally, we evaluate the performance of MTDper and its impact on the small signal stability with extensive simulations on the IEEE 30-bus, 39-bus, and 68-bus test power systems. © 2014 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Task Prioritization in Multiagent Environments: A Novel Approach Using Nash Q-Learning

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Li, Kexin Hu, Yu Wang, Jielei Li, Lin Zhang, Shuyuan Luo, Guangchun Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China College of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

—With the rapid proliferation of smartphones and various terminal devices, edge computing has gained increasing importance in overcoming computational limitations and enhancing service quality through task offloading. However, most existing approaches handle tasks on a first-come, first-served basis, neglecting task prioritization, which is critical in real-world scenarios where tasks have different levels of urgency and resource requirements. This paper addresses the challenge of effective task prioritization in multi-agent task offloading by proposing a Nash Q-learning-based strategy. Our methodology involves optimizing task allocation decisions using Nash Q-learning to integrate Nash equilibrium principles, thereby enhancing adaptability and dynamic decision-making capabilities within a multi-agent environment. The proposed algorithm is evaluated through extensive simulations, comparing total delay, resource utilization, and task success rates across various task offloading strategies. The results demonstrate that our Nash Q-learning approach outperforms conventional techniques by dramatically lowering overall latency, optimizing resource allocation, and maintaining high task success rates. This work demonstrates the efficacy of Nash Q-learning for dynamically setting priorities for tasks in multi-agent edge computing environments, providing a robust framework for effective resource management and collaborative task completion. And also highlight the potential of Nash Q-learning in advancing intelligent task management in edge computing, suggesting its applicability in real-world, resource-constrained environments. © 2025 IEEE. All rights reserved,

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：