ALADDIN
CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Calendar
Seminars on Algorithms and Complexity Archives 2005-2006
Aladdin
About
Calendar
People
PROBEs
Workshops
Papers
Education
Related Activities
Corporate
Contact
 
Captcha
Outreach Roadshow
 2 - 8   O c t o b e r    2 0 0 5
Wednesday
October 5th
12:00 pm
NSH 1507
Lea Kissner, Carnegie Mellon University
Privacy-Preserving Set Operations
Theory Lunch
Thursday,
October 6
4:00 pm
PPB 300

Alan Frieze, Carnegie Mellon University
The game chromatic number of random graphs

PPB = Physical Plant Building

ACO Seminar
Friday
October 7th
1:30 pm
Room TBA
Michael Lejeune, Tepper School of Business, Carnegie Mellon University
Derivation of Country Risk Rating Systems Using Logical Analysis of Data
OR Seminar
Friday
October 7th
3:30 pm
Wean Hall 7220
Steve Vavasis Department of Computer Science, Cornell University
Near linear time solution of elliptic PDE's using support-graph preconditioners
(abstract)
ALADDIN/Theory Seminar
 2 5   S e p t e m b e r    -   1   O c t o b e r   2 0 0 5
Monday
September 26th
4:30 pm
DH 1212
Itay Neeman, Department of Mathematics, UCLA
Tutorial Part I: Finite state automata and monadic theories of ordinals
Special Logic Week
Tuesday
September 27th
4:30 pm
DH 1212
Itay Neeman, Department of Mathematics, UCLA
Tutorial Part II: Finite state automata and monadic theories of ordinals
Special Logic Week
Wednesday
September 28th
12:00 pm
NSH 1507
Vincent Conitzer, Carnegie Mellon University
Computational Aspects of (Iterated) Dominance, Nash Equilibrium, and What Lies In-Between
Theory Lunch
Wednesday
September 28th
4:30 pm
DH 1212
Itay Neeman, Department of Mathematics, UCLA
Tutorial Part III: Finite state automata and monadic theories of ordinals
Special Logic Week
Thursday
September 29th

* 3:00 pm *
PPB 300
Abie Flaxman, Carnegie Mellon University
Random Sampling Auctions

PPB = Physical Plant Building
ACO Seminar
Thursday
September 29th
4:30 pm
BH A53
Itay Neeman, Department of Mathematics, UCLA
PAL Colloquium: Finite state automata and monadic theories of ordinals
Special Logic Week
Friday
September 30th
1:30 pm
Room TBA
Zhaosong Lu, Department of Mathematical Sciences, Carnegie Mellon University
Large-Scale Semidefinite Programming via a Saddle Point Mirror-Prox Algorithm
OR Seminar
Friday
September 30th
4:30 pm
DH 1212
Itay Neeman, Department of Mathematics, UCLA
Tutorial Part IV: Finite state automata and monadic theories of ordinals
Special Logic Week
 1 8 - 2 4   S e p t e m b e r    2 0 0 5
Wednesday
September 21th
12:00 pm
NSH 1507
Maverick Woo, Carnegie Mellon University
A Tale of Two Simple Data Structures
Theory Lunch
Thursday
September 22nd
* 6:00 pm *
* DH 2210 *
Video Viewing: Breaking the Code
A television adaptation (1996) of Andrew Hodges' book Alan Turing: The Enigma.
ACO Seminar
Friday
September 23rd
3:30 pm
Wean Hall 7220
Stefano Leonardi, Visiting Faculty from Universita' di Roma "La Sapienza"
Cost-sharing mechanisms for Network Design (abstract)
ALADDIN/Theory Seminar
 1 1 - 1 7   S e p t e m b e r    2 0 0 5
Wednesday
September 14th
12:00 pm
NSH 1507
David Abraham, Carnegie Mellon University
Two-Sided Matching Markets with One-Sided Preferences
Theory Lunch
Thursday
September 15th
4:00 pm
PPB 300
Oleg Pikhurko, Carnegie Mellon University
How to solve a hypergraph Turan problem exactly?

