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

arXiv 2019年

作者： Agarwal, Anisha Dowsley, Rafael McKinney, Nicholas D. Wu, Dongrui Lin, Chin-Teng De Cock, Martine Nascimento, Anderson C.A. School of Engineering and Technology University of Washington TacomaWA98402 United States Department of Computer Science Bar-Ilan University Israel School of Engineering and Technology University of Washington TacomaWA98402 United States Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan China School of Software University of Technology Sydney Australia Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

Machine learning (ML) is revolutionizing research and industry. Many ML applications rely on the use of large amounts of personal data for training and inference. Among the most intimate exploited data sources is electroencephalogram (EEG) data, a kind of data that is so rich with information that application developers can easily gain knowledge beyond the professed scope from unprotected EEG signals, including passwords, ATM PINs, and other intimate data. The challenge we address is how to engage in meaningful ML with EEG data while protecting the privacy of users. Hence, we propose cryptographic protocols based on Secure Multiparty Computation (SMC) to perform linear regression over EEG signals from many users in a fully privacy-preserving (PP) fashion, i.e. such that each individual's EEG signals are not revealed to anyone else. To illustrate the potential of our secure framework, we show how it allows estimating the drowsiness of drivers from their EEG signals as would be possible in the unencrypted case, and at a very reasonable computational cost. Our solution is the first application of commodity-based SMC to EEG data, as well as the largest documented experiment of secret sharing based SMC in general, namely with 15 players involved in all the computations. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Interdependent order allocation in the two-echelon supply chain using agent-based negotiation 36

Interdependent order allocation in the two-echelon supply ch...

引用

第36届中国控制会议

作者： Jian Wang Huimin Miao System Engineering Institute School of AutomationHuazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Hubei Province Key Laboratory of Systems Science in Metallurgical Process Wuhan University of Science and Technology

ISBN: (纸本)9781538629185

Nowadays,many researches study the negotiation-based order allocation problem in the supply chain environment,aiming to improve the efficiency of the allocation and the profits of the supply chain *** competition and cooperation in supplier’s side are mainly addressed because of independent *** this paper,we analyze an interdependent order allocation problem in a two-echelon supply *** supply chain consists of a manufacturer echelon and a supplier *** to the interdependence,both the competition and cooperation in the manufacturer echelon are *** agent-based negotiation algorithm is developed to support the order allocation process and the conflicts *** show in experiments that orders under various supply chain contexts can be successfully allocated through the algorithm.

关键词： Supply chain system order allocation agent-based negotiation

来源：评论

学校读者我要写书评

暂无评论

A Geometric Approach to Second-Order Consensus of Heterogeneous Networked Systems

引用

IEEE Transactions on Cybernetics 2018年 2018 Jan 9页

作者： Su, Housheng Ye, Yanyan Chen, Xia He, Haibo School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan 430074 China. China China Department of Electrical Computer and Biomedical Engineering University of Rhode Island Kingston RI 02881 USA. United States

This paper investigates second-order consensus of networked systems with heterogeneous intrinsic nonlinear dynamics via a geometrical method, in which the nonlinear dynamics are governed by both velocity and position. First, two necessary conditions are deduced for the existence of consensus solutions by analyzing the inherent nonlinear dynamics of isolated nodes. Then a closed invariant set is constructed via geometrical methods. The nonempty of the set implies the existence of consensus solution. Assuming that the primary and the second dimension about the above invariant set are the same linear subspace, the system can be divided into two simple subsystems through a linear transformation. In addition, some sufficient conditions are proposed for reaching the global consensus based on matrix theory and Lyapunov method. Finally, numerical simulation results are provided to illustrate the validity of theoretical analysis. IEEE

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Optimizing pinning control of complex dynamical networks based on spectral properties of grounded laplacian matrices

arXiv

引用

arXiv 2018年

作者： Liu, Hui Xu, Xuanhong Lu, Jun-An Chen, Guanrong Zeng, Zhigang School of Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan430074 China School of Mathematics and Statistics Wuhan University Wuhan430072 China Department of Electronic Engineering City University of Hong Kong Hong Kong Hong Kong

