k-TH+BEST+CANDIDATE&rft.title=Probability+in+the+Engineering+and+Informational+Sciences&rft.issn=0269-9648&rft.date=2019&rft.volume=33&rft.spage=327&rft.epage=347&rft.aulast=Lin&rft.aufirst=Yi-Shen&rft.au=Yi-Shen+Lin&rft.au=Shoou-Ren+Hsiau,+Yi-Ching+Yao&rft_id=info:doi/10.1017/S0269964818000256">OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

Authors:Yi-Shen Lin; Shoou-Ren Hsiau, Yi-Ching Yao Pages: 327 - 347 Abstract: In the subject of optimal stopping, the classical secretary problem is concerned with optimally selecting the best of n candidates when their relative ranks are observed sequentially. This problem has been extended to optimally selecting the kth best candidate for k ≥ 2. While the optimal stopping rule for k=1,2 (and all n ≥ 2) is known to be of threshold type (involving one threshold), we solve the case k=3 (and all n ≥ 3) by deriving an explicit optimal stopping rule that involves two thresholds. We also prove several inequalities for p(k, n), the maximum probability of selecting the k-th best of n candidates. It is shown that (i) p(1, n) = p(n, n) > p(k, n) for 1 PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000256 Issue No:Vol. 33, No. 3 (2019)

Authors:Paul Ezhilchelvan; Isi Mitrani Pages: 348 - 366 Abstract: A cloud provider hosts virtual machines (VMs) of different types, with different resource requirements. There are bounds on the total amounts of each kind of resource that are available. Requests arrive in batches of different sizes. Under the ‘complete blocking’ policy, a request is accepted only if all the VMs in its batch can be accommodated. The ‘partial blocking’ policy would accept a request if there is room for at least one of the VMs in the batch. Blocked requests are lost, with an associated loss of revenue. The trade-offs between costs and benefits are evaluated by means of appropriate models, for which novel solutions based on fixed-point iterations are proposed. The applicability of those solutions is extended, by means of simplifications, to very large-scale systems. Numerical examples and comparisons with simulations are presented. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000323 Issue No:Vol. 33, No. 3 (2019)

Authors:Brian Fralix Pages: 367 - 386 Abstract: We use the random-product technique from [5] to study both the steady-state and time-dependent behavior of a Markovian reentrant-line model, which is a generalization of the preemptive reentrant-line model studied in the work of Adan and Weiss [2]. Our results/observations yield additional insight into why the stationary distribution of the reentrant-line model from [2] exhibits an almost-geometric product-form structure: indeed, our generalized reentrant-line model, when stable, admits a stationary distribution with a similar product-form representation as well. Not only that, the Laplace transforms of the transition functions of our reentrant-line model also have a product-form structure if it is further assumed that both Buffers 2 and 3 are empty at time zero. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000268 Issue No:Vol. 33, No. 3 (2019)

Authors:E. Sudyko; A.A. Nazarov, J. Sztrik Pages: 387 - 403 Abstract: The aim of the paper is to derive the distribution of the number of retrial of the tagged request and as a consequence to present the waiting time analysis of a finite-source M/M/1 retrial queueing system by using the method of asymptotic analysis under the condition of the unlimited growing number of sources. As a result of the investigation, it is shown that the asymptotic distribution of the number of retrials of the tagged customer in the orbit is geometric with given parameter, and the waiting time of the tagged customer has a generalized exponential distribution. For the considered retrial queuing system numerical and simulation software packages are also developed. With the help of several sample examples the accuracy and range of applicability of the asymptotic results in prelimit situation are illustrated showing the effectiveness of the proposed approximation. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000207 Issue No:Vol. 33, No. 3 (2019)