PPB = Physical Plant Building
ACO Seminar
Friday
September 16th
2:00 pm
Tepper 259
John Turner, Tepper School of Business
Robust Solutions for Some Special Cases of the Resource-Constrained Project Scheduling Problem
Vineet Goyal, Tepper School of Business
Approximation Algorithms for Demand-Robust and Data-Robust Optimization Problems
OR Seminar
Friday
September 16th
3:30 pm
Wean Hall 7220
Ashish Goel, Stanford University
Algorithmic Self-Assembly: Models and Problems (abstract)
ALADDIN/Theory Seminar
 9 - 15   O c t o b e r    2 0 0 5
Wednesday
October 12th

12:00 pm
NSH 1507
Vineet Goyal, Carnegie Mellon University
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Theory Lunch
Friday
October 14th

1:30 pm
Room TBA
Fumei Lam, Massachusetts Institute of Technology
Traveling Salesman Path Problem
OR Seminar
 1 6 - 2 2   O c t o b e r    2 0 0 5
Monday
October 17th

12:00 noon
NSH 1507
Jure Leskovec, CALD - Carnegie Mellon University
Graphs Over Time: Densification Laws, Shrinking Diameters, Explanations And Realistic Generators
Machine Learning Lunchtime Chats
Wednesday
October 19th

1:30 pm
Tepper 151
Dorit Hochbaum, UC Berkeley
What do sport ranking, group decision making, multicriteria decisions, customer segmentation, medical prognosis and assessing bankruptcy risk have in common?
OR Seminar
Wednesday
October 19th

12:00 pm
NSH 1507
Nina Balcan, Carnegie Mellon University
Mechanism Design via Machine Learning
Theory Lunch
Thursday
October 20th

12:00 pm
WEH 5403
Ofer Neinman Hebrew University of Jerusalem
Embedding into $l_p$ with constant average distortion
ACO Seminar
Thursday
October 20th

4:00 pm
PPB 300
Tao Jiang, Miami University (Oxford, OH)
Anti-Ramsey and Canonical Ramsey type problems
ACO Seminar
Friday
October 21st

8:30 am to 5:30 pm
UC McConomy
FriezeFest 2005 ALADDIN Workshop
Saturday
October 22nd

8:30 am to 5:30 pm
UC McConomy
FriezeFest 2005 ALADDIN Workshop
 2 3 - 2 9   O c t o b e r    2 0 0 5
Monday
October 24th

12:00 noon
NSH 1507
Fernando De la Torre, RI - Carnegie Mellon University
Subspace Methods for Vision, Graphics and Signal Processing
Machine Learning Lunchtime Chats
Wednesday
October 26th

12:00 pm
NSH 1507
David S. Johnson, AT&T Labs - Research
Compressing Rectilinear Pictures, with Applications to the Internet
Theory Lunch
Thursday
October 27th

* 12:00 pm *
* WEH 5403 *
Dhruv Mubayi, University of Illinois, Chicago
On a conjecture of Berge and Simonovits on hypergraph products
ACO Seminar
Friday
October 28th

1:30 pm
Tepper 151
Dimitris Bertsimas, Massachusetts Institute of Technology
Robust and Adaptive Optimization: A Tractable Approach to Optimization under Uncertainty
OR Seminar
 3 0   O c t o b e r   -    5   N o v e m b e r   2 0 0 5
Wednesday
November 2nd

12:00 pm
* NSH 3305 *
Luis von Ahn
Thesis Defense: Human Computation

Theory Lunch
Friday
November 4th

Princeton University
CSD Room 105
Workshop on Flexible Network Design ALADDIN Workshop
Saturday
November 5th

Princeton University
CSD Room 105
Workshop on Flexible Network Design ALADDIN Workshop
 6 - 1 2   N o v e m b e r   2 0 0 5
Wednesday
November 9th

12:00 pm
NSH 1507
Andrew Gilpin
Finding equilibria in large sequential games of imperfect information
Theory Lunch
 1 3 - 1 9   N o v e m b e r   2 0 0 5
Thursday
November 17th
4:00 pm
PPB 300
Guido Schäfer, Technische Universität Berlin
Matching Algorithms are Fast in Sparse Random Graphs
ACO Seminar
Thursday
November 17th
4:00 pm
Scaife Hall 125
Pierre Moulin, UIUC
Steganography: Art or Science?
ECE Seminar Series
Friday
November 18th
1:30 pm
Tepper 259
Pierre Bonami, Tepper School of Business
An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
OR Seminar
 2 0 -  2 6   N o v e m b e r   2 0 0 5
