Cloaking: Science Meets Science Fiction

Abstract: Can we make objects invisible? This has been a subject of human fascination for millennia in Greek mythology, movies, science fiction, etc. including the legend of Perseus versus Medusa and the more recent Star Trek and Harry Potter. In the last decade or so there have been several scientific proposals to achieve invisibility. We will introduce some of these in a non-technical fashion concentrating on the so-called "transformation optics" that has received the most attention in the scientific literature.

Cloaking: Science Meets Science Fiction

Speaker: 

Gunther Uhlmann

Institution: 

UCI

Time: 

Thursday, March 15, 2012 - 12:00pm to 1:00pm

Location: 

Natural Sciences 2 RM 1201

Abstract: Can we make objects invisible? This has been a subject of human fascination for millennia in Greek mythology, movies, science fiction, etc. including the legend of Perseus versus Medusa and the more recent Star Trek and Harry Potter. In the last decade or so there have been several scientific proposals to achieve invisibility. We will introduce some of these in a non-technical fashion concentrating on the so-called "transformation optics" that has received the most attention in the scientific literature.

The Structure of Ideals

Speaker: 

Monroe Eskew

Institution: 

UCI

Time: 

Monday, March 5, 2012 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

We present a proof of a theorem of Gitik and Shelah that places limits on the structure of quotient algebras by sigma-additive ideals. We will start by showing connections between Cohen forcing and Baire category on the reals. Then by using generic ultrapowers, we will prove that no sigma-additive ideal yields an atomless algebra with a countable dense subset. We will discuss connections with Ulam's measure problem: How many measures does it take to measure all sets of reals?

Problems for Quasiperiodic Schrodinger Operators

Speaker: 

Rajinder Mavi

Institution: 

UCI

Time: 

Thursday, March 8, 2012 - 4:00pm to 6:00pm

Location: 

RH 440R

The almost Matthieu operator arises as a model for Bloch electrons in a magnetic field. Aubry and Andre famously made a conjecture about the spectral properties of this operator more than thirty years ago. In the process of its study, variations of the conjecture arose naturally. Although the original conjecture was recently settled, new problems remain unsettled. We discuss some of these open problems and possible methods (and their shortcomings) to their solution.

Fast Huygens sweeping methods for Helmholtz equations in inhomogeneous media

Speaker: 

Jianliang Qian

Institution: 

Michgan State Unviersity

Time: 

Monday, April 9, 2012 - 4:00pm to 5:00pm

We propose a new Eulerian computational geometrical-optics method, dubbed the fast Huygens sweeping method, for computing Green functions of Helmholtz equations in inhomogeneous media in the high-frequency regime and in the presence of caustics.

The Continuum Directed Random Polymer

Speaker: 

Tom Alberts

Institution: 

Caltech

Time: 

Friday, March 16, 2012 - 1:00pm to 2:00pm

Location: 

Rowland 440R

The discrete directed polymer model is a well studied example of a Gibbsian disordered system and a random walk in a random environment. The usual goal is to understand how the random environment affects the behavior of the underlying walk and how this behavior varies with a temperature parameter that determines the strength of the environment. At infinite temperature the environment has no effect and the walk is the simple random walk, while at zero temperature the environment dominates and the walk follows a single path along which the environment is largest. For temperatures in between there is a competition between the walk wanting to behave diffusively (like simple random walk) and following a path of highest energy (like last passage percolation).

In this talk I will describe recent joint work with Kostya Khanin and Jeremy Quastel for taking a scaling limit of the directed polymer model to construct a continuous path in a continuum environment. We end up with a one-parameter family of random probability measures (indexed by the temperature parameter) that we call the continuum directed random polymer. As the temperature parameter varies the paths cross over from Brownian motion to what is conjectured to be a continuum limit of last passage percolation. This cross over is an inherent feature of the KPZ universality class, which I will also briefly describe.

Lattice Algorithms: State of the Art and Open Problems

Speaker: 

Daniele Micciancio

Institution: 

