In all the recent discussion of the h-index (my GSH is 11), it’s worth noting that we need some kind of normalization by community. As any one who’s ever written a paper in databases will tell you, it’s the best way of getting a HUGE citation count. Why ? Because the field is a lot bigger, and the odds are that many people will end up citing your work. For example, my most cited paper is an old piece of work for the WWW conference.
Maybe you could normalize the index by dividing by the maximum.
Via Chris Leonard, the FETCSWCHG:
If you know the difference between P and NP, and the difference between offsides and icing; if you can properly pronounce Dijkstra and Jagr, Euler and Roy — this is the page for you.With sufficient encouragement, we will acquire ice time for the First Ever Theoretical Computer Science World Cup Hockey Game. Please fill out the form below to help us organize this unprecedented and quite possibly unique event.
League Commissioner (but she really wants to coach): Catherine McGeoch, Amherst College ccm@cs.amherst.edu
President of the Players Union: Cliff Stein, Columbia University cliff@ieor.columbia.edu
President of the Players Intersection: Micah Adler, University of Massachusetts micah@cs.umass.edu
By now, everyone is probably aware of the fact that the arxiv supports trackbacks. In theoryCS (excluding the quantum folks), we don’t use the arxiv that much (with some notable exceptions), so this might not affect us greatly, but the physics bloggers are rather happy. It was interesting to read this at Cosmic Variance:
Most people these days post to the arxiv before they even send their paper to a journal, and some have stopped submitting to journals altogether. (I wish they all would, it would cut down on that annoying refereeing we all have to do.) And nobody actually reads the journals — they serve exclusively as ways to verify that your work has passed peer review.
Now that would be a neat model to adopt.
p.s I personally am not that enamored of trackbacks. Blogger doesn’t support them, trackback spam is rampant, and they can be cumbersome to use. Technorati “who links to me” pages are often more effective. But they do provide a (semi-)automatic comment mechanism that allows for discussions of papers to be carried out in the blogosphere, so it will be interesting to see how effective this is.
I was planning to be at KDD tomorrow to co-present a tutorial on data mining and graphics hardware, but as I am rapidly learning, man proposes and baby disposes ! In any case, if you are in the area, my very able co-conspirators Shankar Krishnan and Sudipto Guha will be pulling extra weight for me.
I am told that sleep is something that people do from time to time. I am further told that it is possible to sleep flat, on a structure called a mattress. If sleeping on mattresses is something you do on a regular basis, you might be interested in an amusing reflection on the group theory of mattress flipping.
(Via Ars Mathematica)
A somewhat forced vacation, caused by a 50% increase in family size (sometimes, constants DO matter !). While I recover, look over this set of recommendations on giving scientific talks, by Robert Geroch.
Whenever I see suggestions on how to use powerpoint effectively, I see these inane comments like “never use more than 6 words per slide” and what-not. For high signal-to-noise ratio presentations like at conferences, this hardly makes sense. The suggestions given above are remarkably intelligent, and are directed towards scientific talks. The fact that this was written in 1973 only goes to show that the principles of good public speaking are timeless.
For the last few hours, for reasons that I will not get into, I have been trying to track down bibtex entries for papers. Usually if the paper has an ACM DL entry, there is a bibtex entry that one can web-scrape, but for many papers (especially IEEE publications), this doesn’t work because IEEE doesn’t have bibtex entries on their website (and it’s harder to web-scrape them).
Most of the complication comes from the fact that often I have a title, and need to match it to an actual citation of some kind. Google Scholar is quite helpful in this regard, allowing me to search for a title and more often than not returning the ACM DL link to the paper (and BibTeX entry).
But the ACM doesn’t have everything, and this is where DOI numbers come in. The Document Object Identifier is a unique identifier that maps to a document entity, analogous to the URL for a web page. Similarly to a web page, the actual location of the document can be hidden from the user, and changed easily by the publisher, allowing for both portability and the ability to integrate a variety of sources. There is even a proxy server that you can supply a DOI number to; it returns the web page of the publisher that currently maintains that document.
What would be very cool would be a DOI to BibTeX converter. Note that a BibTeX entry maps to a single document, like a DOI. DOIs of course address a smaller space, since they govern only published work. If publishers exported some standard format (XML?), then it would be a trivial matter to write such a thing. Right now, all you get is the web page, from which you either have to scrape a bibtex, or construct one by hand. Neither options scales or is particularly appealing.
Anyone who’s ever sat through any theoryCS conference lunch/dinner knows that as the meal wears on, the probability that someone will make some silly joke about dining philosophers tends to one.
I am therefore gratified to see the possible emergence of another dining problem in a different community, in this case statistics:
2 groups of statisticians want to lunch together, but have managed to travel to 2 different restaurants. There is a third similar restaurant nearby. In fact the 3 restaurants are equidistant; it takes exactly 5 minutes to move from one to another. The statisticians have dashed to lunch without their cellphones, and don’t know the phone numbers for any of the restaurants, so they can’t communicate. Having a shocking faith in randomness, they have devised a technique for joining up. Each group will wait a random time–exponentially distributed with a mean of 5 minutes–and then move to another restaurant, selected randomly (of course) with a coin toss. They either meet, or repeat the process. What is the probability that one group will meet the other after moving only once?
The Pentagon’s new goal:
Fewer and fewer students are pursuing science and engineering. While immigrants are taking up the slack in many areas, defense laboratories and industries generally require American citizenship or permanent residency. So a crisis is looming, unless careers in science and engineering suddenly become hugely popular, said Robert J. Barker, an Air Force program manager who approved the grant. And what better way to get a lot of young people interested in science than by producing movies and television shows that depict scientists in flattering ways?
What better way ? Hmm, maybe you could (cough) (cough) give scientists some (cough) grant money ?
Tucked away in the Hollywood hills, an elite group of scientists from across the country and from a grab bag of disciplines – rocket science, nanotechnology, genetics, even veterinary medicine – has gathered this week to plot a solution to what officials call one of the nation’s most vexing long-term national security problems.Their work is being financed by the Air Force and the Army, but the Manhattan Project it ain’t: the 15 scientists are being taught how to write and sell screenplays.
Oh I see. So instead of encouraging scientists to write grants, we’ll get them to write $%$%$% screenplays. Admittedly, grant writing is an exercise in creative fiction, but to go this far ? And don’t you read blogs ?
There aren’t many stirring stories of heroic derring-do in which the protagonist saves the world and/or gets laid thanks to the well-timed development of a more efficient word processor file format translator. Sure, I’ve heard a few, but not many, and I doubt you’d want to hear them.
Oh and did I mention that Numb3rs will be back on the air Sep 9 ?
.
