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

arXiv 2022年

作者： Zimmermann, Martin Vu, Minh Nhat Beck, Florian Nguyen, Anh Kugi, Andreas TU Wien Vienna Austria Center for Vision Automation and Control AIT Austrian Institute of Technology Vienna Austria Department of Computer Science University of Liverpool Liverpool United Kingdom

This paper presents a two-step algorithm for online trajectory planning in indoor environments with unknown obstacles. In the first step, sampling-based path planning techniques such as the optimal Rapidly exploring Random Tree (RRT*) algorithm and the Line-of-Sight (LOS) algorithm are employed to generate a collision-free path consisting of multiple waypoints. Then, in the second step, constrained quadratic programming is utilized to compute a smooth trajectory that passes through all computed waypoints. The main contribution of this work is the development of a flexible trajectory planning framework that can detect changes in the environment, such as new obstacles, and compute alternative trajectories in real time. The proposed algorithm actively considers all changes in the environment and performs the replanning process only on waypoints that are occupied by new obstacles. This helps to reduce the computation time and realize the proposed approach in real time. The feasibility of the proposed algorithm is evaluated using the Intel Aero Ready-to-Fly (RTF) quadcopter in simulation and in a real-world experiment. © 2022, CC BY-NC-ND.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

2M3DF: Advancing 3D Industrial Defect Detection with Multi Perspective Multimodal Fusion Network

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Asad, Mujtaba Azeem, Waqar Jiang, He Mustafa, Hafiz Tayyab Yang, Jie Liu, Wei Shanghai Jiao Tong University Institute of Image Processing and Pattern Recognition Department of Automation Shanghai200240 China Lahore Garrison University Department of Software Engineering Lahore54000 Pakistan China University of Mining and Technology School of Information and Control Engineering Jiangsu Xuzhou221116 China Zhejiang Normal University School of Computer Science and Technology Jinhua321004 China

In the context of Industrial Anomaly Detection (IAD), ensuring the quality of manufactured products is critical. Traditional 2D based methods often fail to capture anomalies present in complex 3D shapes. For effective anomaly detection in 3D shapes, it is essential to incorporate global semantic context, local geometric structure, and color information of the object. To fully leverage these features, we propose a network named 2M3DF, that leverages knowledge from multi-view RGB images and corresponding point cloud information for enhanced anomaly detection performance. Our model initially employs pre-trained feature extractors that generate local features from multi-view RGB images and corresponding point clouds. The novel inter-modality feature representation and fusion module first adapts these inter-modality features and then effectively aligns and aggregates these multimodality features on a pixel-to-point basis. To learn the normality from point-wise fused multimodal features, we fit a multivariate Gaussian distribution to model the normal feature distribution. Comprehensive experimental evaluations using the MVTec3D-AD and Eyecandies dataset validate the effectiveness of our propose model and demonstrate significant improvements in comparison to existing state-of-the-art methods. Our model achieves a 96.6% mean I-AUROC while delivering real-time results. © 1991-2012 IEEE.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

A Single-Cell Clustering Algorithm Based on Structure Pertur...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Meineng Wang Luping Zhang Yu-An Huang Yangyuan Li Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Mathematics and Computer Science Yichun University Yichun China School of Information Engineering East China University of Technology Nanchang China School of Computer Science Northwestern Polytechnical University Xi’an China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets.

关键词： Sequential analysis Perturbation methods Clustering methods RNA Noise Clustering algorithms Sparse matrices Gene expression Unsupervised learning Periodic structures

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Stealthy Attacks on Sampled-Data control and Encryption-Based Countermeasures

引用

IEEE Transactions on Automatic control 2025年

作者： Shang, Jun Li, Yuzhe Chen, Tongwen Tongji University Department of Control Science and Engineering Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai200092 China Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110004 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

This paper investigates stealthy attacks on sampled-data control systems, where a continuous process is sampled periodically, and the resultant discrete output and control signals are transmitted through dual channels in wireless communication networks. Acknowledging the vulnerability of these transmitted data to cyber threats, we analyze two types of stealthy attacks that compromise either one or both channels. We explicitly present the necessary and sufficient conditions for the existence of stealthy single-channel attacks. To mitigate these security risks, we implement encryption-based countermeasures, including linear time-invariant and periodic encryption methods. We detail sufficient conditions under which these encryption strategies effectively thwart single- and dual-channel stealthy attacks. The effectiveness of these approaches and the theoretical findings are demonstrated through numerical simulations. © 1963-2012 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

