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

Innate Cyber-Immunity and Acquired Cyber-Immunity across Multi-Area Power Systems

IEEE Transactions on Power Systems 2025年

作者： Hou, Jiazuo Song, Yue Hou, Yunhe Peng, Jimmy Chih-Hsien National University of Singapore Department of Electrical and Computer Engineering Singapore Tongji University Department of Control Science and Engineering National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology Shanghai201804 China The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong University of Hong Kong Shenzhen Institute of Research and Innovation Shenzhen518057 China

Organisms have evolved innate and acquired immune systems to defend against pathogens like coronaviruses. Similarly, power networks, threatened by cyber-attacks, desire cyber-immunity. Inspired by the immunology research, this study develops a cyber-immune strategy-characterizing innate cyber-immunity and establishing acquired cyber-immunity-for any selected portion of a power network (termed as power subnetwork) against stealthy false data injection (FDI) cyberattacks. Therein, without extrinsic protection and information asymmetry, this paper for the first time confirms the existence and provides closed-form conditions for power subnetworks that are innately immune to FDI cyber-attacks despite all measurements being compromised. Single-leader-multi-follower bi-level optimization models are then developed to strategically allocate measurement protection, leading to the acquired cyber-immunity, whose conditions for existence and the least cost are explicitly formulated. More importantly, a bi-directional cyber-immunity propagation mechanism is presented to provide the optimal spatial allocation of defense resources across adjacent subnetworks. It also explicitly determines the temporal allocation sequence, revealing its sequential and cumulative impacts on establishing cyber-immunity. This is achieved by designing recursive traversal algorithms, one of which is modelled as a post-order depth-first-search problem of a multi-fork tree. The proposed subnetwork-specific cyber-immune strategy is verified in a modified Australian National Electricity Market. © 1969-2012 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Node-Decomposition Privacy-Preserving for Finite-Time Secondary control of DC Microgrids

引用

IEEE Transactions on Smart Grid 2025年

作者： Wu, Han Zhu, Si-Min Chai, Li Zhu, Zhen-Hua Tian, Yu-Chu Wuhan University of Science and Technology Engineering Research Center of Metallurgical Automation and Measurement Technology School of Artificial Intelligence and Automation Wuhan430081 China Zhejiang University State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Hangzhou310027 China Huzhou Institute of Industrial Control Technology Huzhou China Queensland University of Technology School of Computer Science BrisbaneQLD4001 Australia

In the distributed secondary control of DC microgrids, achieving both rapid convergence and robust information security is critical for enhancing control performance and maintaining power quality. However, current privacy-preserving approaches often compromise either control performance or privacy preservation performance. To address this challenge, this paper presents a node-decomposition privacy-preserving (NDPP) method for fully distributed, finite-time secondary control in DC microgrids. By splitting each node in the communication graph into multiple sub-nodes, the method enhances both convergence speed and privacy preservation without sacrificing control accuracy. Sub-nodes communicate within groups, and the topology of the generated graph is concealed from malicious nodes and eavesdroppers. Theoretical analysis is provided to prove finite-time voltage regulation and current sharing with privacy preservation against malicious nodes and external eavesdroppers. Simulations are conducted to verify the effectiveness of the method in maintaining control performance and power quality. © 2010-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Finite Sample Analysis of Subspace Identification Methods

arXiv

引用

arXiv 2025年

作者： He, Jiabao Ziemann, Ingvar Rojas, Cristian R. Qin, S. Joe Hjalmarsson, Håkan Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden University of Pennsylvania PhiladelphiaPA19104 United States Institute of Data Science Lingnan University Hong Kong

