Wednesday, October 19 at 3:30 pm – 4:30 pm in 338 Johnston Hall
Abstract: The talk gives an overview of some discrete approximation techniques that
have been developed for optimal control problems. We focus in particular on
Runge-Kutta discretizations and more recent work on pseudospectral schemes. The
numerical paradigm consistency + stability => convergence is explained in the
context of these discretizations. Gradient techniques for solving the discretized
problems will also be discussed. Additional details can be found at
http://www.cct.lsu.edu/events/talks/584
October 18th, 2011
Oct 17th at 9:00am at 338 Johnston Hall
October 17th, 2011
Friday, April 8 2011 3:40 pm in Lockett Hall Room B5
The speakers are:
Shawn Walker — Assistant Prof. at Dept. of Math,
Michael Neilan– Postdoctoral Researcher at Dept of Math and CCT,
Rachael Miller Neilan — Postdoctoral Researcher at Dept. of Oceanography and Coastal Sciences and
Heather Russell–PPostdoctoral Researcher at Dept. of Math.
They will share their experiences regarding recent jobs they’ve found and advice about the job search.
April 7th, 2011
Friday, March 18 2011 2:00 pm to 3:00 pm in 233 Lockett Hall
Abstract: The traveler’s dilemma describes a scenario where two people returning
home from a journey can easily walk away with an extra hundred dollars
each, but the standard tools of game theory predict they will somehow
choose to end up with two dollars instead. The usual notions of Nash
equilibrium and rational strategies lead to outcomes that seem obviously
wrong to a lay person, and indeed, when the game is simulated, players who
choose provably irrational strategies almost always end up doing better
than supposedly “rational” players. In this talk we describe the paradox
and point the way to a partial solution, where we see that the
mathematician’s desire to impose clean categories and strict definitions
is obscuring something messy but important.
March 17th, 2011
Monday January 31, 2011 4:00 pm to 5:00 pm in 338 Johnston Hall
HPC is entering a new phase in system structure and operation driven by a combination of technology and architecture trends as early research to achieve Exascale capability is initiated. Perhaps foremost are the constraints of power and complexity that as a result of the flat-lining of clock rates relies on multicore as the primary means by which performance gain is being achieved with Moore’s Law. Indeed, for all intents and purposes, “multicore” is the new “Moore’s Law” with steady increases in the number of cores per socket. Added to this is the highly multithreaded GPU technology moving HPC into the heterogeneous modality for additional performance gain. These dramatic changes in system architecture are forcing new methods of use including programming and system management. Historically HPC has experienced five previous phase changes involving technology, architecture, and programming models. The current phase of two decades is exemplified by the communicating sequential model of computation replacing previous vector and SIMD models. HPC is now faced with the need for new effective means of sustaining performance growth with technology through rapid expansion of multicore with anticipated structures of hundreds of millions of cores by the end of this decade delivering Exaflops performance. This presentation will discuss the driving trends and issues of the new phase change in HPC and will discuss the ParalleX execution model that is serving as a pathfinding framework for exploring an innovative synthesis of semantic constructs and mechanisms that may serve as a foundation for computational systems and techniques in the Exascale era. This talk will use a kernel application code for numerical relativity via adaptive mesh refinement to demonstrate the effectiveness of the ParalleX model through the use of the HPX runtime software system library.
Here are photos from the talk:
Dr. Sterling 1
Dr. Sterling 2
Dr. Sterling 3
March 17th, 2011
January 11, 2011 11:00 am to 12:00 pm in 338 Johnston Hall
This presentation is directed at an audience (Mathematicians, Natural Scientists, Engineers) interested in a career in industry, possibly with an international focus.
The presenter will give an overview of the company Siemens, for which he has worked for close to twenty years, with a focus on entry-level positions for master and doctorial graduates.
Here are the slides to the talk:
Slides part 1
Slides part 2
Slides part 3
Slides part 4
Slides part 5
January 12th, 2011
Here are the template files and a brief user guide for the sciposter document class. Remember to extract/save the poster_template file in the same folder as the dsfont.sty and sciposter.cls files so it compiles correctly (in other words, extract all the files to the same folder and run the template code from there).
Poster kit
October 1st, 2010
August 27, 2010 11:00 am to 12:00 pm in 338 Johnston Hall
Abstract:
When we use a camera, we want the recorded image to be a faithful representation of the scene that we see, but every image is more or less blurry. In image deblurring, the goal is to recover the original, sharp image by using a mathematical model of the blurring process. The key issue is that some information on the lost details is indeed present in the blurred image, but this “hidden” information can be recovered only if we know the details of the blurring process. In this talk we describe the deblurring algorithms and techniques collectively known as spectral filtering methods, in which the singular value decomposition (or a similar decomposition with spectral properties) is used to introduce the necessary regularization or filtering in the reconstructed image.
August 18th, 2010
Tuesday May 4th at 3:30pm in 338 Johnston Hall
Abstract:
With the rapid advancement of 3D scanning technologies, high-fidelity geometric datasets of huge size have been acquired through hardware devices.
A fundamental and challenging problem is how to compute mapping to correspond different surface and volumetric objects of arbitrarily complicated
topological types. Inter-shape mapping, or more specifically, finding a low distorted correspondence between two given shapes is a very powerful
enabling tool for various applications. We seek accurate and efficient solutions to this fundamental and important problem. This talk
is about our recent work on surface and volumetric mapping computation based on shape decomposition. Compared with existing techniques, our work
offers a more effective solution. We envision broader application scopes of mapping in digital entertainment, modeling and simulation, vision,
medical imaging, content-driven information retrieval, digital medicine, virtual environments, etc.
Short Bio:
Xin Li is an assistant Professor in Department of Electrical & Computer
Engineering, and Center for Computation & Technology, and adjunct professor in Department of Computer Science.
He received the Ph.D. (2008) and M.S. (2005) in Computer Science at Stony Brook
University (SUNY), and the B.S. (2003) in Computer Science from
University of Science and Technology of China. His research interests
include computer graphics, geometric modeling and processing, computer aided design, vision,
and visualization. For more information please visit http://www.ece.lsu.edu/xinli
April 28th, 2010
The general advice slides from the 2010 Career day are now available.
The panel slides are also now available.
April 16th, 2010
Previous Posts
