Finite Element Analysis for Fluid-Structure Interactions and Applications

Speaker: 

Jinchao Xu

Institution: 

Penn State University

Time: 

Monday, November 9, 2015 - 4:00pm to 5:00pm

Host: 

Location: 

RH306

In the numerical simulation for fluid-structure problems, many different possible combinations of coordinate systems can be used for fluid and structure problems.   While Eulerian coordinate is almost always used for fluid problems,  either Eulerian or Lagrangian coordinate can be used for structure problems.   In this talk, I will discuss some mathematical and numerical issues for these different choices of coordinate systems.  In particular, I will report some convergence analysis for eXtended Finite Element Methods (XFEM) for Eulerian-Eulerian coordinates and the study of the well-posedness and preconditioning for finite element discretization based Arbitrary Lagrangian-Elerian (ALE) coordinates.  I will also present some numerical results for some practical applications such as hydroelectric power generator and abdominal aortic aneurysm.

Perfect and Scattered Subsets of Generalized Cantor Space II

Speaker: 

Geoff Galgon

Institution: 

UCI

Time: 

Monday, October 19, 2015 - 4:00pm to 5:30pm

Location: 

RH 440R

We will initially discuss games played on subsets of the Cantor space, for which the existence or nonexistence of winning strategies for certain players can provide a characterization of perfectness or scatteredness. We will also give an old characterization of the type of trees in 2^{<\omega} through which outer models can add branches. Finally, we will make some observations about the nature of some generalizations of these topics to the 2^{\kappa} spaces.

Cobordisms and holomorphic curves

Speaker: 

Hiro Lee Tanaka

Institution: 

Harvard University

Time: 

Tuesday, December 1, 2015 - 4:00pm

Location: 

RH 306

Just as we study varieties by utilizing vector bundles over them, we
often study symplectic manifolds by utilizing holomorphic curves.
While holomorphic curves are by far the most useful tool in
symplectic geometry, the analytical details can often be a
bottleneck. In this talk, we'll talk about how the most computable
cases of holomorphic curve theory may conjecturally be recovered by
purely topological (i.e., non-analytical) means---namely, through the
algebraic structure inherent in cobordisms. As an example theorem, we
will show that if two exact closed Lagrangians submanifolds are
related by an exact Lagrangian cobordism, then their Floer theories
are identical in a very strong sense.

Modeling Actin Regulation in Cancer Metastasis

Speaker: 

Nessy Tania

Institution: 

Smith College

Time: 

Monday, January 11, 2016 - 11:00am to 12:00pm

Host: 

Location: 

NS2 1201

Directed cell movement, chemotaxis, is a part of normal physiological processes such as wound healing, immune response and embryogenesis. However, this pathway can also be hijacked during tumor development, allowing cancer cells to metastasize. In this talk, I will discuss an ongoing collaboration in modeling the regulation of actin cytoskeleton in mammary carcinoma motility. I will survey results from a temporal ODE model of the regulation of cofilin, an actin regulatory protein that is upregulated in invasive carcinoma. Second, I will present a spatio-temporal model of actin growth to look at the collective effects of two actin regulatory proteins. At the end, I will motivate our current effort in studying invadopodia, a dynamic actin-based structure that allows cancer cell to dig through its surrounding environment. This work is done jointly with John Condeelis (Albert Einstein College of Medicine) and Leah Edelstein-Keshet (University of British Columbia).

The effects of the initial function to the stochastic heat equation

Speaker: 

Kunwoo Kim

Institution: 

University of Utah

Time: 

Tuesday, November 3, 2015 - 11:00am to 12:00pm

Host: 

Location: 

RH 306

Consider a stochastic heat equation (SHE) driven by multiplicative space-time white noise. It is known that if the initial function had compact support, then the solution is bounded almost surely for all time t. On the other hand, if the initial function is constant, then the solution is not bounded for all time t>0. A natural question is that "is there some decay rate of the initial function at infinity which tells us that the solution is bounded or unbounded for some or even all t”? A short answer is “Yes” and, in this talk, we describe precisely the decay rate of the initial function at infinity which tells us boundedness and unboundedness for some or all time t. This is based on ongoing work with Le Chen and Davar Khoshnevisan.

Birkhoff Conjecture and ''spectral rigidity'' of planar convex domains

Speaker: 

Vadim Kaloshin

Institution: 

Maryland University

Time: 

Thursday, January 21, 2016 - 4:00pm to 5:00pm

Host: 

Location: 

Rowland Hall 306

The classical Birkhoff conjecture states that the only integrable convex planar domains are circles and ellipses. In a joint work with A. Avila and J. De Simoi we show that this conjecture is true for perturbations of ellipses of small eccentricity. It turns out that the method of proof gives an insight into deformational spectral rigidity of planar axis symmetric domains and a partial answer to a question of P. Sarnak. The latter is a joint work with J. De Simoi and Q. Wei.

CRYPTO DAY

Institution: 

UCI

Time: 

Tuesday, November 17, 2015 - 9:00am to 4:00pm

Host: 

Location: 

RH 340P

 Schedule:

 9:00-10:00    Stanislaw Jarecki (UCI), Secure Computation and Oblivious Random Memory

Abstract: We will give an overview of the central cryptographic concept of secure multi-party computation, i.e., of protocols that allow participating parties to perform any computation on their joint data in a way which outputs only the final computation result and hides everything else about the input data.  We will explain the role of Oblivious Random Memory protocols in enabling secure computation on large data, and we will show some recent work and research problems in this area.

10:00-10:30   Refreshments

10:30-11:30   Stanislaw Jarecki (UCI), Covert Computation

Abstract: A notion of covert computation is a variant of secure computation whose goal is to assure that the participants in the computation not only do not learn anything about each other's data except for the final output, but also, unless this final computation output is "favorable" in some way, protocol participants cannot distinguish each other from random noise beacons. In this way no party can even tell if anyone else participates in the computation, except when the final computation output reveals it to them.  For example, covert authentication allows participants to authenticate each other without letting anyone else know that an authentication has taken place.  We will explain the challenges covert computation poses and show some recent work in this area.

 1:00-2:00     Amit Sahai (UCLA), Tutorial on Indistinguishability Obfuscation, Part 1

 2:00-3:00     Refreshments

 3:00-4:00    Amit Sahai (UCLA), Tutorial on Indistinguishability Obfuscation, Part 2

Sub-exponential algorithms for ECDLP?

Speaker: 

Michiel Kosters

Institution: 

UCI

Time: 

Tuesday, October 20, 2015 - 2:00pm to 3:00pm

Location: 

RH 340P

In this talk we will discuss various recent claims of algorithms which solve certain instances of the elliptic curve discrete logarithm problem (ECDLP) over finite fields in sub-exponential time. In particular, we will discuss approaches which use Groebner basis algorithms to solve systems coming from summation polynomials. The complexity of these approaches relies on the so-called first fall degree assumption. We will raise doubt to this first fall degree assumption and hence to the claimed complexity.

Perfect and Scattered Subsets of Generalized Cantor Space

Speaker: 

Geoff Galgon

Institution: 

UCI

Time: 

Monday, October 12, 2015 - 4:00pm to 5:30pm

Location: 

440R

We will recall the standard notions of perfect and scattered subsets of 2^{\omega} and give several equivalent characterizations, make some observations, and record some facts. We will then discuss how some natural analogues to these characterizations diverge from one another in the generalized 2^{\kappa} setting. We will make some observations and give some open questions/directions.

Pages

Subscribe to UCI Mathematics RSS