As one of the mainstream approaches in system identification, subspace identification methods (SIMs) are known for their simple parameterization for MIMO systems and robust numerical properties. However, a comprehensive statistical analysis of SIMs remains an open problem. Amid renewed focus on identifying state-space models in the non-asymptotic regime, this work presents a finite sample analysis for a large class of open-loop SIMs. It establishes high-probability upper bounds for system matrices obtained via SIMs, and reveals that convergence rates for estimating Markov parameters and system matrices are O(1/√N) up to logarithmic terms, in line with classical asymptotic results. Following the key steps of SIMs, we arrive at the above results by a three-step procedure. In Step 1, we begin with a parsimonious SIM (PARSIM) that uses least-squares regression to estimate multiple high-order ARX models in parallel. Leveraging a recent analysis of an individual ARX model, we obtain a union error bound for a bank of ARX models. Step 2 involves model reduction via weighted singular value decomposition (SVD), where we consider different data-dependent weighting matrices and use robustness results for SVD to obtain error bounds on extended controllability and observability matrices, respectively. The final Step 3 focuses on deriving error bounds for system matrices, where two different realization algorithms, the MOESP type and the Larimore type, are considered. Although our study initially focuses on PARSIM, the methodologies apply broadly across many variants of SIMs. Copyright © 2025, The Authors. All rights reserved.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

UGNA-VPR: A Novel Training Paradigm for Visual Place Recognition Based on Uncertainty-Guided NeRF Augmentation

arXiv

引用

arXiv 2025年

作者： Shen, Yehui Zhang, Lei Li, Qingqiu Zhao, Xiongwei Wang, Yue Lu, Huimin Chen, Xieyuanli College of Intelligence Science and Technology National University of Defense Technology China Faculty of Robot Science and Engineering Northeastern University China School of Electronic and Information Engineering Harbin Institute of Technology Shenzhen China State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University China SIASUN Robot& Automation Co. Ltd China School of Computer Science Fudan University China

Visual place recognition (VPR) is crucial for robots to identify previously visited locations, playing an important role in autonomous navigation in both indoor and outdoor environments. However, most existing VPR datasets are limited to single-viewpoint scenarios, leading to reduced recognition accuracy, particularly in multi-directional driving or feature-sparse scenes. Moreover, obtaining additional data to mitigate these limitations is often expensive. This paper introduces a novel training paradigm to improve the performance of existing VPR networks by enhancing multi-view diversity within current datasets through uncertainty estimation and NeRF-based data augmentation. Specifically, we initially train NeRF using the existing VPR dataset. Then, our devised self-supervised uncertainty estimation network identifies places with high uncertainty. The poses of these uncertain places are input into NeRF to generate new synthetic observations for further training of VPR networks. Additionally, we propose an improved storage method for efficient organization of augmented and original training data. We conducted extensive experiments on three datasets and tested three different VPR backbone networks. The results demonstrate that our proposed training paradigm significantly improves VPR performance by fully utilizing existing data, outperforming other training approaches. We further validated the effectiveness of our approach on self-recorded indoor and outdoor datasets, consistently demonstrating superior results. Our dataset and code have been released at https://***/nubot-nudt/UGNA-VPR. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LSU-NET: Lightweight Automatic Organs Segmentation Network for Medical Images

LSU-NET: Lightweight Automatic Organs Segmentation Network f...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yujie Ding Shenghua Teng Zuoyong Li Xiao Chen College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Minjiang University Fuzhou China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

UNet and its variants have widespread applications in medical image segmentation. However, the substantial number of parameters and computational complexity of these models make them less suitable for use in clinical settings with limited computational resources. To address this limitation, we propose a novel Lightweight Shift U-Net (LSU-Net). We integrate the Light Conv Block and the Tokenized Shift Block in a lightweight manner, combining them with a dynamic weight multi-loss design for efficient dynamic weight allocation. The Light Conv Block effectively captures features with a low parameter count by combining standard convolutions with depthwise separable convolutions. The Tokenized Shift Block optimizes feature representation by shifting and capturing deep features through a combination of the Spatial Shift Block and depthwise separable convolutions. Dynamic adjustment of the loss weights at each layer approaches the optimal solution and enhances training stability. We validated LSU-Net on the UWMGI and MSD Colon datasets, and experimental results demonstrate that LSU-Net outperforms most state-of-the-art segmentation architectures.

关键词： Training Image segmentation Convolution Dynamic scheduling Stability analysis Resource management Speech processing Standards Monitoring Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

ISAE-GZSL: Interpolated Incomplete Semantic Attribute Enhancement for Generalized Zero-Shot Learning 11th

ISAE-GZSL: Interpolated Incomplete Semantic Attribute Enhanc...

引用

11th International Symposium on Computational Intelligence and Industrial Applications, ISCIIA 2024