Pinning control of a complex network aims at forcing the states of all nodes to track an external signal by controlling a small number of nodes in the network. In this paper, an algebraic graph-theoretic condition is introduced to optimize pinning control. When individual node dynamics and coupling strength of the network are given, the effectiveness of pinning scheme can be measured by the smallest eigenvalue of the grounded Laplacian matrix obtained by deleting the rows and columns corresponding to the pinned nodes from the Laplacian matrix of the network. The larger this smallest eigenvalue, the more effective the pinning scheme. Spectral properties of the smallest eigenvalue are analyzed using the network topology information, including the spectrum of the network Laplacian matrix, the minimal degree of uncontrolled nodes, the number of edges between the controlled node set and the uncontrolled node set, etc. The identified properties are shown effective for optimizing the pinning control strategy, as demonstrated by illustrative examples. Finally, for both scale-free and small-world networks, in order to maximize their corresponding smallest eigenvalues, it is better to pin the nodes with large degrees when the percentage of pinned nodes is relatively small, while it is better to pin nodes with small degrees when the percentage is relatively large. This surprising phenomenon can be explained by one of the theorems established. Copyright © 2018, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Cell-Like P systems with symport/antiport rules and promoters 12th

Cell-Like P systems with symport/antiport rules and promoter...

引用

12th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2017

作者： Jiang, Suxia Wang, Yanfeng Xu, Jinbang Xu, Fei School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology WuhanHubei430074 China

ISBN: (纸本)9789811071782

Cell-like P systems with symport/antiport rules (CSA P systems, for short) are a class of computational models in membrane computing, inspired by the way of transmembrane transport of substances through membrane channels between neighboring regions in a cell. In this work, we propose a variant of CSA P systems called cell-like P systems with symport/antiport rules and promoters (CSAp P systems, for short), where symport/antiport rules are regulated by multisets of promoters, and the computation power of CSAp P systems is investigated. Specifically, it is proved that CSAp P systems working in the maximally parallel mode, having any large number of membranes and promoters and using only symport rules of length 1 or antiport rules of length 2, are able to compute only finite sets of non-negative integers. Furthermore, we show that CSAp P systems with two membranes working in a sequential mode when having at most two promoters and using only symport rules of length 2, or having at most one promoter and using symport rules of length 1 and antiport rules of length 2, are Turing universal. © Springer Nature Singapore Pte Ltd 2017.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

Region stability analysis and tracking control of memristive recurrent neural network

引用

Neural networks : the official journal of the International Neural Network Society 2018年 98卷 51-58页

作者： Gang Bao Zhigang Zeng Yanjun Shen Hubei Key Laboratory of Cascaded Hydropower Stations Operation & Control Electrical Engineering & New Energy China Three Gorges University Yichang 443002 China. Electronic address: ctgugangbao@***. China School of Automation Huazhong University of Science and Technology Wuhan Hubei 430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan 430074 China. Electronic address: zgzeng@***. Hubei Key Laboratory of Cascaded Hydropower Stations Operation & Control Electrical Engineering & New Energy China Three Gorges University Yichang 443002 China. Electronic address: shenyj@***.

Memristor is firstly postulated by Leon Chua and realized by Hewlett-Packard (HP) laboratory. Research results show that memristor can be used to simulate the synapses of neurons. This paper presents a class of recurrent neural network with HP memristors. Firstly, it shows that memristive recurrent neural network has more compound dynamics than the traditional recurrent neural network by simulations. Then it derives that n dimensional memristive recurrent neural network is composed of [Formula: see text] sub neural networks which do not have a common equilibrium point. By designing the tracking controller, it can make memristive neural network being convergent to the desired sub neural network. At last, two numerical examples are given to verify the validity of our result.

关键词： Memristive neural network Memristor Stability

来源：评论

学校读者我要写书评

暂无评论

Vehicle re-identification by fusing multiple deep neural networks

Vehicle re-identification by fusing multiple deep neural net...

引用

Workshops on image processing Theory, Tools and Applications, IPTA

作者： Chao Cui Nong Sang Changxin Gao Lei Zou Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan China

