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

arXiv 2020年

作者： Cai, Jia Lv, Kexin Huo, Junyi Huang, Xiaolin Yang, Jie School of Statistics and Mathematics Guangdong University of Finance & Economics Big Data and Educational Statistics Application Laboratory 21 Chisha Road Guangzhou Guangdong510320 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing 800 Dongchuan Road Shanghai200240 China School of Electronics and Computer Science University of Southampton University Road SouthamptonSO17 1BJ United Kingdom

Sparse canonical correlation analysis (CCA) is a useful statistical tool to detect latent information with sparse structures. However, sparse CCA works only for two datasets, i.e., there are only two views or two distinct objects. To overcome this limitation, in this paper, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures. Moreover, the introduced sparsity could be considered as Laplace prior on the canonical variates. Specifically, we convert the GCCA into a linear system of equations and impose 1 minimization penalty for sparsity pursuit. This results in a nonconvex problem on Stiefel manifold, which is difficult to solve. Motivated by Boyd’s consensus problem, an algorithm based on distributed alternating iteration approach is developed and theoretical consistency analysis is investigated elaborately under mild conditions. Experiments on several synthetic and real world datasets demonstrate the effectiveness of the proposed algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

Predefined-time terminal sliding mode control of robot manipulators

arXiv

引用

arXiv 2020年

作者： Liang, Chang-Duo Ge, Ming-Feng Liu, Zhi-Wei Wang, Yan-Wu Karimi, Hamid Reza School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China Department of Mechanical Engineering Politecnico di Milano Milan20156 Italy

In this paper, we present a new terminal sliding mode control to achieve predefined-time stability of robot manipulators. The proposed control is developed based on a novel predefined-time terminal sliding mode (PTSM) surface, on which the states are forced to reach the origin in a predefined time, i.e., the settling time is independent to the initial condition and can be explicitly user-defined via adjusting some specific parameters called the predefined-time parameters. It is also demonstrated that the proposed control can provide satisfactory steady-state performance in the case of both external disturbances and parametric uncertainties. Besides, we present a formal systemic analysis method to derive the sufficient conditions for guaranteeing the predefined-time convergence of the closed-loop system. Finally, the effectiveness and performance of the presented control scheme are illustrated through both theoretical comparisons and numerical simulations. Copyright © 2020, The Authors. All rights reserved.

关键词： Sliding mode control

来源：评论

学校读者我要写书评

暂无评论

Reaching Non-Negative Edge Consensus of Networked Dynamical Systems

引用

IEEE TRANSACTIONS ON CYBERNETICS 2018年第9期48卷 2712-2722页

作者： Wang, Xiao Ling Su, Housheng Chen, Michael Z. Q. Wang, Xiao Fan Chen, Guanrong College of Automation Nanjing University of Posts and Telecommunications Nanjing China School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Automation Nanjing University of Science and Technology Nanjing China Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Department of Electronic Engineering City University of Hong Kong Hong Kong

In this paper, the problem of non-negative edge consensus of undirected networked linear time-invariant systems is addressed by associating each edge of the network with a state variable, for which a distributed algorithm is constructed. Sufficient conditions referring only to the number of edges are derived for non-negative edge consensus of the networked systems. Subsequently, the linear programming method and a low-gain feedback technique are introduced to simplify the design of the feedback gain matrix for achieving the non-negative edge consensus. It is found that the low-gain feedback technique has a good effect on the non-negative edge consensus of the networked systems subject to input saturation. Numerical simulations are presented to verify the effectiveness of the theoretical results.

关键词： Distributed algorithm line graph low-gain feedback networked system non-negative edge consensus

来源：评论

学校读者我要写书评

暂无评论

Multiple phase transitions in networks of directed networks

引用

Physical Review E 2019年第1期99卷 012312-012312页

作者： Xueming Liu Linqiang Pan H. Eugene Stanley Jianxi Gao Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan 430074 Hubei China Department of Physics Center for Polymer Studies Boston University Boston Massachusetts 02215 USA Department of Computer Science Rensselaer Polytechnic Institute Troy New York 12180 USA

