Seminar Series

Past Seminars

Current Seminars - Future Seminars - Past Seminars

Computational Applied Math - Computational Biology - Operations Research - Quantitative Finance - Statistics

Wednesday, November 30, 2011 Time: 1:00PM-2:00PM Location: Seminar Room 1-122

Speaker: Professor Hyunsun Lee, Department of Mathematics, Florida State University, Tallahassee, FL, USA

Title:
Identifying Lighthill source term with large-eddy simulation of subsonic turbulent jet

Abstract: An acoustic analogy using decomposition of the Lighthill source term to ten sub-terms is discussed in the light of a high-fidelity numerical simulation of a subsonic jet, at Mach number 0.9 and Reynolds number 100,000, with a baseline nozzle (SMC000) as a benchmark problem. These sub-terms consist of density, velocity, vorticity and dilatation fields, presenting their reciprocal non-linear interactions. To understand aerodynamic noise generation mechanism, intrinsic links between turbulence and emitted sound waves, such as cross-correlation function, are necessary. This causality method is directly adopted to the LES data to identify fundamental noise sources by calculating the cross-correlation between each spatial sub-term in near field and acoustic pressure fluctuation at a far field position, showing its contribution on the noise generation. Three principal noise production terms, related to Laplacian of turbulence kinetic energy and divergence of Lamb vector, are witnessed and interpreted, showing encouraging agreement with previous predictions. As a future work, the observation can be extended on SMC006 chevron jet nozzle configuration, possibly leading us to characterize the structure by comparing the correlation profiles with those of SMC000. Furthermore, this study is expected to shed light on assessing a better understanding and prediction on other sound control devices.

Friday, October 21, 2011, Time: 11:00-12:00PM Location: Seminar Room 1-122

Speaker: Prof. Falai Chen, University of Science and Technology of China

Title:
Splines over T-meshes and Applications in Geometric Modeling and Numerical Analysis

Abstract: In this talk, I will introduce the notion of splines over T-meshes and present some recent advances on the theory and applications of splines over T-meshes. The applications in Geometric Modelling and Isogeometric Analysis (IGA) are emphasized.


Wednesday, Nov. 2, 2011 Time: 1-2pm Location: Seminar Room 1-122

Speaker: Dr. Rajeev Jaiman, Director of CFD Development at Altair Engineering, Inc.

Title: Stable and Accurate Techniques for Transient Multiphysics Simulations

Abstract:   This presentation summarizes recent results obtained in the development of a novel numerical treatment of coupled multiphysics problems, with emphasis on the simulation of transient fluid-structure interaction (FSI) applications. The talk will begin with the example problems ranging from the propagation of shocks and blast waves along deformable structures, flutter instability, aeroelasticity-driven failure events in solid propellant rockets, offshore marine risers and pipelines, large scale wind turbines, nuclear energy, bio-medical and many more. The talk will focus on two aspects of the on-going research in the area of multiphysics simulations: (i) the development of an accurate scheme used to transfer fluid-induced loads across non-matching discretized interfaces; and (ii) the formulation and implementation of new stable and accurate coupling schemes between fluid and structural solvers. Beyond a presentation of the load transfer and coupling schemes, the talk will include results of a detailed comparative study between the proposed methods and existing schemes. These comparative assessments are based on a set of FSI applications of increasing complexity involving flat and curved fluid interfaces. The talk will conclude with a brief reporting on the successful applications of the new methods and their impact on the current state of the art in computational mechanics.

Wednesday, September 28, 2011, Time from 12:00-1:00PM. Location: AMS 1-122

Speaker:
Prof. Jean-Christophe Nave
The Department of Mathematics and Statistics
McGill University

Title:  
Discretizing Solutions vs. Discretizing Operators

Abstract: 

The linear advection equation possesses one of the simplest solution of any PDE, yet its numerical solution is still challenging. Interestingly, most numerical approaches ignore the structure of the solution and focus on discretizing the operator instead. I  will try to compare and contrast the two points of view and provide some useful insight to devise methods to solve more complicated problems. One such problem is Poisson's equation with internal jumps. This equation arises in the computation of fluid flows with multiple components (e.g., water and air). I will illustrate the various key points by presenting numerical solutions of fluid systems including drops, bubbles, and soap films. 

Friday, September 23, 2011, Time from 10:00AM -11:30AM. Location: AMS 1-122

Speaker: Prof. Hong Qian,
University of Washington

Title: Delbruck-Gillespie Processes: Nonlinear Stochastic Dynamics, Phase transition, Thermodynamics and Analytical Mechanics

Abstract:

Agent-based population dynamics articulates a distribution
in the behavior of individuals and considers deterministic
behavior at the population level as an emerget phenomenon.
Using chemical species inside a small aqueous volume as a
 example, we introduce Delbruck-Gillespie birth-and-death
process for chemical reactions dynamics.  Using this formalism,
we (1) illustrate the relation between nonlinear saddle-node bifurcation
 and first-order phase transition;  (2) introduce a thermodynamic theory
for entropy and entropy production; (3) show how an analytical mechanics
 (i.e., Lagrangian and Hamiltonian systems) arises and the meaning of
kinetic energy.  We suggest the inter-attractoral stochastic dynamics as a
possible mechanism for isogenetic variations in cellular biology.


Friday, March 11, 2011, 1:00 pm, AMS Seminar room 1-122A

Title: Numerical simulations of ideal MHD and applications in astrophysics
Dr. Christian Klingenberg
Institut of Applied Mathematics, Würzburg University, Germany

Abstract: We introduce a finite volume code for ideal MHD. Ingredients are: an approximate Riemann solver, extension to multidimensions via a Powell term, second order preserving positivity. We have extensively tested our code. We then show driven turbulence simulations applied to star formation.

Computational Biology

Tuesday, May 31, 2011, Time 11:00am - 12:00pm, Location: AMS Seminar Room, Math Tower 1-122

Speaker: Dr. Karunesh Arora

Title: Multiscale Modeling and Simulation as a Tool to Integrate Biomolecular Structure, Dynamics, and Function

Abstract:

Large-scale conformational changes in proteins are often related to their function such as in signal transduction, immune response, protein folding, or enzymatic activity. These conformational changes can be induced by the interaction with other proteins or ligands. One of the key questions is to understand how the binding of a substrate (i.e., small molecule ligand or protein/nucleic acid) leads to large-scale protein motions. To understand this molecular recognition process completely, it is essential to determine the orresponding conformational transition pathway as well as the underlying energy landscape of the conformational changes taking place. This, in turn, will point to ways to modulate protein function and help inform the search for pharmacological treatments of human diseases. X-ray crystallography provides crucial structural information on the conformation of the biomolecule before and after the conformation changes but reveal less about the transition dynamics between two end structures. Molecular dynamics (MD) simulations can provide an atomically detailed picture of both the kinetics and thermodynamics of conformational changes and have become an important tool for investigating the dynamics of biological molecules. Unfortunately, brute-force MD simulations typically fall orders of magnitude short of biologically relevant timescales (μs–ms time range). In this seminar, I will present our multiscale modeling and enhanced sampling simulation approach to overcome the spatial and timescale limitations in computational modeling of the substrate-induced structural transitions in large biomolecules. Furthermore, I will illustrate the applicability of our computational approach through the investigation of ATP hydrolysis driven mechanical deformations in AAA+ Helicase motor protein and the allosteric conformational changes in Adenylate Kinase enzyme. Our work in describing the energy landscape and dynamic reorganization of these molecular machines has already revealed that the thermodynamic flexibilities built into in the protein structure play a dominant role in predefining the mechanisms of substrate binding. My future research plan is to exploit this particular design feature of proteins to develop small-molecule inhibitors of therapeutic value. I am also interested in exploring how conformational fluctuations influence the
chemical step of enzyme catalysis. This understanding will have broad implications for our understanding of enzyme mechanisms and for design of novel protein catalysts

Friday May 6th, 2011, Time 1:15pm - 2:15pm, Location: AMS seminar room, Math Tower 1-122

Speaker: Dr. Rosemary Braun

Title: Spectral Clustering for Pathway Analysis of Gene Expression Data

Abstract:

Gene profiling experiments have become a ubiquitous tool in the study of disease, and the vast number of gene transcripts assayed by modern microarrays has driven forward our understanding of biological processes tremendously.  However, because most phenotypes studied by gene expression profiling studies are complex, there is a need for analytical techniques that can identify relationships between samples that are driven by many genes and that may exist on several scales.  In this talk, I will describe a spectral clustering based technique -- the Partition Decoupling Method (PDM) -- and present its application to several gene expression data sets, showing how PDM may be used to classify samples based on multi-gene expression patterns and to identify pathways associated with phenotype.  The PDM uses iterated spectral clustering steps, revealing at each iteration progressively finer structure in the geometry of the data; these iterations, each of which provide a partition of the data that is decoupled from the others, are carried forward until the structure in the data is indistinguishable from noise, preventing over-fitting.  Because it has the ability to reveal non-linear and non-convex geometries present in the data, the PDM is an improvement over typical gene expression analysis algorithms, permitting a multi-gene analysis that can reveal phenotypic differences even when the individual genes do not exhibit differential expression.  After describing the method, I will present the results of its application to several publicly-available gene expression data sets, demonstrating that PDM is able to identify cell types and treatments with higher accuracy than is obtained through other approaches.  By applying PDM in a pathway-by-pathway fashion, I will illustrate how the PDM may be used to find sets of mechanistically-related genes that discriminate phenotypes.

 

Wednesday, April 20, 2011, Time 1:00-2:00PM, Locationin AMS Seminar Room 1-122

Speaker: Prof. Evangelos A. Coutsias
Dept. of Mathematics and Statistics, University of New Mexico

Title:Protein Loop Modeling with Inverse Kinematics

Abstract:

Protein loops are the sections of the polypeptide chain connecting regions of secondary structure such as helices and beta strands.They may contain functional residues or have purely structural roles and often they can be the sites of evolutionary changes. In contrast to the relatively rigid helices and strands, loops can be flexible, allowing a protein to rapidly respond to changes and bind
to ligands. Structure determination of flexible loops with given endpoints is a challenging problem, commonly referred as the Loop Closure problem. Loop closure has been studied by computational methods since the pioneering work of Go and Scheraga in the '70s.
Our Triaxial Loop Closure (TLC) method provides a simple and robust algebraic formulation of the loop closure problem for loops of arbitrary length and geometry.We present results of several recent studies showing that TLC samples loop conformations more efficiently than other currently available methods: TLC sampling augmented with a simulated annealing protocol using the Rosetta scoring potential was able to predict the native structures of several standard loop test sets with up to 12 residue loops with sub-­‐Angstrom mean accuracy;TLC with a Jacobian guided Fragment Assembly scheme was shown to outperform other methods
in generating near native ensembles;and finally, TLC based local moves were incorporated in a new Monte Carlo scheme that
hierarchically samples backbone and sidechains, making it possible to make large moves that cross energy barriers. The latter
method, applied to the flexible loop in triosephosphate isomerase that caps the active site, able to generate loop ensembles agreeing
well with key observations from previous structural studies.Further applications of kinematic geometry to protein modeling will be
discussed as time permits.

Monday April 18th, 2011, Time 1:00pm - 2:00pm, Location: AMS seminar room, Math Tower 1-122

Speaker: Prof. Michal Brylinski
Georgia Institute of Technology, Atlanta

Title: Ligand Homology Modeling as a new computational platform to support modern drug discovery

Abstract:

As an integral part of drug development, high-throughput virtual screening is a widely used tool that could in principle significantly reduce the cost and time needed to discover new pharmaceuticals. In practice, virtual screening algorithms suffer from a number of limitations and the development of new methodologies is required. In this talk, I will discuss the ideas of Ligand Homology Modeling (LHM), which is likely one of the first approaches in Cheminformatics that successfully extends template-based techniques, commonly used in proteins structure prediction, to the modeling of protein-ligand interactions. Our intensive research in this field culminated in the development of a novel virtual screening approach, which appears as a powerful compound prioritization technique applicable to the early stages of proteome-scale drug design projects. As an example, I will describe the application of LHM to all kinase domains in humans, which has provided the scientific community with a very extensive structural and functional characterization of the human kinome to support the discovery of novel kinase inhibitors.

Wednesday April 13th, 2011, Time 1:00pm - 2:00pm, Location: AMS seminar room, Math Tower 1-122

Speaker: Dr. Thomas MacCarthy

Title: Modeling somatic hypermutation in B-cells

Abstract:

Somatic hypermutation (SHM) is a fundamental process in antibody diversity generation that functions by introducing point mutations into the variable regions of immunoglobulin (Ig) heavy and light chain genes of B-cells. The enzyme activation-induced cytidine deaminase (AID) has been found to play a central part in SHM by generating C→U mutations. AID achieves this by cytosine site deamination, which occurs preferentially at so-called hotspot motifs. Computational models can be used to produce simulated sequences which in turn can be compared to “control” (e.g. wildtype) datasets. I previously used a computational model of AID activity to quantify the contribution of simple hotspot motif targeting to the mutation process, and found that the model could only account for ~50% of the complexity of the full in vivo mutation process. Extending the model by incorporating features such as processivity and DNA entry sites for AID increases the explained complexity to over 80% when compared to a large dataset of human IGHV3-23 sequences. We have also investigated AID entry sites experimentally by inserting a cluster of overlapping hotspot motifs into the human heavy chain V region expressed by the Ramos Burkitt’s lymphoma cell line using both a cell-free in vitro assay and intact Ramos cells. Clustering analysis of the in vitro data shows that wildtype sequences contain a protected segment in the 3’ half of the V region. The protection appears to occur stochastically, affecting only a subset of sequences. When the cluster of hotspots was inserted, the protection disappeared. In Ramos cells when the hotspot cluster was inserted into the endogenous Ig locus, only one of five Ramos clones displayed a focusing of mutation within the cluster as well as a concentration of mutations 3’ to the cluster suggesting that the stochastic use of entry sites and disruption of 3’ protection also apply in the in vivo context.

