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

Dynamic Quasi-Hyperbolic Momentum Iterative Attack With Small Perturbation for 4D-Flight Trajectory Prediction

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Zhao, Zhengyang Wang, Buhong Yao, Xuan Tian, Jiwei Dong, Ruochen Zhu, Peican Air Force Engineering University School of Information and Navigation Xi’an710082 China University of Manchester Department of Computer Science ManchesterM13 9PL United Kingdom Air Force Engineering University Air Traffic Control and Navigation College Xi’an710005 China Xi’an Jiaotong University School of Cyber Science and Engineering Xi’an710049 China Northwestern Polytechnical University School of Artificial Intelligence Optics and Electronics Xi’an China

With the rapid growth of global air traffic, 4D-flight trajectory prediction (4D-FTP) using deep learning (DL) methods has become essential for applications such as flight delay prediction, fuel consumption analysis, and traffic management. However, the adversarial attacks pose significant security threats to DL-based 4D-FTP systems reliant on automatic dependent surveillance-broadcast (ADS-B) sensors. Furthermore, existing vulnerabilities in time series prediction (TSP) models for 4D-FTP remain underexplored due to the lack of effective and stealthy attack methods. To address this gap, we propose the Dynamic Quasi-Hyperbolic Momentum Iterative Attack with Small Perturbation (DQM-Attack). This method leverages quasi-hyperbolic momentum (QHM) and dynamic step sizes to optimize gradient utilization in 4D-FTP models. In addition, attack stealth is enhanced through the Manifold Smooth Module (MSM) and Sparse Smooth Reinforcement Learning (SS-RL). Experimental results demonstrate that DQM-Attack effectively disrupts predictions with minimal perturbations across four state-of-the-art TSP models. This study appears to be the first to address stealthy adversarial attacks on 4D-FTP systems, revealing a critical security vulnerability in air traffic management (ATM). © 2014 IEEE.

关键词： Flight paths

Joint Power Allocation and Task Scheduling for Data Offloading in Non-Geostationary Orbit Satellite Networks

学校读者我要写书评

暂无评论

IEEE Transactions on Network and Service Management 2025年

作者： He, Lijun Jia, Ziye Wang, Juncheng Lansard, Erick Han, Zhu Yuen, Chau China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China Xidian University State Key Laboratory of Integrated Services Networks Shaanxi Xi'an710071 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Nanjing211111 China Hong Kong Baptist University Department of Computer Science China Nanyang Technological University School of Electrical and Electronics Engineering 639798 Singapore University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

In Non-Geostationary Orbit Satellite Networks (NGOSNs) with a large number of battery-carrying satellites, proper power allocation and task scheduling are crucial to improving data offloading efficiency. In this work, we jointly optimize power allocation and task scheduling to achieve energy-efficient data offloading in NGOSNs. Our goal is to properly balance the minimization of the total energy consumption and the maximization of the sum weights of tasks. Due to the tight coupling between power allocation and task scheduling, we first derive the optimal power allocation solution to the joint optimization problem with any given task scheduling policy. We then leverage the conflict graph model to transform the joint optimization problem into an Integer Linear Programming (ILP) problem with any given power allocation strategy. We explore the unique structure of the ILP problem to derive an efficient semidefinite relaxation-based solution. Finally, we utilize the genetic framework to combine the above special solutions as a two-layer solution for the original joint optimization problem. Simulation results demonstrate that our proposed solution can properly balance the reduction of total energy consumption and the improvement of the sum weights of tasks, thus achieving superior system performance over the current literature. © 2004-2012 IEEE.

关键词： Geostationary satellites

NFV-Enabled Service Recovery in Space-Air-Ground Integrated Networks: A Matching Game Based Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Jia, Ziye Cao, Yilu He, Lijun Li, Guangxia Zhou, Fuhui Wu, Qihui Han, Zhu College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing211106 China State Key Laboratory of ISN Xidian University Xian710071 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Network function virtualization

Privacy-Aware Joint DNN Model Deployment and Partition Optimization for Delay-Efficient Collaborative Edge Inference

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Cheng, Zhipeng Xia, Xiaoyu Wang, Hong Liwang, Minghui Chen, Ning Fan, Xuwei Wang, Xianbin School of Future Science and Engineering Soochow University Suzhou215006 China School of Computing Technologies RMIT University MelbourneVIC Australia Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems Tongji University Shanghai201804 China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai201804 China Qingdao China College of Computer and Information Sciences Fujian Agriculture and Forestry University Fuzhou350002 China Department of Electrical and Computer Engineering Western University ON Canada

