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

A lightweight intrusion detection system for connected autonomous vehicles based on ECANet and image encoding

Journal of Information Security and Applications 2025年 92卷

作者： Xia, Zhuoqun Huang, Longfei Tan, Jingjing Yu, Yongbin Hao, Wei Long, Kejun School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China School of Traffic and Transportation Engineering Changsha University of Science and Technology Changsha410114 China Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems Changsha410114 China

The Controller Area Network (CAN) bus plays an essential role in Connected Autonomous Vehicles (CAVs), yet its inherent design limitations regarding data protection make it susceptible to malicious intrusions. Contemporary research in intrusion detection predominantly employs Long Short-Term Memory (LSTM) models to analyze CAN IDs as time series data. However, the high computational complexity of LSTM models makes them unsuitable for resource constrained in-vehicle network. To address this problem, a lightweight IDS combining image encoding and an Efficient Channel Attention (ECA) network is proposed. Specifically, three temporal image encoding techniques, Gramian Angular Sum Fields, Markov Transition Fields, and Recurrence Plots are employed to transform CAN ID time-series data into single-channel images, which are then superimposed into three-channel images. A lightweight three-layer convolutional neural network integrated with an ECA module dynamically adjusts channel weights for image classification. Evaluated on real in-vehicle datasets, the method achieves classification accuracies of 99.83%, 99.98%, and 98.75% across three test scenarios with 5.5ms average inference time, demonstrating robust detection capability and computational efficiency. © 2025 Elsevier Ltd

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Optimizing Bidding Curves for Renewable Energy in Two-Settlement Electricity Markets

arXiv

引用

arXiv 2025年

作者： Zhao, Dongwei Delikaraoglou, Stefanos Dvorkin, Vladimir Lamadrid, Alberto J.L. Botterud, Audun Argonne National Laboratory LemontIL United States Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA United States Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI United States Department of Economics Department of Industrial and Systems Engineering Lehigh University BethlehemPA United States

Coordination of day-ahead and real-time electricity markets is imperative for cost-effective electricity supply and also to provide efficient incentives for the energy transition. Although stochastic market designs feature the least-cost coordination, they are incompatible with current deterministic markets. This paper proposes a new approach for compatible coordination in two-settlement markets based on benchmark bidding curves for variable renewable energy. These curves are optimized based on a bilevel optimization problem, anticipating per-scenario responses of deterministic market-clearing problems and ultimately minimizing the expected cost across day-ahead and real-time markets. Although the general bilevel model is challenging to solve, we theoretically prove that a single-segment bidding curve with a zero bidding price is sufficient to achieve system optimality if the marginal cost of variable renewable energy is zero, thus addressing the computational challenge. In practice, variable renewable energy producers can be allowed to bid multi-segment curves with non-zero prices. We test the bilevel framework for both single- and multiple-segment bidding curves under the assumption of fixed bidding prices. We leverage duality theory and McCormick envelopes to derive the linear programming approximation of the bilevel problem, which scales to practical systems such as a 1576-bus NYISO system. We benchmark the proposed coordination and find absolute dominance over the baseline solution, which assumes that renewables agnostically bid their expected forecasts. We also demonstrate that our proposed scheme provides a good approximation of the least-cost, yet unattainable in practice, stochastic market outcome. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Survey of Automatic Prompt engineering: An Optimization Perspective

arXiv

引用

arXiv 2025年

作者： Li, Wenwu Wang, Xiangfeng Li, Wenhao Jin, Bo School of Computer Science and Technology Tongji University China Shanghai Research Institute for Intelligent Autonomous Systems Tongji University China School of Computer Science and Technology East China Normal University China Key Laboratory of Mathematics and Engineering Applications MoE East China Normal University China

The rise of foundation models has shifted focus from resource-intensive fine-tuning to prompt engineering, a paradigm that steers model behavior through input design rather than weight updates. While manual prompt engineering faces limitations in scalability, adaptability, and cross-modal alignment, automated methods, spanning foundation model (FM) based optimization, evolutionary methods, gradient-based optimization, and reinforcement learning, offer promising solutions. Existing surveys, however, remain fragmented across modalities and methodologies. This paper presents the first comprehensive survey on automated prompt engineering through a unified optimization-theoretic lens. We formalize prompt optimization as a maximization problem over discrete, continuous, and hybrid prompt spaces, systematically organizing methods by their optimization variables (instructions, soft prompts, exemplars), task-specific objectives, and computational frameworks. By bridging theoretical formulation with practical implementations across text, vision, and multimodal domains, this survey establishes a foundational framework for both researchers and practitioners, while highlighting underexplored frontiers in constrained optimization and agent-oriented prompt design. © 2025, CC BY.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

