Seminars and Colloquia by Series

An Introduction to Compressed Sensing

Series
ACO Student Seminar
Time
Friday, October 5, 2012 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ying XiaoCollege of Computing, Georgia Tech
In the last 10 years, compressed sensing has arisen as an entirely new area of mathematics, combining ideas from convex programming, random matrices, theoretical computer science and many other fields. Candes (one of the originators of the area) recently spoke about two quite recent and exciting developments, but it might be interesting to revisit the fundamentals, and see where a lot of the ideas in the more recent works have developed. In this talk, I will discuss some of the earlier papers (Candes-Romberg-Tao), define the compressed sensing problem, the key restricted isometry property and how it relates to the Johnson-Lindenstrauss lemma for random projections. I'll also discuss some of the more TCS ideas such as compressed sensing through group testing, and hopefully some of the greedy algorithm ideas as well. Finally, if time allows, I'll draw parallels with other problems, such as matrix completion, phase retrieval etc. The talk will be quite elementary, requiring only a knowledge of linear algebra, and some probability.

Nanoengineered Surfaces: Transport Phenomena and Energy Applications

Series
Other Talks
Time
Friday, October 5, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
MRDC, Room 4211
Speaker
Evelyn WangDepartment of Mechanical Engineering, MIT

Please Note: Host: David Hu. Refreshments will be served. Speaker's Bio

Nanoengineered surfaces offer new possibilities to manipulate fluidic and thermal transport processes for a variety of applications including lab-on-a-chip, thermal management, and energy conversion systems. In particular, nanostructures on these surfaces can be harnessed to achieve superhydrophilicity and superhydrophobicity, as well as to control liquid spreading, droplet wetting, and bubble dynamics. In this talk, I will discuss fundamental studies of droplet and bubble behavior on nanoengineered surfaces, and the effect of such fluid-structure interactions on boiling and condensation heat transfer. Micro, nano, and hierarchical structured arrays were fabricated using various techniques to create superhydrophilic and superhydrophobic surfaces with unique transport properties. In pool boiling, a critical heat flux >200W/cm2 was achieved with a surface roughness of ~6. We developed a model that explains the role of surface roughness on critical heat flux enhancement, which shows good agreement with experiments. In dropwise condensation, we elucidated the importance of structure length scale and droplet nucleation density on achieving the desired droplet morphology for heat transfer enhancement. Accordingly, with functionalized copper oxide nanostructures, we demonstrated a 20% higher heat transfer coefficient compared to that of state-of-the-art dropwise condensing copper surfaces. These studies provide insights into the complex physical processes underlying fluid-nanostructure interactions. Furthermore, this work shows significant potential for the development and integration of nanoengineered surfaces to advance next generation thermal and energy systems.

Cramér type theorem for Wiener and Wigner stochastic integrals

Series
Stochastics Seminar
Time
Thursday, October 4, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
J.-C. BretonInstitut de Recherche Mathématique de Rennes
Cramér's theorem from 1936 states that the sum of two independent random variables is Gaussian if and only if these random variables are Gaussian. Since then, this property has been explored in different directions, such as for other distributions or non-commutative random variables. In this talk, we will investigate recent results in Gaussian chaoses and free chaoses. In particular, we will give a first positive Cramér type result in a free probability context.

Lifts of Convex Sets and Cone Factorizations

Series
School of Mathematics Colloquium
Time
Thursday, October 4, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Rekha ThomasUniversity of Washington
A basic strategy for linear optimization over a complicated convex set is to try to express the set as the projection of a simpler convex set that admits efficient algorithms. This philosophy underlies all "lift-and-project" methods in optimization which attempt to find polyhedral or spectrahedral lifts of complicated sets. In this talk I will explain how the existence of a lift is equivalent to the ability to factorize a certain operator associated to the convex set through a cone. This theorem extends a result of Yannakakis who showed that polyhedral lifts of polytopes are controlled by the nonnegative factorizations of the slack matrix of the polytope. The connection between cone lifts and cone factorizations of convex sets yields a uniform framework within which to view all lift-and-project methods, as well as offers new tools for understanding convex sets. I will survey this evolving area and the main results that have emerged thus far.

