Georgia Institute of Technology College of Sciences

Assuming some "compatibility" conditions between a Riemannian metric and a contact structure on a 3-manifold, it is natural to ask whether we can use methods in global geometry to get results in contact topology. There is a notion of compatibility in this context which relates convexity concepts in those geometries and is well studied concerning geometry questions, but is not exploited for topological questions. I will talk about "contact sphere theorem" due to Etnyre-Massot-Komendarczyk, which might be the most interesting result for contact topologists.

There is so much that the GT library can do for you, from providing research materials to assistance with data visualization to patent guidance. However, rather than trying to guess what you want from us, this year we asked! Based on the response to a short ranking survey I sent out last month, this session will cover: 1. How to find grants, fellowships, and travel money with the sponsorship database, Pivot. There are opportunities for postdocs and non US citizens too!2. How to use MathSciNet. We will cover navigating its classification index to actually getting the article you want. 3. How to find and download articles from our systems, Google Scholar, and from other libraries. And if we have time: 4. How to make a poster and cheaply print it.

Constrained low rank approximation is a general framework for data analysis, which usually has the advantage of being simple, fast, scalable and domain general. One of the most known constrained low rank approximation method is nonnegative matrix factorization (NMF). This research studies the design and implementation of several variants of NMF for text, graph and hybrid data analytics. It will address challenges including solving new data analytics problems and improving the scalability of existing NMF algorithms. There are two major types of matrix representation of data: feature-data matrix and similarity matrix. Previous work showed successful application of standard NMF for feature-data matrix to areas such as text mining and image analysis, and Symmetric NMF (SymNMF) for similarity matrix to areas such as graph clustering and community detection. In this work, a divide-and-conquer strategy is applied to both methods to improve their time complexity from cubic growth with respect to the reduced low rank to linear growth, resulting in DC-NMF and HierSymNMF2 method. Extensive experiments on large scale real world data shows improved performance of these two methods.Furthermore, in this work NMF and SymNMF are combined into one formulation called JointNMF, to analyze hybrid data that contains both text content and connection structure information. Typical hybrid data where JointNMF can be applied includes paper/patent data where there are citation connections among content and email data where the sender/receipts relation is represented by a hypergraph and the email content is associated with hypergraph edges. An additional capability of the JointNMF is prediction of unknown network information which is illustrated using several real world problems such as citation recommendations of papers and activity/leader detection in organizations.The dissertation also includes brief discussions of relationship among different variants of NMF.