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

Single-Loop Deadbeat Predictive control Framework for Uncertain SPMSM Drives With Disturbance Observation

IEEE Transactions on Transportation Electrification 2025年

作者： Jiang, Fuxi Wang, Siqi Guo, Yuhao Cheng, Zhe Ye, Jie Cheng, Shanmei Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Wuhan430074 China Huazhong University of Science and Technology School of Optical and Electronic Information Wuhan430074 China

To mitigate the detrimental effects of parameter perturbations and external load torque on the accuracy of speed and current tracking control in surface-mounted permanent magnet synchronous motor (SPMSM) drive systems, while avoiding the complexities inherent in traditional speed-current series control architectures, this paper presents a single-loop deadbeat predictive control (SDPC) framework that incorporates online disturbance observation. The control input voltage vector is directly computed using an SDPC controller in conjunction with a set of discrete-time disturbance observers (DDOBs). This proposed methodology offers two notable advantages over existing research: (i) it substantially reduces the number of adjustable controller parameters, requiring only the tuning of the observer bandwidth and the speed scaling gain, which enhances its practicality for engineering applications;and (ii) the disturbance estimation and compensation mechanism utilizing DDOBs significantly improves the robustness of the SPMSM system. Furthermore, the SDPC framework ensures that the system maintains satisfactory transient and steady-state tracking performance in response to reference signals. Experimental comparisons validate both the effectiveness and superiority of the proposed method. © 2015 IEEE.

关键词： Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

Optimization algorithm for global k-means algorithm

Optimization algorithm for global k-means algorithm

引用

International Conference on intelligent control and Information processing (ICICIP)

作者： Sen Li Fang Li Xiaonan Luo School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Center for Applied Mathematics of Guangxi (GUET) Guilin China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin China

ISBN: (数字)9798331516147

ISBN: (纸本)9798331516154

The k-means method is widely utilized for clustering. Its simplicity, efficacy, and swiftness make it a favored choice among clustering algorithms. It faces the challenge of sensitivity to the initial class center. The enhancement strategy for the k-means algorithm focuses on refining the initial selection of cluster centroids, no longer using its random selection of initial class center points, but starting from the entire dataset, choosing the most distant point to serve as the starting cluster centroid. This can also prevent the local optimization problem of the k-means algorithm. The improved algorithm proposed in this article is an effective method that can select the initial class center point from a global perspective and reduce computation time. The suggested approach has undergone rigorous testing and comparative analysis across multiple datasets, yielding commendable outcomes.

关键词： Sensitivity Stability criteria Refining Neural networks key performance indicator Clustering algorithms Classification algorithms Optimization Testing intelligent control

来源：评论

学校读者我要写书评

暂无评论

Tomato Leaf Disease Identification and Growth Dataset Augmentation Based on UAE-GAN

Tomato Leaf Disease Identification and Growth Dataset Augmen...

引用

International Conference on intelligent control and Information processing (ICICIP)

作者： Xin Li Fang Li Xiaonan Luo School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Center for Applied Mathematics of Guangxi (GUET) Guilin China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin China

ISBN: (数字)9798331516147

ISBN: (纸本)9798331516154

To delve into the characterization of growth disorders in different crops, it is important to support the model with a large amount of image data that includes a variety of disease types and disease levels to capture the typical and subtle differences of various diseases on plant leaves. However, the actual process of gathering data is challenging, sample coverage is challenging to accomplish, data capture is impeded, and the quality of the data is subpar. This work aims to address the issue of data shortages by employing technical methods. In particular, we creatively investigated the UAE-GAN approach, which naturally combines CycleGAN, U-Net, Variational Autoencoder VAE, and Autoencoder to increase the data. Among these, U-Net can precisely extract the small details of disease locations in crop photos and provide a strong basis for further processing thanks to its special codec architectural benefits. The Variational Autoencoder (VAE) significantly enhances the diversity of data by mapping the image to the latent space and sampling based on a certain probability distribution, so producing new image samples that are distinct from the original image yet inherently connected. Learning the coding and decoding of the original image is the foundation of autoencoders. If a mild disruption is introduced into the coding process, it can achieve data augmentation in another dimension and create a sequence of new images with just little modifications to the original image. The aforementioned models are closely linked with CycleGAN to efficiently map and convert in a variety of picture domains and to fully leverage CycleGAN's remarkable unsupervised image conversion capabilities. The perception ability, feature capture ability, and information conversion ability of the fusion model for crop image data are significantly improved, and the key elements of each link in the data enhancement process are comprehensively considered to ensure that the generated new image data can not o

关键词： Training image coding Autoencoders Data enhancement Crops Generators Data models Stability analysis Probability distribution Diseases

