Seminar Calendar
for events the day of Monday, March 28, 2011.

.
events for the
events containing

Questions regarding events or the calendar should be directed to Tori Corkery.
    February 2011            March 2011             April 2011
Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
1  2  3  4  5          1  2  3  4  5                   1  2
6  7  8  9 10 11 12    6  7  8  9 10 11 12    3  4  5  6  7  8  9
13 14 15 16 17 18 19   13 14 15 16 17 18 19   10 11 12 13 14 15 16
20 21 22 23 24 25 26   20 21 22 23 24 25 26   17 18 19 20 21 22 23
27 28                  27 28 29 30 31         24 25 26 27 28 29 30



Monday, March 28, 2011

Communications Seminar
3:00 pm   in 141 Coordinated Science Lab,  Monday, March 28, 2011
 Del Edit Copy
Submitted by seminar.
 Lav R. Varshney (IBM T. J. Watson Research Center)Malleable CodingAbstract: Reduce, reuse, recycle has become the mantra of the green age and suggests new ways of designing and operating information infrastructures like cloud computing. In this talk, I will present ongoing work on ways of reusing/recycling compressed information that we call malleable coding. A malleable coding scheme considers not only representation length but also ease of representation update, thereby encouraging some form of reuse or recycling to convert an old codeword into a new one. We examine the trade-off between compression efficiency and malleability cost, measured with a string edit distance that introduces a metric topology to the representation domain. We characterize the achievable rates and malleability as the solution of a subgraph isomorphism problem. A distinct formulation of malleable coding where part of an old codeword must be reused in forming the new codeword is also described and a single-letter information-theoretic expression for the achievable rate-malleability region is provided. Connections to the Gacs-Korner common information show that there is a fundamental tension between compression and reuse. Based on joint work with Julius Kusuma (Schlumberger Technology Corporation) and Vivek K Goyal (MIT).

Special Logic Seminar
4:00 pm   in 147 Altgeld Hall,  Monday, March 28, 2011
 Del Edit Copy
Submitted by w-henson.
 Francisco Rios (UIUC Math)Complete Categorical Equational DeductionAbstract: A categorical four-rule deduction system for equational logics developed by Grigore Roşu is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost.