Relevant bibliographies by topics / Fourier transforms / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Fourier transforms.

Dissertations / Theses on the topic 'Fourier transforms'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Fourier transforms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Debernardi, Pinos Alberto. "Convergence and integrability of fourier transforms." Doctoral thesis, Universitat Autònoma de Barcelona, 2018. http://hdl.handle.net/10803/463030.

Full text
Abstract:
El propòsit d'aquesta tesi és el d'estudiar dos tipus de problema diferents per a certes transformades de Fourier. Primer investiguem la convergència uniforme d'integrals sinusoidals en una i dos dimensions. Per a dur a terme aquesta investigació, utilitzem una condicio de monotonia general, recentment introduïda, tot desenvolupant aquesta teoria en concordança amb les nostres necessitats. Com a resultats principals, obtenim condicions necessàries i suficients que les funcions monòtones generals han de satisfer per tal de poder assegurar la convergència uniforme de les seves respectives tra
APA, Harvard, Vancouver, ISO, and other styles
2

Khan, Aman Ullah. "Parallel computation of fast Fourier transforms." Thesis, Cardiff University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340239.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Whittle, Gruffudd Hannah Rebecca. "Relaxation spectrum recovery using Fourier transforms." Thesis, Aberystwyth University, 2012. http://hdl.handle.net/2160/f2b30f89-dc62-4038-83c9-1857eca8a2b5.

Full text
Abstract:
In this thesis we consider the problem of recovering the relaxation spectrum from the storage and loss moduli. We invert an integral equation using Fourier transforms. Recovering the relaxation spectrum is an inverse, ill-posed problem and hence regularisation methods must be used to try and obtain the relaxation spectrum. We are particularily interested in establishing properties of the relaxation spectrum. We note from the literature that there are results of compact support for the relaxation spectrum; we review to what extent and in what sense, these results are valid. We consider the meth
APA, Harvard, Vancouver, ISO, and other styles
4

Lucrecio, Armando. "ISAR imaging using Fourier and wavelet transforms." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion-image.exe/07Dec%5FLucrecio.pdf.

Full text
Abstract:
Thesis (M.S. in Physics)--Naval Postgraduate School, December 2007.<br>Thesis Advisor(s): Borden, Brett ; Cristi, Roberto. "December 2007." Description based on title screen as viewed on January 23, 2008 Includes bibliographical references (p. 61-62). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
5

Long, Na. "Basic theorems of distributions and Fourier transforms." Kansas State University, 2014. http://hdl.handle.net/2097/18731.

Full text
Abstract:
Master of Science<br>Department of Mathematics<br>Marianne Korten<br>Distribution theory is an important tool in studying partial differential equations. Distributions are linear functionals that act on a space of smooth test functions. Distributions make it possible to differentiate functions whose derivatives do not exist in the classical sense. In particular, any locally integrable function has a distributional derivative. There are different possible choices for the space of test functions, leading to different spaces of distributions. In this report, we take a look at some basic theory of
APA, Harvard, Vancouver, ISO, and other styles
6

Amodeo, F. "FOURIER-MUKAI TRANSFORMS FOR SINGULAR PROJECTIVE VARIETIES." Doctoral thesis, Università degli Studi di Milano, 2014. http://hdl.handle.net/2434/245441.

Full text
Abstract:
This Ph. D thesis deals with various aspects of the theory of derived categories of sheaves on projective varieties. The first result is a generalization of a representability theorem by Lunts and Orlov for fully faithful functors where the source derived category is the derived category of sheaves over the double point scheme. The second result is a description of the space of stability conditions for the same derived category. The final result is a descend criterion for equivariant sheaves to the quotient variety with respect to an action by a finite group.
APA, Harvard, Vancouver, ISO, and other styles
7

Williams, Christopher Paul. "Application of Hartley and Hilbert transforms in Fourier transform ion cyclotron resonance mass spectrometry /." The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487760357822985.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mukanov, Askhat. "Integrability of Fourier transforms, general monotonicity, and related problems." Doctoral thesis, Universitat Autònoma de Barcelona, 2018. http://hdl.handle.net/10803/463043.

Full text
Abstract:
El propòsit d'aquesta tesi és el d'estudiar les propietats d'integrabilitat i convergència de sèries i transformades de Fourier. Els resultats principals són els següents: 1. Incestiguem les propietats d'integrabilitat de sèries trigonomètriques amb coeficients que satisfan una condició de monotonia general i demostrem resultats del tipus Hardy-Littlewood, és a dir, equivalències entre normes de les sumes de sèries trigonomètriques i normes amb pesos dels seus coeficients de Fourier. Demostrem aquestes equivalències en espais de Lorentz i espais de Lebesgue amb pesos. 2. Estudiem propietats de
APA, Harvard, Vancouver, ISO, and other styles
9

Öhlin, Andreas. "Real-Time Multi-Dimensional Fast Fourier Transforms on FPGAs." Thesis, Linköpings universitet, Datorteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-120250.

Full text
Abstract:
This thesis presents a way of performing multi dimensional FFT in a continuousflow environment by calculating the FFT of each dimension separately ina pipeline. The result is a three dimensional pipelined FFT implemented on aStratix III FPGA. It can calculate the three dimensional FFT of a data set containing2563 samples with a word size of 32 bits. The biggest challenge and themain part of the work are the data permutations in between the one dimensionalFFT modules, this part of the design make use of an external DDR2 SDRAMas well as on-chip BRAM to store and permute data between the modules.
APA, Harvard, Vancouver, ISO, and other styles
10

Al-Harbi, Hamad F. "Crystal plasticity finite element simulations using discrete Fourier transforms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/51788.

Full text
Abstract:
Crystallographic texture and its evolution are known to be major sources of anisotropy in polycrystalline metals. Highly simplified phenomenological models cannot usually provide reliable predictions of the materials anisotropy under complex deformation paths, and lack the fidelity needed to optimize the microstructure and mechanical properties during the production process. On the other hand, physics-based models such as crystal plasticity theories have demonstrated remarkable success in predicting the anisotropic mechanical response in polycrystalline metals and the evolution of underlying t
APA, Harvard, Vancouver, ISO, and other styles
11

Pippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods." Doctoral thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-197359.

Full text
Abstract:
The present thesis provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability up to hundreds of thousands
APA, Harvard, Vancouver, ISO, and other styles
12

Piyaratne, Hathurusinghege Dulip Bandara. "Fourier-Mukai transforms and stability conditions on abelian threefolds." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9635.

Full text
Abstract:
Construction of Bridgeland stability conditions on a given Calabi-Yau threefold is an important problem and this thesis realizes the rst known examples of such stability conditions. More precisely, we construct a dense family of stability conditions on the derived category of coherent sheaves on a principally polarized abelian threefold X with Picard rank one. In particular, we show that the conjectural construction proposed by Bayer, Macr and Toda gives rise to Bridgeland stability conditions on X. First we reduce the requirement of the Bogomolov-Gieseker type inequalities to a smaller class
APA, Harvard, Vancouver, ISO, and other styles
13

Kopezhanova, Aigerim. "Summability of Fourier transforms of functions from Lorentz spaces." Doctoral thesis, Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-63150.

Full text
Abstract:
This PhD thesis is devoted to the study of relations between integrability properties of functions and summability properties of its Fourier coefficients and transforms. The relations are given in terms of generalized weighted Lorentz norms, where the weights have some additional growth properties. The thesis contains six papers (papers A-F) together with an introduction, which put these papers into a general frame. In paper A some relations between weighted Lorentz norms and some corresponding sums of Fourier coefficients are studied for the case with a general orthonormal bounded system. Und
APA, Harvard, Vancouver, ISO, and other styles
14

Brand, Tristan. "A Fast Fourier Transform for the Symmetric Group." Scholarship @ Claremont, 2006. https://scholarship.claremont.edu/hmc_theses/179.

Full text
Abstract:
A discrete Fourier transform, or DFT, is an isomorphism from a group algebra to a direct sum of matrix algebras. An algorithm that efficiently applies a DFT is called a fast Fourier transform, or FFT. The concept of a DFT will be introduced and examined from both a general and algebraic perspective. We will then present and analyze a specific FFT for the symmetric group.
APA, Harvard, Vancouver, ISO, and other styles
15

Vadrevu, Aditya M. "Random sampling estimates of fourier transforms antithetical stratified Monte Carlo /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p1450161.

Full text
Abstract:
Thesis (M.S.)--University of California, San Diego, 2008.<br>Title from first page of PDF file (viewed Mar. 27, 2008). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 33-34).
APA, Harvard, Vancouver, ISO, and other styles
16

Letellier, Emmanuel. "Fourier transforms of invariant functions on finite reductive Lie algebras /." Berlin [u.a.] : Springer, 2005. http://www.loc.gov/catdir/toc/fy0715/2004115717.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Berg, Sivert. "Evolution of Cellular Automata using Lindenmayer Systems and Fourier Transforms." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-23601.

Full text
Abstract:
Cellular automata (CAs) are a class of highly parallel computing systems consisting of many simple computing elements called cells. The cells can only communicate with neighboring cells, meaning there is no global communication in the system. Programming such a system to solve complex problems can be a daunting task, and indirect methods are often applied to make it easier. In this thesis we use evolutionary algorithms (EAs) to evolve CAs. We also look at the possibility of employing L-systems to develop complex CAs while maintaining a relatively small genome. Input and output are handled by s
APA, Harvard, Vancouver, ISO, and other styles
18

Arof, H. "Texture classification and segmentation using one dimensional discrete Fourier transforms." Thesis, Swansea University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635797.

Full text
Abstract:
This thesis introduces a texture descriptor that is invariant to rotation. The new texture descriptor utilizes the property of the magnitudes of Fourier transform coefficients that do not change with spatial shift of input elements. Since rotating an image by an arbitrary angle does not change pixel intensities in an image but shifts them in circular motion, the notion of producing texture features invariant to rotation using 1-D Fourier transform coefficients can be realized if the relationship between circular motion and spatial shift can be established. By analyzing individual circular neig
APA, Harvard, Vancouver, ISO, and other styles
19

Sarybekova, Lyazzat. "Some new Lizorkin multiplier theorems for Fourier series and transforms." Licentiate thesis, Luleå : Luleå University of Technology, 2009. http://pure.ltu.se/ws/fbspretrieve/2732730.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Malm, Eric. "Decimation-in-Frequency Fast Fourier Transforms for the Symmetric Group." Scholarship @ Claremont, 2005. https://scholarship.claremont.edu/hmc_theses/173.

Full text
Abstract:
In this thesis, we present a new class of algorithms that determine fast Fourier transforms for a given finite group G. These algorithms use eigenspace projections determined by a chain of subgroups of G, and rely on a path algebraic approach to the representation theory of finite groups developed by Ram (26). Applying this framework to the symmetric group, Sn, yields a class of fast Fourier transforms that we conjecture to run in O(n2n!) time. We also discuss several future directions for this research.
APA, Harvard, Vancouver, ISO, and other styles
21

Thornton, A. L. "Colour object recognition using a complex colour representation and the frequency domain." Thesis, University of Reading, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Wade, Jeremy. "Summability of Fourier orthogonal expansions and a discretized Fourier orthogonal expansion involving Radon projections for functions on the cylinder /." Connect to title online (Scholars' Bank) Connect to title online (ProQuest), 2009. http://hdl.handle.net/1794/10245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Ruderer, Martin [Verfasser], and Ulrich [Akademischer Betreuer] Bunke. "Fourier-Mukai Transforms from T-Duality / Martin Ruderer. Betreuer: Ulrich Bunke." Regensburg : Universitätsbibliothek Regensburg, 2015. http://d-nb.info/1068669624/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Bridgeland, Tom. "Fourier-Mukai transforms for surfaces and moduli spaces of stable sheaves." Thesis, University of Edinburgh, 2002. http://hdl.handle.net/1842/12070.

Full text
Abstract:
In this thesis we study Fourier-Mukai transforms for complex projective surfaces. Extending work of A.I. Bondal and D.O. Orlov, we prove a theorem giving necessary and sufficient conditions for a functor between the derived categories of sheaves on two smooth projective varieties to be an equivalence of categories, and use it to construct examples of Fourier-Mukai transforms for surfaces. In particular we construct new transforms for elliptic surfaces and quotient surfaces. This enables us to identify all pairs of complex projective surfaces having equivalent derived categories of sheaves. We
APA, Harvard, Vancouver, ISO, and other styles
25

Barrera, David. "Quenched Asymptotics for the Discrete Fourier Transforms of a Stationary Process." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1460652609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Demiroren, Ayse Nazli. "Inferring interwell connectivity from injection and production data using frequency domain analysis." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5998.

Full text
Abstract:
This project estimates interwell connectivity, a characteristic that is crucial to determine reservoir continuity while developing a waterflooding project. It tests the combination of Fourier transforms (FT’s) of the flow rate data and analytical solutions from analog electrical circuits to infer the inverse diffusivity coefficient (IDC). I solved the transmission line equation analytically for 0D, 1D, and 2D resistance/capacitance (RC) network models and used those solutions to compare with the flow rate FT’s to determine the diffusivity parameters. I used the analogy between the el
APA, Harvard, Vancouver, ISO, and other styles
27

Koyama, Masanori. "A Decimation-in-Frequency Fast-Fourier Transform for the Symmetric Group." Scholarship @ Claremont, 2007. https://scholarship.claremont.edu/hmc_theses/199.

Full text
Abstract:
A Discrete Fourier Transform (DFT) changes the basis of a group algebra from the standard basis to a Fourier basis. An efficient application of a DFT is called a Fast Fourier Transform (FFT). This research pertains to a particular type of FFT called Decimation in Frequency (DIF). An efficient DIF has been established for commutative algebra; however, a successful analogue for non-commutative algebra has not been derived. However, we currently have a promising DIF algorithm for CSn called Orrison-DIF (ODIF). In this paper, I will formally introduce the ODIF and establish a bound on the operatio
APA, Harvard, Vancouver, ISO, and other styles
28

Pippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods: Massiv parallele schnelle Fourier-Transformationen und Teilchen-Gitter-Methoden." Doctoral thesis, Universitätsverlag der Technischen Universität Chemnitz, 2015. https://monarch.qucosa.de/id/qucosa%3A20398.

Full text
Abstract:
The present thesis provides a modularized view on the structure of fast numerical methods for computing Coulomb interactions between charged particles in three-dimensional space. Thereby, the common structure is given in terms of three self-contained algorithmic frameworks that are built on top of each other, namely fast Fourier transform (FFT), nonequispaced fast Fourier transform (NFFT) and NFFT based particle-mesh methods (P²NFFT). For each of these frameworks algorithmic enhancement and parallel implementations are presented with special emphasis on scalability up to hundreds of thousands
APA, Harvard, Vancouver, ISO, and other styles
29

EASTON, ROGER LEE JR. "TWO-DIMENSIONAL SIGNAL PROCESSING IN RADON SPACE (OPTICAL SIGNAL, IMAGE PROCESSING, FOURIER TRANSFORMS)." Diss., The University of Arizona, 1986. http://hdl.handle.net/10150/183978.

Full text
Abstract:
This dissertation considers a method for processing two-dimensional (2-D) signals (e.g. imagery) by transformation to a coordinate space where the 2-D operation separates into orthogonal 1-D operations. After processing, the 2-D output is reconstructed by a second coordinate transformation. This approach is based on the Radon transform, which maps a two-dimensional Cartesian representation of a signal into a series of one-dimensional signals by line-integral projection. The mathematical principles of this transformation are well-known as the basis for medical computed tomography. This approach
APA, Harvard, Vancouver, ISO, and other styles
30

Zhang, Chi. "Fast Fourier Transforms in IMEX-schemes to price options under Bates model." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-246062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Leung, Cleo D. M. "Overtone Characterization of Garner Headjoints Using Spectrographic Analysis and Fast Fourier Transforms." University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1396523100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Morrison, Malcolm William. "Developing a field-based technique for molecular alignment with fast Fourier transforms." Thesis, University of Leeds, 2017. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.722596.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Hasebe, Takahiro. "Analytic continuations of Fourier and Stieltjes transforms and generalized moments of probability measures." 京都大学 (Kyoto University), 2012. http://hdl.handle.net/2433/157741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Pippig, Michael, and Daniel Potts. "Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation." Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-94926.

Full text
Abstract:
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm for the computation of the Coulomb potentials and forces in a charged particle system, which is based on the parallel nonequispaced fast Fourier transform. To prove the high scalability of our algorithms we provide performance results on a BlueGene/P system using up to 65536 cores.
APA, Harvard, Vancouver, ISO, and other styles
35

Dovlo, Edem. "Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/20269.

Full text
Abstract:
The Fourier transform is one of the most useful tools in science and engineering and can be expanded to multi-dimensions and curvilinear coordinates. Multidimensional Fourier transforms are widely used in image processing, tomographic reconstructions and in fact any application that requires a multidimensional convolution. By examining a function in the frequency domain, additional information and insights may be obtained. In this thesis, the development of a symbolic computer algebra toolbox to compute two dimensional Fourier transforms in polar coordinates is discussed. Among the many operat
APA, Harvard, Vancouver, ISO, and other styles
36

Nestler, Franziska. "Efficient Computation of Electrostatic Interactions in Particle Systems Based on Nonequispaced Fast Fourier Transforms." Universitätsverlag der Technischen Universität Chemnitz, 2017. https://monarch.qucosa.de/id/qucosa%3A23376.

Full text
Abstract:
The present thesis is dedicated to the efficient computation of electrostatic interactions in particle systems, which is of great importance in the field of molecular dynamics simulations. In order to compute the therefor required physical quantities with only O(N log N) arithmetic operations, so called particle-mesh methods make use of the well-known Ewald summation approach and the fast Fourier transform (FFT). Typically, such methods are able to handle systems of point charges subject to periodic boundary conditions in all spatial directions. However, periodicity is not always desired in al
APA, Harvard, Vancouver, ISO, and other styles
37

Wellard, Stanley James. "Tropospheric Spectrum Estimations Comparing Maximum Likelihood with Expectation Maximization Solutions and Fast Fourier Transforms." DigitalCommons@USU, 2007. https://digitalcommons.usu.edu/etd/264.

Full text
Abstract:
The FIRST program (Far Infrared Spectroscopy in the Troposphere) was created as an Instrument Incubator Program (IIP) by NASA Langley to demonstrate improved technology readiness levels (TRLs) for two technologies needed in the design of new imaging Fourier transform spectrometers (IFTS). The IIP IFTS was developed at the Space Dynamics Laboratory and flown to an altitude of 103,000 feet on an instrumented NASA balloon payload. The sensor collected approximately 15,000 interferograms during its 6-hour flight. Fourier transforms (FFT) produced acceptable results except for noise equivalent temper
APA, Harvard, Vancouver, ISO, and other styles
38

Lo, King Chuen. "Theory and realization of novel algorithms for random sampling in digital signal processing." Thesis, Durham University, 1996. http://etheses.dur.ac.uk/5239/.

Full text
Abstract:
Random sampling is a technique which overcomes the alias problem in regular sampling. The randomization, however, destroys the symmetry property of the transform kernel of the discrete Fourier transform. Hence, when transforming a randomly sampled sequence to its frequency spectrum, the Fast Fourier transform cannot be applied and the computational complexity is N(^2). The objectives of this research project are (1) To devise sampling methods for random sampling such that computation may be reduced while the anti-alias property of random sampling is maintained : Two methods of inserting limite
APA, Harvard, Vancouver, ISO, and other styles
39

McCorquodale, Peter William 1967. "Fast multipole-type methods in one and two dimensions, with application to parallel Fourier transforms." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/10044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Hertzog, P. E., and G. D. Jordaan. "Wavelets and short time fourier transforms on ultrasonic doppler signals for pregnancy determination in sheep." Interim : Interdisciplinary Journal, Vol 5, Issue 1: Bloemfontein : Central University of Technology, Free State, 2006. http://hdl.handle.net/11462/414.

Full text
Abstract:
Published Article<br>The reproductive status of animals is of utmost importance to the modern farmer. Decisions concerning the management of the flock are influenced by the knowledge of the percentage of animals that are pregnant at any specific time. The aim of the project was to gain knowledge for the development of an instrument that is affordable and with which a farmer can do pregnancy determination himself/herself, thereby enabling him/her to make the correct management decisions. Experimental data were obtained from pregnant Dorper ewes with the aid of a portable Doppler instrument. Usi
APA, Harvard, Vancouver, ISO, and other styles
41

Rueda, Ordoñez Diego Andres. "Estudo experimental de segregação de partículas em misturas binárias usando análise de flutuações de pressão em leito fluidizado gás-sólido." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/265968.

Full text
Abstract:
Orientadores: Araí Augusta Bernárdez Pécora, Emerson dos Reis<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecânica<br>Made available in DSpace on 2018-08-24T13:04:25Z (GMT). No. of bitstreams: 1 RuedaOrdonez_DiegoAndres_M.pdf: 19506541 bytes, checksum: 0bbc753dfedabd5800a9c9bd05c71077 (MD5) Previous issue date: 2014<br>Resumo: Neste trabalho, foi utilizada uma metodologia para a análise dos sinais de flutuações de pressão visando estudar a fluidização e o fenômeno da segregação em leitos fluidizados contendo misturas binárias de partículas de difere
APA, Harvard, Vancouver, ISO, and other styles
42

Bleiler, Sarah K. "Orthogonal filters and the implications of wrapping on discrete wavelet transforms." [Tampa, Fla] : University of South Florida, 2008. http://purl.fcla.edu/usf/dc/et/SFE0002676.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Kaboudanian-Ardestani, Mojtaba. "Solution of the advective-dispersive groundwater mass transport equation using Fourier transforms and the finite analytical method." Diss., The University of Arizona, 1994. http://hdl.handle.net/10150/186862.

Full text
Abstract:
!The advective-dispersive equation is used extensively in studying and analyzing the transport of contaminants through groundwater systems. In this dissertation, the development and evaluation of a new numerical scheme for an efficient solution of groundwater solute transport problems is presented. The scheme, which is named the Finite Analytical/Fourier Transform Method (FAFM) is based on taking the Fourier transform of the transient equation in the physical domain. The transformed equation resembles a steady-state advective-dispersive equation with a first-order decay term. The FAFM approach
APA, Harvard, Vancouver, ISO, and other styles
44

Harris, Benjamin (Benjamin London). "Fourier transforms of Nilpotent Orbits, limit formulas for reductive lie groups, and wave front cycles of tempered representations." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/67789.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 54-56).<br>In this thesis, the author gives an explicit formula for the Fourier transform of the canonical measure on a nilpotent coadjoint orbit for GL(n, R). If G is a real, reductive algebraic group, and O C g* = Lie(G)* is a nilpotent coadjoint orbit, a necessary condition is given for 0 to appear in the wave front cycle of a tempered representation. In addition, the coefficients of the wave front cycle of a tempered represe
APA, Harvard, Vancouver, ISO, and other styles
45

