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

第42届中国控制会议

作者： Wei Zhao Guoqiang Liu Zexin Li Xi Li School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education MinistryHuazhong University of Science and Technology

Reversible solid oxide cells(rSOC) can operate in both electrolysis mode and in fuel cell mode with high efficiency and reduced cost using the same device for both *** used in dynamic operation with intermittent electrical power sources,rSOC system switches from the fuel cell(SOFC) to electrolyzer(SOEC) and vice versa depending on load and grid *** can lead to temperature profiles within the stack that can potentially lead to the failure of the stack and eventually the *** the present work,a system-level dynamic model of r SOC is established and validated against experimental ***,detailed dynamic thermal behavior of stack during the switching between the two modes is analyzed,and a temperature management controller based on Model Predict control method(MPC) is *** flow and temperature at the stack inlet are controlled by air flow and bypass valves,avoiding problems associated with temperature overshoot during transient *** simulation results show that the temperature controller has the ability to follow fast thermal changes while maintaining thermal safety,which indicates the competitiveness of the controller.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HyRSM++: Hybrid relation guided temporal set matching for few-shot action recognition

引用

Pattern Recognition 2024年 147卷

作者： Wang, Xiang Zhang, Shiwei Qing, Zhiwu Zuo, Zhengrong Gao, Changxin Jin, Rong Sang, Nong Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Alibaba Group China Meta AI United States

Few-shot action recognition is a challenging but practical problem aiming to learn a model that can be easily adapted to identify new action categories with only a few labeled samples. However, existing attempts still suffer from two drawbacks: (i) learning individual features without considering the entire task may result in limited representation capability, and (ii) existing alignment strategies are sensitive to noises and misaligned instances. To handle the two limitations, we propose a novel Hybrid Relation guided temporal Set Matching (HyRSM++) approach for few-shot action recognition. The core idea of HyRSM++ is to integrate all videos within the task to learn discriminative representations and involve a robust matching technique. To be specific, HyRSM++ consists of two key components, a hybrid relation module and a temporal set matching metric. Given the basic representations from the feature extractor, the hybrid relation module is introduced to fully exploit associated relations within and cross videos in an episodic task and thus can learn task-specific embeddings. Subsequently, in the temporal set matching metric, we carry out the distance measure between query and support videos from a set matching perspective and design a bidirectional Mean Hausdorff Metric to improve the resilience to misaligned instances. Furthermore, we extend the proposed HyRSM++ to deal with the more challenging semi-supervised few-shot action recognition and unsupervised few-shot action recognition tasks. Experimental results on multiple benchmarks demonstrate that our method consistently outperforms existing methods and achieves state-of-the-art performance under various few-shot settings. The source code is available at https://***/alibaba-mmai-research/HyRSMPlusPlus. © 2023 Elsevier Ltd

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Fusion-CAM: Fine-Grained and High-Faithfulness Explanations for Deep Convolutional Network via Hierarchical Fusion

Fusion-CAM: Fine-Grained and High-Faithfulness Explanations ...

引用

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

作者： Chen Zheng 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

The interpretability of the convolutional neural networks(CNNs) has become a research hotspot. A popular explanation method is based on Class Activation Mapping (CAM), which visualizes the salient regions most relevant to neural network decisions. However, many CAM methods use the feature maps produced by the final convolution layer to generate the class activation maps, which usually have a low spatial resolution and can only generate coarse-grained visual explanations that provide a rough spatial location of the target object. In this paper, we propose a novel CAM method named Fusion-CAM. It improves traditional CAM methods by combining final class activation map containing semantic information with intermediate layer class activation maps containing fine-grained details, to generate fine-grained visual explanations with high faithfulness. In order to obtain high-quality intermediate layer class activation maps, we utilize Layer-wise Relevance Propagation (LRP) to obtain the weighting components of each channel of the intermediate layer feature maps, and the intermediate layer class activation maps generated by weighted summation are less noisy and have clear fine-grained details, which help to improve the quality of the final class activation map. Qualitative and quantitative experiments show that Fusion-CAM can be easily attached to different CAM methods to improve their performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HTRNN: A New Protein Nuclear Localization Prediction Tool

HTRNN: A New Protein Nuclear Localization Prediction Tool

引用

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

RBP-Former: Joint Prediction of RNA-protein Binding Sites on Full-length RNA Transcripts for Multiple RBPs

RBP-Former: Joint Prediction of RNA-protein Binding Sites on...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yichong Li Xiaojian Liu Fan Cheng Xiaoyong Pan Yang Yang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full-length RNA transcripts is crucial for understanding these mechanisms and their roles in diseases. While machine learning methods can predict RBP binding to RNA fragments, extending this to full-length transcripts presents challenges due to sequence length and data imbalance. In this paper, we introduce RBP-Former, a binding site joint prediction model designed specifically for full-length RNA transcripts that can be used for multiple RBPs. This model processes information at both coarse and fine-grained levels to fully exploit sequence data and its interactions with multiple RBPs. We develop multi-level imbalance learning strategies, achieving favorable results on imbalanced data. Our method outperforms existing methods in predicting binding sites on full-length RNA transcripts for multiple RBPs, demonstrating its effectiveness in handling imbalanced label and sample distributions.

关键词： Proteins Protein engineering Accuracy RNA Machine learning Predictive models Data models Gene expression Bioinformatics Diseases

来源：评论

学校读者我要写书评

暂无评论

Safety Protection Analysis with Formal Verification for Process control System Under Cyberattacks

Safety Protection Analysis with Formal Verification for Proc...

引用

第35届中国过程控制会议

作者： Xuqing Liang Chunjie Zhou Yu-Chu Tian Xin Du Peihang Xu School of Artificial Intelligence and Automation Huazhong University of Science and Technology The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Computer Science Queensland University of Technology

The safety protection of process control systems plays a crucial role in the overall safety of critical *** have increased the complexity of existing safety protection analysis. Traditional safety analysis methods fall short in accounting for cyberattack factors, making it challenging to conduct safety protection analysis under cyberattacks. To address this issue, this paper presents a new safety protection analysis method that considers multiple safety factors explicitly including cyberattacks using formal verification. The method consists of three main components: exhaustive system safety specifications,formal models, and system safety validation. The system safety specification component adds a cyberattack factor to system safety requirements based on the system theory process analysis(STPA) method. The formal model component considers the system's dynamic operation process, and safety protection behaviors under typical attack behaviors. The system safety validation component validates the effectiveness of system safety protection under cyberattacks by the UPPAAL tool, from the perspective of whether system safety constraints are triggered and whether the change curve of process variables is compliant. Finally, the effectiveness of the presented approach is carried out for a simplified fluid catalytic cracking(FCC) fractionating system.

关键词： Safety protection analysis Formal verification Cyberattacks System theory process analysis(STPA)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：