Disaster arrival into a queueing system causes all customers to leave the system instantaneously. We present a numerically stable algorithm for calculating the stationary state distribution of an embedded Markov chain...
详细信息
Disaster arrival into a queueing system causes all customers to leave the system instantaneously. We present a numerically stable algorithm for calculating the stationary state distribution of an embedded Markov chain for the BMAP/SM/l queue with a MAP input of disasters.
This paper explains the construction of a numerically stable algorithm for resonance frequency analysis of system of nested dielectric, metamaterial, impedance and perfectly conductive circular cylinders. The method i...
详细信息
ISBN:
(纸本)9781538661161
This paper explains the construction of a numerically stable algorithm for resonance frequency analysis of system of nested dielectric, metamaterial, impedance and perfectly conductive circular cylinders. The method is based on analytic regularization method. However, since the spectral problem is under consideration, contrary to the formerly suggested algorithms for circular cylinders, here the two-side regularizer are specified from the asymptotic analysis which do not destroy the resonance frequencies. Numerical examples demonstrate the numerical efficiency of our algorithm.
In this paper, we derive fast and numerically stable algorithms for discrete cosine transforms (DCT) of radix-2 length which are based on real factorizations of the corresponding cosine matrices into products of spars...
详细信息
In this paper, we derive fast and numerically stable algorithms for discrete cosine transforms (DCT) of radix-2 length which are based on real factorizations of the corresponding cosine matrices into products of sparse, (almost) orthogonal matrices of simple structure. These algorithms are completely recursive, are simple to implement and use only permutations, scaling with root2, butterfly operations, and plane rotations/rotation-reflections. Our algorithms have low arithmetic costs which compare with known fast DCT algorithms. Further, a detailed analysis of the roundoff errors for the presented DCT algorithms shows their excellent numerical stability which outperforms a real fast DCT algorithm based on polynomial arithmetic. (C) 2004 Elsevier Inc. All rights reserved.
In this paper we present a stable recursive algorithm for the calculation of the probability of ultimate ruin in the classical risk model. We also present stable recursive algorithms for the calculation of the joint a...
详细信息
Multi-source global broadcast is a fundamental problem in multi-hop wireless networks. The Static Multi-source Global Broadcast problem (SMGB), which considers static packet injection at all source nodes, has been ext...
详细信息
Multi-source global broadcast is a fundamental problem in multi-hop wireless networks. The Static Multi-source Global Broadcast problem (SMGB), which considers static packet injection at all source nodes, has been extensively studied in recent years. However, packets are more likely to be continuously injected over time in realistic multi-hop wireless networks. In this paper, we focus on studying the Dynamic Multi-source Global Broadcast problem (DMGB), in which packets are continuously injected to k (k >= 2) source nodes in the network according to a widely-used dynamic packet injection model and the objective is to disseminate each injected packet across the whole network quickly. We solve this DMGB problem under the Signal-to-Interference-plus-Noise-Ratio (SINR) interference model. Specifically, we first present a distributed randomized algorithm for solving the SMGB problem. We then iterate this SMGB algorithm repeatedly to construct a distributed DMGB algorithm. We prove the proposed DMGB algorithm is stable, i.e., the expected number of packets in each node's message queue is bounded at any time and further the expected global broadcast latency for each injected packet is bounded. Simulation results validate the effectiveness of the proposed DMGB algorithm.
The problem of reconstructing an unknown input under measuring a phase coordinates of a Schlogl equation is considered. We propose a solving algorithm that is stable to perturbations and is based on the combination of...
详细信息
The problem of reconstructing an unknown input under measuring a phase coordinates of a Schlogl equation is considered. We propose a solving algorithm that is stable to perturbations and is based on the combination of ideas from the theory of dynamical inversion and the theory of guaranteed control. The convergence rate of the algorithm is obtained.
A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider stability and optimality. To address ...
详细信息
A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider stability and optimality. To address these problems, we propose methodologies to design stable and optimal PLUS factorization algorithms. Firstly, we propose three stable PLUS factorization algorithms, prove the stability theorem under no perturbation and analyze stability under perturbation. Furthermore, we obtain a closed-form formula for transform error, and use the formula to design an algorithm for optimal PLUS factorization. Then, we apply the PLUS factorization to image coding. The integer DCTs implemented with the optimal PLUS factorizations found by our algorithms outperform the integer DCT with expansion factors in terms of entropy. The optimal PLUS factorizations are superior to the lifting factorization in JPEG-XR. The experimental results agree with analytical results of PLUS factorization, and show superior performance of our algorithms in image coding. (C) 2010 Elsevier Inc. All rights reserved.
The problem of reconstructing an unknown disturbance under measuring a part of phase coordinates of a system of linear differential equations is considered. Solving algorithm is designed. The algorithm is based on the...
详细信息
The problem of reconstructing an unknown disturbance under measuring a part of phase coordinates of a system of linear differential equations is considered. Solving algorithm is designed. The algorithm is based on the combination of ideas from the theory of dynamical inversion and the theory of guaranteed control. The algorithm consists of two blocks: the block of dynamical reconstruction of unmeasured coordinates and the block of dynamical reconstruction of an input.
The problem of reconstructing an unknown input under measuring a part of phase coordinates of a system of ordinary differential equations is considered. We propose a solving algorithm that is stable to perturbations a...
详细信息
The problem of reconstructing an unknown input under measuring a part of phase coordinates of a system of ordinary differential equations is considered. We propose a solving algorithm that is stable to perturbations and is based on the combination of ideas from the theory of dynamical inversion and the theory of guaranteed control. The algorithm consists of two blocks: the block of dynamical reconstruction of unmeasured coordinates and the block of dynamical reconstruction of an input.
Multi-dimensional asymptotically quasi-Toeplitz Markov chains with discrete and continuous time are introduced. Ergodicity and non-ergodicity conditions are proven. Numerically stable algorithm to calculate the statio...
详细信息
Multi-dimensional asymptotically quasi-Toeplitz Markov chains with discrete and continuous time are introduced. Ergodicity and non-ergodicity conditions are proven. Numerically stable algorithm to calculate the stationary distribution is presented. An application of such chains in retrial queueing models with Batch Markovian Arrival Process is briefly illustrated.
暂无评论