Shockey, Bruce. "FFT Bit Templating – A Technique for Making Amplitude and Frequency Measurements of a BPSK Modulated Signal." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/605361.

Full text
Abstract:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada<br>In many spacecraft receiver applications, the Fast Fourier Transform (FFT) provides a powerful tool for measuring the amplitude and frequency of an unmodulated RF signal. By increasing the FFT acquisition time, tiny signals can be coaxed from the noise and their frequency measured by determining which frequency bin the signal energy appears. The greater the acquisition time, the narrower the bin bandwidth and the more accurate the frequency measurement. In mo
APA, Harvard, Vancouver, ISO, and other styles
46

Garay, Avendaño Roger Leonardo 1984. "Formulação analítica exata de feixes eletromagnéticos não paraxiais." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259682.

Full text
Abstract:
Orientador: Michel Zamboni Rached<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-22T19:43:51Z (GMT). No. of bitstreams: 1 GarayAvendano_RogerLeonardo_M.pdf: 3532246 bytes, checksum: c57f4a9f337b3e0e75f701a896e690a0 (MD5) Previous issue date: 2013<br>Resumo: Embora a propagação de feixes ópticos seja um tema muito investigado, existe ainda uma grande variedade de estudos a se efetuar, principalmente no desenvolvimento de métodos que permitam, de forma analítica, a descrição exata da enorme
APA, Harvard, Vancouver, ISO, and other styles
47