Wednesday
November 23rd
Thanksgiving Holiday
No Classes
 
Thursday
November 24th
Thanksgiving Holiday
No Classes / University Offices Closed
 
Friday
November 25th
Thanksgiving Holiday
No Classes / University Offices Closed
 
 2 7   N o v e m b e r   -   3   D e c e m b e r   2 0 0 5
Wednesday
November 30th

12:00 pm
NSH 1507
Virginia Vassilevska, Carnegie Mellon University
Models of Greedy Algorithms
Theory Lunch
Friday
December 2nd
1:30 pm
Tepper 152
Bill Cunningham, University of Waterloo
3-Terminal Cuts and Linear Programming
OR Seminar
Friday
December 2nd
3:30 pm
Wean Hall 7220
Cliff Stein, Columbia University
Secure Network Coding via Filtered Secret Sharing
ALADDIN/
Theory Seminar
 4 - 1 0   D e c e m b e r  2 0 0 5
Wednesday
December 7th
12:00 pm
NSH 3305
Hubert Chan
Sparse Spanners for Doubling Metrics
Theory Lunch
Friday
December 9th
1:30pm
Room TBA
Francois Margot, Tepper School of Business
Code Construction with ILP
OR Seminar
 1 1 - 1 7   D e c e m b e r  2 0 0 5
December 14
Wednesday

12:00 pm
NSH 1305
Daniel Golovin
Strongly History Independent Hashing
Theory Lunch
 8 - 1 4   J a n u a r y   2 0 0 6
Friday
January 20th
1:30pm
Room TBA
Javier Pena, Tepper School of Business
TBA
OR Seminar
 1 5 - 2 1   J a n u a r y   2 0 0 6
Wednesday
January 18th
12:00 pm
NSH 1507
Benoit Hudson, Carnegie Mellon University
Time-Optimal Incremental Delaunay Refinement
Theory Lunch
Friday
January 20th
1:30 pm
Tepper 261
Javier Pena, Tepper School of Business
Semidefinite Programming Relaxations for Polynomial Optimization Problems
OR Seminar
 2 2 - 2 9    J a n u a r y   2 0 0 6
Wednesday
January 25th
12:00 pm
NSH 1507
Abie Flaxman, Carnegie Mellon University
Average-case analysis for combinatorial search and the subset sum problem
Theory Lunch
Friday
January 27th

*10:30am*
*SENSQ 5317*
Sanjeev Arora, Princeton University
Why NP got a new definition: the quest to understand the approximation properties of NP-hard optimization problems (announcement)
Pitt Distinguished Lecturer Series
 3 0   J a n u a r y   -   4   F e b r u a r y   2 0 0 6
Monday
January 30th

* 1:30 pm *
* Porter A19 *
Kelly Burgin, Carnegie Mellon University
Hamilton cycles in random graphs
ACO Seminar
Wednesday
February 1st
12:00 pm
NSH 1507
Adam Wierman, Carnegie Mellon University
Understanding the effects of SMART scheduling
Theory Lunch
Tuesday
February 2nd

4:00 pm
WEH 7500
Sanjit A. Seshia, University of California, Berkeley
Adaptive Eager Boolean Encoding for Arithmetic Reasoning in Verification
SCS Distinguished
Lecture Series
Friday
February 3rd

* 1:00 pm *
* CIC Lobby *
Carlos Gutierrez, US Department of Commerce Secretary
The Role of Innovation and Education in National Competitiveness

CIC = Collaborative Innovation Center
Office of Government Relations
Friday
February 3rd

3:30 pm
WEH 7220
Rohit Khandekar, Post-Doctoral Associate, University of Waterloo
Graph Partitioning Using Single Commodity Flows (abstract)
ALADDIN/Theory Seminar
 5 - 1 1   F e b r u a r y   2 0 0 6
Tuesday
February 7th

