All Seminars
| Title: Chow motives |
|---|
| Seminar: Algebra |
| Speaker: V. Suresh of Emory University |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-11-17 at 4:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: |
| Title: Information Exploration and Analysis through Interactive Visualization |
|---|
| Seminar: Computer Science |
| Speaker: John Stasko of Georgia Tech, College of Computing |
| Contact: James J. Lu, jlu@mathcs.emory.edu |
| Date: 2009-11-13 at 3:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: Exploring and analyzing data become more challenging as the data grow larger and become more complex. If a picture truly can be worth a thousand words, then clever visualizations of data should hold promise in helping people with sense-making tasks. I firmly believe that visual representations of data can help people to better explore, analyze, and understand it, thus transforming the data into information. In this talk, I will explain how information visualization and visual analytics help people make sense of data and I will illustrate this idea through a number of examples. I also will describe my current research into visualization for investigative analysis. This project explores how visual analytics can help investigators examine a large document collection in order to discover embedded stories and narratives scattered across the documents in the collection. // John Stasko is Professor and Associate Chair of the School of Interactive Computing at Georgia Tech. He received his B.S. degree in Mathematics from Bucknell University, and SC.M. and Ph.D. in Computer Science from Brown. His primary research area is human-computer interaction, with a focus on information visualization and visual analytics. |
| Title: Steenrod squares in Chow groups II |
|---|
| Seminar: Algebra |
| Speaker: Asher Auel of Emory University |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-11-12 at 3:00PM |
| Venue: MSC E406 |
| Download Flyer |
| Abstract: |
| Title: Computational and Statistical Methods for Positron Emission Tomography |
|---|
| Seminar: Numerical Analysis and Scientific Computing |
| Speaker: Johnathan Bardsley of Department of Mathematical Sciences, University of Montana |
| Contact: James Nagy, nagy@mathcs.emory.edu |
| Date: 2009-11-11 at 12:45PM |
| Venue: W306 |
| Download Flyer |
| Abstract: I'll spend a fair amount of time discussing the mathematical models behind the CT (computed tomography) and PET (positron emission tomography) imaging modalities, with the goal of bringing the audience along for as much of 50 minutes as possible. At some point, however, I'll dive into my own research focusing on the PET imaging problem, which includes iterative methods, as well as the choice of the regularization function and parameter.\\ \\ Anyone curious about how these standard medical imaging techniques work is encouraged to attend. |
| Title: Lattices, sphere packings, spherical codes, and energy minimization |
|---|
| Seminar: Algebra |
| Speaker: Abhinav Kumar of MIT |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-11-10 at 4:00PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: It is a classical problem in geometry to find the densest sphere packing in n-dimensional Euclidean space. Analogous problems of packing among lattices, or on compact spaces such as the sphere or Hamming space, are widely studied in number theory, discrete geometry, coding theory and combinatorics. I will talk about some recent work which puts these problems in the framework of potential energy minimization. This leads to experimental and theoretical techniques to approach these optimization problems (and their inverse problems), and leads to some surprising new results in high dimensions. |
| Title: What is symmetric homology? |
|---|
| Seminar: Topology |
| Speaker: Zbigniew Fiedorowicz of The Ohio State University |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-11-06 at 3:00PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: We outline the general development of a theory of symmetric homology of algebras, an analog of cyclic homology where the cyclic groups are replaced by symmetric groups. This theory is developed using the framework of crossed simplicial groups and the homological algebra of module-valued functors. The symmetric homology of group algebras is related to stable homotopy theory. Two spectral sequences for computing symmetric homology are constructed. The $E_1$ term of one of these relates to a new class of geometric complexes for Coxeter groups. Many open questions remain. |
| Title: Managing and Processing RFID Data |
|---|
| Seminar: Computer Science |
| Speaker: Fusheng Wang of Emory University |
| Contact: James Lu, jlu@mathcs.emory.edu |
| Date: 2009-11-06 at 3:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: Advances of sensor and RFID technology provide significant new power for humans to sense, understand and manage the world. RFID provides fast data collection with precise identification of objects with unique IDs without line of sight, thus it can be used for identifying, locating, tracking and monitoring physical objects. Despite these benefits, RFID poses many challenges for data processing and management. In this talk, I will discuss our work on temporal and location based RFID data management, and rule-based complex RFID event processing. \\ Fusheng Wang is a Senior Research Scientist at Emory University's Center for Comprehensive Informatics. Dr. Wang received his Ph.D. in Computer Science from University of California, Los Angeles in 2004. Before joining Emory, he was a research scientist and project lead at Siemens Corporate Research. His research areas include heterogeneous scientific data management and integration, high performance biomedical image management systems, temporal data management, RFID data management, XML databases, and collaborative information systems. |
| Title: Two problems in asymptotic combinatorics |
|---|
| Seminar: Combinatorics |
| Speaker: Rod Canfield of The University of Georgia |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2009-11-06 at 4:00PM |
| Venue: W306 |
| Download Flyer |
| Abstract: |
| Title: Pseudo-reductive groups |
|---|
| Seminar: Algebra |
| Speaker: Gopal Prasad of University of Michigan |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-11-06 at 4:15PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: A pseudo-reductive group is a smooth connected affine algebraic group over a field k which does not contain any nontrivial smooth connected normal unipotent subgroups defined over k. Such groups arise naturally as the quotient of any smooth connected affine algebraic k-group by the maximal smooth connected normal unipotent subgroup defined over k. For study of general affine algebraic groups it is important to know the structure and classification of pseudo-reductive groups. In a joint work with Brian Conrad and Ofer Gabber we have determined the structure and classification of these groups. In my talk I will explain the classification, and also mention group theoretic and arithmetic applications. |
| Title: High Performance Java Software for Image Processing |
|---|
| Defense: Numerical Analysis and Scientific Computing |
| Speaker: Piotr Wendykier of Emory University |
| Contact: Piotr Wendykier, piotr.wendykier@emory.edu |
| Date: 2009-11-03 at 4:00PM |
| Venue: MSC W201 |
| Download Flyer |
| Abstract: Parallel computing has been used for scientific computing applications since the 1960s, when the first supercomputers were developed. However, only recently have these programming paradigms become useful for software running on desktop and notebook computers. In this dissertation we demonstrate the advantage of exploiting modern computer architectures in scientific computing with multithreaded programming in Java for applications in image processing. A significant contribution of this work is an open source, multithreaded high performance scientific computing Java library called Parallel Colt. In addition, on top of Parallel Colt, we have implemented six ImageJ plugins for deconvolution, super resolution, fast Fourier transforms and image cropping. Hence, we are able to provide software to solve important problems in real image processing applications, and which can effectively make use of multi-core CPUs available on affordable desktop and notebook computers. |