# All Seminars

Show:Title: Designing Abstract Meaning Representations |
---|

Seminar: Computer Science |

Speaker: Martha Palmer of University of Colorado |

Contact: Jinho Choi, choi@mathcs.emory.edu |

Date: 2017-03-17 at 3:00PM |

Venue: W301 |

Download Flyer |

Abstract:Abstract Meaning Representations (AMRs) provide a single, graph-based semantic representation that abstracts away from the word order and syntactic structure of a sentence, resulting in a more language-neutral representation of its meaning. AMRs implements a simplified, standard neo-Davidsonian semantics. A word in a sentence either maps to a concept or a relation or is omitted if it is already inherent in the representation or it conveys inter-personal attitude (e.g., stance or distancing). The basis of AMR is PropBanks lexicon of coarse-grained senses of verb, noun and adjective relations as well as the roles associated with each sense (each lexicon entry is a roleset). By marking the appropriate roles for each sense, this level of annotation provides information regarding who is doing what to whom. However, unlike PropBank, AMR also provides a deeper level of representation of discourse relations, non-relational noun phrases, prepositional phrases, quantities and time expressions (which PropBank largely leaves unanalyzed), as well as Named Entity tags with Wikipedia links. Additionally, AMR makes a greater effort to abstract away from language-particular syntactic facts. The latest version of AMR includes adding coreference links across sentences, including links to implicit arguments. This talk will explore the differences between PropBank and AMR, the current and future plans for AMR annotation, and the potential of AMR as a basis for machine translation. It will end with a discussion of areas of semantic representation that AMR is not currently addressing, which remain as open challenges.\\ \\ Martha Palmer is a Professor at the University of Colorado in Linguistics, Computer Science and Cognitive Science, and a Fellow of the Association of Computational Linguistics.. She works on trying to capture elements of the meanings of words that can comprise automatic representations of complex sentences and documents. Supervised machine learning techniques rely on vast amounts of annotated training data so she and her students are engaged in providing data with word sense tags, semantic role labels and AMRs for English, Chinese, Arabic, Hindi, and Urdu, both manually and automatically, funded by DARPA and NSF. These methods have also recently been applied to biomedical journal articles, clinical notes, and geo-science documents, funded by NIH and NSF. She is a co-editor of LiLT, Linguistic Issues in Language Technology, and has been on the CLJ Editorial Board and a co-editor of JNLE. She is a past President of the Association for Computational Linguistics, past Chair of SIGLEX and SIGHAN, co-organizer of the first few Sensevals, and was the Director of the 2011 Linguistics Institute held in Boulder, Colorado. |

Title: A Method for Landscape Exploration in Global Optimization. |
---|

Seminar: N/A |

Speaker: Manuela Manetta of Emory University |

Contact: Bree Ettinger, bettinger@mathcs.emory.edu |

Date: 2017-03-16 at 1:00PM |

Venue: W303 |

Download Flyer |

