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

Search for all d-MPs for all d levels in multistate two-terminal networks

RELIABILITY ENGINEERING & SYSTEM SAFETY 2015年第Oct.期142卷 300-309页

作者： Bai, Guanghan Zuo, Ming J. Tian, Zhigang Univ Alberta Dept Mech Engn Edmonton AB Canada

A general method for reliability evaluation of multistate network is using minimal path vectors. A minimal path (MP) vector to system state d is called a d-MP. Most reported works on generating d-MPs are for a particular d value. However, if all d-MPs for all possible integer d values are required, we need to call such methods multiple times with respect to all d values. A more efficient method is desirable to generate all d-MPs. In this paper, we develop a recursive algorithm based on breadth-first search to search for all the d-MPs for all possible d values. The relationships among d-MPs for different d levels are revealed. Each d-MP candidate can be generated by a combination of one (d-1)-MP and the vector form of one binary minimal path. Thus, we can use binary MPs as building blocks to generate 2-MP candidates, and use 2-MPs and binary MPs as building blocks to generate 3-MP candidates ... and so forth. When the d-MPs with respect to the maximum d value have been found, all the d-MPs for all possible d values are obtained. A heuristic for pre-processing the MPs is proposed to improve the efficiency of the algorithm. Through computational experiments, it is found that the proposed algorithm is more efficient than existing algorithms for finding all d-MPs for all possible d values. In addition, we show that the proposed algorithm can also be used to generate a subset of d-MPs for all or some d values given a subset of MPs. The generated subset of d-MPs can be used for lower reliability bound evaluation. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Two-terminal networks Multistate reliability Minimal path vectors recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Fractional Order Differentiation by Integration and Error Analysis in Noisy Environment

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2015年第11期60卷 2945-2960页

作者： Liu, Da-Yan Gibaru, Olivier Perruquetti, Wilfrid Laleg-Kirati, Taous-Meriem Univ Orleans INSA Ctr Val de Loire F-18022 Bourges France KAUST Comp Elect & Math Sci & Engn CEMSE Div Thuwal 239556900 Saudi Arabia Arts & Metiers ParisTech LSIS CNRS UMR 7296 F-59046 Lille France Parc Sci Haute Borne INRIA Lille Nord Europe Equipe Projet Non A F-59650 Villeneuve Dascq France Ecole Ctr Lille CRIStAL CNRS UMR 9189 F-59650 Villeneuve Dascq France

The integer order differentiation by integration method based on the Jacobi orthogonal polynomials for noisy signals was originally introduced by Mboup, Join and Fliess. We propose to extend this method from the integer order to the fractional order to estimate the fractional order derivatives of noisy signals. Firstly, two fractional order differentiators are deduced from the Jacobi orthogonal polynomial filter, using the Riemann-Liouville and the Caputo fractional order derivative definitions respectively. Exact and simple formulae for these differentiators are given by integral expressions. Hence, they can be used for both continuous-time and discrete-time models in on-line or off-line applications. Secondly, some error bounds are provided for the corresponding estimation errors. These bounds allow to study the design parameters' influence. The noise error contribution due to a large class of stochastic processes is studied in discrete case. The latter shows that the differentiator based on the Caputo fractional order derivative can cope with a class of noises, whose mean value and variance functions are polynomial time-varying. Thanks to the design parameters analysis, the proposed fractional order differentiators are significantly improved by admitting a time-delay. Thirdly, in order to reduce the calculation time for on-line applications, a recursive algorithm is proposed. Finally, the proposed differentiator based on the Riemann-Liouville fractional order derivative is used to estimate the state of a fractional order system and numerical simulations illustrate the accuracy and the robustness with respect to corrupting noises.

关键词： Digital fractional order differentiator error analysis Jacobi orthogonal polynomial filter recursive algorithm time-delay

来源：评论

学校读者我要写书评

暂无评论

ISOLATED RUPTURE DEGREE OF TREES AND GEAR GRAPHS

引用

NEURAL NETWORK WORLD 2015年第3期25卷 287-300页

作者： Li, F. Nanjing Normal Univ Sch Math Sci Nanjing 210023 Jiangsu Peoples R China Shaoxing Univ Dept Math Shaoxing 312000 Zhejiang Peoples R China

The isolated rupture degree for a connected graph G is defined as ir(G) = max{i(G-S)-vertical bar S vertical bar-m(G-S) : S is an element of C(G)}, where i(G-S) and m(G-S), respectively, denote the number of components which are isolated vertices and the order of a largest component in G-S. C(G) denotes the set of all cut-sets of G. The isolated rupture degree is a new graph parameter which can be used to measure the vulnerability of networks. In this paper, we firstly give a recursive algorithm for computing the isolated rupture degree of trees, and determine the maximum and minimum isolated rupture degree of trees with given order and maximum degree. Then, the exact value of isolated rupture degree of gear graphs are given.. In the final, we determine the rupture degree of the Cartesian product of two special graphs and a special permutation graph.

