Matching Items (29)
Filtering by
- All Subjects: Applied Mathematics
- Creators: Platte, Rodrigo
Description
The variable projection method has been developed as a powerful tool for solvingseparable nonlinear least squares problems. It has proven effective in cases where
the underlying model consists of a linear combination of nonlinear functions, such as
exponential functions. In this thesis, a modified version of the variable projection
method to address a challenging semi-blind deconvolution problem involving mixed
Gaussian kernels is employed. The aim is to recover the original signal accurately
while estimating the mixed Gaussian kernel utilized during the convolution process.
The numerical results obtained through the implementation of the proposed algo-
rithm are presented. These results highlight the method’s ability to approximate the
true signal successfully. However, accurately estimating the mixed Gaussian kernel
remains a challenging task. The implementation details, specifically focusing on con-
structing a simplified Jacobian for the Gauss-Newton method, are explored. This
contribution enhances the understanding and practicality of the approach.
ContributorsDworaczyk, Jordan Taylor (Author) / Espanol, Malena (Thesis advisor) / Welfert, Bruno (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2023
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
Description
The main objective of this work is to study novel stochastic modeling applications to cybersecurity aspects across three dimensions: Loss, attack, and detection. First, motivated by recent spatial stochastic models with cyber insurance applications, the first and second moments of the size of a typical cluster of bond percolation on finite graphs are studied. More precisely, having a finite graph where edges are independently open with the same probability $p$ and a vertex $x$ chosen uniformly at random, the goal is to find the first and second moments of the number of vertices in the cluster of open edges containing $x$. Exact expressions for the first and second moments of the size distribution of a bond percolation cluster on essential building blocks of hybrid graphs: the ring, the path, the random star, and regular graphs are derived. Upper bounds for the moments are obtained by using a coupling argument to compare the percolation model with branching processes when the graph is the random rooted tree with a given offspring distribution and a given finite radius. Second, the Petri Net modeling framework for performance analysis is well established; extensions provide enough flexibility to examine the behavior of a permissioned blockchain platform in the context of an ongoing cyberattack via simulation. The relationship between system performance and cyberattack configuration is analyzed. The simulations vary the blockchain's parameters and network structure, revealing the factors that contribute positively or negatively to a Sybil attack through the performance impact of the system. Lastly, the denoising diffusion probabilistic models (DDPM) ability for synthetic tabular data augmentation is studied. DDPMs surpass generative adversarial networks in improving computer vision classification tasks and image generation, for example, stable diffusion. Recent research and open-source implementations point to a strong quality of synthetic tabular data generation for classification and regression tasks. Unfortunately, the present state of literature concerning tabular data augmentation with DDPM for classification is lacking. Further, cyber datasets commonly have highly unbalanced distributions complicating training. Synthetic tabular data augmentation is investigated with cyber datasets and performance of well-known metrics in machine learning classification tasks improve with augmentation and balancing.
ContributorsLa Salle, Axel (Author) / Lanchier, Nicolas (Thesis advisor) / Jevtic, Petar (Thesis advisor) / Motsch, Sebastien (Committee member) / Boscovic, Dragan (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2023
Description
Signaling cascades transduce signals received on the cell membrane to the nucleus. While noise filtering, ultra-sensitive switches, and signal amplification have all been shown to be features of such signaling cascades, it is not understood why cascades typically show three or four layers. Using singular perturbation theory, Michaelis-Menten type equations are derived for open enzymatic systems. When these equations are organized into a cascade, it is demonstrated that the output signal as a function of time becomes sigmoidal with the addition of more layers. Furthermore, it is shown that the activation time will speed up to a point, after which more layers become superfluous. It is shown that three layers create a reliable sigmoidal response progress curve from a wide variety of time-dependent signaling inputs arriving at the cell membrane, suggesting that natural selection may have favored signaling cascades as a parsimonious solution to the problem of generating switch-like behavior in a noisy environment.
ContributorsYoung, Jonathan Trinity (Author) / Armbruster, Dieter (Thesis advisor) / Platte, Rodrigo (Committee member) / Nagy, John (Committee member) / Baer, Steven (Committee member) / Taylor, Jesse (Committee member) / Arizona State University (Publisher)
Created2013
Description
High-order methods are known for their accuracy and computational performance when applied to solving partial differential equations and have widespread use
in representing images compactly. Nonetheless, high-order methods have difficulty representing functions containing discontinuities or functions having slow spectral decay in the chosen basis. Certain sensing techniques such as MRI and SAR provide data in terms of Fourier coefficients, and thus prescribe a natural high-order basis. The field of compressed sensing has introduced a set of techniques based on $\ell^1$ regularization that promote sparsity and facilitate working with functions having discontinuities. In this dissertation, high-order methods and $\ell^1$ regularization are used to address three problems: reconstructing piecewise smooth functions from sparse and and noisy Fourier data, recovering edge locations in piecewise smooth functions from sparse and noisy Fourier data, and reducing time-stepping constraints when numerically solving certain time-dependent hyperbolic partial differential equations.
in representing images compactly. Nonetheless, high-order methods have difficulty representing functions containing discontinuities or functions having slow spectral decay in the chosen basis. Certain sensing techniques such as MRI and SAR provide data in terms of Fourier coefficients, and thus prescribe a natural high-order basis. The field of compressed sensing has introduced a set of techniques based on $\ell^1$ regularization that promote sparsity and facilitate working with functions having discontinuities. In this dissertation, high-order methods and $\ell^1$ regularization are used to address three problems: reconstructing piecewise smooth functions from sparse and and noisy Fourier data, recovering edge locations in piecewise smooth functions from sparse and noisy Fourier data, and reducing time-stepping constraints when numerically solving certain time-dependent hyperbolic partial differential equations.
ContributorsDenker, Dennis (Author) / Gelb, Anne (Thesis advisor) / Archibald, Richard (Committee member) / Armbruster, Dieter (Committee member) / Boggess, Albert (Committee member) / Platte, Rodrigo (Committee member) / Saders, Toby (Committee member) / Arizona State University (Publisher)
Created2016
Description
The main objective of mathematical modeling is to connect mathematics with other scientific fields. Developing predictable models help to understand the behavior of biological systems. By testing models, one can relate mathematics and real-world experiments. To validate predictions numerically, one has to compare them with experimental data sets. Mathematical modeling can be split into two groups: microscopic and macroscopic models. Microscopic models described the motion of so-called agents (e.g. cells, ants) that interact with their surrounding neighbors. The interactions among these agents form at a large scale some special structures such as flocking and swarming. One of the key questions is to relate the particular interactions among agents with the overall emerging structures. Macroscopic models are precisely designed to describe the evolution of such large structures. They are usually given as partial differential equations describing the time evolution of a density distribution (instead of tracking each individual agent). For instance, reaction-diffusion equations are used to model glioma cells and are being used to predict tumor growth. This dissertation aims at developing such a framework to better understand the complex behavior of foraging ants and glioma cells.
ContributorsJamous, Sara Sami (Author) / Motsch, Sebastien (Thesis advisor) / Armbruster, Dieter (Committee member) / Camacho, Erika (Committee member) / Moustaoui, Mohamed (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2019
Description
This dissertation develops a second order accurate approximation to the magnetic resonance (MR) signal model used in the PARSE (Parameter Assessment by Retrieval from Single Encoding) method to recover information about the reciprocal of the spin-spin relaxation time function (R2*) and frequency offset function (w) in addition to the typical steady-state transverse magnetization (M) from single-shot magnetic resonance imaging (MRI) scans. Sparse regularization on an approximation to the edge map is used to solve the associated inverse problem. Several studies are carried out for both one- and two-dimensional test problems, including comparisons to the first order approximation method, as well as the first order approximation method with joint sparsity across multiple time windows enforced. The second order accurate model provides increased accuracy while reducing the amount of data required to reconstruct an image when compared to piecewise constant in time models. A key component of the proposed technique is the use of fast transforms for the forward evaluation. It is determined that the second order model is capable of providing accurate single-shot MRI reconstructions, but requires an adequate coverage of k-space to do so. Alternative data sampling schemes are investigated in an attempt to improve reconstruction with single-shot data, as current trajectories do not provide ideal k-space coverage for the proposed method.
ContributorsJesse, Aaron Mitchel (Author) / Platte, Rodrigo (Thesis advisor) / Gelb, Anne (Committee member) / Kostelich, Eric (Committee member) / Mittelmann, Hans (Committee member) / Moustaoui, Mohamed (Committee member) / Arizona State University (Publisher)
Created2019
Description
Patients suffering from Retinitis Pigmentosa (RP), the most common type of inherited retinal degeneration, experience irreversible vision loss due to photoreceptor degeneration. The preservation of cone photoreceptors has been deemed medically relevant as a therapy aimed at preventing blindness in patients with RP. Cones rely on aerobic glycolysis to supply the metabolites necessary for outer segment (OS) renewal and maintenance. The rod-derived cone viability factor (RdCVF), a protein secreted by the rod photoreceptors that preserves the cones, accelerates the flow of glucose into the cone cell stimulating aerobic glycolysis. This dissertation presents and analyzes ordinary differential equation (ODE) models of cellular and molecular level photoreceptor interactions in health and disease to examine mechanisms leading to blindness in patients with RP.
First, a mathematical model composed of four ODEs is formulated to investigate the progression of RP, accounting for the new understanding of RdCVF’s role in enhancing cone survival. A mathematical analysis is performed, and stability and bifurcation analyses are used to explore various pathways to blindness. Experimental data are used for parameter estimation and model validation. The numerical results are framed in terms of four stages in the progression of RP. Sensitivity analysis is used to determine mechanisms that have a significant affect on the cones at each stage of RP. Utilizing a non-dimensional form of the RP model, a numerical bifurcation analysis via MATCONT revealed the existence of stable limit cycles at two stages of RP.
Next, a novel eleven dimensional ODE model of molecular and cellular level interactions is described. The subsequent analysis is used to uncover mechanisms that affect cone photoreceptor functionality and vitality. Preliminary simulations show the existence of oscillatory behavior which is anticipated when all processes are functioning properly. Additional simulations are carried out to explore the impact of a reduction in the concentration of RdCVF coupled with disruption in the metabolism associated with cone OS shedding, and confirms cone-on-rod reliance. The simulation results are compared with experimental data. Finally, four cases are considered, and a sensitivity analysis is performed to reveal mechanisms that significantly impact the cones in each case.
First, a mathematical model composed of four ODEs is formulated to investigate the progression of RP, accounting for the new understanding of RdCVF’s role in enhancing cone survival. A mathematical analysis is performed, and stability and bifurcation analyses are used to explore various pathways to blindness. Experimental data are used for parameter estimation and model validation. The numerical results are framed in terms of four stages in the progression of RP. Sensitivity analysis is used to determine mechanisms that have a significant affect on the cones at each stage of RP. Utilizing a non-dimensional form of the RP model, a numerical bifurcation analysis via MATCONT revealed the existence of stable limit cycles at two stages of RP.
Next, a novel eleven dimensional ODE model of molecular and cellular level interactions is described. The subsequent analysis is used to uncover mechanisms that affect cone photoreceptor functionality and vitality. Preliminary simulations show the existence of oscillatory behavior which is anticipated when all processes are functioning properly. Additional simulations are carried out to explore the impact of a reduction in the concentration of RdCVF coupled with disruption in the metabolism associated with cone OS shedding, and confirms cone-on-rod reliance. The simulation results are compared with experimental data. Finally, four cases are considered, and a sensitivity analysis is performed to reveal mechanisms that significantly impact the cones in each case.
ContributorsBrager, Danielle Christine (Author) / Camacho, Erika (Thesis advisor) / Wirkus, Stephen (Thesis advisor) / Fricks, John (Committee member) / Gardner, Carl (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2020
Description
When solving analysis, estimation, and control problems for Partial Differential Equations (PDEs) via computational methods, one must resolve three main challenges: (a) the lack of a universal parametric representation of PDEs; (b) handling unbounded differential operators that appear as parameters; and (c), enforcing auxiliary constraints such as Boundary conditions and continuity conditions. To address these challenges, an alternative representation of PDEs called the `Partial Integral Equation' (PIE) representation is proposed in this work. Primarily, the PIE representation alleviates the problem of the lack of a universal parametrization of PDEs since PIEs have, at most, $12$ Partial Integral (PI) operators as parameters. Naturally, this also resolves the challenges in handling unbounded operators because PI operators are bounded linear operators. Furthermore, for admissible PDEs, the PIE representation is unique and has no auxiliary constraints --- resolving the last of the $3$ main challenges. The PIE representation for a PDE is obtained by finding a unique unitary map from the states of the PIE to the states of the PDE. This map shows a PDE and its associated PIE have equivalent system properties, including well-posedness, internal stability, and I/O behavior. Furthermore, this unique map also allows us to construct a well-defined dual representation that can be used to solve optimal control problems for a PDE. Using the equivalent PIE representation of a PDE, mathematical and computational tools are developed to solve standard problems in Control theory for PDEs. In particular, problems such as a test for internal stability, Input-to-Output (I/O) $L_2$-gain, $\hinf$-optimal state observer design, and $\hinf$-optimal full state-feedback controller design are solved using convex-optimization and Lyapunov methods for linear PDEs in one spatial dimension. Once the PIE associated with a PDE is obtained, Lyapunov functions (or storage functions) are parametrized by positive PI operators to obtain a solvable convex formulation of the above-stated control problems. Lastly, the methods proposed here are applied to various PDE systems to demonstrate the application.
ContributorsShivakumar, Sachin (Author) / Peet, Matthew (Thesis advisor) / Nedich, Angelia (Committee member) / Marvi, Hamidreza (Committee member) / Platte, Rodrigo (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2024