Monday, March 28, 2011, 2:30 - 3:30pm. Simon Center Lecture Hall.

Speaker: Dr. James Chen
Senior Biomedical Research Service/Senior Mathematical Statistician National Center for Toxicological Research, FDA Fellow, American Statistical Association.                                                                                                                                             

Title: Statistics in the Analysis of High-Dimensional Biological Data

Abstract:

High-throughout genomic, proteomic, and metabolomic technologies are widely used in biomedical research to develop molecular biomarkers of exposure, toxicity, disease risk, disease status and response to therapy. High-dimensional data often refer to a data set where each sample is described by hundreds or thousands of correlated measurements of attributes; the number of samples can be large too. This talk presents salient problems and challenges encountered in the analysis of high-dimensionality, multiple testing, gene set enrichment analysis, dimensionality reduction with feature selection and feature extraction, and ensemble classification.

 

Operations Research

Thursday, April 26, 10:45 - 11:45AM, Math Tower 1-122

Speaker: Michael Kokkolaras
Department of Mechanical Engineering
University of Michigan, Ann Arbor

Title: Rigorous Engineering Design by means of Mathematical Programming

Abstract:
Mathematical programming is a valuable tool for developing rigorous, quantitative methodologies in engineering design. In this talk, we present optimization-based approaches to address two challenges in systems design and product development. The first challenge concerns the appropriate formulation and ecient solution of decomposed system design problems. The subproblems are linked by consistency constraints that need to be coordinated to ensure system integration. We use an augmented Lagrangian penalty function approach to formulate the subproblems and the alternating direction method of multipliers to coordinate their solution. After Introducing a hierarchical approach, we present non-hierarchical formulations that enable ecient solution of general multidisciplinary design optimization problems. We consider applications in automotive and aerospace engineering and discuss computational tools that facilitate automated implementation of the coordination process. The second challenge pertains to platform-based design of product families. Product families consist of product variants that share components and/or manufacturing processes (the platform) to save costs and reduce lead times. The challenge is to identify what to share so that commonality bene ts are maximized while individual product performance losses are minimized. We use a multi-objective optimization approach that enables the solution of the
commonality problem while quantifying tradeo s among the conicting design objectives of individual product variants. The proposed methodology is demonstrated using an engine family design problem.

 

Friday, April 27, 10:30-12:00PM, Math Tower 4-130 (Math Department Seminar Room)

Speaker: Albert N. Shiryaev
Steklov Mathematical Institute and Moscow State University, Moscow, Russia

Title: On Some Sequential Time-Dependent Bayesian Problems

Abstract:
We present solutions of the several sequential decision problems characterized by the property that optimal stopping times are times when some process-sufficient statistics reaches some (unknown) nonlinear boundary that depends of time. These problems include:
1.Testing of THREE statistical hypotheses about drift of the Brownian motion;
2.Chernoff problem of the testing two hypotheses (m >0 and m<0) about a drift m of the observable Brownian motion;
3.Stochastic version of the trading rule "Buy and Hold."
For all these problems optimal boundaries satisfy some Volterra-type integral equations of the second order.

 

Tuesday, April 17, 2012, 1:00 - 2:30PM, Math Tower 1-122

Speaker: Mark S Squillante
IBM T.J. Watson Research Center, Yorktown Heights, NY

Title: Linear Stochastic Loss Networks: Analysis and Optimization

Abstract:
We investigate fundamental properties of throughput and cost in linear stochastic loss networks where customers enter at a fixed source node, are relayed from one node to the next node in a fixed sequence of nodes, and exit the network at a fixed destination node. The maximum throughput of the stochastic network with exponential service times is derived and the arrival process that maximizes throughput, given a fixed arrival rate, is established. We first show that it is feasible to achieve an asymptotic throughput scalability of $c/\sqrt{k}$ in a linear $k$-node loss network as the size of the stochastic network grows, where the maximum achievable $c$ in a network with exponential service times is shown to be equal to the service rate multiplied by $1/\sqrt{\pi}$. Then, for general service times, an asymptotically critical loading regime is identified such that the probability of an arbitrary customer being lost is strictly within $(0, 1)$ as the network size increases. This regime delivers throughput comparable to the maximum at a relatively low network cost, and we further establish the asymptotic throughput and network cost under this critical loading. These results support a general framework for the optimization of trade-offs between throughput and cost in the critical regime under a wide variety of utility functions. Some previous work that motivated and led to our investigation of this particular stochastic network will be discussed.

 

Tuesday, February 28, Math Tower 1-122, 1:00-2:30

The talk is based on a joint paper with Eugene A. Feinberg and Nina V. Zadoianchuk

Speaker: Pavlo O. Kasyanov
Institute for Applied System Analysis, National Technical University of Ukraine ``Kyiv Polytechnic Institute''

Title: Average-Cost Markov Decision Process with Weakly Continuous Transition Probabilities

This talk presents sufficient conditions for the existence of stationary optimal policies for average-cost Markov Decision Processes with Borel state and action sets and with weakly continuous transition probabilities. The one-step cost functions may be unbounded, and action sets may be noncompact. Our main contributions are: (i) general sufficient conditions for the existence of stationary discount-optimal and average-cost optimal policies and descriptions of properties of value functions and sets of optimal actions, (ii) a sufficient condition for the average-cost optimality of a stationary policy in the form of optimality inequalities, and (iii) approximations of average-cost optimal actions by discount-optimal actions.

 

Quantitative Finance

Tuesday, May 8, 2012, 2:00 - 3:00PM, Math Tower, Seminar Room 1-122

Speaker: Alexander Melnikov
Professor, University of Alberta, Edmonton, Canada
E-mail: melnikov@ualberta.ca

Title: On Quantitative Risk-Management in Equity-Linked Life Inurance

Abstract:
In the talk we study equity-linked life insurance contracts with fixed and stochastic guarantees linked to the evolution of a financial market. The presence of a client’s mortality risk does not allow perfect hedging, and we utilize imperfect hedging methodologies. These methodologies were developed in mathematical finance based on loss function conceptions (quantile and efficient hedging) and risk measures. We allow an insurance company to be exposed to a financial risk. The price of the contracts will be subject to a maximization/minimization of the expected loss function/risk measure under initial budget constraints. In the Black-Scholes and jump-diffusion setting we derive equations separating financial and insurance risks embedded in the contracts and propose a methodology for effective risk-management of the contracts. Pooling homogeneous clients together enables the insurance company to take advantage of diversification of a mortality risk. A large enough portfolio of life insurance contracts will result in a more predictable mortality exposure and reduced prices. The results will be illustrated with the help of financial indices (S&P 500 and the Russell 2000).

Thursday, May 3, 2012, 2:00 - 3:00PM, Math Tower, Seminar Room 1-122

Speaker: Sergio Focardi
Professor, Finance, Law & Accounting Department
Edhec Business School, Nice France

Title: Factor Models in Finance

Abstract:
This presentation discusses factor models in the theory and practice of finance. It presents the development of static and dynamic factor models and sketches the state-of-the-art of these models. It then outlines the development of modern approximate factor models and the techniques used to determine the number of factors, including methods based on random matrix theory and model selection criteria. Next, using results of original research conducted jointly with Professors Frank Fabozzi and Svetlozar Rachev, it discusses how factor models of prices offer better forecasting capability than factor models of returns.

 

Monday, April 30, 2012, 1:00 - 2:00PM, Simons Center, Lecture Hall Room 102

Speaker: John Mulvey
Professor, Bendheim Center for Finance Operations Research and Financial Engineering Department
Princeton University

Title: Optimal Asset Allocation and Asset-liability Management Systems: Lessons from the 2008/09 Crash

Abstract:
Many institutional and individual investors lost considerable capital - over 25 to 30% - during the 2008/09 crash period. The traditional Markowitz model assumptions, such as fixed correlations, failed during the turbulent periods when contagion occurred across most asset categories. We discuss extensions of optimal portfolio models based on regimes via Hidden Markov Models and advanced overlay strategies. The role of managed futures and commodities for enhancing performance will be discussed.

 

Wednesday, March 21, 2012, 2:00 - 3:00 PM, Math Tower, Seminar Room 1-122

Speaker: Rosella Giacometti

Title: The Credit default swap market and its implied information

Abstract:
After an examination of the characteristics of the European market for credit default swaps, we will discuss how these instruments can be used to extract forward-looking measures of credit risk, in particular the implied probability of default of reference entities and the joint probability of default of the reference entities and counterpart.


Monday, March 12, 2012, Math Tower, Seminar Room 1-122, 2:00PM-3:00PM

Speaker: Ilya Pollak
Associate Professor of Electrical & Computer Engineering, Purdue University

Title: Stochastic Image Models with Applications to the Analysis of Alloy Micrographs.

Abstract:
In the development cycle of advanced materials, computerized data analysis and simulation has the potential to make a very significant impact by drastically reducing the time necessary to synthesize and test a new material.  It is critically important to develop image segmentation procedures that are able to accurately extract and classify structures of interest in microscope imagery, such as individual grains or different phases in a material.  Further analysis can then be performed to discover the relationships between these structures and properties of the material.

The emergence of computerized microscopes and the resulting high volume of collected imagery has made it impossible for a human operator to perform image segmentation and analysis, requiring the development of effective techniques which require little or no human intervention. Importantly, since abundant prior information is usually available regarding the shape of the structures of interest, any viable segmentation method must properly account for such information.

Similar segmentation problems arise in many other applications: analysis of microscopy images of cells; extraction of buildings and road networks from remove sensing images; and population counting in surveillance, remote sensing, and microscopy.

To address such problems, we propose a novel way of constructing and enforcing shape priors within a maximum a posteriori (MAP) segmentation framework.  After computing a preliminary segmentation through matching pursuit, our algorithm uses it to construct a prior model for a MAP segmentation problem.  This problem is then solved using a min-cut algorithm.  The resulting algorithm has a small number of parameters that need to be selected by the user, and produces very accurate segmentations.  It significantly
outperforms both the MAP segmentations obtained without the shape prior, and the matching pursuit segmentations.

We then introduce the concept of point processes with multiresolution marks and show how they can be used to generalize our models and algorithms.

This is joint work with Landis Huffman, Jeff Simmons, and Marc De Graef.

 

Wednesday, February 29, 2012, Time from 2:00PM -3:00PM, Location: Math Tower, Seminar Room 1-122

Speaker: Alan De Genaro Dario
Courant Institute of Mathematical Sciences - NYU

Title: Properties of Doubly Stochastic Poisson Processes with Affine Intensities

Abstract:
This paper discusses properties of a Doubly Stochastic Poisson Process (DSPP) where the intensity process belongs to a class of affine diffusions. For any intensity process from this class we derive an analytical expression for probability distribution functions of the corresponding DSPP. A specification of our results is provided in a particular case where the intensity is given by one-dimensional Feller process and its parameters are estimated by Kalman filtering for high frequency transaction data.


Thursday, November 17th, 2011, Time: 2:00pm-3:30pm Location: Simon Center Room 102

Speaker: Dr. Andrew Mullhaupt

(AMS Stony Brook) many years in finance, (Morgan Stanley, Renaissance Technologies, SAC Capital).Research Professor, Ph.D., 1984, New York University

Title: Information Geometry and Prediction

Abstract:

New ideas can dramatically outperform classical statistical methods. Why? Careful application of classical applied mathematical is part of the story.
But deep ideas in analysis and geometry lie at the heart of this success. Connections will be drawn from an actual prediction example in finance, to the geometry of Hardy space, and to the geometry of a particular Kahler manifold of rational functions.

Wednesday, November 2nd, Time: 11:00am-12:00pm Location: Math Tower, Seminar Room 1-122

Speaker:
Sandeep A. Patel, Executive Vice President, WR Group

Title: Lessons from Hedge Fund Replication: Information Asymmetry, Risk Management and Asset Allocation

Abstract: What lessons have we learnet from hedge fund investing?  How does this experience guide asset allocation and regulatory policy?  How has this experience guided the application of quantitative methodology to asset management?  I examine these questions with perspectives gained from academic studies and practitioner products on Hedge Fund Replication.  My focus is to relate our understanding of the sources of hedge fund returns to the broader theoretical constructs of the Efficient Market Hypothesis (EMH), Option Pricing, market microstructure and risk management.  This analysis leads to some interesting insights and research directions relevant to asset allocation and regulatory/disclosure framework.

Thursday, October 27th, 2011, Time: 2:00pm-3:30pm Location: Simon Center Room 102

Speaker: Dr. Michel Balinski

Laboratoire d'Econométrie
Ecole Polytechnique
91128 Palaiseau Cedex, France

