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

FIDSUS: Federated Intrusion Detection for Securing UAV Swarms in Smart Aerial computing

IEEE Internet of Things Journal 2025年第9期12卷 11312-11328页

作者： Deng, Jiangtao Wang, Wei Wang, Lina Bashir, Ali Kashif Gadekallu, Thippa Reddy Feng, Hailin Lv, Meilei Fang, Kai Zhejiang A&F University College of Mathematics and Computer Science Hangzhou311300 China Quzhou University College of Electrical and Information Engineering Quzhou324000 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Guangdong-Hong Kong-Macao Joint Laboratory for Emotion Intelligence and Pervasive Computing Shenzhen518172 China Beijing Institute of Technology School of Medical Technology Beijing100081 China Manchester Metropolitan University Department of Computing and Mathematics ManchesterM15 6BX United Kingdom Chitkara University Institute of Engineering and Technology Chitkara University Centre for Research Impact and Outcome Rajpura140401 India Lovely Professional University Division of Research and Development Phagwara144411 India Chitkara University Center of Research Impact and Outcome Rajpura140401 India

The dynamic environment of UAV swarms in forest management is characterized by communication instability, heterogeneous nodes, and frequent topology changes due to challenging terrain. These systems are vulnerable to network attacks, requiring advanced intrusion detection technologies. Traditional methods struggle with rapid changes due to data privacy concerns and centralized computational limits, while existing federated learning (FL) algorithms lack robustness against client heterogeneity and dynamic data distribution, especially in complex forest environments. To address these challenges, we propose federated intrusion detection for securing UAV swarms (FIDSUS). FIDSUS improves intrusion detection systems by leveraging collaborative sensing among UAVs, enabling better monitoring and response to security threats in forestry. By quantifying the similarity between UAVs’ local feature extractors through an affinity matrix, FIDSUS guides the aggregation of feature extractors, improving detection capabilities. It also uses AI-driven aerial and distributed computing to enhance data processing efficiency and decision-making speed. The framework addresses data heterogeneity by cross-round feature fusion, improving detection in dynamic environments. Experimental results on the NSL-KDD and UNSW-NB15 datasets show that FIDSUS outperforms existing FL methods with a 4%–34% accuracy improvement. FIDSUS shows robustness and accuracy in dynamic environments, providing an effective solution for securing UAV swarms in forestry. © 2014 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

SIGFinger: A Subtle and Interactive GNN Fingerprinting Scheme via Spatial Structure Inference Perturbation

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Jia, Ju Li, Renjie Wu, Cong Ma, Siqi Wang, Lina Deng, Robert H. Southeast University School of Cyber Science and Engineering Nanjing210096 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore University of New South Wales School of Engineering and Information Technology CanberraACT2612 Australia Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Singapore Management University School of Information Systems 188065 Singapore

There have been significant improvements in intellectual property (IP) protection for deep learning models trained on Euclidean data. However, the complex and irregular graph-structured data in non-Euclidean space poses a huge challenge to the IP protection of graph neural networks (GNNs). To address this issue, we propose a subtle and interactive GNN fingerprinting scheme through spatial structure inference perturbation, which captures the stable coordination patterns of fingerprint to guarantee the reliability of copyright verification. Specifically, the data augmentation based on adaptive graph diffusion is first exploited to generate more samples, which enables the exploration of fingerprint information from coarse to fine. Subsequently, the graph-structured data are manipulated by multi-constrained spectral clustering to analyze intrinsic and extrinsic structure correlations in a causal inference manner. Ultimately, the cycle-consistent statistical optimization is performed to determine the copyright of GNN models from both intra-graph and inter-graph perspectives. Extensive experiments show that our proposed scheme can effectively verify the IP of GNN models on various challenging graph-structured datasets. Furthermore, we reveal that the space causality inference can facilitate the acquisition of inherent structural information, which improves the quality and robustness of the fingerprint under model modification operations and other model stealing attacks. © 2004-2012 IEEE.

关键词： causal inference GNN fingerprinting IP protection quality and robustness stable structure knowledge

来源：评论

学校读者我要写书评

暂无评论

PAC-MC: An Efficient Password-Based Access Control Framework for Time Sequence Aware Media Cloud

引用

IEEE Transactions on Mobile computing 2025年

作者： Wang, Haiyan Liu, Penghui Zhong, Xiaoxiong Luo, Fucai Xiao, Bin Yang, Yuanyuan Peng Cheng Laboratory Department of New Networks Shenzhen518000 China Zhejiang Gongshang University School of Computer Science and Technology Hangzhou China Hong Kong Polytechnic University Department of Computing Hong Kong Stony Brook University Department of Electrical and Computer Engineering Stony BrookNY11794 United States

