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

arXiv 2020年

作者： Yu, Qiang Song, Shiming Ma, Chenxiang Pan, Linqiang Tan, Kay Chen Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin China Key Laboratory of Image Information Processing and Intelligent Control Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China The Department of Computer Science City University of Hong Kong Hong Kong

Traditional neuron models use analog values for information representation and computation, while all-or-nothing spikes are employed in the spiking ones. With a more brain-like processing paradigm, spiking neurons are more promising for improvements on efficiency and computational capability. They extend the computation of traditional neurons with an additional dimension of time carried by all-or-nothing spikes. Could one benefit from both the accuracy of analog values and the time-processing capability of spikes? In this paper, we introduce a concept of augmented spikes to carry complementary information with spike coefficients in addition to spike latencies. New augmented spiking neuron model and synaptic learning rules are proposed to process and learn patterns of augmented spikes. We provide systematic insight into the properties and characteristics of our methods, including classification of augmented spike patterns, learning capacity, construction of causality, feature detection, robustness and applicability to practical tasks such as acoustic and visual pattern recognition. The remarkable results highlight the effectiveness and potential merits of our methods. Importantly, our augmented approaches are versatile and can be easily generalized to other spike-based systems, contributing to a potential development for them including neuromorphic computing. Copyright © 2020, The Authors. All rights reserved.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Modal regression based structured low-rank matrix recovery for multi-view learning

arXiv

引用

arXiv 2020年

作者： Xu, Jiamiao Wang, Fangzhao Peng, Qinmu You, Xinge Wang, Shuo Jing, Xiao-Yuan Philip Chen, C.L. School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute China State Key Laboratory of Software Engineering School of Computer Wuhan University China Department of Computer and Information Science Faculty of Science and Technology University of Macau 99999 China Dalian Maritime University Dalian116026 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

Low-rank Multi-view Subspace Learning (LMvSL) has shown great potential in cross-view classification in recent years. Despite their empirical success, existing LMvSL based methods are incapable of well handling view discrepancy and discriminancy simultaneously, which thus leads to the performance degradation when there is a large discrepancy among multi-view data. To circumvent this drawback, motivated by the block-diagonal representation learning, we propose Structured Low-rank Matrix Recovery (SLMR), a unique method of effectively removing view discrepancy and improving discriminancy through the recovery of structured low-rank matrix. Furthermore, recent low-rank modeling provides a satisfactory solution to address data contaminated by predefined assumptions of noise distribution, such as Gaussian or Laplacian distribution. However, these models are not practical since complicated noise in practice may violate those assumptions and the distribution is generally unknown in advance. To alleviate such limitation, modal regression is elegantly incorporated into the framework of SLMR (term it MR-SLMR). Different from previous LMvSL based methods, our MR-SLMR can handle any zero-mode noise variable that contains a wide range of noise, such as Gaussian noise, random noise and outliers. The alternating direction method of multipliers (ADMM) framework and half-quadratic theory are used to efficiently optimize MR-SLMR. Experimental results on four public databases demonstrate the superiority of MR-SLMR and its robustness to complicated noise. Copyright © 2020, The Authors. All rights reserved.

关键词： Gaussian noise (electronic)

来源：评论

学校读者我要写书评

暂无评论

Ultimate Boundedness control for Networked Systems with Redundant Channel under Quantization Effects

Ultimate Boundedness Control for Networked Systems with Redu...

引用

第三十八届中国控制会议

作者： Zhongyi Zhao Zidong Wang Lei Zou Hongli Dong College of Electrical Engineering and Automation Shandong University of Science and Technology Department of Computer Science Brunel University London Institute of Complex Systems and Advanced Control Northeast Petroleum University

This paper investigates the ultimate boundedness control problem for a class of networked systems with redundant channels under uniform quantization effects. Quantized output of concerned NCSs is transmitted to remote controller through a communication channel. For the purpose of improving communication quality, a redundant channel connected with a more precise quantizer is also employed, where the time to accomplish quantizing task is also considered. The transmission delays of such a redundant channel are modelled by a sequence of independent and identically distributed(i.i.d.) stochastic variable. An output feedback controller is developed under which the exponentially ultimate boundedness in mean square could be *** the virtue of stochastic analysis technology and Lyapunov-like method, sufficient conditions are established to ensure the existence of the desired controller, and the desired gain matrices are then obtained by solving a set of linear matrix ***, the effectiveness of designed controller is demonstrated through a simulation example.