作者： Zhang, Xiaomeng Zheng, Zhi College of Computer and Cyber Security Fujian Normal University Fuzhou350117 China College of Control Science and Engineering Zhejiang University Hangzhou310027 China

ISBN: (纸本)9789819647521

Generalized zero-shot learning (GZSL) is focused on recognizing classes, both seen and unseen, without the need for labeled data specifically for the unseen classes. GZSL has attracted much attention by transforming the traditional GZSL into a fully supervised learning task. Most GZSL methods use a single semantic attribute (each category can only correspond to a specific semantic attribute) plus Gaussian noise to generate visual features, assuming a one-to-one correspondence between these visual features and single semantic attributes. However, in practice, there may be cases of attribute missingness in images, leading to visual features that lack certain attributes, thus failing to achieve a good mapping between semantic attributes and visual features. Therefore, visual features of the same class should have diverse semantic attributes. To address this issue, we propose a new method for enhancing semantic attributes called "Interpolated Semantic Attribute Enhancement for Generalized Zero-Shot Learning (ISAE-GZSL)." This method uses interpolation to deal with the problem of semantic attribute missingness in real-world situations, thereby enhancing semantic diversity and generating more realistic and diverse visual features. We assess the performance of the proposed model across four benchmark datasets, and the findings demonstrate substantial enhancements over current state-of-the-art methods, especially in handling categories with severe attribute missingness in the datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

GITANet: Group Interactive Threshold-based Attention Network for Hyperspectral Image Classification

引用

IEEE Transactions on Multimedia 2025年

作者： Duan, Yule Chen, Chuang Fu, Maixia Gong, Xiuwen Niu, Yingying Luo, Fulin The University of Sydney Faculty of Engineering NSW2006 Australia Henan University of Technology Key Laboratory of Grain Information Processing and Control Ministry of Education Zhengzhou450001 China Henan University of Technology Key Laboratory of Grain Photoelectric Detection and Control Zhengzhou450001 China Chongqing University College of Computer Science Chongqing400044 China

Group convolution networks have shown great potential in hyperspectral image (HSI) classification because of their ability to divide total spectral bands into multiple groups and focus on fine discrimination within different spectral ranges. Most group convolution networks process parallel spectral groups independently;however, they neglect the important relevance of nearby spectral ranges. Moreover, the feature maps from different spectral groups are not considered for recalibration in the existing attention. To address these issues, we propose a novel group interactive threshold attention network (GITANet). In the network, a stratified-split-concatenation strategy, which not only splits all bands into multiple groups for intragroup convolution but also propagates the intergroup information via the stratified concatenation operation between different groups, is designed for bandwise group convolution. Relying on the high dependencies among nearby spectra, the cross-group interactive attention block is designed to encourage significant spectral features. Subsequently, from different spectral ranges, a learnable threshold generation block is built to estimate the information validity of each pixel. On the basis of this threshold, soft threshold spatial attention is developed in the bandwise encoderdecoder architecture, which emphasizes high-value spatial areas during the fusion of group convolutional features. Therefore, complementary and discriminative spectral-spatial features are obtained to improve the performance of HSI classification. The experimental results on three HSI datasets illustrate that GITANet is superior to several state-of-the-art networks. © 1999-2012 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of Nature-Based Solutions for Urban Challenges

arXiv

引用

arXiv 2025年

作者： Pinto, Diego Maria Russo, Davide Donato Sudoso, Antonio M. Institute for Systems Analysis and Computer Science "Antonio Ruberti" National Research Council Via dei Taurini 19 Rome00185 Italy Department of Computer Control and Management Engineering "Antonio Ruberti" Sapienza University of Rome Via Ariosto 25 Rome00185 Italy

