The use of the discrete wavelet transform (DWT) for the JPEG2000 image compression standard has sparked interest in the design of fast, efficient hardware implementations of the perfect reconstruction filter bank used for computing the DWT. The accuracy and efficiency with which the filter coefficients are quantized in a multiplierless implementation impacts the image compression and hardware p...

Making use of the familiar convolution structure of analytic functions, in this paper we introduce and investigate two new subclasses of multivalently analytic functions of complex order. Among the various results obtained here for each of these function classes, we derive the coefficient bounds and coefficient inequalities, and inclusion and neighborhood properties, involving multivalently ana...

In this paper, we define a class R h p,m,β associated with convolution of p-valent analytic functions. Some properties in the form of coefficient inequality, growth and distortion bounds, sufficient conditions with the help of various lemmas, integral means inequality for convolution of two functions and a set of class preserving integral operators of functions belonging to this class are studi...

Making use of convolution product, we introduce a unified class of spiral-like functions and obtain the coefficient bounds, extreme points and radius of starlikeness for functions belonging to the generalized class Pλ μ (α, β, γ). Furthermore, Distortion theorems for the fractional derivative and fractional integration are obtained. Also we get result about coefficient inequality.

Integer programs with a fixed number of constraints are solvable in pseudo-polynomial time the largest coefficient any constraint. We give new algorithm which improves running state art. Moreover, we show that improving on our for is equivalent to over quadratic (min, +)-convolution. This strong evidence algorithm’s best possible. also present specialized testing feasibility an integer program ...

Peristimulus time histograms are a widespread form of visualizing neuronal responses. Kernel convolution methods transform these histograms into a smooth, continuous probability density function. This provides an improved estimate of a neuron's actual response envelope. We here develop a classifier, called the h-coefficient, to determine whether time-locked fluctuations in the firing rate of a ...

Let n = ∏ p p νp(n) denote the canonical factorization of n ∈ N. The binomial convolution of arithmetical functions f and g is defined as (f ◦g)(n) = ∑ d|n (∏ p (νp(n) νp(d) )) f(d)g(n/d), where ( a b ) is the binomial coefficient. We provide properties of the binomial convolution. We study the Calgebra (A,+, ◦,C), characterizations of completely multiplicative functions, Selberg multiplicative...

An error analysis of Runge-Kutta convolution quadrature is presented for a class of nonsectorial operators whose Laplace transform satisfies, besides the standard assumptions of analyticity in a half-plane Re s > σ0 and a polynomial bound O(s 1) there, the stronger polynomial bound O(s2) in convex sectors of the form | arg s| ≤ π/2 − θ < π/2 for θ > 0. The order of convergence of the Runge-Kutt...

By using q-convolution, we determine the coefficient bounds for certain symmetric subclasses of analytic functions complex order, which are introduced here by means a non-homogeneous Cauchy–Euler-type differential equation order m.

The class of univalent harmonic functions on the unit disc satisfying the condition ∑∞ k=2 (k m − αk)(|ak|+ |bk|) ≤ (1−α)(1−|b1|) is given. Sharp coefficient relations and distortion theorems are given for these functions. In this paper we find that many results of Özturk and Yalcin [5] are incorrect. Some of the results of this paper correct the theorems and examples of [5]. Further, sharp coe...