12:30 pm
NSH 1305
Todd Williamson, Senior Computer Scientist, ITA Software, Inc.
Look Before You Book: Computer Science in the Airline Industry
Special RI Seminar
Wednesday
February 8th
12:00 pm
NSH 1507
Todd Phillips, Carnegie Mellon University
Data Structures for Cellular Decompositions
Theory Lunch
Thursday
February 9th
4:00 pm
WEH 7500
Martin Abadi, Professor of Computer Science, UC Santa Cruz and Senior Researcher, Microsoft
Data Protection in Programming-Language Translations (abstract)
SCS Distinguished Lecture Series
Thursday
February 9th
4:00 pm
Posner 259
Teresa Sousa, Carnegie Mellon University
Dissertation Proposal: Decompositions of Graphs (abstract)
ACO Seminar
Friday
February 10th

1:30 pm
Tepper Room TBA
Anureet Saxena, Tepper School of Business
Optimizing Over the Split Closure
OR Seminars
Friday
February 10th

3:30 pm
WEH 7220
Alan Frieze, Carnegie Mellon University
Random Graphs (abstract)
ALADDIN/Theory Seminar
 1 2 - 1 8   F e b r u a r y   2 0 0 6
Wednesday
February 15th
12:00 pm
NSH 1507
Mohit Singh, Carnegie Mellon University
TBA
Theory Lunch
Friday
February 16th

1:30 pm
3305 NSH
Bert Zwart, Technische Eindhoven Universität
The Impact of Reneging in Processor Sharing Queues (abstract)
Faculty Candidate Talk
Friday
February 17th

1:30 pm
Tepper Room 151
Tallys Yunes, School of Business Administration, University of Miami
On the Integration of Optimization Techniques
OR Seminars
 1 9 - 2 5   F e b r u a r y   2 0 0 6
Monday
February 20th

1:30 pm
NSH 3305
Ryan O'Donnell, MIT/Microsoft Theory Group
Constraint Satisfaction and Property Testing (abstract)
Faculty Candidate Talk
Wednesday
February 22nd
12:00 pm
NSH 1507
Abie Flaxman, Carnegie Mellon University
Handy distributions for average-case anaylsis (abstract)
Theory Lunch
Thursday
February 23rd
4:00 pm
WEH 7500
Jennifer Rexford, Princeton University
Stable Internet Routing without Global Coordination (abstract)
SCS Distinguished Lecture Series
Friday
February 24th

* 3:30 pm *
* 2500 Posvar *
* UPitt * (map)
Thomas Hales, Mellon Professor, Department of Mathematics, University of Pittsburgh
Computers and the Future of Mathematical Proofs (abstract)
University of Pittsburgh Center for Philosophy of Science
 2 6   F e b r u a r y   -   5   M a r ch   2 0 0 6
Tuesday
February 28th

3:30 pm
WEH 5409
Partha Niyogi, University of Chicago
A Geometric Perspective on Learning Theory and Algorithms
AI Seminars
Wednesday
March 1st
12:00 pm
NSH 1507
Srinath Sridhar, Carnegie Mellon University
Parameterized Algorithms for Steiner Tree Variants (abstract)
Theory Lunch
Thursday
March 2nd
4:30 pm
PPB 300
Michael Krivelevich, Carnegie Mellon University
Discrepancy Games (abstract)
ACO Seminar
Friday
March 3rd
3:30 pm
WEH 7220
Seth Pettie, Max Planck Institut für Informatik
Low-distortion Graph Spanners (abstract)
ALADDIN/Theory Seminar
 5 - 1 1   M a r ch   2 0 0 6
Monday
March 6th

5:00 pm
WEH 6423
Jason Fulman, University of Pittsburgh
An Introduction to Stein's Method
 
Wednesday
March 8th
12:00 pm
NSH 1507
Mohammad Taghi Hajiaghayi, Carnegie Mellon University
Plane embeddings of planar graph metrics
Theory Lunch
Thursday
March 9th
4:30 pm
McConomy (UC)
David Haussler, UC Santa Cruz
Ultraconserved elements, living fossil transposons, and rapid bursts of change: reconstructing the uneven evolutionary history of the human genome (details)
Dickson Prize Lecture
Friday
March 10th
3:30 pm
WEH 7220
Ken Clarkson, Lucent Bell Labs
Approximating Surfaces with Meshes (abstract)
ALADDIN/Theory Seminar
 1 9 - 2 5    M a r ch   2 0 0 6
