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

Covariance free incremental principal component analysis with exact mean update

Journal of Computational Information systems 2013年第16期9卷 6703-6710页

作者： Zeng, Xueqiang Li, Guozheng The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Computer Center Nanchang University Nanchang 330029 China Department of Control Science and Engineering Tongji University Shanghai 201804 China

Incremental feature extraction is an essential data preprocessing technique for large-scale and streaming data mining. Among various covariance matrix-free Incremental Principal Component Analysis (IPCA) methods, Candid Covariance-free Incremental Principal Component Analysis (CCIPCA) is a state-of-the art algorithm. Since the training samples are required to be centred, CCIPCA applies an approximate centric alignment on the input data, where only the current sample is correctly centred and all historical data are not updated properly. In this paper, we propose a novel centred incremental principal component analysis algorithm with exact historical mean update, where not only the current sample is centred, but also all historical data are updated by the current mean correctly. Compared to CCIPCA, the proposed method converges more quickly, and the performance improvement is especially obvious when the data's inherent covariance is not stable. The experiments on real streaming dataset show that the proposed method is much superior to CCIPCA in convergence speed. © 2013 Binary Information Press.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

On Mobilizing Processes of Cyber Movement Organizations

引用

IFAC Proceedings Volumes 2014年第3期47卷 9853-9857页

作者： Tao Wang Zhong Liu Kainan Cui Jie Zhang Fei-Yue Wang C.L. Philip Chen College of Information System and Management National University of Defense Technology Changsha 410073 China The State Key Laboratory of Management and Control for Complex Systems Chinese Academy of Sciences Beijing 100190 China The Research Center for Computational Experiments and Parallel Systems Technology National University of Defense Technology Changsha 410073 China Department of Computer and Information Science Science and Technology University of Macau Macau China

—Cyber Movement Organization (CMO) is a special kind of social movement organization on the Web. In this paper, we propose a model to simulate the mobilizing process of CMO, which consists of the individual unit, organization unit, and the mobilizing mechanisms. The mobilizing mechanisms has three sub-mechanisms: the participation mechanism, the choice mechanism, and the inviting mechanism. A dataset of more than two million “human flesh search” related microblogs is used to validate the model. Empirical results show that our model can capture the key features of the real-world mobilizing process.

关键词： Cyber Movement Organizations (CMO) Social Network Analysis Human Flesh Search (HFS) Simulation Social Movement Organizations Resource Mobilization

来源：评论

学校读者我要写书评

暂无评论

Enhancing the Effectiveness of Fungicides by Optimizing Their Combinations

Enhancing the Effectiveness of Fungicides by Optimizing Thei...

引用

第26届中国控制与决策会议

作者： Xiang Wang Jia Ma Xiaowei Li Xiaodong Zhao Zongli Lin Jie Chen Zhifeng Shao Department of Automation and Key Laboratory of System Control and Information Processing of the Ministry of EducationShanghai Jiao Tong University Department of Resource and Environmental Science School of Agriculture and BiologyShanghai Jiao Tong University School of Biomedical Engineering Shanghai Jiao Tong University Charles L.Brown Department of Electrical and Computer Engineering University of Virginia

In controlling biological diseases, it is often more potent to use a combination of agents than using individual ones. However, the number of possible combinations increases exponentially with the number of agents and their concentrations. It is prohibitive to search for effective agent combinations by trial and error as biological systems are complex and their responses to agents are often a slow process. This motivates to build a suitable model to describe the biological systems and help reduce the number of experiments. In this paper, we consider the use of fungicides to inhibit Bipolarismaydis and construct models that describe the responses to fungicide combinations. Three data-driven modeling methods, the polynomial regression, the artificial neural network and the support vector regression, are compared based on the experimental data of the inhibition rates of the southern corn leaf blight with different fungicide combinations. The analysis of the results demonstrates that the support vector regression is best suited to the construction of the response model in terms of achieving better prediction with fewer experiments.