关键词： Isolated rupture degree vulnerability ir-set recursive algorithm Cartesian product gear graph

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Reactive-Power and Frequency Estimations Using Simple recursive WLS algorithm and Adaptive Filtering

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2011年第12期60卷 3860-3867页

作者： Kusljevic, Miodrag D. Poljak, Predrag D. Termoelektro Enel AD Belgrade 11060 Serbia Sch Elect Engn & Comp Sci Appl Studies Belgrade 11000 Serbia

A new simple approach to the design of digital algorithm for simultaneous reactive-power and frequency estimations of local system is presented. The algorithm is derived using the weighted-least-square method. During the algorithm derivation, a pure sinusoidal voltage model was assumed. Cascade finite-impulse-response (FIR) comb digital filters are used to minimize the noise effect and to eliminate the presence of harmonics effect. The most important point of this paper is the mathematical model that transforms the problem of estimation into an overdetermined set of linear equations. The investigation was simplified because the total similarity to the state of the problem of the active-power and frequency estimations was noticed. The only difference is the adaptive phase shifter applied to the voltage signal. In addition, coefficient-sensitivity problems of the large-order FIR comb cascade structure are overridden by using a multirate (decimation) digital signal processing technique. Even more, by using antialiasing filters, the parameter estimation accuracy is improved. The effectiveness of the proposed techniques is demonstrated by both simulation and experimental results. The algorithm shows a very high level of robustness, as well as high measurement accuracy over a wide range of frequency changes.

关键词： Cascaded-integrator-comb (CIC) filter digital phase shifter downsampling finite-impulse-response (FIR) filter frequency estimation reactive-power estimation recursive algorithm weighted least square (WLS)

来源：评论

学校读者我要写书评

暂无评论

Parallel Communication-Avoiding algorithm for Triangular Matrix Inversion on Homogeneous and Heterogeneous Platforms

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2015年第4期43卷 631-655页

作者： Mahfoudhi, Ryma Mahjoub, Zaher Nasri, Wahid Univ Tunis El Manar Fac Sci Tunis Tunis 2092 Tunisia Higher Sch Sci & Tech Tunis Tunis 1008 Tunisia

We address in this paper the parallelization of a recursive algorithm for large scale triangular matrix inversion based on the 'Divide and Conquer' (D&C) paradigm. A set of different versions of an original sequential algorithm are first presented. A theoretical performance study permits to establish an accurate comparison between the designed algorithms. Afterwards, we develop in the second part of the paper, an optimal parallel avoiding-communication algorithm for a given number of available homogeneous and heterogeneous processors. To reach this target, we use a so called 'non equitable and incomplete' version of the D&C paradigm consisting in recursively decomposing the original problem into two sub-problems of non equal sizes, then decomposing only one sub-problem in the same previous manner. The theoretical study is validated by a series of experiments achieved on three target platforms, namely an 8-core shared memory machine, a distributed memory cluster and a heterogeneous CPU-GPU cluster. The obtained results permit to illustrate the interest of the contribution.

关键词： Communication-avoiding Cost optimality Distributed memory machine Divide and Conquer GPU Homogeneous platform Heterogeneous platform Load balancing Parallel algorithm recursive algorithm Scheduling Shared memory machine Triangular matrix inversion

来源：评论

学校读者我要写书评

暂无评论

A recursive Least Squares Error Method Aided by Variable-Windowed Short-Time Discrete Fourier Transform for Frequency Tracking in Smart Grid

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年第2期E98A卷 721-734页

作者： Li, Hui Yuan, Liang Hainan Univ Coll Informat Sci & Technol Haikou 520287 Peoples R China Zhejiang Univ Sch Aeronaut & Astronaut Hangzhou 310027 Zhejiang Peoples R China Haisum Engn CO LTD Shanghai 200031 Peoples R China

Least squares error (LSE) method adopted recursively can be used to track the frequency and amplitude of signals in steady states and kinds of non-steady ones in power system. Taylor expansion is used to give another version of this recursive LSE method. Aided by variable-windowed short-time discrete Fourier transform, recursive LSEs with and without Taylor expansion converge faster than the original ones in the circumstance of off-nominal input singles. Different versions of recursive LSE were analyzed under various states, such as signals of off-nominal frequency with harmonics, signals with step changes, signals modulated by a sine signal, signals with decaying DC offset and additive Gaussian white noise. Sampling rate and data window size are two main factors influencing the performance of method recursive LSE in transient states. recursive LSE is sensitive to step changes of signals, but it is in-sensitive to signals' modulation and singles with decaying DC offset and noise.

关键词： smart grid frequency tracking recursive algorithm least squares error short-time discrete Fourier transform variable window

来源：评论

学校读者我要写书评

暂无评论

Identification of linear continuous-time systems under irregular and random output sampling

引用

AUTOMATICA 2015年 60卷 100-114页

