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

7th IEEE International Conference on Electronic information and Communication Technology, ICEICT 2024

作者： Ni, Xun Wu, Hao Zhu, Xuan Shi, Zhaopeng Huazhong University of Science and Technology School of Computer Science and Technology Wuhan China Naval University of Engineering National Key Laboratory of Electromagnetic Energy Wuhan China Wuhan University School of Electrical Engineering and Automation Wuhan China Huazhong University of Science and Technology School of Electronic Information and Communications Wuhan China

ISBN: (纸本)9798350384437

With the rapid development of radar jamming technology, traditional detection techniques face significant limitations in complex electromagnetic environments. Recent interference detection methods based on deep learning struggle with processing speed and real-time performance. To address this, we propose a new pruning technique called randomized-enhanced magnitude channel pruning (RMP) to achieve faster detection speeds and more lightweight models. This study evaluates the performance of RMP compared to random channel pruning and magnitude channel pruning in radar jamming detection. To verify RMP's generalization, we also tested it on the VOC2007 [16] object detection task. Results show that RMP consistently reduces mAP@50 loss more effectively than other methods. In one iteration pruning, RMP reduced mAP@50 loss by an average of 0.8% and 1% in radar jamming detection, and by 0.4% and 3.1% in the VOC2007 dataset, compared to random and magnitude pruning, respectively. In multi-pass pruning, RMP reduced mAP@50 loss by an average of 0.3% in radar jamming detection, and by 0.7% and 1.6% in the VOC2007 dataset, compared to random and magnitude pruning, respectively. These findings confirm RMP's effectiveness in maintaining model accuracy and its practical value in fast-response scenarios like radar jamming detection. © 2024 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

Real-time Pricing Mechanism for V2G Using Distributed Bilevel Optimization 63

Real-time Pricing Mechanism for V2G Using Distributed Bileve...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： You, Jiawei Dai, Xinliang Jiang, Yuning Yin, Haoyu Shi, Yuanming Jones, Colin N. ShanghaiTech University School of Information Science and Technology China Epfl Switzerland Karlsruhe Institute of Technology Institute for Automation and Applied Informatics Germany Epfl Automatic Control Laboratory Switzerland Washington University in St. Louis Department of Electrical and Systems Engineering United States

ISBN: (纸本)9798350316339

This paper explores the impact of the burgeoning electric vehicle (EV) presence on distribution grid operations, highlighting the challenges they present to conventional pricing strategies due to their dual role as power consumers and suppliers, coupled with their energy storage capabilities. We propose an advanced real-time pricing model for the electricity market, employing a novel distributed bilevel optimization framework. This framework distinguishes between the distribution system operator (DSO) at the upper level and the EVs at the lower level, each aiming to optimize profit margins. The optimization includes power flow constraints at the upper level to ensure efficient operation within safe system limits, while model predictive control (MPC) is used to optimize lower-level EV responses. Additionally, we provide a rigorous convergence analysis of the proposed bilevel optimization method. Detailed convergence studies and simulation results demonstrate the effectiveness and superiority of the proposed algorithm. © 2024 IEEE.

关键词： Predictive control systems

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Deception Attacks on Remote State Estimation with Constrained Alarm Rates: A Low-Dimensional Case 63

Optimal Linear Deception Attacks on Remote State Estimation ...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Shang, Jun Zhang, Hanwen Zhou, Jing Chen, Tongwen Tongji University Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Department of Control Science and Engineering Shanghai200092 China University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering Beijing100083 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

ISBN: (纸本)9798350316339

