All Seminars
| Title: Chow motives II |
|---|
| Seminar: Algebra |
| Speaker: V. Suresh of University of Hyderabad and Emory University |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-11-23 at 4:00PM |
| Venue: MSC E408 |
| Download Flyer |
| Abstract: |
| Title: Automatic Modeling of Procedural Knowledge and Feedback Generation in Tutoring System for Computer Science |
|---|
| Seminar: Computer Science |
| Speaker: Davide Fossati of Georgia Tech, College of Computing |
| Contact: James J. Lu, jlu@mathcs.emory.edu |
| Date: 2009-11-20 at 3:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: This research takes place in the larger context of the study of one-on-one tutoring, a form of instruction that has been shown to be very effective. We conducted a study of human tutoring in the domain of Computer Science data structures, to understand which features and strategies of human tutoring are important for learning. We developed an Intelligent Tutoring System, iList, that helps students learn linked lists. One of the main advancements in iList is the presence of a Procedural Knowledge Model automatically extracted from student data. This model allows iList to provide effective reactive and proactive procedural feedback while a student is solving a problem. We tested five different versions of iList, differing in the level of feedback they can provide, in multiple classrooms, with a total of more than 200 students. The evaluation study showed that iList is effective in helping students learn; students liked working with the system; and the feedback generated by the most sophisticated versions of the system is helpful in keeping the students on the right path. \\ Davide Fossati (http://www.fossati.us) received his Ph.D. in Computer Science at the University of Illinois at Chicago in summer 2009. He also holds an M.Sc. degree in Computer Engineering from the Politecnico di Milano, Italy (2004), and an M.Sc. in Computer Science from the University of Illinois at Chicago (2003). His research focuses on applications of Artificial Intelligence in education, such as Intelligent Tutoring Systems, and computational models and tools to support formative assessment in Computer Science education. |
| Title: Geometric Methods in Group Theory and Graph Theory |
|---|
| Seminar: Combinatorics |
| Speaker: Praphat Fernandes of Emory University |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2009-11-20 at 4:00PM |
| Venue: W306 |
| Download Flyer |
| Abstract: I will introduce some basic notions from "large scale geometry" and carry out a brief survey of some of the applications to group theory and graph theory. I will mostly be concerned with infinite groups and graphs. |
| Title: Riemann's zeros and the rhythm of the primes |
|---|
| 150th anniversary of the Riemann Hypothesis: Celebration of the |
| Speaker: David Borthwick of Emory University |
| Contact: Skip Garibaldi, skip@mathcs.emory.edu |
| Date: 2009-11-18 at 4:00PM |
| Venue: MSC W201 |
| Download Flyer |
| Abstract: Exactly 150 years ago, Riemann published a short paper (in German) called "On the Number of Primes Less Than a Given Magnitude." In it, he speculated that the zeros of the zeta function all lie on a certain line called the critical strip. This conjecture, now called the Riemann Hypothesis, is the greatest unsolved problem in all of mathematics. In this talk we'll introduce the Hypothesis and try to explain why mathematicians find this arcane-sounding problem so compelling. |
| 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. |