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

IEEE Advanced Information Technology, Electronic and Automation control Conference (IAEAC)

作者： Xinyu Miao Wei Li School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Image Processing and Intelligent Control Key Laboratory of the Education Ministry of China Wuhan China

Current protein nuclear localization assays encounter multiple challenges that underscore the constraints of conventional biochemical assays and sequence-based procedures. This paper highlights the emerging interest in utilizing artificial intelligence to surmount these limitations. Specifically, a supervised deep learning algorithm, employing the HTRNN model, is presented to identify mechanisms responsible for the nuclear location of proteins. This methodology embraces an entire data-driven end-to-end structure, making expert experience or previous biological knowledge unnecessary. By utilizing amino acid sequence features from both the head and tail regions, the algorithm displays remarkable detection and generalization capabilities, which have been validated by experimental results on present tagged nuclear location protein datasets. Overall, the data-driven algorithm plays a crucial role in enhancing the identification of protein nuclear localization properties.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Nested Saturated control of Uncertain Complex Cascade Systems Using Mixed Saturation Levels

引用

IEEE/CAA Journal of Automatica Sinica 2024年第5期11卷 1163-1174页

作者： Meng Li Zhigang Zeng Wuhan National Laboratory for Optoelectronics Wuhan 430074 School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074China School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074 Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan 430074China

This study addresses the problem of global asymptotic stability for uncertain complex cascade systems composed of multiple integrator systems and non-strict feedforward nonlinear systems. To tackle the complexity inherent in such structures, a novel nested saturated control design is proposed that incorporates both constant saturation levels and state-dependent saturation levels. Specifically, a modified differentiable saturation function is proposed to facilitate the saturation reduction analysis of the uncertain complex cascade systems under the presence of mixed saturation levels. In addition, the design of modified differentiable saturation function will help to construct a hierarchical global convergence strategy to improve the robustness of control design scheme. Through calculation of relevant inequalities, time derivative of boundary surface and simple Lyapunov function,saturation reduction analysis and convergence analysis are carried out, and then a set of explicit parameter conditions are provided to ensure global asymptotic stability in the closed-loop systems. Finally, a simplified system of the mechanical model is presented to validate the effectiveness of the proposed method.

关键词： method saturation differentiable

来源：评论

学校读者我要写书评

暂无评论

Low-Rank Optimal Transport for Robust Domain Adaptation

引用

IEEE/CAA Journal of Automatica Sinica 2024年第7期11卷 1667-1680页

作者： Bingrong Xu Jianhua Yin Cheng Lian Yixin Su Zhigang Zeng IEEE the School of Automation Wuhan University of TechnologyWuhan 430070China Intelligent Transportation Systems Research Center Wuhan University of TechnologyWuhan 430063 Chongqing Research Institute Wuhan University of TechnologyChongqingChina the School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074 the Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan 430074China

When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.

关键词： Domain adaptation low-rank constraint noise corruption optimal transport

来源：评论

学校读者我要写书评

暂无评论

Learning Second-Order Attentive Context for Efficient Correspondence Pruning

arXiv

引用

arXiv 2023年

作者： Ye, Xinyi Zhao, Weiyue Lu, Hao Cao, Zhiguo Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology China

Correspondence pruning aims to search consistent correspondences (inliers) from a set of putative correspondences. It is challenging because of the disorganized spatial distribution of numerous outliers, especially when putative correspondences are largely dominated by outliers. It is more challenging to ensure effectiveness while maintaining efficiency. In this paper, we propose an effective and efficient method for correspondence pruning. Inspired by the success of attentive context in correspondence problems, we first extend the attentive context to the first-order attentive context and then introduce the idea of attention in attention (ANA) to model second-order attentive context for correspondence pruning. Compared with first-order attention that focuses on feature-consistent context, second-order attention dedicates to attention weights itself and provides an additional source to encode consistent context from the attention map. For efficiency, we derive two approximate formulations for the naive implementation of second-order attention to optimize the cubic complexity to linear complexity, such that second-order attention can be used with negligible computational overheads. We further implement our formulations in a second-order context layer and then incorporate the layer in an ANA block. Extensive experiments demonstrate that our method is effective and efficient in pruning outliers, especially in high-outlier-ratio cases. Compared with the state-of-the-art correspondence pruning approach LMCNet, our method runs 14 times faster while maintaining a competitive accuracy. Copyright © 2023, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A Dual-branch Model for Early Detection of Alzheimer’s Disease Using Resting-State fMRI

A Dual-branch Model for Early Detection of Alzheimer’s Dise...

引用

IEEE Advanced Information Technology, Electronic and Automation control Conference (IAEAC)

