Seminars and Colloquia by Series

Efficient Numerical Algorithms for Image Reconstruction with Total Variation Regularization and Applications in clinical MRI

Series
Applied and Computational Mathematics Seminar
Time
Monday, September 26, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Xiaojing Ye School of Mathematics, Georgia Tech
 We will discuss the recent developments of fast image reconstrcution with total variation (TV) regularization whose robustness has been justfied by the theory of compressed sensing. However, the solution of TV based reconstruction encounters two main difficulties on the computational aspect of many applications: the inversion matrix can be large, irregular, and severely ill-conditioned, and the objective is nonsmooth. We introduce two algorithms that tackle the problem using variable splitting and optimized step size selection. The algorithms also provide a general framework for solving large and ill-conditioned linear inversion problem with TV regularization. An important and successful application of TV based image reconstruction in magnetic resonance imaging (MRI) known as paratially parallel imaging (PPI) will be discussed. The numerical results demonstrate significantly improved  efficiency and accuracy over the state-of-the-arts. 

Discrete Mathematical Biology Working Seminar

Series
Other Talks
Time
Monday, September 26, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Greg BlekhermanGeorgia Tech
A discussion of the Ding & Lawrence (2003) paper "A statistical sampling algorithm for RNA secondary structure prediction."

Structure of crossing-critical graphs

Series
Graph Theory Seminar
Time
Friday, September 23, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Zdenek DvorakCharles University, Prague, Czech Republic
A graph G is k-crossing-critical if it cannot be drawn in plane with fewer than k crossings, but every proper subgraph of G has such a drawing. We aim to describe the structure of crossing-critical graphs. In this talk, we review some of their known properties and combine them to obtain new information regarding e.g. large faces in the optimal drawings of crossing-critical graphs. Based on joint work with P. Hlineny and L. Postle.

Burgers equation with random forcing and optimal paths in random landscape

Series
Stochastics Seminar
Time
Thursday, September 22, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Yuri BakhtinSchool of Mathematics, Georgia institute of Technology
The Burgers equation is a nonlinear PDE and one of the basic hydrodynamic models. The ergodic theory of the Burgers turbulence began with the work of E, Khanin, Mazel, Sinai (Ann. Math. 2000). In their paper and in subsequent papers by Khanin and his coauthors, the compact case (Burgers on a circle or torus) was studied. In this talk, I will discuss the noncompact case. The main object is optimal paths through clouds of Poissonian points.

Algebraic theory for discrete models in systems biology

Series
Mathematical Biology Seminar
Time
Wednesday, September 21, 2011 - 23:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Franziska HinkelmannMathematical Biosciences Institute, Ohio State University
Systems biology aims to explain how a biological system functions by investigating the interactions of its individual components from a systems perspective. Modeling is a vital tool as it helps to elucidate the underlying mechanisms of the system. My research is on methods for inference and analysis of polynomial dynamical systems (PDS). This is motivated by the fact that many discrete model types, e.g., Boolean networks or agent-based models, can be translated into the framework of PDS, that is, time- and state-discrete dynamical systems over a finite field where the transition function for each variable is given as a polynomial. This allows for using a range of theoretical and computational tools from computer algebra, which results in a powerful computational engine for model construction, parameter estimation, and analysis methods such as steady state behavior and optimal control. For model inference problems, the algebraic structure of PDS allows for efficient restriction of the model space to canalyzing functions, resulting in a subset of Boolean networks with "nice" biological properties.

Dynamic Modeling and Prediction of Risk Neutral Densities

Series
Mathematical Finance/Financial Engineering Seminar
Time
Wednesday, September 21, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Instr. Center 111
Speaker
Rong ChenDepartment of Statistics, Rutgers University

Please Note: Hosted by Christian Houdre and Liang Peng

Risk neutral density is extensively used in option pricing and risk management in finance. It is often implied using observed option prices through a complex nonlinear relationship. In this study, we model the dynamic structure of risk neutral density through time, investigate modeling approach, estimation method and prediction performances. State space models, Kalman filter and sequential Monte Carlo methods are used. Simulation and real data examples are presented.

Sharp Trace Inequality for the Fractional Laplacian.

Series
Research Horizons Seminar
Time
Wednesday, September 21, 2011 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Amit EinavGeorgia Tech
Sharp trace inequalities play a major role in the world of Mathematics. Not only do they give a connection between 'boundary values' of the trace and 'interior values' of the function, but also the truest form of it, many times with a complete classification of when equality is attained. The result presented here, motivated by such inequality proved by Jose' Escobar, is a new trace inequality, connecting between the fractional laplacian of a function and its restriction to the intersection of the hyperplanes x_(n)=0, x_(n-1)=0, ..., x_(n-j+1)=0 where 1<=j<=n. We will show that the inequality is sharp and discussed the natural space for it, along with the functions who attain equality in it. The above result is based on a joint work with Prof. Michael Loss.

The ABP maximum principle for fully nonlinear PDE with unbounded coefficients.

Series
PDE Seminar
Time
Tuesday, September 20, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Shigeaki KoikeSaitama University, Japan
In this talk, I will show recent results on the Aleksandrov-Bakelman-Pucci (ABP for short) maximum principle for $L^p$-viscosity solutions of fully nonlinear, uniformly elliptic partial differential equations with unbounded inhomogeneous terms and coefficients. I will also discuss some cases when the PDE has superlinear terms in the first derivatives. This is a series of joint works with Andrzej Swiech.

Pages