Increased urbanization and climate change intensify urban heat islands and degrade air quality, making current mitigation strategies insufficient. Nature-based solutions (NBSs), such as parks, green walls, roofs, and street trees, offer a promising means to regulate urban temperatures and enhance air quality. However, determining their optimal placement to maximize environmental benefits remains a pressing challenge. Leveraging Operational Research (OR) tools, we propose a Mixed-Integer Linear Programming (MILP) model that integrates multiple factors, including urban challenges, physical constraints, clustering techniques, convolution theory, and fairness considerations. This model determines the optimal placement of NBSs by addressing metrics such as ground temperature, air quality, and accessibility to green spaces. Through several case study analyses, we demonstrate the effectiveness of our approach in improving environmental and social indicators. This research holds implications for policy and practice, empowering urban planners and policymakers to make informed decisions regarding NBS implementation. Such decisions ensure that investments in urban greening yield maximum environmental, social, and economic benefits. Copyright © 2025, The Authors. All rights reserved.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

CorPN: Corner Prediction Network for Visual Tracking

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Li, Qun Zhang, Haijun Yang, Kai Dai, Wei Ma, Jianghong Liu, Yuping the Department of Computer Science Harbin Institute of Technology Shenzhen Xili University Town Shenzhen518055 China the School of Computer Science and Artificial Intelligence WuHan Textile University Wuhan430200 China the School of Information and Control Engineering Artificial Intelligence Research Institute China University of Mining and Technology Xuzhou221116 China the School of Microelectronics Fudan University Shanghai200433 China

Object tracking is a well-established task in the field of computer vision. Despite numerous efforts over the last few decades, object tracking remains a formidable challenge, largely due to the complexity of the scenes encountered in video sequences. In line with the powerful capabilities of Transformers for object feature extraction and fusion, as well as drawing inspiration from CornerNet, this paper introduces a new Transformer-based anchor-free method designed for object tracking called CorPN (i.e., Corner Prediction Network). Specifically, a Transformer-based backbone is proposed to extract and fuse deep features in a Siamese network architecture. Furthermore, our methodology aims to emulate the intuitive cognitive process by which humans identify the bounding-box corners of objects. CorPN turns out to be a more effective and robust tracking method because it jointly leverages multi-level feature aggregation, corner prediction, and probabilistic prediction incorporated in the tracking head. In extensive evaluations on public datasets, our method achieves a state-of-the-art performance. In particular, our approach achieves an area-under-the-curve (AUC) of 85.2%, a precision score (P) of 84.5%, and a normalized precision score (Pnorm) of 89.6%, outperforming extant state-of-the-art trackers on these metrics. © 2025 IEEE. All rights reserved,

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Stability Analysis of Connected Vehicle Platoons with Markovian Packet Losses

引用

IEEE Internet of Things Journal 2025年

作者： Wu, Yilin Zhao, Xiaoyan Shen, Zhiping Liu, Yonggui Li, Zeming Guangdong University of Education School of Computer Science Guangzhou510310 China Henan Normal University School of Mathematics and Statistics Xinxiang453007 China South China University of Technology Key Laboratory of Autonomous Systems and Network Control Ministry of Education The College of Automatic Science and Engineering Guangzhou510640 China

This article focuses on discussing the effects of inter-vehicular communication on the performance of platoon control. Different from the existing results established under a critical assumption that the fading channels are independent, this paper models the inter-vehicular communication as Markovian packet loss channel which can capture the temporal interdependencies of packet losses. Our aim is to decide whether there exists a distributed controller such that the underlying vehicle platoon can achieve mean square stability (MSS) over Markovian packet loss channels. First, for the scenario with identical Markovian packet losses, we begin by deriving a necessary and sufficient condition for the platoon MSS, which is established by utilizing the stability principles of Markov jump linear systems. Additionally, we propose a numerically verifiable criterion for MSS, which can be validated through the feasibility of linear matrix inequalities (LMIs). Furthermore, based on the modified Riccati inequality (MRI), we provide an analytical sufficient condition that ensures MSS for vehicle platoons. This condition is expressed in terms of the information flow topology (IFT) and the statistical parameters of Markov channels. Second, for the case with nonidentical packet dropouts, we introduce a Markovian loss channel based switching (MLCBS) model. Building upon this model, we further propose a sufficient conditon related to IFT and the transition probability matrix, and a distributed controller that is not only easy to implement but also enables the achievement of MSS for vehicle platoons with nonidentical packet dropouts. Ultimately, numerical experiments are performed to validate the obtained outcomes. © 2014 IEEE.

关键词： Intelligent Transportation Systems Resource-Constrained Networks Vehicular Networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：