关键词： agent combinations,complex system,data-driven model,polynomial regression,artificial neural network,support vector regression

来源：评论

学校读者我要写书评

暂无评论

An octree-based proxy for collision detection in large-scale particle systems

引用

Science China(Information Sciences) 2013年第1期56卷 55-64页

作者： FAN WenShan WANG Bin PAUL Jean-Claude SUN JiaGuang School of Software Tsinghua University Beijing Aerospace Control Center Department of Computer Science and Technology Tsinghua University Key Laboratory for Information System Security Ministry of Education of China Tsinghua National Laboratory for Information Science and Technology Institut National de Recherche en Informatique et en Automatique(INRIA)

Particle systems are important building block for simulating vivid and detail-rich effects in virtual *** of the most difficult aspects of particle systems has been detecting collisions between particles and mesh *** to the huge computation,a variety of proxy-based approaches have been proposed recently to perform visually correct ***,all either limit the complexity of the scene,fail to guarantee non-penetration,or are too slow for real-time use with many *** this paper,we propose a new octree-based proxy for colliding particles with meshes on the *** approach works by subdividing the scene mesh with an octree in which each leaf node associates with a representative normal corresponding to the normals of the triangles that intersect the *** present a view-visible method,which is suitable for both closed and non-closed models,to label the empty leaf nodes adjacent to nonempty ones with appropriate back/front property,allowing particles to collide with both sides of the scene *** show how collisions can be performed robustly on this proxy structure in place of the original mesh,and describe an extension that allows for fast traversal of the octree structure on the *** experiments show that the proposed method is fast enough for real-time performance with millions of particles interacting with complex scenes.

关键词： particle systems collision detection octree-based proxy GPU

来源：评论

学校读者我要写书评

暂无评论

Min-max MPC for LPV systems subject to Actuator Saturation by a Saturation-dependent Lyapunov Function

Min-max MPC for LPV Systems subject to Actuator Saturation b...

引用

第三十二届中国控制会议

作者： ZHANG Langwen WANG Jingcheng LI Kang Department of Automation Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of China School of Electronics Electrical Engineering and Computer Science Queen's University Belfast

ISBN: (纸本)9781479900305

In this paper,we present a model predictive control algorithm for input-saturated systems by a saturation-dependent Lyapunov function *** saturation-dependent Lyapunov function captures the real-time information on the severity of saturation and thus leads to less conservative results in controller design.A set invariance condition for the systems with input saturation is presented.A min-max MPC algorithm is proposed for the linear parameter-varying(LPV) systems based on the invariant *** MPC controller is determined by solving a linear matrix inequality(LMI) optimization *** example demonstrates the effectiveness of the proposed algorithm.

关键词： Model Predictive control Linear parameter-varying Actuator saturation Saturation-dependent

来源：评论

学校读者我要写书评

暂无评论

Robust H∞ control with partly quantized information

Robust H∞ control with partly quantized information

引用

第三十二届中国控制会议

作者： GE Yang WANG Jingcheng LI Kang Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information ProcessingMinistry of Education of China School of Electronics Electrical Engineering and Computer ScienceQueen's University Belfast

ISBN: (纸本)9781479900305

This paper is concerned with the stability and stabilizability problems of networked control systems（NCSs） with partly quantized *** precisely,the remote state variables transported from other sub-systems experience quantization errors,while the local state variables do *** consideration is much more natural in NCSs due to the distributive nature of *** errors are represented as convex poly-topic *** on the Lyapunov-Krasovskii （L-K） functional approach,sufficient conditions for the existence of a quantized robust Hstate feedback controller for NCSs are *** conditions are obtained in terms of bilinear matrix inequalities（BMIs）.Furthermore,a cone complementarity algorithm is utilized to convert these BMIs into a convex optimization ***,a simulation example is provided to demonstrate the efficiency of proposed theorems.

关键词： robust control quantized feedback control partly quantized information

来源：评论

学校读者我要写书评

暂无评论

Evolution and maintenance of cooperation via inheritance of neighborhood relationship

