Let B be a Boolean ring. We briefly consider metric properties for the case where B is a measure algebra. 2 School of PSET, Murdoch University, Murdoch, WA 6150, Australia. Mallat's pyramid algorithm relates the scaling coefficients of a function at one level to the scaling and wavelet coefficients at lower levels. In practice, the scaling coefficients are estimated at some level m , and the algorithm is used to produce estimates of the scaling and wavelet coefficients at lower levels.
Initial errors propagate to lower level estimates.
This paper describes conditions under which this process generates estimates which are uniformly reliable at a particular level, and under which the errors at that level tend uniformly to zero as m increases. 2 School of PSET, Murdoch University, Murdoch, WA 6150, Australia. The algorithm is adapted to solve general LP problems using a proposed technique for finding a starting extreme point. Therefore in practice, this has advantages in testing the feasibility of the constraints and of easily adding or deleting some constraints. The distribution of the number of items drawn in a secretary problem, with an order s selection rule and a success if any of the best s items is selected, is obtained by a probabilistic argument.