Cloud storage makes it easier for users to access and share data remotely, but it often requires integration with cryptographic technologies to address consumer-oriented applications, such as fine-grained data access, secure data sharing and retrieval. This paper focuses on the fine-grained access problem of media applications based on time sequence, that is, certain critical media applications based on time sequences should ideally be accessible only to authorized clients. The traditional keyword-based searchable encryption (SE) allows effective search and access over encrypted data while preserving data privacy, but most existing solutions do not support temporal access control (i.e., a mechanism that grants access permissions to users within a specified time range). In this paper, we propose PAC-MC, an efficient password-based access control framework for media cloud relying on content control with the time sequence attribute. PAC-MC not only supports multi-keyword search using any monotonic boolean formulas but also allows media owners to control content-encryption keys for different time periods with an updatable password. Furthermore, it supports the self-retrieval of content-encryption keys. In addition, PAC-MC is provably secure under the standard model. Finally, the detailed performance evaluation results and experimental comparisons indicate that PAC-MC is very efficient and outperforms the previous solutions in terms of computation, communication, and storage costs. © 2025 IEEE.

关键词： Access control content protection media cloud password searchable encryption time sequence

来源：评论

学校读者我要写书评

暂无评论

Open-Ended Coaxial Probe Based Chloride Concentration Prediction in Water Using Machine Learning Algorithms

Open-Ended Coaxial Probe Based Chloride Concentration Predic...

引用

International Youth Conference on Radio Electronics, electrical and Power engineering (REEPE)

作者： Hanima Kannan C H Veena Venugopal Deepa Gupta Parul Mathur Dhanesh G Kurup Priyanka Mathur Department of Electronics and Communication Engineering RF and Wireless Systems Laboratory Amrita School of Engineering Amrita Vishwa Vidyapeetham Bengaluru India Department of Physical Science Amrita School of Engineering Amrita Vishwa Vidyapeetham Bengaluru India Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Bengaluru India School of Engineering and Applied Science Benette University Greater Noida UP India

ISBN: (数字)9798331531836

ISBN: (纸本)9798331531843

Monitoring chloride levels in water is essential for environmental health, industrial processes, and safe drinking water, as both high and low concentrations can cause harm for living being. This paper presents a novel approach to detecting chloride concentrations using Open-Ended Coaxial Probe (OECP) sensing combined with machine learning algorithms. OECP sensing offers real-time, non-destructive, and precise monitoring, enabling early detection of contaminants. Scattering parameter ( $S$ 11) data across a broad frequency range was collected with varying chloride concentrations in controlled laboratory experiments. Thirteen machine learning algorithms were trained to predict chloride concentrations, with different datasets for training and testing to ensure robustness. Among these, CatBoost demonstrated the best performance. After fine tuning and cross-validation, the CatBoost model achieved a test Mean Square Error (MSE) of 0.00627 and Coefficient of Determination (R2) of 0.9936, showcasing its accuracy for applications in water monitoring, corrosion prevention, and safeguarding public health.

关键词： Machine learning algorithms Water quality Predictive models Real-time systems Sensors Scattering parameters Probes Public healthcare Tuning Testing

来源：评论

学校读者我要写书评

暂无评论

Should Audio Front-ends be Adaptive? Comparing Learnable and Adaptive Front-ends

arXiv

引用

arXiv 2025年

作者： Zhang, Qiquan Wickramasinghe, Buddhi Ambikairajah, Eliathamby Sethu, Vidhyasaharan Li, Haizhou School of Electrical Engineering and Telecommunications The University of New South Wales Sydney2052 Australia School of Electrical and Computer Engineering Purdue University West LafayetteIN United States Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen51872 China

Hand-crafted features, such as Mel-filterbanks, have traditionally been the choice for many audio processing applications. Recently, there has been a growing interest in learnable front-ends that extract representations directly from the raw audio waveform. However, both hand-crafted filterbanks and current learnable front-ends lead to fixed computation graphs at inference time, failing to dynamically adapt to varying acoustic environments, a key feature of human auditory systems. To this end, we explore the question of whether audio front-ends should be adaptive by comparing the Ada-FE front-end (a recently developed adaptive front-end that employs a neural adaptive feedback controller to dynamically adjust the Q-factors of its spectral decomposition filters) to established learnable front-ends. Specifically, we systematically investigate learnable front-ends and Ada-FE across two commonly used back-end backbones and a wide range of audio benchmarks including speech, sound event, and music. The comprehensive results show that our Ada-FE outperforms advanced learnable front-ends, and more importantly, it exhibits impressive stability or robustness on test samples over various training epochs. Copyright © 2025, The Authors. All rights reserved.

关键词： Gabor filters

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Service Function Chains Mapping With Multi-Task Deep Reinforcement Learning

引用

IEEE Transactions on Network Science and engineering 2025年

作者： Wei, Wenting Wang, Qingyi Gu, Huaxi Zheng, Danyang Zhang, Ning Wu, Celimuge Xidian University State Key Laboratory of Integrated Service Networks Xi'an710071 China Southwest Jiaotong University School of Computing and Artificial Intelligence China University of Windsor Department of Electrical and Computer Engineering Canada University of Electro-Communications Meta-Networking Research Center Japan

Network function virtualization (NFV) facilitates different virtual network functions (VNF) to be dynamically chained in sequence to offer new services in a flexible, scalable, and cost-effective manner. Recent years have witnessed the increasing diverse service demands from the ever-increasing new applications, which has posed significant challenges to the efficient and sequential execution of VNFs to achieve specific objectives, especially under conditions of shared resources. To address these challenges, substantial efforts have been dedicated to enhancing resource utilization and minimizing the costs associated with service function chains (SFCs), while maintaining high quality of service. However, an overemphasis on cost reduction can sometimes result in network congestion, which ultimately degrades both network performance and service quality. Given the time-varying and unpredictable characteristics of SFCs, it is essential to leverage their temporal features, along with those of network states, for adaptive SFC mapping. In this paper, we introduce an adaptive online SFC mapping algorithm to reduce operational costs and alleviate network congestion. This is achieved through the adaptive allocation of VNFs and the control of traffic routing between them. Our approach incorporates multi-task deep reinforcement learning to manage the coexistence of multiple SFC requests with varying resource requirements. Specifically, we integrate a long short-term memory (LSTM) layer into our model to capture the temporal dynamics of network states and resource demands, thereby enabling more effective long-term planning. To address the issue of reward sparsity, we implement a hierarchical reward mechanism and reward shaping techniques. Experimental results demonstrate that our algorithm achieves near-optimal performance in optimizing service delay, bandwidth consumption, and network congestion, while also ensuring a high acceptance rate for user requests. © 2013 IEEE.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Family of Mutually Uncorrelated Codes for DNA Storage Address Design

IEEE Transactions on Nanobioscience

引用

IEEE Transactions on Nanobioscience 2025年 PP卷 PP页

作者： Liu, Zhenlu Cao, Ben Shao, Qi Zheng, Yanfen Wang, Bin Zhou, Shihua Zheng, Pan Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China University of Canterbury Upper Riccarton Department of Accounting and Information Systems Christchurch8140 New Zealand

Deoxyribonucleic acid (DNA) has become an ideal medium for long-term storage and retrieval due to its extremely high storage density and long-term stability. But access efficiency is an existing bottleneck in DNA storage, especially the lack of high-quality random access address sequences. Therefore, in this paper, we report a series of approaches based on k-weakly mutually uncorrelated (k-WMU) codes to design the address sequence to improve the access efficiency of DNA storage. To address the problem of DNA sequences that are poorly scalable at the base level, we propose a 0-m-ruling coding scheme combined with k-WMU codes that can make address sequences avoid generating secondary structure with stem lengths ranging from 3 to 9. Based on the decoupled structure, We further extend the k-WMU codes with error correction function while satisfying combinatorial biological constraints. In order to investigate the performance of the designed address sequences for real-world applications, we perform simulation experiments based on thermodynamic properties and error correction capability as well as compared the minimum free energy (MFE), melting temperature (TM), and average decoding success rate (ADSR) with previous work. The results show that designed address sequences have a high MFE value and ADSR and a substantial reduction in TM-variance while satisfying the combinatorial biological constraints. As the quality of address sequences improves, this will help to achieve accurate random access as well as enhance the robustness of the DNA storage system. © 2002-2011 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Human Leading Behavior Learning for Multiple Autonomous Followers Under Constrained Communication Topologies

引用

IEEE Transactions on systems, Man, and Cybernetics: systems 2025年

作者： Zhang, Xiao-Xiao Wu, Huai-Ning Wang, Jin-Liang Beihang University School of Automation Science and Electrical Engineering Beijing100191 China Beihang University Hangzhou International Innovation Institute Hangzhou311115 China Tiangong University Tianjin Key Laboratory of Autonomous Intelligence Technology and Systems School of Computer Science and Technology Tianjin300387 China

Owing to the immaturity of current artificial intelligence techniques, practical multiagent systems (MASs) often require supervision and intervention from humans. However, it is unrealistic for a human to monitor the entire MAS and provide appropriate input in some circumstances. A viable approach is to allow a human to control an agent as the leader which in turn influences the other autonomous followers. To this end, a critical issue is how to learn human behavior to improve the autonomy of followers for collaborating with human effectively, since the autonomous followers do not have prior knowledge of human behavior. In this article, the human leading behavior learning problem is studied for a class of human-in-the-loop (HiTL) MASs that are not fully connected. A linear quadratic differential game framework is applied to formulate the collaborative control problem in the HiTL MAS where the human behavior is represented as a cost function whose weighting matrix is unknown to the followers. In the HiTL MAS, we select a follower that has strong computing power called follower 1 to learn the human behavior via an online adaptive inverse differential game (IDG) approach. Based on concurrent learning (CL) technique, an adaptive law is developed for follower 1 to determine the human feedback matrix online, and at the same time the interaction strategies for the autonomous followers are also calculated by follower 1 in case of the constrained communication topology. Subsequently, the weighting matrix in the human cost function is recovered by addressing a linear matrix inequality (LMI) optimization problem. Finally, a numerical example is presented to demonstrate the effectiveness of the proposed method. © 2013 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Dual-beam photothermal material trace detection method based on self-mixing interference

引用

Applied Optics 2025年第16期64卷 4549-4558页

作者： Yan Zhao Yunlong Zhi Hui Zhao Daming Dong Jigang Tong Chunling Tu School of Electrical Engineering and Automation Tianjin University of Technology Tianjin 300384 China Tianjin Key Laboratory for Control Theory and Applications in Complicated Systems Tianjin 300384 China National Engineering Research Center for Intelligent Agricultural Equipment Beijing Academy of Agriculture and Forestry Sciences Beijing 100097 China Department of Computer Systems Engineering Faculty of ICT Tshwane University of Technology Pretoria 0188 South Africa

In this paper, a dual-beam photothermal self-mixing substance trace detection system is proposed. The crystal violet (CV) solution of the sample undergoes a thermal lens effect under the action of pump photoperiod excitation, and the refractive index changes cause the deviation of the probe beam, and the self-mixing interference (SMI) effect occurs when the modulated light returns to the cavity. By combining theoretical and experimental results, the power fluctuation of the SMI signal caused by the thermo-optic effect is linearly related to CV concentration and other parameters. At an excitation power of 24 mW, the detection limit can reach $8.0 \times {10^{- 8}}\;{\rm mol/L}$ . This method does not require labeling or complex CV pretreatment and has high sensitivity and flexibility, providing a guide for CV characterization in biological, environmental, and pharmaceutical research.

关键词： Gaussian beams Laser beams Optical fields Phase shift Refractive index Spatial resolution

来源：评论

学校读者我要写书评

暂无评论

Backdoor-Empowered Regulable Privilege Authorization for Edge-Level Graph Learning in 6G Vehicular Networks

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Yang, Xiao Li, Gaolei Wu, Jun Zhou, Kai Li, Jianhua Yang, Wu Shanghai Jiao Tong University School of Electronic Information and Electrical Engineering Shanghai China Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Shanghai China The Hong Kong Polytechnic University Department of Computing Hong Kong Harbin Engineering University College of Computer Science and Technology Harbin China

Edge-Level Graph Learning System (EGLS) exhibits diverse applicability in flow prediction, route planning, and accident forecasting. Existing EGLS studies extremely stress absolute fairness and impartiality for all users, resultantly depriving its flexibility and humanity in addressing special circumstances and rendering the privilege authorization for exceptional responses challenging to achieve. To address this limitation, we present BackPriv, the first privilege authorization methodology enabling regulable privilege assignment or revocation in EGLS. Specifically, it is achieved through a creative edge backdoor mechanism, wherein the edge training samples are poisoned via user-specific privilege tokens to induce privilege outputs from the well-trained EGLS for authorized users. Moreover, related EGLS regulating strategies were proposed to dynamically realize the addition and revocation of user privileges by system retraining to guarantee privilege control in EGLS. Additionally, a Graph Mutual Information-based adaptive privilege token generation method is introduced to reduce the impact of privilege authorization on normal inputs and augment authorization functionality. Based on experiments with multiple real-world datasets, BackPriv demonstrates high success rates of privilege authorization under various scenarios ( 100%) and exerts minimal impact on normal task performance for regular inputs (mean accuracy drop 0.32%). © 1975-2011 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：