The robustness in real-world complex systems with dependency connectivities differs from that in isolated networks. Although most complex network research has focused on interdependent undirected systems, many real-world networks—such as gene regulatory networks and traffic networks—are directed. We thus develop an analytical framework for examining the robustness of networks made up of directed networks of differing topologies. We use it to predict the phase transitions that occur during node failures and to generate the phase diagrams of a number of different systems, including treelike and random regular (RR) networks of directed Erdős-Rényi (ER) networks and scale-free networks. We find that the the phase transition and phase diagram of networks of directed networks differ from those of networks of undirected networks. For example, the RR networks of directed ER networks show a hybrid phase transition that does not occur in networks of undirected ER networks. In addition, system robustness is affected by network topology in networks of directed networks. As coupling strength q increases, treelike networks of directed ER networks change from a second-order phase transition to a first-order phase transition, and RR networks of directed ER networks change from a second-order phase transition to a hybrid phase transition, then to a first-order phase transition, and finally to a region of collapse. We also find that heterogenous network systems are more robust than homogeneous network systems. We note that there are multiple phase transitions and triple points in the phase diagram of RR networks of directed networks and this helps us understand how to increase network robustness when designing interdependent infrastructure systems.

关键词： Attacks on networks Cascades Continuous phase transition Discontinuous phase transition Network phase transitions Percolation phase transition Random attacks Robustness Topological phase transition

来源：评论

学校读者我要写书评

暂无评论

DNA Strand Displacement Based on Nicking Enzyme for DNA Logic Circuits 1

引用

13th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2018

作者： Wang, Gaiying Wang, Zhiyu Yan, Xiaoshan Liu, Xiangrong School of Information Science and Technology Xiamen University XiamenFujian361005 China Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China

ISBN: (数字)9789811328268

ISBN: (纸本)9789811328251

DNA strand displacement is widely used in the construction of DNA molecule computational models. In this work, nicking enzyme is used as the input of the logic calculation model for it can cut one strand of a double-stranded DNA at a specific recognition nucleotide sequences known as a restriction site. Based on this, a variety of logic gates are designed and implemented, and a multi-person voting circuit is constructed. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Enzymes

来源：评论

学校读者我要写书评

暂无评论

Convolutional ordinal regression forest for image ordinal estimation

arXiv

引用

arXiv 2020年

作者： Zhu, Haiping Shan, Hongming Zhang, Yuheng Che, Lingfu Xu, Xiaoyang Zhang, Junping Shi, Jianbo Wang, Fei-Yue The Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The Institute of Science and Technology for Brain-inspired Intelligence MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China The Shanghai Center for Brain Science and Brain-inspired Technology Shanghai201210 China The GRASP Laboratory University of Pennsylvania PhiladelphiaPA United States The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The Institute of Systems Engineering Macau University of Science and Technology 999078 China The University of Chinese Academy of Sciences Beijing100049 China

image ordinal estimation is to predict the ordinal label of a given image, which can be categorized as an ordinal regression problem. Recent methods formulate an ordinal regression problem as a series of binary classification problems. Such methods cannot ensure that the global ordinal relationship is preserved since the relationships among different binary classifiers are neglected. We propose a novel ordinal regression approach, termed Convolutional Ordinal Regression Forest or CORF, for image ordinal estimation, which can integrate ordinal regression and differentiable decision trees with a convolutional neural network for obtaining precise and stable global ordinal relationships. The advantages of the proposed CORF are twofold. First, instead of learning a series of binary classifiers independently, the proposed method aims at learning an ordinal distribution for ordinal regression by optimizing those binary classifiers simultaneously. Second, the differentiable decision trees in the proposed CORF can be trained together with the ordinal distribution in an end-to-end manner. The effectiveness of the proposed CORF is verified on two image ordinal estimation tasks, i.e. facial age estimation and image aesthetic assessment, showing significant improvements and better stability over the state-of-the-art ordinal regression methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

EEG-Based Brain-Computer Interfaces Are Vulnerable to Backdoor Attacks

arXiv

引用

arXiv 2020年

作者： Meng, Lubin Huang, Jian Zeng, Zhigang Jiang, Xue Yu, Shan Jung, Tzyy-Ping Lin, Chin-Teng Chavarriaga, Ricardo 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 Wuhan China Brainnetome Center National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China La Jolla CA United States Center for Advanced Neurological Engineering Institute of Engineering in Medicine Ucsd La Jolla CA United States Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Australia Zhaw DataLab Zürich University of Applied Sciences Winterthur8401 Switzerland

