In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M(n)/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues wi...
详细信息
In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M(n)/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M(n)/G/1/K queue with statedependent vacations.
In this article we examine the possibility of improving the recursive algorithm for computation of box-dimension of complex sets. The known method of box-counting is simplified down to the simple sign counting operati...
详细信息
ISBN:
(纸本)9537138054
In this article we examine the possibility of improving the recursive algorithm for computation of box-dimension of complex sets. The known method of box-counting is simplified down to the simple sign counting operation. Our target set is a "cloud" of amorphous points since many fractal sets are given in this form. The key of the algorithm are affine transformations from the world coordinate system to the parametric one and renormalization using as elementary operations as binary dilatation and unit shift transformations. The verification of the quality of results of the generated algorithm is established in the testing phase of the algorithm.
A new efficient algorithm for generating polarity matrix elements of ternary fixed polarity arithmetic transform is presented. The algorithm directly operates on the truth vector of a ternary function and it calculate...
详细信息
ISBN:
(纸本)9781424403868
A new efficient algorithm for generating polarity matrix elements of ternary fixed polarity arithmetic transform is presented. The algorithm directly operates on the truth vector of a ternary function and it calculates the spectral coefficients of all or selected fixed polarity arithmetic expansions for the function. It is simple and works in a recursive manner. Computational cost for the new algorithm has been derived and it is shown that the new algorithm has low computational costs.
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a H...
详细信息
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a Hamiltonian set of 2n first order ODEs in the generalized coordinates q and the canonical momenta p. These Hamiltonian equations are derived from a recursive Newton Euler formulation. As an example, it is shown how, in the case of a serial structure with rotational joints, an O(n) formulation is obtained. The amount of arithmetical operations is considerably less than acceleration based O(n) formulations.
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a H...
详细信息
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a Hamiltonian set of 2n first order ODEs in the generalized coordinates q and the canonical momenta p. These Hamiltonian equations are derived from a recursive Newton Euler formulation. As an example, it is shown how, in the case of a serial structure with rotational joints, an O(n) formulation is obtained. The amount of arithmetical operations is considerably less than acceleration based O(n) formulations.
A recursive algorithm of moving horizon estimation (MHE) with the convergence property is presented in this paper. In this work, we formulate the state estimation problem as a quadratic program problem with fixed-size...
详细信息
ISBN:
(纸本)078037729X
A recursive algorithm of moving horizon estimation (MHE) with the convergence property is presented in this paper. In this work, we formulate the state estimation problem as a quadratic program problem with fixed-size estimation window and a recursive formula for prior state estimation and covariance matrix is established. The proposed algorithm can improve the performance of MHE and offers advantages over other algorithm of MHE and Kalman filter.
Generic propagation model always have accuracy problems. Without model calibration, it can hardly be used in practice. This article develops a recursive algorithm on radio propagation model calibration for CDMA system...
详细信息
ISBN:
(纸本)7505350668
Generic propagation model always have accuracy problems. Without model calibration, it can hardly be used in practice. This article develops a recursive algorithm on radio propagation model calibration for CDMA systems. An evaluation method is introduced and actual drive test results are used to verify the refined model's goodness of fit. From the results it can be seen that the calibration method in this paper is feasible in practice.
Exponential tail bounds are derived for solutions of max-recursive equations and for max-recursive random sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algori...
详细信息
Exponential tail bounds are derived for solutions of max-recursive equations and for max-recursive random sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise in the worst case analysis of divide and conquer algorithms, in parallel search algorithms or in the height of random tree models. For the proof we determine asymptotic bounds for the moments or for the Laplace transforms and apply a characterization of exponential tail bounds due to Kasahara (1978).
In this Letter an efficient recursive update algorithm for least squares support vector machines (LSSVMs) is developed. Using the previous solution and some matrix equations, the algorithm completely avoids training t...
详细信息
In this Letter an efficient recursive update algorithm for least squares support vector machines (LSSVMs) is developed. Using the previous solution and some matrix equations, the algorithm completely avoids training the LSSVM all over again whenever new training sample is available. The gain in speed using the recursive update algorithm is illustrated on four data sets from UCI repository: the Statlog Australian credit, the Pima Indians diabetes, the Wisconsin breast cancer, and the adult income data sets.
The convergence theorems for the stochastic approximation (SA) algorithm with expanding truncations are first presented, which the system identification methods discussed in the paper are essentially based on. Then, t...
详细信息
The convergence theorems for the stochastic approximation (SA) algorithm with expanding truncations are first presented, which the system identification methods discussed in the paper are essentially based on. Then, the recursive identification algorithms are respectively defined for the multivariate errors-in-variables systems, Hammerstein systems, and Wiener systems. All estimates given in the paper are strongly consistent.
暂无评论