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

Memory Analysis for Memristors and Memristive Recurrent Neural Networks

IEEE/CAA Journal of Automatica Sinica 2020年第1期7卷 96-105页

作者： Gang Bao Yide Zhang Zhigang Zeng Key Laboratory of Cascaded Hydropower Stations Operation and Control Electrical Engineering and New EnergyChina Three Gorges UniversityYichang 443002and Hubei Key Laboratory of Applied Mathematics(Hubei University)Wuhan 430074China Department of Medical Engineering California Institute of TechnologyPasadenaCalifornia 91125 USA School of Artificial Intelligence and Automation Huazhong University of Science and Technologyand also with the Key Laboratory of Image Processing and Intelligent Control of Education Ministry of ChinaWuhan 430074China

Traditional recurrent neural networks are composed of capacitors, inductors, resistors, and operational *** neural networks are constructed by replacing resistors with memristors. This paper focuses on the memory analysis,i.e. the initial value computation, of memristors. Firstly, we present the memory analysis for a single memristor based on memristors’ mathematical models with linear and nonlinear ***, we present the memory analysis for two memristors in series and parallel. Thirdly, we point out the difference between traditional neural networks and those that are memristive. Based on the current and voltage relationship of memristors, we use mathematical analysis and SPICE simulations to demonstrate the validity of our methods.

关键词： Dopant drift memory memristive neural networks memristor

来源：评论

学校读者我要写书评

暂无评论

An intelligent Evaluation Method of Root Canal Therapy Quality Based on Deep Learning

An Intelligent Evaluation Method of Root Canal Therapy Quali...

引用

Chinese Automation Congress (CAC)

作者： Jie Liu Gang Peng Shiqian Yan School of Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan China Hubei Eya Medical Investment Management Co. Ltd Wuhan China

Dentists judge the quality of root canal therapy for each patient very time-consuming, and inefficient, lack of quantitative evaluation criteria, easy to cause judgment errors. At the same time, the traditional method of extracting the root canal image features based on experience is difficult to accurately extract the filling area of the root canal and the tooth area where it is located, resulting in low accuracy of root canal target segmentation, and thus affecting the accuracy of root canal treatment quality evaluation. In this paper, for the real root canal treatment images of patients, the CenterNet network was used to detect the root canal target of root canal images. Then, according to the test results, the U-Net full convolution neural network was used to segment the root canal filling region and its tooth region. Finally, the segmented images were quantitatively evaluated according to the professional evaluation index of doctors. The experimental results show that the coincidence rate between the evaluation results of this method and the evaluation results of professional doctors is 83.3 %, which can better complete the quality evaluation of root canal therapy for patients, effectively improve the work efficiency of doctors, and has reference significance for the application of artificial intelligence in medical field.

关键词： Irrigation image segmentation Convolution Neural networks Teeth Feature extraction Filling

来源：评论

学校读者我要写书评

暂无评论

Computationally Expensive High-Dimensional Multiobjective Optimization via Surrogate-Assisted Reformulation and Decomposition

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Pan, Linqiang Lin, Jianqing Wang, Handing He, Cheng Tan, Kay Chen Jin, Yaochu School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Artificial Intelligence Xidian University Xi’an China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hong Kong School of Engineering Trustworth and General Artificial Intelligence Laboratory Westlake University Hangzhou China

In recent decades, various surrogate-assisted evolutionary algorithms (SAEAs) have been proposed to solve computationally expensive multiobjective optimization problems (EMOPs). Nevertheless, designing an SAEA to handle high-dimensional EMOPs and balance convergence, diversity, and computational complexity remains challenging. Here, we propose a two-phase SAEA (TP-SAEA), which follows the idea of convergence first and diversity second, for solving high-dimensional EMOPs. In Phase I, a surrogate-assisted problem reformulation method is proposed to fast-track the Pareto optimal set in association with some reference solutions. Specifically, the high-dimensional EMOP is reformulated into an expensive single-objective one with low-dimensional decision space. Then, the surrogate-assisted optimization is utilized to obtain well-converged solutions. In Phase II, the high-dimensional EMOP is decomposed into two subproblems to explore subregions of the decision space that can effectively promote the diversity of the solutions. The two subproblems are optimized independently via surrogate-assisted optimization, aiming to push the population towards different regions of the Pareto optimal front. Experiments are conducted on EMOPs with 100 to 500 decision variables compared with four state-of-the-art SAEAs. The proposed TP-SAEA obtains well-converged and diverse solutions with only 509 real function evaluations. Moreover, its superiority is examined in six real-world instances with up to 12,000 decision variables. IEEE

关键词： Iron

来源：评论

学校读者我要写书评

暂无评论

Byzantine-Resilient Multi-Agent Distributed Exact Optimization with Less Data

arXiv

引用

arXiv 2023年

