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

A sequential learning algorithm for online constructing belief-rule-based systems

EXPERT SYSTEMS WITH APPLICATIONS 2010年第2期37卷 1790-1799页

作者： Zhou, Zhi-Jie Hu, Chang-Hua Yang, Jian-Bo Xu, Dong-Ling Chen, Mao-Yin Zhou, Dong-Hua Tsinghua Univ Dept Automat TNList Beijing 100084 Peoples R China High Tech Inst Xian Xian 710025 Shaanxi Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

A belief rule base inference methodology using the evidential reasoning (RIMER) approach has been developed recently. A belief rule base (BRB). which can be treated as a more generalized expert system, extends traditional IF-THEN rules, but requires the assignment of some system parameters including rule weights, attribute weights, and belief degrees. These parameters need to be determined with care for reliable system simulation and prediction. Some off-line optimization models have been proposed, but it is expensive to train and re-train these models in particular for large-scale systems. Moreover, the recursive algorithms are also proposed to fine tune a BRB online. which require less calculation time and satisfy the real-time requirement. However, the earlier mentioned learning algorithms are all based on a predetermined structure of the BRB. For a complex system, prior knowledge may not be perfect, which leads to the construction of an incomplete or even inappropriate initial BRB structure. Also, too many rules in an initial BRB may lead to over fitting, whilst too few rules may result in under fitting. Consequently, such a BRB system may not be capable of achieving overall optimal performance. In this paper, we consider one realistic and important case where both a preliminary BRB structure and system parameters assigned to given rules can be adjusted online. Based on the definition of a new statistical utility for a belief rule as investigated in this paper, a sequential learning algorithm for online constructing more compact BRB systems is proposed. Compared with the other learning algorithms, a belief rule can be automatically added into the BRB or pruned from the BRB, and our algorithm can also satisfy the real-time requirement. In addition, our algorithm inherits the feature of RIMER, i.e., only partial input and output information is required, which could be either incomplete or vague, either numerical or judgmental, or mixed. In order to verify the effe

关键词： Belief rule base Expert system Evidential reasoning recursive algorithm Utility

来源：评论

学校读者我要写书评

暂无评论

Isochronicity Problem of Higher-Order Singular Point for Polynomial Differential Systems

引用

ACTA APPLICANDAE MATHEMATICAE 2010年第3期110卷 1429-1448页

作者： Wu, Yusen Zhang, Cui Li, Peiluan Cent S Univ Sch Math Sci & Comp Technol Changsha 410075 Hunan Peoples R China Luoyang Normal Univ Sch Math Sci Luoyang 471022 Henan Peoples R China

Due to the difficulty, the isochronicity problems with respect to higher-order singular point (or degenerate singular point) of polynomial differential systems are far from being solved. The calculation of period constants is an effective way to find necessary conditions for isochronicity. In this paper, by means of a homeomorphic transformation, higher-order singular point is transferred into the origin. At the same time, a new recursive algorithm to compute period constants at the origin of the transformed system is deduced which is easy to realize with the computer algebraic system such as MATHEMATICA or MAPLE. Finally, to illustrate the effectiveness of our algorithm, the pseudo-isochronous center conditions of higher-order singular point for a class of septic system are investigated. Our work is new in terms of research about the isochronicity problem of higher-order singular point and consists of the existing results related to the origin as a special case when it is an elementary singular point.

关键词： Higher-order singular point Period constant recursive algorithm Polynomial differential system

来源：评论

学校读者我要写书评

暂无评论

A Framework for Reliability Approximation of Multi-State Weighted k-out-of-n Systems

引用

IEEE TRANSACTIONS ON RELIABILITY 2010年第2期59卷 297-308页

作者： Ding, Yi Zuo, Ming J. Lisnianski, Anatoly Li, Wei Nanyang Technol Univ Sch EEE Singapore 639798 Singapore Univ Alberta Dept Mech Engn Edmonton AB T6G 2G8 Canada Israel Elect Corp Ltd IL-31000 Haifa Israel Citigrp Ctr London E14 5LB England