作者： Yixuan Wang Wei Li School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Image Processing and Intelligent Control Key Laboratory of the Education Ministry of China Wuhan China

Alzheimer’s disease (AD) is the most prevalent form of dementia, and early diagnosis is crucial for delaying and treating AD. Resting-state functional magnetic resonance imaging (rs-fMRI), a widely used medical imaging technique, offers rich temporal and spatial data, which has led researchers to explore various feature extraction methods based on rs-fMRI images for AD identification. However, the related work still suffers from insufficient utilization of temporal and spatial information which leads to unsatisfactory early diagnosis. In this study, we propose a dual-branch fusion model to extract spatial-temporal features from rs-fMRI images. Our proposed model can extract temporal features at different levels. We developed a Class Activation Sequence (CAS) branch, which is a structure that emphasizes the function of each temporal node throughout the whole time series. Additionally, we created a time-domain local branch for local feature extraction. Further, we designed a fusion module for the model to describe temporal contextual relationships and fuse features at various levels. We tested the performance of the model on the ADNI dataset, and the experimental results show that compared with other algorithms, the dual-branch fusion model achieves higher classification accuracy on several classification tasks including early diagnosis, which proves the advantage of the dual-branch fusion model in temporal and spatial feature extraction for rs-fMRI images, and our work also provides a foundation for the temporal domain characterization of rs-fMRI images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal distance embedded hybrid ant colony algorithm for a kind of vehicle routing problem with constraints

引用

Frontiers of Information Technology & Electronic Engineering 2023年第7期24卷 1062-1079页

作者： Zhenhui FENG Renbin XIAO School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074China Institute of Artificial Intelligence Huazhong University of Science and TechnologyWuhan 430074China Key Laboratory of Image Information Processing and Intelligent Control Ministry of EducationWuhan 430074China

We investigate a kind of vehicle routing problem with constraints(VRPC)in the car-sharing mobility environment,where the problem is based on user orders,and each order has a reservation time limit and two location point transitions,origin and *** is a typical extended vehicle routing problem(VRP)with both time and space *** consider the VRPC problem characteristics and establish a vehicle scheduling model to minimize operating costs and maximize user(or passenger)*** solve the scheduling model more accurately,a spatiotemporal distance representation function is defined based on the temporal and spatial properties of the customer,and a spatiotemporal distance embedded hybrid ant colony algorithm(HACA-ST)is *** algorithm can be divided into two ***,through spatiotemporal clustering,the spatiotemporal distance between users is the main measure used to classify customers in categories,which helps provide heuristic information for problem ***,an improved ant colony algorithm(ACO)is proposed to optimize the solution by combining a labor division strategy and the spatiotemporal distance function to obtain the final scheduling *** analysis is carried out based on existing data sets and simulated urban *** with other heuristic algorithms,HACA-ST reduces the length of the shortest route by 2%–14%in benchmark *** VRPC testing instances,concerning the combined cost,HACA-ST has competitive cost compared to existing VRP-related ***,we provide two actual urban scenarios to further verify the effectiveness of the proposed algorithm.

关键词： Vehicle routing problem with constraints(VRPC) Spatiotemporal distance function Labor division strategy Ant colony algorithm(ACO)

来源：评论

学校读者我要写书评

暂无评论

Source-free Unsupervised Domain Adaptation for Privacy-Preserving intelligent Fault Diagnosis 3

Source-free Unsupervised Domain Adaptation for Privacy-Prese...

引用

3rd International Conference on Sensing, Measurement and Data Analytics in the Era of Artificial Intelligence, ICSMD 2022

作者： Zhu, Mengliang Zeng, Xiangyu Liu, Jie Zhou, Kaibo MOE Key Laboratory of Image Information Processing and Intelligent Control School of Artificial Huazhong University of Science and Technology Wuhan China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665492812

Rolling bearing is of vital significance in industrial applications and intelligent fault diagnosis (IFD) have been widely exploited in this field. However, cross-machine variations hinder the model performance across different machines in varying working conditions. To solve this issue, many unsupervised domain adaptation (UDA) approaches have been proposed recently, requiring direct access to the fully labeled source domain. However, privacy concerns are raised in traditional UDA scenario, since raw signals contain various private information. To address this issue, the source-free unsupervised domain adaptation (SFUDA) scenario is considered, where only the pre-trained source model is required, instead of the fully labeled source domain. In this paper, a SFUDA approach for intelligent fault diagnosis (IFD) is proposed. It consists of two steps: 1) source model generalization, where virtual adversarial training, R-Drop and label smoothing techniques are adopted to improve the generalization ability of the source model;and 2) target model adaptation, where information maximization is used for cluster assumption and mean teacher training paradigm is utilized to alleviate the catastrophic forgetting phenomenon. The proposed approach is verified on the Case Western Reserve University (CWRU) dataset. Experimental results on the show that the proposed SFUDA approach outperforms several typical UDA approaches, and its effectiveness is verified. © 2022 IEEE.

