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

Submodularity-based False Data Injection Attack Scheme in Multi-agent Dynamical Systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Luo, Xiaoyu Zhao, Chengcheng Fang, Chongrong He, Jianping The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The State Key Laboratory of Industrial Control Technology Institute of Cyberspace Research Zhejiang University China The Department of Electrical and Computer Engineering University of Victoria BC Canada

Consensus in multi-agent dynamical systems is prone to be sabotaged by the adversary, which has attracted much attention due to its key role in broad applications. In this paper, we study a new false data injection (FDI) attack design problem, where the adversary with limited capability aims to select a subset of agents and manipulate their local multi-dimensional states to maximize the consensus convergence error. We first formulate the FDI attack design problem as a combinatorial optimization problem and prove it is NP-hard. Then, based on the submodularity optimization theory, we show the convergence error is a submodular function of the set of the compromised agents, which satisfies the property of diminishing marginal returns. In other words, the benefit of adding an extra agent to the compromised set decreases as that set becomes larger. With this property, we exploit the greedy scheme to find the optimal compromised agent set that can produce the maximum convergence error when adding one extra agent to that set each time. Thus, the FDI attack set selection algorithms are developed to obtain the near-optimal subset of the compromised agents. Furthermore, we derive the analytical suboptimality bounds and the worst-case running time under the proposed algorithms. Extensive simulation results are conducted to show the effectiveness of the proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamical systems

Deep Learning-Based Object Pose Estimation: A Comprehensive Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Jian Sun, Wei Yang, Hui Zeng, Zhiwen Liu, Chongpei Zheng, Jin Liu, Xingyu Rahmani, Hossein Sebe, Nicu Mian, Ajmal The National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering the State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha410082 China The School of Architecture and Art Central South University Changsha410082 China The Department of Automation Tsinghua University Beijing100084 China The School of Computing and Communications Lancaster University LA1 4YW United Kingdom The Department of Information Engineering and Computer Science University of Trento Trento38123 Italy The Department of Computer Science The University of Western Australia WA6009 Australia

Object pose estimation is a fundamental computer vision problem with broad applications in augmented reality and robotics. Over the past decade, deep learning models, due to their superior accuracy and robustness, have increasingly supplanted conventional algorithms reliant on engineered point pair features. Nevertheless, several challenges persist in contemporary methods, including their dependency on labeled training data, model compactness, robustness under challenging conditions, and their ability to generalize to novel unseen objects. A recent survey discussing the progress made on different aspects of this area, outstanding challenges, and promising future directions, is missing. To fill this gap, we discuss the recent advances in deep learning-based object pose estimation, covering all three formulations of the problem, i.e., instance-level, category-level, and unseen object pose estimation. Our survey also covers multiple input data modalities, degrees-of-freedom of output poses, object properties, and downstream tasks, providing the readers with a holistic understanding of this field. Additionally, it discusses training paradigms of different domains, inference modes, application areas, evaluation metrics, and benchmark datasets, as well as reports the performance of current state-of-the-art methods on these benchmarks, thereby facilitating the readers in selecting the most suitable method for their application. Finally, the survey identifies key challenges, reviews the prevailing trends along with their pros and cons, and identifies promising directions for future research. We also keep tracing the latest works at Awesome-Object-Pose-Estimation. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

Relational Prompt-based Pre-trained Language Models for Social Event Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Pu, L.I. Xiaoyan, Y.U. Peng, Hao Xian, Yantuan Wang, Linqin Li, S.U.N. Zhang, Jingyun Philip, S.Y.U. Faculty of Information Engineering and Automation Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China School of Cyber Science and Technology Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China School of Control and Computer Engineering North China Electric Power University Beijing102206 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

Social Event Detection (SED) aims to identify significant events from social streams, and has a wide application ranging from public opinion analysis to risk management. In recent years, Graph Neural Network (GNN) based solutions have achieved state-of-the-art performance. However, GNN-based methods often struggle with missing and noisy edges between messages, affecting the quality of learned message embedding. Moreover, these methods statically initialize node embedding before training, which, in turn, limits the ability to learn from message texts and relations simultaneously. In this paper, we approach social event detection from a new perspective based on Pre-trained Language Models (PLMs), and present RPLM (Relational prompt-based Pre-trained Language Models for Social Event Detection). We first propose a new pairwise message modeling strategy to construct social messages into message pairs with multi-relational sequences. Secondly, a new multi-relational prompt-based pairwise message learning mechanism is proposed to learn more comprehensive message representation from message pairs with multi-relational prompts using PLMs. Thirdly, we design a new clustering constraint to optimize the encoding process by enhancing intra-cluster compactness and inter-cluster dispersion, making the message representation more distinguishable. We evaluate the RPLM on three real-world datasets, demonstrating that the RPLM model achieves state-of-the-art performance in offline, online, low-resource, and long-tail distribution scenarios for social event detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk assessment

DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Li Huang, Zhenhao Wu, Hua Ye, Junda Peng, Hao Yu, Zhengtao Yu, Philip S. School of Control and Computer Engineering North China Electric Power University Beijing102206 China School of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming650500 China Department of Computer Science University of Illinois ChicagoIL United States

Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined graph. In the literature, most GSL solutions either primarily focus on structure refinement with task-specific supervision (i.e., node classification), or overlook the inherent weakness of GNNs themselves (e.g., over-squashing), resulting in suboptimal performance despite sophisticated designs. In light of these limitations, we propose to study self-supervised graph structure-feature co-refinement for effectively alleviating the issue of over-squashing in typical GNNs. In this paper, we take a fundamentally different perspective of the Ricci curvature in Riemannian geometry, in which we encounter the challenges of modeling, utilizing and computing Ricci curvature. To tackle these challenges, we present a self-supervised Riemannian model, DeepRicci. Specifically, we introduce a latent Riemannian space of heterogeneous curvatures to model various Ricci curvatures, and propose a gyrovector feature mapping to utilize Ricci curvature for typical GNNs. Thereafter, we refine node features by geometric contrastive learning among different geometric views, and simultaneously refine graph structure by backward Ricci flow based on a novel formulation of differentiable Ricci curvature. Finally, extensive experiments on public datasets show the superiority of DeepRicci, and the connection between backward Ricci flow and over-squashing. Codes of our work are given in https://***/RiemanGraph/. © 2024, CC BY-NC-SA.

关键词： Graph neural networks

End-to-end 2D-3D Registration between Image and LiDAR Point Cloud for Vehicle Localization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Guangming Zheng, Yu Guo, Yanfeng Liu, Zhe Zhu, Yixiang Burgard, Wolfram Wang, Hesheng Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China China Department of Artificial Intelligence Shanghai Jiao Tong University Shanghai200240 China Electrical and Computer Engineering University of California Los Angeles United States Institute of Artificial Intelligence Shanghai Jiao Tong University Shanghai200240 China Department of Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Engineering University of Technology Nuremberg Germany

Robot localization using a previously built map is essential for a variety of tasks including highly accurate navigation and mobile manipulation. A popular approach to robot localization is based on image-to-point cloud registration, which combines illumination-invariant LiDAR-based mapping with economical image-based localization. However, the recent works for image-to-point cloud registration either divide the registration into separate modules or project the point cloud to the depth image to register the RGB and depth images. In this paper, we present I2PNet, a novel end-to-end 2D-3D registration network. I2PNet directly registers the raw 3D point cloud with the 2D RGB image using differential modules with a unique target. The 2D-3D cost volume module for differential 2D-3D association is proposed to bridge feature extraction and pose regression. 2D-3D cost volume module implicitly constructs the soft point-to-pixel correspondence on the intrinsic-independent normalized plane of the pinhole camera model. Moreover, we introduce an outlier mask prediction module to filter the outliers in the 2D-3D association before pose regression. Furthermore, we propose the coarse-to-fine 2D-3D registration architecture to increase localization accuracy. We conduct extensive localization experiments on the KITTI Odometry and nuScenes datasets. The results demonstrate that I2PNet outperforms the state-of-the-art by a large margin. In addition, I2PNet has a higher efficiency than the previous works and can perform the localization in real-time. Moreover, we extend the application of I2PNet to the camera-LiDAR online calibration and demonstrate that I2PNet outperforms recent approaches on the online calibration task. Copyright © 2023, The Authors. All rights reserved.

关键词： Calibration

Production Scheduling Application Software for Small Medium Enterprises

学校读者我要写书评

暂无评论

Production Scheduling Application Software for Small Medium ...

International Conference on System Science and engineering (ICSSE)

作者： Xuan-Thuyen Le The-Anh-Tu Nguyen Ngoc-Hieu Pham Ngoc-Huy Tran Innovation Fablab Ho Chi Minh City University of Technology (HCMUT) VNU-HCM Ho Chi Minh City Vietnam Department of Control & Automation Faculty of Electrical & Electronics Engineering Ho Chi Minh City University of Technology (HCMUT) VNU-HCM Ho Chi Minh City Vietnam Department of Mechatronics Cao Thang Technical College Ho Chi Minh City Vietnam

Derived from the current implementation of the production plan as well as the production schedule, Enterprise Resource Planning software with a built-in production scheduling algorithm helps optimize the uses of resources, reduce production time, increase productivity, and increase customer service levels. In this research, the available management platform (Odoo) with Python as the main programming language is proposed to build a system to support suitable schedule production plans helps shorten processing time and reduce order delay. In addition, the results are shown in detail and can be flexibly modified manually on the Gantt chart. The feasibility of the production scheduling application is shown by the Gantt chart before and after the scheduling. Moreover, the order delay rate has been reduced from 15% to 3.33%.

关键词：

Exploiting the Intrinsic Neighborhood Semantic Structure for Domain Adaptation in EEG-based Emotion Recognition

学校读者我要写书评

暂无评论

IEEE Transactions on Affective Computing 2025年