关键词： Networked systems uniform quantization redundant channel ultimate boundedness control linear matrix inequal ities

来源：评论

学校读者我要写书评

暂无评论

Discrete Fourier Transform based Virtual Constraint control of Powered Ankle-Foot Prosthesis

Discrete Fourier Transform based Virtual Constraint Control ...

引用

International Conference on Robotics and Artificial Intelligence (ICRAI)

作者： Awais Naeem Mohsin Rizwan Hafiz Farhan Maqbool Muhammad Ahsan Ali Raza Syed Abbas Zilqurnain Naqvi Al-Khwarizmi Institute of Computer Science UET Lahore HCR Lab National Center of Robotics and Automation Lahore Pakistan Department of Mechatronics and Control Engineering National Center of Robotics and Automation Lahore Pakistan Department of Mechatronics and Control Engineering UET Lahore Lahore Pakistan

Active prosthetic devices have been controlled using several methods such as Echo control, EMG signal based Position control and Finite State Machine (FSM) based Impedance/Compliance control. This manuscript proposes Virtual Constraint control of active prosthesis which obviates any need for the classification of EMG signals, identification of the gait phase for state switching and potentially avoids an exhaustive procedure for the tuning of impedance parameters. In this paper, a Discrete Fourier Transform (DFT) based Virtual Constraint control is presented to characterize the ankle-foot joint trajectory as a function of the human-inspired phase variable in a unified manner. An optimization-based algorithm is employed for the robust generation of continuously monotonic and linear phase variable for DFT based Virtual Constraint control. The results are generalized across various walking speeds for a specific user during the level ground walking.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Strategy via Reinforcement Learning for the Prisoner＇s Dilemma Game

引用

IEEE/CAA Journal of Automatica Sinica 2018年第1期5卷 301-310页

作者： Lei Xue Changyin Sun Donald Wunsch Yingjiang Zhou Fang Yu Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education School of Automation Southeast University Nanjing 210096 China Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO 65409 USA College of Automation Nanjing University of Posts and Telecommunications Nanjing 210023 China Institute of Logistics Science and Engineering Shanghai Maritime University Shanghai 210096 China IEEE

The iterated prisoner's dilemma(IPD) is an ideal model for analyzing interactions between agents in complex networks. It has attracted wide interest in the development of novel strategies since the success of tit-for-tat in Axelrod's tournament. This paper studies a new adaptive strategy of IPD in different complex networks, where agents can learn and adapt their strategies through reinforcement learning method. A temporal difference learning method is applied for designing the adaptive strategy to optimize the decision making process of the agents. Previous studies indicated that mutual cooperation is hard to emerge in the IPD. Therefore, three examples which based on square lattice network and scale-free network are provided to show two features of the adaptive strategy. First, the mutual cooperation can be achieved by the group with adaptive agents under scale-free network, and once evolution has converged mutual cooperation, it is unlikely to shift. Secondly, the adaptive strategy can earn a better payoff compared with other strategies in the square network. The analytical properties are discussed for verifying evolutionary stability of the adaptive strategy.

关键词： Complex network prisoner’s dilemma reinforcement learning temporal differences learning

来源：评论

学校读者我要写书评

暂无评论

Abstraction-Based Synthesis of Opacity-Enforcing controllers using Alternating Simulation Relations

Abstraction-Based Synthesis of Opacity-Enforcing Controllers...

引用

IEEE Conference on Decision and control

作者： Junyao Hou Xiang Yin Shaoyuan Li Majid Zamani Department of Automation and Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Computer Science Department University of Colorado Boulder CO USA

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

Opacity is an important information-flow security property that captures the plausible deniability for some "secret" of a system. In this paper, we investigate the problem of synthesizing controllers that enforce opacity for labeled transition systems (LTS). Most of the existing works on synthesis of opacity-enforcing controllers are based on the original system model, which may contain a large number of states. To mitigate the complexity of the controller synthesis procedure, we propose an abstraction-based approach for controller synthesis. Specifically, we propose notion of opacity-preserving alternating (bi)simulation relation for the purpose of abstraction. We show that, if the abstract system is opacity-preserving alternatingly simulated by the original system which may be significantly smaller, then we can synthesize an opacity-enforcing controller based on the abstract system and then refine it back to a controller enforcing opacity of the original system. We investigate both initial-state opacity and infinite-step opacity. We also show the effectiveness of the proposed approach by a set of examples.

