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

A NSGA-II with alternating direction method of multipliers mutation for solving multiobjective robust principal component analysis problem

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3722-3733页

作者： Yuan, Weitao Liang, Xiaodan Chen, Hanning Na, Lin Zou, Tao School of Computer Science and Software Engineering Tianjin Polytechnic University Tanjin300387 China Beijing Shenzhou Aerospace Software Technology Company Limited Beijing110000 China Laboratory of Information Service and Intelligent Control Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China

Robust Principal Component Analysis (RPCA), which is a popular parsimony model, is becoming increasingly important for researchers to do data analysis and prediction. The RPCA formulation is made of two components: sparse penalty and low rank penalty. These two competing terms are balanced with one parameter, which is essential for the effectiveness of RPCA. However, in real-world applications, the lack of data adaptive methods for choosing the right parameter hinders the popularization of RPCA. In this work, RPCA is generalized to a multiobjective optimization problem without any balancing parameter. The new model is named as Multiobjective Robust Principal Component Analysis (MRPCA). We aim to solve MRPCA via Evolutionary Algorithm. To the best knowledge of authors, this is the first attempt to use evolutionary algorithm to solve RPCA problem, which is a high dimensional convex optimization problem. Specifically, one of the popular evolutionary algorithm, NSGA-II, is tested on MRPCA problem. The curse of dimensionality is observed when the dimension of MRPCA problem increases. To handle this dimensionality problem, we introduce a novel mutation, termed as Alternating Direction Method of Multipliers mutation (ADMM mutation), that works well in high dimensional decision space. Numerical experiments show that this modified NSGA-II, which converges much faster than the standard one, can deal with the curse of dimensionality well. Furthermore, numerical image reconstruction test confirms that the reconstruction performance of our modified NSGA-II is better than the traditional proximal algorithm, which is usually used to solve RPCA problem. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

High-efficient sequential approximate strategy for reliability-based robust design optimization

Journal of Mechanical Engineering Research and Developments

引用

Journal of Mechanical engineering Research and Developments 2016年第2期39卷 278-295页

作者： Lai, X.M. Lai, Q.F. Huang, H. Wang, C. Zhang, Y. Yan, L. Yang, J.H. Liao, S.R. College of Mechanical Engineering and Automation Huaqiao University Xiamen361021 China Key Laboratory of High Performance Complex Manufacturing Central South University Changsha410083 China College of Computer Science and Technology Huaqiao University Xiamen361021 China State Key Laboratory for Strength and Vibration of Mechanical Structures Xi'an Jiaotong University Xi'an710049 China

To solve reliability-based robust design optimization (RBRDO) problem in engineering practice, it requires repeated performance of actual complex computation-intensive model simulation within the nesting optimization. In order to improve the computation efficiency, this paper presents an improved formulation of the RBRDO, based on which the RBRDO problem is transformed into approximate sequential sub-optimization problems (ASSOP). In the outer optimization, a fast method to calculate the performance-measure-approach (PMA) functions in ASSOP is introduced, which only needs adaptive limited computation number of the actual simulation models. In the inner optimization, the PMAs in each sub-optimization problem are further expressed as the explicit functions of design vectors, which make each sub-optimization problem deterministic and accelerate the computation speed without performing the actual complex computation-intensive model simulation. Numerical examples shows that the above method is quite efficient since it can effectively reduce the computation number of the actual simulation model and the method itself is applicable to integrate into the existing commercial software such as finite element software. Hence, the method presented in this paper is of high application value to solve complex RBRDO problems in engineering practice.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

A method of QoS deviation monitoring for web services 27

A method of QoS deviation monitoring for web services

引用

27th Chinese Control and Decision Conference, CCDC 2015

作者： Chen, Bin-Bin Fu, Xiao-Dong Li, Liu Gao, Tian-Yu Jia, Ge Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming China Yunnan Provincial Key Laboratory of Computer Application Kunming China

ISBN: (纸本)9781479970179

Considering the fraudulent behavior of Quality of Service (QoS) for web services, a method to monitor the QoS deviation was proposed in this paper. Firstly, we used random variable to describe the uncertainty of QoS. Secondly, the divergence of QoS in different time periods was tested with Kolmogorov Smirnov (K-S) approach. Finally, we utilized stochastic dominance to judge the better one of them. Theoretical analysis and experimental data showed that the proposed method was reasonable and effective. © 2015 IEEE.

