Matching Items (30)
Filtering by

Clear all filters

152362-Thumbnail Image.png
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

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
151507-Thumbnail Image.png
Description
Solution methods for certain linear and nonlinear evolution equations are presented in this dissertation. Emphasis is placed mainly on the analytical treatment of nonautonomous differential equations, which are challenging to solve despite the existent numerical and symbolic computational software programs available. Ideas from the transformation theory are adopted allowing one

Solution methods for certain linear and nonlinear evolution equations are presented in this dissertation. Emphasis is placed mainly on the analytical treatment of nonautonomous differential equations, which are challenging to solve despite the existent numerical and symbolic computational software programs available. Ideas from the transformation theory are adopted allowing one to solve the problems under consideration from a non-traditional perspective. First, the Cauchy initial value problem is considered for a class of nonautonomous and inhomogeneous linear diffusion-type equation on the entire real line. Explicit transformations are used to reduce the equations under study to their corresponding standard forms emphasizing on natural relations with certain Riccati(and/or Ermakov)-type systems. These relations give solvability results for the Cauchy problem of the parabolic equation considered. The superposition principle allows to solve formally this problem from an unconventional point of view. An eigenfunction expansion approach is also considered for this general evolution equation. Examples considered to corroborate the efficacy of the proposed solution methods include the Fokker-Planck equation, the Black-Scholes model and the one-factor Gaussian Hull-White model. The results obtained in the first part are used to solve the Cauchy initial value problem for certain inhomogeneous Burgers-type equation. The connection between linear (the Diffusion-type) and nonlinear (Burgers-type) parabolic equations is stress in order to establish a strong commutative relation. Traveling wave solutions of a nonautonomous Burgers equation are also investigated. Finally, it is constructed explicitly the minimum-uncertainty squeezed states for quantum harmonic oscillators. They are derived by the action of corresponding maximal kinematical invariance group on the standard ground state solution. It is shown that the product of the variances attains the required minimum value only at the instances that one variance is a minimum and the other is a maximum, when the squeezing of one of the variances occurs. Such explicit construction is possible due to the relation between the diffusion-type equation studied in the first part and the time-dependent Schrodinger equation. A modication of the radiation field operators for squeezed photons in a perfect cavity is also suggested with the help of a nonstandard solution of Heisenberg's equation of motion.
ContributorsVega-Guzmán, José Manuel, 1982- (Author) / Sulov, Sergei K (Thesis advisor) / Castillo-Chavez, Carlos (Thesis advisor) / Platte, Rodrigo (Committee member) / Chowell-Puente, Gerardo (Committee member) / Arizona State University (Publisher)
Created2013
150824-Thumbnail Image.png
Description
This thesis considers the application of basis pursuit to several problems in system identification. After reviewing some key results in the theory of basis pursuit and compressed sensing, numerical experiments are presented that explore the application of basis pursuit to the black-box identification of linear time-invariant (LTI) systems with both

This thesis considers the application of basis pursuit to several problems in system identification. After reviewing some key results in the theory of basis pursuit and compressed sensing, numerical experiments are presented that explore the application of basis pursuit to the black-box identification of linear time-invariant (LTI) systems with both finite (FIR) and infinite (IIR) impulse responses, temporal systems modeled by ordinary differential equations (ODE), and spatio-temporal systems modeled by partial differential equations (PDE). For LTI systems, the experimental results illustrate existing theory for identification of LTI FIR systems. It is seen that basis pursuit does not identify sparse LTI IIR systems, but it does identify alternate systems with nearly identical magnitude response characteristics when there are small numbers of non-zero coefficients. For ODE systems, the experimental results are consistent with earlier research for differential equations that are polynomials in the system variables, illustrating feasibility of the approach for small numbers of non-zero terms. For PDE systems, it is demonstrated that basis pursuit can be applied to system identification, along with a comparison in performance with another existing method. In all cases the impact of measurement noise on identification performance is considered, and it is empirically observed that high signal-to-noise ratio is required for successful application of basis pursuit to system identification problems.
ContributorsThompson, Robert C. (Author) / Platte, Rodrigo (Thesis advisor) / Gelb, Anne (Committee member) / Cochran, Douglas (Committee member) / Arizona State University (Publisher)
Created2012
135434-Thumbnail Image.png
Description
Chebfun is a collection of algorithms and an open-source software system in object-oriented Matlab that extends familiar powerful methods of numerical computation involving numbers to continuous or piecewise-continuous functions. The success of this strategy is based on the mathematical fact that smooth functions can be represented very efficiently by polynomial