来源：评论

学校读者我要写书评

暂无评论

Mixture-of-Experts for Open Set Domain Adaptation: A Dual-Space Detection Approach

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Du, Zhenbang An, Jiayu Tu, Yunlu Hong, Jiahao Wu, Dongrui Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

Open Set Domain Adaptation (OSDA) copes with the distribution and label shifts between the source and target domains simultaneously, performing accurate classification for known classes while identifying unknown class samples in the target domain. Most existing OSDA approaches, depending on the final image feature space of deep models, require manually-tuned thresholds, and may easily misclassify unknown samples as known classes. Mixture-of-Experts (MoE) could be a remedy. Within an MoE, different experts handle distinct input features, producing unique expert routing patterns for various classes in a routing feature space. As a result, unknown class samples may display different expert routing patterns to known classes. This paper proposes Dual-Space Detection, which exploits the inconsistencies between the image feature space and the routing feature space to detect unknown class samples without any threshold. A Graph Router is further introduced to better make use of the spatial information among the image patches. Experiments on three datasets validated the effectiveness and superiority of our approach. © 2020 IEEE.

关键词： Mixture-of-Experts Open Set Domain Adaptation Routing Feature

来源：评论

学校读者我要写书评

暂无评论

Ocean archaea PPI prediction with pretraining models 25

Ocean archaea PPI prediction with pretraining models

引用

Proceedings of the 2025 5th International Conference on Bioinformatics and intelligent Computing

作者： Ying Zhang Yuan Liu Xiaoyong Pan Hongbin Shen 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

ISBN: (纸本)9798400712203

Protein-Protein Interaction (PPI) provides important insights into the metabolic mechanisms of different biological processes. Although PPIs in some organisms have been investigated systematically, PPIs in the ocean archaea remain largely unexplored. But such species have special investigation value since their adaptation to extreme living conditions may generate unique PPIs. In this paper, we aim to characterize and predict PPIs in ocean archaea to advance understanding of their metabolic networks. First, we collect all ocean archaea PPIs with high confidence from STRING database and analyze the PPI network features, including centrality and enrichment analysis. The functional enrichment results of the largest connecting subgraph in the PPI network show most PPIs in our constructed dataset is related to the translation and transcription processes. Then, we generate an equal number of negative PPI pairs, whose members have either different subcellular locations or GO terms. We also use the generated dataset to test the performance of three pretraining methods and their ensemble methods in the binary PPI prediction task. Our results suggest the ensemble methods could be applied to further improve models’ performance. Fine-tuned models trained on the ocean archaea dataset are expected to predict the other ocean archaea PPIs that are not included in the STRING database and get more understanding about the ocean archaea PPI universe.

关键词： Binary PPI prediction

来源：评论

学校读者我要写书评

暂无评论

Memristor-Based Circuit of Sequential Associative Memory with Memory Interactions and Stimulus Similarity Effect

引用

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Xiong, Dongdong Wang, Xiaoping Jiang, Yiming Yang, Chao Jiang, Man Lai, Jingang Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China Hubei Key Laboratory of Braininspired Intelligent Systems Wuhan430074 China Huazhong University of Science and Technology Institute of Artificial Intelligence School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China Guangxi University of Science and Technology School of Computer Science and Technology Liuzhou545006 China Huazhong University of Science and Technology Department of Physiology School of Basic Medicine and Tongji Medical College Wuhan430030 China

Most proposed memristor-based circuits of associative memory consider various mechanisms in only one associative memory. Few works on circuit design of sequential associative memory have been reported. In this paper, a memristor-based circuit of sequential associative memory with memory interactions and stimulus similarity effect is designed. Two associative memories, the prior associative memory (PAM) and the later associative memory (LAM), are formed successively. The PAM modifies the rate of the formation of the LAM, and the LAM, in turn, affects the strength of the PAM, which are two interactions in sequential associative memory, called transfer and retroaction. In addition, the magnitudes of transfer and retroaction are determined by the similarity of the conditioned stimuli. The above functions are realized by the ring input processing module, memory module, transfer module and retroaction module. It has been identified in circuit analysis that the proposed circuit is power efficient and has good robustness. Furthermore, the proposed circuit has promising applications for fire rescue robots. © 2016 IEEE.

关键词： Associative storage

来源：评论

学校读者我要写书评

暂无评论

A text dependent copy-paste plagiarism and text-rewriting plagiarism model

引用

Journal of intelligent and Fuzzy Systems 2025年第6期48卷 849-858页

作者： Guo, Qingkai Huang, Guimin Wang, Yabing Zhou, Ya School of Computer Science and Information Security Guilin University of Electronic Technology Guangxi Guilin China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guangxi Guilin China