作者： Zhai, Yang Liu, Zhi-Wei Yue, Dong Hu, Songlin Xie, Xiangpeng The Institute of Advanced Technology for Carbon Neutrality Nanjing University of Posts and Telecommunications Nanjing210023 China The School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China

This paper studies the distributed multi-agent resilient optimization problem under the f-total Byzantine attacks. Compared with the previous work on Byzantine-resilient multi-agent exact optimization problems, we do not require the communication topology to be fully connected. Under the redundancy of cost functions, we propose the distributed comparative gradient elimination resilient optimization algorithm based on the traditional assumptions on strongly convex global costs and Lipschitz continuous gradients. Under this algorithm, we successfully prove that if the number of in-neighbors of each normal agent is greater than some constant and the parameter f satisfies certain conditions, all normal agents' local estimations of the global variable will finally reach consensus and converge to the optimized solution. Finally, the numerical experiments successfully verify the correctness of the results. Copyright © 2023, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Selection of Cancer Biomarkers from Microarray Gene Expression Data Utilizing the Bi-Objective Optimization Method

Selection of Cancer Biomarkers from Microarray Gene Expressi...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Jianqing Lin Huachao Zhu 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 Wuhan University Wuhan China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

Cancer-associated biomarker genes play an indispensable role in the intricate tapestry of cancer development and manifestation. The expression of biomarkers in different types of tumor cells has beneficial implications for shedding light on the development of various cancers, guiding clinical diagnosis, and treatment. Microarray technology enables the expression levels of thousands of genes in samples to be sequenced simultaneously. However, sparse and high-dimensional microarray data present a formidable challenge in identifying biomarker genes. This study presents EREF-NSGA2, a novel method for cancer biomarker selection from microarray data, employing a hybrid gene selection approach. Firstly, the combination of the wrapper and embedded gene selection methods is proposed to filter the microarray data, which efficiently decreases the search space of the algorithm. After that, the improved NSGA-II algorithm is used to search the genes subset obtained from the previous step to reach the optimal subset of cancer biomarker genes. The proposed EREF-NSGA2 is compared with other reported methods on six cancer benchmark gene expression datasets. A detailed biological analysis is performed to analyze the relationship between the selected genes and the cancer data sets they belong to. To summarize, EREF-NSGA2 proves its effectiveness in selecting a feature subset comprising the fewest genes while maintaining the highest classification accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

T-TIME: Test-Time Information Maximization Ensemble for Plug-and-Play BCIs

arXiv

引用

arXiv 2024年

作者： Li, Siyang Wang, Ziwei Luo, Hanbin Ding, Lieyun Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China Henan Key Laboratory of Brain Science and Brain Computer Interface Technology School of Electrical and Information Engineering Zhengzhou University China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China

Objective: An electroencephalogram (EEG)-based brain-computer interface (BCI) enables direct communication between the human brain and a computer. Due to individual differences and non-stationarity of EEG signals, such BCIs usually require a subject-specific calibration session before each use, which is time-consuming and user-unfriendly. Transfer learning (TL) has been proposed to shorten or eliminate this calibration, but existing TL approaches mainly consider offline settings, where all unlabeled EEG trials from the new user are available. Methods: This paper proposes Test-Time Information Maximization Ensemble (T-TIME) to accommodate the most challenging online TL scenario, where unlabeled EEG data from the new user arrive in a stream, and immediate classification is performed. T-TIME initializes multiple classifiers from the aligned source data. When an unlabeled test EEG trial arrives, T-TIME first predicts its labels using ensemble learning, and then updates each classifier by conditional entropy minimization and adaptive marginal distribution regularization. Our code is publicized. Results: Extensive experiments on three public motor imagery based BCI datasets demonstrated that T-TIME outperformed about 20 classical and state-of-the-art TL approaches. Significance: To our knowledge, this is the first work on test time adaptation for calibration-free EEG-based BCIs, making plug-and-play BCIs possible. © 2024, CC BY.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

A pushing-grasping collaborative method based on deep q-network algorithm in dual perspectives

arXiv

引用

arXiv 2021年

作者： Gang, Peng Jinhu, Liao Shangbin, Guan Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

Aiming at the traditional grasping method for manipulators based on 2D camera, when faced with the scene of gathering or covering, it can hardly perform well in unstructured scenes that appear as gathering and covering, for the reason that can’t recognize objects accurately in cluster scenes from a single perspective and the manipulators can’t make the environment better for grasping. In this case, a novel method of pushing-grasping collaborative based on the deep Q-network in dual perspectives is proposed in this paper. This method adopts an improved deep Q-network algorithm, with an RGB-D camera to obtain the information of objects’ RGB images and point cloud from two perspectives, and combines the pushing and grasping actions, so that the trained manipulator can make the scenes better for grasping, so that it can perform well in more complicated grasping scenes. What’s more, we improved the reward function of the deep Q-network and propose the piecewise reward function to speed up the convergence of the deep Q-network. We trained different models and tried different methods in the V-REP simulation environment, and it drew a conclusion that the method proposed in this paper converges quickly and the success rate of grasping objects in unstructured scenes raises up to 83.5%. Besides, it shows the generalization ability and well performance when novel objects appear in the scenes that the manipulator has never grasped before. Copyright © 2021, The Authors. All rights reserved.