Authors:M. Matalytski; D. Kopats Pages: 404 - 416 Abstract: The object of research is G-network with positive customers and signals of multiple classes. The present paper describes an analysis of this network at a non-stationary regime, also provided a description of method for finding non-stationary state probabilities.At the beginning of the article, a description of the network with positive customers and signals is given. A signal when entering the system destroys a positive customer of its type or moves the customer of its type to another system. Streams of positive customers and signals arriving to each of the network systems are independent. Selection of positive customers of all classes for service – randomly. For non-stationary state probabilities of the network, the system of Kolmogorov difference-differential equations (DDE) has been derived. It is solved by a modified method of successive approximations, combined with the method of series. The convergence of successive approximations with time has been proved to the stationary distribution of probabilities, the form of which is indicated in the article, and the sequence of approximations converges to the unique solution of the DDE system. Any successive approximation is representable in the form of a convergent power series with an infinite radius of convergence, the coefficients of which satisfy recurrence relations, which is convenient for computer calculations.The obtained results can be applied for modeling behavior of computer viruses and attack in computer systems and networks, for example, as model impact of some file viruses on server resources. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000219 Issue No:Vol. 33, No. 3 (2019)

Authors:Zhenghua Long; Jiheng Zhang Pages: 417 - 437 Abstract: We extend the measure-valued fluid model, which tracks residuals of patience and service times, to allow for time-varying arrivals. The fluid model can be characterized by a one-dimensional convolution equation involving both the patience and service time distributions. We also make an interesting connection to the measure-valued fluid model tracking the elapsed waiting and service times. Our analysis shows that the two fluid models are actually characterized by the same one-dimensional convolution equation. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000232 Issue No:Vol. 33, No. 3 (2019)

Authors:S. Zarezadeh; M. Asadi, S. Eftekhar Pages: 438 - 459 Abstract: The signature matrix of an n-component three-state network (system), which depends only on the network structure, is a useful tool for comparing the reliability and stochastic properties of networks. In this paper, we consider a three-state network with states up, partial performance, and down. We assume that the network remains in state up, for a random time T1 and then moves to state partial performance until it fails at time T>T1. The signature-based expressions for the conditional entropy of T given T1, the joint entropy, Kullback-Leibler (K-L) information, and mutual information of the lifetimes T and T1 are presented. It is shown that the K-L information, and mutual information between T1 and T depend only on the network structure (i.e., depend only to the signature matrix of the network). Some signature-based stochastic comparisons are also made to compare the K-L of the state lifetimes in two different three-state networks. Upper and lower bounds for the K-L divergence and mutual information between T1 and T are investigated. Finally the results are extended to n-component multi-state networks. Several examples are examined graphically and numerically. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000177 Issue No:Vol. 33, No. 3 (2019)

Authors:Abedin Haidari; Amir T. Payandeh Najafabadi Pages: 460 - 470 Abstract: The main aim of this paper is to present two new results concerning the characterization of likelihood ratio and reversed hazard rate orders between largest order statistics from two sets of independent heterogeneous and homogeneous exponentiated generalized gamma distributed random variables. These characterization results complete and strengthen some previous ones in the literature. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000220 Issue No:Vol. 33, No. 3 (2019)

Authors:Guoxin Qiu; Lechen Wang, Xingyu Wang Pages: 471 - 486 Abstract: An expression of the extropy of a mixed system's lifetime was given firstly. Based on this expression, two mixed systems with same signature but with different components were compared. It was shown that the extropy of lifetime of a mixed system equals to that of its dual system if the lifetimes of the components have symmetric probability density function. Moreover, some bounds of the extropy of lifetimes of mixed systems were obtained and the concept of Jensen–extropy (JE) divergence of mixed systems was proposed. The JE divergence is non-negative and it can be used as an alternative information criteria for comparing mixed systems with homogeneous components. To illustrate the applications of JE divergence, some examples are addressed at the end of this paper. PubDate: 2019-07-01T00:00:00.000Z DOI: 10.1017/S0269964818000244 Issue No:Vol. 33, No. 3 (2019)