This paper first exposes some of the defects in the interval arithmetic algorithms of Moore and Krückeberg. Then it identifies classes of problems on which these algorithms compute "optimum bounds".

Chain-of-events data are longitudinal observations on a succession of events that can only occur in a prescribed order. One goal in an analysis of this type of data is to determine the distribution of ...