Title: "Judge, Don't Vote !"

Abstract:

Judge: Don’t Vote!

Ecole Polytechnique and CNRS, Paris
(based on joint work with Rida Laraki)

The intent of this talk is to make three major points.
1. The traditional model of the theory of voting and social choice fails for
two separate reasons:
• the voters’ and judges’ inputs are inadequate,
• the theory that emerges is inconsistent and contradictory.
2. The traditional majority methods of voting—notably first-past-the-post
and two-past-the-post—fail in practice.
3. A more meaningful and realistic model gives voters the right to express
their opinions fully and leads to a method that best meets the traditional
criteria of what constitutes a good method of election and of judging
competitors: majority judgment. It is described via a recent representative
national presidential poll conducted in France.
Reference: Michel Balinski and Rida Laraki, Majority Judgment: Measuring,
Ranking, and Electing, 2010. Cambridge, MA and London, England: The MIT
Press.

Tuesday October 11, 2011, Time from 12:00pm -1:00pm, Location: AMS 1-122

Speaker: Prof. Dr. Ludger Ruechendorf

Title: Stochastic dependence, extremal risk and optimal portfolio diversification

Abstract:

This talk is concerned with the description of possible influence of
positive dependence on the magnitude of risk in a portfolio vector.
We discuss and review developments on the classical problem of Fr\'echet
type bounds with univariate and multivariate marginals, and their
applications to related various dependence orderings. As application we
identify the worst case dependence structure of a portfolio of
$d$-dimensional risks.
In the second part we consider some new developments on the portfolio
diversification problem.In the framework of multivariate extreme value
theory we determine risk optimal portfolios and consider statistical
properties of their empirical versions.

Wednesday, September 28, 2011, Time from 11:00AM -12:00PM, Location: Physics Building P127
Speaker: Stanislav (Stan) Lazarov
(Chief Architect,Cognity, FinAnalytica Inc)


Title: Developing risk management system - Cognity

Abstract:

FinAnalytica is a leading provider of real world portfolio and risk management solutions for quantitative analysts and portfolio managers. FinAnalytica's Cognity software suite
incorporates the latest and most transparent advances in analytics,including comprehensive treatment of real world fat-tailed and skewed asset returns. With offices in New York,
London and Sofia, FinAnalytica supports leading asset managers, hedge funds, pension funds, endowments and fund of funds globally. Started 10 years ago with a team of 5 people, today our company has more than 50 talented individuals who work
together to constantly develop the ever growing  software solution. The team is comprised of a dozen of quants, most of them holding PhD in applied mathematics,developers holding computer science degree, business analysts and client
services managers with MBA background and IT professionals. Cognity has been designed from ground up with a multiplatform, highly scalable architecture allowing for hundreds of thousands of assets to be simulated and their risk statistics to be calculated. In addition to innovative analytics, we employ connectors to a couple of data providers and offer both interactive reports and Excel reports.

I have been with FinAnalytica for almost 9 years, 6 of them - on senior positions - Chief Architect, Head of Framework team, Head of position-based Cognity and now - Head of Technical Services. I was a direct witness of the progress of our company and this
allows me to present you the development history from first hand.


Tuesday August 16, 2011, Time from 2:45pm -3:45pm, Location: AMS 1-122

Speaker: Prof. Stefan Mittnik.
Chair of Financial Econometrics, Department of Statistics and
Center for Quantitative Risk Analysis, University of Munich, Germany,

Title: Solvency II Calibrations: Where Curiosity Meets Spuriosity

Abstract:
The European Union’s new regulatory framework for the insurance industry, called Solvency II, is scheduled to come into force in 2013. By imposing a mark-to-market regime for solvency-capital requirements (SCR), the new regulation will greatly impact the way insurers and reinsurers compose their asset allocation. With assets totaling US$ 9.5 trillion, this will have far reaching consequences for global capital markets.

To derive a company’s SCR, the Solvency II framework specifies a Standard Formula, which has two inputs: the SCRs of individual risk components and their correlations. To appropriately calibrate these input parameters, several Quantitative Impact Studies that have been conducted.
Focusing on the equity-risk module, the most significant risk component making up about 25% in total SCR, we demonstrate that the proposed calibrations of the input parameters are seriously flawed. As a consequence, the implementation of the Standard Formula with the currently proposed calibration settings will lead to spurious, empirically unfounded and highly erratic SCR calculations.

Thursday May 26th, 2011, Time 2:30pm - 3:30pm, Location: Humanities Building. Room 1003

Speaker: William H. May
Senior Vice President and FRM Program Manager, Research Center, Global Association of Risk Professionals (GARP)

Title: GARP programs, including the Financial Risk Manager (FRM) and Energy Risk Professional (ERP) Certifications, the Advocacy program and risk education and training from entry level to board level. 

Abstract:

The Global Association of Risk Professionals (GARP) is made up of over 150,000 risk management practitioners and researchers representing banks, investment management firms, government agencies, academic institutions and corporations from more than 195 countries and territories worldwide. GARP’s mission is to help develop leaders within the risk management community by encouraging communications between practitioners, academics and regulators. The speaker will discuss GARP programs, including the Financial Risk Manager (FRM) and Energy Risk Professional (ERP) Certifications, the Advocacy program and risk education and training from entry level to board level.  Participants will have the opportunity to learn how GARP can add value to their risk management careers.

Wednesday, March 16, 2011, 1:00-2:00pm, Math Tower 1-122

Speaker: Yuedong Wang
Chair, Dept of Statistics & Applied Probability, University of California Santa Barbara

Title: Nonparametric Nonlinear Regression Models

Abstract:
Almost all of the current nonparametric regression methods such as
smoothing splines, generalized additive models and varying coefficients
models assume a linear relationship when nonparametric functions are
regarded as parameters. In this talk we present a general class of
nonparametric nonlinear models that allow nonparametric functions to
act nonlinearly. They arise in many fields as either theoretical or
empirical models. We propose new estimation methods based on an extension
of the Gauss-Newton method to infinite dimensional spaces and
the backfitting procedure. We extend the generalized cross validation
and the generalized maximum likelihood methods to estimate
smoothing parameters. Connections between nonlinear nonparametric
models and nonlinear mixed effects models are established. Approximate
Bayesian confidence intervals are derived for inference. We will also
present a user friendly R function for fitting these models.
The methods will be illustrated using two real data examples.

Operations Research

Friday, September 30, 2011, Time from 2:00PM -3:00PM, Location: AMS 1-122

Speaker: Dmitry Malioutov
DRW Holdings, algorithmic trading research

Title: Smooth Isotonic Covariances for Interest Rate Risk Modeling

Abstract:

In this talk we consider the problem of estimating the covariance
matrix of a high-dimensional random vector in the scarce data
setting, where the number of samples is less than or comparable
to the dimension. The sample covariance matrix is
a poor choice in this setting, and a variety of structural
assumptions or priors have been considered in the literature:
covariance selection models with sparse precision matrices, low-rank
models (PCA and factor analysis), sparse plus low-rank, covariance
shrinkage, and others.

We suggest to use another type of structure, which plays an important
role in applications such as interest rate modeling in computational
finance: we assume that the random vectors can be indexed over
a low-dimensional manifold, and the covariance matrix has
smoothness and monotonicity properties over the manifold.
We describe how these assumptions can be enforced in a convex
optimization framework using semidefinite programming (SDP) via
interior point methods and first order proximal gradient methods.
Furthermore we also describe how this framework could be applied to
problems with missing data, and with asynchronous measurements.

Wednesday September 07, 2011, Time from 2:30pm -3:30pm, Location: Simon Center Room 102

Speaker: Prof. Gennady Samorodnitsky

School of Operations Research
and Information Engineering
Cornell University

Title: TAIL INFERENCE: WHERE DOES THE TAIL BEGIN?"

Abstract:

The quality of estimation of tail parameters, such as tail index in the univariate case,
or the spectral measure in the multivariate
case, depends crucially on the part of the sample included in the estimation.
A simple approach involving sequential statistical
testing is proposed in order to choose this part of the sample. This method
can be used both in the univariate and multivariate cases. It is
computationally efficient, and can be easily automated. No visual inspection of
the data is required. We establish consistency of the Hill estimator when
used in conjunction with the proposed method, as well describe its asymptotic
fluctuations. We compare our method to existing methods in
univariate and multivariate tail estimation, and use it to analyze Danish fire
insurance data.


Friday July 29, 2011, Time from 1:00pm -2:00pm, Location: AMS Seminar Room, Math Tower 1-122

Speaker:  Andrey Bernstein
Operations Research Visiting Faculty Candidate

Title: Adaptive Decision Making in Complex Environments: Some Algorithms and Applications

Abstract:

We consider the general problem of adaptive decision making in complex  and, possibly, unpredictable/adversarial environments. In this
context, two different frameworks will be discussed:

(i) Reinforcement Learning (RL), where the environment is modeled as an MDP with unknown reward/transition structure.  We discuss the
exploration-exploitation tradeoff: how to balance between choosing actions for the purpose of learning and trying to maximize the return
based on the information gathered so far. We present an algorithm which solves this trade-off efficiently for very large spaces, using
adaptive state aggregation.

(ii) No-Regret Learning, where (part of) the environment is unpredictable and possibly adversarial. The power of a no-regret
algorithm is that it performs as well as an offline algorithm that knows (in hindsight) the whole history of that unpredictable
component. We discuss the possibility of devising online learning algorithms which will enjoy the ``best of two worlds''. They will have
the same guarantees as standard RL algorithms if the environment is stochastic and stationary, while if the environment has an
unpredictable/adversarial component, it will have a no-regret property.

Finally, we discuss some applications where both RL and no-regret algorithms can be used. These include various control problems,
online routing problem, online classification problem, and applications related to the smart power grid and cognitive radio.

Friday, June 17, 2011, Time 11:00am - 12:00pm, Location: AMS Seminar Room, Math Tower 1-122

Speaker: Jian Hu

A Ph.D. candidate in the Department of Industrial Engineering and Management Sciences at Northwestern University. He received a M.S. degree in Logistics/Transportation from the University of Arkansas at Little Rock and a B.Eng. degree in Control Engineering from Xi’an Jiaotong University. He will receive his Ph.D. in 2011.

Title: Risk Adjusted Budget Allocation Models with Application in Homeland Security

Abstract: Multi-criteria optimization and risk-averse stochastic programming have been widely used to solve complex resource allocation problems under uncertainty, in energy, finance, supply chain management, health care, emergency response, and other areas. In many of these problems, high levels of uncertainty create the challenge of efficient information collection. Indeed, decision makers often hesitate to choose trade-off weights indicating the relative importance of different criteria and express a risk-averse utility function evaluating the economic benefit of allocated resources. In this talk, we present two robust approaches - the robust weighted sum method and stochastic dominance - reducing the impact of incomplete information. The proposed approaches are applied to the budget allocation to urban areas in the United States under the Urban Areas Security Initiative (UASI). Numerical results and analyses are reported to demonstrate the efficiency of these approaches.

Monday, June 06, 2011, Time 11:00am - 12:00pm, Location: AMS Seminar Room, Math Tower 1-122

Speaker: Dr. Evrim Dalkiran

Evrim Dalkiran is a postdoctoral associate and an adjunct faculty in the Grado Department of Industrial and Systems Engineering at Virginia Tech. She received her Ph.D. in Operations Research from Virginia Tech in May 2011. She holds B.S. and M.S. degrees from Industrial Engineering Department at Bogazici University, Turkey, earned in 2003 and 2006, respectively.  

Title:  Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques

Abstract:

This talk addresses the modeling and analysis of a strategic risk management problem via a novel decision tree optimization approach, as well as the development of enhanced Reformulation-Linearization Technique (RLT)-based linear programming (LP) relaxations for solving nonconvex polynomial programming problems, through the generation of valid inequalities and reduced representations, along with the design and implementation of efficient algorithms. We first conduct a quantitative analysis for a strategic risk management problem involving the allocation of resources and selection of decision alternatives to minimize the risk in the event of a hazardous occurrence. Using a decision tree to represent the cascading sequences of events as controlled by decision and investment alternatives, the problem is modeled as a nonconvex mixed-integer 0-1 factorable program. A branch-and-bound algorithm is developed for which convergence and computational results are discussed. Next, we enhance RLT-based LP relaxations for polynomial programming problems by developing two classes of valid inequalities: v-semidefinite cuts and bound-grid-factor constraints. The first of these uses concepts derived from semidefinite programming by imposing positive semidefiniteness on (constraint-factor scaled) dyadic variable-product matrices. We explore various strategies for generating cuts, and exhibit their relative effectiveness for tightening relaxations and solving the underlying polynomial programs. As a second cutting plane strategy, we introduce a new class of bound-grid-factor constraints that can be judiciously used to augment the basic RLT relaxations in order to improve the quality of lower bounds and enhance the performance of global branch-and-bound algorithms. Certain theoretical properties are established that shed light on the effect of these valid inequalities in driving the discrepancies between the RLT variables and their associated nonlinear products to zero. The results indicate that certain classes of v-semidefinite cuts and bound-grid-factor constraints significantly improve the computational performance.  Finally, we explore equivalent, reduced size RLT-based formulations for polynomial programs. Utilizing a basis partitioning scheme for an embedded linear equality subsystem, a strict subset of RLT equalities is shown to imply the remaining ones. Certain static and dynamic basis selection strategies are proposed to implement this procedure via an algorithm that assures convergence to a global optimum. Computational results are presented to demonstrate the improvement in overall effort.

 