Abstract:Finding global minima for a general smooth objective function is a fundamental yet challenging problem arising in applied mathematics. Nevertheless, the most reliable techniques to converge to a minimum are local (gradient descent and Newton's method), and remain trapped in the basins of attraction of the minima found, which could be either local or global. Even in optimization courses, the students are often left with questions, such as, "how do we know that we found the global minimum? How do we know that we have visited the interesting regions of configuration space?" The purpose of this talk is to present methods and ideas that could help the students formulate answers to the questions above. In particular, I will present a new descent technique and a way to explore the landscape of the objective function, with no pretense that this is the answer to the problem, but with the hope of engaging the students. Interested students can begin to take small steps in the right direction toward the development of their own methods. |

Title: Curvature through Cubes |
---|

Seminar: N/A |

Speaker: Michael Carr of Emory University |

Contact: Bree Ettinger, bettinger@mathcs.emory.edu |

Date: 2017-03-15 at 4:00PM |

Venue: W303 |

Download Flyer |

Abstract:Everyone knows the shortest distance between two points in Euclidean space is a straight line, but what about in more exotic spaces? Mathematicians have been studying paths on curved spaces for as long as we have known we lived on one. More recently the work of Gromov showed that notions of curvature can be extended to spaces that seem to have no curves at all: complexes made from ordinary cubes glued together. We will look at applications of these spaces from robotics to chemistry to recent advances in topology. |

Title: Bias and Uncertainty in Information Visualization |
---|

Type: Computer Science |

Speaker: Michael Correll of University of Washington |

Contact: TBA |

Date: 2017-03-13 at 4:00PM |

Venue: W303 |

Download Flyer |

Abstract:We often turn to data to help us make sense of an uncertain world. However, the uncertainty in our data is often esoteric, complex, or counter-intuitive. It can be challenging to present this uncertainty, especially to audiences without backgrounds in statistics. Charts, graphs, and other visualizations of data address this issue by making people into visual statisticians: we can estimate statistical properties through visual inspection. However, just as statistical measures can be subject to bias, visualizations can also introduce bias. In this talk, I show how designers can intervene to create new visualizations that correct these biases, and improve the judgments of visual statisticians. From this perspective of designing for de-biasing, I focus on two common visualizations: error bars and thematic maps. I present visual alternatives for error bars that avoid within-the-bar bias while also promoting statistically grounded comparisons between means. I also present Surprise Maps, a technique for thematic maps that relies on Bayesian reasoning to highlight interesting regions that might otherwise be hidden in traditional maps. I conclude with a discussion of remaining challenges for visual de-biasing, and how we might use visualizations to encourage better, data-driven decision-making. |

Title: The Distribution Of The Number Of Prime Factors With Restrictions - Variations Of The Classical Theme |
---|

Seminar: Algebra |

Speaker: Krishna Alladi of University of Florida |

Contact: David Zureick-Brown, dzb@mathcs.emory.edu |

Date: 2017-02-28 at 4:00PM |

Venue: W306 |

Download Flyer |

Abstract:The study of $\nu(n)$ the number of prime factors of $n$ began with Hardy and Ramanujan in 1917 who showed that $\nu(n)$ has normal order $log\,log\,n$ regardless of whether the prime factors are counted singly or with multiplicity. Their ingenious proof of this utilized uniform upper bounds for $N_k(x)$, the number of integers up to $x$ with $\nu(n)=k$. Two major results followed a few decades later - the Erd\"os-Kac theorem on the distribution more generally of additive functions, and the Sathe-Selberg theorems on the asymptotic behavior of $N_k(x)$ as $k$ varies with $x$ - a significant improvement of Landau's asymptotic estimate for $N_k(x)$ for fixed $k$. We shall consider the distribution of the number of prime factors by imposing certain restrictions - such as (i) requiring all prime factors of $n$ to be $ |

Title: Bounded colorings of graphs and hypergraphs |
---|

Seminar: Combinatorics |

Speaker: Jan Volec of McGill University |

Contact: Dwight Duffus, dwight@mathcs.emory.edu |

Date: 2017-02-27 at 4:00PM |

Venue: W303 |

Download Flyer |

Abstract:A conjecture of Bollobas and Erdos from 1976 states that any coloring of edges of an n-vertex complete graph such that at each vertex no color appears more than (n/2)-times contains a properly-colored Hamilton cycle. This problem was motivation for the following more general question: Let c be a coloring of E(K_n) where at each vertex, no color appear more than k-times. What properly colored subgraphs does c necessarily contain? In this talk, we will be interested in spanning subgraphs of K_n that have bounded maximum degree or the total number of cherries, i.e., the paths on three vertices. We will also mention similar questions for hypergraphs, as well as analogous problems concerned with rainbow subgraphs in edge colorings of K_n, where the total number of appearances for each color is bounded. One of our main results confirms the following conjecture of Shearer from 1979: If G is an n-vertex graph with O(n) cherries and c is a coloring of E(K_n) such that at each vertex every color appears only constantly many times, then c contains a properly colored copy of G. The talk is based on a joint work with Nina Kamcev and Benny Sudakov. |

Title: Uncertainty Quantification and Numerical Analysis: Interactions and Synergies |
---|

Seminar: Numerical Analysis and Scientific Computing |

Speaker: Daniela Calvetti of Case Western Reserve University |

Contact: James Nagy, nagy@mathcs.emory.edu |

Date: 2017-02-24 at 1:00PM |

Venue: W301 |

Download Flyer |

Abstract:The computational costs of uncertainty quantification can be challenging, in particular when the problems are large or real time solutions are needed. Numerical methods appropriately modified can turn into powerful and efficient tools for uncertainty quantification. Conversely, state-of-the-art numerical algorithms reinterpreted from the perspective of uncertainty quantification can becomes much more powerful. This presentation will highlight the natural connections between numerical analysis and uncertainty quantification and illustrate the advantages of re-framing classical numerical analysis in a probabilistic setting. |

Title: Optical Design from Art to Car Mirrors |
---|

Seminar: N/A |

Speaker: Sarah Rody of Drexel University |

Contact: Bree Ettinger, bree.d.ettinger@emory.edu |

Date: 2017-02-24 at 3:00PM |

Venue: W201 |

Download Flyer |

Abstract:In order to design a mirror, we must first decide how to write the problem mathematically. I will start by looking at the historical use of perspective and mirrors in art. Then I will discuss how we can trace individual rays of light to describe how a mirror should work. I will show previous examples of optical design such as a non-reversing mirror and a panoramic mirror. Finally, I will turn to the specific example of a car mirror and show one optical design technique that I use. The standard passenger side mirror on a car has a limited field of view which results in a blind spot. Other mirrors, such as spherical mirrors, reduce the blind spot but distort the image. My goal is to find a construction for a passenger side mirror that reduces the blind spot and but creates less distortion than a spherical mirror. The idea central to our construction is the concept of an eigensurface. In general, if a surface is viewed in a curved mirror, it appears distorted. However, there could exist a surface that appears invariant in a particular curved mirror. I will show how I use this idea of eigensurfaces to find a mirror that could work as a passenger side car mirror. |

Title: Good and Bad Reduction of Dynatomic Modular Curves |
---|

Seminar: Algebra |

Speaker: Andrew Obus of University of Virginia |

Contact: David Zureick-Brown, dzb@mathcs.emory.edu |

Date: 2017-02-21 at 4:00PM |

Venue: W306 |

Download Flyer |

Abstract:The dynatomic modular curves parameterize one-parameter families of dynamical systems on $P^1$ along with periodic points (or orbits). These are analogous to the standard modular curves parameterizing elliptic curves with torsion points (or subgroups). For the family $x^2 + c$ of quadratic dynamical systems, the corresponding modular curves are smooth in characteristic zero. We give several results about when these curves have good/bad reduction to characteristic $p$, as well as when the reduction is irreducible. These results are motivated by uniform boundedness conjectures in arithmetic dynamics, which will be explained.\\ (This is joint work with John Doyle, Holly Krieger, Rachel Pries, Simon Rubinstein-Salzedo, and Lloyd West.) |

Title: Quantum Kostka and the rank on problem for $sl_{2m}$ |
---|

Seminar: Algebra |

Speaker: Natalie Hobson of University of Georgia |

Contact: David Zureick-Brown, dzb@mathcs.emory.edu |

Date: 2017-02-14 at 4:00PM |

Venue: W306 |

Download Flyer |

Abstract:In this talk we will define and explore an infinite family of vector bundles, known as vector bundles of conformal blocks, on the moduli space $M_{0,n}$ of marked curves. These bundles arise from data associated to a simple Lie algebra. We will show a correspondence (in certain cases) of the rank of these bundles with coefficients in the cohomology of the Grassmannian. This correspondence allows us to use a formula for computing "quantum Kostka" numbers and explicitly characterize families of bundles of rank one by enumerating Young tableaux. We will show these results and illuminate the methods involved. |