Edge inference (EI) is a key solution to address the growing challenges of delayed response times, limited scalability, and privacy concerns in cloud-based Deep Neural Network (DNN) inference. However, deploying DNN models on resource-constrained edge devices faces more severe challenges, such as model storage limitations, dynamic service requests, and privacy risks. This paper proposes a novel framework for privacy-aware joint DNN model deployment and partition optimization to minimize long-term average inference delay under resource and privacy constraints. Specifically, the problem is formulated as a complex optimization problem considering model deployment, user-server association, and model partition strategies. To handle the NP-hardness and future uncertainties, a Lyapunov-based approach is introduced to transform the long-term optimization into a single-time-slot problem, ensuring system performance. Additionally, a coalition formation game model is proposed for edge server association, and a greedy-based algorithm is developed for model deployment within each coalition to efficiently solve the problem. Extensive simulations show that the proposed algorithms effectively reduce inference delay while satisfying privacy constraints, outperforming baseline approaches in various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Differential privacy

Multimodal Large Models Are Effective Action Anticipators

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wang, Binglu Tian, Yao Wang, Shunzhou Yang, Le College of Information and Control Engineering Xi'an University of Architecture and Technology Xi'An710055 China The School of Astronautics Northwestern Polytechnical University Xi'An710072 China School of Electronic and Computer Engineering Shenzhen Graduate School Peking University Shenzhen518055 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center China The School of Information Science and Technology University of Science and Technology of China Hefei230022 China

The task of long-term action anticipation demands solutions that can effectively model temporal dynamics over extended periods while deeply understanding the inherent semantics of actions. Traditional approaches, which primarily rely on recurrent units or Transformer layers to capture long-term dependencies, often fall short in addressing these challenges. Large Language Models (LLMs), with their robust sequential modeling capabilities and extensive commonsense knowledge, present new opportunities for long-term action anticipation. In this work, we introduce the ActionLLM framework, a novel approach that treats video sequences as successive tokens, leveraging LLMs to anticipate future actions. Our baseline model simplifies the LLM architecture by setting future tokens, incorporating an action tuning module, and reducing the textual decoder layer to a linear layer, enabling straightforward action prediction without the need for complex instructions or redundant descriptions. To further harness the commonsense reasoning of LLMs, we predict action categories for observed frames and use sequential textual clues to guide semantic understanding. In addition, we introduce a Cross-Modality Interaction Block, designed to explore the specificity within each modality and capture interactions between vision and textual modalities, thereby enhancing multimodal tuning. Extensive experiments on benchmark datasets demonstrate the superiority of the proposed ActionLLM framework, encouraging a promising direction to explore LLMs in the context of action anticipation. Code is available at https://***/2tianyao1/***. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics

Data Identification Optimal control for Quantized Linear Systems under DoS Attacks

学校读者我要写书评

暂无评论

IEEE Transactions on Aerospace and Electronic Systems 2025年

作者： Wang, Xianming Li, Liwei Shen, Mouquan Zhao, Xudong Wang, Qing-Guo Zhu, Zheng Hong Nanjing Tech University School of Mechanical and Power Engineering Nanjing211816 China Nanjing Tech University College of Electrical Engineering and Control Science Nanjing211816 China Dalian University of Technology Faculty of Electronic Information and Electrical Engineering Dalian116024 China Beijing Normal University Institute of Ai and Future Networks Zhuhai519087 China BNU-HKBU United International College Guangdong Provincial Key Laboratory Irads Department of Computer Science Zhuhai519087 China York University Department of Mechanical Engineering TorontoONM3J 1P3 Canada

This paper is devoted to data identification optimal control for quantized linear systems under denial of service (DoS) attacks. A least-squares algorithm is provided to identify the unknown system matrices using a data-based representation. An output estimation algorithm utilizing identified matrices is supplied to offset DoS attacks. Consequently, an optimal controller is built on the quantized and attacked data by adaptive dynamic programming. Sufficient conditions are presented to guarantee that the resultant closed-loop system is ultimately uniformly bounded. An example is produced to verify the validity of the proposed approach. © 1965-2011 IEEE.

关键词： Optimal control systems

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2021年第5期30卷 876-884页

作者： QIAO Sibo PANG Shanchen WANG Min ZHAI Xue DAI Feng College of Computer Science and Technology China University of Petroleum College of Control Science and Engineering China University of Petroleum College of Information Science and Engineering Shandong University of Science and Technology

Popularity prediction of online video is widely used in many different scenarios. It can not only help video service providers to schedule video web sites,but also bring considerable profits on investment for both providers and advertisers if popularity of online video is predicted accurately. However, online video popularity prediction still cannot have a satisfactory result, due to the complexity of many crucial factors especially of video distribution network. In this article, we extract seven factors from huge amounts of data about user behavior,establishing a new multiple linear regression model to initially predict online video popularity. After that, a multichannel video popularity dynamic scheduling model is proposed to schedule videos on which channel and what time to be broadcast, according to its popularity predicted by multiple linear regression model, ensuring that maximum the sum value of online video popularity of each channel. Experimental results on dataset obtained from Sohu Video, a video service provider in China, and real-world video flow in Sohu Video demonstrate that the proposed model is robust and has promising performance in predicting online video popularity, which is helpful for video service providers to schedule videos on web sites effectively in the future.

