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

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

来源：评论

学校读者我要写书评

暂无评论

Necessary and Sufficient Conditions for Consensus in Fractional-Order Multiagent Systems via Sampled Data Over Directed Graph

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第4期51卷 2501-2511页

作者： Su, Housheng Ye, Yanyan Chen, Xia He, Haibo Huazhong Univ Sci & Technol Educ Minist China Image Proc & Intelligent Control Key Lab Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol State Key Lab Adv Electromagnet Engn & Technol Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Elect & Elect Engn Wuhan 430074 Peoples R China Univ Rhode Isl Dept Elect Comp & Biomed Engn Kingston RI 02881 USA

This paper studies the consensus in fractional-order multiagent systems over directed graph via sampled-data control method. A distributed control protocol using the sampled position and velocity data is designed. By virtue of the Mittag-Leffler function, Laplace transform, and matrix theory, some necessary and sufficient conditions associated with the sampling period, the fractional order, the coupling strengths, and the network structure to obtain consensus of the systems are obtained. Then, some detailed discussions are presented about how to select the sampling period and how to design the coupling strengths to attain the consensus of the systems, respectively. Lastly, some numerical simulation results are illustrated to reflect the availability of the theoretical analysis.

关键词： Protocols Laplace equations Couplings Kinetic theory Eigenvalues and eigenfunctions Multi-agent systems Delays Consensus fractional order multiagent systems (MASs) sampling period

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Proposal relation network for temporal action detection

arXiv

引用

arXiv 2021年

作者： Wang, Xiang Qing, Zhiwu Huang, Ziyuan Feng, Yutong Zhang, Shiwei Jiang, Jianwen Tang, Mingqian Gao, Changxin Sang, Nong Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Alibaba Group China

This technical report presents our solution for temporal action detection task in AcitivityNet Challenge 2021. The purpose of this task is to locate and identify actions of interest in long untrimmed videos. The crucial challenge of the task comes from that the temporal duration of action varies dramatically, and the target actions are typically embedded in a background of irrelevant activities. Our solution builds on BMN [10], and mainly contains three steps: 1) action classification and feature encoding by Slowfast [6], CSN [13] and ViViT [1];2) proposal generation. We improve BMN by embedding the proposed Proposal Relation Network (PRN), by which we can generate proposals of high quality;3) action detection. We calculate the detection results by assigning the proposals with corresponding classification results. Finally, we ensemble the results under different settings and achieve 44.7% on the test set, which improves the champion result in ActivityNet 2020 [17] by 1.9% in terms of average mAP. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Vision-based Autonomous Landing of Unmanned Aerial Vehicle on a Motional Unmanned Surface Vessel 39

Vision-based Autonomous Landing of Unmanned Aerial Vehicle o...

引用

39th Chinese control Conference (CCC)

作者： Xu, Zhe-Chong Hu, Bin-Bin Liu, Bin Wang, X. D. Zhang, Hai-Tao Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

ISBN: (纸本)9789881563903

This paper has developed a vision-based control approach for autonomous tracking and landing on a motional Unmanned surface vessel (USV) with an unmanned aerial vehicle (UAV). First, a novel three-stage visual detection method is proposed to estimate the relative 3D position between UAV and USV, where the USV stays in a suitable view of the camera of the UAV. Then a PID controller is designed to regulate the attitude of the quadrotor and the movement of the vessel, which enables the successful landing procedure of the UAV on a motional USV. Finally, lake experiments are conducted to verify the effectiveness of the proposed algorithm.

关键词： Autonomous landing Unmanned aerial vehicle Unmanned surface vessel Computer vision

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Study of the Efficiency of Type-Reduction Algorithms

引用

IEEE TRANSACTIONS ON FUZZY SYSTEMS 2021年第6期29卷 1556-1566页

作者： Chen, Chao Wu, Dongrui Garibaldi, Jonathan M. John, Robert, I Twycross, Jamie Mendel, Jerry M. Univ Nottingham Sch Comp Sci Lab Uncertainty Data & Decis Making Intelligent Modelling & Anal & Automated Scheduli Nottingham NG8 1BB England Huazhong Univ Sci & Technol Minist Educ Key Lab Image Proc & Intelligent Control Sch Artificial Intelligence & Automat Wuhan 430074 England Univ Southern Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90007 USA Tianjin Normal Univ Coll Artificial Intelligence Tianjin 300387 Peoples R China

Improving the efficiency of type-reduction algorithms continues to attract research interest. Recently, there has been some new type-reduction approaches claiming that they are more efficient than the well-known algorithms such as the enhanced Karnik-Mendel (EKM) and the enhanced iterative algorithm with stopping condition (EIASC). In a previous paper, we found that the computational efficiency of an algorithm is closely related to the platform, and how it is implemented. In computer science, the dependence on languages is usually avoided by focusing on the complexity of algorithms (using big O notation). In this article, the main contribution is the proposal of two novel type-reduction algorithms. Also, for the first time, a comprehensive study on both existing and new type-reduction approaches is made based on both algorithm complexity and practical computational time under a variety of programming languages. Based on the results, suggestions are given for the preferred algorithms in different scenarios depending on implementation platform and application context.

关键词： Switches Complexity theory Fuzzy sets Iterative methods Computer science Fuzzy logic Sorting Centroid center-of-sets type reducer without sorting requirement (COSTRWSR) direct approach (DA) enhanced karnik-mendel (EKM) algorithm enhanced iterative algorithm with stop condition (EIASC) interval type-2 (IT2) fuzzy set karnik-mendel (KM) algorithm nonderivative-based direct approach (DAND) simplified COSTRWSR (SC) type-reduction