This study addresses linear attacks on remote state estimation within the context of a constrained alarm rate. Smart sensors, which are equipped with local Kalman filters, transmit innovations instead of raw measurements through a wireless communication network. This transmission is vulnerable to malicious data interception and manipulation by attackers. The aim of this research is to identify the optimal attack strategy that degrades the system performance while adhering to stealthiness constraints. A notable innovation of this paper is the direct association of the attack's stealthiness with the alarm rate, diverging from traditional approaches that rely on the covariance of the innovation or the Kullback-Leibler divergence, which are conventional metrics that have been extensively explored in previous studies. Our findings reveal that the optimal attack strategy exhibits some structural characteristics in systems of low dimensions. The performance of the proposed attack strategy is demonstrated through numerical examples. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DeepGCN based on variable multi‐graph and multimodal data for ASD diagnosis

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 879-893页

作者： Shuaiqi Liu Siqi Wang Chaolei Sun Bing Li Shuihua Wang Fei Li College of Electronic and Information Engineering Hebei UniversityBaodingChina Machine Vision Technology Innovation Center of Hebei Province BaodingChina The State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijingChina School of Computer Science and Technology Henan Polytechnic UniversityJiaozuoChina

Diagnosing individuals with autism spectrum disorder(ASD)accurately faces great chal-lenges in clinical practice,primarily due to the data's high heterogeneity and limited sample *** tackle this issue,the authors constructed a deep graph convolutional network(GCN)based on variable multi‐graph and multimodal data(VMM‐DGCN)for ASD ***,the functional connectivity matrix was constructed to extract primary ***,the authors constructed a variable multi‐graph construction strategy to capture the multi‐scale feature representations of each subject by utilising convolutional filters with varying kernel ***,the authors brought the non‐imaging in-formation into the feature representation at each scale and constructed multiple population graphs based on multimodal data by fully considering the correlation between *** extracting the deeper features of population graphs using the deep GCN(DeepGCN),the authors fused the node features of multiple subgraphs to perform node classification tasks for typical control and ASD *** proposed algorithm was evaluated on the Autism Brain Imaging Data Exchange I(ABIDE I)dataset,achieving an accuracy of 91.62%and an area under the curve value of 95.74%.These results demon-strated its outstanding performance compared to other ASD diagnostic algorithms.

关键词： machine learning medical image processing medical signal processing

来源：评论

学校读者我要写书评

暂无评论

Reduced-Complexity Approach for Opacity Enforcement Based on Extended Insertion Functions with Limited Insertion Events 20

Reduced-Complexity Approach for Opacity Enforcement Based on...

引用

20th IEEE International Conference on Networking, Sensing and control, ICNSC 2023

作者： Li, Xiaoyan Hadjicostis, Christoforos N. Li, Zhiwu North University of China School of Information and Communication Engineering Taiyuan China University of Cyprus Department of Electrical and Computer Engineering Nicosia Cyprus Macau University of Science and Technology Institute of Systems Engineering China

ISBN: (纸本)9798350369502

Opacity is a security and privacy property that guarantees predefined secret behavior of a cyber-physical system will not be inferred with certainty by a malicious entity. If a system is opacity-violating, extended insertion functions that insert fake symbols can be implemented to enforce opacity. By constricting the ways in which the fake symbols are inserted, this paper addresses opacity enforcement under the framework of finite state automata using extended insertion functions under event insertion constraints and limited insertion events constraints, i.e., only a limited number of symbols in a specified set can be inserted before and after an actual system output. The notion of (kb,ka)-EIC-enforceability is proposed to describe how to enforce opacity via extended insertion functions in the presence of both event insertion constraints and limited insertion events constraints. A necessary and sufficient condition to check (kb,ka)-EIC-enforceability is derived by constructing an appropriate verifier. © 2023 IEEE.

关键词： Opacity

来源：评论

学校读者我要写书评

暂无评论

Decomposition-Based Classifier Chains for Multi-Dimensional Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第2期3卷 176-191页

作者： Jia, Bin-Bin Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China College of Electrical and Information Engineering Lanzhou University of Technology Lanzhou730050 China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing210096 China