关键词： regression analysis video communication Internet video signal processing Web sites real-world video flow online video popularity regression prediction model video service provider Sohu Video video distribution network user behavior video Web sites dynamic scheduling multichannel video popularity dynamic scheduling model multiple linear regression model

Event-aided Semantic Scene Completion

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Guo, Shangwei Shi, Hao Wang, Song Yin, Xiaoting Yang, Kailun Wang, Kaiwei State Key Laboratory of Extreme Photonics and Instrumentation Zhejiang University Hangzhou310027 China School of Robotics the National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha410082 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China

Autonomous driving systems rely on robust 3D scene understanding. Recent advances in Semantic Scene Completion (SSC) for autonomous driving underscore the limitations of RGB-based approaches, which struggle under motion blur, poor lighting, and adverse weather. Event cameras, offering high dynamic range and low latency, address these challenges by providing asynchronous data that complements RGB inputs. We present DSEC-SSC, the first real-world benchmark specifically designed for event-aided SSC, which includes a novel 4D labeling pipeline for generating dense, visibility-aware labels that adapt dynamically to object motion. Our proposed RGB-Event fusion framework, EvSSC, introduces an Event-aided Lifting Module (ELM) that effectively bridges 2D RGB-Event features to 3D space, enhancing view transformation and the robustness of 3D volume construction across SSC models. Extensive experiments on DSEC-SSC and simulated SemanticKITTI-E demonstrate that EvSSC is adaptable to both transformer-based and LSS-based SSC architectures. Notably, evaluations on SemanticKITTI-C demonstrate that EvSSC achieves consistently improved prediction accuracy across five degradation modes and both In-domain and Out-of-domain settings, achieving up to a 52.5% relative improvement in mIoU when the image sensor partially fails. Additionally, we quantitatively and qualitatively validate the superiority of EvSSC under motion blur and extreme weather conditions, where autonomous driving is challenged. The established datasets and our codebase will be made publicly at https://***/Pandapan01/EvSSC. Copyright © 2025, The Authors. All rights reserved.

关键词： Image enhancement

Robust Maximum Power Point Tracking in PV Generation System: A Hybrid ANN-Backstepping Approach With PSO-GA Optimization

学校读者我要写书评

暂无评论

IEEE Transactions on Consumer Electronics 2025年

作者： Hussan, Umair Waheed, Ahsan Bilal, Hazrat Wang, Huaizhi Hassan, Mudasser Ullah, Inam Peng, Jianchun Hosseinzadeh, Mehdi Shenzhen University College of Mechatronics and the Control Engineering Shenzhen 518060 China The University of Faisalabad Department of Electrical Engineering Faisalabad 38000 Pakistan University of Tasmania School of Engineering Hobart 7005 TAS Australia Gachon University Department of Computer Engineering Seongnam 13120 South Korea Macquarie University School of Computing Sydney Australia Duy Tan University School of Computer Science Da Nang Viet Nam

The growing diversity of consumer loads emphasizes the need for efficient operation of photovoltaic generation systems (PVGSs). This paper presents a novel control framework for maximum power point tracking (MPPT) in PVGSs, designed to enhance efficiency, robustness, and adaptability under dynamic environmental conditions. The proposed methodology integrates optimized Artificial Neural Network (ANN) with nonlinear backstepping controller. Hybrid particle swarm optimization (PSO) and genetic algorithm (GA) approach is used to optimize ANN, which leverages the global search capabilities of PSO and the local refinement strengths of GA to optimize the ANN’s weights and biases, ensuring accurate prediction of the PV reference voltage that is critical for MPPT. Additionally, the nonlinear backstepping controller ensures system stability and precise tracking of the predicted reference voltage by recursively constructing Lyapunov functions to guarantee asymptotic stability. The effectiveness of this control framework is evaluated through MATLAB/Simulink and validated with hardware testing. It is observed from simulation and hardware testing results, compared to existing ANN and conventional techniques, the proposed approach yielded significant improvements by achieving root mean square error of 0.103%, tracking accuracy of 99. 8%, and reduction of power loss to 0. 2%. The proposed control framework significantly enhances MPPT robustness and efficiency in dynamic environments and enables higher integration of renewable energy. This advancement supports scalable, resilient PV systems critical for sustainable energy transitions. © 1975-2011 IEEE.

关键词： Artificial Neural Network Backstepping controller Maximum Power Point Tracking PV Generation System