关键词： Kolmogorov Smirnov Quality of Service Stochastic Dominance Web Services

来源：评论

学校读者我要写书评

暂无评论

Finite-time chaotic control of unified hyperchaotic systems with multiple parameters

International Journal of Control and Automation

引用

International Journal of Control and automation 2015年第8期8卷 57-66页

作者： Chen, Chang-Zhong He, Ping Fan, Tao Jing, Chun-Guo School of Automation and Electronic Information Sichuan University of Science and Engineering Zigong China Department of Electromechanical Engineering Faculty of Science and Technology E11 University of Macau Avenida da Universidade Taipa China Artificial Intelligence Key Laboratory of Sichuan Province Sichuan University of Science and Engineering Zigong China School of Computer and Communication Engineering Northeastern University at Qinhuangdao Qinhuangdao China

This paper is concerned with finite-time chaos control of unified hyperchaotic systems with multiple parameters. Based on the finite-time stability theory in the cascade-connected systems, a nonlinear control law is presented to achieve finite-time chaos control. The controller is simple and easy to be constructed. Simulation results for Lorenz hyperchaotic system, Lü hyperchaotic system, Chen hyperchaotic system are provided to illustrate the effectiveness of the proposed scheme. © 2015 SERSC.

关键词： Chaotic systems

来源：评论

学校读者我要写书评

暂无评论

Picture array generation using flat splicing operation

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3568-3577页

作者： Pan, Linqiang Nagar, Atulya K. Subramanian, K.G. Song, Bosheng School of Electric and Information Engineering Zhengzhou University of Light Industry Zhengzhou Henan450002 China Department of Mathematics and Computer Science Faculty of Science Liverpool Hope University LiverpoolL16 9JD United Kingdom Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan Hubei430074 China

The operation of splicing on words was introduced by Tom Head while proposing a theoretical model of DNA recombination. Subsequent investigations on splicing on linear and circular strings of symbols have resulted in a number of theoretical properties. A different kind of splicing on two words, referred to as flat splicing, has been considered recently. This operation is extended to flat splicing on picture arrays, thus defining a new model of generation of digitized pictures, which is called as array flat splicing system (AFS). Results on the generative power of AFS in comparison with certain well-known picture array defining models and certain non-closure results are obtained. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Nanoscience

来源：评论

学校读者我要写书评

暂无评论

基于EMAT&ECT技术对轧制中厚板的厚度与表面缺陷的检测方法研究

基于EMAT&ECT技术对轧制中厚板的厚度与表面缺陷的检测方法研究

引用

2016远东无损检测新技术论坛

作者： Qi Ouyang Kaixin Qin Xinglan Zhang Zhi Niu Shuaicheng Hou Laboratory of advanced detection technology and Automation equipment College of Automation Chongqi College of Computer Science and Engineering Chongqing University of technology Chongqing 400050C

在中厚板轧制和中间冷却过程中,通过实时在线检测中厚板的厚度和表面缺陷,以进一步提高中厚板质量控制具有重大的研究意义。在本文中,一种新的电磁超声与涡流检测(EMAT&ECT)融合技术被提出,以用来对中厚板的厚度和表面缺陷进行三维... 详细信息

在中厚板轧制和中间冷却过程中,通过实时在线检测中厚板的厚度和表面缺陷,以进一步提高中厚板质量控制具有重大的研究意义。在本文中,一种新的电磁超声与涡流检测(EMAT&ECT)融合技术被提出,以用来对中厚板的厚度和表面缺陷进行三维成像研究。其中,EMAT主要用来对中厚板的厚度进行在线检测,而ECT主要用作表面缺陷检测。另外,我们设计了一种三维成像扫描方法主要用于对中厚板立体成像,其主要结合了EMAT和ECT技术的优缺点和工业轧制现场的需求。然后,本文对EMAT和ECT检测技术的测量原理与检测算法进行了阐释和推理。最后,通过仿真和实验进一步验证了EMAT&ECT技术在中厚板轧制与冷却过程中进行质量检测的适应性和可行性。

关键词：传感器融合三维成像 EMAT ECT 无损检测

来源：评论

学校读者我要写书评

暂无评论

Complex system optimization for economic emission load dispatch

Complex system optimization for economic emission load dispa...

引用

UKACC International Conference on Control (CONTROL)

