So, I was trying to read this paper, which referred a whole bunch to this PhD thesis, and the only related paper I could find was rather terse, and I figured I might as well go through the thesis. And this is a long thesis, and I got tired of all the math, especially with visiting a few people earlier, and arguing about stuff during hours, so I skip this section which I am assured is useless for most of the rest of the thesis, only to have to back track through half of it, some of the terse paper and such… Someone needs to make a better way to read these things, I should be able to double click and get DBLP or Google Scholar results. That being said, stochastic uncapacitated facility location problems don’t seem to throw many results anyways. Oh well, this was me generally complaining about the amount of backtracking theory papers seem to be requiring. That being said, I am working on fun stuff with CO, this could lead to some fun things.

Ze Panda

Me and Jacob were discussing possible languages to be included as a part of Wireshark’s mostly Turing complete filter language (Intercal and such were coming to mind), when we hit upon the idea of interpretive dancing as a language. Define a step to be the lambda operator, and everything else you can do is free and can be used as names to which you can bind stuff. So in essence any step can be bound to a combination of other steps, or to an expression beginning with lambda.

Thanks to Church and Turing, we know Lambda is all we need, and we suddenly have a fairly nice functional language based off of dancing. How does one program you ask, well look no further than Wiimotes, and DDR pads.

This could be amusingly bad, let your imagination wander around.

Ze Panda

Hi people of the internet (or the subset of those who read this) and more importantly the Gods, owners and legislators of this unlegislated land
While I am aware more important debates, such as ones concerning the ‘tubular nature of the internets’, the ongoing shift to IPV6, the failure of certain registrar’s and such is taking up your valuable time, is there anyway you could make it simpler to just kill the sound on webpages, you know, make a mutable thing for browsers, which affects plugins and such. I know this lowers some people’s advertising revenue, but it makes me less scared.

Also while we are at this, could those of you residing in MSR get the folks at Mono to implement a F# compiler for Mono, I like OCaml, and want to see this new child which emerges from it, but do not really want to go through the trouble of acquiring a Windows license from the folks who administer MSDN-AA licensing for Brown.

Thanks, that’s about it.

Ze Panda

Being not completely sure about freeing large chunks of memory successfully sucks, oh well. Also need to find ways of finding better lower bounds on my graph coloring algorithms, the current one gives a maximal lower bound of something like number of colors + 2, and hence without the greedy adjustment to the upper bound, it goes on to explore too much of the tree, not that it isn’t exploring too much of the trees already. I am not completely sure why I am doing this Combinatorial Optimization class, it makes me happy, but also keeps me up and such, much like 167/9 except it is so much earlier in the semester. Also it would be nice if this supposedly 64-bit machine supported more 64-bitness.

HTA application open today, and course numbers change in a bit, and I am not sure whether I should apply to be a HTA, or what I am taking next semester. The one GRE I am not sure about how to prepare for is a month and a half away, spring break is four weeks away, the summer is a little less than three months away, and senior year is 6 months away. With all the people I know who got into fancy grad school’s this year, I am not sure whether I should be celebrating the apparent fact that grad school’s do indeed accept people, or cowering in fright, apprehensive about being the only person not getting into everything. Oh well, back to work.

Ze Panda