摘要:

Multi-stage Monte Carlo optimization (MSMCO) and its attendant limit theory are applied to the problem of finding the shortest routes to connect 249 points. Comparisons of the MSMCO technique's performance are made with other methods. The limit theory idea of averaging errors or pinning down frequently occurring sub-routes is used extensively. Multi-stage is a series of consecutive regular Monte Carlo optimizations run over an ever changing and narrowing feasible solution region following the best answer so far. The preliminary sampling in the early stages, points the way to the optimal solution region of the sampling distribution of feasible solutions. Then the n-dimensional rectangles (for a function of n variables) focus in and find the oplimals. Multi-stage is of course an approximation technique. However the approximations can outperform many other algorithms if the sampling and limit theory are carefully applied. It also allows one to make use of simplifying transformations (like the ranking transformation used here) to reduce the number of variables in the simulation.

ISSN:0020-7721    

DOI:10.1080/00207729008910387

出版商:Taylor & Francis Group    

年代:1990

数据来源: Taylor

摘要:

An approach to obtain the optimal controller From an optimal criterion is presented. The controller is very general in the sense that it is multivariable, it compensates Tor process delay and it allows a penalty on the input variable variance. The controller can be obtained in two forms: the state-space model form with the steady-state Kalman filter that separates the control algorithm in distinctive steps to provide an insight into the control problem, while the transfer function form is very convenient for implementation.

ISSN:0020-7721    

DOI:10.1080/00207729008910388

出版商:Taylor & Francis Group    

年代:1990

数据来源: Taylor

摘要:

This paper deals with the pole location of a perturbed matrix A + E. Two perturbation classes are discussed: one with structured perturbations |E| ≤ U (a given non-negative matrix) and one where only the spectral norm ||E|| is given. Sufficient conditions are derived for the eigenvalues of A + E to be located within a circle C(α, r). The case of a diagonalizable matrix A is also considered and a sufficient condition for robust stability of a class of perturbed discrete systems is derived. Numerical examples are presented for illustration.

ISSN:0020-7721    

DOI:10.1080/00207729008910389

出版商:Taylor & Francis Group    

年代:1990

数据来源: Taylor

摘要:

Recently Zhang and Brockett extended the framework of‘minimum discrimination information’ (MDI) estimation techniques to include quadratic constraints. They claimed their approach was quite different from the usual Lagrange duality theory. We show that the dual problem obtained by Zhang and Brockett is actually a geometric dual. Hence the quadratically constrained MDI estimation can be enriched by the theory of generalized geometric programming.

ISSN:0020-7721    

DOI:10.1080/00207729008910390

出版商:Taylor & Francis Group    

年代:1990

数据来源: Taylor

摘要:

An algorithm for the classification of the phonocardiogram (PCG) waveform is developed. Four main stages that are effective to detect the diagnostic features from PCG, are involved in this classification procedure. The segmentation of the primary heart sounds (PHS) is the first stage. By analysis of the dominant frequency peaks (DFPs), the PHSs are recognized accurately in the succeeding stage. A dynamic time warping (DTW) algorithm is used in the third stage to find the diagnostic features of the systole and diastole. In the last stage, click detection is performed by time series prediction. Based on the diagnostic features extracted by the above stages, the PCG can be easily interpreted by the tree-decision method. Ten PCGs are tested and it is shown that the classification method developed has a good performance.

ISSN:0020-7721    

DOI:10.1080/00207729008910391

出版商:Taylor & Francis Group    

年代:1990

数据来源: Taylor