关键词： Manipulators

来源：评论

学校读者我要写书评

暂无评论

Construction of Three-Dimensional Nickel-Vanadium Hydrotalcite with Ball-Flower Architecture for Screen-Printed Asymmetric Supercapacitor

SSRN

引用

SSRN 2022年

作者： Tu, Qian Zhang, Qiang Sun, Xinyu Wang, Jinglu Lin, Baoying Liu, Jin Liu, Zhonghua Chen, Liangzhe School of Electronic Information Engineering Jingchu University of Technology Jingmen448000 China School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry Huazhong University of Science and Technology Wuhan430074 China

As a promising energy storage matter, two-dimensional (2D) layered double hydroxides (LDHs) suffer from a lower specific capacitance and poor retention. Morphology engineering is deemed to be an effective means. Herein, three-dimensional (3D) nickel-vanadium hydrotalcite (NiV-LDHs) with ball-flower structure are synthesized successfully via a facile dynamic-refluxing route, such a green strategy dispenses with template and high pressure and generates a specific surface area as high as 61.6 m 2 /g. Then, the screen-printed inks with outstanding rheological performances are formulated and the resulting electrodes display superior hydrophilic performance. Benefitted from the 3D architecture and shear flow process, the NiV-LDHs electrode can deliver an enhanced specific capacitance of 1069 F/g at 1 A/g with cycling stability of ~68.0% after 1500 cycles at 20 A/g, in contrast with that of NiV-LDHs prepared by coprecipitation (848 F/g and ~5.1%). Furthermore, an asymmetric NiV-LDHs//activated carbon supercapacitor (ASC) is assembled, which can yield a remarkable energy density of 75.8 μWh/cm2 at a power density of 0.80 mW/cm2, and two ASCs in series can illuminate a red light (2.5 V) for more than 270 s. Therefore, this study proposes a facile and economic strategy to prepare 3D nanomaterial for advanced and flexible printable energy storage devices. © 2022, The Authors. All rights reserved.

关键词： Screen printing

来源：评论

学校读者我要写书评

暂无评论

BoostTree and BoostForest for Ensemble Learning

Research Square

引用

Research Square 2021年

作者： Zhao, Changming Wu, Dongrui Huang, Jian Yuan, Ye Zhang, Hai-Tao Peng, Ruimin Shi, Zhenhua Guo, Chenfeng 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 Wuhan China

Bootstrap aggregating (Bagging) and boosting are two popular ensemble learning approaches, which combine multiple base learners to generate a composite model for more accurate and more reliable performance. They have been widely used in biology, engineering, healthcare, etc. This article proposes BoostForest, which is an ensemble learning approach using BoostTree as base learners and can be used for both classification and regression. BoostTree constructs a tree model by gradient boosting. It achieves high randomness (diversity) by sampling its parameters randomly from a parameter pool, and selecting a subset of features randomly at node splitting. BoostForest further increases the randomness by bootstrapping the training data in constructing different BoostTrees. BoostForest outperformed four classical ensemble learning approaches (Random Forest, Extra-Trees, XGBoost and LightGBM) on 34 classification and regression datasets. Remarkably, BoostForest has only one hyper-parameter (the number of BoostTrees), which can be easily specified. Our code is publicly available, and the proposed ensemble learning framework can also be used to combine many other base learners. © 2021, CC BY.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Active Learning for Simultaneous Emotion Classification and Regression

Multi-Task Active Learning for Simultaneous Emotion Classifi...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xue Jiang Lubin Meng Dongrui Wu 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 Wuhan China

ISBN: (纸本)9781665442084

Emotion recognition, which aims to identify an individual’s emotional state from the acquired physiological or body signals, is very important in affective computing. Emotions have two common representations: categorical, e.g., happy, sad, etc., and dimensional (continuous), e.g., valence, arousal and dominance. Training a good emotion classification or regression model usually requires a large number of labeled data. However, the labeling process is very difficult. As emotions are subtle and uncertain, it usually requires multiple assessors to label each emotional instance to obtain the groundtruth categorical label or dimensional values. In this paper, we propose a multi-task active learning (MTAL) framework to query the most useful samples for labeling, which enables the efficient training of an emotion classification model and multiple emotion regression models simultaneously. This is novel and challenging, as all previous research considered only emotion classification or regression alone, but not simultaneously. Experimental results on the IEMOCAP dataset demonstrated that MTAL outperformed random selection and several state-of-the-art single task active learning approaches, i.e., with the same number of labeled samples, MTAL can obtain better emotion classification and regression models simultaneously.

关键词： Training Emotion recognition Conferences Multitasking Physiology Data models Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：