processing 
It is shown that the onedimensional sampling sets correspond to Bessel sequences of complex exponentials that are not Riesz bases for $L^2[R,R].$ A signal processing application in which such sampling sets arise naturally is described in detail.


The Discrete Wavelet Transform (DWT) is of considerable practical use in image and signal processing applications.


Among all image transforms, the classical (Euclidean) Fourier transform has had the widest range of applications in image processing.


The projectively adapted properties of theSL(2, ?)harmonic analysis, as applied to the problems, in image processing, are confirmed by computational tests.


Such systems play an important role in timefrequency analysis and digital signal processing.


Prolate Spheroidal Wave Functions (PSWFs) are a wellstudied subject with applications in signal processing, wave propagation, antenna theory, etc.


The chromatic expansions have properties which make them useful in fields involving empirically sampled data, such as signal processing.


Complex Data Processing: Fast Wavelet Analysis on the Sphere


In the general context of complex data processing, this article reviews a recent practical approach to the continuous wavelet formalism on the sphere.


In signal processing, communications, and other branches of information technologies, it is often desirable to map the higherdimensional signals on Sn.


83105, [2003]; Kazhdan et al., Eurographics Symposium in Geometry Processing, pp.


Single machine scheduling with controllable processing times and compression costs (part i: equal times and costs)


Most papers in scheduling research have treated individual job processing times as fixed parameters.


However, in many practical situations, a manager may control processing time by reallocating resources.


In this paper, authors consider a machine scheduling problem with controllable processing times.


In the first part of this paper, a special case where the processing times and compression costs are uniform among jobs is discussed.


Single machine scheduling with controllable processing times and compression costs:proof of theorems


Single machine scheduling with controllable processing times and compression costs


A single machine scheduling problem with controllable processing times and compression costs is considered.


In this part(Part II), a general case where the controllable processing times and the compression costs are not equal is discussed.

