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

2023 China Automation Congress, CAC 2023

作者： Man, Jingtao Zeng, Zhigang Xiao, Qiang Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan China

ISBN: (纸本)9798350303759

Spatial deployment of large-scale heterogeneous multi-agent systems (HMASs) over desired 2D or 3D curves is investigated in this paper. With assumption that HMASs consist of numerous first-order agents (FOAs) and second-order agents (SOAs) that could obtain local information of desired curves and their positions relative to their closest neighbors, the collective dynamics of large-scale HMASs are modeled as heterogeneous partial differential equations (PDEs). In particular, this paper introduces series-dependent topological weights between neighboring agents, which are more versatile and practical than constant topological weights commonly used in previous studies. A novel single-point control scheme is proposed, where an informed agent is situated between the last FOA and first SOA. This operation could not only ensure successful implementation of spatial deployment, but also guarantee well-posedness of the constructed heterogeneous error PDEs. By utilizing inequality techniques, sufficient conditions for exponential convergence of error system are derived. A numerical example is presented to demonstrate effectiveness of the proposed approaches. © 2023 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Semi-global scaled edge-consensus of linear discrete-time multi-agent systems with positive constraint and input saturation 7

Semi-global scaled edge-consensus of linear discrete-time mu...

引用

7th International Conference on Information, Cybernetics, and Computational Social Systems, ICCSS 2020

作者： Fan, Zhipeng Sun, Yaping Su, Housheng Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Wuhan China

ISBN: (纸本)9781728162461

The thesis studies the semi-global scaled edge-consensus of linear discrete-time multi-agent systems under both the directed networks and undirected networks, where the states of each edge are subject to input saturation and positive constraint. By virtue of the MARE-based low-gain feedback method, two control protocols about directed networks and undirected networks are devised respectively to promise the positive scaled edge-consensus with input saturation. Thus we find the sufficient conditions to promise the positive edge states and overcome the input saturation. Finally, two representative examples are presented to prove the results. © 2020 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

AN ADAPTIVE MEMBRANE ALGORITHM FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS

引用

Acta Mathematica Scientia 2014年第5期34卷 1377-1394页

作者：贺娟娟肖建华邵泽辉 Key Laboratory of Image Processing and Intelligent Control School of AutomationHuazhong University of Science and Technology The Research Center of Logistics Nankai University School of Information Science and Technology Chengdu University

Membrane algorithms （MAs）, which inherit from P systems, constitute a new parallel and distribute framework for approximate computation. In the paper, a membrane algorithm is proposed with the improvement that the involved parameters can be adaptively chosen. In the algorithm, some membranes can evolve dynamically during the computing process to specify the values of the requested parameters. The new algorithm is tested on a well-known combinatorial optimization problem, the travelling salesman problem. The em-pirical evidence suggests that the proposed approach is efficient and reliable when dealing with 11 benchmark instances, particularly obtaining the best of the known solutions in eight instances. Compared with the genetic algorithm, simulated annealing algorithm, neural net-work and a fine-tuned non-adaptive membrane algorithm, our algorithm performs better than them. In practice, to design the airline network that minimize the total routing cost on the CAB data with twenty-five US cities, we can quickly obtain high quality solutions using our algorithm.

关键词： membrane algorithm adaptation travelling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Tissue P systems with cell separation: attacking the partition problem

引用

Science China(Information Sciences) 2011年第2期54卷 293-304页

作者： ZHANG XingYi1, WANG Shuo2, NIU YunYun2 & PAN LinQiang2 1Key Lab of intelligent Computing and Signal processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei 230039, China 2image processing and intelligent control Key laboratory of Education Ministry of China, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China 1. Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China2. Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for effciently solving a well-known NP-complete problem, the partition problem.

关键词： membrane computing tissue P system cell separation partition problem

来源：评论

学校读者我要写书评

暂无评论

Research on a novel restoration algorithm of turbulence-degraded images with alternant iterations

引用

Journal of Systems Engineering and Electronics 2006年第3期17卷 477-482页

作者： Liu Chunsheng Hong Hanyu Zhang Tianxu Inst. for Pattern Recognition and AI State Key Laboratory of Image Processing and Intelligent Control Huazhong Univ. of Science and Technology Wuhan 430074 P. R. China

A new restoration algorithm based on double loops and alternant iterations is proposed to restore the object image effectively from a few frames of turbulence-degraded images, Based on the double loops, the iterative relations for estimating the turbulent point spread function PSF and object image alternately are derived. The restoration experiments have been made on computers, showing that the proposed algorithm can obtain the optimal estimations of the object and the point spread function, with the feasibility and practicality of the proposed algorithm being convincing.

关键词： turbulence-degraded image image restoration double loops alternant iterations.

来源：评论

学校读者我要写书评

暂无评论

On string languages generated by spiking neural P systems with exhaustive use of rules

引用

Natural Computing 2008年第4期7卷 535-549页

作者： Zhang, Xingyi Zeng, Xiangxiang Pan, Linqiang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China