作者： Yang, Yi Wang, Ze Song, Yu Jia, Ziyu Wang, Boyu Jung, Tzyy-Ping Wan, Feng Macau University of Science and Technology Macao Centre for Mathematical Sciences Respiratory Disease AI Laboratory on Epidemic Intelligence and Medical Big Data Instrument Applications Faculty of Innovation Engineering 999078 China Tianjin University of Technology School of Electrical Engineering and Automation Tianjin Key Laboratory of New Energy Power Conversion Transmission and Intelligent Control Tianjin300384 China Chinese Academy of Sciences Beijing Key Laboratory of Brainnetome and Brain-Computer Interface and Brainnetome Center Institute of Automation Beijing100045 China Western University Department of Computer Science Brain Mind Institute LondonONN6A 3K7 Canada University of California at San Diego Swartz Center for Computational Neuroscience Institute for Neural Computation La Jolla CA92093 United States University of Macau Department of Electrical and Computer Engineering Faculty of Science and Technology China University of Macau Centre for Cognitive and Brain Sciences Centre for Artificial Intelligence and Robotics Institute of Collaborative Innovation 999078 China

Due to the inherent non-stationarity and individual differences present in electroencephalogram (EEG) signals, developing a generalizable model that performs well on new subjects is challenging in EEG-based emotion recognition. Most existing domain adaptation (DA) methods typically mitigate these discrepancies by aligning the marginal distributions of domain feature representations. However, when there is a significant difference in the class-conditional distribution between domain features and labels, the domain-invariant features learned by aligning marginal distributions may have limited discriminative ability for unlabeled target instances or even prove counterproductive. To address this issue, we propose a Neighborhood Semantic Aware Learning-based Dynamic Graph Attention Convolution (NSAL-DGAT) approach that learns target semantic information by considering the inter-domain semantic topological structure, thereby improving classifier adaptation for target instances. Specifically, the proposed NSAL framework is designed to capitalize on the insight that after domain feature alignment, some target samples and their neighboring source samples exhibit similar semantics. By leveraging the neighborhood topological structure, we extract and incorporate semantic target features to train a more transferable classifier. Besides, we implement an entropy weighting mechanism to emphasize representative target semantic information, encouraging target instances to prioritize high-confidence individuals within the source neighborhood. We have conducted extensive experiments on the public SEED dataset and our collected the Hearing-Impaired EEG Dataset (HIED). The experimental results underscore the efficacy of our proposed NSAL-DGAT approach, showcasing state-of-the-art accuracy in subject-dependent as well as subject-independent scenarios. The source code is available at https://***/YYingDL/NSAL-DGAT. © 2010-2012 IEEE.

关键词： Speech analysis

Nearest-Better Network for Fitness Landscape Analysis of Continuous Optimization Problems

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年

作者： Diao, Yiya Li, Changhe Zeng, Sanyou Yang, Shengxiang Coello, Carlos A. Coello China University of Geosciences School of Automation Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Ministry of Education Engineering Research Center of Intelligent Technology for Geo-Exploration Wuhan China Anhui University of Sciences and Technology School of Artificial Intelligence Hefei China China University of Geosciences School of Mechanical Engineering and Electronic Information Wuhan China De Montfort University School of Computer Science and Informatics LeicesterLE1 9BH United Kingdom Department of Computer Science CINVESTAV-IPN 07360 Mexico Tecnologico de Monterrey Faculty of Excellence The School of Engineering and Sciences N.L. Monterrey Mexico

Fitness landscape analysis (FLA) is quite important in evolutionary computation. In this paper, we propose a novel FLA method, the nearest-better network (NBN), which uses the nearest-better relationship to simplify the original fitness landscape of continuous optimization problems. We introduce an efficient algorithm to calculate NBN for continuous problems. We also propose four numerical measurements and a 3D visualization method based on NBN. Experiments show that compared to the other main FLA methods, the four numerical measurements proposed here can effectively measure the four intended features: neutrality, ruggedness, modality, and basin of attraction, respectively, and common features of the fitness landscape can be maintained in 3D NBN visualization, regardless of the scale of the problem. NBN also provides a view of how algorithms search in high-dimensional problems with the help of the 3D NBN visualization. © 1997-2012 IEEE.

关键词： Optimization algorithms

A Pricing Rule for Third-Party Platoon Coordination Service Provider

学校读者我要写书评

暂无评论

A Pricing Rule for Third-Party Platoon Coordination Service ...

Asian control Conference

作者： Ting Bai Alexander Johansson Shaoyuan Li Karl Henrik Johansson Jonas Må rtensson Integrated Transport Research Lab Digital Futures and Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University Shanghai China

We model a platooning system including trucks and a third-party service provider that performs platoon coordination, distributes the platooning profit within platoons, and charges the trucks in exchange for its services. This paper studies one class of pricing rules, where the third-party service provider keeps part of the platooning profit each time a platoon is formed. Furthermore, we propose a platoon coordination solution based on distributed model predictive control in which the pricing rule is integrated. To evaluate the effect of the pricing on the platooning system, we perform a simulation over the Swedish road network. The simulation shows that the platooning rate and profit highly depend on the pricing. This suggests that pricing needs to be set carefully to obtain a satisfactory platooning system in the future.

关键词： Roads Pricing Predictive control