IIn this research work, we have shown that it is possible to use fuzzy transform method (FTM) for the estimate solution of fractional system differential equations (FSDEs). In numerical methods, in order to estimate a function on a particular interval, only a restricted number of points are employed. However, what makes the F-transform preferable to other methods is that it makes use of all poi...

In 2006, Saito and Remy presented a new algorithm called polyharmonic local sine transform (PHLST) in image processing as follows. Let f be a twice continuously differentiable function on a domain Ω. First we approximate f by a polyharmonic function u such that the residual component v = f −u vanishes in the boundary of Ω. Next, we do the odd extension for v, and then do the periodic extension,...

The Cauchy transform of a measure has been used to study the analytic capacity and uniform rectifiability of subsets in C: Recently, Lund et al. (Experiment. Math. 7 (1998) 177) have initiated the study of such transform F of self-similar measure. In this and the forecoming papers (Starlikeness and the Cauchy transform of some self-similar measures, in preparation; The Cauchy transform on the S...

A new approach has been proposed to design of an automatic infant cry recognition system based on the fuzzy transform (F-transform) that classifies two different kinds of cries, which come from physiological status and medical disease. Feature extraction and development of classification algorithms play an important role in the area of automatic analysis of infant cry signals. F-transform is th...

The generalized Bochner-Riesz operator SR,λ may be defined as Sf(x) = F−1 [( 1− ρ R )λ + f̂ ] (x) where ρ is an appropriate distance function and F−1 is the inverse Fourier transform. The sharp bound ‖Sf‖L4(R2×R2) ≤ C‖f‖L4(R2×R2) is shown for the distance function ρ(ξ′, ξ”) = max{|ξ′|, |ξ′′|}. This is a rough distance function corresponding to the R4 cylinder analog {(x1, x2, x3, x4) ∈ R4, x1+ x...

Recently, several wavelet transform based image coding techniques are reported in literature. Though these schemes yield very low bit rates, they suffer from the drawback of computational complexity. There is always a need for simple, fast and easy to implement image coding techniques that yield good subjective quality at low bitrates. To obtain good data compression, the wavelet transform coef...

Let /(f) be locally integrable on [0, °°) and let L{f}(s) denote the Laplace transform of /(f). In this note, we prove that if/(f) ~ f Sh=q an(log f)~ as f -> °°, where 0 < Re ß < 1, then /.{/}($) ~ s^1 2^=0 cn('°8 '/*)"" as s ->• 0 in larg si « 7r/2 A, the cn being constants.

Suppose A is a positive real linear transformation on a finite dimensional complex inner product space V . The reproducing kernel for the Fock space of square integrable holomorphic functions on V relative to the Gaussian measure dμA(z) = √ detA πn e−Re〈Az,z〉 dz is described in terms of the holomorphic–antiholomorphic decomposition of the linear operator A. Moreover, if A commutes with a conjug...

We prove several Tauberian theorems for regularizing transforms of vector-valued distributions. The regularizing transform of f is given by the integral transform M φ(x, y) = (f ∗ φy)(x), (x, y) ∈ R n × R+, with kernel φy(t) = yφ(t/y). We apply our results to the analysis of asymptotic stability for a class of Cauchy problems, Tauberian theorems for the Laplace transform, the comparison of quas...

We extend an uncertainty principle due to Beurling into a characterization of Hermite functions. More precisely, all functions f on R which may be written as P (x) exp(Ax, x), with A a real symmetric definite positive matrix, are characterized by integrability conditions on the product f(x)f̂(y). We also give the best constant in uncertainty principles of Gelf’and Shilov type. We then obtain sim...