The Hagley Museum and Library recently finished digitizing Sperry-UNIVAC’s “Introduction to the Digital Computer.” It’s a 20 minute film which, in some ways, is still useful today for its presentation of foundational matters in computing. Link.
In an article on how cold war priorities in the development of computing affected the kinds of games that we now play on our post-cold war computers, [Peter Christiansen offers a series of “counterfactual” scenarios][pp]. E.g., what would computing now look like if, instead of being driven by the need to calculate ICBM missile trajectories, the Jacquard loom had continued to develop? Christiansen has a number of interesting sources:
> In his book _From Sun Tzu to Xbox_, Ed Halter (2006) makes a very convincing argument that many of the conventions in videogames that we take for granted can be traced back to constraints that were placed by many of the early developers of computing technology. As he notes, early computers like the ENIAC , with its stored memory and its binary language of ones and zeros, were created for purposes such as calculating ballistic tables.
Speaking of iPython, Fernando Perez gave a great talk at a Canadian PyCon in 2012 that outlines the relationship between science and computing. It’s a relationship that the humanities would do well to think about.
I’ve been embedding video regularly, and I thought I would give readers’ bandwidth a bit of a break with a link to [watch on Youtube](http://youtu.be/F4rFuIb1Ie4).
I love old product literature from the thirties, forties, fifties, and sixties. It’s partly the modernist design impulse; it’s partly the optimism about the future. Mix in the possibility of computation and you have the [Computer History Museum’s collection of brochures](http://www.computerhistory.org/brochures/decades.php).
You gotta love a university with a can-do spirit: [Indiana University has a home-built supercomputer][iu] that will do 1 petaflop. One petaflop was the computing sound barrier broken by IBM back in 2008, but there are still relatively few supercomputers capable of processing this much this fast. Why is its “home-built” nature so important? Because it isn’t beholding to any particular funding agency, which means it “will be used by IU, for IU to support IU’s activities in the arts, humanities, and sciences, and to support the economic development of Indiana — without any constraints from an outside funding agency.”
You know, I never realized how great it was to work at a place with a fundamental sense of its mission and that that mission bubbled out of an ethic of always trying to do the right thing until I was no longer at a place that worked that way. Oh, how I miss the Midwest…
I like Cory Doctorow’s principled, long view of things.
The Computer History Museum has a terrific (http://www.computerhistory.org/highlights/stevejobs/video/) in the late seventies, early eighties about computing. Nice work.
April 1 is international backup day, which seems like an odd day to choose. I think it would be better, if also equally unfortunate for those of who live in societies that celebrate April Fools, to mark it as open information, or open access, day. Today is the 200th birthday of Robert Bunsen, famous for his eponymous burner, which he chose not to patent and, in fact, pursued those who tried to patent it for themselves.
In celebration of open information day, I offer up this passage from Benjamin Franklin’s _Autobiography_ which details his refusal to patent the Franklin stove:
In order of time, I should have mentioned before, that having, in 1742, invented an open stove for the better warming of rooms, and at the same time saving fuel, as the fresh air admitted was warmed in entering, I made a present of the model to Mr. Robert Grace, one of my early friends, who, having an iron-furnace, found the casting of the plates for these stoves a profitable thing, as they were growing in demand.
To promote that demand, I wrote and published a pamphlet, entitled “An Account of the new-invented Pennsylvania Fireplaces; wherein their Construction and Manner of Operation is particularly explained; their Advantages above every other Method of warming Rooms demonstrated; and all Objections that have been raised against the Use of them answered and obviated,” etc.
This pamphlet had a good effect. Gov’r. Thomas was so pleas’d with the construction of this stove, as described in it, that he offered to give me a patent for the sole vending of them for a term of years; but I declin’d it from a principle which has ever weighed with me on such occasions, viz., That, as we enjoy great advantages from the inventions of others, we should be glad of an opportunity to serve others by any invention of ours; and this we should do freely and generously.
An ironmonger in London however, assuming a good deal of my pamphlet, and working it up into his own, and making some small changes in the machine, which rather hurt its operation, got a patent for it there, and made, as I was told, a little fortune by it. And this is not the only instance of patents taken out for my inventions by others, tho’ not always with the same success, which I never contested, as having no desire of profiting by patents myself, and hating disputes. The use of these fireplaces in very many houses, both of this and the neighbouring colonies, has been, and is, a great saving of wood to the inhabitants. (From Franklin’s Autobiography.)
And I also note that my colleague Jason Jackson and the team at Open Folklore have exciting news of their own.
A lovely history of IBM by Errol Morris with music by Philip Glass. Worth it for the archival film footage alone:
The influential computer-science text _Structure and Interpretation of Computer Programs_ by Abelson, Sussman, and Sussman is [available on-line](http://mitpress.mit.edu/sicp/), along with a range of teaching aids. Go MIT Press!
I am considering using some parts of the text to, at least, introduce the idea of computing, into my seminar surveying the digital humanities. I know I want to focus on some basic tools, including perhaps some exposure to Python, and, yes, there is always John Zelle’s [_Python Programming: An Introduction to Computer Science_](http://mcsp.wartburg.edu/zelle/python/) — which is still available for download in its 2002 incarnation [here](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.111.6062&rep=rep1&type=pdf) (careful, that’s a link to a 1.3MB PDF), but it’s nice to have options and to be able to offer students different explanations for the same concepts. (I know I need it when it comes to some aspects of computer science.)
Here is the [table of contents](http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-4.html).
A machine learning researcher, Danny Tarlow, has come up with a way to describe his problem in competitive scrabble in programming terms. [Here’s a link to the post][post], and here’s his rough description of the problem:
> As some of you know, I used to play Scrabble somewhat seriously. Most Tuesdays in middle school, I would go to the local scrabble club meetings and play 4 games against the best Scrabble players in the area (actually, it was usually 3 games, because the 4th game started past my bedtime). It’s not your family game of Scrabble: to begin to be competitive, you need to know all of the two letter words, most of the threes, and you need to have some familiarity with a few of the other high-priority lists (e.g., vowel dumps; short q, z, j, and x words; at least a few of the bingo stems). See here for a good starting point.
> Anyway, I recently went to the Toronto Scrabble Club meeting and had a great time. I think I’ll start going with more regularity. As a busy machine learning researcher, though, I don’t have the time or the mental capacity to memorize long lists of words anymore: for example, there are 972 legal three letter words and 3902 legal four letter words.
> So I’m looking for an alternative to memorization. Typically during play, there will be a board position that could yield a high-scoring word, but it requires that XXX or XXXX be a word. It would be very helpful if I could spend a minute or so of pen and paper computation time, then arrive at an answer like, “this is a word with 90% probability”. So what I really need is just a binary classifier that maps a word to probability of label “legal”.
> Problem description: In machine learning terms, it’s a somewhat unique problem (from what I can tell). We’re not trying to build a classifier that generalizes well, because the set of 3 (or 4) letter words is fixed: we have all inputs, and they’re all labeled. At first glance, you might think this is an easy problem, because we can just choose a model with high model capacity, overfit the training data, and be done. There’s no need for regularization if we don’t care about overfitting, right? Well, not exactly. By this logic, we should just use a nearest neighbors classifier; but in order for me to run a nearest neighbors algorithm in my head, I’d need to memorize the entire training set!
At some point, I really do need to figure out why our Windows 7 machine won’t sleep. (Yes, we have a Windows machine: it’s in our kitchen as a place for our daughter to do occasional bits of homework that require a computer, for all of us to look things up, for cooking with Pandora playing, and, yes, for me to play the occasional game.) When I get around to figuring things out, I should probably start [here](http://www.windowsbbs.com/windows-7/87612-windows-7-wont-sleep.html).
One of the applications to which we were introduced at the NEH Institute on Networks and Networking in the Humanities — which goes by the hash tag
nethums by the way — was a Carnegie-Mellon application called ORA. It and its companion application, AutoMap, are very useful tools for network analysis and visualization.
My difficulty with the applications was simply in getting them to run on my MacBook Pro. The problem was, is, that ORA, AutoMap, and their installers require an older version of Java than is included with Mac OS 10.6. With 10.6, Apple dropped the versions of Java 1.4 and 1.5 that they had been carrying and only provided 1.6. Java 1.4 is still available, but navigating Oracle’s site to get it, and getting it onto my MacBook was a longer road than I wanted to travel.
Now that I am back home, I got the good word that ORA had been updated. Great news! I headed over to the site only to learn that the Windows and Linux versions had been updated to version 2.2.2 but the Mac was still back at 1.6.9.
Two routes now lay open to me, if I wanted to run one of the newer versions on my Mac:
- Pick up a copy of VMWare Fusion or Parallels and run either Windows or Linux in a virtual machine, or
- Determine if there was a way to run the Linux application on Mac OS X (which is also a certified *nix now).
I had just spent a fair amount of money on corpus linguistics text — I’m working on refining a notion of “corpus folkloristics” — and so the idea of spending more money on virtualization software as well as for a copy of Windows is less than appealing. (I am already about to buy a copy of Windows 7 for our home desktop, but Microsoft offers now family pack the way Apple does, and so multiple copies of Windows is a little out of my price range for now.)
So, let’s go with the second option: run Linux apps on my Mac.
A page on Simple Help promised me a complete walkthrough of the process, the first step of which is getting Fink on my MacBook. (I had been using MacPorts before upgrading to 10.6, but the upgrade had broken it and so I was okay switching to Fink.)
Oops, no binary installer for 10.6. I was going to have to install it from source. Luckily, the Fink Project has a page up that walks you through installing from source. It does a pretty good job of getting you through everything, and it even tells you to run:
which would suggest to a command-line novice — I’m not quite a noob! — like me that, well, my path is going to be setup for me, which makes it all the more maddening when you enter:
and get the
command not recognized response. Uh oh. And so I double-checked my
and got all the usual suspects:
/sw/bin:/sw/sbin:/opt/local/bin:/opt/local/sbin: /usr/local/mysql/bin:/opt/local/bin:/opt/local/sbin: /usr/local/bin:/usr/local/subversion/bin:/usr/bin: /bin:/usr/sbin:/sbin:/usr/local/bin:/usr/X11/bin: /opt/local/bin:/usr/local/git/bin:/usr/X11R6/bin
What’s going on? I closed the terminal and started doing some reading up on editing my
PATH when I decided to double-check my work and ran
fink selfupdate again. What do you know, it worked! Here’s the trick: I forgot to follow the directions and open a new terminal window after the initial installation.
And so I taught myself to follow directions.
Adobe’s John Nack posted the following video on his blog revealing a new “Context Aware” healing/deletion functionality in PhotoShop CS5. I don’t do that much with PS that I typically need to upgrade — I only went from CS1 to CS3 for the Intel compatibility — but this new functionality, no, this new *magic* is amazing:
While I am writing about new forms of creativity, I would also like to point out this terrific [profile of UC Santa Cruz emeritus professor David Cope][profile]. Cope was the inventor of Emmy, Experiments in Musical Intelligence (EMI, or “Emmy”), which was well received by some but made others uncomfortable with the questions it raised about human creativity — the short answer for me is that all the formulas Cope entered into Emmy were clearly based on work done by humans, but I don’t know entirely how Emmy works. Cope is about to release a successor to Emmy, known as Emily Howell. Two compositions by Emily are included in the article. They make for an interesting listen.
[Emily Howell Sample Composition](http://blog.miller-mccune.com.s72010.gridserver.com/wp-content/uploads/podcast/emily_howell_1.mp3)