Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
- Publication
- Publication Type
- File Type
Articles 1 - 6 of 6
Full-Text Articles in Mathematics
Cramer-Rao Bound And Optimal Amplitude Estimator Of Superimposed Sinusoidal Signals With Unknown Frequencies, Shaohui Jia
Cramer-Rao Bound And Optimal Amplitude Estimator Of Superimposed Sinusoidal Signals With Unknown Frequencies, Shaohui Jia
Doctoral Dissertations
This dissertation addresses optimally estimating the amplitudes of superimposed sinusoidal signals with unknown frequencies. The Cramer-Rao Bound of estimating the amplitudes in white Gaussian noise is given, and the maximum likelihood estimator of the amplitudes in this case is shown to be asymptotically efficient at high signal to noise ratio but finite sample size. Applying the theoretical results to signal resolutions, it is shown that the optimal resolution of multiple signals using a finite sample is given by the maximum likelihood estimator of the amplitudes of signals.
Diffusion Problems In Wound Healing And A Scattering Approach To Immune System Interactions, Julia Suzanne Arnold
Diffusion Problems In Wound Healing And A Scattering Approach To Immune System Interactions, Julia Suzanne Arnold
Mathematics & Statistics Theses & Dissertations
A theoretical model for the existence of a Critical Size Defect (CSD) in certain animals is the focus of the majority of this dissertation. Adam [1] recently developed a one-dimensional model of this phenomenon, and chapters I–V address the exist the CSD in a two-dimensional model and a three-dimensional model. The two dimensional (or 1-d circular) model is the more appropriate for a study of CSD's. In that model we assume a circular wound of uniform depth and develop a time-independent form of the diffusion equation relevant to the study of the CSD phenomenon. It transpires that the range of …
A Group Theoretic Tabu Search Approach To The Traveling Salesman Problem, Shane N. Hall
A Group Theoretic Tabu Search Approach To The Traveling Salesman Problem, Shane N. Hall
Theses and Dissertations
The traveling salesman problem (TSP) is a combinatorial optimization problem that is mathematically modeled as a binary integer program. The TSP is a very important problem for the operations research academician and practitioner. This research demonstrates a Group Theoretic Tabu Search (GTTS) Java algorithm for the TSP. The tabu search metaheuristic continuously finds near-optimal solutions to the TSP under various different implementations. Algebraic group theory offers a more formal mathematical setting to study the TSP providing a theoretical foundation for describing tabu search. Specifically, this thesis uses the Symmetric Group on n letters, S(n), which is the set of all …
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.
Rotary Honing: A Variant Of The Taylor Paint-Scraper Problem, Christopher Hills, H. Moffatt
Rotary Honing: A Variant Of The Taylor Paint-Scraper Problem, Christopher Hills, H. Moffatt
Articles
The three-dimensional Row in a corner of fixed angle α induced by the rotation in its plane of one of the boundaries is considered. A local similarity solution valid in a neighbourhood of the centre of rotation is obtained and the streamlines are shown to be closed curves. The effects of inertia are considered and are shown to be significant in a small neighbourhood of the plane of symmetry of the flow. A simple experiment confirms that the streamlines are indeed nearly closed; their projections on planes normal to the line of intersection of the boundaries are precisely the 'Taylor' …
Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker
Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker
John Hooker
No abstract provided.