来源：评论

学校读者我要写书评

暂无评论

Battery Parameter Identification Using Recursive Least Squares with Variable Directional Forgetting 16

Battery Parameter Identification Using Recursive Least Squar...

引用

16th IEEE International Conference on control and Automation (ICCA)

作者： Zhu, Kun Wan, Yiming Li, Chenou Luo, Xin Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

ISBN: (纸本)9781728190938

An accurate battery model is important to perform various tasks of battery management. Battery model parameters change with working conditions, thus requiring continuous update for parameter estimation. The recursive least-squares algorithm with a forgetting strategy is widely used to estimate time-varying parameters online. However, the online data vary with battery operations, so the data may fail to contain sufficient excitation. When the online data is not persistently exciting, most existing forgetting strategies in battery literature suffer from covariance blowup, which means the algorithm cannot identify parameters reliably. In order to cope with non-persistent excitation, a recursive least-squares algorithm with variable direction forgetting is presented in this paper for battery parameter estimation. Instead of discounting all old information, it performs forgetting only in the direction of sufficient excitation. The forgetting factor can adaptively adjust based on excitation, which enhances trade-off between stability and tracking capability of the algorithm. A battery simulation model with time-varying parameters is used to illustrate the effectiveness of our proposed algorithm.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Spiking Neural P Systems with Communication on Request and Polarizations

引用

INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 2020年第1-2期15卷 107-126页

作者： Jiang, Suxia Fan, Jihui Wang, Yanfeng Xu, Fei Zhengzhou Univ Light Ind Henan Key Lab Informat Based Elect Appliances Zhengzhou 450002 Henan Peoples R China Huazhong Univ Sci & Technol Sch Automat Key Lab Image Informat Proc & Intelligent Control Wuhan 430074 Hubei Peoples R China

Spiking neural P systems with communication on request (in short. SNQ P systems) are a variant of spiking neural P systems. SNQ P systems are inspired by biological phenomena, such as spikes are requested and emitted between neurons. SNQ P systems have been proved to be universal when two types of spikes are considered. In this work, under the consideration of polarizations of neurons, we propose a variant of SNQ P systems, called spiking neural P systems with communication on request and polarizations (in short, PSNQ P systems). In PSNQ P systems, the spikes of a neuron are requested from neighboring neurons, depending on both the contents and polarization of the neuron and the polarization of all requesting neurons (not checked by means of a regular expression). Meanwhile, the polarizations related to the requesting neurons can be exchanged. Moreover, PSNQ P systems are proved to be computationally universal as long as one type of spike is considered, and a small universal PSNQ P system using 209 neurons is constructed.

关键词： Bio-inspired computing membrane computing spiking neural P systems request rule polarization

来源：评论

学校读者我要写书评

暂无评论

TransView: Inside, Outside, and Across the Cropping View Boundaries

TransView: Inside, Outside, and Across the Cropping View Bou...

引用

International Conference on Computer Vision (ICCV)

作者： Zhiyu Pan Zhiguo Cao Kewei Wang Hao Lu Weicai Zhong Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Huawei CBG

ISBN: (纸本)9781665428132

We show that relation modeling between visual elements matters in cropping view recommendation. Cropping view recommendation addresses the problem of image recomposition conditioned on the composition quality and the ranking of views (cropped sub-regions). This task is challenging because the visual difference is subtle when a visual element is reserved or removed. Existing methods represent visual elements by extracting region-based convolutional features inside and outside the cropping view boundaries, without probing a fundamental question: why some visual elements are of interest or of discard? In this work, we observe that the relation between different visual elements significantly affects their relative positions to the desired cropping view, and such relation can be characterized by the attraction inside/outside the cropping view boundaries and the repulsion across the boundaries. By instantiating a transformer-based solution that represents visual elements as visual words and that models the dependencies between visual words, we report not only state-of-the-art performance on public benchmarks, but also interesting visualizations that depict the attraction and repulsion between visual elements, which may shed light on what makes for effective cropping view recommendation.

关键词： Visualization Computer vision Computational modeling Benchmark testing Feature extraction Transformers Decoding

来源：评论

学校读者我要写书评

暂无评论

Minimal-time Deadbeat Consensus and Individual Disagreement Degree Prediction for High-order Linear Multi-agent Systems

arXiv

引用

arXiv 2023年

作者： Hu, Fu-Long Zhang, Hai-Tao Xu, Bowen Hu, Zhe Ren, Wei School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control The State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan430074 China School of Artificial Intelligence Optics and Electronics Northwestern Polytechnical University Xi’an710072 China Department of Electrical and Computer Engineering University of California Riverside92521 United States

In this paper, a Hankel matrix-based fully distributed algorithm is proposed to address a minimal-time deadbeat consensus prediction problem for discrete-time high-order multi-agent systems (MASs). Therein, each agent can predict the consensus value with the minimum number of observable historical outputs of its own. Accordingly, compared to most existing algorithms only yielding asymptotic convergence, the present method can attain deadbeat consensus instead. Moreover, based on the consensus value prediction, instant individual disagreement degree value of MASs can be calculated in advance as well. Sufficient conditions are derived to guarantee both the minimal-time deadbeat consensus and the instant individual disagreement degree prediction. Finally, both the effectiveness and superiority of the proposed deadbeat consensus algorithm are substantiated by numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：