I have to decide how this should be spelt. I guess since there is no dispute on how to spell “anonymous”, it should be “anonymnity”.
Google agrees, as of this morning:
787 for anonymnity vs. 564 for anonynmity
That’s quite a tongue-twister. I just tried to say an-non-NIM-nity ten times and I failed thrice. 
UPDATE: Alex Tang points out in a comment that it should actually be “anonymity” (about 17,100,000 hits). Thanks!
AI Seminar 3:30pm, Tuesday Jan. 24, in Wean 5409
Title: Game theory, biology, and the binding game
Tommi Jaakkola
MIT CSAIL
http://people.csail.mit.edu/tommi/
Abstract:
Biological processes span across vastly different scales and necessarily have to be understood at multiple levels of abstraction. Towards clarifying the role that computation plays in such understanding, we have recently developed a class of game theoretic models for capturing coordinate operation of DNA binding regulators. Our work builds in part on the argument that the roles of various molecular interactions cannot be understood in isolation but that it is necessary to also capture the context provided by other mutually constraining processes. Our game theoretic model allocates proteins to neighborhoods of sites, and to sites themselves, in a resource constrained manner, while explicitly capturing coordinate and competitive relations among proteins with affinity to the site or region. We provide examples of known biological subsystems that are naturally translated into our framework, and illustrate predictions that can be derived from the model. The focus of the talk will be on mathematical foundations of the modeling approach and requires little or no biological background.
This is joint work with Luis Perez-Breva, Luis Ortiz, and Chen-Hsiang Yeang.
Speaker: Benoit Hudson
Time: Wednesday 12-1pm
Place: NSH 1507
Title: Time-Optimal Incremental Delaunay Refinement
Abstract:
Delaunay mesh refinement is widely used in scientific computing, because in practice it is fast. However, for about 10 years there were no time bounds on the technique faster than O(n^2). Indeed, many known algorithms exhibited quadratic-time behaviour in some bad cases that would occasionally be encountered in the wild. I will present the basic technique from Jim Ruppert’s 1995 paper, followed by the main ideas from Gary Miller SODA’04 paper that proves near-optimal time bounds. Time permitting, I will also touch on some more recent work Todd Phillips, Gary and I have done to extend the result to three (or more) dimensions.