UCSD

Time: 

Wednesday, March 14, 2012 - 2:00am

Host: 

Location: 

RH 306

TITLE: Lattice Algorithms: State of the Art and Open Problems
SPEAKER: Daniele Micciancio (UCSD)

ABSTRACT
Computational problems on point lattices play an important role in
many areas of computer science and mathematics. Since the discovery of
the LLL basis reduction algorithm in the early '80s, much effort has
gone into the development of better (faster, or more accurate)
algorithms, largely motivated by applications in cryptanalysis. Today,
with the flourishing of lattice based cryptography (i.e.,
cryptographic function whose security rests on the computational
intractability of lattice problems, including the recent development
of fully homomorphic encryption schemes), improving our understanding
of the effort required to solve lattice problems has never been more
important, as it plays a critical role determining appropriate key
sizes. In this talk I will describe the current state of the art in
lattice algorithms, including the asymptotically fastest known
algorithm of Micciancio and Voulgaris, as well as less understood but
practically effective heuristics, and a panoramic of the many research
problems that are still open in the area.

Bio sketch: Daniele Micciancio got his PhD from MIT in 1998, and
joined the UCSD CSE faculty in 1999. He is the recipient of several
awards, including an NSF CAREER award, Sloan Fellowship and Hellman
Fellowship. He is most known for his research on the complexity of
lattice problems, which spans the whole spectrum from computational
complexity and algorithms, to cryptography. His most notable
achievements include the first significant inapproximability result
for the Shortest Vector Problem, pioneering the use of cyclic and
ideal lattices from algebraic number theory for the construction of
very efficient cryptographic primitives based on worst-case complexity
assumptions, and the discovery of the first single exponential time
algorithm to solve all the most important computational problems on
point lattices.

Mathematical Models for Phototaxis

Speaker: 

Doron Levy

Institution: 

University of Maryland

Time: 

Tuesday, May 29, 2012 - 3:00pm to 4:00pm

Host: 

Location: 

RH 440R

Certain organisms undergo phototaxis, that is they migrate toward light. In this talk we will discuss our recent results on modeling phototaxis in order to understand the functionality of the cell and how the motion of individual cells is translated into emerging patterns on macroscopic scales. This is a joint work with Amanda Galante, Susanne Wisen, Tiago Requeijo, and Devaki Bhaya.

MATLAB seminar on "Computer Vision with MATLAB"

Speaker: 

Allyson Butler and Grant Martin

Institution: 

MathWorks

Time: 

Wednesday, March 28, 2012 - 10:00am to 12:00pm

Host: 

Location: 

RH 306

The topics covered will include:

  • Working with files & live sources
  • Pre-processing
  • Blob/point detection, feature extraction, and matching techniques
  • Video Motion analysis with Optical flow, and block matching
  • Video stabilization and stereo image rectification
  • Classification algorithms to recognize image content
  • Video display and graphic overlay
  • Multi-core PC and NVidia GPU simulation and acceleration
  • Integration with OpenCV

Image Deblurring Via Self-Similarity and Via Sparsity

Speaker: 

Yifei Lou

Institution: 

UCSD and UCLA

Time: 

Thursday, March 8, 2012 - 11:00am to 12:00pm

Location: 

RH 306

In this talk, I will present two deblurring methods, one exploits the spatial interactions in images, i.e. the self-similarity; and the other explicitly takes into account the sparse characteristics of natural images and does not entail solving a numerically ill-conditioned backward-diffusion.

In particular, the self-similarity is defined by a weight function, which induces two types of regularization in a nonlocal fashion. Furthermore, we get superior results using preprocessed data as input for the weighted functionals.

The second part of the talk is based on the observation that the sparse coefficients that encode a given image with respect to an over-complete basis are the same that encode a blurred version of the image with respect to a modified basis. An explicit generative model is used to compute a sparse representation of the blurred image, and the coefficients of which are used to combine elements of the original basis to yield a restored image.

Pages

Subscribe to UCI Mathematics RSS