Monday April 4th, 2011, Time 2:30pm - 3:30pm, Location AMS seminar room, Math Tower 1-122

Speaker: Prof. Andrzej Ruszczynski,
Department of Management Science and Informaion Systems Rutgers University

Title: Dynamic Risk-Averse Optimization

Abstract:
We present the concept of a dynamic risk measure and discuss its important properties. In particular, we focus on time-consistency of risk measures. Next, we focus on dynamic optimization problems for Markov models. We introduce the concept of a Markov risk measure and we use it to formulate risk-averse control problems for two Markov decision models: a finite horizon model and a discounted infinite horizon model. For both models we derive risk-averse dynamic programming equations and a value iteration method. For the infinite horizon problem we also develop a risk-averse policy iteration method and we prove its convergence. We propose a version of the Newton method to solve a non-smooth equation arising in the policy iteration method and we prove its global convergence. Finally, we discuss relations to Markov games.

Monday (March 14th) from 2:30-3:30pm at Math Tower 1-122.

Speaker: Huizhen (Janey) Yu

Title: Q-Learning and Enhanced Policy Iteration in Discounted Dynamic
Programming

Abstract: We consider the classical finite-state discounted Markovian
decision problem, and we introduce a new policy iteration-like Q-learning
algorithm for finding the optimal Q-factors. Instead of policy evaluation
by solving a linear system of equations, our algorithm requires (possibly
inexact) solution of a nonlinear system of equations, involving estimates
of state costs as well as Q-factors. This is Bellman's equation for an
optimal stopping problem that can be solved with simple Q-learning
iterations, in the case where a lookup table representation is used; it
can also be solved with the Q-learning algorithm of Tsitsiklis and Van Roy
[TsV99], in the case where feature-based Q-factor approximations are used.
In exact/lookup table representation form, our algorithm admits
asynchronous and stochastic iterative implementations, in the spirit of
asynchronous/modified policy iteration, with lower overhead and/or more
reliable convergence advantages over existing Q-learning schemes.
Furthermore, for large-scale problems, where linear basis function
approximations and simulation-based temporal difference implementations
are used, our algorithm resolves effectively the inherent difficulties of
existing schemes due to inadequate exploration.

Joint work with Dimitri P. Bertsekas.

Bio: Huizhen Yu is currently a postdoctoral researcher at Laboratory for
Information and Decision Systems (LIDS),  Massachusetts Institute of
Technology. She received the Ph.D. degree in computer science and
electrical engineering from Massachusetts Institute of Technology in 2006.
Her research interests include stochastic control, machine learning, and
nonlinear and convex optimization.

Friday, March 4, 2011, 2:30-3:30pm, Math Tower 1-122.

Speaker: Michael Fu
Program Director for Operations Research, National Science Foundation
(on leave from his position as Ralph J. Tyser Professor of Management
Science, Department of Decision, Operations and Information Technologies,
The University of Maryland, College Park)

Title: Stochastic Gradient Estimation: Tutorial Review and Recent Research

Abstract:
Stochastic gradient estimation techniques are methodologies for deriving
computationally efficient estimators used in simulation optimization and
sensitivity analysis of complex stochastic systems that require simulation to estimate their performance.
Using a simple illustrative example, the three most well-known direct
techniques that lead to unbiased estimators are presented: perturbation
analysis, the likelihood ratio (score function) method, and weak
derivatives. Applications are discussed and then some recent research
results in financial engineering and revenue management are presented.
Opportunities for NSF funding in the Operations Research Program will be
discussed at the end of the talk.

Bio
Michael Fu is Director of the Operations Research Program at NSF. He is on
leave from the University of Maryland at College Park where he is Ralph J.
Tyser Professor of Management Science in the Robert H. Smith School of
Business, with a joint appointment in the Institute for Systems Research
and affiliate faculty appointment in the Department of Electrical and
Computer Engineering, both in the A. James Clark School of Engineering.
He received degrees in mathematics and EE/CS from MIT in 1985, and a Ph.D.
in applied mathematics from Harvard University in 1989. His research
interests include simulation optimization and applied probability, with
applications in supply chain management and financial engineering. At
Maryland, he received the Business School's Allen J. Krowe Award for
Teaching Excellence in 1995, the Institute for Systems Research
Outstanding Systems Engineering Faculty Award in 2002, and was named a
University of Maryland Distinguished Scholar-Teacher for 2004-2005. He has
published four books: Conditional Monte Carlo: Gradient Estimation and
Optimization Applications (1997, co-author J.Q. Hu), which received the
INFORMS Simulation Society Outstanding Publication Award in 1998;
Simulation-based Algorithms for Markov Decision Processes (2007,
co-authors H.S. Chang, J. Hu, S.I. Marcus); Perspectives in Operations
Research (2006, co-editors F.B. Alt, B.L. Golden); and Advances in
Mathematical Finance (2007, co-editors R.A. Jarrow, J.-Y. Yen, R.J.
Elliott). He served as Stochastic Models and Simulation Department Editor
of Management Science from 2006-2008, as Simulation Area Editor of
Operations Research 2000-2005, and also on
the editorial boards of Mathematics of Operations Research, INFORMS
Journal on Computing, IIE Transactions, and Production and Operations
Management. He is a Fellow of INFORMS and IEEE.


Computational Applied Math

Feb 18, 2009 11:00am, AMS Seminar Room
Title: An inverse problem arising in flow in porous media
Professor Dan Marchesin
Institute for Pure and Applied Mathematics
Brazil

Most oil is produced by pumping water in some wells and recovering oil in others. The injected water often contains suspended particles that penetrate the rock and are retained in the pores. The rock becomes less permeable, and the well may become useless. This is deep bed filtration with formation damage. It is modeled by two conservation laws describing transport and retention of particles, and Darcy's law. The model contains an empirical "filtration function" of the deposited concentration, which cannot be measured directly. It must be recovered from experimental data by solving and ill-posed inverse problem, in the form of a functional equation. We present a robust method for solving this inverse problem mathematically, which gives rise to a robust numerical procedure. We show some numerical applications for real data.

Wednesday, Feb. 9, 2011, 1:00 pm, AMS Seminar room 1-122A
Dr. Michael Siegel, New Jersey Institute of Technology

Title: A hybrid numerical method for fluid interfaces with soluble surfactant

Abstract: We address a significant difficulty in the numerical computation
of fluid interfaces with soluble surfactant that occurs in the practically
important limit of large bulk Peclet number Pe. At the high values of
Pe in typical fluid-surfactant systems, there is a transition layer near
the interface in which the surfactant concentration varies rapidly.
Accurately resolving this layer is a challenge for traditional numerical
methods but is essential to evaluate the exchange of surfactant between
the interface and bulk flow. We present recent work that uses the
slenderness of the layer to develop a fast and accurate `hybrid' numerical
method that incorporates a separate analysis of the dynamics in the
transition layer into a full numerical solution of the interfacial free
boundary problem.

Wednesday, March 11, 2009, 10:30am, AMS Seminar Room, Math Tower 1-122
Title: DG/Spectral Volume and HR Limiting
Professor Zhiliang Xu
Department of Mathematics
University of Notre Dame

Hierarchical reconstruction for spectral volume and RKDG methods for solving hyperbolic conservation laws

In this talk, I will dicuss the recent development of hierarchical reconstruction (HR) [Liu etal., Central discontinuous Galerkin methods on overlapping cells with a non-oscillatory hierarchical reconstruction. SIAM J. Numer. Anal., 45:2442-2467, 2007 and Xu et al.,  Hierarchical reconstruction for  discontinuous Galerkin methods on unstructured grids with a WENO type linear reconstruction and partial neighboring cells. J.C.P. (in press)] for limiting solutions computed by spectral volume and RKDG methods for solving hyperbolic conservation laws. HR is applied to a piecewise quadratic polynomial on two-dimensional unstructured grids as a limiting procedure to prevent spurious oscillations in numerical solutions. The key features of this HR are that the reconstruction on each element only uses adjacent neighbors, which forms a compact stencil set, and there is no truncation of higher degree terms of the polynomial. We  explore a WENO-type linear reconstruction on each hierarchical level  for the reconstruction of high degree polynomials. We demonstrate that  the hierarchical reconstruction can generate essentially non-oscillatory solutions while keeping the resolution and desired order of accuracy for smooth solutions.

Wednesday, March 18, 2009, 12:00pm, AMS Seminar Room, Math Tower 1-122
Title: Central Discontinuous Galerkin Method and Hierarchical Reconstruction on Overlapping Cells
Professor Yingjie Liu
Department of Mathematics
Georgia Institute of Technology

The central scheme (Nessyahu and Tadmor '90) can be extended to staggered overlapping cells on which the O(1/dt) dissipation error due to grid shifting can be removed while keeping the benefit of using no flux function or Riemann solver. This strategy allows us
to develop a semi-discrete central Discontinuous Galerkin method (DG) on overlapping cells combining the benefit of the central scheme and the compact stencil of the DG method. This also allows standard Runge-Kutta time discretization methods to be used.
We are still at the beginning to understand some properties of central DG on overlapping cells. For example, its CFL number can be shown to decrease much slower than conventional DG method on non staggered grids as the order increases. Another interesting property is that hierarchical reconstruction on overlapping cells seems to generate higher resolution and smoother numerical solution compared to that on non staggered grids. Combining a new technique which uses partial neighboring cells for hierarchical reconstruction, we expect even better performance on overlapping cells. I will briefly introduce the recently developed hierarchical reconstruction technique on overlapping cells, and report our newest results. This technique does not use any charcteristic decomposition. It's compact and can be formulated on unstructured meshes naturally. The talk is based on several
collaborated works with C.-W. Shu, E. Tadmor, Z.-L. Xu and M.-P. Zhang.

Wednesday, April 1, 2009, 12:00pm, AMS Seminar Room, Math Tower 1-122
Title: TBA
Dr. Patrick M. Knupp
Distinguished Member Tehcnical Staff
Optimization Uncertainty Estimation Department
Sandia National Laboratories

Updating meshes on deforming domains via the target-matrix paradigm

Mesh quality can impact simulation accuracy and efficiency, as well as determine the time needed to create a mesh. Mesh
optimization is one of the more rigorous methods to improve quality. A new Target-matrix paradigm for mesh optimization is proposed in which targets, based on reference Jacobians of the local map, are constructed based on application-specific requirements. An important use of the paradigm involves that of updating meshes on deforming domains in order to maintain the quality of the original mesh.

Wednesday, April 22, 2009, 12:00pm, AMS Seminar Room, Math Tower 1-122
Title: Shock Wave Propagation in Tissue and Bone
Professor Randall J. LeVeque
Department of Applied Mathematics
University of Washington, Seattle

Studying the physical and biological mechanisms of extracorporeal shock wave therapy (ESWT) requires modeling the propagation of strong shock waves through tissue and bone. Interfaces between different biological materials lead to reflections and focusing of shock waves and the creation of strong rarefaction zones and cavitation fields. I will discuss recent numerical work using high-resolution finite volume methods in which each grid cell is allowed to have distinct material properties. Sharp interfaces either occur at cell edges (if an appropriate geometry-conforming grid can be obtained) or are represented by averaging the material properties over grid cells on a Cartesian grid. In either case, logically rectangular grids with adaptive mesh refinement are used to efficiently deal with multiscale problems where the medium has heterogeneities at various length scales.

Wednesday, June 24, 2009, 11:00am, AMS Seminar room, Math Tower 1-122
Alexandre Tartakovsky
Scientist
Computational Mathematics
Pacific Northwest National Laboratory

Title: Multi-scale simulations of multiphase flow and reactive transport in fractured and porous media.

Particle methods such as smoothed particle hydrodynamics are very robust and versatile for pore-scale flow and transport simulations, and it is relatively easy to add complex physical, chemical and biological processes into particle codes. However, the computational efficiency of particle methods is low relative to continuum methods. Multiscale particle methods and hybrid (particle-particle and particle-continuum) methods may be needed to improve computational efficiency and make effective use of emerging computational capabilities.

An SPH multiphase flow model was used to study the effects of pore-scale heterogeneity and anisotropy on infiltration/drainage cycles, entrapment and dissolution of non-wetting fluids and a pressure/saturation relationship.

An SPH reactive transport model was used as a part of a multi-scale numerical and experimental study of mixing-induced reactions and mineral precipitation. In a laboratory experiment, solutions containing Na2CO3 and CaCl2 were each injected in different halves of a quasi two-dimensional flow cell filled with quartz sand. Pore-scale simulations were conducted to help understand the mechanism of precipitation layer formation.

A meso-scale langevin model and a hybrid model were developed to bridge a gap between pore-scale and darcy-scale descriptions of transport processes.

Wednesday, September 23, 2009, 10:30 am, AMS Seminar room, Math Tower 1-122

Title: The Common Component Architecture for Scalable Scientific Software Engineering

Kostadin Damevski
Department of Mathematics and Computer Science
Virginia State University

Abstract:

In recent years, component technology has been a successful methodology for large-scale commercial software development. Component technology encapsulates a set of frequently used functions into a component and makes the implementation transparent to the users. Application developers typically use a group of components, connecting them to create an executable application. The Common Component Architecture (CCA) is a project whose goal is to use component technology in scientific computing to tame the software complexity required in coupling multiple disciplines, multiple scales, and/or multiple physical phenomena. The CCA is designed to fit the needs of the scientific computing community by imposing very low overhead, supporting parallel components, and enabling interoperability with legacy code. The CCA component model has already been used in several application domains, creating components for large simulations involving accelerator design, climate modeling, combustion, and accidental fires and explosions. These simulations are able to execute on sets of distributed memory machines spanning several computational and organizational domains. This talk will introduce the CCA and its associated tools and discuss some of the recent advancements made by this project.

Wednesday, October 7, 2009, 10:30 am, AMS Seminar Room 1-122

Viktor Kilchyk
Purdue University
vkilchyk@purdue.edu

Pressure-wave Amplification of Flame Area in Wave Rotor Channels

Abstract
Recent interest in novel engine concepts such as wave rotor combustors or pulse detonation engines highlighted the need for better understanding of the pressure wave-flame interaction phenomenon. For the optimum design of such devices, burning rate variation and thus flame area change following pressure wave passage should be well understood.

Deformation of an interface between fluids with different densities following a shock passage is referred as Richtmyer-Meshkov instability. To characterize interface increase produced by the instability, perturbation amplitude growth is commonly studied. However, it is the area of the interface that is crucial to flame speed and burning rate predictions. Therefore, in our work we studied numerically the area increase of a flame following a shock or an expansion wave passage. Numerical solutions to the Navier-Stockes equations were obtained using an in-house second order CFD code. The code is specialized in handling ideal and real compressible fluids. An upwind finite-volume spatial discretization was used with an approximate Riemann solver adapted to the generalized form of the governing equations.

It was found that the area of a sinusoidally perturbed flame increases almost linearly, for a time period significantly exceeding duration of growth of the perturbation amplitude. Opposite to the expected from the Richtmyer-Meshkov theory, for a given set of initial parameters, faster interface growth rates were observed in shock refractions where shock approached from the &#147;hot&#148; side of the interface (fast/slow refractions). More importantly, the computed interface growth rates produced by shocks and expansion waves showed nearly linear correlation with deposited circulation.

Using an analytical solution for shock and expansion wave deposited circulation, contribution of the flame area increase to the overall burning rate variation was examined. The results showed that the flame area increase plays a dominant role in the burning rate change with relatively weak shocks and expansion waves. In the case of expansion waves, it was also shown that expansion wave-flame interaction may result in a burning rate increase temporarily; the negative chemical kinetic effect of expansion wave passage is offset by the flame area increase.

Wednesday, October 21, 2009, 1:00 pm, AMS Seminar Room 1-122

Ravi Samtaney
Princeton Plasma Physics Laboratory
Princeton University

Title: Overcoming spatial and temporal stiffness in MHD simulations.

Abstract:

Magnetohydrodynamics (MHD) is arguably the most popular mathematical model for the macroscopic simulations of fusion plasmas. In this talk we will focus on the resistive single-fluid MHD equations, the solutions of which can exhibit near-singular layers (or even discontinuities in the absence of diffusion terms). We rely on locally adaptive structured mesh refinement (AMR) methods to mitigate the separation of spatial scales in MHD. We will present results from AMR simulations of MHD applications: (a) pellet injection, a proven method to refuel tokamaks; (b) magnetic reconnection which is a canonical problem in plasma physics involving thin current sheets; and (c) an example in MHD shock refraction where five or more
discontinuities meet at a single point.

For a tokamak fusion plasma, the presence of a large background field and toroidal geometry results in a large separation of temporal scales. Explicit time-stepping methods to simulatfusion plasmas become prohibitively expensive due to the CFL constraint on the time-step. To overcome the temporal stiffness associated with the fast compressive and Alfven waves in MHD, we have developed a nonlinearly implicit time stepping method using a Jacobian-Free Newton-Krylov approach (JFNK) and begun exploring nonlinear multigrid methods. At the heart of our JFNK method is a PDE-operator based preconditioner (exact for a 1D system of hyperbolic PDEs), to effectively solve the resulting large ill-conditioned linear system.

Wednesday, October 28, 2009, 9:30 am, AMS Seminar Room 1-122

Speaker:

Min Zhou
Rensselaer Polytechnic Institute

Title: Petascale Adaptive Computational Fluid Dynamics

Abstract:

In this study, we identify and resolve several bottlenecks facing unstructured, adaptive, implicit finite element methods march toward petascale simulations. With those obstacles resolved, our method demonstrates its capabilities with strong scalability on large scale supercomputers and its ability to solve problems of interest requiring intensive numerical computations in a reasonable time frame. The performance of our implicit solver is improved by two algorithms developed in this work. The first algorithm, multiple compute-object partition improvement, incrementally improves the load balance, hence the scalability of both the equation formation and the equation solution of the finite element analysis (FEA). The second algorithm, data reordering, enables the effective usage of the memory subsystem by increasing the data locality, so as to accelerate the per-core performance of the FEA.

We present excellent strong scaling for several applications performed on various supercomputers including IBM Blue Gene (BG/L and BG/P), Cray (XT3 and XT5) and Sun Constellation Cluster. The applications involve the flow simulations of a bifurcation pipe model with relatively small meshes and cardiovascular flow of an abdominal aorta aneurysm model with a much bigger mesh (more than 1 billion elements). The other application involves the blood flow in a ``whole'' body model composed of 78 arteries; from the neck to the toes. The effectiveness of our methodologies and the algorithms developed in this work are investigated in those applications. With the ability to solve real-world problems having complex geometry/physics in a realistic time, this work provides a reliable and efficient computation tool that can be used by researchers for design and development purpose.

Wednesday, December 2, 2009, 10:30 - 12:00, Math Tower 1-122

Valmor de Almeida, Oak Ridge National Laboratory

Title: Challenges for Modeling and Simulation of Solvent Extraction in
Nuclear Fuel Reprocessing

Abstract:
Solvent extraction is a central process in spent nuclear fuel reprocessing. This talk will describe on-going modeling and simulation work addressing principal length and time scales necessary for developing a predictive computational capability. Description of approaches for modeling plant-level, unit operation, and molecular scales will be discussed and a path forward presented for a modern, scientifically based simulation method. This work is prompted by the US government plan to expand the energy portfolio of the nation including nuclear energy to reduce the use of fossil fuels. The DOE Office of Nuclear Energy has recently announced (http:// www.ne.doe.gov) the Hub for Modeling and Simulation which confirms the interest in the use of simulation tools to expedite the expansion of nuclear energy capabilities.

Friday, February 19, 2010, 1:30 - 2:30 pm, Math Tower 1-122

Dr. Tong Fang
Manager of Adaptive Techniques
Real-Time Vision and Modeling Department
Siemens Corporate Research, Inc.

3D Geometric Modeling for Direct Digital Manufacturing

Direct Digital Manufacturing is one of hot topics in industry. It is a manufacturing process which manifests physical parts directly from 3D data using additive fabrication techniques, also called additive manufacturing, layered manufacturing, or 3D Printing. In this talk, a 3D geometric modeling application for hearing aids digital manufacturing
will be introduced. In addition, some medical applications by using 3D geometric modeling technologies will be talked.

Bio: Dr. Tong Fang, received the Ph.D. degree in the area of image processing from Rutgers University in 2000. He also received his Bachelor degree in E.E. from Hefei University of Technology, China in 1988 and three Master degrees in Management Science (1992), Industrial Engineering (1997), Computer Engineering (1999) from University of Science & Technology of China and Rutgers University, respectively. At Siemens Corporate Research, he currently leads Adaptive Techniques R&D Program, and Real Time Systems and Optimization Competence Group to conduct research and development in the fields of computer vision, industrial and medical image processing, pattern recognition, 3D geometric modeling and visualization. He has 11 US patents and 6 international patents awarded, 40+ papers published and 50+ patents pending.

Friday, March 5, 2010, 1:30 - 2:30pm, Math Tower 1-122
Marc Laforest
Department of Mathematics and Industrial Engineering
École Polytechnique de Montréal

Title : An adaptive version of Glimm's scheme

Abstract :
We describe a local error estimator for Glimm's scheme for hyperbolic systems of conservation laws and use it to replace the usual random choice in Glimm's scheme by an optimal choice. As a by-product of the local error estimator, the procedure provides a global error estimator that is shown numerically to be a very accurate estimate of the error in L^1(\RR) for all times. Although there is partial mathematical evidence for the error estimator proposed, at this stage the error estimator must be considered ad-hoc. Nonetheless, the error estimator is simple to compute, relatively inexpensive, without adjustable parameters and at least as accurate as other existing error estimators. Numerical experiments in 1-D for Burgers' equation and for Euler's system are performed to measure the asymptotic accuracy of the resulting scheme and of the error estimator.

Friday, March 12, 2010, 1:30 - 2:30pm, Math Tower 1-122
Xinfeng Liu
Department of Mathematics
University of South Carolina

Title: Computational studies for spatial dynamics of cell signaling with localized scaffold

Abstract: The specificity of cellular responses to receptor stimulation is encoded by the spatial and temporal dynamics of downstream signaling networks. In many cases, spatially localized scaffold proteins that bind and organize multiple proteins into complexes have merged as essential factors in shaping the quantitative response behavior of a signaling pathway. Through studying various models of scaffold, I will show novel regulations induced by its spatial location and switch-like responses due to scaffold. To efficiently compute the models, I shall introduce a new class of fast numerical algorithms incorporated with adaptive mesh refinement techniques for solving the stiff systems with spatial dynamics in complex domains.

Wednesday, March 17, 2010, 1:00 - 2:00pm, Math Tower 1-122
Jinjie Liu
Department of Mathematical Sciences
Delaware State University

Title: The Overlapping Yee FDTD Method on Nonorthogonal Grids

Abstract: We present an overlapping Yee (OY) method for solving time-domain Maxwell's equations on non-orthogonal grids. The OY method is a direct extension of the Finite-Difference Time-Domain (FDTD) method (Yee's scheme) to irregular grids, and it overcomes the late-time instability of the previous FDTD algorithms on non-orthogonal grids. When material interface is presented, the diagonal split-cell model is applied to achieve better accuracy. Numerical simulations on scattering problem and optical force computation will be presented.

Friday, March 19, 2010, 1:30 - 2:30pm, Math Tower 1-122
Tianshi Lu
Mathematics and Statistics Department
Wichita State University

Title: Theory and Computation of the Grad-Shafranov Equation

Abstract:
In this talk, I will review the theory and computation of the Grad-Shafranov (GSh) equation, which
describes the toroidal magnetohydrodynamic equilibrium. The equation is a poisson-type equation with the
source as unknown functions of the potential. Depending on the physical measurements and models, the
equilibrium condition can also be posed as a nonlinear eigenvalue problem or a free boundary problem.
The GSh equation is often studied in its simpler form in planar geometry. The solution is nonunique in
radially symmetric geometry, while the solution is unique in the presence of a corner. For physically
more relevant smooth domains, the uniqueness of the solution remains an open question. A class of
analytical solution to the GSh equation known as Soloviev solutions can be used as benchmark tests for
proposed numerical solvers.

On the computation side, the most popular method to solve the GSh equation is to iteratively adjusting a
few parameters characterizing the toridal current density profile. For a given profile, the GSh equation
can be solved by direct or Newton-type iteration. The use of advancing flux coordinates can improve the
accuracy of the solution. A boundary integral equation approach based on Green's functions for polynomial
sources was recently introduced. A "front tracking" method for the solution of the GSh equation will be
proposed in the talk. An alternative method using flux coordinates will also be described. The data from
motional Stark effect (MSE) measurement, which will be part of ITER diagnostics, will significantly change
the reconstruction process of the current density profile. Its effect will be discussed too.

Friday, March 26, 2010, 1:30 - 2:30pm, Math Tower 1-122
Jian Du
Mathematics Department
University of Utah

Title: computational method for simulating two-phase gel dynamics

In this talk, I will present a parallel computational algorithm for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of transport equations for the two phases, two coupled momentum equations, and a volume-averaged incompressibility constraint. Multigrid with Vanka-type box relaxation scheme is used as preconditioner for the Krylov subspace solver (GMRES) to solve the momentum and incompressibility equations. Through numerical experiments of a model problem, the efficiency, robustness and scalability of the algorithm are illustrated.

Wednesday, September 8, 2010, 1:00 pm, AMS Seminar Room (Math Tower 1-122A)

Title: Sensitivity Analysis, Uncertainty Quantification and Multiscale Modeling of Complex Systems

Dr. Guang Lin
Pacific Northwest National Laboratory

Abstract

Experience suggests that uncertainties often play an important role in quantifying the performance of complex systems. Uncertainty-based optimization, in particular, allows for optimizing a large set of objectives that may be varying in time as the mission requirements of a specific design may be changing in time. Therefore, uncertainty needs to be treated as a core element in modeling, simulation and optimization of complex systems. In this talk, a new formulation for quantifying uncertainty in the context of aerodynamic problem will be discussed with extensions to other fields of mechanics and to dynamical systems. An integrated simulation framework will be presented that quantifies both numerical and modeling errors in an effort to establish "error bars" in CFD. In particular, a review of high-order methods (Spectral Elements, Discontinuous Galerkin, and WENO) will be presented for deterministic flow problems. Subsequently, stochastic formulations based on Galerkin and collocation versions of the generalized Polynomial Chaos (gPC), and some stochastic sensitivity analysis techniques will be discussed in some detail. Several specific examples on stochastic piston problem, lift enhancement due to random roughness and stochastic modeling of ion- electron two-fluid plasma flow will be presented to illustrate the main idea of our approach.

In the catalytic reactor applications there is often a need to model accurately multiscale reactive transport across several orders of magnitude in space and time scales. Multiple scale model in both time and space can overcome this difficulty and provide a unified description of reactive transport in catalytic reactor from nanoscale to larger scales. We propose a new multiscale formalism based upon hybrid model, which combines kinetic Monte Carlo (KMC) with continuum model. Thermal diffusion and mass transport of different species are solved in the continuum model. A non-iterative coupling of different- scale models will be presented, which makes it more efficient than most of existing hybrids and amenable to applications to the complex problems. A simple one-dimensional example will be demonstrated.

Thursday, September 23, 2010, 12:00 pm, Math Tower Room S-240

Dr. Xiaoye Li
Lawrence Berkeley National Laboratory

TITLE:
Factorization-based Sparse Solvers and Preconditioners

ABSTRACT:

Efficient solution of large-scale, ill-conditioned and highly-indefinite
algebraic equations often relies on high quality preconditioners together
with iterative solvers. Because of their robustness, factorization-based
algorithms often play a significant role in developing scalable solvers.

We present our recent work of using state-of-the-art sparse factorization
techniques to build domain-decomposition type direct/iterative hybrid
solvers and efficient incomplete factorization preconditioners.
In addition to algorithmic principles, we also address many practical
aspects that need to be taken under consideration in order to deliver
high speed and robustness to the users of today's sophisticated
high performance computers.

Wednesday, Oct. 13, 2010, 1:30 pm, AMS Seminar room 1-122A

Dr. Shengtai Li, Los Alamos National Laboratory

Title: "Higher-Order Divergence-free methods for MHD flows on overlapping
grid".

Abstract:
Magnetic fields have an intrinsic divergence-free property. It is
essential to preserve this property in numerical simulations for
magneto-hydrodynamics (MHD) simulations. However, it is difficult to
achieve higher than second-order accuracy for conventional divergence-free
finite-volume methods. In this talk I will present a higher-order (>=3)
divergence-free method for MHD flows on overlapping grid. Our method uses
the central scheme on an overlapping grid. It uses the solutions on a dual
mesh, whose vertices consist of the centroids of the primal mesh. By
solving the solutions on the dual/primal mesh simultaneously, we derive a
divergence-free numerical method for MHD of any high order. We also use
the dual-mesh information to develop a more compact scheme that has better
resolution and accuracy than using only the primal mesh. If there is
enough time, I will also present an efficient method to preserve the
divergence-free condition on an adaptive mesh refinement grid.

Wednesday, Oct. 27, 2010, 1:00 pm, AMS Seminar room 1-122A

Title: Phase-field models for multiphase complex fluids: modeling, numerical analysis and simulations

Speaker: Jie Shen, Purdue University

Abstract.

I shall present an energetic variational phase field model for
multiphase incompressible flows which leads to a set of coupled
nonlinear system consisting a phase equation and the Navier-Stokes
equations. We shall pay particular attention to situations with large
density ratios as they lead to formidable challenges in both analysis
and simulation.

I shall present efficient and accurate numerical schemes for solving
this coupled nonlinear system, in many case prove that they are energy
stable, and show ample numerical results (air bubble rising in
water, Newtonian bubble rising in a polymeric fluid, etc.) which not only
demonstrate the effectiveness of the numerical schemes, but also validate the
flexibility and robustness of the phase-field model.

Wednesday, Dec. 1, 2010, 1:00 pm, AMS Seminar room 1-122A

Dr. John Grove, Los Alamos National Laboratory

Title: So You think you think you want to use a "real" equation of state

Abstract:
We discuss the algorithmic, numerical, and practical considerations
needed to use general equations of state (EOS) in a hydrodynamic code.
Such models raise a host of issues that must be addressed in a useful
code. These include the implementation of the EOS’s (e.g. analytic
verses tabular), how material stiffness will affect the hydro solver,
what happens when a material leaves the domain of its EOS, and how
mixtures of materials can be treated.

Tuesday, February 1, 2011, 1:00 pm, AMS Seminar Room 1-122A

Title: The FLASH Code Architecture and Abstractions

Dr. Anshu Dubey, Flash Center at University of Chicago

FLASH is a publicly available high performance application code that has evolved into a modular, extensible software system from a collection of unconnected legacy codes. The current version, FLASH 3, consists of interoperable modules that can be combined to generate dierent applications. The FLASH architecture allows many multiple alternative implementations of its components to co-exist and interchange with each other, resulting in greater flexibility. Further, a simple and elegant mechanism exists for customization of code functionality without the need to modify the core implementation of the source. A built-in unit test framework providing veriability, combined with a rigorous software maintenance process, allow the code to operate simultaneously in the dual mode of production and development.

This presentation will give an overall view of the code architecture and capabilities, and the abstractions that enable the extensibility. In addition, there will be a discussion of the interaction between the infrastructure and the solvers, highlighting the challenges of running on leadership class machines.

Computational Biology

Friday, March 27, 2pm, AMS Seminar Room, Math Tower 1-122
Title: Understanding Embryonic Robustness: Quantitative Experiments and Theory
Alexander Spirov, Adjunct Associate Professor
Department of Applied Mathematics and Statistics
Center for Developmental Genetics
Stony Brook University

The primary aim of our research is to understand how gene regulation generates precise spatial patterns in embryonic development. However, the chemical reactions and transport processes underlying pattern formation are subject to numerous sources of variability and noise. Extrinsic sources include variability in temperature, size and maternally-supplied factors. Intrinsic noise arises from the low concentrations of many biological molecules and the random aspects of cell shape, orientation and movement. For development to reliably form complex body plans, gene network dynamics must be robust to these disruptive influences. We use one of the genetically best characterized model systems for embryonic patterning, anterior-posterior (AP) segmentation in Drosophila. We combine quantified data acquisition, statistical extraction of trends and noise components, and stochastic and evolutionary modeling of gene networks. Such an integrated approach is required to properly characterize the different aspects of developmental noise (within an embryo, e.g. nucleus-to-nucleus) and variability (embryo-to-embryo), and to understand how these are controlled. Our long-term goal is to provide a mathematically quantified understanding of the interactions which give the robust spatial patterning underlying the development of complex body plans. Studying how networks maintain robustness, and how they lose it, should have direct bearing on heritable human diseases, particularly birth defects, which display variable outcome.

Monday, April 13, 2009 10:30 AM, AMS Seminar Room, Math Tower 1-122
Title: Using Novel X-Ray Crystallographic Methods to Identify Side Chain Polymorphism in Protein-Ligand Interactions: Applications to Calmodulin Peptide Binding Specificity

P. Therese Lang
University of California, Berkeley
Department of Molecular & Cell Biology

Although proteins populate ensembles of structures in solution, X-ray diffraction data are traditionally interpreted using a single dominant model. To detect ensembles of side chain motions in x-ray electron density, we developed a new computational method called Ringer. Using this approach, we have identified structural fluctuations in protein active sites and explored their effects on the biophysical properties of ligand binding. Using experimental density, Ringer identified unmodeled alternate rotamers in 5-15% of side chains, supporting the idea that the newly detected conformations are widespread. With this new method, we are exploring X-ray structures of calmodulin (CaM), a calcium signaling protein that recognizes approximately 200 different peptide sequences, to test the idea that free receptors contain structural fluctuations required for bound conformations. We have identified several, previously unmodeled alternate side chain conformations in the active site of apo-CaM structure necessary for diverse binding. We have also seen a correlation with NMR experiments that detect changes in side chain rotamers.  The identified alternate conformations support predictions about which residues within the binding site can influence recognition selectively by modulating the ensemble of side motions.  These studies have the potential to provide new tools to explore the underpinnings of ligand specificity in CaM and other systems.

Operations Research

Thursday, March 19, 2009, 11:30am,  AMS Seminar Room, Math Tower 1-122
ACCURACY CERTIFICATES FOR COMPUTATIONAL PROBLEMS WITH CONVEX STRUCTURE
Uriel G. Rothblum
Technion, Haifa, Israel

This talk introduces the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems include minimizing convex functions, variational inequalities with monotone operators, computing saddle points of convex-concave functions and solving convex Nash equilibrium problems. We demonstrate how the implementation of the Ellipsoid method and other cutting plane algorithms can be augmented with the computation of such certificates without essential increase of the computational effort. Further, we show that (computable) certificates exist whenever an algorithm is {capable} to produce solutions of guaranteed accuracy. This talk is based on a joint paper with Arkadi Nemirovsk and Shmuel Onn

Monday, March 23, 2009, 4:00pm,  AMS Seminar Room, Math Tower 1-122
Production Systems Engineering: Main Problems, Solutions, and Applications
S.M. Meerkov
Department of Electrical Engineering and Computer Science
University of Michigan
Ann Arbor, MI

Production Systems Engineering (PSE) is an emerging branch of Engineering intended to uncover fundamental principles that govern production systems and utilize them for the purposes of analysis, continuous improvement, and design. In PSE, the machines are assumed to be unreliable and the buffers are finite. Under these assumptions, production lines are nonlinear stochastic systems. The study of their statics and dynamics is the goal of PSE.

In this talk, the main problems of PSE and their solutions will be described along with a few applications. In addition, the so-called PSE Toolbox, which implements the methods and algorithms developed, will be discussed.

The main results of PSE are summarized in a recent textbook: J. Li and S.M. Meerkov, Production Systems Engineering, Springer 2009. More information on the textbook and a demo of the toolbox can be found at http://www.ProductionSystemsEngineering.com/

Tuesday, May 5, 2009, 11:00 am, AMS Seminar Room, Math Tower 1-122

Evdokia Nikolova
MIT
Stochastic Shortest Paths

How do we get to the airport on time? Ideally we would like to take the shortest path, however in the presence of uncertain traffic what does that mean? Is that the path with smallest expected travel time, or should we minimize the path variance or some other metric? One natural objective is to choose the path which maximizes our probability of arriving on time. This turns out to be equivalent to a non-convex optimization problem, for which no efficient algorithms are available. We develop algorithms that bridge stochastic, nonconvex and combinatorial optimization. In fact, our algorithms extend to solve a much more general framework of stochastic optimization that incorporates risk, beyond shortest paths.

In an alternative route planning model, we seek adaptive algorithms which tell us where to go at every node along the way, given the realized edge values so far and the edges adjacent to our current position. This problem, called the Canadian traveler problem, turns out very challenging even with simple linear objectives which aim to minimize the expected route length. We provide the optimal policies (adaptive algorithms) for a class of graphs based on Markov Decision Processes and conclude with intriguing open problems.

Monday, November 23, 2009, 1:00-2:00, Math Tower 1-122

Mark Kelbert
Department of Mathematics, Swansea University, UK

Abstract. The `bird eye's' view of actuarial ruin problem is captured by the so-called Cramer-Lundberg model which represents the current capital as a difference of incoming payments and the outgoing claims. The simplest model for the claim flow is the compound Poisson process. We are interested in an asymptotic expansion of the ruin probability on a big time interval when the initial capital tends to infinity and the ratio of the capital and the time tends to a constant.The results of standard saddle-point approximation fails on the Stokes lines. However, some refinements of this method provides uniform asymptotic expansions.