Vehicle re-identification has become a fundamental task because of the growing explosion in the use of surveillance cameras in public security. The most widely used solution is based on license plate verification. But when facing the vehicle without a license, deck cars and other license plate information error or missing situation, vehicle searching is still a challenging problem. This paper proposed a vehicle re-identification method based on deep learning which exploit a two-branch Multi-DNN Fusion Siamese Neural Network (MFSNN) to fuses the classification outputs of color, model and pasted marks on the windshield and map them into a Euclidean space where distance can be directly used to measure the similarity of arbitrary two vehicles. In order to achieve this goal, we present a method of vehicle color identification based on Alex net, a method of vehicle model identification based on VGG net, a method of pasted marks detection and identification based on Faster R-CNN. We evaluate our MFSNN method on VehicleID dataset and in the experiment. Experiment results show that our method can achieve promising results.

关键词： image color analysis Feature extraction Neural networks Task analysis Licenses Automobiles Automotive components

来源：评论

学校读者我要写书评

暂无评论

Hybrid Consensus-based Algorithm for Distributed Economic Dispatch Problem

引用

IFAC-PapersOnLine 2017年第1期50卷 177-182页

作者： Liu X.-K. Wang Y.-W. Yan H. Wang X. Hu X. School of Automation Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education China Key Laboratory of Advanced Control Optimization for Chemical Process of Ministry of Education China School of Information Science and Engineering East China University of Science and Technology 130 Meilong Road Shanghai 200237 China

Economic dispatch is one of the fundamental problems in the power system research. The existing algorithms are either discrete iterative algorithms or continuous-time dynamical algorithms. By virtue of the hybrid techniques, a hybrid consensus-based algorithm is proposed in this paper, which consists of a finite-time continuous-time algorithm and a discrete-time interacted scheme. Moreover, inspired by the cluster synchronization and the benefit of the projection operator, a supervised strategy is carried out to ensure that each generator unit will work within its power generation constraint. For a better understanding of the supervised hybrid distributed algorithm, the detailed pseudo-code is presented. Finally, a numerical example is given to illustrate the effectiveness of the algorithm. © 2017

关键词： consensus protocol distributed optimization economic dispatch hybrid system smart grid

来源：评论

学校读者我要写书评

暂无评论

Robust Output Synchronization of Lower Triangular Multi-Agents Via Sampled-Data control

引用

IFAC-PapersOnLine 2017年第1期50卷 2415-2420页

作者： Chen X. Zhu L. Chai L. Zhang H.-T. School of Information Science and Engineering Wuhan University of Science and Technology Wuhan 430081 China Department of Electric and Electronic Engineering University of Hong Kong Hong Kong Key Laboratory of Image Processing and Intelligent Control School of Automation and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan 430074 China

This paper establishes a general sampled-data framework for robust output synchronization of nonlinear heterogeneous multi-agent system in the lower-triangular form. Inspired by our previous work, this problem can be solved in a two-step manner: (1) sampled-data perturbed consensus, and (2) sampled-data perturbed output regulation. These two steps are coupled by a small gain condition which must be satisfied to ensure the robust output synchronization is achieved. We will first show that the sampling conditions on accomplishing sampled-data perturbed consensus and perturbed output regulation separately. In addition, we strengthen our previous small gain condition to incorporate the sampling effort. The sampled-data synchronization controller can be designed provided that the sampling condition satisfies some additional condition. © 2017

关键词： Multi-agent systems Nonlinear systems Output regulation Sampled-data Synchronization

来源：评论

学校读者我要写书评

暂无评论

Hierarchical P systems with randomized right-hand sides of rules 18th

Hierarchical P systems with randomized right-hand sides of r...

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Alhazov, Artiom Freund, Rudolf Ivanov, Sergiu Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5 Chişinău2028 Moldova Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Wuhan430074 China Faculty of Informatics TU Wien Favoritenstraße 9–11 Vienna1040 Austria LACL Université Paris Est – Créteil Val de Marne 61 av. Général de Gaulle Créteil94010 France TIMC-IMAG/DyCTiM Faculty of Medicine of Grenoble 5 avenue du Grand Sablon La Tronche38700 France

ISBN: (纸本)9783319733586

P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. © 2018, Springer International Publishing AG.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：