In multi-dimensional classification, the semantics of objects are characterized by multiple class variables from different dimensions. To model the dependencies among class variables, one natural strategy is to build a number of multiclass classifiers in a chaining structure, one per dimension, where the subsequent classifiers on the chain augment the feature space with all labeling information used by the preceding classifiers. However, it is shown that this strategy cannot compete with existing state-of-the-art approaches via comparative studies. One possible reason is that inaccurate predictions of preceding classifiers would degenerate the performance of subsequent ones. Besides, it is more difficult to learn a multiclass classifier than a binary one with the same accuracy, and better performance can be expected if the multi-dimensional classification problem can be solved by building multiple binary classifiers in a chaining structure. Based on these conjectures, this article proposes an approach, which builds a chain of binary classifiers to solve the multi-dimensional classification problem with the help of one-versus-one decomposition. To address the issue that different one-versus-one decomposed problems involve different training examples, the feature space is augmented with the binary predictions of preceding classifiers on the chain to train the subsequent ones. To alleviate the effect of the specified chaining order, the ensemble version of the proposed approach is further investigated. Comparative studies over 20 benchmark datasets clearly show the superiority of the proposed approach against the state-of-the-art multi-dimensional classification baselines. © 2020 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Tackling Real-world Complexity: Hierarchical Modeling and Dynamic Prompting for Multimodal Long Document Classification

引用

IEEE Transactions on Circuits and systems for Video Technology 2025年第6期35卷 5776-5790页

作者： Liu, Tengfei Hu, Yongli Li, Mingjie Yi, Junfei Chang, Xiaojun Gao, Junbin Yin, Baocai Beijing University of Technology Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing Institute of Artificial Intelligence School of Information Science and Technology Beijing100124 China Stanford University Department of Radiation Oncology StanfordCA94305 United States Hunan University National Engineering Laboratory of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha410082 China University of Technology Sydney ReLER Laboratory Australian Artificial Intelligence Institute Faculty of Engineering and Information Technology UltimoNSW2007 Australia The University of Sydney Business School The University of Sydney Discipline of Business Analytics CamperdownNSW2006 Australia

With the rapid growth of internet content, multimodal long document data has become increasingly prominent, drawing significant attention from researchers. However, most existing methods primarily focus on scenarios where all modalities are present, often overlooking more challenging and realistic cases involving missing image modality. To address this limitation, we propose a robust multimodal long document classification (MLDC) framework that integrates hierarchical modeling and dynamic prompting to handle complex multimodal long document data. Our approach begins by leveraging hierarchical modeling combined with an Adaptive Correlation Multimodal Transformer (ACMT) to effectively capture relationships between text and images at both section and sentence levels. We also introduce a Dynamic Prompt Generation (DPG) module at both levels to enhance the model's robustness in handling missing image data. By evaluating sample uncertainty, the DPG module dynamically adjusts both the number of prompts and the prompts themselves, allowing the model to better adapt to the varying needs of different samples. Finally, a Hierarchical Heterogeneous Graph (HHG) is introduced to enhance feature interactions across levels, further improving the coherence and accuracy of the model. Extensive experiments on four multi-modal long document datasets demonstrate that our model shows superior performance compared to existing state-of-the-art MLDC classification methods in various conditions. © 1991-2012 IEEE.

关键词： Adaptation models Transformers Data models Correlation Circuits and systems Electronic mail Robustness Uncertainty Training Complexity theory

来源：评论

学校读者我要写书评

暂无评论

An efficient data aggregation scheme with local differential privacy in smart grid

引用

Digital Communications and Networks 2022年第3期8卷 333-342页

作者： Na Gai Kaiping Xue Bin Zhu Jiayu Yang Jianqing Liu Debiao He School of Cyber Science and Technology University of Science and Technology of ChinaHefeiAnhui230027China Department of Electronic Engineering and Information Science University of Science and Technology of ChinaHefeiAnhui230027China Department of Electrical and Computer Engineering University of Alabama in HuntsvilleHuntsvilleAL35899USA Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education School of Cyber Science and EngineeringWuhan UniversityWuhanBeihu430072China

