Skip to main content

Applied and Computational Mathematics Seminar

Applied Math Seminar

Title: Mechanisms of stabilization and development in early multicellular evolution

Abstract: The evolution of life on Earth is marked by a few biological innovations that profoundly changed downstream evolutionary trajectories. John Maynard Smith and Eörs Szathmáry termed these innovations Major Evolutionary Transitions and among others, they include the evolution of multicellular organisms from unicellular ancestors. Although the fossil record is scarce to understand what happened in the early evolution of multicellularity, we can conduct experiments in the laboratory to evolve primitive multicellular organisms. Using an experimental model of multicellularity, called ‘snowflake yeast', and some theoretical tools, we asked: how is multicellularity stabilized over evolutionary time? and, how simple developmental rules can lead to an increase in multicellular size? The understanding of multicellular evolution can inform us about the mechanisms underlying other major evolutionary transitions, and more generally, this research can deepen our understanding of the evolution of biological complexity.

Date:
-
Location:
POT 745
Tags/Keywords:

Applied Math Seminar

Title: First-order Upwind Scheme for Solving the Adjoint Euler Equations

Abstract: A first-order upwind scheme based on matrix splitting is developed for solving the 2D adjoint Euler equations. We prove that the adjoint advection equation is a suitable model for the 1D adjoint Euler equations and use this knowledge to develop and study our proposed numerical scheme. Solution behavior is first discussed from a mathematical perspective and later demonstrated numerically for both the model equations and adjoint Euler equations.

Date:
-
Location:
Online
Tags/Keywords:

Applied Math Seminar

Title:  Linearized Krylov subspace Bregman iteration with nonnegativity constraint

Abstract: Bregman-type iterative methods have attracted considerable attention

in recent years due to their ease of implementation and the high quality of the

computed solutions they deliver. However, these iterative methods may 

require alarge number of iterations and this reduces their attractiveness. This talk

describes a linearized Bregman algorithm defined by projecting the 

problem tobe solved into an appropriately chosen low-dimensional Krylov subspace. The projection reduces both the number of iterations and the computational  effort required for each iteration. A variant of this solution method, in which nonnegativity of each computed iterate is imposed, also is described. 

The talk presents joint work with A. Buccini and M. Pasha.
Date:
-
Location:
POT 745
Tags/Keywords:

Applied Math Seminar

Title: Efficient control methods for stochastic Boolean networks

Abstract: The development of efficient methods for finding intervention strategies that can direct a system from an undesirable state into a more desirable state is an important problem in systems biology. The identification of potential interventions can be achieved through mathematical modeling by finding appropriate input manipulations that represent external interventions in the system. This talk will describe a stochastic modeling framework generalized from Boolean networks, which will be used to formulate an optimal control problem. The optimal control method requires a set of control inputs, each representing the silencing of a gene or the disruption of an interaction between two molecules. Several methods from Markov decision processes can be used to generate an optimal policy that dictates the action to be taken at each state. However, the computational complexity of these algorithms limits the applications of standard algorithms to small models. This talk will discuss alternate methods that can be used for large models.

Date:
-
Location:
POT 745
Tags/Keywords:

Applied Math Seminar

Title: Enhancing mechanistic modeling with machine learning

Abstract: At their core, biological systems are information processing systems. In response to numerous environmental cues, the complex molecular interaction networks within human cells integrate these signals and orchestrate a number of intricate cellular behaviors. Verbal argument and intuition alone are insufficient to understand how these complex networks control cellular behaviors or to rationally design treatment, and it is beneficial to translate these molecular networks into realistic and predictive mathematical models. However, the development of such models faces several fundamental challenges: 1) the control network is complex and full of interacting feedbacks, 2) the kinetic constants characterizing the biological reactions are often unavailable, 3) it is often impossible to derive analytical solutions of these models, and 4) once the models become increasingly realistic and complex, they are often as difficult to understand as the original biological system. To address these above mentioned challenges, we have developed an integrated computational pipeline that combines Mechanistic modeling, Machine learning and nonlinear dynamical analysis. By integrating different methods with unique strength and limitations, this innovative pipeline can potentially overcome each other’s limitations. This novel, integrated pipeline has been applied to study several different biological systems, and the results have been verified experimentally. Based on our theoretical analysis and experimental confirmation, we propose that his novel pipeline can be generally applied to understand any complex and uncertain biological systems.

Date:
-
Location:
POT 745
Tags/Keywords:

Applied Math Seminar

Title: Recovering data sparse in a frame

Abstract: In this talk, we will first review some classical results on compressed sensing, a subject about recovering sparse signals from undersampled linear measurements. The theory developed in compressed sensing is transformative as it has been applied to a broader class of data recovery problems such as matrix completion. Then we will focus on its generalization where signals are sparse in a redundant frame. We will discuss the challenges faced in this case, as well as some new results. A preliminary image inpainting application will also be addressed at the end of the talk.

Date:
-
Location:
POT 745
Tags/Keywords:
Subscribe to Applied and Computational Mathematics Seminar