Matching Items (4)
Filtering by
- All Subjects: Mathematics
Description
Rabies disease remains enzootic among raccoons, skunks, foxes and bats in the United States. It is of primary concern for public-health agencies to control spatial spread of rabies in wildlife and its potential spillover infection of domestic animals and humans. Rabies is invariably fatal in wildlife if untreated, with a non-negligible incubation period. Understanding how this latency affects spatial spread of rabies in wildlife is the concern of chapter 2 and 3. Chapter 1 deals with the background of mathematical models for rabies and lists main objectives. In chapter 2, a reaction-diffusion susceptible-exposed-infected (SEI) model and a delayed diffusive susceptible-infected (SI) model are constructed to describe the same epidemic process -- rabies spread in foxes. For the delayed diffusive model a non-local infection term with delay is resulted from modeling the dispersal during incubation stage. Comparison is made regarding minimum traveling wave speeds of the two models, which are verified using numerical experiments. In chapter 3, starting with two Kermack and McKendrick's models where infectivity, death rate and diffusion rate of infected individuals can depend on the age of infection, the asymptotic speed of spread $c^\ast$ for the cumulated force of infection can be analyzed. For the special case of fixed incubation period, the asymptotic speed of spread is governed by the same integral equation for both models. Although explicit solutions for $c^\ast$ are difficult to obtain, assuming that diffusion coefficient of incubating animals is small, $c^\ast$ can be estimated in terms of model parameter values. Chapter 4 considers the implementation of realistic landscape in simulation of rabies spread in skunks and bats in northeast Texas. The Finite Element Method (FEM) is adopted because the irregular shapes of realistic landscape naturally lead to unstructured grids in the spatial domain. This implementation leads to a more accurate description of skunk rabies cases distributions.
ContributorsLiu, Hao (Author) / Kuang, Yang (Thesis advisor) / Jackiewicz, Zdzislaw (Committee member) / Lanchier, Nicolas (Committee member) / Smith, Hal (Committee member) / Thieme, Horst (Committee member) / Arizona State University (Publisher)
Created2013
Description
The theme for this work is the development of fast numerical algorithms for sparse optimization as well as their applications in medical imaging and source localization using sensor array processing. Due to the recently proposed theory of Compressive Sensing (CS), the $\ell_1$ minimization problem attracts more attention for its ability to exploit sparsity. Traditional interior point methods encounter difficulties in computation for solving the CS applications. In the first part of this work, a fast algorithm based on the augmented Lagrangian method for solving the large-scale TV-$\ell_1$ regularized inverse problem is proposed. Specifically, by taking advantage of the separable structure, the original problem can be approximated via the sum of a series of simple functions with closed form solutions. A preconditioner for solving the block Toeplitz with Toeplitz block (BTTB) linear system is proposed to accelerate the computation. An in-depth discussion on the rate of convergence and the optimal parameter selection criteria is given. Numerical experiments are used to test the performance and the robustness of the proposed algorithm to a wide range of parameter values. Applications of the algorithm in magnetic resonance (MR) imaging and a comparison with other existing methods are included. The second part of this work is the application of the TV-$\ell_1$ model in source localization using sensor arrays. The array output is reformulated into a sparse waveform via an over-complete basis and study the $\ell_p$-norm properties in detecting the sparsity. An algorithm is proposed for minimizing a non-convex problem. According to the results of numerical experiments, the proposed algorithm with the aid of the $\ell_p$-norm can resolve closely distributed sources with higher accuracy than other existing methods.
ContributorsShen, Wei (Author) / Mittlemann, Hans D (Thesis advisor) / Renaut, Rosemary A. (Committee member) / Jackiewicz, Zdzislaw (Committee member) / Gelb, Anne (Committee member) / Ringhofer, Christian (Committee member) / Arizona State University (Publisher)
Created2011
Description
Rabies is an infectious viral disease. It is usually fatal if a victim reaches the rabid stage, which starts after the appearance of disease symptoms. The disease virus attacks the central nervous system, and then it migrates from peripheral nerves to the spinal cord and brain. At the time when the rabies virus reaches the brain, the incubation period is over and the symptoms of clinical disease appear on the victim. From the brain, the virus travels via nerves to the salivary glands and saliva.
A mathematical model is developed for the spread of rabies in a spatially distributed fox population to model the spread of the rabies epizootic through middle Europe that occurred in the second half of the 20th century. The model considers both territorial and wandering rabid foxes and includes a latent period for the infection. Since the model assumes these two kinds of rabid foxes, it is a system of both partial differential and integral equations (with integration
over space and, occasionally, also over time). To study the spreading speeds of the rabies epidemic, the model is reduced to a scalar Volterra-Hammerstein integral equation, and space-time Laplace transform of the integral equation is used to derive implicit formulas for the spreading speed. The spreading speeds are discussed and implicit formulas are given for latent periods of fixed length, exponentially distributed length, Gamma distributed length, and log-normally distributed length. A number of analytic and numerical results are shown pertaining to the spreading speeds.
Further, a numerical algorithm is described for the simulation
of the spread of rabies in a spatially distributed fox population on a bounded domain with Dirichlet boundary conditions. I propose the following methods for the numerical approximation of solutions. The partial differential and integral equations are discretized in the space variable by central differences of second order and by
the composite trapezoidal rule. Next, the ordinary or delay differential equations that are obtained this way are discretized in time by explicit
continuous Runge-Kutta methods of fourth order for ordinary and delay differential systems. My particular interest
is in how the partition of rabid foxes into
territorial and diffusing rabid foxes influences
the spreading speed, a question that can be answered by purely analytic means only for small basic reproduction numbers. I will restrict the numerical analysis
to latent periods of fixed length and to exponentially
distributed latent periods.
The results of the numerical calculations
are compared for latent periods
of fixed and exponentially distributed length
and for various proportions of territorial
and wandering rabid foxes.
The speeds of spread observed in the
simulations are compared
to spreading speeds obtained by numerically solving the analytic formulas
and to observed speeds of epizootic frontlines
in the European rabies outbreak 1940 to 1980.
A mathematical model is developed for the spread of rabies in a spatially distributed fox population to model the spread of the rabies epizootic through middle Europe that occurred in the second half of the 20th century. The model considers both territorial and wandering rabid foxes and includes a latent period for the infection. Since the model assumes these two kinds of rabid foxes, it is a system of both partial differential and integral equations (with integration
over space and, occasionally, also over time). To study the spreading speeds of the rabies epidemic, the model is reduced to a scalar Volterra-Hammerstein integral equation, and space-time Laplace transform of the integral equation is used to derive implicit formulas for the spreading speed. The spreading speeds are discussed and implicit formulas are given for latent periods of fixed length, exponentially distributed length, Gamma distributed length, and log-normally distributed length. A number of analytic and numerical results are shown pertaining to the spreading speeds.
Further, a numerical algorithm is described for the simulation
of the spread of rabies in a spatially distributed fox population on a bounded domain with Dirichlet boundary conditions. I propose the following methods for the numerical approximation of solutions. The partial differential and integral equations are discretized in the space variable by central differences of second order and by
the composite trapezoidal rule. Next, the ordinary or delay differential equations that are obtained this way are discretized in time by explicit
continuous Runge-Kutta methods of fourth order for ordinary and delay differential systems. My particular interest
is in how the partition of rabid foxes into
territorial and diffusing rabid foxes influences
the spreading speed, a question that can be answered by purely analytic means only for small basic reproduction numbers. I will restrict the numerical analysis
to latent periods of fixed length and to exponentially
distributed latent periods.
The results of the numerical calculations
are compared for latent periods
of fixed and exponentially distributed length
and for various proportions of territorial
and wandering rabid foxes.
The speeds of spread observed in the
simulations are compared
to spreading speeds obtained by numerically solving the analytic formulas
and to observed speeds of epizootic frontlines
in the European rabies outbreak 1940 to 1980.
ContributorsAlanazi, Khalaf Matar (Author) / Thieme, Horst R. (Thesis advisor) / Jackiewicz, Zdzislaw (Committee member) / Baer, Steven (Committee member) / Gardner, Carl (Committee member) / Kuang, Yang (Committee member) / Smith, Hal (Committee member) / Arizona State University (Publisher)
Created2018
Description
During the inversion of discrete linear systems, noise in data can be amplified and result in meaningless solutions. To combat this effect, characteristics of solutions that are considered desirable are mathematically implemented during inversion. This is a process called regularization. The influence of the provided prior information is controlled by the introduction of non-negative regularization parameter(s). Many methods are available for both the selection of appropriate regularization parame- ters and the inversion of the discrete linear system. Generally, for a single problem there is just one regularization parameter. Here, a learning approach is considered to identify a single regularization parameter based on the use of multiple data sets de- scribed by a linear system with a common model matrix. The situation with multiple regularization parameters that weight different spectral components of the solution is considered as well. To obtain these multiple parameters, standard methods are modified for identifying the optimal regularization parameters. Modifications of the unbiased predictive risk estimation, generalized cross validation, and the discrepancy principle are derived for finding spectral windowing regularization parameters. These estimators are extended for finding the regularization parameters when multiple data sets with common system matrices are available. Statistical analysis of these estima- tors is conducted for real and complex transformations of data. It is demonstrated that spectral windowing regularization parameters can be learned from these new esti- mators applied for multiple data and with multiple windows. Numerical experiments evaluating these new methods demonstrate that these modified methods, which do not require the use of true data for learning regularization parameters, are effective and efficient, and perform comparably to a supervised learning method based on es- timating the parameters using true data. The theoretical developments are validated for one and two dimensional image deblurring. It is verified that the obtained estimates of spectral windowing regularization parameters can be used effectively on validation data sets that are separate from the training data, and do not require known data.
ContributorsByrne, Michael John (Author) / Renaut, Rosemary (Thesis advisor) / Cochran, Douglas (Committee member) / Espanol, Malena (Committee member) / Jackiewicz, Zdzislaw (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2023