We deene the notion of meet-uniformity for closure operators on a complete lattice, which corresponds to co-additivity restricted to subsets mapped into the same element, and we study its properties. A class of closures given by principal lters and the downward closures are relevant examples of meet-uniform closures. Next, we introduce a lifting of a complete order by means of a meet-uniform cl...

In this paper, we study the performance of the PCM scheme with linear quantization rule for quantizing finite unit-norm tight frame expansions for R and derive the PCM quantization error without the White Noise Hypothesis. We prove that for the class of unit norm tight frames derived from uniform frame paths the quantization error has an upper bound of O(δ) regardless of the frame redundancy. T...

Uniform proofs have been presented as a basis for logic programming, and it is known that by restricting the class of formulae it is possible to guarantee that uniform proofs are complete with respect to provability in intuitionistic logic. In this paper we explore the relationship between uniform proofs and classes of formulae more deeply. Firstly we show that uniform proofs arise naturally as...

The LPC prediction error provides one measure of the success of linear prediction analysis in modeling a speech signal. Although a great deal is known about the properties of the prediction errOr, relatively little has been published about its variation as a function of the position of the analysis frame. In this paper it is shown that a fairly substantial variation in the prediction error is o...

Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse process, the non-uniform fast Fourier transform (NFFT), also called convolutional gridding, is frequently employed. While various investigations have led to...

Combined input-crosspoint buffered (CICB) switches relax arbitration timing and provide high-performance switching for packet switches with high-speed ports. It has been shown that these switches, with one-cell crosspoint buffer and round-robin arbitration at input and output ports, provide 100% throughput under uniform traffic. However, under admissible traffic patterns with nonuniform distrib...

This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...