This paper explores confidence intervals for the family of proportional reversed hazard distributions based on lower record values. The proposed procedure can be extended to the family of proportional hazard distributions based on upper record values. Numerical results show that the method is promising.

This paper proposes optimal prediction intervals for the future generalized order statistic (GOS) based on the first GOS (ordinary order statistics, usual record values, -record values) from an exponential population. A conditional argument is considered for obtaining an optimal prediction interval for future GOS. A numerical example illustrates this technique.

In the present paper Shannon’s entropy for concomitants of generalized order statistics in FGM family is obtained. Application of this result is given for order statistics, record values, k-record values, and progressive type II censored order statistics. Also, we show that the Kullback-Leibler distance among the concomitants of generalized order statistics is distributionfree.

In this paper, the likelihood ratio approach is applied for measuring evidence provided by record data in favor of a hypothesis against an alternative under a random sampling scheme. Explicit expressions for probabilities of observing strong andweak evidences are derived. Asymptotic behaviors of these probabilities are investigated in a greater detail. Optimal sample size in which the substanti...

Linked records are a general mechanism to build data structures like lists, trees, and graphs. Most high-level programming languages only provide the definition of record types, an operator for component selection, and allocation of record storage. We propose to specify complete graph structures by context-free grammars. A tool can be used to transform such a specification into a set of record ...

Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to nd, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Time and work optimal algorithms for this problem are known on all the PRAM models 3], 5], but the running time of the best previous hypercube algorithm 6] is optimal only when...