Wednesday
March 22nd
12:00 pm
NSH 1507
Jure Leskovec, Carnegie Mellon University
Realistic models for graphs over time (abstract)
Theory Lunch
Thursday
February 9th
4:00 pm
WEH 7500
Eric A. Brewer, Professor of Computer Science, UC Berkeley and Director, Intel Research Berkeley
Data The Case for Technology Research for Developing Regions (abstract)
SCS Distinguished Lecture Series
 2 6   M a r ch   -  1   A p r i l   2 0 0 6
Tuesday
March 28th
10:00 am
NSH 3305
Nir Ailon, Princeton University
New Algorithms for High-Dimensional, Inconsistent Datasets (abstract)
Faculty Candidate Talk
Wednesday
March 29th
12:00 pm
NSH 1507
Mugizi Rwebangira, Carnegie Mellon University
A Random-Surfer Web-Graph Model (abstract)
Theory Lunch
Friday
March 31st
1:30 pm
Tepper 388
Robert Weismantel, Otto-von-Guericke Universitaet Magdeburg
A Mixed Integer Linear Programming Approach for the Optimal Synthesis of Chemical Processes (abstract)
OR Seminar
Friday
March 31st
3:15 pm
Tepper
Mellon Aud.
Alok Aggarwal, CEO, EValueServe
Panel: Establishing Business Ventures in India - Opportunities and Challenges
India Business Conference 2006
 2  -  8   A p r i l  2 0 0 6
Monday
April 3rd
Early Registration and Hotel Deadline
MillerFest
ALADDIN Workshop
Monday
April 3rd
9, 10, & 11 am
Old Student Center 207
Gates Center Presentation
(Same presentation given each hour)
 
Monday
April 3rd
10:30 am
WEH 5320
Abraham Flaxman, Carnegie Mellon University
Thesis Defense: Average-case analysis for combinatorial problems
 
Monday
April 3rd
3:00 pm
NSH 3305
Rakesh Vohra, Northwestern University
Calibration, Regret and Learning in Games (abstract)
CALD Seminar
Monday
April 3rd
6:30 pm
Carnegie Museum Lecture Hall
Mack Scogin, Mack Scogin Merrill Elam Architects, Lead Architect for the Gates Center
School of Architecture Lecture Series
Wednesday
April 5th
12:00 pm
NSH 1507
Ryan Williams, Carnegie Mellon University
Using Linear Algebra for Faster Solution of NP-Hard Problems (abstract)
Theory Lunch
Thursday
April 6th
10:00 am
NSH 3305
Mohammad Mahdian, MIT/Microsoft Research
Theoretical Challenges in the Design of Advertisement Auctions (abstract)
Faculty Candidate Talk
Host: Avrim Blum
Thursday
April 6th
4:00 pm
WEH 7500
John C. Reynolds, Professor of Computer Science, Carnegie Mellon University
Dana Scott Distinguished Research Career Award Lecture: Toward A Grainless Semantics for Shared-Variable Concurrency (abstract)
SCS Distinguished Lecture Series
Friday
April 7th
Early Registration Deadline
Random Distance Run
 
Friday
April 7th
1:30 pm
Tepper 388
Mohit Tawarmalani, Krannert Graduate School of Management, Purdue University
Convex Extensions and Convexification of Nonlinear Sets (abstract)
OR Seminar
 9  -  1 5   A p r i l  2 0 0 6
Wednesday
April 12th
12:00 pm
NSH 1507
Varun Gupta, Carnegie Mellon University
A gentle introduction to fluid and diffusion limits for queues (abstract)
Theory Lunch
Thursday
April 13th

2:00 pm
WEH 7220
Chris Wang, Carnegie Mellon University
Thesis Proposal: Multi-Splay Trees (abstract and proposal)
 
Thursday
April 13th
4:30 pm
PPB 300
K. Subramani, West Virginia University
Chain Programming (abstract)
ACO Seminar
Friday
April 14th

1:30 pm
Tepper 388
María Auxilio Osorio, Computer Science Department, Benemérita Universidad Autónoma de Puebla
Post Tax Optimization (abstract)
OR Seminar
Friday
April 14th

3:30 pm
WEH 5409
Maverick Woo, Carnegie Mellon University
Thesis Proposal: Finger Search on Balanced Search Trees (abstract and proposal)
 
 1 6  -   2 2   A p r i l   2 0 0 6
