Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Sri Gopal Mohanty"'
Publikováno v:
Lattice Path Combinatorics and Applications ISBN: 9783030111014
The paper consists of four parts. The first part is a description of the first author’s recollection of Takacs - their acquaintance, him as a teacher and a mentor. In the second part, he recounts Takacs’ life from his childhood to schools, univer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2d1581be776ae32506ad6b7c1d4227f
https://doi.org/10.1007/978-3-030-11102-1_1
https://doi.org/10.1007/978-3-030-11102-1_1
Autor:
Alan C. Krinik, Sri Gopal Mohanty
Publikováno v:
Journal of Statistical Planning and Inference. 140:2271-2284
We consider batch queueing systems M / M H / 1 and M H / M / 1 with catastrophes. The transient probability functions of these queueing systems are obtained by a Lattice Path Combinatorics approach that utilizes randomization and dual processes. Stea
Autor:
Sri Gopal Mohanty
Publikováno v:
Journal of Statistical Planning and Inference. 135:158-164
In a two-sample (say, X-sample and Y-sample) non-parametric testing problem, two joint null distributions of a statistic similar to the Galton statistic and either the number of Y-runs or the maximum length of Y-runs are derived by using two well-kno
Publikováno v:
Annals of the Institute of Statistical Mathematics. 49:155-169
A general probability model for a start-up demonstration test is studied. The joint probability generating function of some random variables appearing in the Markov dependence model of the start-up demonstration test with corrective actions is derive
Publikováno v:
Queueing Systems. 26:255-267
In this paper we present a combinatorial technique which allows the derivation of the transition functions of general birth–death processes. This method provides a flexible tool for the transient analysis of Markovian queueing systems with state de
Publikováno v:
Annals of the Institute of Statistical Mathematics. 48:773-787
The probability generating functions of the waiting times for the first success run of length k and for the sooner run and the later run between a success run of length k and a failure run of length r in the second order Markov dependent trials are d
Publikováno v:
Discrete Mathematics. 139(1-3):273-285
It is well known that the generating function for tableaux of a given skew shape with r rows where the parts in the i th row are bounded by some nondecreasing upper and lower bounds which depend on i can be written in the form of a determinant of siz
Publikováno v:
Discrete Mathematics. 126:195-208
n -dimensional lattice paths which do not touch the hyperplanes x i − x i +1 =⇔-1, i = 1,2,…, n − 1, and x n − x 1 =−1− K are enumerated by certain statistics, one of which is MacMahon's major index, the others being variations of it. B
Autor:
Walter Böhm, Sri Gopal Mohanty
Publikováno v:
Queueing Systems. 18:27-45
In this paper we consider a discrete time queueing model where the time axis is divided into time slots of unit length. The model satisfies the following assumptions: (i) an event is either an arrival of typei of batch sizebi, i=1,...,r with probabil