This article is concerned with the problem of constructing A-optimal design for polynomial regression with analytic weight function on the interval [m - a, m + a], m, a > 0. It is shown that the structure of the op...
详细信息
This article is concerned with the problem of constructing A-optimal design for polynomial regression with analytic weight function on the interval [m - a, m + a], m, a > 0. It is shown that the structure of the optimal design depends on a and weight function only, as a close to 0. Moreover, if the weight function is an analytic function a, then a scaled version of optimal support points, and weights are analytic functions of a at a = 0. We make use of a Taylor expansion to provide a recursive procedure for calculating the A-optimal designs. Examples are presented to illustrate the procedures for computing the optimal designs. [ABSTRACT FROM AUTHOR]
A heuristic recursive algorithm for the two-dimensional rectangular strip packing problem is presented. It is based on a recursive structure combined with branch-and-bound techniques. Several lengths are tried to dete...
详细信息
A heuristic recursive algorithm for the two-dimensional rectangular strip packing problem is presented. It is based on a recursive structure combined with branch-and-bound techniques. Several lengths are tried to determine the minimal plate length to hold all the items. Initially the plate is taken as a block. For the current block considered, the algorithm selects an item, puts it at the bottom-left corner of the block, and divides the unoccupied region into two smaller blocks with an orthogonal cut. The dividing cut is vertical if the block width is equal to the plate width;otherwise it is horizontal. Both lower and upper bounds are used to prune unpromising branches. The computational results on a class of benchmark problems indicate that the algorithm performs better than several recently published algorithms. (C) 2006 Elsevier Ltd. All rights reserved.
Some modifications of the algorithm of image construction with a high sampling frequency are proposed. These modifications multiply reduce the computational costs with an almost unchanged quality of the result. Softwa...
详细信息
Some modifications of the algorithm of image construction with a high sampling frequency are proposed. These modifications multiply reduce the computational costs with an almost unchanged quality of the result. Software implementation of the proposed modifications of the algorithm allows the latter to be used in video surveillance systems for real-time formation of high-quality image fragments.
The increased use of automated storage and retrieval systems(AS/RS) is creating the need for computerized control algorithms to support the scheduling and picking *** research addresses an order picking problem in a m...
详细信息
The increased use of automated storage and retrieval systems(AS/RS) is creating the need for computerized control algorithms to support the scheduling and picking *** research addresses an order picking problem in a multi-aisle automated warehouse,in which a stack crane performs storage and retrieval operations,and each item can be found in several storage *** objective is to propose algorithms that minimize the total time traveled by the stack crane to complete the retrieval process of *** traveling salesman problem(TSP) can calculate the shortest distance between cities,order picking problem of the automated warehouse and the TSP are *** this paper,we use recursive algorithm to solve order picking *** experiment proved that the order picking optimization of the stacker systems will be of great significance for the RS to improve its ***,the recursive algorithm has been applied to practice.
A circular connected-(r, s)-out-of-(m, n):F lattice system consists of m X n components arranged in a cylindrical grid. Each of m circles has n components, and this system fails if and only if there exists a grid of s...
详细信息
A circular connected-(r, s)-out-of-(m, n):F lattice system consists of m X n components arranged in a cylindrical grid. Each of m circles has n components, and this system fails if and only if there exists a grid of size r X s which all components are failed. A circular connected-(r, s)-out-of-(m, n):F lattice system might be used in reliability models for 'Feelers for measuring temperature on reaction chamber' and 'TFT Liquid Crystal Display system with 360 degrees wide area'. In this study, we proposed a new recursive algorithm for obtaining the reliability of a circular connected-(r, s)out-of-(m, n):F lattice system. We evaluated our proposed algorithms in terms of computing time and memory capacity. Furthermore, a numerical experiment comparing our proposed algorithm with Yamamoto and Miyakawa's algorithm [Yamamoto, H., & Miyakawa, M. (1996). Reliability of circular connected-(r, s)-out-of-(m, n):F lattice system. Journal of the Operations Research Society of Japan, 39(3), 389-406] showed that our proposed algorithm is more effective for systems with a large n. (c) 2005 Elsevier Ltd. All rights reserved.
algorithms have been available for exact performance evaluation of multi-state k-out-of-n systems. However, especially for complex systems with a large number of components, and a large number of possible states, obta...
详细信息
algorithms have been available for exact performance evaluation of multi-state k-out-of-n systems. However, especially for complex systems with a large number of components, and a large number of possible states, obtaining "reliability bounds" would be an interesting, significant issue. Reliability bounds will give us a range of the system reliability in a much shorter computation time, which allow us to make decisions more efficiently. The systems under consideration are multi-state k-out-of-n systems with i.i.d. components. We will focus on the probability of the system in states below a certain state d, denoted by Q(sd). Based on the recursive algorithm proposed by Zuo & Tian [14] for performance evaluation of multi-state k-out-of-n Systems with i.i.d. components, a reliability bounding approach is developed in this paper. The upper, and lower bounds of Q(sd) are,calculated by reducing the length of the k vector when using the recursive algorithm. Using the bounding approach, we can obtain a good estimate of the exact Q(sd) value while significantly reducing the computation time. This approach is attractive, especially to complex systems with a large number of components, and a large number of possible states. A numerical example is used to illustrate the significance of the proposed bounding approach.
This paper investigates on an accurate channel estimation scheme for fast fading channels in multiple-input multiple-output (MIMO) mobile communications. A high-order exponential-weighted recursive least-squares (EW-R...
详细信息
This paper investigates on an accurate channel estimation scheme for fast fading channels in multiple-input multiple-output (MIMO) mobile communications. A high-order exponential-weighted recursive least-squares (EW-RLS) method has been known as a good channel estimation scheme in rapid fading. However, there exists a drawback that we need to properly adjust the estimation parameters of a forgetting factor and an estimation order according to the channel environment. In this paper, we theoretically derive an optimum-weighted LS (OW-LS) channel estimation based on the statistical knowledge of the spatio-temporal channel correlation. Through the analysis, we reveal that the zero-th order polynomial becomes optimal when the optimum-weighting is employed. Furthermore, we propose an efficient recursive algorithm for channel tracking in order to reduce the computational complexity. Since the proposed scheme automatically adapts the weighting coefficients to the channel condition, it has a significant advantage in mean-square error (MSE) performance compared to the EW-RLS scheme.
For the complete graph K-n, its rupture degree is defined as 1-n;and for a noncomplete connected graph G, its rupture degree is defined by r(G) = max{omega(G-X) - vertical bar X vertical bar - m(G-X) : X subset of V (...
详细信息
For the complete graph K-n, its rupture degree is defined as 1-n;and for a noncomplete connected graph G, its rupture degree is defined by r(G) = max{omega(G-X) - vertical bar X vertical bar - m(G-X) : X subset of V (G), omega(G-X) > 1}, where omega(G-X) is the number of components of G-X and m(G-X) is the order of a largest component of G - X. It is shown that this parameter can be well used to measure the vulnerability of networks. Li and Li proved in 2004 that computing the rupture degree for a general graph is NP-complete. In this paper, we give a recursive algorithm for computing the rupture degree of trees, and determine the maximum and minimum rupture degree of trees with given order and maximum degree.
This paper discusses the infinite horizon static output feedback stochastic Nash games involving state-dependent noise in weakly coupled large-scale systems. In order to construct the strategy. the conditions for the ...
详细信息
This paper discusses the infinite horizon static output feedback stochastic Nash games involving state-dependent noise in weakly coupled large-scale systems. In order to construct the strategy. the conditions for the existence of equilibria have been derived front the solutions of the sets of cross-coupled stochastic algebraic Riccati equations (CSAREs). After establishing the asymptotic structure along with the positive semidefiniteness for the solutions of CSAREs, recursive algorithm for solving CSAREs is derived. As a result, it is shown that the proposed algorithm attains the reduced-order computations and the reduction of the CPU time. As another important contribution. the uniqueness of the strategy set is proved tor the sufficiently small parameter epsilon. Finally. in order to demonstrate the efficiency of the proposed algorithm, numerical example is given.
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While many papers, introducing fast algorithm...
详细信息
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While many papers, introducing fast algorithms for the computation of Zernike moments have been presented in the literature, there is not any work studying the numerical behaviour of these methods. These algorithms have been in the past compared to each other only according to their computational complexity, without been given the appropriate attention, as far as their numerical stability is concerned, being the most significant part of the algorithms' reliability. The present contribution attempts to fill this gap in the literature, since it mainly demonstrates that the usefulness of a recursive algorithm is defined not only by its low computational complexity, but most of all by its numerical robustness. This paper exhaustively compares some well known recursive algorithms for the computation of Zernike moments and sets the appropriate conditions in which each algorithm may fall in an unstable state. The experiments show that any of these algorithms can be unstable under some conditions and thus the need to develop more stable algorithms is of major importance. (C) 2007 Elsevier Inc. All rights reserved.
暂无评论