SCS
Student
Seminar
Series
All SSS talks can be carried out either in person or through Zoom.
| Mon, Jan 16 | GHC 6501 | ||
| Fri, Jan 20 | NSH 3002 | ||
| Mon, Jan 23 | GHC 6501 | ||
| Fri, Jan 27 | NSH 3002 | ||
| Mon, Jan 30 | GHC 6501 | ||
| Fri, Feb 03 | NSH 3002 | ||
| Mon, Feb 06 | GHC 6501 | ||
| Fri, Feb 10 | NSH 3002 | ||
| Mon, Feb 13 | GHC 6501 | ||
| Fri, Feb 17 | NSH 3002 | ||
| Mon, Feb 20 | GHC 6501 | ||
| Fri, Feb 24 | NSH 3002 | ||
| Mon, Feb 27 | GHC 6501 | ||
| Mon, Mar 03 | GHC 6501 | ||
| Mon, Mar 06 | GHC 6501 | ||
| Mon, Mar 10 | GHC 6501 | Machine Knitting Program Semantics and Equivalence Presented by Jenny Lin
Abstract: Machine knitting is a well-established fabrication technique for complex soft objects, and both companies and researchers have developed tools for generating increasingly complex machine knitting programs. This increasing complexity has brought to the forefront a seemingly trivial question: how do we know whether a given program produces the correct object? A semantics approach to this problem requires mathematically characterizing the object made by a machine knitting program; however this is particularly difficult for knitting, which takes several continuous strands of yarn and manipulates them into many stable, interlocking loops. Existing representations for machine knitted objects are incomplete (do not cover the complete domain of machine knittable objects) or overly specific (do not account for symmetries and equivalences among knitting instruction sequences). In this talk, I present a formal semantics for knitout, a low-level Domain Specific Language for knitting machines. This is accomplished using labeled tangle, which extends concepts from knot theory to allow for a definition of equivalence that matches the intuition behind knit objects. This formalism allows for low-level program rewrites to be proven correct under topological equivalence, which in turn provides the foundation for high-level tasks such as machine-specific compilation and optimization. |
|
| Mon, Mar 13 | GHC 6501 | available | |
| Mon, Mar 13 | GHC 6501 | ||
| Fri, Mar 17 | NSH 3002 | ||
| Mon, Mar 20 | GHC 6501 | ||
| Fri, Mar 24 | NSH 3002 | ||
| Mon, Mar 27 | GHC 6501 | ||
| Fri, Mar 31 | NSH 3002 | ||
| Mon, Apr 03 | GHC 6501 | ||
| Fri, Apr 07 | NSH 3002 | ||
| Mon, Apr 10 | GHC 6501 | ||
| Fri, Apr 14 | NSH 3002 | ||
| Mon, Apr 17 | GHC 6501 | ||
| Fri, Apr 21 | NSH 3002 | ||
| Mon, Apr 24 | GHC 6501 | Mediation in Extensive-Form Games: Mechanism Design, Information Design, and Correlated Equilibria under a Unified Framework Presented by Brian Zhang
Abstract: Mechanism design, information design, and correlated equilibria are three problems that are usually treated separately in literature. Mechanism design is the problem faced by a principal attempting to *elicit* information from agents. Information design is the problem faced by a principal attempting to strategically *reveal* information to agents. Finally, correlated equilibria in games are distributions of strategy profiles from which no player has any incentive to deviate. In this talk, we introduce a unified framework under which these three problems are special cases. Under this framework, we show that polynomial-time algorithms exist under certain conditions, and we argue that the difference between (extensive-form) correlated equilibria and information design is that the former contains *privacy* constraints, prohibiting the principal from "leaking" information from one player to another. |
|
| Fri, Apr 28 | NSH 3002 | ||
| Mon, May 01 | GHC 6501 | ||
| Fri, May 05 | NSH 3002 | ||
| Mon, May 08 | GHC 6501 | ||
| Fri, May 12 | NSH 3002 | ||
| Mon, May 15 | GHC 6501 | ||
| Fri, May 19 | NSH 3002 |
The Student Seminar Series is an informal seminar for SCS graduate students to communicate ideas. Each meeting starts at noon and lasts 1 hour. Lunch is provided by the Computer Science Department (thanks to Debbie Cavlovich!). At each meeting, a different student speaker will give an informal, 40-minute talk about his/her research, followed by questions/suggestions/brainstorming. We try to attract people with a diverse set of interests, and encourage speakers to present at a very general, accessible level.
So why are we doing this and why take part? In the best case scenario, this will lead to some interesting cross-disciplinary work among people in different fields and people may get some new ideas about their research. In the worst case scenario, a few people will practice their public speaking and the rest get together for a free lunch.
2022Fall, 2022Spring, 2021Fall, 2021Spring, 2020Fall, 2020Spring, 2019Fall, 2019Spring, 2018Fall, 2018Spring, 2017Fall, 2017Spring, 2016Fall, 2016Spring, 2015Fall, 2015Spring, 2014Fall, 2014Spring, 2013Fall, 2013Spring, 2012Fall, 2012Spring, 2011Fall, 2011Spring, 2010Fall, 2010Spring, 2009Fall, 2009Spring, 2008Fall, 2008Spring, 2007Fall, 2007Spring, 2006Fall, 2006Spring, 2005Fall, 2005Spring, 2004Fall, 2004Spring, 2003Fall, 2003Spring, 2002Fall, 2002Spring, 2001Fall, 2001Spring, 2000Fall, 2000Spring, 1999Fall, 1999Spring, 1998Fall, 1998Spring,
Juncheng Yang, CSD