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

arXiv 2019年

作者： Zavary, Elyar Sojoodi, Mahdi Advanced Control Systems Laboratory School of Electrical and Computer Engineering Tarbiat Modares University Tehran Iran

This paper investigates a decentralized dynamic output feedback controller for the robust consensus of fractional-order uncertain multi-agent systems. The procedure is decentralized meaning that each agent can only receive output information from its neighbor agents. By an appropriate state transformation, we reduce the consensus problem to stability one, which leads to a matrix inequality. Additionally, a Homotopy-based method is utilized to solve the resulted matrix inequality and to find the controller’s unknown parameters that guarantee the robust consensus of agents. Finally, an illustrative example on multi-agent permanent magnet synchronous motor system and a numerical example are presented to show the effectiveness of the proposed control approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

How much information is needed in quantized nonlinear control?

引用

Science China(Information Sciences) 2018年第9期61卷 205-217页

作者： Chuang ZHENG Lin LI Leyi WANG Chanying LI School of Mathematical Sciences Beijing Normal University Department of Electrical and Computer Engineering Wayne State University Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences

Quantization rate is a crucial measure of complexity in determining stabilizability of control systems subject to quantized state measurements. This paper investigates quantization complexity for a class of nonlinear systems which are subjected to disturbances of unknown statistics and unknown bounds. This class of systems includes linear stablizable systems as special cases. Two lower bounds on the quantization rates are derived which guarantee input-to-state stabilizability for continuous-time and sampled-data feedback strategies, respectively. Simulation examples are provided to validate the results.

关键词： nonlinear systems disturbances input-to-state stabilizability sampled systems quantization rate

来源：评论

学校读者我要写书评

暂无评论

A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph

引用

engineering 2018年第1期4卷 61-77页

作者： Jin xu Xiaoli Qiang Kai Zhang Cheng Zhang Jing Yang Key Laboratory of High Confidence Software Technologies of Ministry of Education Institute of Software School of Electronics Engineering and Computer SciencePeking University Beijing 100871 China Institute of Novel Computer Science and Intelligent Software Guangzhou University Guangzhou 510006 China School of Computer Science Wuhan University of Science and Technology Wuhan 430081 China School of Control and Computer Engineering North China Electric Power University Beijing 102206 China

The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows： The exponential explosion prob- lem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction （PCR） technology that dramatically improves the processing speed. In this arti- cle, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonu- cleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thou- sands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to 0（3^59）. By means of an exhaustive search, it would take more than 896 000 years for an electronic computer （5 x 10^14 s-1） to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman＇s research group in 2002 （with a searching capability of 0（2^20））.

关键词： DNA computing Graph vertex coloring problem Polymerase chain reaction

来源：评论

学校读者我要写书评

暂无评论

CBLNER: A Multi-models Biomedical Named Entity Recognition System Based on Machine Learning 1

引用

15th International Conference on Intelligent Computing, ICIC 2019

作者： Lejun, Gong Xiaolin, Liu Xuemin, Yang Lipeng, Zhang Yao, Jia Ronggen, Yang Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China

ISBN: (数字)9783030269692

ISBN: (纸本)9783030269685

Biomedical named entities is fundamental recognition task in biomedical text mining. This paper developed a system for identifying biomedical entities with four models including CRF, LSTM, Bi-LSTM and BiLSTM-CRF. The system achieved the following performance in test data Genia V3.02: CRF with an F score of 75.91%, LSTM with an F score of 71.69%, BiLSTM with a F score of 74.37%, BiLSTM-CRF with a F score of 76.81%. Experimental results show the performance of BiLSTM-CRF model is better than other three models. Compared with CRF model, Bi-LSTM-CRF model has better recognition effect for biological entities in long text and entities that modified by modifiers. Therefore, CBLNER system lays a foundation for further relationship and event extraction, and could also provide reference for entity recognition research in other fields. © 2019, Springer Nature Switzerland AG.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Fault Diagnosis of Motor in Frequency Domain Signal by Stacked De-noising Auto-encoder

引用

computers, Materials & Continua 2018年第11期57卷 223-242页

作者： Xiaoping Zhao Jiaxin Wu Yonghong Zhang Yunqing Shi Lihua Wang School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China School of Information and Control Nanjing University of Information Science and TechnologyNanjing210044China Electrical and Computer Engineering New Jersey Institute of TechnologyNewark07102USA

With the rapid development of mechanical equipment,mechanical health monitoring field has entered the era of big *** learning has made a great achievement in the processing of large data of image and speech due to the powerful modeling capabilities,this also brings influence to the mechanical fault diagnosis ***,according to the characteristics of motor vibration signals(nonstationary and difficult to deal with)and mechanical‘big data’,combined with deep learning,a motor fault diagnosis method based on stacked de-noising auto-encoder is *** frequency domain signals obtained by the Fourier transform are used as input to the *** method can extract features adaptively and unsupervised,and get rid of the dependence of traditional machine learning methods on human extraction features.A supervised fine tuning of the model is then carried out by *** Asynchronous motor in Drivetrain Dynamics Simulator system was taken as the research object,the effectiveness of the proposed method was verified by a large number of data,and research on visualization of network output,the results shown that the SDAE method is more efficient and more intelligent.

关键词： Big data deep learning stacked de-noising auto-encoder fourier transform

来源：评论

学校读者我要写书评

暂无评论

Push-Pull Finite-Time Convergence Distributed Optimization Algorithm

引用

American Journal of Computational Mathematics 2020年第1期10卷 118-146页

作者： Xiaobiao Chen Kaixin Yan Yu Gao Xuefeng Xu Kang Yan Jing Wang Department of Science Taiyuan University of Technology Taiyuan China Department of Automation Taiyuan University of Technology Taiyuan China Department of Automation School of Control and Computer Engineering North China Electric Power University Beijing China Department of Economics and Management Taiyuan University of Technology Taiyuan China Department of Mechanical and Electrical Engineering Shanxi Energy Institute Taiyuan China School of Medicine Clinical Medicine Datong University Datong China

With the widespread application of distributed systems, many problems need to be solved urgently. How to design distributed optimization strategies has become a research hotspot. This article focuses on the solution rate of the distributed convex optimization algorithm. Each agent in the network has its own convex cost function. We consider a gradient-based distributed method and use a push-pull gradient algorithm to minimize the total cost function. Inspired by the current multi-agent consensus cooperation protocol for distributed convex optimization algorithm, a distributed convex optimization algorithm with finite time convergence is proposed and studied. In the end, based on a fixed undirected distributed network topology, a fast convergent distributed cooperative learning method based on a linear parameterized neural network is proposed, which is different from the existing distributed convex optimization algorithms that can achieve exponential convergence. The algorithm can achieve finite-time convergence. The convergence of the algorithm can be guaranteed by the Lyapunov method. The corresponding simulation examples also show the effectiveness of the algorithm intuitively. Compared with other algorithms, this algorithm is competitive.

关键词： Distributed Optimization Finite Time Convergence Linear Parameterized Neural Network Push-Pull Algorithm Undirected Graph

来源：评论

学校读者我要写书评

暂无评论

An improved approach for automatic spine canal segmentation using probabilistic boosting tree (PBT) with fuzzy support vector machine

引用

Journal of Ambient Intelligence and Humanized Computing 2020年第6期12卷 6527-6536页

作者： Viji, C. Rajkumar, N. Suganthi, S. T. Venkatachalam, K. kumar, T. Rajesh Pandiyan, Sanjeevi Department of CSE Akshaya College of Engineering and Technology Coimbatore India Department of Computer Engineering Lebanese French University Erbil Iraq School of CSE VIT University Bhopal Bhopal India Department of Information Technology Sri Krishna College of Technology Kovaipudur India Key Laboratory of Advanced Process Control for Light Industry Ministry of Education Jiangnan University Wuxi China

Spine canal segmentation is an emerging zone in research proposed to help interpretation and processing of advanced MRI and CT images. For instance, high resolution three-dimensional volumes can be divided to provide an estimation of spine canal atrophy. Spine canal segmentation is complex because of assortment of MRI contrasts and variation in human life structures. This investigation illustrates the details of spine canal segmentation techniques and gives a few measurements that can be utilized to contrast with other segmentation strategies. The details of background and foreground subtraction techniques, spine canal segmentation approach and optimization approach which are utilized in the different applications have been considered. In this paper, spine canal segmentation on probabilistic booting tree (PBT) with fuzzy support vector machine performance measures and metrics are analysed in state-of-the art technologies. Proposed approach is performed on the base of the automatic spine canal segmentation with the group of data MR. This proposed segmentation continue with fuzzy support vector machine (FSVM) technique to make fully automatic stream pipeline. The declaration in an automatic segmentation of stream pipeline was implemented with flexible voxel wise classification accompanying dimensions analogous with 3D Haar and labelled machine learning algorithms i.e. probabilistic boosting tree combined fuzzy support vector machine (PBT-FSVM). The novel segmentation technique correlated with MR data sets provides better accuracy than the exiting techniques and it is shown in experimental outcomes. To still improve performance of the results, online learning classification method can be in the proposed work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Off-Policy Q-Learning for Anti-Interference control of Multi-Player Systems ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 9189-9194页