作者： Mu, Biqiang Guo, Jin Wang, Le Yi Yin, George Xu, Lijian Zheng, Wei Xing Chinese Acad Sci Acad Math & Syst Sci Inst Syst Sci Key Lab Syst & Control Being 100190 Peoples R China Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing 100083 Peoples R China Wayne State Univ Dept Elect & Comp Engn Detroit MI 48202 USA Wayne State Univ Dept Math Detroit MI 48202 USA SUNY Farmingdale State Coll Dept Elect & Comp Engn Technol Farmingdale NY 11735 USA Univ Western Sydney Sch Comp Engn & Math Sydney NSW 2751 Australia

This paper considers the problem of identifiability and parameter estimation of single-input-single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditions for system identifiability are established under inputs of exponential polynomial types and a tight bound on sampling density. Identification algorithms of Gauss-Newton iterative types are developed to generate convergent estimates. When the sampled output is corrupted by observation noises, input design, sampling times, and convergent algorithms are intertwined. Persistent excitation (PE) conditions for strongly convergent algorithms are derived. Unlike the traditional identification, the PE conditions under irregular and random sampling involve both sampling times and input values. Under the given PE conditions, iterative and recursive algorithms are developed to estimate the original continuous-time system parameters. The corresponding convergence results are obtained. Several simulation examples are provided to verify the theoretical results. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Linear continuous-time system Irregular and random sampling Identifiability Iterative algorithm recursive algorithm Strong consistency Asymptotical normality

来源：评论

学校读者我要写书评

暂无评论

Q-Method Extended Kalman Filter

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2015年第4期38卷 752-760页

作者： Ainscough, Thomas Zanetti, Renato Christian, John Spanos, Pol D. Rice Univ US Air Force Charles Stark Draper Lab Houston TX 77058 USA Charles Stark Draper Lab Houston TX 77058 USA W Virginia Univ Dept Mech & Aerosp Engn Morgantown WV 26508 USA Rice Univ Ryon Chair Engn Houston TX 77005 USA

A new algorithm is proposed that smoothly incorporates the nonlinear estimation of the attitude quaternion using Davenport's q-method and the estimation of nonattitude states through an extended Kalman filter. The new algorithm is compared to an existing one and the various similarities and differences are discussed. The validity of the proposed approach is confirmed by numerical simulations.

关键词： Extended Kalman Filter Singular Value Decomposition Numerical Simulation Taylor Series Magnetometers Earth Monte Carlo Simulation Newton Raphson Method Gaussian White Noise recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Filtering and fault detection for nonlinear systems with polynomial approximation

引用

AUTOMATICA 2015年 54卷 348-359页

作者： Liu, Yang Wang, Zidong He, Xiao Zhou, D. H. Tsinghua Univ Dept Automat TNList Beijing 100084 Peoples R China Brunel Univ London Dept Comp Sci Uxbridge UB8 3PH Middx England

This paper is concerned with polynomial filtering and fault detection problems for a class of nonlinear systems subject to additive noises and faults. The nonlinear functions are approximated with polynomials of a chosen degree. Different from the traditional methods, the approximation errors are not discarded but formulated as low-order polynomial terms with norm-bounded coefficients. The aim of the filtering problem is to design a least squares filter for the formulated nonlinear system with uncertain polynomials, and an upper bound of the filtering error covariance is found and subsequently minimized at each time step. The desired filter gain is obtained by recursively solving a set of Riccati-like matrix equations, and the filter design algorithm is therefore applicable for online computation. Based on the established filter design scheme, the fault detection problem is further investigated where the main focus is on the determination of the threshold on the residual. Due to the nonlinear and time-varying nature of the system under consideration, a novel threshold is determined that accounts for the noise intensity and the approximation errors, and sufficient conditions are established to guarantee the fault detectability for the proposed fault detection scheme. Comparative simulations are exploited to illustrate that the proposed filtering strategy achieves better estimation accuracy than the conventional polynomial extended Kalman filtering approach. The effectiveness of the associated fault detection scheme is also demonstrated. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Polynomial filtering Nonlinear systems Polynomial approximation Fault detection Adaptive threshold recursive algorithm Kronecker power

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of chess roles guess probability in military chess computer game 27

Design and implementation of chess roles guess probability i...

引用

27th Chinese Control and Decision Conference (CCDC)

作者： Wu, Jiehong Lv, Feng Can, Yuqi Zhao, Ziheng Shenyang Aerosp Univ Sch Comp Shenyang 110136 Peoples R China

ISBN: (纸本)9781479970162

In recent years, along with the further study in incomplete information chess-military chess. How to express and address the incomplete information during the process of game, deciding certain moves strategies to obtain higher winning rate increasingly become a new issue. An approach using digit to express incomplete information in military chess is proposed in this paper, a model based on guessing probability to address incomplete information in military chess game is designed, and the programming process is provided. In the National Computer Games Tournament, the game program using this model is stronger than the others. Results are shown as 6 wins, 1 draw, and 1 lost. The average time of each moving step is shorter than opponent 2 second.

关键词： Probability Weight Chess game recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：