Plagiarism is common in English writing exams. Researchers classify plagiarism into copy-paste and text-rewriting plagiarism, but existing models need help with problems such as the single way of checking and unsatisfactory results. Aiming at the copy-paste problem in English writing plagiarism, this paper proposes a digital fingerprint model based on the N-Gram window jumping mechanism. The model incorporates a sliding window and an improved matching tool to solve the problems of excessive fingerprint density and low checking efficiency in text extraction. Meanwhile, the model adds a Fisher-Yates shuffle algorithm with a salt parameter to crack the hash collision in text matching. The experiments show that the model can detect copy-paste plagiarism in English composition. For text rewriting plagiarism, this paper designs a TextCNN-BiGRU-based model, which combines TextCNN and BiGRU so that the extracted text semantic information considers the text’s local and contextual features. The experiments show that the model improves the accuracy by 1.9 percentage points and the F1 value by 1.2 percentage points on the MRPC dataset compared with other models. © 2025 – IOS Press. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Finite-time sliding-mode control for semi-Markov systems with delayed impulses

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Ren, Fangmin Wang, Xiaoping Li, Yangmin Zeng, Zhigang The School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Hubei Key Laboratory of Braininspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China The Department of Industrial and Systems Engineering The Hong Kong Polytechnic University Hong Kong999077 Hong Kong

来源：评论

学校读者我要写书评

暂无评论

Evolutionary attraction–repulsion algorithm embedded with LLM for UAV task allocation

引用

Advanced Engineering Informatics 2025年 66卷

作者： Wu, Bowen Xiao, Renbin School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Institute of Artificial Intelligence Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan430074 China

Labor division provides an adaptive and scalable technique for unmanned systems. However, its designing process usually relies heavily on the manually crafted paradigms, leading to inefficiencies and insufficient performance. To overcome these challenges, this paper introduce an evolutionary approach to labor division algorithm design. Drawing inspiration from the regulatory behaviors observed in natural lion populations, we propose a bipolar feedback-guided attraction–repulsion mechanism. A formal model is developed to encapsulate this mechanism, and we provide an in-depth analysis of the algorithm's evolution through the framework of systems science. In addition, we leverage prompt engineering techniques to integrate a large language model (LLM) with our proposed mechanism, facilitating a bidirectional enhancement between the two. This integration culminates in the development of the ARE-LLM framework, a robust and adaptive solution for designing labor division algorithms. To demonstrate the practical applicability of our approach, we apply the ARE-LLM framework to the UAV-based task allocation problem for enemy air defense suppression. The experimental results indicate that our method outperforms several advanced approaches. In a scenario involving 50 UAVs tasked with completing 300 assignments, the total distance traveled is only 9 % of that required by the ALPDA algorithm, while the processing time is reduced to 8 % of that used by ALPDA. © 2025 Elsevier Ltd

关键词： Target drones

来源：评论

学校读者我要写书评

暂无评论

C2P-Net: Comprehensive Depth Map to Planar Depth Conversion for Room Layout Estimation

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Zhang, Weidong Zhou, Mengjie Cheng, Jiyu Liu, Ying Zhang, Wei Xi'an University of Posts & Telecommunications School of Communications and Information Engineering China Xi'an Key Laboratory of Image Processing Technology and Applications for Public Security China Shandong University School of Control Science and Engineering China Ministry of Education Key Laboratory of Machine Intelligence and System Control China

Room layout estimation seeks to infer the overall spatial configuration of indoor scenes using perspective or panoramic images. As the layout is determined by the dominant indoor planes, this problem inherently requires the reconstruction of these planes. Some studies reconstruct indoor planes from perspective images by learning pixel-level or instance-level plane parameters. However, directly learning these parameters has the problems of susceptibility to occlusions and position dependency. In this paper, we introduce the Comprehensive depth map to Planar depth (C2P) conversion, which reformulates planar depth reconstruction into the prediction of a comprehensive depth map and planar visibility confidence. Based on the parametric representation of planar depth we propose, the C2P conversion is applicable to both panoramic and perspective images. Accordingly, we present an effective framework for room layout estimation that jointly learns the comprehensive depth map and planar visibility confidence. Due to the differentiability of the C2P conversion, our network autonomously learns planar visibility confidence by constraining the estimated plane parameters and reconstructed planar depth map. We further propose a novel approach for 3D layout generation through sequential planar depth map integration. Experimental results demonstrate the superiority of our method across all evaluated panoramic and perspective datasets. © 1979-2012 IEEE.

关键词： image-Text Matching Medical Report Generation Sample-graph Consistency Self-boosting framework

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：