This seminar is partially supported by the Grad School.

Thursday, April 8th, 2010, 11:00 - 12:00 pm, AMS Seminar Room (Math Tower 1-122A)

Mark E. Levis
Cornell University
School of Operations Research and Information Engineering


Title: Dynamic Control of a Service Center with Abandonments


In this talk we study the dynamic control of a single server that must meet the service requirements of two parallel queues. Customers arrive to each queue according to independent Poisson processes. Each customer either waits until the service is completed, or their (independent and exponential) patience runs out. The service requirements of customers are exponential and the service rate of the server is fixed and known. 
Two cost/reward models are considered. In the first, customers are differentiated by their holding cost rate and the penalty charged for customer abandonment. In the second model a reward is received for service of each customer class. The challenges include the fact that none of the traditional methods (interchange arguments, uniformization) easily extend. This talk will explain these challenges, how they are addressed and where the optimal policy defies intuition.


Monday, May 3, 2010, 10:00-11:00 am, AMS Seminar Room (Math Tower 1-122A)

Optimality of Trunk Reservation for an M/M/k/N Queue with Several Customer Types and Holding Costs


Fenghsu Yang
Department of Applied Mathematics and Statistics
Stony Brook University


We study optimal admission to an M/M/k/N queue with several customer types. The reward structure consists of revenues collected from admitted customers and holding costs, both of which depend on customer types. The goal is to find an admission policy that maximizes average rewards per unit time. This paper describes the structures of optimal, canonical, bias optimal, and Blackwell optimal policies. Under natural conditions, there exists an optimal trunk reservation policy. In addition, any stationary optimal policy is either a trunk reservation policy or can be transformed easily to a trunk reservation policy. Similar to the case without holding costs, bias optimal and Blackwell optimal policies are unique, coincide, and are defined by the largest optimal control levels for each customer type. Problems with one holding cost rate for all customers have been studied previously in the literature.
The talk is based on a joint paper with Eugene Feinberg