Research and development of electroencephalogram (EEG) based brain-computer interfaces (BCIs) have advanced rapidly, partly due to deeper understanding of the brain and wide adoption of sophisticated machine learning approaches for decoding the EEG signals. However, recent studies have shown that machine learning algorithms are vulnerable to adversarial attacks. This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is implementable in practice and has never been considered before. One can create dangerous backdoors in the machine learning model by injecting poisoning samples into the training set. Test samples with the backdoor key will then be classified into the target class specified by the attacker. What most distinguishes our approach from previous ones is that the backdoor key does not need to be synchronized with the EEG trials, making it very easy to implement. The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs and calling for urgent attention to address it. Copyright © 2020, The Authors. All rights reserved.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Sparse Kernel Regression with Coefficient-based `q−regularization

引用

Journal of Machine Learning Research 2019年 20卷

作者： Shi, Lei Huang, Xiaolin Feng, Yunlong Suykens, Johan A.K. Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai China Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing Shanghai China Department of Mathematics and Statistics State University of New York at Albany New York United States Department of Electrical Engineering ESAT-STADIUS KU Leuven Kasteelpark Arenberg 10 LeuvenB-3001 Belgium

In this paper, we consider the `q−regularized kernel regression with 0 q−penalty term over a linear span of features generated by a kernel function. We study the asymptotic behavior of the algorithm under the framework of learning theory. The contribution of this paper is two-fold. First, we derive a tight bound on the `2−empirical covering numbers of the related function space involved in the error analysis. Based on this result, we obtain the convergence rates for the `1−regularized kernel regression which is the best so far. Second, for the case 0 ©c 2019 Lei Shi, Xiaolin Huang, Yunlong Feng, and Johan A.K. Suykens.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Tissue P systems with rule production/removal 18th

Tissue P systems with rule production/removal

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Pan, Linqiang Song, Bosheng Zhang, Gexiang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Robotics Research Center and Key Laboratory of Fluid and Power Machinery Xihua University Chengdu610039 China

ISBN: (纸本)9783319733586

Tissue P systems are computational models inspired by the way of biochemical substance movement/exchange between two cells or between a cell and the environment, where all communication (symport/antiport) rules used in a system are initially set up and keep unchanged during any computation. In this work, a variant of tissue P systems, called tissue P systems with rule production/removal (abbreviated as TRPR P systems) is considered, where rules in a system are dynamically changed during a computation, that is, at any computation step new rules can be produced and some existing rules can be removed. The computation power of TRPR P systems is investigated. It is proved that Turing universality is achieved for TRPR P systems with one cell, and using symport rules of length at most 1, antiport rules of length at most 2 or symport rules of length at most 2 and working in a maximally parallel manner. We further show that TRPR P systems with two cells, using symport rules of length at most 1, and working in a flat maximally parallel manner, are Turing universal. © 2018, Springer International Publishing AG.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

MIME-KNN: Improve KNN Classifier Performance Include Classification Accuracy and Time Consumption

MIME-KNN: Improve KNN Classifier Performance Include Classif...

引用

2018 International Conference on Computer Science and Software Engineering (CSSE 2018)

作者： Taizhang Shang Xiang Xia Jun Zheng School of Automation Huazhong University of Science and Technology (HUST) Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education

The K Nearest Neighbor(KNN) classifier has been widely used in the applications of data mining and machine learning, because of its simple implementation and distinguished performance. However, because the distance between all training samples and test samples have to be calculated, when there are too many samples or samples have huge features dimensionality, the time complexity and space complexity are high. The paper proposes a KNN algorithm with the minimum intra-class distance and the maximum extra-class distance(MIME-KNN). By finding a transformation matrix, the algorithm minimizes the intra-class distance and maximizes the distance between classes, which can improve the classification performance of traditional KNN algorithm. At the same time, the algorithm will also reduce the dimensionality of the samples to achieve the purpose of reducing time and space complexity. Experimental results show that the MIME-KNN work well in practical.

关键词： MIME-KNN Improve KNN Classifier Performance Include Classification Accuracy and Time Consumption

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：