ANNS: An Intelligent Advanced Non-Convex Non-Smooth Scheme for IRS-Aided Next Generation Mobile Communication Networks

引用

IEEE Transactions on Mobile Computing 2025年

作者： Chen, Miaojiang Liu, Anfeng Xiong, Neal N. Ren, Yingying Song, Houbing Herbert Guangxi University School of Computer Electronics and Information China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning530004 China Central South University School of Computer Science and Engineering Changsha410083 China Sul Ross State University Department of Computer Science and Mathematics AlpineTX79830 United States Department of Information Systems BaltimoreMD21250 United States

Enhancing the communication rate and quality has become the primary goal for the development of next-generation mobile communication networks, and traditional techniques such as MIMO and increasing the transmit power of the base station (BS) have not achieved a leapfrog effect. The emergence of Intelligent Reflective Surfaces (IRS) provides more reliable technical support for providing high-energy and high-rate communications. However, IRS-aided joint optimization with communication rate and quality of service constraints is a non-convex non-smooth optimization problem, and the optimal global solution cannot be obtained due to its computational complexity. In this paper, we propose an intelligent Advanced Non-convex Non-smooth Scheme (ANNS) in IRS-aided Next Generation Mobile Communication Networks for making the transmission rate of mission communication and communication quality effective. To ensure that the inequality constraints in the joint optimization problem are not violated and the equation constraints are satisfied, a hybrid deep reinforcement learning and data-experience-driven constraint security layer network is proposed, which maps the constraint violations into the safe feasible domain by mapping the constraint variables into the constraint variables mapping method, and the convergence of the algorithm is theoretically demonstrated. Experimental results show that the proposed ANNS performs superior optimization compared to SAC, DDPG, and A2C for solving non-convex non-smooth problems. The proposed ANNS has the potential to be generalized to other mobile computing applications with non-convex non-smooth characteristics. © 2002-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Survey of Integrating Generative Artificial Intelligence and 6G Mobile Services: Architectures, Solutions, Technologies and Outlooks

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Liu, Yi-Jing Du, Hongyang Xu, Xinyi Zhang, Ruichen Feng, Gang Cao, Bin Niyato, Dusit Kim, Dong In Jamalipour, Abbas Letaief, Khaled B. Tafazolli, Rahim University of Electronic Science and Technology of China National Key Lab on Wireless Communications Chengdu China University of Hong Kong Department of Electrical and Electronic Engineering Pok Fu Lam Hong Kong Nanyang Technological University College of Computing and Data Science Singapore Singapore Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing China Sungkyunkwan University Department of Electrical and Computer Engineering Suwon Korea Republic of University of Sydney School of Electrical and Computer Engineering Sydney Australia Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong University of Surrey Institute for Communication Systems School of Computer Science and Electronic Engineering United Kingdom

Generative artificial intelligence (GenAI) is rapidly driving a new phase of artificial intelligence revolution, marked by various applications such as ChatGPT, Sora and DeepSeek. With powerful capabilities in content generation, personalization and user interaction, GenAI can drive significant enhancements in various mobile services to satisfy individual user preferences. Meanwhile, mobile services offer substantial support for accessibility, functionality and intelligence of GenAI applications. However, current research on integrating GenAI and mobile services remains nascent, lacking necessary theoretical and technical support. In this survey, we break down a new vision to guide research on integrating GenAI and mobile services, aiming to improve 6G intelligence levels and enable 6G mobile networks to support the integration of GenAI and mobile services effectively. We begin by examining the necessity of integrating GenAI with 6G mobile services and exploring potential learning architectures of GenAI models within mobile networks. Next, we analyze potential solutions from two perspectives: how 6G mobile networks empower GenAI and how GenAI enables mobile services. We subsequently explore a promising use case, along with essential features and techniques, to facilitate the integration of GenAI and mobile services. Finally, we discuss future research directions, aiming at realizing intelligent 6G networks. © 2015 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Survey on Near-Space Information Networks: Channel Modeling, Transmission, and Networking Perspectives

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Cao, Xianbin Su, Xiaoning Yang, Peng Gao, Yue Wu, Dapeng Oliver Quek, Tony Q. S. Beihang University School of Electronic Information Engineering Beijing100191 China Beihang University School of Electronic Information Engineering China Pengcheng Laboratory China State Key Laboratory of CNS/ATM Beijing100191 China Fudan University School of Computer Science Shanghai200433 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore

Near-space information networks (NSINs) composed of high-altitude platforms (HAPs) and high-and low-altitude unmanned aerial vehicles (UAVs) are a new regime for providing quick, robust, and cost-efficient sensing and communication services. Precipitated by innovations and breakthroughs in manufacturing, materials, communications, electronics, and control techniques, NSINs have been envisioned as an essential component of the emerging sixth-generation of mobile communication systems. This article reveals some critical issues needing to be tackled in NSINs through conducting experiments and discusses the latest advances in NSINs in the research areas of channel modeling, transmission, and networking from a forward-looking, comparative, and technical evolutionary perspective. In this article, we highlight the characteristics of NSINs and present the promising use cases of NSINs. The impact of airborne platforms’ unstable movements on the phase delays of onboard antenna arrays with diverse structures is mathematically analyzed. The recent advances in HAP and UAV channel modeling are elaborated on, along with the significant differences between HAP and UAV channel modeling. The promising techniques and communication protocols of the physical (PHY) layer, medium access control (MAC) layer, network layer, and transport layer of NSINs for achieving efficient transmission over NSINs are reviewed. A comprehensive review of the networking techniques of NSINs in network deployment, handoff management, and network management aspects is provided. Besides, experiments have been conducted using practical NSINs to verify the performance of some techniques. Finally, we outline some open issues and promising directions for NSINs deserved for future study and discuss the corresponding challenges. © 2025 IEEE. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Applying Explanatory Artificial Intelligence Using LIME to Analyze Arabic Online Handwriting Recognition Models

Applying Explanatory Artificial Intelligence Using LIME to A...

引用

International Conference on Information Networking

作者： Hasanien Ali Talib Alothman Wafa Lejmi Safa Ameur Mohamed Ali Mahjoub ISITCom - Higher Institute of Computer Science and Communication Sousse Tunisia LATIS - Laboratory of Advanced Technology and Intelligent Systems National Engineering School of Sousse (ENISo) University of Sousse Sousse Tunisia Mechatronics Engineering Department University of Mosul Mosul Iraq

ISBN: (数字)9798331506940

ISBN: (纸本)9798331506957

This study applies interpretable artificial intelligence (XAI) techniques in an unprecedented way to improve transparency in online Arabic handwriting recognition models. By using the LIME (Local Model-Independent Explanations) technique to analyze and interpret a convolutional neural network (CNN) model trained on the ADAB dataset. LIME highlights the key features that the model relies on in handwriting recognition. This research demonstrates the effectiveness of the LIME technique in uncovering the factors that the model relies on in an unconventional way and provides detailed explanations of how the decisions are made, which enhances transparency and increases users’ confidence in these models. The results provide useful information for improving the performance of handwriting recognition systems and a beginning for applying XAI techniques on a larger scale, including using more complex datasets and additional interpretation techniques to gain a deeper understanding of how models work with different handwriting styles. This study paves the way for the use of interpretable techniques in the field of Arabic handwriting recognition.

关键词： Deep learning Handwriting recognition Analytical models Explainable AI Shape Decision making Predictive models Prediction algorithms Data models Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on Control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Vehicular Road Crack Detection with Deep Learning: A New Online Benchmark for Comprehensive Evaluation of Existing Algorithms

arXiv

引用

arXiv 2025年

作者： Ma, Nachuan Song, Zhengfei Hu, Qiang Liu, Chuang-Wei Han, Yu Zhang, Yanting Fan, Rui Xie, Lihua College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems the State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China School of Computer Science and Technology Donghua University Shanghai201620 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore

In the emerging field of urban digital twins (UDTs), advancing intelligent road inspection (IRI) vehicles with automatic road crack detection systems is essential for maintaining civil infrastructure. Over the past decade, deep learning-based road crack detection methods have been developed to detect cracks more efficiently, accurately, and objectively, with the goal of replacing manual visual inspection. Nonetheless, there is a lack of systematic reviews on state-of-the-art (SoTA) deep learning techniques, especially data-fusion and label-efficient algorithms for this task. This paper thoroughly reviews the SoTA deep learning-based algorithms, including (1) supervised, (2) unsupervised, (3) semi-supervised, and (4) weakly-supervised methods developed for road crack detection. Also, we create a dataset called UDTIRI-Crack, comprising 2, 500 high-quality images from seven public annotated sources, as the first extensive online benchmark in this field. Comprehensive experiments are conducted to compare the detection performance, computational efficiency, and generalizability of public SoTA deep learning-based algorithms for road crack detection. In addition, the feasibility of foundation models and large language models (LLMs) for road crack detection is explored. Afterwards, the existing challenges and future development trends of deep learning-based road crack detection algorithms are discussed. We believe this review can serve as practical guidance for developing intelligent road detection vehicles with the next-generation road condition assessment systems. The released benchmark UDTIRI-Crack is available at https://***/submission/. © 2025, CC BY.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：