关键词： Computational modeling control system synthesis control system security Closed loop systems

来源：评论

学校读者我要写书评

暂无评论

BME-has system for CoNLL–SIGMORPHON 2018 shared task: Universal morphological reinflection

BME-has system for CoNLL–SIGMORPHON 2018 shared task: Unive...

引用

2018 CoNLL-SIGMORPHON Shared Task: Universal Morphological Reinflection, CoNLL 2018

作者： Ács, Judit Department of Automation and Applied Informatics Budapest University of Technology and Economics Hungary Institute for Computer Science and Control Hungarian Academy of Sciences Hungary

This paper presents an encoder-decoder neural network based solution for both subtasks of the CoNLL–SIGMORPHON 2018 Shared Task: Universal Morphological Reinflection. All of our models are sequence-to-sequence neural... 详细信息

ISBN: (纸本)9781948087834

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed Filtering for Unstable Dynamics Under Compromised Observations

Secure Distributed Filtering for Unstable Dynamics Under Com...

引用

IEEE Annual Conference on Decision and control

作者： Xingkang He Xiaoqiang Ren Henrik Sandberg Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Department of Automation Shanghai University Shanghai China

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

In this paper, we consider a secure distributed filtering problem for linear time-invariant systems with bounded noises and unstable dynamics under compromised observations. A malicious attacker is able to compromise a subset of the agents and manipulate the observations arbitrarily. We first propose a recursive distributed filter consisting of two parts at each time. The first part employs a saturation-like scheme, which gives a small gain if the innovation is too large. The second part is a consensus operation of state estimates among neighboring agents. A sufficient condition is then established for the boundedness of estimation error, which is with respect to network topology, system structure, and the maximal compromised agent subset. We further provide an equivalent statement, which connects to 2s-sparse observability in the centralized framework in certain scenarios, such that the sufficient condition is feasible. Numerical simulations are finally provided to illustrate the developed results.

关键词： Observability Estimation error Technological innovation control systems State estimation Robustness

来源：评论

学校读者我要写书评

暂无评论

A Primal-Dual SGD Algorithm for Distributed Nonconvex Optimization

arXiv

引用

arXiv 2020年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Department of Electrical Engineering University of North Texas DentonTX76203 United States The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered. This problem is an important component of many machine learning techniques with data parallelism, such as deep learning and federated learning. We propose a distributed primal–dual stochastic gradient descent (SGD) algorithm, suitable for arbitrarily connected communication networks and any smooth (possibly nonconvex) cost functions. We show that the proposed algorithm achieves the linear speedup convergence rate O(1/√nT) for general nonconvex cost functions and the linear speedup convergence rate O(1/(nT)) when the global cost function satisfies the Polyak–Lojasiewicz (P–L) condition, where T is the total number of iterations. We also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global optimum. We demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms. Copyright © 2020, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Conceptual Foundations of the Use of Formal Models and Methods for the Rapid Creation of Web Applications

Conceptual Foundations of the Use of Formal Models and Metho...

引用

IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems

作者： Sergii Telenyk Grzegorz Nowakowski Eduard Zharikov Jewhenii Vovk Department of Theoretical Electrical Engineering and Computer Science Faculty of Electrical and Computer Engineering Cracow University of Technology Department of Automatic Control and Information Technology Faculty of Electrical and Computer Engineering Cracow University of Technology Department of Automation and Control in Technical Systems National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"

ISBN: (纸本)9781728140704

The problem of the rapid creation of effective web applications of one class using formal means is considered. A conceptual approach to its solution is offered based on an analysis of the peculiarities of the construction of web applications. Our approach is based on defining the standard web application architecture and selecting its components using formal methods in accordance with user requirements. A formal logical system is proposed that uses the design of web applications as a process of outputting a formula specified according to the needs of the user, which defines the schemes of execution of the modules of the system. An important feature of this approach is the ability to visualise the process of designing the system in 3D, which creates the conditions for effective interaction between developers and machine development tools.

关键词： Web-applications Application construction Business processes Mathematical logic web applications Mathematical logic conceptual User needs Developers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：