All Seminars
| 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. |
| Title: Moments, Krylov subspace methods and model reduction with applications in ellipsometry |
|---|
| Seminar: Numerical Analysis and Scientific Computing |
| Speaker: Zdenek Strakos of Academy of Sciences of the Czech Republic |
| Contact: Michele Benzi, benzi@mathcs.emory.edu |
| Date: 2009-11-02 at 4:00PM |
| Venue: MSC W201 |
| Download Flyer |
| Abstract: |
| Title: Search for robust algebraic preconditioners |
|---|
| Seminar: Numerical Analysis and Scientific Computing |
| Speaker: Miroslav Tuma of Academy of Sciences of the Czech Republic |
| Contact: Michele Benzi, benzi@mathcs.emory.edu |
| Date: 2009-11-02 at 4:45PM |
| Venue: MSC W201 |
| Download Flyer |
| Abstract: |
| Title: Analysis of Massive Information Networks |
|---|
| Colloquium: Computer Science |
| Speaker: Philip S. Yu of University of Illinois at Chicago |
| Contact: Li Xiong, lxiong@mathcs.emory.edu |
| Date: 2009-10-30 at 3:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: With the ubiquity of information networks and their broad applications, there have been numerous studies on the construction, and mining of information networks in multiple disciplines, including social network analysis, World-Wide Web, database systems, data mining, machine learning, and networked communication and information systems. However, large graphs may often be disk resident, and such graphs cannot be efficiently processed. In this talk, we examine the issues of on-line analytic processing, summarization and indexing of large graphs. Specifically, the problem of connectivity in the context of massive graphs is considered. In many large communication networks, social networks and other graphs, it is desirable to determine the minimum-cut between any pair of nodes. We will discuss how a connectivity index can be developed for a massive-disk resident graph. A sampling based approach is deployed to create compressed representations of the underlying graph. Trade-off between processing efficiency and accuracy will be shown. Bio: Philip S. Yu is a Professor in the Department of Computer Science at the University of Illinois at Chicago and also holds the Wexler Chair in Information Technology. Before joining UIC, he spent most of his career at IBM Thomas J. Watson Research Center and was manager of the Software Tools and Techniques group. Dr. Yu is a Fellow of the ACM and the IEEE. He served as the Editor-in-Chief of IEEE Transactions on Knowledge and Data Engineering (2001-2004). He is an associate editor of ACM Transactions on Knowledge Discovery from Data and also ACM Transactions of the Internet Technology. He serves on the steering committee of IEEE Int. Conference on Data Mining. He was a member of the IEEE Data Engineering steering committee. Dr. Yu received a Research Contributions Award from IEEE Intl. Conference on Data Mining in 2003. His research interests include data mining, privacy, data stream, and database systems. He has published more than 560 papers in refereed journals and conferences. He holds or has applied for more than 300 US patents. Dr. Yu was an IBM Master Inventor when at IBM. |
| Title: Steenrod operations on Chow groups |
|---|
| Seminar: Algebra |
| Speaker: Asher Auel of Emory University |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-10-27 at 4:00PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: |
| Title: A theorem of Gollnitz and its place in the theory of partitions |
|---|
| Seminar: Algebra |
| Speaker: Krishna Alladi of University of Florida |
| Contact: R. Parimala, parimala@mathcs.emory.edu |
| Date: 2009-10-26 at 4:00PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: A Rogers-Ramanujan type identity is a series=product identity which relates certain partitions into parts satisfying difference to partitions into parts satisfying congruence conditions. Rogers-Ramanujan type identities arise in a variety of settings ranging from Lie algebras to statistical mechanics. A supreme example of such a partition identity is the deep 1967 theorem of Gollnitz. We shall discuss a new approach to Gollnitz's theorem in which this partition result and its generalizations will emerge out of a remarkable $q$-hypergeometric identity in three free parameters. This leads to crucial connections with several fundamental results on partitions and $q$-series, a new combinatorial understanding of Jacobi's triple product identity for theta functions, and to some partition congruences modulo powers of 2. The talk will be accessible to non-experts. |
| Title: Hereditary quasirandom properties of hypergraphs |
|---|
| Seminar: Combinatorics |
| Speaker: Domingos Dellamonica of Emory University |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2009-10-23 at 4:00PM |
| Venue: W306 |
| Download Flyer |
| Abstract: Thomason, and Chung, Graham and Wilson were the first to investigate systematically properties of quasirandom graphs. They have stated several quite disparate graph properties -- such as having uniform edge distribution or containing a prescribed number of certain subgraphs -- and proved that these properties are equivalent in a deterministic sense. Simonovits and Sos introduced a hereditary property (which we call S) stating the following: for a small fixed graph L, a graph G on n vertices is said to have the property S if for every subset X of V(G), the number of labeled copies of L in G[X] (the subgraph of G induced by the vertices of (X) is given by $2^{-e(L)} |X|^{v(L)} + o(n^{v(L)})$. They have shown that S is equivalent to the other quasirandom properties. In this talk we give a natural extension of the result of Simonovits and Sos to k-uniform hypergraphs, answering a question of Conlon et al. Our approach yields an alternative, and perhaps simpler, proof of their theorem. |