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

Online Updating Belief-Rule-Base Using the RIMER Approach

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 2011年第6期41卷 1225-1243页

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

In order to determine the parameters of belief-rule-base (BRB) accurately, several optimization methods have been proposed for training BRB, on the basis of a generic rule-base inference methodology using the evidential reasoning (RIMER) approach. These optimization methods are implemented offline, and such are not suitable for training BRB in a dynamic fashion. In this paper, two recursive algorithms are proposed to update BRB online that can simulate dynamic systems. The main feature of the proposed algorithms is that only partial input and output information is required, which can be incomplete or vague, numerical or judgmental, or mixed. If the internal structure of a BRB is initially decided using expert judgments, domain-specific knowledge and/or commonsense rules, the proposed algorithms can be used to fine-tune the initial BRB online, once input and output datasets become available. Using the proposed algorithms, there is no need to collect a complete set of data before a BRB can be trained, which is necessary if the BRB is used to simulate a dynamic system. A numerical example and a case study are reported to demonstrate the potential of the algorithms for online fault diagnosis.

关键词： Belief-rule-base (BRB) evidential reasoning (ER) inference recursive algorithms uncertainty

来源：评论

学校读者我要写书评

暂无评论

Solution of the time-dependent Schrodinger equation for highly symmetric potentials

引用

COMPUTER PHYSICS COMMUNICATIONS 2000年第2-3期127卷 290-308页

作者： Schmidt, B Zdánská, P Konrad Zuse Zentrum Informat Tech Berlin D-14195 Berlin Germany Acad Sci Czech Republ J Heyrovsky Inst Phys Chem CR-18223 Prague Czech Republic

The method of symmetry adapted wavepackets (SAWP) to solve the time-dependent Schrodinger equation for a highly symmetric potential energy surface is introduced. The angular dependence of a quantum-mechanical wavepacket is expanded in spherical harmonics where the number of close-coupled equations far the corresponding radial functions can be efficiently reduced by symmetry adaption of the rotational basis using the SAWP approach. Various techniques to generate symmetry adapted spherical harmonics (SASHs) for the point groups of highest symmetry (octahedral, icosahedral) are discussed. The standard projection operator technique involves the use of Wigner rotation matrices. Two methods to circumvent numerical instabilities occurring for large azimuthal quantum numbers are suggested. The first is based on a numerical scheme which employs Gaussian integrations yielding exact and stable results. The second is a recursive algorithm to generate higher order SASHs accurately and efficiently from lower order ones. The paper gives a complete set of "seed functions" generated by projection techniques which can be used to obtain SASHs for all irreducible representations of the octahedral and icosahedral point groups recursively. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： Quantum number CENTROSYMMETRIC spherical harmonic analysis recursive algorithms operator technique Icosahedron time-dependent Symmetry Point groups Schrodinger equation

来源：评论

学校读者我要写书评

暂无评论

Gauss-Newton-based fast and simple recursive algorithm for compensation using shunt active power filter

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2017年第6期11卷 1521-1530页

作者： Chittora, Prakash Singh, Alka Singh, Madhusudan Delhi Technol Univ Bawana Rd Delhi 110042 India

Three-phase, four-wire systems are prone to various power quality (PQ) problems such as load unbalancing, low power factor, harmonics and problem of neutral current. Modified recursive Gauss-Newton (MRGN) algorithm is proposed to mitigate various PQ problems in four-wire distribution systems. The recursive Gauss-Newton method is quite complex, so it is modified to obtain simple and fast MRGN control technique. The proposed algorithm is developed using MATLAB/Simulink environment and tested for mitigation of various PQ problems. Thereafter, a hardware prototype for shunt active power filter (SAPF) is developed along with various sensors, control circuits using dspace 1104 as digital signal processor. Gating circuits provide proper gating pulses to control SAPF as per the new algorithm. Results with linear and non-linear loads have been tested under a variety of loading conditions and thoroughly analysed for its performance.

关键词： recursive algorithms Fasting active power filter recursive power filters Shunts (electrical) compensated dispensing system

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Two Online Identification algorithms in a Fuel Cell System

引用

FUEL CELLS 2018年第3期18卷 347-358页

作者： Kandidayeni, M. Macias, A. Amamou, A. A. Boulon, L. Kelouwani, S. Univ Quebec Trois Rivieres Hydrogen Res Inst Trois Rivieres PQ Canada Canada Res Chair Energy Sources Vehicles Future Trois Rivieres PQ Canada