Maturity Model for AI in Smart Production Planning and control System 55

Maturity Model for AI in Smart Production Planning and Contr...

引用

55th CIRP Conference on Manufacturing Systems, CIRP CMS 2022

作者： Colangelo, Eduardo Fries, Christian Hinrichsen, Theresa-Franziska Szaller, Ádám Nick, Gábor Fraunhofer Institute for Manufacturing Engineering and Automation IPA Nobelstr. 12 Stuttgart70569 Germany University of Stuttgart Institute of Industrial Manufacturing and Management IFF Allmandring 35 Stuttgart70569 Germany Institute for Computer Science and Control Kende str. 13-17. Budapest1111 Hungary Department of Manufacturing Science and Engineering Budapest University of Technology and Economics Budapest1111 Hungary EPIC InnoLabs Nonprofit Ltd. Kende str. 13-17. Budapest1111 Hungary

The utilization of Artificial Intelligence (AI) to improve processes constitutes a main subject for many enterprises. The area of Production Planning and control (PPC) possesses several functions that could profit from such approaches. However, manufacturing companies find themselves often limited in the application of these approaches. This paper concentrates on three elements to assist enterprises: 1) the clarification of what AI is (in the manufacturing context) and its application to the field of PPC;2) a review performed together with manufacturing enterprises in Germany and Hungary in order to understand the obstacles for the implementation of AI;and 3) the proposal of a maturity model to help enterprises understand where they are in regards to AI, as a way to help them create a roadmap to achieve their objectives. © 2022 The Authors. Published by Elsevier B.V.

关键词： Artificial Intelligence Maturity Model Production Planning and control Smart Production

来源：评论

学校读者我要写书评

暂无评论

A Simplified Variant for Graph Convolutional Network Based Knowledge Graph Completion Model 8

A Simplified Variant for Graph Convolutional Network Based K...

引用

8th International Conference on Data science in Cyberspace, DSC 2023

作者： Wang, Yashen Li, Qiang Zhang, Yi Zhang, Xuecheng Ju, Zhuoya Sun, Jian Beijing China Scientific and Technological Innovation Center of Ari Institute of Automation Chinese Academy of Sciences The State Key Laboratory for Management and Control of Complex Systems Beijing China Cetc Academy of Electronics and Information Technology Group Co. Ltd. Beijing China Khoury College of Computer Science Northeastern University United States Scientific and Technological Innovation Center of Ari Beijing China Qi An Xin Technology Group Inc. Beijing China

ISBN: (纸本)9798350331035

Knowledge graphs (KGs) serve as useful resources for various applications including machine learning, data mining, and artificial intelligence. Knowledge Graph Completion (KGC) aims at reasoning over known (observed) facts and infer the missing (unobserved) relationships, to improve KG's coverage. Many recent works have laid stress on leveraging Graph Convolutional Networks (GCNs) for KGC task, which obtain good representation learning ability for graph-structured data, and have achieved satisfactory results. However, GCN-based researches continue to improve these lines of models by introducing an increasingly complex feature space. Especially, the hyper-parameter space of conventional GCN-based KGC model is too huge, resulting in low computational efficiency and excessive storage pressure. To overcome this problem, this paper investigates a simplified and generic variant for GCN-based KGC model, and shows that simple changes in the architecture of the underlying architecture (with a Subtraction Operator and an Addition Operator), can compte with state-of-the-art GCN-based models. Therefore, this paper proposes a easy-to-accomplish plug-in unit, which could be loaded into any current GCN-based KGC architectures, and help them maximize the maintenance of native model's original performance while significantly reducing parameter scale. © 2023 IEEE.

关键词： Graph Convolutional Network Knowledge Graph Knowledge Graph Completion Representation Learning

来源：评论

学校读者我要写书评

暂无评论

Exact Algorithm for Batch Scheduling with Many-to-Many Job-Tool Matching and Job Release Time Constraints

引用

IEEE Transactions on automation science and Engineering 2025年 22卷 16499-16511页