C*-algebras Generated by Composition Operators

Series
Analysis Seminar
Time
Wednesday, October 3, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Katie QuertermousJames Madison University
In this talk, we investigate the structures of C*-algebras generated by collections of linear-fractionally-induced composition operators and either the forward shift or the ideal of compact operators. In the setting of the classical Hardy space, we present a full characterization of the structures, modulo the ideal of compact operators, of C*-algebras generated by a single linear-fractionally-induced composition operator and the forward shift. We apply the structure results to compute spectral information for algebraic combinations of composition operators. We also discuss related results for C*-algebras of operators on the weighted Bergman spaces.

Nonlinear Landau Damping and Inviscid Damping

Series
Research Horizons Seminar
Time
Wednesday, October 3, 2012 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Zhiwu LinGeorgia Tech, School of Math
Consider electrostatic plasmas described by Vlasov-Poisson with a fixed ion background. In 1946, Landau discovered the linear decay of electric field near a stable homogeneous state. This phenomena has been puzzling since the Vlasov-Poisson system is time reversible and non-dissipative. The nonlinear Landau damping was proved for analytic perturbations by Mouhot and Villani in 2009, but for general perturbations it is still largely open. I will discuss some recent results with C. Zeng on the failure of nonlinear daming in low regularity neighborhoods and a regularity threshold for the existence of nontrivial invariant structures near homogeneous states. A related problem to be discussed is nonlinear inviscid damping of Couette flow, for which the linear decay was first observed by Orr in 1907.

Towards the proof of diffusion in the Jupiter-Sun restricted three body problem.

Series
Dynamical Systems Working Seminar
Time
Tuesday, October 2, 2012 - 16:30 for 1.5 hours (actually 80 minutes)
Location
Skiles 06
Speaker
Maciej CapinskiGeorgia Tech
In the talk we will present a mechanism of diffusion in the Planar Circular Restricted Three Body Problem. The mechanism is similar to the one that appeared in the celebrated work of V. I. Arnold [Dokl. Akad. Nauk SSSR 156 (1964), 9–12]. Arnold conjectured that this phenomenon, usually called Arnold diffusion, appears in the three body problem. The presented method is a step towards a proof of the conjecture.

An Invitation to the Millennium Prize Problem for the Navier-Stokes Equation and its Probabilistic Counterpart

Series
PDE Seminar
Time
Tuesday, October 2, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
S. S. SritharanNaval Postgraduate School, Monterey, California
In this talk we will give a very elementary explanation of issues associated with the unique global solvability of three dimensional Navier-Stokes equation and then discuss various modifications of the classical system for which the unique solvability is resolved. We then discuss some of the fascinating issues associated with the stochastic Navier-Stokes equations such as Gaussian & Levy Noise, large deviations and invariant measures.

Statistical Algorithms and a Lower Bound for Detecting a Planted Clique

Series
High-Dimensional Phenomena in Statistics and Machine Learning Seminar
Time
Tuesday, October 2, 2012 - 15:05 for 1.5 hours (actually 80 minutes)
Location
Skyles 005
Speaker
Santosh VempalaGeorgia Institute of Technology
We present a framework for proving lower bounds on computational problems over distributions, including optimization and unsupervised learning. The framework is based on defining a restricted class of algorithms, called statistical algorithms, that instead of directly accessing samples from the input distribution can only obtain an estimate of the expectation of any given function on the input distribution. Our definition captures many natural algorithms used in theory and practice, e.g., moment-based methods, local search, linear programming, MCMC and simulated annealing. Our techniques are inspired by the statistical query model of Kearns from learning theory, which addresses the complexity of PAC-learning. For specific well-known problems over distributions, we obtain lower bounds on the complexity of any statistical algorithm. These include an exponential lower bounds for moment maximization and a nearly optimal lower bound for detecting planted clique distributions when the planted clique has size n^{1/2-\delta} for any constant \delta > 0. Variants of the latter problem have been assumed to be hard to prove hardness for other problems and for cryptographic applications. Our lower bounds provide concrete evidence of hardness. This is joint work with V. Feldman, E. Grigorescu, L. Reyzin and Y. Xiao.

Pages