Chebfun is a collection of algorithms and an open-source software system in object-oriented Matlab that extends familiar powerful methods of numerical computation involving numbers to continuous or piecewise-continuous functions. The success of this strategy is based on the mathematical fact that smooth functions can be represented very efficiently by polynomial interpolation at Chebyshev points or by trigonometric interpolation at equispaced points for periodic functions. More recently, the system has been extended to handle bivariate functions and vector fields. These two new classes of objects are called Chebfun2 and Chebfun2v, respectively. We will show that Chebfun2 and Chebfun2v, and can be used to accurately and efficiently perform various computations on parametric surfaces in two or three dimensions, including path trajectories and mean and Gaussian curvatures. More advanced surface computations such as mean curvature flows are also explored. This is also the first work to use the newly implemented trigonometric representation, namely Trigfun, for computations on surfaces.
ContributorsPage-Bottorff, Courtney Michelle (Author) / Platte, Rodrigo (Thesis director) / Kostelich, Eric (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05
189213-Thumbnail Image.png
Description
This work presents a thorough analysis of reconstruction of global wave fields (governed by the inhomogeneous wave equation and the Maxwell vector wave equation) from sensor time series data of the wave field. Three major problems are considered. First, an analysis of circumstances under which wave fields can be fully

This work presents a thorough analysis of reconstruction of global wave fields (governed by the inhomogeneous wave equation and the Maxwell vector wave equation) from sensor time series data of the wave field. Three major problems are considered. First, an analysis of circumstances under which wave fields can be fully reconstructed from a network of fixed-location sensors is presented. It is proven that, in many cases, wave fields can be fully reconstructed from a single sensor, but that such reconstructions can be sensitive to small perturbations in sensor placement. Generally, multiple sensors are necessary. The next problem considered is how to obtain a global approximation of an electromagnetic wave field in the presence of an amplifying noisy current density from sensor time series data. This type of noise, described in terms of a cylindrical Wiener process, creates a nonequilibrium system, derived from Maxwell’s equations, where variance increases with time. In this noisy system, longer observation times do not generally provide more accurate estimates of the field coefficients. The mean squared error of the estimates can be decomposed into a sum of the squared bias and the variance. As the observation time $\tau$ increases, the bias decreases as $\mathcal{O}(1/\tau)$ but the variance increases as $\mathcal{O}(\tau)$. The contrasting time scales imply the existence of an ``optimal'' observing time (the bias-variance tradeoff). An iterative algorithm is developed to construct global approximations of the electric field using the optimal observing times. Lastly, the effect of sensor acceleration is considered. When the sensor location is fixed, measurements of wave fields composed of plane waves are almost periodic and so can be written in terms of a standard Fourier basis. When the sensor is accelerating, the resulting time series is no longer almost periodic. This phenomenon is related to the Doppler effect, where a time transformation must be performed to obtain the frequency and amplitude information from the time series data. To obtain frequency and amplitude information from accelerating sensor time series data in a general inhomogeneous medium, a randomized algorithm is presented. The algorithm is analyzed and example wave fields are reconstructed.
ContributorsBarclay, Bryce Matthew (Author) / Mahalov, Alex (Thesis advisor) / Kostelich, Eric J (Thesis advisor) / Moustaoui, Mohamed (Committee member) / Motsch, Sebastien (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2023
168481-Thumbnail Image.png
Description
Solving partial differential equations on surfaces has many applications including modeling chemical diffusion, pattern formation, geophysics and texture mapping. This dissertation presents two techniques for solving time dependent partial differential equations on various surfaces using the partition of unity method. A novel spectral cubed sphere method that utilizes the windowed

Solving partial differential equations on surfaces has many applications including modeling chemical diffusion, pattern formation, geophysics and texture mapping. This dissertation presents two techniques for solving time dependent partial differential equations on various surfaces using the partition of unity method. A novel spectral cubed sphere method that utilizes the windowed Fourier technique is presented and used for both approximating functions on spherical domains and solving partial differential equations. The spectral cubed sphere method is applied to solve the transport equation as well as the diffusion equation on the unit sphere. The second approach is a partition of unity method with local radial basis function approximations. This technique is also used to explore the effect of the node distribution as it is well known that node choice plays an important role in the accuracy and stability of an approximation. A greedy algorithm is implemented to generate good interpolation nodes using the column pivoting QR factorization. The partition of unity radial basis function method is applied to solve the diffusion equation on the sphere as well as a system of reaction-diffusion equations on multiple surfaces including the surface of a red blood cell, a torus, and the Stanford bunny. Accuracy and stability of both methods are investigated.
ContributorsIslas, Genesis Juneiva (Author) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Espanol, Malena (Committee member) / Kao, Ming-Hung (Committee member) / Renaut, Rosemary (Committee member) / Arizona State University (Publisher)
Created2021
168448-Thumbnail Image.png
Description
High-dimensional systems are difficult to model and predict. The underlying mechanisms of such systems are too complex to be fully understood with limited theoretical knowledge and/or physical measurements. Nevertheless, redcued-order models have been widely used to study high-dimensional systems, because they are practical and efficient to develop and implement. Although

High-dimensional systems are difficult to model and predict. The underlying mechanisms of such systems are too complex to be fully understood with limited theoretical knowledge and/or physical measurements. Nevertheless, redcued-order models have been widely used to study high-dimensional systems, because they are practical and efficient to develop and implement. Although model errors (biases) are inevitable for reduced-order models, these models can still be proven useful to develop real-world applications. Evaluation and validation for idealized models are indispensable to serve the mission of developing useful applications. Data assimilation and uncertainty quantification can provide a way to assess the performance of a reduced-order model. Real data and a dynamical model are combined together in a data assimilation framework to generate corrected model forecasts of a system. Uncertainties in model forecasts and observations are also quantified in a data assimilation cycle to provide optimal updates that are representative of the real dynamics. In this research, data assimilation is applied to assess the performance of two reduced-order models. The first model is developed for predicting prostate cancer treatment response under intermittent androgen suppression therapy. A sequential data assimilation scheme, the ensemble Kalman filter (EnKF), is used to quantify uncertainties in model predictions using clinical data of individual patients provided by Vancouver Prostate Center. The second model is developed to study what causes the changes of the state of stratospheric polar vortex. Two data assimilation schemes: EnKF and ES-MDA (ensemble smoother with multiple data assimilation), are used to validate the qualitative properties of the model using ECMWF (European Center for Medium-Range Weather Forecasts) reanalysis data. In both studies, the reduced-order model is able to reproduce the data patterns and provide insights to understand the underlying mechanism. However, significant model errors are also diagnosed for both models from the results of data assimilation schemes, which suggests specific improvements of the reduced-order models.
ContributorsWu, Zhimin (Author) / Kostelich, Eric (Thesis advisor) / Moustaoui, Mohamed (Thesis advisor) / Jones, Chris (Committee member) / Espanol, Malena (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2021
189270-Thumbnail Image.png
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

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
187790-Thumbnail Image.png
Description
Balancing temporal shortages of renewable energy with natural gas for the generation of electricity is a challenge for dispatchers. This is compounded by the recent proposal of blending cleanly-produced hydrogen into natural gas networks. To introduce the concepts of gas flow, this thesis begins by linearizing the

Balancing temporal shortages of renewable energy with natural gas for the generation of electricity is a challenge for dispatchers. This is compounded by the recent proposal of blending cleanly-produced hydrogen into natural gas networks. To introduce the concepts of gas flow, this thesis begins by linearizing the partial differential equations (PDEs) that govern the flow of natural gas in a single pipe. The solution of the linearized PDEs is used to investigate wave attenuation and characterize critical operating regions where linearization is applicable. The nonlinear PDEs for a single gas are extended to mixtures of gases with the addition of a PDE that governs the conservation of composition. The gas mixture formulation is developed for general gas networks that can inject or withdraw arbitrary time-varying mixtures of gases into or from the network at arbitrarily specified nodes, while being influenced by time-varying control actions of compressor units. The PDE formulation is discretized in space to form a nonlinear control system of ordinary differential equations (ODEs), which is used to prove that homogeneous mixtures are well-behaved and heterogeneous mixtures may be ill-behaved in the sense of monotone-ordering of solutions. Numerical simulations are performed to compute interfaces that delimit monotone and periodic system responses. The ODE system is used as the constraints of an optimal control problem (OCP) to minimize the expended energy of compressors. Moreover, the ODE system for the natural gas network is linearized and used as the constraints of a linear OCP. The OCPs are digitally implemented as optimization problems following the discretization of the time domain. The optimization problems are applied to pipelines and small test networks. Some qualitative and computational applications, including linearization error analysis and transient responses, are also investigated.
ContributorsBaker, Luke Silas (Author) / Armbruster, Dieter (Thesis advisor) / Zlotnik, Anatoly (Committee member) / Herty, Michael (Committee member) / Platte, Rodrigo (Committee member) / Milner, Fabio (Committee member) / Arizona State University (Publisher)
Created2023
189358-Thumbnail Image.png
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

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