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

2008 American Control Conference, Pages 441-879

作者： A. Saadatpoor C. Ma W. M. Wonham

ISBN: (纸本)9781424420780

It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. The problem of state explosion is more challenging in Timed DES than in untimed DES. In this paper we propose to manage complexity by organizing the system as a Timed State Tree Structure (TSTS). Based on TSTS we present an efficient recursive algorithm that can perform nonblocking supervisory control design (in reasonable time and memory) for systems of state size 10~(12) and higher.

关键词： Supervisory control system component TREE STRUCTURES oversight recursive algorithms Explosions design control

来源：评论

学校读者我要写书评

暂无评论

A Novel recursive Algorithm for Bit-Efficient Realization of Arbitrary Length Inverse Modified Cosine Transforms 08

A Novel Recursive Algorithm for Bit-Efficient Realization of...

引用

2008 Design, Automation and Test in Europe (DATE 2008), vol.2

作者： Ralf Koenig Timo Stripf Juergen Becker Universitaet Karlsruhe

ISBN: (纸本)9783981080131

In this paper a novel approach for Inverse Modified Cosine Transform (IMDCT) computation is presented, based on a recursive algorithm. Due to its nature, this IMDCT calculation can be performed on a reduced bit width datapath without loss of accuracy, compared to alternative recursive architectures. Combined with the regular structure, the approach allows for a much more area efficient VLSI implementation compared to existing systems. Due to its bit efficiency this approach is attractive to be implemented on reconfigurable architectures of the DSP domain as well.

关键词： recursive algorithms Reconfigurable architectures Cosine transforms Inverse Regular Binary digits discrete Fourier transform

来源：评论

学校读者我要写书评

暂无评论

Matrix algorithms for modeling acoustic waves in piezoelectric multilayers

引用

IEEE TRANSACTIONS ON ULTRASONICS FERROELECTRICS AND FREQUENCY CONTROL 2007年第10期54卷 2016-2023页

作者： Tan, Eng Leong Nanyang Technol Univ Singapore 639798 Singapore

Matrix algorithms for modeling acoustic waves in piezoelectric multilayers are presented. All the algorithms considered are capable of resolving the numerical instability of transfer matrix at high frequency-thickness product. The formulation of basic matrices for the algorithm building blocks, and the development of recursive algorithms for the stack matrices, are systematically presented for both the conventional scattering and impedance matrices as well as the more recent hybrid matrix. Many variants of the algorithms are discussed, along with their respective usefulness and deficiency. Comparisons are made in their computational efficiency and numerical stability. For unconditional stability throughout large and small thicknesses, both scattering and hybrid matrix algorithms are applicable. For most efficiency, the algorithms that synergize both scattering and hybrid or impedance submatrices are superior, using surface matrix approach. Other aspects of algorithms such as formula conciseness, physical insight, versatility in incorporating boundary conditions, etc., are also noted.

关键词： S-matrix theory acoustic waves impedance matrix multilayers numerical stability piezoelectric materials computational efficiency hybrid matrix algorithms impedance matrices piezoelectric multilayers recursive algorithms scattering matrix algorithms surfa Scattering recursive algorithms multilayers Numerical stability algorithms matrices Acoustic Wave Computational efficiency S-matrix theory impedance matrix Piezoelectric materials

来源：评论

学校读者我要写书评

暂无评论

A recursive 4SID FROM THE INPUT-OUTPUT POINT OF VIEW

引用

Asian Journal of Control 2008年第4期1卷

作者： Hiroshi Oku Hidenori Kimura Department of Mathematical Engineering and Information Physics Faculty of Engineering University of Tokyo Japan Graduate School of Frontier Sciences University of Tokyo Japan.

In this paper, recursive algorithms of subspace state-space system identification (4SID) for multiple-input, multiple-output (MIMO), finite dimensional, linear time-invariant (FDLTI) systems are proposed. These algorithms are derived based on the Matrix Inversion Lemma. The investigation of our algorithms clarifies that a series of 4SID is the extension of the classical least square method to identification for multivariable systems, and also that our algorithms are the direct extension of the recursive least square algorithm to such ones. For PO-MOESP (the ordinary MOESP scheme with instrumental variables constructed from Past input and Output measurements), we show the mechanism of how the effect of the process and measurement noises is eliminated asymptotically by a projection related to the input and regressor matrices. “MOESP” is an abbreviation for “the MIMO output-error state-space model identification.”

关键词： 4SID MOESP recursive algorithms least square matrix inversion lemma

来源：评论

学校读者我要写书评

暂无评论

Two-stage improved recursive Newton-type algorithm for power-quality indices estimation

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2007年第3期22卷 1351-1359页

作者： Terzija, Vladimir V. Stanojevic, Vladimir Univ Manchester Sch Elect & Elect Engn Manchester M60 1QD Lancs England Univ London Imperial Coll Sci Technol & Med Control & Power Grp London SW7 2AZ England

In the paper, a new improved recursive Newton-type algorithm (IRNTA) suitable for various measurement applications in the electric power systems is presented. Here, it is applied for power-quality (PQ) indices estimation according to the IEEE Standard 1459-2000. Basically, the algorithm is a recursive nonlinear estimator, improved with a strategy of sequentially tuning the forgetting factor. This approach generally improves the algorithm performance: immunity to random noise, accuracy, and the speed of convergence. The IRNTA considers the power frequency as an unknown model parameter and takes into account distortion of voltages and currents. Therefore, it is suitable for the real-time PQ monitoring. The algorithm has two stages. In the first stage, the input signal spectra and fundamental frequency are estimated, whereas in the second stage, the unknown PQ indices are calculated. To demonstrate the efficiency of the proposed algorithm, the results of computer simulations and laboratory testing are presented.

关键词： IEEE Standard 1459-2000 monitoring non-linear estimation power quality (PQ) recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

Algorithm 865: Fortran 95 subroutines for cholesky factorization in block hybrid format

引用

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2007年第1期33卷 8.1-8.5页

作者： Gustavson, Fred G. Reid, John K. Wasniewski, Jerzy IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Rutherford Appleton Lab Atlas Ctr Didcot OX11 0QX Oxon England Tech Univ Denmark DK-2800 Lyngby Denmark

We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and for solving corresponding sets of linear equations. They exploit cache memory by using the block hybrid format proposed by the authors in a companion article. The matrix is packed into n(n + 1)/2 real variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n(2) variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel subroutine that is used for the Cholesky factorization of the diagonal blocks since it is suitable for any positive-definite symmetric matrix that is small enough to be held in cache. We provide a comprehensive test program and simple example programs.

关键词： algorithms performance real symmetric matrices positive definite matrices Cholesky factorization and solution recursive algorithms novel packed matrix data structures linear systems of equations BLAS

来源：评论

学校读者我要写书评

暂无评论

Numerical study of evaluating the optical quality of supersonic flow fields

引用

APPLIED OPTICS 2007年第23期46卷 5545-5551页

作者： Tao Wang Yan Zhao Dong Xu Qiuying Yang BeiHang Univ Sch Instrument ci & Optoelect Engn Dept Inertia Technol & Navigat Guidance Instrumen Beijing 100083 Peoples R China

A numerical method based on the uniform and hexahedral grids generated from computational fluid dynamics is presented for the analysis of aero-optical performance. A single grid is taken as a cell with isotropy and homogeneity inside, and it is assumed that the light rays transmit grid by grid. Ray tracing is employed to track the transmission through the flow of supersonic fluids, and a recursive algorithm is derived. The line-of-sight errors and optical path differences produced by the mean density fields were calculated, the phase variances brought from the density fluctuations were computed, and the Strehl ratios were figured out. This method potentially provides a solution for the prediction of aero-optical effects. (C) 2007 Optical Society of America.

关键词： recursive algorithms flow field Grid Numerical methods STREHL RATIO Light DENSITY FLUCTUATIONS through flow supersonic flow optical paths grids Isotropy

