نتایج جستجو برای: transversal filter

تعداد نتایج: 135226  

2017
Georges Habib

In this paper, we prove Kirchberg-type inequalities for any Kähler spin foliation. Their limiting-cases are then characterized as being transversal minimal Einstein foliations. The key point is to introduce the transversal Kählerian twistor operators.

Journal: :Contributions to Discrete Mathematics 2008
Deborah Oliveros Luis Pedro Montejano

We prove colourful versions of three classical transversal theorems: the Katchalski-Lewis Theorem “T(3) implies T-k”, the “T(3) implies T” Theorem for well distributed sets, and the Goodmann-Pollack Transversal Theorem

In this paper we study curvature properties of semi - symmetric type of totally umbilical radical transversal lightlike hypersurfaces $(M,g)$ and $(M,widetilde g)$ of a K"ahler-Norden manifold $(overline M,overline J,overline g,overline { widetilde g})$ of constant totally real sectional curvatures $overline nu$ and $overline {widetilde nu}$ ($g$ and $widetilde g$ are the induced metrics on $M$...

M. Dardel M. Esmaeil-Dokht M.H. Ghasemi R.A. Alashti,

Buckling analysis of thin cylindrical shells is very important due to their production process.  Usually longitudinal and transversal stiffeners are used to increase the buckling stiffness. In this paper, considering a thin cylindrical shell with longitudinal and transversal ribs subjected to axial force and lateral pressure, the influence of different aspect of axial force to lateral pressure ...

Journal: :Discrete Applied Mathematics 1997
Elias Dahlhaus Jan Kratochvíl Paul D. Manuel Mirka Miller

A transversal of a hypergraph is a set of vertices meeting all the hyperedges. A k-fold transversal of a hypergraph is a set of vertices such that every hyperedge has at least k elements of. In this paper, we prove that a k-fold transversal of a balanced hypergraph can be expressed as a union of k pairwise disjoint transversals and such partition can be obtained in polynomial time. We give an N...

2012
X. Chen E. Venosa

In this paper we present an efficient method for equalizing the wireless channel in DSP-based radio architectures. Equalization is usually performed in the time domain via transversal filters. Our proposal performs the channel equalization in the frequency domain by adjusting scalar gains and phases of each path of a perfect reconstruction filter bank. In this process the spectral products form...

Journal: :Mathematica Moravica 2014

2002
LEO I. BLUESTEIN

It is shown in this paper that the discrete equivalent of a chirp filter is needed to implement the computation of the discrete Fourier transform (DFT) as a linear filtering process. We show further that the chirp filter should not be realized as a transversal filter in a wide range of cases; use instead of the conventional FFT permits the computation of the DFT in a time proportional to N logz...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید