February 2011


So one of the stories that circulated during the EVT/WOTE workshop last summer revolved around a presentation given by Ron Rivest at a special workshop on Uniformed and Overseas Citizens Absentee Voting Act (UOCAVA) in which he compared online voting to drunk driving. Today I saw that he has in fact posted the slides. Why the fuss? Apparently the default solution was to conduct voting for military personnel posted in say, Afghanistan, via the internet. There are a raft of security issues with this, as outlined in the slides. They are pretty amusing, except when you realize that they will probably do the voting over the internet thing anyway.

SACRA/PROFANA (dir. Krishan Oberoi) presents…

EX/CAN/DES/CENT*
*a. [L. excandescentia .] 1. Growing hot; white or glowing with heat

Saturday, February 19 · 7:00pm – 8:30pm
St. Peter’s Church
off of 15th St., Del Mar, CA
Sunday, February 20th at 4 p.m.
Village Community Presbyterian Church
6225 Paseo Delicias, Rancho Santa Fe

San Diego’s virtuosic vocal ensemble SACRA/PROFANA returns in a
program exploring themes of light and illumination. New works by young
American composers will be highlighted, including winners of the 2010
Choral Composition Contest. Also featuring music by Poulenc, Britten
and The Smashing Pumpkins, plus György Ligeti’s enigmatic choral
masterpiece “Lux Aeterna”.

15th Street Chamber Music says:”SACRA/PROFANA features some of the
premier young voices from all around San Diego and Southern California
and has a fresh new sound with a thrilling take on the art of choral
music.”

More information at: www.sacraprofana.org.

There is a $10 suggested donation at the door. Reserve seats are
available by emailing us at:
15thstreetchambermusic@gmail.com

Philosophers seem singularly unable to put asunder the aleatory and the epistemological side of probability. This suggests that we are in the grip of darker powers than are admitted into the positivist ontology. Something about the concept of probability precludes the separation which, Carnap thought, was essential to further progress. What?”

Ian Hacking, The Emergence of Probability, Cambridge : Cambridge UP, 1975.

I came down with the flu at the tail end of ITA, so I proceeded to fail at a bunch of things, like submitting reviews that were due, writing a submission for ISIT, and blogging the ITA Workshop in time. Cosma already blogged about his favorite talks, beating me to the punch.

I basically missed the first day because of technical glitches with our registration system, but once that was all resolved things went a bit more smoothly (at least I hope they did). The poster session seemed well-attended, and we shot videos of all the posters which will be posted at some point. Ofer did a great job arranging the Graduation Day and poster events. The thing about these conferences is that you end up wanting to talk to people you haven’t seen in a while, and it’s good to hammer out research ideas during the daytime, so I only made it to the keynote and Xiao-Li Meng’s tutorial on MCMC. I felt like I followed the tutorial at the beginning, but even Prof. Meng’s engaging speaking style lost me when it came to modeling something about stars (?). But there will be videos posted of the tutorials soon enough as well. I’ll probably make a post about those. For those who were at the entertainment program, of course the video for that was top priority. For the small number of those blog readers who wish to know what I was making:

  • 2 oz. Maker’s Mark bourbon
  • 1 oz. Carpano Antica formula vermouth
  • 1 dash Angostura bitters
  • 1 dash Regan’s No. 6 orange bitters

Shaken with ice, served up with a cherry. I opted for a bourbon Manhattan with a cherry rather than a rye Manhattan with an orange twist (or without garnish) because it was more convenient, and also more 1960s versus craft cocktail.

But on to the talks! I did manage to drag my lazy butt to some of them.

Improved rate-equivocation regions for secure cooperative communication
Ninoslav Marina, Hideki Yagi, H. Vincent Poor
They looked at a model where you have a transmitter and also a “blind” helper who is trying to help communicate over a wiretap channel. They show a better achievable rate-equivocation region by introducing another auxiliary random variable (big surprise!), but this doesn’t affect the best secrecy rate. So if you are willing to tolerate less than full equivocation at the eavesdropper then you’ll get an improvement.

Shannon’s inequality
S. Verdú, Princeton
Sergio talked about an alternative to Fano’s inequality used by Shannon:
P_e \ge \frac{1}{6} \frac{ H(X|Y) }{ \log M + \log \log M - \log H(X|Y) }
It was a nice talk, and the kind of talk I think is great at ITA. It’s not a new result, but ITA is a place where you can give a talk that explains some cool connection or new idea you have.

On the zero-error capacity threshold for deletion channels
Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jon Ullman
A nice piece of work on connecting zero-error capacity for deletion channels with longest common subsequences. The error model is adversarial. You can make a graph where each vertex is a length-n binary string, and connect two vertices if the two strings have a longest common subsequence of length at least (1 - p)n. If two strings are connected then they can’t be in the same code since an adversary could delete p n bits and create the common subsequence (note : not substring). So you can get a bound on the capacity by getting a bound on the largest independent set in this graph. So then you can use… Turan’s Theorem! Hooray! There are more results of course…

Data-driven decision making in healthcare systems
Mohsen Bayati, Stanford, Mark Braverman, U Toronto, Michael Gillam, Microsoft, Mark Smith, Medstart Health, and Eric Horvitz, Microsoft Research
This was a nice talk on doing feature selection via ideas from sparse signal processing/machine learning. The idea is to find a small set of features to help predict whether a patient is high-risk or low-risk for being readmitted soon after being discharged from the hospital. The idea is that the number of features is huge but the number of data points is small. They do an L1 penalized logistic regression and then derive a threshold based on the cost of doing an intervention (e.g. house-visits for high-risk patients).

Tracking climate models: advances in Climate Informatics
Claire Monteleoni, Columbia CCLS, Gavin A. Schmidt, NASA and Columbia, Shailesh Saroha, and Eva Asplund, Columbia Computer Science
This was an overview of Claire’s work on climate informatics. The basic problem was this : given several models (large-scale simulated systems based on PDEs etc. derived from physics) that predict future temperature, how should you combine them to produce more accurate predictions. She used some tools from her previous works on HMMs to get a system with better prediction accuracy.

On a question of Blackwell concerning hidden Markov chains
Ramon van Handel
The problem is trying to estimate the entropy rate of a process that is a function of a Markov chain (and hence not a Markov chain itself). “Does the conditional distribution of an ergodic hidden Markov chain possess a unique invariant measure?” This was a great talk for the Blackwell session because it started from a question posed by Blackwell and then revisited a few of his other works. Pretty amazing. Oh, and the paper (or one of them).

I think more talks will have to wait for another time (if ever).

The Solitudes (John Crowley) – The first book in the Aegypt Cycle, as recommended by Max. This book really blew my mind. I don’t really see it as “fantasy” but an expansive meditation on memory and history. It’s the first book in a 4-part series, and I’m looking forward to finishing the rest of the cycle.

Impossible Subjects: Illegal Aliens and the Making of Modern America (Mae M. Ngai) – a fascinating scholarly history of the idea of the “illegal immigrant” that provides a much needed context for our contemporary debate on the subject. Ngai shows how recent our notions of citizenship and immigration are vie the history of the debates and revisions of statues from the 19th and 20th centuries. Highly recommended.

The Toughest Indian in the World (Sherman Alexie) – a collection of short stories by one of the most famous contemporary Indian novelists. It surprised me and shocked me at times, but some of the stories and images really stuck with me. I haven’t read Alexie’s other collections so I don’t know how it compares.

The Human Use of Human Beings (Norbert Wiener) – Wiener’s general-audience book on cybernetics has lots of gems that I’ve been blogging here and there. I found it interesting because at the time his ideas were somewhat new, and now they either seem antiquated or have been absorbed into out “default” view of things.

Absurdistan (Gary Shteyngart) – A madcap farce involving a massively overweight and fabulously wealthy Russian Jew trying to muddle his way through a massively dysfunctional Central Asian nation. It’s over the top and some readers may not enjoy the narrator’s neuroses, but it was pretty funny, if raw.

Numbers Rule (George Szpiro) – This is another book on the history of voting and electoral apportioning schemes. Szpiro takes us chapter-by-chapter through famous figures in the history of voting — from Ramon Llull through the Marquis de Condorcet and Charles Dodgson to Kenneth Arrow. A very entertaining read, if less of a page-turner than Poundstone’s book. The sections on choosing the number of representatives for each state in the House is pretty fascinating.

Because I thrive on Too Much, I’m going to try to blog ITA in a timely fashion this year. Yeah, yeah, I know you’ve heard that one before. Perhaps Herr Doktor Professor Dimakis will grace us with his 2 drachmas as well?

For the information theorists, check out the mouseover text.

See you at ITA!

Follow

Get every new post delivered to your Inbox.

Join 865 other followers