Wednesday, May 5, 2010, 11:30-12:30 pm, Computer Science 1211


Sensor Localization Using Data Correlation and the Occam's Razor Principle
Alon Efrat
University of Arizona


Abstract:
We present an algorithm for computing a combined solution to two problems in sensor networks: (1) clustering the sensors into groups, each meaningfully related, and (2) solving the localization problem of determining position estimates (in global coordinates) for each sensor. We assume that initially only a rough approximation of the set of sensor positions is known. Our algorithm applies the ``Occam's razor principle'' by computing a ``simplest'' explanation (in a precise sense, defined below) for the measurement data collected by the sensors. We present both a centralized and a distributed algorithm for this problem, as well as efficient heuristics.


Friday, May 7, 2010, 2:45-3:45 pm, AMS Seminar Room (Math Tower 1-122A)


Stochastic analysis of the trading rule "Buy and Hold"


Albert N.Shiryaev
Steklov Mathematics Institute and Moscow State University
Moscow, Russia


We consider several variants of the nonstandard problems of finding optimal time of selling stock trying, for example, to maximize expectation of the ratio S(T)/max S(t),where T is a stopping time with values from trading time interval (0,1) and max is taken on t from this interval. Different assumptions about stock processes and different formulations of optimization problems will be presented.

Wednesday, December 22, 10:30-12:00, Math Tower 1-122

Konstantin Avrachenkov, INRIA - Sophia Antipolis, France

Title: Monte Carlo Methods for Top-k Personalized PageRank Lists with
Application to Name Disambiguation

Abstract:
We study a problem of quick detection of top-k Personalized PageRank
lists. This problem has a number of important applications
such as finding local cuts in large graphs, estimation of similarity
distance and name disambiguation. In particular, we apply our results
to construct efficient algorithms for the person name disambiguation
problem. We argue that when finding top-k Personalized PageRank
lists two observations are important. Firstly, it is crucial that we
detect fast the top-k most important neighbors of a node, while the exact
order in the top-k list as well as the exact values of PageRank are by
far not so crucial. Secondly, a little number of wrong elements in
top-k lists do not really degrade the quality of top-k lists, but it can
lead to significant computational saving. Based on these two key
observations we propose Monte Carlo methods for fast detection of top-k
Personalized PageRank lists. We provide performance
evaluation of the proposed methods and supply stopping criteria.

Tuesday, October 19, 2010, 2:30 pm, AMS Seminar Room 1-122A

Speaker: Yuri Suhov
Statistical Laboratory, Faculty of Mathematics, University of Cambridge, UK

Title: Service systems with limited selection of location

Abstract: In a standard single-server queueing system
an arriving task and a (conservative) server do not have
a choice: every task joins the same queue and will be
served in accordance with the queueing discipline. Many
modern systems give a possibility of a choice: an arriving
task can select a shorter queue while servers may be
preferentially allocated to queues that are longer, or vice versa.
An interesting situation arises when the choice is limited,
e.g., an arriving task selects randomly two queues out of N
and joins the shorter while a server selects two queues
at random and serves the longer, or, again vice versa.
As N becomes large (and the arrival rates are properly
re-scaled), the situation simplifies and admits some
exact (and surprising) solutions, first shown by
Dobrushin--Karpelevich--Vvedenskaya (1996).

In the talk I'll give a review and report some new results
in this direction.

Quantitative Finance

February 19, 2009, 4:00pm, AMS Seminar Room
Title: Quantitative Challenges in Algorithmic Execution
Professor Robert Almgren of NYU Courant Institute

Thursday, March 19, 2009, 4pm, AMS Seminar Room, Math 1-122
Title: Challenges in Pricing Mortgage Backed Securities
Dr. Ying Chen, Former JP Morgan Analyst

After a brief review of the development of US mortgage market, a widely-used Mortgage Backed Securities (MBS) pricing procedure, consisting of Option Adjusted Spread (OAS) analysis and prepayment modeling, is introduced. Then we discuss some challenges in pricing MBS, including evaluation of prepayment risk, interest rate modeling, and analysis of loans with different characteristics. In the end, several key factors causing the current subprime mortgage credit crisis are examined and recommendations are provided to improve the pricing models for MBS.

Tuesday, April 21, 2009 4:00pm, AMS Seminar Room, Math Tower 1-122
Title: Option Pricing Under a Stressed-Beta Model
Adam Tashman, UC-Santa Barbara Department of Statistics and Applied Probability

The Capital Asset Pricing Model (CAPM) was a fundamental contribution to the field of financial economics, relating the sensitivity of an asset's return to the stock market return. This sensitivity (or slope), referred to as beta, is ubiquitous in modern finance. An assumption of CAPM is that there is a linear relationship between asset returns and market returns, but this does not always hold in practice.

We consider a continuous-time CAPM model where beta is not constant, but rather is piecewise constant. This allows us to introduce regime-switching dynamics while keeping things tractable. When the market level crosses below a given threshold, an additive term increases the slope, resulting in a higher sensitivity of asset returns to market returns. We develop the price of an equity option using this approach. Along the way, several interesting quantities appear, such as the occupation time of a Brownian motion in an interval, and Brownian local time.

One of the future goals of this research will be to introduce a calibration technique for the slope in each regime based on estimated option price parameters of both the asset and the market index.

Monday, May 4, 2009, 1:00pm, AMS Seminar Room, Math Tower 1-122
Title: Market Crashes and Modeling Volatile
Professor Svetlozar Rachev
School of Economics and Business Engineering
University of Karlsruhe, Germany

Monday, June 8, 2009, 11:30am, AMS Seminar room, Math Tower 1-122

American Options: Free-Boundary-Value Problems in Finance

Qiang Zhang
Department of Mathematics
City University of Hong Kong

A vanilla option is a right to buy or sell an underlying security at a fixed price. Exotic options have more complicated payoff structures and depend on more state variables. It is well known that, in a simple setting, the prices of European options that can only be exercised on the maturity date are given by the Black-Scholes formulae. However, most of options traded in the market are American type that can be exercised any time before and on the maturity date. So far, except in a few special cases, no close-form expressions for American options have been found and numerical computation is the main method for pricing American options. The difficulty is due to the fact that the American options are free-boundary-value problems, namely at what critical price of the underlying one should exercise the options? In this talk we will discuss the theoretical properties of American options and analytical approximations for the solutions of American options and the free boundaries. We show that this approximation method is applicable to both American type vanilla and exotic options. We will also discuss free-boundary-value problems in other types of financial products.

Wednesday, September 9, 2009, 2009, 3:50 pm, AMS Seminar Room, Math Tower 1-122

David Cru
Ph.D. Candidate SUNY Stony Brook
Asst. Vice President, Ivy Asset Management
"Dynamic Hedge Fund Asset Allocation Under Multiple Regimes"

Abstract: Portfolio Selection as introduced by Harry Markowitz laid the foundation for Modern Portfolio Theory. However, the assumption that underlying asset returns follow a normal distribution and that investors are indifferent to skew and kurtosis are not practically suited for the hedge fund environment. Additionally, the Lockup and Notice provisions built into hedge fund contracts make portfolio rebalancing difficult and justify the need for dynamic allocation strategies. Market conditions are dynamic therefore rebalancing constraints in the face of changing market environments can have a severe impact on return generation. There is a need for sophisticated yet tractable solutions to the multi-period problem of hedge fund portfolio construction and rebalancing. We Generalize the hedge fund asset return distribution to a Multivariate K-mean Gaussian Mixture Distribution; cast the multi-period hedge fund allocation problem as a constrained optimization problem; and propose practical rebalancing strategies that represent a convergence of literature on Hedge Fund investing, Regime Switching and Dynamic Portfolio Optimization

Wednesday, September 16, 2009, 3:50PM to 5PM, AMS Seminar Room, Math Tower 1-122

Andrew P. Mullhaupt, Ph.D.
Topic: TBA

Dr. Mullhapt recently retired as Director of Research and Portfolio Manager at SAC Meridien Fund, a systematic hedge fund. Dr. Mullhaupt has worked at Renaissance Technologies as a Senior Research Analyst and at Morgan Stanley. He has held various academic posts at SUNY Buffalo, the University of New Mexico and the Courant Institute. Dr. Mullhaupt received his Ph.D. in Applied Mathematics from the Courant Institute and his B.S. from Stevens Institute of Technology.

Wednesday, September 30, 2009, 3:50 - 5:10 pm, Math Common Room 4-125

Speaker: Michael Driscoll, Ph.D.

Title: Challenges in Assessing Credit Risk in Today's Financial Crisis

Abstract:

In the current environment, the financial services industry and its regulators are concerned about exposure to credit risk. The distribution of financial losses due to changes in the credit quality of a counterparty to a financial agreement.

Credit risk pervades virtually all financial transactions. The rise in the complexity and globalization of financial services has contributed to stronger linkages between counterparties. While higher connectivity facilitates economic growth through credit allocation and risk diversification, it also increases the potential for disruptions to spread throughout the system. Financial engineering further enabled risk transfers that were not fully accounted for by regulators or by the institutions themselves, thereby complicating the assessment of counterparty risk, risk management, and policy responses. The current crisis highlights how systemic linkages can arise not just from financial institutions’ solvency concerns but also from the lack of market liquidity and other stress events.

At the center of the issue is the quantification of the probability of a default; an event resulting from a complex decision process. This process is affected by the intricate network of business relations between firms, and in turn, the default decision of a single firm affects the entire system. Corporate defaults aggregate and is induced by the correlation among firms. It is driven by individual firm sensitivity to common economic factors such as interest rates or inflation, but also from the feedback of an individual firm event to the entire system.
The assessment of credit risk for trading strategies in credit and across markets, its risk management and policy development encompass a broad set of topics, e.g.

-Forecasting of individual defaults,
-Valuation of credit sensitive securities and quantification of credit risk on portfolios of securities,
-Simulation of dependent default events and losses, and
-Statistical validation of models.

All facets of credit risk assessment face a wide range of challenges ranging from the availability of historical events to measure and calibrate models to the transparency of risk within the system and the uncertainty of available information.

Michael Driscoll is a Managing Director at Cogent Partners, specializing in capital markets and risk management advisory services in Private Equity and Alternative Investments. Dr. Driscoll has been a Principal and Global Head of Risk Management for Allianz (ART Group) and a member of their Underwriting, Risk and Investment Management Committees. He began his career in the research division of AT&T Bell Laboratories and received his Ph.D, M.S. and B.S. degrees from SUNY Stony Brook where he was elected to Sigma Xi and Tau Beta Pi. Dr. Driscoll also serves a member of the Stony Brook Center for Quantitative Finance Advisory Board.

Wednesday, October 7, 2009, 3:50pm - 5:10PM , AMS Seminar room 1-122

Speaker: Michael Driscoll, Ph.D.

Title: Challenges in Assessing Credit Risk in Today's Financial Crisis

Abstract:

In the current environment, the financial services industry and its regulators are concerned about exposure to credit risk. The distribution of financial losses due to changes in the credit quality of a counterparty to a financial agreement.

Credit risk pervades virtually all financial transactions. The rise in the complexity and globalization of financial services has contributed to stronger linkages between counterparties. While higher connectivity facilitates economic growth through credit allocation and risk diversification, it also increases the potential for disruptions to spread throughout the system. Financial engineering further enabled risk transfers that were not fully accounted for by regulators or by the institutions themselves, thereby complicating the assessment of counterparty risk, risk management, and policy responses. The current crisis highlights how systemic linkages can arise not just from financial institutions’ solvency concerns but also from the lack of market liquidity and other stress events.

At the center of the issue is the quantification of the probability of a default; an event resulting from a complex decision process. This process is affected by the intricate network of business relations between firms, and in turn, the default decision of a single firm affects the entire system. Corporate defaults aggregate and is induced by the correlation among firms. It is driven by individual firm sensitivity to common economic factors such as interest rates or inflation, but also from the feedback of an individual firm event to the entire system.
The assessment of credit risk for trading strategies in credit and across markets, its risk management and policy development encompass a broad set of topics, e.g.

All facets of credit risk assessment face a wide range of challenges ranging from the availability of historical events to measure and calibrate models to the transparency of risk within the system and the uncertainty of available information.

Michael Driscoll is a Managing Director at Cogent Partners, specializing in capital markets and risk management advisory services in Private Equity and Alternative Investments. Dr. Driscoll has been a Principal and Global Head of Risk Management for Allianz (ART Group) and a member of their Underwriting, Risk and Investment Management Committees. He began his career in the research division of AT&T Bell Laboratories and received his Ph.D, M.S. and B.S. degrees from SUNY Stony Brook where he was elected to Sigma Xi and Tau Beta Pi. Dr. Driscoll also serves a member of the Stony Brook Center for Quantitative Finance Advisory Board.

Wednesday, October 14, 2009, 3:50PM - 5:10PM, AMS Seminar room, Math Tower 1-122

Speaker: Greg Van Inwegen, Ph.D.

Title: "Risk Management in a Non Transparent and Non Linear World: Perspectives and Challenges from a Fund of Hedge Funds"