The multi-state k-out-of-n system model finds wide applications in industry, and has been extensively studied in recent years. This model has also been generalized to the multi-state weighted k-out-of-n system model. recursive methods, and universal generating functions (UGF) are two primary algorithms for exact performance evaluation of multi-state k-out-of-n systems. However the computational burden becomes the crucial factor when there is a "dimension damnation" problem caused by the increase in the number of components in the system, and the number of possible states a component may be in. In situations wherein exact values of system reliability are not necessary, we may use more efficient algorithms to approximate system reliability. In this paper, we develop a comprehensive framework for reliability approximation of multi-state weighted k-out-of-n systems. Two fuzzy based multi-state weighted k-out-of-n system models are defined. Procedures for building these two models from the conventional models are also introduced. The fuzzy recursive methods, and fuzzy UGF techniques are developed to evaluate such systems. The clustering technique, and curve fitting method are used to determine the fuzzy weights, and probabilities of states in the models.

关键词： Fuzzy set k-out-of-n system multi-state system recursive algorithm reliability approximation universal generating function weighted k-out-of-n system

来源：评论

学校读者我要写书评

暂无评论

Adaptive kernel principal component analysis

引用

SIGNAL PROCESSING 2010年第5期90卷 1542-1553页

作者： Ding, Mingtao Tian, Zheng Xu, Haixia Northwestern Polytech Univ Sch Sci Xian 710129 Peoples R China Northwestern Polytech Univ Dept Comp Sci & Engn Xian 710129 Peoples R China Chinese Acad Sci State Key Lab Remote Sensing Sci Inst Remote Sensing Applicat Beijing 100101 Peoples R China

An adaptive kernel principal component analysis (AKPCA) method, which has the flexibility to accurately track the kernel principal components (KPC), is presented. The contribution of this paper may be divided into two parts. First, KPC are recursively formulated to overcome the batch nature of standard kernel principal component analysis (KPCA). This formulation is derived from the recursive eigendecomposition of kernel covariance matrix and indicates the KPC variation caused by the new data. Second, kernel covariance matrix is correctly updated to adapt to the changing characteristics of data. In this adaptive method, the KPC is adaptively adjusted without re-eigendecomposing the kernel Gram matrix. The proposed method not only maintains constant update speed and memory usage as the data-size increases, but also alleviates sub-optimality of the KPCA method for non-stationary data. Experiments for simulation data and real applications are detailed to assess the utility of the proposed method. The results demonstrate that our approach yields improvements in terms of both computational speed and approximation accuracy. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.

关键词： Adaptive method Kernel principal component analysis Kernel principal component Non-stationary data recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Resonator-Based Method for Power Measurements According to the IEEE Trial-Use Standard 1459-2000

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2010年第2期59卷 250-258页

作者： Tomic, Josif J. Kusljevic, Miodrag D. Marcetic, Darko P. Univ Novi Sad Fac Tech Sci Novi Sad 21000 Serbia Termoelektro Enel AD Belgrade 11060 Serbia

This paper proposes an accurate and computationally efficient implementation of the IEEE Standard 1459-2000 for power measurements. The algorithm has two stages. In the first algorithm stage, the voltage and current signals are processed in parallel, and their spectrums are estimated independently of each other. Signal harmonics are estimated in a wide range of frequency using an efficient algorithm with reduced complexity. The algorithm is based on a recently introduced common structure for recursive discrete transforms and consists of digital resonators embedded in a common negative feedback loop. In the second algorithm stage, the unknown power components and other power quality indices are calculated according to definitions in the IEEE Standard 1459-2000. To demonstrate the efficiency of the proposed algorithm, the results of computer simulations and laboratory testing are presented. The laboratory results show accurate input power component estimates for a nonlinear load with rapid input current amplitude changes. In addition, a simple LabView implementation, based on the point-by-point processing feature, demonstrates the technique's modest computation requirements and confirms that the proposed algorithm is suitable for real-time applications.

关键词： Adaptive filtering finite-impulse-response (FIR) filter frequency estimation harmonic analysis IEEE Standard 1459-2000 point-by-point analysis power measurement power quality (PQ) real-time systems recursive algorithm resonator virtual instrument (VI)

来源：评论

学校读者我要写书评

暂无评论

On a Class of High-Level Finite-State Automata

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2010年第7期44卷 398-406页