作者： Jinna Li Zhenfei Xiao Tianyou Chai Frank. L. Lewis Sarangapani Jagannathan School of Information and Control Engineering Liaoning Shihua University Fushun 113001 China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang 110819 China UTA Research Institute the University of Texas at Arlington Arlington TX 76118 USA Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO 65409 USA

This paper develops a novel off-policy game Q-learning algorithm to solve the anti-interference control problem for discrete-time linear multi-player systems using only data without requiring system matrices to be known. The primary contribution of this paper lies in that the Q-learning strategy employed in the proposed algorithm is implemented in an off-policy policy iteration approach other than on-policy learning due to the well-known advantages of off-policy Q-learning over on-policy Q-learning. All of the players work hard together for the goal of minimizing their common performance index meanwhile defeating the disturbance that tries to maximize the specific performance index, and finally they reach the Nash equilibrium of the game resulting in satisfying disturbance attenuation condition. In order to find the solution to the Nash equilibrium, the anti-interference control problem is first transformed into an optimal control problem. Then an off-policy Q-learning algorithm is proposed in the framework of typical adaptive dynamic programming (ADP) and game architecture, such that control policies of all players can be learned using only measured data. Comparative simulation results are provided to verify the effectiveness of the proposed method.

关键词： H ∞ control off-policy Q-learning game theory Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

OER: Six Perspectives on Global Misconceptions and Challenges

OER: Six Perspectives on Global Misconceptions and Challenge...

引用

2019 IEEE International Conference on engineering, Technology and Education, TALE 2019

作者： Towey, Dave Reisman, Sorel Chan, Henry Demartini, Claudio Tovar, Edmundo Margaria, Tiziana University of Nottingham Ningbo China School of Computer Science Ningbo China California State University Fullerton Department of Information Systems and Decision Sciences Fullerton United States Hong Kong Polytechnic University Department of Computing Hong Kong Hong Kong Politecnico di Torino Control Computer Engineering Department Turin Italy Universidad Politécnica de Madrid School of Computer Engineers Madrid Spain University of Limerick Department of Computer Science and Information Systems Limerick Ireland

ISBN: (纸本)9781728126654

Open Educational Resources (OERs) are freely accessible materials for teaching, learning, and research that have been made available such that they can be freely used, modified, and shared. Prompted by the potential positive impact that OERs can have, a growing community of OER enthusiasts has been advocating for their adoption in higher education, and elsewhere. The growing demand for computer science education and training (especially in areas related to artificial intelligence, machine learning, and big data) has led to speculation as to how OERs may be best leveraged to support such teaching and learning. The recent occasion of an international OER workshop at the 2019 IEEE Conference on computers, Software and Applications (COMPSAC) allowed for six OER enthusiasts, all with extensive OER experience, to reflect on the status of OER adoption and understanding. These reflections, addressing misconceptions and challenges, form the basis for this paper. © 2019 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Lessening stress and anxiety-related behaviors by means of AI-driven drones for aromatherapy 6

Lessening stress and anxiety-related behaviors by means of A...

引用

6th Italian Workshop on Artificial Intelligence and Robotics, AIRO 2019

作者： Capizzi, Giacomo Napoli, Christian Russo, Samuele Woźniak, Marcin Department of Electrical Electronics and Informatics Engineering University of Catania Viale Andrea Doria 6 Catania CT95125 Italy Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Roma RM00185 Italy University of Catania Piazza Università 2 Catania CT95124 Italy Specialization School in Psychotherapy C.T.R. Via Galermo 105 Catania CT95123 Italy Institute of Mathematics Silesian University of Technology Kaszubska 23 Gliwice44-100 Poland

Stress and anxiety are part of the human mental process which is often unavoidably yield by circumstances and situations such as waiting for a flight at the airport gate, hanging around before an exam, or while in an hospital waiting room. In this work we devise a decision system for a robotic aroma diffusion device designed to lessen stress and anxiety-related behaviors. The robot is intended as designed for deployments in closed environments that resembles the aspect and structure of a waiting room with different chairs where people sit and wait. The robot can be remotely driven by means of an artificial intelligence based on Radial Basis Function Neural Networks classifiers. The latter is responsible to recognize when stress or anxiety levels are arising so that the diffusion of specific aromas could relax the bystanders. We make use of thermal images to infer the level of stress by means of an ad hoc feature extraction approach. The system is prone to future improvements such as the refinement of the classification process also by means of accurate psychometric studies that could be based on standardized tests or derivatives. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：