Output power of a fuel cell (FC) stack can be controlled through operating parameters (current, temperature, etc.) and is impacted by ageing and degradation. However, designing a complete FC model which includes the whole physical phenomena is very difficult owing to its multivariate nature. Hence, online identification of a FC model, which serves as a basis for global energy management of a fuel cell vehicle (FCV), is considerably important. In this paper, two well-known recursive algorithms are compared for online estimation of a multi-input semi-empirical FC model parameters. In this respect, firstly, a semi-empirical FC model is selected to reach a satisfactory compromise between computational time and physical meaning. Subsequently, the algorithms are explained and implemented to identify the parameters of the model. Finally, experimental results achieved by the algorithms are discussed and their robustness is investigated. The ultimate results of this experimental study indicate that the employed algorithms are highly applicable in coping with the problem of FC output power alteration, due to the uncertainties caused by degradation and operation condition variations, and these results can be utilized for designing a global energy management strategy in a FCV.

关键词： Fuel Cells Global Energy Management Online Identification recursive algorithms Semi-empirical Calculations

来源：评论

学校读者我要写书评

暂无评论

A SYSTOLIC ALGORITHM FOR QSVD UPDATING

引用

SIGNAL PROCESSING 1991年第2期25卷 203-213页

作者： MOONEN, M VANDOOREN, P VANDEWALLE, J ESAT Katholieke Universiteit Leuven K. Mercierlaan 94 3001 Heverlee Belgium University of Illinois at Urbana-Champain Department of Electrical and Computer Engineering 1101 West Springfield Avenue Urbana IL 61801 USA

In earlier reports, a Jacobi-type algorithm for SVD updating has been developed and implemented on a systolic array. Here, this is extended to a generalized decomposition for a matrix pair, viz. the quotient singular value decomposition (QSVD). Updating problems are considered where new rows are appended to either one or both of the matrices involved. Systolic arrays as well as square root free implementations are described.

关键词： SINGULAR VALUE DECOMPOSITION PARALLEL algorithms recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

Multimicrophone noise reduction using recursive GSVD-based optimal filtering with ANC postprocessing stage

引用

IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING 2005年第1期13卷 53-69页

作者： Doclo, S Moonen, M Katholieke Univ Leuven Dept Elect Engn ESAT SCD B-3001 Heverlee Belgium

Recently, a generalized singular value decomposition (GSVD)-based optimal filtering technique has been proposed for enhancing multimicrophone speech signals degraded by additive colored noise. The GSVD-based optimal filtering technique has a better noise reduction performance than standard beamforming techniques provided that the used filter length is large enough. In this paper, it is shown that the same noise reduction performance can be obtained with shorter filter lengths at a lower computational complexity by incorporating the GSVD-based optimal filtering technique in a generalized sidelobe canceller type structure, i.e., by adding an adaptive noise cancellation (ANC) postprocessing stage. Even when using short filter lengths, the total computational complexity is essentially determined by the calculation of the GSVD of a speech and a noise data matrix. It is shown that the complexity can be significantly reduced by using recursive GSVD-updating algorithms and by using subsampling. Simulations have been performed for various acoustic scenarios (different and multiple noise sources and different reverberation conditions), where both the improvement in signal-to-noise ratio and speech distortion have been analyzed. These simulations show that the GSVD-based optimal filtering technique with an ANC postprocessing stage has a better noise reduction performance than standard fixed and adaptive beamforming techniques while introducing an acceptable amount of speech distortion.

关键词： generalized sidelobe canceller generalized singular value decomposition (GSVD) multichannel Wiener filter optimal filtering recursive algorithms speech enhancement

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF ROBUST STOCHASTIC-APPROXIMATION algorithms FOR PROCESS IDENTIFICATION

引用

AUTOMATICA 1986年第4期22卷 483-488页

作者： STANKOVIC, SS KOVACEVIC, BD Faculty of Electrical Engineering University of Belgrade Belgrade Yugoslavia

An analysis of robust recursive algorithms for dynamic system identification is presented. Problems related to the construction of optimal stochastic approximation algorithms in the min-max sense are demonstrated. Starting from the definition of one class of robustified recursive identification algorithms, several procedures are derived through convenient approximations and initial assumptions. A detailed Monte Carlo analysis gives an insight into the practical robustness of these procedures indicating the most reliable ones. Important relationships between parameters describing the algorithms are pointed out.

关键词： Identification non-linear filtering parameter estimation recursive algorithms robustness sensitivity analysis simulation

来源：评论

学校读者我要写书评

暂无评论

Time Invariant Error Bounds for Modified-CS-Based Sparse Signal Sequence Recovery

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第3期61卷 1389-1409页

作者： Zhan, Jinchun Vaswani, Namrata Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

In this paper, we obtain performance guarantees for modified-CS and for its improved version, modified-CS-Add-LS-Del, for recursive reconstruction of a time sequence of sparse signals from a reduced set of noisy measurements available at each time. Under mild assumptions, we show that the support recovery error of both algorithms is bounded by a time-invariant and small value at all times. The same is also true for the reconstruction error. Under a slow support change assumption: 1) the support recovery error bound is small compared with the support size and 2) our results hold under weaker assumptions on the number of measurements than what l(1) minimization for noisy data needs. We first give a general result that only assumes a bound on support size, number of support changes, and number of small magnitude nonzero entries at each time. Later, we specialize the main idea of these results for two sets of signal change assumptions that model the class of problems in which a new element that is added to the support either gets added at a large initial magnitude or its magnitude slowly increases to a large enough value within a finite delay. Simulation experiments are shown to back up our claims.

关键词： Compressed sensing sparse recovery recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

Online Updating With a Probability-Based Prediction Model Using Expectation Maximization Algorithm for Reliability Forecasting

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 2011年第6期41卷 1268-1277页

作者： Hu, Chang-Hua Si, Xiao-Sheng Yang, Jian-Bo Zhou, Zhi-Jie Xian Inst Hitech Xian 710025 Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

Recently, a novel prediction model based on the evidential reasoning (ER) approach is developed to forecast reliability in engineering systems. In order to determine the parameters of the ER-based prediction model, some optimization models have been proposed to train the ER-based prediction model. However, these models are implemented in an offline fashion and thus it is very expensive to train and retrain them when new information is available. This correspondence paper is concerned with developing the recursive algorithms for updating the ER-based prediction model from the probability-based point of view. Using the recursive expectation maximization algorithm, two recursive algorithms are proposed for updating the parameters of the ER-based prediction model under judgmental and numerical outputs, respectively. As such, the proposed algorithms can be used to fine tune the ER-based prediction model online once new information becomes available. We verify the proposed method via a realistic example with missile reliability data.

关键词： Decision analysis expectation maximization (EM) forecasting recursive algorithms uncertainty

来源：评论

学校读者我要写书评

暂无评论

DIVIDE-AND-CONQUER ORTHOGONALITY PRINCIPLE FOR PARALLEL OPTIMIZATIONS IN TSP

引用

NEUROCOMPUTING 1995年第3期8卷 249-261页

作者： SZU, H FOO, S FLORIDA STATE UNIV FAMUCOLL ENGNDEPT ELECT ENGNTALLAHASSEEFL 32316 USN CTR SURFACE WARFAREDAHLGREN DIVWHITE OAKMD 20309

A lossless divide-and-conquer (D&C) principle, implemented via an orthogonality projection, is described and illustrated with a recursive solution of the Traveling Salesman Problem (TSP), which is executable on a massively parallel and distributed computer. The lossless D&C principle guides us to look near the desirable boundary and to seek for a characteristic vector V (e.g. displacement vector in TSP) such that V approximate to A + B where two resultant vectors A and B (located one in each sub-domains to be divided) should be orthogonal to each other having no cross product terms, i.e. (A, B) = (B, A) = 0. In the case of parallel computing this goal amounts to minimum communication cost among processors. Then the global optimization of the whole domain: Min. \\V\\(2) = Min. \\A\\(2) + Min. \\B\\(2) can be losslessly divided into two sub-domains that each can seek its own optimized solution separately (by two separate sets of processors without inter-communication during processing). Such a theorem of orthogonal division error (ODE) for lossless D&C is proved, and the orthogonal projection is constructed for solving a large-scale TSP explicitly.

关键词： NONCONVEX OPTIMIZATION SIMULATED ANNEALING TRAVELING SALESMAN PROBLEM LOSSLESS DIVIDE-AND-CONQUER BOUNDARY RESULTANT VECTORS ORTHOGONAL PROJECTIONS recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：