作者： Vinogradov, R. A. Sokolov, V. A. Yaroslavl State Univ Ul Sovetskaya 14 Yaroslavl 150000 Russia

An extension of a hierarchical model of automaton programs is proposed. New elements help shorten the transition graphs of automata, without complicating the logic of automata-based programs.

关键词： automaton hierarchical model automata-based programs recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Isochronicity at infinity for a class of polynomial differential system

引用

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2010年第1-2期34卷 251-271页

作者： Wu, Yusen Huang, Wentao Cent S Univ Sch Math Changsha 410075 Hunan Peoples R China Guilin Univ Elect Technol Seventh Dept Guilin 541004 Guangxi Peoples R China

In this paper, we explore the problem of isochronicity at infinity for a class of polynomial differential system. The technique is based on taking infinity into the origin by means of a homeomorphism. Simultaneously, we derive a recursive algorithm to compute period constants at the origin of the transformed system. At the end, as an application of our algorithm, we study pseudo-isochronous center conditions at infinity for a class of septic system.

关键词： Infinity Period constant recursive algorithm Polynomial differential system

来源：评论

学校读者我要写书评

暂无评论

Create Multi-dimension Linked Lists on recursive algorithm and the Application

Create Multi-dimension Linked Lists on Recursive Algorithm a...

引用

第二十六届中国控制会议

作者： Chen Guangyi 1,He Zhaoyong 2 1.Automacation Dpartment,Foshan University,Foshan,528200,P.R.China2.South China University of Technology-College of Automatization science and engineering,Guany zhou,510640,P.R.China

Multi-dimension linked lists is a new data structure,which has powerful function and well visiting *** can be applied in scientifc computing analysis,image processing,database index and so *** the development of computer science,multi-dimension linked lists may be applied in other rectangular coordinate system's spatial expression and multi-dimension linked lists recursive algorithm will give us very large *** the research of multi-dimension linked lists in this paper,it would be given out of the mathematical model and recursive algorithm of multi-dimension linked lists.

关键词： multi-dimension linked lists crunodes recursive algorithm data structures data structures

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of cortical sources activities for online classification of electroencephalographic signals.

Reconstruction of cortical sources activities for online cla...

引用

32nd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBC 10)

作者： Fruitet, Joan Clerc, Maureen INRIA Athena Project Team F-06902 Sophia Antipolis France

ISBN: (纸本)9781424441242

We compare the results given by different methods to reconstruct cortical sources activity in order to classify EEG in real time. Two motor imagery experiments were performed. The aim was to retrieve from 1 windows of signal which motor imagery task the subjects were performing. The use of cortical activity reconstruction was compared to Laplacian filtering, which is often used in BCI. A recursive algorithm using Student's t-test was used to select relevant cortical sources. The Beamformer method led to an improvement of the classification for the first experiment, which included six motor imagery tasks. The weighted Minimum-Norm method required the use of a specific head model, extracted from the subject's MRI, to improve the classification. It then gave the best results on the second experiment, achieving a classification rate of 77% compared to 71% for direct use of electrode data and 75% for Laplacian filtering and Beamformer.

关键词： EEG Laplacian filtering MRI array signal processing beamformer biomechanics cortical source activities electrode electroencephalography electroencephalography feature extraction feature extraction filtering theory head model medical signal processing motor imagery task neurophysiology online signal classification recursive algorithm signal classification signal reconstruction signal reconstruction student t-test weighted minimum-norm method

来源：评论

学校读者我要写书评

暂无评论

Fractal Graphics Parallel Design and Analysis

Fractal Graphics Parallel Design and Analysis

引用

9th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES 2010)

作者： Li, Wenjing Lan, Zhenxiong Wang, Ruliang Liao, Weizhi Guangxi Teachers Educ Univ Coll Comp & Informat Engn Nanning 530001 Peoples R China

ISBN: (纸本)9780769541105

The paper introduced recursive algorithm of fractal graphics, put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel algorithm. The experimental results of PC cluster show that the theoretical analysis and the experimental results of fractal graphics parallel algorithm are consistency with a marked speedup rate.

关键词： Fractal Graphics recursive algorithm Parallel algorithm Complexity Analysis Speedup rate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：