作者： Li, Shengchao Liu, Shixin Zhao, Ziyan Zhou, Mengchu Northeastern University State Key Laboratory of Synthetical Automation for Process Industries College of Information Science and Engineering Shenyang 110819 China Northeastern University at Qinhuangdao Hebei Key Laboratory of Industrial Software for Advanced Planning and Scheduling of Complex Industrial Processes School of Control Engineering Qinhuangdao 066004 China New Jersey Institute of Technology Department of Electrical and Computer Engineering Newark 07102 NJ United States

Job-dependent tool switching is necessary in many batch processing systems (BPSs). Heterogeneous tool demand and extra time consumption for tool switch bring great challenge for high-performance production scheduling in BPSs. In this study, we present a novel batch scheduling problem derived from a satellite vibration test system. Different from basic scheduling problems in BPSs with tool switching, it has complications caused by many-to-many task-tool matching and job release time constraints. Specifically, each job has predetermined candidate tools. One of them should be selected and equipped to process a given job. Unlike sequence-dependent setup time that is only related to two adjacent jobs, tool switching time is additionally dependent on the tools selected by both jobs from their respective candidate tools. Both job sequence and tool selections need to be determined to minimize makespan. Mixed-integer linear programming (MILP) and constraint programming (CP) models are developed for formulating the problem. We prove that the problem is NP hard. To obtain exact solutions, we propose a novel branch-and-bound algorithm (B&B) based on the analysis and extraction of problem properties. It integrates a domain reduction mechanism, branching strategies, and dominance rules. Among them, the domain reduction mechanism reduces the number of jobs to be scheduled;the branching strategies accelerate solving speed;and the dominance rules save the memory consumption. Ablation studies and key influencing factor experiments are performed. The results show that the proposed B&B can optimally solve much larger instances than state-of-the-art methods (including some heuristics). It can optimally solve industrial-size problems in a short time, implying that it can well satisfy the performance demand of a satellite vibration test system and thus advancing the filed of optimal scheduling for BPSs. © 2004-2012 IEEE.

关键词： Batch scheduling branch-and-bound algorithm heterogenerous tool demand mixed-integer linear programming satellite vibration test system

来源：评论

学校读者我要写书评

暂无评论

Generalized Multi-kernel Maximum Correntropy Kalman Filter for Disturbance Estimation

arXiv

引用

arXiv 2023年

作者： Li, Shilei Shi, Dawei Lou, Yunjiang Zou, Wulin Shi, Ling The Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong The School of Automation Beijing Institute of Technology China The State Key Laboratory of Robotics and System School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Shenzhen518055 China Xeno Dynamics Control Department Xeno Dynamics Co. Ltd Shenzhen518055 China

Disturbance observers have been attracting continuing research efforts and are widely used in many applications. Among them, the Kalman filter-based disturbance observer is an attractive one since it estimates both the state and the disturbance simultaneously, and is optimal for a linear system with Gaussian noises. Unfortunately, The noise in the disturbance channel typically exhibits a heavy-tailed distribution because the nominal disturbance dynamics usually do not align with the practical ones. To handle this issue, we propose a generalized multi-kernel maximum correntropy Kalman filter for disturbance estimation, which is less conservative by adopting different kernel bandwidths for different channels and exhibits excellent performance both with and without external disturbance. The convergence of the fixed point iteration and the complexity of the proposed algorithm are given. Simulations on a robotic manipulator reveal that the proposed algorithm is very efficient in disturbance estimation with moderate algorithm complexity. Copyright © 2023, The Authors. All rights reserved.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Research Progress of Parallel control and Management

引用

IEEE/CAA Journal of Automatica Sinica 2020年第2期7卷 355-367页

作者： Gang Xiong Xisong Dong Hao Lu Dayong Shen State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China College of Systems Engineering National University of Defense TechnologyChangsha 410073China

Based on ACP(artificial systems,computational experiments,and parallel execution)methodology,parallel control and management has become a popularly systematic and complete solution for the control and management of complex *** paper focuses on summarizing comprehensive review of the research literature of parallel control and management achieved in the recent years including the theoretical framework,core technologies,and the application *** future research,application directions,and suggestions are also discussed.

关键词： ACP methodology artificial systems computational experiments parallel control parallel management parallel systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：