Displaying 181 – 200 of 1452

Showing per page

Application des lois non paramétriques dans les systèmes d’attente et la théorie de renouvellement

Smail Adjabi, Karima Lagha, Amar Aïssani (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir : théorie de fiabilité et analyse de survie, files d’attente, maintenance, gestion de stock, théorie de l’économie, ... L’objet de ce travail est d’utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type I F R , D F R , N B U et N W U , présentées par Sengupta (1994), pour l’évaluation de certaines caractéristiques....

Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement

Smail Adjabi, Karima Lagha, Amar Aïssani (2010)

RAIRO - Operations Research

Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir: théorie de fiabilité et analyse de survie, files d'attente, maintenance, gestion de stock, théorie de l'économie, ... L'objet de ce travail est d'utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type IFR, DFR, NBU et NWU, présentées par Sengupta (1994), pour l'évaluation de...

Approximation of bivariate Markov chains by one-dimensional diffusion processes

Daniela Kuklíková (1978)

Aplikace matematiky

The paper deals with several questions of the diffusion approximation. The goal of this paper is to create the general method of reducting the dimension of the model with the aid of the diffusion approximation. Especially, two dimensional random variables are approximated by one-dimensional diffusion process by replacing one of its coordinates by a certain characteristic, e.g. by its stationary expectation. The suggested method is used for several different systems. For instance, the method is applicable...

Approximation of Reliability for a large system with non-markovian repair-times

Jean-Louis Bon, Jean Bretagnolle (2010)

ESAIM: Probability and Statistics

Consider a system of many components with constant failure rate and general repair rate. When all components are reliable and easily reparable, the reliability of the system can be evaluated from the probability q of failure before restoration. In [14], authors give an asymptotic approximation by monotone sequences. In the same framework, we propose, here, a bounding for q and apply it in the ageing property case.

Approximation of the marginal distributions of a semi-Markov process using a finite volume scheme

Christiane Cocozza-Thivent, Robert Eymard (2004)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

In the reliability theory, the availability of a component, characterized by non constant failure and repair rates, is obtained, at a given time, thanks to the computation of the marginal distributions of a semi-Markov process. These measures are shown to satisfy classical transport equations, the approximation of which can be done thanks to a finite volume method. Within a uniqueness result for the continuous solution, the convergence of the numerical scheme is then proven in the weak measure sense,...

Approximation of the marginal distributions of a semi-Markov process using a finite volume scheme

Christiane Cocozza-Thivent, Robert Eymard (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In the reliability theory, the availability of a component, characterized by non constant failure and repair rates, is obtained, at a given time, thanks to the computation of the marginal distributions of a semi-Markov process. These measures are shown to satisfy classical transport equations, the approximation of which can be done thanks to a finite volume method. Within a uniqueness result for the continuous solution, the convergence of the numerical scheme is then proven in the weak measure...

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research - Recherche Opérationnelle

In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures are presented....

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research

In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions...

Asymptotic behavior of a stochastic combustion growth process

Alejandro Ramírez, Vladas Sidoravicius (2004)

Journal of the European Mathematical Society

We study a continuous time growth process on the d -dimensional hypercubic lattice 𝒵 d , which admits a phenomenological interpretation as the combustion reaction A + B 2 A , where A represents heat particles and B inert particles. This process can be described as an interacting particle system in the following way: at time 0 a simple symmetric continuous time random walk of total jump rate one begins to move from the origin of the hypercubic lattice; then, as soon as any random walk visits a site previously...

Asymptotic behavior of the hitting time, overshoot and undershoot for some Lévy processes

Bernard Roynette, Pierre Vallois, Agnès Volpi (2008)

ESAIM: Probability and Statistics

Let ( X t , t 0 ) be a Lévy process started at 0 , with Lévy measure ν . We consider the first passage time T x of ( X t , t 0 ) to level x > 0 , and K x : = X T x - 𝑥 the overshoot and L x : = x - X T 𝑥 - the undershoot. We first prove that the Laplace transform of the random triple ( T x , K x , L x ) satisfies some kind of integral equation. Second, assuming that ν admits exponential moments, we show that ( T x ˜ , K x , L x ) converges in distribution as x , where T x ˜ denotes a suitable renormalization of T x .

Currently displaying 181 – 200 of 1452