By integrating the traditional power grid with information and communication technology, smart grid achieves dependable, efficient, and flexible grid data processing. The smart meters deployed on the user side of the smart grid collect the users' power usage data on a regular basis and upload it to the control center to complete the smart grid data acquisition. The control center can evaluate the supply and demand of the power grid through aggregated data from users and then dynamically adjust the power supply and price, etc. However, since the grid data collected from users may disclose the user's electricity usage habits and daily activities, privacy concern has become a critical issue in smart grid data aggregation. Most of the existing privacy-preserving data collection schemes for smart grid adopt homomorphic encryption or randomization techniques which are either impractical because of the high computation overhead or unrealistic for requiring a trusted third party.

关键词： Local differential privacy Data aggregation Smart grid Privacy preserving

来源：评论

学校读者我要写书评

暂无评论

Distributed online bandit tracking for Nash equilibrium under partial-decision information setting

引用

science China(Technological sciences) 2023年第11期66卷 3129-3138页

作者： FENG ZhangCheng XU WenYing CAO JinDe YANG ShaoFu RUTKOWSKI Leszek Jiangsu Provincial Key Laboratory of Networked Collective Intelligence School of MathematicsSoutheast UniversityNanjing 211189China Frontiers Science Center for Mobile Information Communication and Security Nanjing 210096China School of Computer Science and Engineering Southeast UniversityNanjing 211189China The Systems Research Institute of the Polish Academy of Sciences Warsaw 01-447Poland AGH University of Science and Technology Krakow 30-059Poland

This paper is concerned with a Nash equilibrium(NE)tracking issue in online games with bandit feedback,where cost functions vary with time and agents only have access to the values of these functions at two points during each round.A partial-decision information setting is considered,in which agents have only access to the decisions of their *** primary objective of this paper is to develop a distributed online NE tracking algorithm that ensures sublinear growth of regret with respect to the total round T,under both the bandit feedback and partial-decision information *** utilizing a two-point estimator together with the leader-following consensus method,a new distributed online NE tracking algorithm is established with the estimated gradient and local estimated decisions based on the projection gradient-descent ***,sufficient conditions are derived to guarantee an improved upper bound of dynamic regret compared to existing bandit ***,a simulation example is presented to demonstrate the effectiveness of the proposed algorithm.

关键词： online game bandit feedback partial-decision two-point gradient estimator

来源：评论

学校读者我要写书评

暂无评论

Extremum Seeking of Nonlinear Static Maps with Constant Delays via a Time-delay Approach∗ 63

Extremum Seeking of Nonlinear Static Maps with Constant Dela...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Li, Jianzhong Fridman, Emilia Su, Hongye Zhu, Yang Southwest University of Science and Technology School of Information Engineering Mianyang621010 China Zhejiang University College of Control Science and Engineering Hangzhou310027 China Tel-Aviv University School of Electrical Engineering Tel Aviv-Yafo6997801 Israel Zhejiang University College of Control Science and Engineering State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang University Ningbo Innovation Center Ningbo315100 China

ISBN: (纸本)9798350316339

Extremum seeking (ES) is a real-time optimization strategy, thus transmission delays in the feedback loop of ES have big impact on its stability. How big delay that ES control systems are able to withstand? This paper tries to provide a potential answer to this problem. We extend a newly developed time-delay approach of ES from quadratic maps to general nonlinear maps under known constant transmission delays. The gradient-based ES in the case of single-variable and multivariable nonlinear static maps are considered. Different from the recent literature, the time-delay method in this paper is applicable to a big family of nonlinear static maps, and the robustness of ES control systems to transmission delays is investigated. By transforming the original ES system into a kind of time-delay system of neutral type, and further transforming the neutral system into a perturbed retarded system with constant delays, we provide simple Lyapunov-based sufficient conditions in the form of linear matrix inequalities (LMIs) to guarantee practical stability of the ES closed-loop system. © 2024 IEEE.

关键词： Delay control systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：