引用

Chinese Science Bulletin 2013年第28期58卷 3491-3498页

作者： TAN ShaoLin Lü JinHu YU XingHuo HILL David John The Key Laboratory of System and Control Institute of Systems ScienceAcademy of Mathematics and Systems ScienceChinese Academy of Sciences School of Electrical and Computer Engineering RMIT University Department of Electrical and Electronic Engineering The University of Hong Kong School of Electrical and Information Engineering University of Sydney

Cooperative behaviors are ubiquitous in nature and human *** is very important to understand the internal mechanism of emergence and maintenance of *** we know now,the offsprings inherit not only the phenotype but also the neighborhood relationship of their *** recent research results show that the interactions among individuals facilitate survival of cooperation through network reciprocity of clustering *** paper aims at introducing an inheritance mechanism of neighborhood relationship to explore the evolution of *** detail,a mathematical model is proposed to characterize the evolutionary process with the above inheritance *** analysis and numerical simulations indicate that high-level cooperation can emerge and be maintained for a wide variety of cost-to-benefit ratios,even if mutation happens during the evolving process.

关键词：合作机制邻里关系维护演变进化过程人类社会遗传机制数学模型

来源：评论

学校读者我要写书评

暂无评论

An extension of distributed dynamic description logics for the representation of heterogeneous mappings

Journal of Software

引用

Journal of Software 2013年第1期8卷 243-250页

作者： Wang, Zhuxiao Guo, Jing Chen, Fei Wu, Kehe Wang, Peng School of Control and Computer Engineering State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University 102206 Beijing China National Computer Network Emergency Response Technical Team Coordination Center of China 100029 Beijing China School of Control and Computer Engineering North China Electric Power University 102206 Beijing China Institute of Information Engineering Chinese Academy of Sciences 100195 Beijing China

As a family of dynamic description logics, DDL(X) is constructed by embracing actions into the description logic X, where X represents well-studied description logics ranging from the ALC to the SHOIQ. To efficiently support automated interoperability between ontology-based information systems in distributed environments, we have to design an expressive mapping language to semantically understand resources from remote and heterogeneous systems. Distributed Dynamic Description Logics D3L(X) is a natural generalization of the DDL(X) framework, which is designed to model the distributed dynamically-changing knowledge repositories interconnected by semantic mappings and to accomplish reasoning in distributed, heterogeneous environments. In this paper, we propose an extension of Distributed Dynamic Description Logics D3L(X) and investigate the reasoning mechanisms in D3L(X). © 2013 ACADEMY PUBLISHER.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Erratum to “Consensus seeking over directed networks with limited information communication” [Automatica 49 (2) (2013) 610–618]

引用

Automatica 2014年第9期50卷 2430-2431页

作者： Dequan Li Qipeng Liu Xiaofan Wang Zongli Lin School of Science Anhui University of Science and Technology Huainan 232001 Anhui Province PR China Department of Automation Shanghai Jiao Tong University Shanghai 200240 PR China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 PR China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia P.O. Box 400743 Charlottesville VA 22904-4743 USA

来源：评论

学校读者我要写书评

暂无评论

Minkowski sum modeling of polyhedra based on VRML

引用

ICIC Express Letters 2013年第2期7卷 455-460页

作者： Zhang, Jianfei Guo, Xijuan Geng, Qingjia Information Science and Engineering College Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China Computer and Control Engineering College Qiqihar University No. 42 Wenhua Street Qiqihar 161006 China

On the basis of the introduction to basic methods of the geometry modeling based on virtual reality modeling language (VRML) and the concepts of Minkowski sum computation of polyhedra, we present a method of Minkowski sum computation and three dimensional modeling based on VRML. The method can simplify Minkowski sum computation of general polyhedra, and experimental results indicate that this method can calculate Minkowski sum of general polyhedra much faster and realize three-dimensional representation more accurately. This method can provide important technical references for Minkowski sum visualization of polyhedra. © 2013 ISSN 1881-803X.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：