Abstract:

Multi-Factor Risk Modeling & Stress Testing
Simulations based on Sector Exposures, Yield Curve Sensitivities and Greeks
Volatility Regime Shift Modeling
Measuring and Adjusting for Illiquidity
Non-Normal Risk Budgeting 

Dr. Van Inwegen is a Managing Director and Chief Investment Risk Officer at Ivy Asset Management, where he has worked since 2004. He chairs the Investment Risk Management Committee at Ivy and leads the Risk Management and Quantitative Research team at this Hedge Fund of Funds. His professional career started at Syracuse University, where he taught Finance as an Assistant Professor before moving to Wall St. He has worked at Verizon, Paine Webber, Bankers Trust, Deutsche Bank, and a hedge fund start up. In addition to risk management, he as been involved in a number of elements of the asset management business, including stock selection models, asset allocation, enhanced indexing and high frequency statistical arbitrage models. Dr. Van Inwegen has degrees from the University of California at Berkeley, the Sloan School at MIT; and the Wharton School at the University of Pennsylvania.

Wednesday, October 28, 2009, 3:50PM - 5:10PM, Physics Tower S-240

Speaker: Ann Tucker, Ph.D.

Title: Momentum and the Financial Crisis

Abstract:

The momentum factor is a well documented market anomaly that continues to exhibit strength well after it was first documented in the academic literature. There is evidence that momentum exposure, or long exposure to assets with good recent performance and short exposure to assets with poor recent performance, is especially widespread within the hedge fund community. The extent of the exposure became painfully clear during the second half of 2008 when Lehman’s bankruptcy triggered a global unwinding of risk in almost every asset class. This talk explores the contribution of momentum-related strategies in equities, commodities, interest rates and foreign exchange to the buildup of risk in the global financial system and the chaos that ensued when the great reversal occurred. In addition, the roles played by the U.S. dollar and the Japanese yen as carry currencies of choice during this period are examined in the context of the momentum environment, possible intervention of the Chinese in the currency markets, and the unwinding of the aforementioned carry trades.

Tuesday, March 23, 2010, 2:30 pm, AMS Seminar Room 1-122

Eugene Stern
Research Group, RiskMetrics

Title: Risk Management and Real Life

Abstract:
Challenges of managing market and credit risk inside a large organization. We will analyze some simple trades and hedges, and discuss which risks are hedged and which remain, how to model the risk, and how to incorporate the analysis into a firm-wide risk model. We’ll explore which risks can be modeled statistically, and which can’t – and how to measure and manage both kinds.

Monday, April 19, 2010, 2:15pm, AMS Seminar Room 1-122

Prof. Dr.Sci. Svetlozar Rachev
Title: Operational Risk Assessment
Advanced Statistical Methodology and its Practical Implementation

Abstract:
The main topics of this talk include:
a. Compound Cox process models for operational losses;
b. Fitting loss distributions to truncated and full operational loss data;
c. Fitting non-homogeneous Poisson process models to operational frequency data;
d. Applications of heavy-tailed -stable distributions to loss data;
e. Estimation of the dependence (copula) structure of losses from various business lines and event-types;
f. Forecasting of one-period ahead Value-at-Risk and Expected Tail Loss for (i) every individual business-line, event-type, and for (ii) the total operational loss from all business-lines and event types;
g. In-sample goodness-of-fit tests (such as Kolmogorov-Smirnoff, Kuiper, Anderson-Darling, Cramer-von Mises);
h. Backtesting;
i. Robust modeling techniques and comparative analysis with classical
models.

Wednesday, September 15, 2010, 3:00 pm, AMS Seminar Room 1-122A
 
Speaker:  Robert Almgren
 
Title:  Algorithmic Trading for Interest Rate Futures

Abstract:  Interest rate futures markets present several novel microstructural features, not found in equities and foreign exchange markets. For algorithmic trading, these features must be fully understood and properly exploited. Three features are the most important. First is pro rata order matching, which has strong effects on the optimal order placement strategy. Second is implied quoting via calendar spread and butterfly contracts, which presents opportunities to find hidden liquidity and better order fills. Third is the highly coupled nature of contracts at different points on the yield curve, requiring an inherently multidimensional analysis even to trade a single contract. We shall provide an overview of all these aspects, and the quantitative tools that are used to model them.

Speaker Bio:  Robert Almgren, co-founder of Quantitative Brokers, providing agency algorithmic execution and cost measurement in fixed income markets. Until 2008, Dr Almgren was a Managing Director and Head of Quantitative Strategies in the Electronic Trading Services group of Banc of America Securities. From 2000-2005, he was a tenured Associate Professor of Mathematics and Computer Science at the University of Toronto, and Director of its Master of Mathematical Finance program. Before that, he was an Assistant Professor of Mathematics at the University of Chicago and Associate Director of the Program on Financial Mathematics; he is currently a Fellow in the Mathematics in Finance Program at New York University. Dr. Almgren holds a B.S. in Physics and Mathematics from the Massachusetts Institute of Technology, an M.S. in Applied Mathematics from Harvard University and a Ph.D. in Applied and Computational Mathematics from Princeton University. He has an extensive research record in applied mathematics, including several papers on optimal securities trading, transaction cost measurement, and portfolio formation.

Wednesday, Sept 29, 2010, 3:00pm, AMS Seminar Room 1-122

Speaker:  Greg Frank

Title:  "Using Database Systems for Tick Data Mining"

Abstract:  As high frequency traders of instruments in various asset classes, we are faced with the challenge of analyzing the characteristics of vast quantities of data.  Tools like Matlab and Quantlib are great for quickly investigating high order relationships in financial data.  But how does one approach analysis when data sets run into terabytes?  And what about when the data is streaming in real-time? 

In this talk, we'll take a practical look at how common relational database systems and commercial business intelligence platforms can be used for analyzing tick data.  We'll take a look at how various estimation and classification techniques like Logistic Regression or ARIMA can be deployed - and their relative performances compared - with common database tools. 

In some asset classes, such as spot FX, getting the data itself into a form that can be analyzed with traditional techniques poses a challenge.  Price updates are irregularly spaced in time, there are data drop-outs and spurious "zero" prices, and because FX is traded between banks rather than on an exchange, there is no centrally authoritative source for reporting what the "correct" numbers are.  Yet the mathematical techniques we use usually only work correctly on regularly spaced, clean, accurate input data.  We'll look at some lessons learned for basic data conditioning, which we view as an important step to real-world financial data analysis.

About the speaker:  Greg Frank is a founding partner of Presagium, a proprietary trading firm. Previously, he was managing partner of Ovation Capital, a venture capital firm investing in software companies.  He is chairman of Connectiva Systems, a 400-person company providing revenue assurance and fraud management solutions to telecommunications companies globally.  He has held senior positions at Microsoft in Redmond, WA, and at Murray & Roberts.  Greg has an MBA from Harvard Business School and a degree in electronic engineering from the University of Cape Town, South Africa. He is a recreational glider pilot and distance runner, and lives in Manhattan with his wife and two sons.

Monday, May 7, 2012, 2:00 - 3:00PM, Math Tower, Seminar Room 1-122

Speaker: Domenico Mignacca
Risk Management Director, Eurizon Capital SGR

Title: Risk Attribution, Risk Budgeting and portfolio expected return

Abstract:
After a review of factor models, we concentrate our attention on risk attribution and risk budgeting. We will stress the importance of implied return and risk attribution and present an example of risk attribution from a management point of view.

Statistics

Wednesday, April 25, 2012, 1:15 PM - 2:15 PM, Mathematics Tower, Room S-240

Title: Mapping the regulatory network of the genotype-phenotype map

Speaker: Rongling Wu, Professor of Biostatistics, Bioinformatics, Statistics, and Biology
Director, Center for Statistical Genetics, The Pennsylvania State University

Abstract:
Genetic mapping has been instrumental for identifying specific quantitative trait loci (QTLs) that control complex traits in different organisms. Traditional approaches for genetic mapping assume a direct relationship between genotype and phenotype, ignoring a network of biochemical and developmental pathways involved in a process from DNA to a high-order phenotype. We present a new conceptual framework of QTL mapping by integrating regulatory networks of trait formation. This framework, named network mapping, treats trait formation as a dynamic system in which transcriptional, proteomic, metabolomic and developmental components coordinate and interact through a cascade of biochemical pathways. Network mapping models and quantifies a complex web of biochemical interactions using a system of differential equations (DE). By estimating the pattern of how mathematical parameters of DE change jointly or individually in time and space, the dynamic behavior and outcome of the system can be predicted by genetic and other information. Network mapping pinpoints a new research direction of genetic mapping by integrating it with systems biology.

Wednesday, August 17th, 2011, Time 11:30am - 12:30pm, Location: AMS Seminar Room, Math Tower 1-122

Speaker:  Dr. Qiang Zhang
Department of Mathematics, City University of Hong Kong

Title:  An Investment Strategy for both Good and Bad Economic Times

Abstract:

The well-known Merton strategy is a power-utility-maximization
strategy. Although this strategy performs better than several other
strategies, the strategy is optimal only in the sense of ensemble
averaging. However, in reality, only one random path will be realized and
the value of the portfolio at the end of the investment horizon could be
dramatically lower than its historical high. This is evident in the recent
financial crisis. We will present a new strategy to overcome this problem.
This new strategy performs well in both good and bad economic times

Tuesday August 9th, 2011, Time from 11:30pm -12:30pm, Location: AMS 1-122

Speaker: Juanjuan Fan
Department of Mathematics and Statistics
San Diego State University

Title: Trees and Random Forests for Correlated Survival Data

Abstract:

We are interested in developing rules for assignment of tooth prognosis
based on actual tooth loss in the VA Dental Longitudinal Study. It is
also of interest to rank the relative importance of various clinical
factors for tooth loss. A multivariate survival tree procedure is
proposed. The procedure is built on a parametric exponential frailty
model, which leads to greater computational efficiency. We adopted the
goodness-of-split pruning algorithm of LeBlanc and Crowley (1993)
to determine the best tree size. In addition, the variable importance
method is extended to trees grown by goodness-of-fit using an algorithm
similar to the random forest procedure in Breiman (2001). Simulation
studies for assessing the proposed tree and variable importance methods
are presented. To limit the final number of meaningful prognostic groups,
an amalgamation algorithm is employed to merge terminal nodes that are
homogenous in tooth survival. The resulting prognosis rules and variable
importance rankings seem to offer simple yet clear and insightful
interpretations.

 

Thursday, May 19th, 2011, Time 10:30am - 11:30am, Location: AMS Seminar Room, Math Tower 1-122

Speaker: Professor Angshuman Sarkar
Department of Statistics, Visva-Bharati University, India

Title: Two-level and multi-level search designs under a tree structure

Abstract:

Search designs provide an indispensable tool under model uncertainty. After the pioneering work of Srivastava (1975) many authors considered the problem of constructing search designs for different situations. Considering the hierarchy of factorial effects, Srivastava and Hveberg (1992) pointed out the importance of a tree structure in the factorial effects while analyzing data arises from behavioral sciences. That is, for a factorial experiment involving factors F1, F2, F3 and F4, the non-negligibility of interactions F1F2 and F3F4 may implies the non-negligibility of atleast one of F1F2F3 or F1F2F4 or F1F3F4 or F2F3F4. This article consider the problem of constructing a
new class of search designs for situations where it is desired to search and estimate two 2-factor and one 3-factor interactions under a tree structure, in addition to the estimation of all main effects and general mean. First of all we propose the necessary condition for existence of such a search design. The proposed necessary condition is also sufficient in the noiseless case. Then
we propose the required search design both for the two-level and multi-level cases. The performance of the proposed design has been judged in terms of the probability of correct searching.

Wednesday April 6th, 2011, Time 1:00pm - 2:00pm, Location Simons Center Auditorium, Room 103

Speaker: Dr. Song Wu
Department of Biostatistics, St. Jude Children’s Research Hospital, Memphis, TN

Title: Multiple-Marker Linkage Disequilibrium Mapping of Quantitative Traits

Abstract:

Single nucleotide polymorphisms (SNPs) comprise a major part of DNA variants that contribute to disease onset and progression. SNP microarrays provide a platform to survey SNPs on a genome-wide scale. In past years, many methodologies have been developed to analyze the SNP data, and most of them treated SNPs as independent markers and analyzed them separately. A single marker association test would be suitable for somatic SNPs that are acquired in non-productive cells and cannot be passed onto offspring, however, for a majority of inheritable germline SNPs, the single marker method may suffer by ignoring the linkage information contained in adjoining SNPs that are co-segregated with the quantitative trait loci (QTL). In this study, we propose a more powerful framework for linkage disequilibrium (LD) mapping of quantitative traits by using multiple SNP markers. It can be shown theoretically that the four disequilibria parameters involved in a trigenic model can be used to test the association between QTL and its two flanking SNPs. Simulation studies demonstrate that our new method significantly improves the power and robustness of mapping disease genes when the QTL is in linkage with its neighboring SNP markers. Additionally, when the QTL is at the exact location of a SNP, our method maintains a comparable power with the single marker method. A real data example has been analyzed to illustrate the utility of the method. In addition to the SNP array data, I will also discuss how other high-throughput genomic data may contribute to biological discoveries by using examples from The Cancer Genome Atlas (TCGA) project.