نتایج جستجو برای: hartley series
تعداد نتایج: 353045 فیلتر نتایج به سال:
The radix-2 decimation-in-time (DIT) fast Hartley transform algorithm for computing the Discrete Hartley Transform (DHT) was introduced by Bracewell. DIT and decimation-in-frequency (DIF) algorithms were further developed by Meckelburg and Lipka, Prado, Sorenson et al, Kwong and Shiu. In these algorithms, the stage structures perform all the additions and multiplications and utilize stage depen...
CESTA, the first European Campaign dedicated to MT Evaluation, is a project labelled by the French Technolangue action. CESTA provides an evaluation of six commercial and academic MT systems using a protocol set by an international panel of experts. CESTA aims at producing reusable resources and information about reliability of the metrics. Two runs will be carried out: one using the system’s b...
Koffka's (1935, pp. 224-235) explanation of shape-constancy is based on the assumption of an invariant linkage between slant and shape. Koffka's hypothesis has been formulated in the following way by Beck and Gibson (1955): "A retinal projection of a given form determines a unique relation of apparent shape to apparent slant" (p. 126). The invariance hypothesis requires that perceived shape var...
Introduction The acknowledged move from traditional public administration (TPA), over to new management (NPM), then the current shift towards governance (NPG) has spurred an increased awareness on role of external stakeholders in developing services, and hence way sector innovation takes place (Hartley, 2005; Torfing, 2019).
In this paper the authors propose a new closed contour descriptor that could be seen as a Feature Extractor of closed contours based on the Discrete Hartley Transform (DHT), its main characteristic is that uses only half of the coefficients required by Elliptical Fourier Descriptors (EFD) to obtain a contour approximation with similar error measure. The proposed closed contour descriptor provid...
The Fast Hartley Transform (FHT), a discrete version of the Hartley Transform (HT), has been studied in various papers and shown to be faster and more convenient to implement and handle than the corresponding Fast Fourier Transform (FFT). As the HT is not as nicely separable as the Fourier Transform (FT), a multidimensional version of the HT needs to perform a final correction step to convert t...
This paper presents empirical evidence for the orthogonality of the DIT multidimensional dialogue act annotation scheme, showing that the ten dimensions of communication which underly this scheme are addressed independently in natural dialogue.
We answer in the negative a question of Hartley about representations finite groups, by constructing examples simple groups with arbitrarily large whose endomorphism ring consists just scalars. show as consequence that there are automorphisms locally group SL(∞,Fq) trivial centralizer. The smallest our is A6 q=9.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید