We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let P be a set of n points in R. A point lies on the convex hull of a point set S if it lies on the boundary of the minimum convex polygon formed by S. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in P that also fal...

A new scheme called ‘Collaborative Spreading’ is proposed for the downlink of CDMA to allow the sharing of the same spreading sequence by more than one user. In particular, it addresses the problem of user overloading and maintain the use of the same set of available orthogonal sequences and simple receiver structure. In this scheme, a total of K users are divided into G groups each containing ...

— In this paper, an algorithm for construction of multiple sets of two dimensional (2D) or matrix unipolar (optical) orthogonal codes has been proposed. Representations of these 2D codes in difference of positions representation (DoPR) have also been discussed along-with conventional weighted positions representation (WPR) of the code. This paper also proposes less complex methods for calculati...

This paper provides a new explicit expression for all real FIR paraunitary filters. From this we derive a new procedure for the design of the L components of any 2-channel FIR orthogonal L-tap filter. The input of this algorithm is any set of L/2 free parameters. Moreover, our procedure provides a parameterization of all orthogonal filters directly, with no need for iterations. For the special ...

An analytical methodology based on spectrophotometric and partial least squares (PLS) algorithm for thesimultaneous determination of ampicillin and penicillin in human plasma was developed and validated. Themultivariate model was developed as a binary calibration model and it was built and validated with anindependent set of synthesis and real samples in presence of matrix. It is shown how a de...

In this paper, we show that the projection of a regular orthogonal array of strength t onto more than t factors consists of replicates of either a fractional factorial or a full factorial design of strength t, depending on the number of factors retained in the projection.

In this paper we show additional properties of the limit of the sequence produced by the subspace correction algorithm proposed by Fornasier and Schönlieb [24] for L2/TV -minimization problems. Inspired by the work of Vonesch and Unser [34], we adapt and specify this algorithm to the case of an orthogonal wavelet space decomposition and for deblurring problems.

Transitive sets of subspaces of a vector space over a finite field under extended symplectic, unitary and orthogonal groups are determined and their cardinals are computed. The number of subspaces in a transitive set contained in a given subspace of the ordinary symplectic, unitary or orthogonal geometries is also computed. These numbers have obvious applications in block designs. 1. The symple...

A two parameter family of multiresolution analyses of L 2 (R 2) each generated by three orthogonal, continuous, compactly supported scaling functions is constructed using fractal interpolation surfaces. The scaling functions remain orthogonal when restricted to certain triangles making them useful for problems with bounded domains. In the usual construction of a wavelet using a multiresolution ...

Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...