We extend the direct algorithm for computing the derivatives of the compactly supported Daubechies N-vanishing-moment basis functions. The method yields exact values at dyadic rationals for the nth derivative (0 <=...
详细信息
We extend the direct algorithm for computing the derivatives of the compactly supported Daubechies N-vanishing-moment basis functions. The method yields exact values at dyadic rationals for the nth derivative (0 <= n <= N - 1) of the basis functions, when it exists. Example results are shown for the first derivatives of the basis functions from the Daubechies N-vanishing-moment extremal phase orthonormal family (for N = 3,4, and 5), and the CDF(2, N) spline-based biorthogonal family (for N = 6,8 and 10). (c) 2005 Elsevier Inc. All rights reserved.
In this study we present an efficient global optimization method. DIviding RECTangle (direct) algorithm, for parametric analysis of dynamic systems. In a bounded constrained problem the direct algorithm explores multi...
详细信息
In this study we present an efficient global optimization method. DIviding RECTangle (direct) algorithm, for parametric analysis of dynamic systems. In a bounded constrained problem the direct algorithm explores multiple potentially optimal subspaces in one search. The algorithm also eliminates the need for derivative calculations which are required in some efficient gradient-based methods. In this Study the first optimization example is to find the dynamic parameters of a tennis racket. The second example is a biomechanical parametric study of a heel-toe running, model Governed by six factors. The effectiveness of the direct algorithm is compared with a genetic algorithm in an analysis of heel-toe running. The result shows that the direct algorithm obtains an improved result in 83% less execution time. It is demonstrated that the straightforward direct algorithm provides a general procedure for solving global optimization problems efficiently and confidently.
This paper describes the design of a multi input multi output (MIMO) non-linear Model Reference Adaptive controller (MRAC) system for the digital servo motor. The complete design is developed determining the rate of g...
详细信息
ISBN:
(纸本)9780780397606
This paper describes the design of a multi input multi output (MIMO) non-linear Model Reference Adaptive controller (MRAC) system for the digital servo motor. The complete design is developed determining the rate of gradient adaptation to MRAC in this paper. The MIT rule is used in the original MRAC. The main goal is to follow the desired position set as square wave. The important role of computer aided-design tools is illustrated using MATLAB and associated toolboxes. The control algorithm is implemented using a Pentium computer running the lab-tech notebook control program. The adaptive controlled system satisfactorily controls set point changes in velocity and position.
In this paper, two direct algorithms for solving the two-sided obstacle problem with an M-matrix are presented. The algorithms are well defined and have polynomial computational complexity. Copyright (C) 2006 John Wil...
详细信息
In this paper, two direct algorithms for solving the two-sided obstacle problem with an M-matrix are presented. The algorithms are well defined and have polynomial computational complexity. Copyright (C) 2006 John Wiley & Sons, Ltd.
direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the dire...
详细信息
direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the direct algorithm of discrete wavelet transform (DWT),such as discrete convolution operation formula of wavelet coefficients and wavelet components,sampling principle and technology to wavelets, deciding method for scale range of wavelets, measuresto solve edge effect problem, etc, are obtained. The realization of direct algorithm of continuouswavelet transform (CWT) is also studied. The computing cost of direct algorithm and Mallat algorithmof DWT are still studied, and the computing formulae are obtained. These works are beneficial todeeply understand WT and Mallat algorithm. Examples in the end show that direct algorithm can alsobe applied widely.
Two parallel deterministic direct search algorithms are combined to find improved parameters for a system of differential equations designed to simulate the cell cycle of budding yeast. Comparing the model simulation...
详细信息
Two parallel deterministic direct search algorithms are combined to find improved parameters for a system of differential equations designed to simulate the cell cycle of budding yeast. Comparing the model simulation results to experimental data is difficult because most of the experimental data is qualitative rather than quantitative. An algorithm to convert simulation results to mutant phenotypes is presented. Vectors of the 143 parameters defining the differential equation model are rated by a discontinuous objective function. Parallel results on a 2200 processor supercomputer are presented for a global optimization algorithm, direct, a local optimization algorithm, MADS, and a hybrid of the two. A second formulation is presented that uses a system of smooth inequalities to evaluate the phenotype of a mutant. Preliminary results of this formulation are given.
The grating measurement systems can be used for displacement and angle measurements. They require of zero reference codes to obtain zero reference signals and absolute measures. The zero reference signals are obtained...
详细信息
The grating measurement systems can be used for displacement and angle measurements. They require of zero reference codes to obtain zero reference signals and absolute measures. The zero reference signals are obtained from the autocorrelation of two identical zero reference codes. The design of codes which generate optimum signals is rather complex, especially for larges codes. In this paper we present a global optimization method, a direct algorithm for the design of zero reference codes. This method proves to be a powerful tool for solving this inverse problem. (C) 2005 Optical Society of America.
This paper describes a method for separating a target sound from other noise arriving in a single direction when the target cannot, therefore, be separated by directivity control. Microphones are arranged in a line to...
详细信息
This paper describes a method for separating a target sound from other noise arriving in a single direction when the target cannot, therefore, be separated by directivity control. Microphones are arranged in a line toward the sources to form null sensitivity points at given distances from the microphones. The null points exclude non-target sound sources on the basis of weighting coefficients for microphone outputs determined by blind source separation. The separation problem is thereby simplified to instantaneous separation by adjustment of the time-delays for microphone outputs. The system uses a direct (i.e. non-iterative) algorithm for blind separation based on second-order statistics, assuming that all sources are non-stationary signals. Simulations show that the 2-microphone system can separate a target sound with separability of more than 40 dB for the 2-source problem, and 25 dB for the 3-source problem when the other sources are adjacent.
The direct (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (Journal of Optimization Theory and Applications, vol. 79, no. 1, pp. 157-181, 1993), a variant of Lipschitzian methods for bound constraine...
详细信息
The direct (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (Journal of Optimization Theory and Applications, vol. 79, no. 1, pp. 157-181, 1993), a variant of Lipschitzian methods for bound constrained global optimization, has proved effective even in higher dimensions. However, the performance of a direct implementation in real applications depends on the characteristics of the objective function, the problem dimension, and the desired solution accuracy. Implementations with static data structures often fail in practice, since it is difficult to predict memory resource requirements in advance. This is especially critical in multidisciplinary engineering design applications, where the direct optimization is just one small component of a much larger computation, and any component failure aborts the entire design process. To make the direct global optimization algorithm efficient and robust on large-scale, multidisciplinary engineering problems, a set of dynamic data structures is proposed here to balance the memory requirements with execution time, while simultaneously adapting to arbitrary problem size. The focus of this paper is on design issues of the dynamic data structures, and related memory management strategies. Numerical computing techniques and modifications of Jones' original direct algorithm in terms of stopping rules and box selection rules are also explored. Performance studies are done for synthetic test problems with multiple local optima. Results for application to a site-specific system simulator for wireless communications systems ((SW)-W-4) are also presented to demonstrate the effectiveness of the proposed dynamic data structures for an implementation of direct.
Given the fundamental matrix connecting two uncalibrated images of a 3D scene, a convenient procedure is presented for determining transformations to make corresponding points lie on the same horizontal lines. The met...
详细信息
Given the fundamental matrix connecting two uncalibrated images of a 3D scene, a convenient procedure is presented for determining transformations to make corresponding points lie on the same horizontal lines. The method is illustrated using two images of a calibration cube, one of many successful applications.
暂无评论