来源：评论

学校读者我要写书评

暂无评论

The averaged, overdetermined, and generalized LMS algorithm

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2007年第12期55卷 5593-5603页

作者： Alameda-Hernandez, Enrique Blanco, David Ruiz, Diego P. Carrion, Maria C. Univ Granada Elect Engn Area E-18071 Granada Spain Univ Granada Dept Appl Phys E-18071 Granada Spain

This paper provides and exploits one possible formal framework in which to compare and contrast the two most important families of adaptive algorithms: the least-mean square (LMS) family and the recursive least squares (RLS) family. Existing and well-known algorithms, belonging to any of these two families, like the LMS algorithm and the RLS algorithm, have a natural position within the proposed formal framework. The proposed formal framework also includes-among others-the LMS/overdetermined recursive instrumental variable (ORIV) algorithm and the generalized LMS (GLMS) algorithm, which is an instrumental variable (IV) enable LMS algorithm. Furthermore, this formal framework allows a straightforward derivation of new algorithms, with enhanced properties respect to the existing ones: specifically, the ORIV algorithm is exported to the LMS family, resulting in the derivation of the averaged, overdetermined, and generalized LMS (AOGLMS) algorithm, an overdetermined LMS algorithm able to work with an IV. The proposed AOGLMS algorithm overcomes-as we analytically show here-the limitations of GLMS and possesses a much lower computational burden than LMS/ORIV, being in this way a better alternative to both algorithms. Simulations verify the analysis.

关键词： instrumental variable least squares orthogonality conditions recursive algorithms stochastic gradient

来源：评论

学校读者我要写书评

暂无评论

FPGA-based implementation of recursive algorithms

引用

MICROPROCESSORS AND MICROSYSTEMS 2004年第5-6期28卷 197-211页

作者： Sklyarov, V Univ Aveiro IEETA Dept Elect & Telecommun P-3810193 Aveiro Portugal

The paper suggests a novel method for implementing recursive algorithms in hardware. The required support for recursion has been provided through a modular and a hierarchical specification of it control unit that can be translated to an implementation of the respective hardware circuit on the basis of a recursive hierarchical finite state machine and through a mechanism that permits the contents of an execution unit to be stored/restored between hierarchical calls/retums. The paper describes all the details that are required to implement recursive algorithms in hardware. It begins with software (C++) models and finishes with synthesizable VHDL codes. Two practical applications of recursive algorithms in the data sorting and compression area have been studied in detail. (C) 2004 Elsevier B.V. All rights reserved.

关键词： recursive algorithms hierarchical finite state machines sorting binary tree data compression

来源：评论

学校读者我要写书评

暂无评论

A general limit theorem for recursive algorithms and combinatorial structures

引用

ANNALS OF APPLIED PROBABILITY 2004年第1期14卷 378-418页

作者： Neininger, R Rüschendorf, L McGill Univ Sch Comp Sci Montreal PQ H3A 2K6 Canada Univ Freiburg Inst Math Stochast D-79104 Freiburg Germany

Limit laws are proven by the contraction method for random vectors of a recursive nature as they arise as parameters of combinatorial structures such as random trees or recursive algorithms, where we use the Zolotarev metric. In comparison to previous applications of this method, a general transfer theorem is derived which allows us to establish a limit law on the basis of the recursive structure and the asymptotics of the first and second moments of the sequence. In particular, a general asymptotic normality result is obtained by this theorem which typically cannot be handled by the more common l(2) metrics. As applications we derive quite automatically many asymptotic limit results ranging from the size of tries or m-ary search trees and path lengths in digital structures to mergesort and parameters of random recursive trees, which were previously shown by different methods one by one. We also obtain a related local density approximation result as well as a global approximation result. For the proofs of these results we establish that a smoothed density distance as well as a smoothed total variation distance can be estimated from above by the Zolotarev metric, which is the main tool in this article.

关键词： contraction method multivariate limit law asymptotic normality random trees recursive algorithms divide-and-conquer algorithm random recursive structures Zolotarev metric

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：