作者： Haiping Ma Zhile Yang Pengcheng You Minrui Fei Department of Electrical Engineering Shaoxing University Shaoxing China Department of Control Zhejiang University Hangzhou China School of Electronics Electrical Engineering and Computer Science Queen's University Belfast Belfast UK Shanghai Key Laboratory of Power Station Automation Technology Shanghai University Shanghai China

This paper proposes a complex system optimization method to solve economic emission load dispatch. First, a real-world economic emission load dispatch is modeled as a complex system problem, and the optimization objectives include economic load dispatch, emission load dispatch and transmission network loss. Then a called BBO/complex method is introduced, which extends biogeography-based optimization to a multi-archipelago environment to suit the structure of complex systems. Finally, the proposed method is applied to the economic emission load dispatch, and the results show that it can obtain good performance for economic emission load dispatch studied in this paper, and it is a competitive algorithm for solving complex system optimization problem.

关键词： Complex systems Propagation losses Economics Power systems Optimization methods Linear programming

来源：评论

学校读者我要写书评

暂无评论

Fast approximate matching of binary codes with distinctive bits

引用

Frontiers of computer science 2015年第5期9卷 741-750页

作者： Chenggang Clarence YAN Hongtao XIE Bing ZHANG Yanping MA Qiong DAI Yizhi LIU Institute of Information Engineering Chinese Academy of Sciences National Engineering Laboratory for Information Security Technologies Beijing 100093 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Automation Tsinghua University Beijing 100083 China School of Physics Beijing Institute of Technology Beijing 100081 China School of Information Science and Engineering Ocean University of China Qingdao 266100 China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan 411201 China

Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which hierarchical clustering trees （HCT） are widely used. However, HCT select cluster centers randomly and build indexes with the entire binary code, this degrades search performance. In this paper, we first propose a new clustering algorithm, which chooses cluster centers on the basis of relative distances and uses a more homogeneous partition of the dataset than HCT has to build the hierarchical clustering trees. Then, we present an algorithm to compress binary codes by extracting distinctive bits according to the standard deviation of each bit. Consequently, a new index is proposed using compressed binary codes based on hierarchical decomposition of binary spaces. Experiments conducted on reference datasets and a dataset of one billion binary codes demonstrate the effectiveness and efficiency of our method.

关键词： binary codes approximate nearest neighbor search hierarchical clustering index

来源：评论

学校读者我要写书评

暂无评论

Online visual tracking using temporally coherent part cluster 15

Online visual tracking using temporally coherent part cluste...

引用

2015 15th IEEE Winter Conference on Applications of computer Vision, WACV 2015

作者： Li, Wenbo Wen, Longyin Chuah, Mooi Choo Zhang, Yi Lei, Zhen Li, Stan Z. Department of Computer Science and Engineering Lehigh University United States National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences China School of Computer Software Tianjin University China

ISBN: (纸本)9781479966820

Recent advances in visual tracking have focused on handling deformations and occlusions using the part-based appearance model. However, it remains a challenge to come up with a reliable target representation using local parts, and hence existing trackers continue to face drifting problems. To deal with this challenge, we propose a robust online model, formulating the tracking task as a problem of identifying Temporally Coherent Part (TCP) clusters. Specifically, we pose the TCP clusters identification task as a dense neighborhoods searching problem using a relational hyper graph in which the relationship among multiple temporal local parts is encoded as the affinity value of a hyper edge connecting them. Such high-order relations ships among multiple local parts across the temporal domain make our tracker more robust towards deformations and occlusions. Extensive experiments on various challenging video sequences demonstrate that our TCP-based method performs better than the state-of-the-art methods. © 2015 IEEE.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

A Survey of Blue-Noise Sampling and Its Applications

引用

Journal of computer science & Technology 2015年第3期30卷 439-452页

作者：严冬明郭建伟王斌张晓鹏 Peter Wonk Visual Computing Center King Abdullah University of Science and Technology Thuwal 23955-6900 Saudi Arabia National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing 100190 China School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Engineering Arizona State University Tempe AZ 85287 U.S.A.

In this paper, we survey recent approaches to blue-noise sampling and discuss their beneficial applications. We discuss the sampling algorithms that use points as sampling primitives and classify the sampling algorithms based on various aspects, e.g., the sampling domain and the type of algorithm. We demonstrate several well-known applications that can be improved by recent blue-noise sampling techniques, as well as some new applications such as dynamic sampling and blue-noise remeshing.

关键词： blue-noise sampling Poisson-disk sampling Lloyd relaxation rendering remeshing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：