关键词： intelligent fault diagnosis privacy concerns Rolling bearing source-free unsupervised domain adaptation

来源：评论

学校读者我要写书评

暂无评论

Accessibility and Vulnerability Analysis of the Integrated Road, High-speed Rail and Airline System in China 13

Accessibility and Vulnerability Analysis of the Integrated R...

引用

13th International Conference on Reliability, Maintainability, and Safety, ICRMS 2022

作者： Sun, Wenjing Zhang, Hui Ouyang, Min School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Lab. for Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China

ISBN: (数字)9781665486903

ISBN: (纸本)9781665486903

National-scale transportation systems are critical infrastructures to ensure the normal operation of the nation and offer essential services to modern societies. And they face a constant barrage of external stresses or threats that challenge their operation. This article analyzes the accessibility and vulnerability of the Chinese road, high-speed rail and airline systems. Firstly, it models the complementary relationship among road, high-speed rail and airline systems and takes them as an integrated transportation system (IRHAS). Then, the accessibility map from (to) the center of Beijing via IRHAS is displayed. Finally, modeling the extreme storm recently occurred in Zhengzhou as a reginal disruption, the vulnerability of the IRHAS is calculated. The findings in this paper provide guidance for city administrators to plan the road, high-speed rail, and airline systems as a whole. © 2022 IEEE.

关键词： Storms

来源：评论

学校读者我要写书评

暂无评论

Model-Based and Data-Driven Contingency Filtering for Real-Time Corrective Security-Constrained Economic Dispatch 5

Model-Based and Data-Driven Contingency Filtering for Real-T...

引用

5th IEEE Conference on Energy Internet and Energy System Integration, EI2 2021

作者： Han, Donghai Yu, Yaowen He, Dingxin Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665434256

Security-constrained economic dispatch (SCED) is one of the most important problems in power system operations. Corrective SCED (CSCED) is a type of SCED that considers corrective capabilities of the power system and adjusts base case decisions according to post-contingency states. Because of the large scale of the CSCED problem, it is difficult for purely model-based approaches to meet the time limits in real-time practical operations. To leverage historical operation data, this paper develops a novel hybrid model-based and data-driven framework to accelerate the solution process of CSCED. In the offline stage, our previous model-based contingency filtering approach is utilized to label active statuses of contingencies against historical net load samples. In the online stage, a multi-label classifier based on the K-Nearest Neighbor (KNN) algorithm quickly generates an active contingency set corresponding to the real-time net load. This active contingency set can be used to calculate the economic dispatch decisions in one shot. In addition, the accuracy of our framework can be further improved by adding an optional contingency filtering procedure at the end. Numerical testing results on the IEEE RTS-96 system demonstrate the accuracy and computational efficiency of the hybrid framework as compared to a purely model-based approach. © 2021 IEEE

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Task Allocation and Path Planning for Multiple Destinations Oriented Towards Task Updates

Task Allocation and Path Planning for Multiple Destinations ...

引用

International Conference on Industrial Artificial Intelligence (IAI)

作者： Yong Yang Dingxin He Huantao Mao Hong Chen Hongtao Wu Zhi-Wei Liu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350356618

ISBN: (纸本)9798350356625

This study addresses the complexities of orchestrating multi-target transportation tasks within multi-agent systems, constrained by load capacity. The primary objective is to engineer an advanced path planning framework that assures collision avoidance and optimal load distribution. Diverging from conventional single-path strategies, this research incorporates load factors and requires continuous dynamic multi-target point and path planning to ensure agents can efficiently navigate through a series of predetermined key points. To address this complex requirement, a two-stage multi-agent task allocation and path planning method is proposed. First, an initial solution is obtained using a suboptimal algorithm, followed by optimization iterations using the large neighborhood search algorithm to improve task allocation. In the second stage, an accelerated algorithm based on priority search is used to plan optimal paths for each agent in a predetermined order. The proposed algorithm's effectiveness is comprehensively evaluated through a series of experimental evaluations and comparisons with the commercial solver Gurobi within a limited time. The results show that the proposed method achieves optimality in both running time and minimum path cost while ensuring the load balance of agents.

关键词： Costs Navigation Heuristic algorithms Transportation Path planning Robustness Planning Resource management Optimization Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：