We continue the study of (extended) spiking neural P systems with exhaustive use of rules by considering these computing devices as language generators. Specifically, a step is associated with a symbol according to the number of spikes emitted by the output neuron and the sequence of these symbols associated with a halting computation constitutes a string. Two cases are considered: one of them interprets a step when no spike is emitted as a specified symbol, the other interprets such a step as the empty string. In both cases, it is proved that finite and recursively enumerable languages are characterized by extended spiking neural P systems working in the exhaustive mode. The relationships with regular languages are also investigated. © Springer Science+Business Media B.V. 2008.

关键词： Membrane computing Register machine SN P systems

来源：评论

学校读者我要写书评

暂无评论

Improved taboo search algorithm for designing DNA sequences

引用

Progress in Natural Science:Materials International 2008年第5期18卷 623-627页

作者： Kai Zhang a, Jin Xu a,b, Xiutang Geng a, Jianhua Xiao a, Linqiang Pana, a The Key laboratory of image processing and intelligent control, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China b School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, which can satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can nd a set of good DNA sequences satisfying required constraints.

关键词： DNA computing Taboo search algorithm DNA sequence design

来源：评论

学校读者我要写书评

暂无评论

Arithmetic computation using self-assembly of DNA tiles:subtraction and division

引用

Progress in Natural Science:Materials International 2009年第3期19卷 377-388页

作者： Xuncai Zhang a,b, Yanfeng Wang b, Zhihua Chen a, Jin Xu a,*, Guangzhao Cui b a The Key laboratory of image processing and intelligent control, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China b School of Electrical and Electronic Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China [a]The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China [b]School of Electrical and Electronic Engineering Zhengzhou University of Light Industry Zhengzhou 450002 China

Recently, experiments have demonstrated that simple binary arithmetic and logical operations can be computed by the process of self- assembly of DNA tiles. In this paper, we show how the tile assembly process can be used for subtraction and division. In order to achieve this aim, four systems, including the comparator system, the duplicator system, the subtraction system, and the division system, are pro- posed to compute the difference and quotient of two input numbers using the tile assembly model. This work indicates that these systems can be carried out in polynomial time with optimal O(1) distinct tile types in parallel and at very low cost. Furthermore, we provide a scheme to factor the product of two prime numbers, and it is a breakthrough in basic biological operations using a molecular computer by self-assembly.

关键词： Self-assembly Subtractor Divider Tile assembly model DNA tiles DNA computing

来源：评论

学校读者我要写书评

暂无评论

Mem Brain: An Easy-to-Use Online Webserver for Transmembrane Protein Structure Prediction

引用

Nano-Micro Letters 2018年第1期10卷 12-19页

作者： Xi Yin Jing Yang Feng Xiao Yang Yang Hong-Bin Shen Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Department of Computer Science Shanghai Jiao Tong University Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering

Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate the membrane protein's structure by wet-lab experiments,accurate and fast amino acid sequence-based computational methods are highly desired. In this paper, we report an online prediction tool called Mem Brain, whose input is the amino acid sequence. Mem Brain consists of specialized modules for predicting transmembrane helices, residue–residue contacts and relative accessible surface area of a-helical membrane proteins. Mem Brain achieves aprediction accuracy of 97.9% of ATMH, 87.1% of AP,3.2 ± 3.0 of N-score, 3.1 ± 2.8 of C-score. Mem BrainContact obtains 62%/64.1% prediction accuracy on training and independent dataset on top L/5 contact prediction,respectively. And Mem Brain-Rasa achieves Pearson correlation coefficient of 0.733 and its mean absolute error of13.593. These prediction results provide valuable hints for revealing the structure and function of membrane *** Brain web server is free for academic use and available at ***/bioinf/Mem Brain/.

关键词： Transmembrane a-helices Structure prediction Machine learning Contact map prediction Relative accessible surface area

来源：评论

学校读者我要写书评

暂无评论

Consensus in second-order multi-agent systems via impulsive control using position-only information with heterogeneous delays

引用

IET control Theory and Applications 2015年第3期9卷 336-345页

作者： Wang, Yan-Wu Yi, Jing-Wen School of Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science AndTechnology Ministry of China China

This study investigates the consensus problem of second-order multi-agent systems (MASs) via impulsive control using position-only information with communication delays. The communication delays between any two distinct agents are different which can be larger than one impulsive period. A distributed impulsive consensus protocol is designed, in which only the delayed sampled relative positions to neighbours and the relative position to the last sampling state are utilised. By introducing some virtual subgraphs and performing three steps of model transformation, the consensus problem of original continuous-time system is converted to the stability problem of a discrete-time expanded error system. Some necessary and sufficient criteria are derived to grantee the dynamic average-consensus of the MAS. Furthermore, a special case, that is, the delays less than one impulsive period, is discussed, and the bounds of impulsive periods for the dynamic average-consensus are obtained in explicit expressions for both the undirected and directed communication graphs, respectively. Two numerical simulation examples are given to illustrate the effectiveness of theoretical results. © 2015 The Institution of Engineering and Technology.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：