



Loading participant list in background...
Group Leaders TBA
Using data generated in past molecular modeling projects, participants will be encouraged to apply a range of machine learning and informatics techniques to analyze the data and build/optimize predictive models. Some prior models have been built with a hundred or so experimental data points, while other bimolecular models have utilized over 50,000 data points.
Through these exercises, participants will learn the applicability of varied machine learning methods to datasets of different sizes (both the number of data points and the length of feature vectors). In addition, best practices in cross-validation will be discussed, so as to give participants a sense of how to organize their data in a way that is most rigorous when existing relationships among the data points are known. It may be possible to include deep learning methods as well.

Group Leaders TBA
Group Leaders TBA
Deanna Needell (UCLA)
Group Leaders TBA
Group Leaders TBA
Large volumes of data, which are being collected for the purpose of knowledge extraction, have to be reliably, efficiently, and securely stored. Retrieval of large data files from storage has to be fast (and often anonymous and private). This project is concerned with big data storage and access, and its relevant mathematical disciplines include algebraic coding and queueing theory. Large-scale cloud data storage and distributed file systems, e.g., Amazon EBS and Google FS, have become the backbone of many applications such as web searching, e-commerce, and cluster computing.
Cloud services are implemented on top of a distributed storage layer that acts as a middleware to the applications, and also provides the desired content to the users, whose interests range from performing data analytics to watching movies. Coding theory has been essential in providing solutions for reliable, efficient, and secure telecommunications, but these solutions are inadequate when storing and moving very large files across networks is necessary. Many new deep problems that arise in such circumstances simultaneously belong to both fundamental coding and queueing theory, but have so far been mostly separately addressed.
Participants of this project will, according to their preferences regarding combinatorics, algebra and probability, learn about and work on some coding and/or queueing problems in the era of big data. The hope is that some would take interest in both of these interwoven and indispensable aspects of big data storage and access. Undergraduates are welcome.

Talks will be presented virtually or in-person as indicated in the schedule below.
University of St. Thomas
Middle East Technical University
Institute for Defense Analyses
University of Michigan
Willamette University
George Mason University
Spiceworks
University of Colorado Boulder
Rincon Research Corporation
University of Colorado Boulder
Boston College
Brown University
Goucher College
University of Alberta
Yale/YNHH Center for Outcomes Research and Evaluation
Baylor College of Medicine
Penn State University
IBM T. J. Watson Research Center
Harvard Univeristy
Rutgers University
University of Nebraska-Lincoln
Yonsei University
Brown University
Clemson University
California State University of Channel Islands
California State University, Channel Islands
Rutgers University
Colorado School of Mines
Jacksonville University
Claremont Graduate University
George Mason University
Clemson University
University of Nebraska - Lincoln
Brown University
Worcester Polytechnic Institute
Department of Defense
University of Wisconsin
UCLA
Rutgers University
Morehouse College
Lehman College, City University of New York
Montana State University
University of Washington
Rutgers University
Johns Hopkins University
Middle East Technical University
George Mason University
Wilfrid Laurier University
Princeton University
Claremont Graduate University
Amherst College
Macalester College