Monday
April 17th
4:30 pm
DH 4303
David Kravitz, Carnegie Mellon University
Dissertation Defense: Satisfiability and the Giant Component in Online Variants of the Classical Random Models
 
Tuesday
April 18th
11:00 am
WEH 8220
Michael W. Mahoney, Yahoo Research
A relative-error CUR decomposition for matrices and its data applications (abstract)
 
Wednesday
April 19th
12:00 pm
NSH 1507
Doru-Christian Balcan, Carnegie Mellon University
Error Correcting by Linear Programming (abstract)
Theory Lunch
Wednesday
April 19th

6:30 pm - ?
Pittsburgh Athletic Assoc.
MillerFest Banquet
Registration is required.
ALADDIN Workshop
Thursday
April 20th

9:00 am - 4:30 pm
Giant Eagle Aud.
MillerFest Workshop
Registration is required.
ALADDIN Workshop
Friday
April 21st

1:30 pm
Simon Aud.
Andras Prékopa, Rutcor, Rutgers University
On the Relationship Between Probabilistic Constrained Stochastic, Disjunctive and Multiobjective Programming (abstract)
OR Seminar
 2 3  -  2 9   A p r i l   2 0 0 6
Wednesday
April 26th
12:00 pm
NSH 1507

Jonathan Derryberry, Carnegie Mellon University
Lower Bounds for the Binary Search Tree Model (abstract)

Theory Lunch
Friday
April 28th

1:30 pm
Tepper 388
Michel Goemans, MIT
Bounded-Degree Minimum Spanning Trees (abstract)
OR Seminar
Friday
April 28th

3:30 pm
WEH 7220
MohammadTaghi Hajiaghayi, Carnegie Mellon University
Auctions for dynamic environments: WiFi, last-minute tickets and grid computing (abstract)
ALADDIN/Theory Seminar
Friday
April 28th

4:45 pm
CMU Track
Fourth Annual Random Distance Run
The ENORMOUS FUZZY DICE are back and the weather is looking good!
Presented by DEC/5 and FreeCSD
 
 3 0   A p r i l   -   6   M a y   2 0 0 6
Wednesday
May 3rd

12:00 pm
NSH 1507
Kirk Pruhs, University of Pittsburgh
Cake Cutting Is and Is Not a Piece of Cake
Theory Lunch
 7  -  1 3   M a y   2 0 0 6
Wednesday
May 10th

12:00 pm
NSH 1507
Katrina Ligett, Carnegie Mellon University
Truthful, Near-Optimal Mechanism Design (abstract)
Theory Lunch
Friday
May 12th

2:00 pm
WEH 7220
Shuheng Zhou, Carnegie Mellon University
Edge Disjoint Paths in Moderately Connected Graphs
 
Friday
May 12th

3:30 pm
WEH 7220
Christopher Langmead, Carnegie Mellon University
Towards model checking of biological phenomena (abstract)
ALADDIN/Theory Seminar
 1 4  -  2 0   M a y   2 0 0 6
Wednesday
May 17th

12:00 pm
NSH 1507
Abie Flaxman, Carnegie Mellon University
Expansion and lack thereof in perturbed random graphs (abstract)
Theory Lunch
Thursday
May 18th

9:30 am
NSH 3305
CSD Black Friday - AI and Theory (schedule)  
Thursday
May 18th

1:30 pm
NSH 3305
CSD Black Friday - Systems (schedule)  
Friday
May 19th

10:00 am
NSH 3305
CSD Black Friday (schedule)  
Friday
May 19th

1:30 pm
Tepper 188
Summer Paper Proposals (abstracts) ACO Seminar
 2 1  -  2 7   M a y   2 0 0 6
Thursday
May 25th

5:00 pm
NSF Theoretical Foundations Proposal Deadline (details)  
 3 0  J u l y   -   5   A u g u s t   2 0 0 6
Thursday
August 3rd

3:00 pm
WEH 4625
Bjarni V. Halldorsson, Reykjavik University and DeCODE Genetics
Islands of tractability for Parsimony Haplotyping (abstract)
ALADDIN/Theory Seminar

 

Seminars on Algorithms and Complexity
Archives

 

This material is based upon work supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
National Science Foundation