Sarathy, Vivek. "High Spurious-Free Dynamic Range Digital Wideband Receiver for Multiple Signal Detection and Tracking." Wright State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=wright1197910677.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Weng, Jiaying. "TRANSFORMS IN SUFFICIENT DIMENSION REDUCTION AND THEIR APPLICATIONS IN HIGH DIMENSIONAL DATA." UKnowledge, 2019. https://uknowledge.uky.edu/statistics_etds/40.

Full text
Abstract:
The big data era poses great challenges as well as opportunities for researchers to develop efficient statistical approaches to analyze massive data. Sufficient dimension reduction is such an important tool in modern data analysis and has received extensive attention in both academia and industry. In this dissertation, we introduce inverse regression estimators using Fourier transforms, which is superior to the existing SDR methods in two folds, (1) it avoids the slicing of the response variable, (2) it can be readily extended to solve the high dimensional data problem. For the ultra-high dime
APA, Harvard, Vancouver, ISO, and other styles
49

Hickman, Jonathan Edward. "Topics in affine and discrete harmonic analysis." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10559.

Full text
Abstract:
In this thesis a number of problems in harmonic analysis of a geometric flavour are discussed and, in particular, the Lebesgue space mapping properties of certain averaging and Fourier restriction operators are studied. The first three chapters focus on the perspective afforded by affine-geometrical considerations whilst the remaining chapter considers some discrete variants of these problems. In Chapter 1 there is an overview of the basic affine theory of the aforementioned operators and, in particular, the affine arc-length and surface measures are introduced. Chapter 2 presents work of the
APA, Harvard, Vancouver, ISO, and other styles
50

Pippig, Michael [Verfasser], Daniel [Akademischer Betreuer] Potts, Daniel [Gutachter] Potts, Christian [Gutachter] Holm, and Matthias [Gutachter] Bolten. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods / Michael Pippig ; Gutachter: Daniel Potts, Christian Holm, Matthias Bolten ; Betreuer: Daniel Potts." Chemnitz : Universitätsbibliothek Chemnitz, 2016. http://d-nb.info/1213814669/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Fourier transforms' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography