<?xml version="1.0" encoding="iso-8859-1"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>[Lowerbounds, Upperbounds] &#187; Research</title>
	<atom:link href="http://magic.aladdin.cs.cmu.edu/category/grad-school/research/feed/" rel="self" type="application/rss+xml" />
	<link>http://magic.aladdin.cs.cmu.edu</link>
	<description>Algorithms are everywhere.</description>
	<lastBuildDate>Tue, 23 Dec 2008 19:58:45 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9-rare</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>CMU&#8217;s WebVPN Proxy</title>
		<link>http://magic.aladdin.cs.cmu.edu/2008/04/05/cmus-webvpn-proxy/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2008/04/05/cmus-webvpn-proxy/#comments</comments>
		<pubDate>Sat, 05 Apr 2008 18:12:56 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/?p=506</guid>
		<description><![CDATA[I think this would be worth mentioning for my CMU fellows:
As you know we have campus-wide subscriptions to many web services, like the ACM Digital Library and Elsevier&#8217;s &#8220;ScienceDirect&#8221;. But if you are off-campus, then understandably you cannot take advantage of such subscriptions. There was a time when all you could do was to ssh [...]]]></description>
			<content:encoded><![CDATA[<p>I think this would be worth mentioning for my CMU fellows:</p>
<p>As you know we have campus-wide subscriptions to many web services, like the ACM Digital Library and Elsevier&#8217;s &#8220;ScienceDirect&#8221;. But if you are off-campus, then understandably you cannot take advantage of such subscriptions. There was a time when all you could do was to ssh into a campus machine followed by, say, a wget+scp dance. But these days you can also use the &#8220;<a href="https://www.vpn.cmu.edu/">WebVPN service</a>&#8220;, which is I find to be a lot more convenient, and direct.</p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2008/04/05/cmus-webvpn-proxy/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bibliometrics in ACM Digital Library</title>
		<link>http://magic.aladdin.cs.cmu.edu/2008/04/04/bibliometrics-in-acm-digital-library/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2008/04/04/bibliometrics-in-acm-digital-library/#comments</comments>
		<pubDate>Fri, 04 Apr 2008 07:39:27 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/?p=505</guid>
		<description><![CDATA[I just noticed that the ACM Digital Library have started to prominently display &#8220;Bibliometrics&#8221; for each of its articles. Currently, we get the number of downloads in the last 6 weeks and last 12 months, as well as the number of citations. The last of which was available before, but you had to go further [...]]]></description>
			<content:encoded><![CDATA[<p>I just noticed that the ACM Digital Library have started to prominently display &#8220;Bibliometrics&#8221; for each of its articles. Currently, we get the number of downloads in the last 6 weeks and last 12 months, as well as the number of citations. The last of which was available before, but you had to go further down into the page.</p>
<p>In case you want a quick link to see, here is Bob Tarjan&#8217;s classic <a href="http://doi.acm.org/10.1145/321879.321884">Efficiency of a Good But Not Linear Set Union Algorithm</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2008/04/04/bibliometrics-in-acm-digital-library/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>I have written you a long paper&#8230;</title>
		<link>http://magic.aladdin.cs.cmu.edu/2006/01/09/i-have-written-you-a-long-paper/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2006/01/09/i-have-written-you-a-long-paper/#comments</comments>
		<pubDate>Mon, 09 Jan 2006 15:20:34 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Inspirational]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/?p=241</guid>
		<description><![CDATA[Roy Levin, a friendly CMU alum, told us a story a couple weeks ago:
A job applicant was asked to write a 10-page description of a project he previously participated. The documentation of that project was well over a thousand pages and so he said there was no way to describe it in 10 pages&#8230; (The [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://research.microsoft.com/users/roylevin/">Roy Levin</a>, a friendly CMU alum, told us a story a couple weeks ago:</p>
<p>A job applicant was asked to write a 10-page description of a project he previously participated. The documentation of that project was well over a thousand pages and so he said there was no way to describe it in 10 pages&#8230; (The rest is history. <img src='http://magic.aladdin.cs.cmu.edu/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> )</p>
<p>Then Roy offered the following wisdom: </p>
<p>In a field that prides itself with the very idea of <em>abstractions</em>, everything can be explained in 10 pages. In fact, everything can be explained in one page. Good authors abstract the material to an appropriate level.</p>
<p>I suppose everyone agrees with his advice, but I wasn&#8217;t fully aware of that property of my field until he said it. I could have been doing it subconsciously before, but I do it consciously from that day on.</p>
<p>Yet it takes time and skill to do the abstraction right. I&#8217;ve seen positive and negative examples. In this regard, I remember a quote from <a href="http://www.google.com/search?q=pascal+mark+twain+%22long+letter%22+%22short+letter%22">Mark Twain, or Blaise Pascal, or really, Google</a>: </p>
<blockquote><p>I have written you a long letter because I did not have time to write a short one.</p></blockquote>
<p>Some days I need to keep screaming in my head: I can explain this lucidly in 10 pages!</p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2006/01/09/i-have-written-you-a-long-paper/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Principles of Effective Research by Michael Nielsen</title>
		<link>http://magic.aladdin.cs.cmu.edu/2005/08/06/principles-of-effective-research/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2005/08/06/principles-of-effective-research/#comments</comments>
		<pubDate>Sat, 06 Aug 2005 18:18:31 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Inspirational]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/2005/06/23/98/</guid>
		<description><![CDATA[http://www.qinfo.org/people/nielsen/blog/?p=120

The philosophy underlying the essay is based on a famous quote attributed to Aristotle: “We are what we repeatedly do. Excellence, then, is not an act but a habit.&#8217;’ Underlying all our habits are models (often unconscious) of how the world works.

Thanks to Aristotle, and Nielsen.  
]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.qinfo.org/people/nielsen/blog/?p=120">http://www.qinfo.org/people/nielsen/blog/?p=120</a></p>
<blockquote><p>
The philosophy underlying the essay is based on a famous quote attributed to Aristotle: “We are what we repeatedly do. Excellence, then, is not an act but a habit.&#8217;’ Underlying all our habits are models (often unconscious) of how the world works.
</p></blockquote>
<p>Thanks to Aristotle, and Nielsen. <img src='http://magic.aladdin.cs.cmu.edu/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> </p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2005/08/06/principles-of-effective-research/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>You and Your Research</title>
		<link>http://magic.aladdin.cs.cmu.edu/2005/07/26/you-and-your-research/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2005/07/26/you-and-your-research/#comments</comments>
		<pubDate>Tue, 26 Jul 2005 19:23:02 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Inspirational]]></category>
		<category><![CDATA[Local Copy]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/?p=125</guid>
		<description><![CDATA[Note: it seeems that the web has no lack of copies of this excellent talk. This one is copied from http://www.cs.virginia.edu/~robins/YouAndYourResearch.html. A PDF version is available at http://www.ocf.berkeley.edu/~wwu/readordie/hamming.pdf and here is a local copy.
This talk really makes me think a lot&#8230; but&#8230;

Richard Hamming

&#8220;You and Your Research&#8221;

Transcription of the Bell Communications Research Colloquium
Seminar 7 March 1986 [...]]]></description>
			<content:encoded><![CDATA[<p><em>Note: it seeems that the web has no lack of copies of this excellent talk. This one is copied from <a href="http://www.cs.virginia.edu/~robins/YouAndYourResearch.html">http://www.cs.virginia.edu/~robins/YouAndYourResearch.html</a>. A PDF version is available at <a href="http://www.ocf.berkeley.edu/~wwu/readordie/hamming.pdf">http://www.ocf.berkeley.edu/~wwu/readordie/hamming.pdf</a> and here is a <a href='/wp-uploads/hamming.pdf' title='Richard Hamming - You and Your Research'>local copy</a>.</p>
<p>This talk really makes me think a lot&#8230; but&#8230;</em></p>
<p><center><br />
Richard Hamming</center><br />
<center><br />
&#8220;You and Your Research&#8221;</center><br />
<center></p>
<p align=center>Transcription of the <br />Bell Communications Research Colloquium<br />
Seminar <br />7 March 1986 </p>
<p></center><br />
<span id="more-125"></span><br />
<center></p>
<p align=center>J. F. Kaiser <br />Bell Communications Research <br />445 South<br />
Street <br />Morristown, NJ 07962-1910 <br /><a href="mailto:jfk@bellcore.com">jfk@bellcore.com</a> </p>
<p></center></p>
<p>At a seminar in the Bell Communications Research Colloquia Series, Dr.<br />
Richard W. Hamming, a Professor at the Naval Postgraduate School in Monterey,<br />
California and a retired Bell Labs scientist, gave a very interesting and<br />
stimulating talk, &#8220;You and Your Research&#8221; to an overflow audience of some 200<br />
Bellcore staff members and visitors at the Morris Research and Engineering<br />
Center on March 7, 1986. This talk centered on Hamming&#8217;s observations and<br />
research on the question &#8220;Why do so few scientists make significant<br />
contributions and so many are forgotten in the long run?&#8221; From his more than<br />
forty years of experience, thirty of which were at Bell Laboratories, he has<br />
made a number of direct observations, asked very pointed questions of scientists<br />
about what, how, and why they did things, studied the lives of great scientists<br />
and great contributions, and has done introspection and studied theories of<br />
creativity. The talk is about what he has learned in terms of the properties of<br />
the individual scientists, their abilities, traits, working habits, attitudes,<br />
and philosophy. </p>
<p>In order to make the information in the talk more widely available, the tape<br />
recording that was made of that talk was carefully transcribed. This<br />
transcription includes the discussions which followed in the question and answer<br />
period. As with any talk, the transcribed version suffers from translation as<br />
all the inflections of voice and the gestures of the speaker are lost; one must<br />
listen to the tape recording to recapture that part of the presentation. While<br />
the recording of Richard Hamming&#8217;s talk was completely intelligible, that of<br />
some of the questioner&#8217;s remarks were not. Where the tape recording was not<br />
intelligible I have added in parentheses my impression of the questioner&#8217;s<br />
remarks. Where there was a question and I could identify the questioner, I have<br />
checked with each to ensure the accuracy of my interpretation of their remarks.
</p>
<p><b>INTRODUCTION OF DR. RICHARD W. HAMMING</b> </p>
<p>As a speaker in the Bell Communications Research Colloquium Series, Dr.<br />
Richard W. Hamming of the Naval Postgraduate School in Monterey, California, was<br />
introduced by Alan G. Chynoweth, Vice President, Applied Research, Bell<br />
Communications Research. </p>
<p><i>Alan G. Chynoweth:</i> Greetings colleagues, and also to many of our<br />
former colleagues from Bell Labs who, I understand, are here to be with us today<br />
on what I regard as a particularly felicitous occasion. It gives me very great<br />
pleasure indeed to introduce to you my old friend and colleague from many many<br />
years back, Richard Hamming, or Dick Hamming as he has always been know to all<br />
of us. </p>
<p>Dick is one of the all time greats in the mathematics and computer science<br />
arenas, as I&#8217;m sure the audience here does not need reminding. He received his<br />
early education at the Universities of Chicago and Nebraska, and got his Ph.D.<br />
at Illinois; he then joined the Los Alamos project during the war. Afterwards,<br />
in 1946, he joined Bell Labs. And that is, of course, where I met Dick &#8211; when I<br />
joined Bell Labs in their physics research organization. In those days, we were<br />
in the habit of lunching together as a physics group, and for some reason this<br />
strange fellow from mathematics was always pleased to join us. We were always<br />
happy to have him with us because he brought so many unorthodox ideas and views.<br />
Those lunches were stimulating, I can assure you. </p>
<p>While our professional paths have not been very close over the years,<br />
nevertheless I&#8217;ve always recognized Dick in the halls of Bell Labs and have<br />
always had tremendous admiration for what he was doing. I think the record<br />
speaks for itself. It is too long to go through all the details, but let me<br />
point out, for example, that he has written seven books and of those seven books<br />
which tell of various areas of mathematics and computers and coding and<br />
information theory, three are already well into their second edition. That is<br />
testimony indeed to the prolific output and the stature of Dick Hamming. </p>
<p>I think I last met him &#8211; it must have been about ten years ago &#8211; at a rather<br />
curious little conference in Dublin, Ireland where we were both speakers. As<br />
always, he was tremendously entertaining. Just one more example of the<br />
provocative thoughts that he comes up with: I remember him saying, &#8220;There are<br />
wavelengths that people cannot see, there are sounds that people cannot hear,<br />
and maybe computers have thoughts that people cannot think.&#8221; Well, with Dick<br />
Hamming around, we don&#8217;t need a computer. I think that we are in for an<br />
extremely entertaining talk. </p>
<p><b>THE TALK: &#8220;You and Your Research&#8221; by Dr. Richard W. Hamming</b> </p>
<p>It&#8217;s a pleasure to be here. I doubt if I can live up to the Introduction. The<br />
title of my talk is, &#8220;You and Your Research.&#8221; It is not about managing<br />
research, it is about how you individually do your research. I could give a talk<br />
on the other subject &#8211; but it&#8217;s not, it&#8217;s about you. I&#8217;m not talking about<br />
ordinary run-of-the-mill research; I&#8217;m talking about great research. And for the<br />
sake of describing great research I&#8217;ll occasionally say Nobel-Prize type of<br />
work. It doesn&#8217;t have to gain the Nobel Prize, but I mean those kinds of things<br />
which we perceive are significant things. Relativity, if you want, Shannon&#8217;s<br />
information theory, any number of outstanding theories &#8211; that&#8217;s the kind of<br />
thing I&#8217;m talking about. </p>
<p>Now, how did I come to do this study? At Los Alamos I was brought in to run<br />
the computing machines which other people had got going, so those scientists and<br />
physicists could get back to business. I saw I was a stooge. I saw that although<br />
physically I was the same, they were different. And to put the thing bluntly, I<br />
was envious. I wanted to know why they were so different from me. I saw Feynman<br />
up close. I saw Fermi and Teller. I saw Oppenheimer. I saw Hans Bethe: he was my<br />
boss. I saw quite a few very capable people. I became very interested in the<br />
difference between those who do and those who might have done. </p>
<p>When I came to Bell Labs, I came into a very productive department. Bode was<br />
the department head at the time; Shannon was there, and there were other people.<br />
I continued examining the questions, &#8220;Why?&#8221; and &#8220;What is the difference?&#8221; I<br />
continued subsequently by reading biographies, autobiographies, asking people<br />
questions such as: &#8220;How did you come to do this?&#8221; I tried to find out what are<br />
the differences. And that&#8217;s what this talk is about. </p>
<p>Now, why is this talk important? I think it is important because, as far as I<br />
know, each of you has one life to live. Even if you believe in reincarnation it<br />
doesn&#8217;t do you any good from one life to the next! Why shouldn&#8217;t you do<br />
significant things in this one life, however you define significant? I&#8217;m not<br />
going to define it &#8211; you know what I mean. I will talk mainly about science<br />
because that is what I have studied. But so far as I know, and I&#8217;ve been told by<br />
others, much of what I say applies to many fields. Outstanding work is<br />
characterized very much the same way in most fields, but I will confine myself<br />
to science. </p>
<p>In order to get at you individually, I must talk in the first person. I have<br />
to get you to drop modesty and say to yourself, &#8220;Yes, I would like to do<br />
first-class work.&#8221; Our society frowns on people who set out to do really good<br />
work. You&#8217;re not supposed to; luck is supposed to descend on you and you do<br />
great things by chance. Well, that&#8217;s a kind of dumb thing to say. I say, why<br />
shouldn&#8217;t you set out to do something significant. You don&#8217;t have to tell other<br />
people, but shouldn&#8217;t you say to yourself, &#8220;Yes, I would like to do something<br />
significant.&#8221; </p>
<p>In order to get to the second stage, I have to drop modesty and talk in the<br />
first person about what I&#8217;ve seen, what I&#8217;ve done, and what I&#8217;ve heard. I&#8217;m<br />
going to talk about people, some of whom you know, and I trust that when we<br />
leave, you won&#8217;t quote me as saying some of the things I said. </p>
<p>Let me start not logically, but psychologically. I find that the major<br />
objection is that people think great science is done by luck. It&#8217;s all a matter<br />
of luck. Well, consider Einstein. Note how many different things he did that<br />
were good. Was it all luck? Wasn&#8217;t it a little too repetitive? Consider Shannon.<br />
He didn&#8217;t do just information theory. Several years before, he did some other<br />
good things and some which are still locked up in the security of cryptography.<br />
He did many good things. </p>
<p>You see again and again, that it is more than one thing from a good person.<br />
Once in a while a person does only one thing in his whole life, and we&#8217;ll talk<br />
about that later, but a lot of times there is repetition. I claim that luck will<br />
not cover everything. And I will cite Pasteur who said, &#8220;Luck favors the<br />
prepared mind.&#8221; And I think that says it the way I believe it. There is indeed<br />
an element of luck, and no, there isn&#8217;t. The prepared mind sooner or later finds<br />
something important and does it. So yes, it is luck. The particular thing you do<br />
is luck, but that you do something is not. </p>
<p>For example, when I came to Bell Labs, I shared an office for a while with<br />
Shannon. At the same time he was doing information theory, I was doing coding<br />
theory. It is suspicious that the two of us did it at the same place and at the<br />
same time &#8211; it was in the atmosphere. And you can say, &#8220;Yes, it was luck.&#8221; On<br />
the other hand you can say, &#8220;But why of all the people in Bell Labs then were<br />
those the two who did it?&#8221; Yes, it is partly luck, and partly it is the<br />
prepared mind; but &#8216;partly&#8217; is the other thing I&#8217;m going to talk about. So,<br />
although I&#8217;ll come back several more times to luck, I want to dispose of this<br />
matter of luck as being the sole criterion whether you do great work or not. I<br />
claim you have some, but not total, control over it. And I will quote, finally,<br />
Newton on the matter. Newton said, &#8220;If others would think as hard as I did,<br />
then they would get similar results.&#8221; </p>
<p>One of the characteristics you see, and many people have it including great<br />
scientists, is that usually when they were young they had independent thoughts<br />
and had the courage to pursue them. For example, Einstein, somewhere around 12<br />
or 14, asked himself the question, &#8220;What would a light wave look like if I went<br />
with the velocity of light to look at it?&#8221; Now he knew that electromagnetic<br />
theory says you cannot have a stationary local maximum. But if he moved along<br />
with the velocity of light, he would see a local maximum. He could see a<br />
contradiction at the age of 12, 14, or somewhere around there, that everything<br />
was not right and that the velocity of light had something peculiar. Is it luck<br />
that he finally created special relativity? Early on, he had laid down some of<br />
the pieces by thinking of the fragments. Now that&#8217;s the necessary but not<br />
sufficient condition. All of these items I will talk about are both luck and not<br />
luck. </p>
<p>How about having lots of &#8216;brains?&#8217; It sounds good. Most of you in this room<br />
probably have more than enough brains to do first-class work. But great work is<br />
something else than mere brains. Brains are measured in various ways. In<br />
mathematics, theoretical physics, astrophysics, typically brains correlates to a<br />
great extent with the ability to manipulate symbols. And so the typical IQ test<br />
is apt to score them fairly high. On the other hand, in other fields it is<br />
something different. For example, Bill Pfann, the fellow who did zone melting,<br />
came into my office one day. He had this idea dimly in his mind about what he<br />
wanted and he had some equations. It was pretty clear to me that this man didn&#8217;t<br />
know much mathematics and he wasn&#8217;t really articulate. His problem seemed<br />
interesting so I took it home and did a little work. I finally showed him how to<br />
run computers so he could compute his own answers. I gave him the power to<br />
compute. He went ahead, with negligible recognition from his own department, but<br />
ultimately he has collected all the prizes in the field. Once he got well<br />
started, his shyness, his awkwardness, his inarticulateness, fell away and he<br />
became much more productive in many other ways. Certainly he became much more<br />
articulate. </p>
<p>And I can cite another person in the same way. I trust he isn&#8217;t in the<br />
audience, i.e. a fellow named Clogston. I met him when I was working on a<br />
problem with John Pierce&#8217;s group and I didn&#8217;t think he had much. I asked my<br />
friends who had been with him at school, &#8220;Was he like that in graduate<br />
school?&#8221; &#8220;Yes,&#8221; they replied. Well I would have fired the fellow, but J. R.<br />
Pierce was smart and kept him on. Clogston finally did the Clogston cable. After<br />
that there was a steady stream of good ideas. One success brought him confidence<br />
and courage. </p>
<p>One of the characteristics of successful scientists is having courage. Once<br />
you get your courage up and believe that you can do important problems, then you<br />
can. If you think you can&#8217;t, almost surely you are not going to. Courage is one<br />
of the things that Shannon had supremely. You have only to think of his major<br />
theorem. He wants to create a method of coding, but he doesn&#8217;t know what to do<br />
so he makes a random code. Then he is stuck. And then he asks the impossible<br />
question, &#8220;What would the average random code do?&#8221; He then proves that the<br />
average code is arbitrarily good, and that therefore there must be at least one<br />
good code. Who but a man of infinite courage could have dared to think those<br />
thoughts? That is the characteristic of great scientists; they have courage.<br />
They will go forward under incredible circumstances; they think and continue to<br />
think. </p>
<p>Age is another factor which the physicists particularly worry about. They<br />
always are saying that you have got to do it when you are young or you will<br />
never do it. Einstein did things very early, and all the quantum mechanic<br />
fellows were disgustingly young when they did their best work. Most<br />
mathematicians, theoretical physicists, and astrophysicists do what we consider<br />
their best work when they are young. It is not that they don&#8217;t do good work in<br />
their old age but what we value most is often what they did early. On the other<br />
hand, in music, politics and literature, often what we consider their best work<br />
was done late. I don&#8217;t know how whatever field you are in fits this scale, but<br />
age has some effect. </p>
<p>But let me say why age seems to have the effect it does. In the first place<br />
if you do some good work you will find yourself on all kinds of committees and<br />
unable to do any more work. You may find yourself as I saw Brattain when he got<br />
a Nobel Prize. The day the prize was announced we all assembled in Arnold<br />
Auditorium; all three winners got up and made speeches. The third one, Brattain,<br />
practically with tears in his eyes, said, &#8220;I know about this Nobel-Prize effect<br />
and I am not going to let it affect me; I am going to remain good old Walter<br />
Brattain.&#8221; Well I said to myself, &#8220;That is nice.&#8221; But in a few weeks I saw it<br />
was affecting him. Now he could only work on great problems. </p>
<p>When you are famous it is hard to work on small problems. This is what did<br />
Shannon in. After information theory, what do you do for an encore? The great<br />
scientists often make this error. They fail to continue to plant the little<br />
acorns from which the mighty oak trees grow. They try to get the big thing right<br />
off. And that isn&#8217;t the way things go. So that is another reason why you find<br />
that when you get early recognition it seems to sterilize you. In fact I will<br />
give you my favorite quotation of many years. The Institute for Advanced Study<br />
in Princeton, in my opinion, has ruined more good scientists than any<br />
institution has created, judged by what they did before they came and judged by<br />
what they did after. Not that they weren&#8217;t good afterwards, but they were superb<br />
before they got there and were only good afterwards. </p>
<p>This brings up the subject, out of order perhaps, of working conditions. What<br />
most people think are the best working conditions, are not. Very clearly they<br />
are not because people are often most productive when working conditions are<br />
bad. One of the better times of the Cambridge Physical Laboratories was when<br />
they had practically shacks &#8211; they did some of the best physics ever. </p>
<p>I give you a story from my own private life. Early on it became evident to me<br />
that Bell Laboratories was not going to give me the conventional acre of<br />
programming people to program computing machines in absolute binary. It was<br />
clear they weren&#8217;t going to. But that was the way everybody did it. I could go<br />
to the West Coast and get a job with the airplane companies without any trouble,<br />
but the exciting people were at Bell Labs and the fellows out there in the<br />
airplane companies were not. I thought for a long while about, &#8220;Did I want to<br />
go or not?&#8221; and I wondered how I could get the best of two possible worlds. I<br />
finally said to myself, &#8220;Hamming, you think the machines can do practically<br />
everything. Why can&#8217;t you make them write programs?&#8221; What appeared at first to<br />
me as a defect forced me into automatic programming very early. What appears to<br />
be a fault, often, by a change of viewpoint, turns out to be one of the greatest<br />
assets you can have. But you are not likely to think that when you first look<br />
the thing and say, &#8220;Gee, I&#8217;m never going to get enough programmers, so how can<br />
I ever do any great programming?&#8221; </p>
<p>And there are many other stories of the same kind; Grace Hopper has similar<br />
ones. I think that if you look carefully you will see that often the great<br />
scientists, by turning the problem around a bit, changed a defect to an asset.<br />
For example, many scientists when they found they couldn&#8217;t do a problem finally<br />
began to study why not. They then turned it around the other way and said, &#8220;But<br />
of course, this is what it is&#8221; and got an important result. So ideal working<br />
conditions are very strange. The ones you want aren&#8217;t always the best ones for<br />
you. </p>
<p>Now for the matter of drive. You observe that most great scientists have<br />
tremendous drive. I worked for ten years with John Tukey at Bell Labs. He had<br />
tremendous drive. One day about three or four years after I joined, I discovered<br />
that John Tukey was slightly younger than I was. John was a genius and I clearly<br />
was not. Well I went storming into Bode&#8217;s office and said, &#8220;How can anybody my<br />
age know as much as John Tukey does?&#8221; He leaned back in his chair, put his<br />
hands behind his head, grinned slightly, and said, &#8220;You would be surprised<br />
Hamming, how much you would know if you worked as hard as he did that many<br />
years.&#8221; I simply slunk out of the office! </p>
<p>What Bode was saying was this: &#8220;Knowledge and productivity are like compound<br />
interest.&#8221; Given two people of approximately the same ability and one person<br />
who works ten percent more than the other, the latter will more than twice<br />
outproduce the former. The more you know, the more you learn; the more you<br />
learn, the more you can do; the more you can do, the more the opportunity &#8211; it<br />
is very much like compound interest. I don&#8217;t want to give you a rate, but it is<br />
a very high rate. Given two people with exactly the same ability, the one person<br />
who manages day in and day out to get in one more hour of thinking will be<br />
tremendously more productive over a lifetime. I took Bode&#8217;s remark to heart; I<br />
spent a good deal more of my time for some years trying to work a bit harder and<br />
I found, in fact, I could get more work done. I don&#8217;t like to say it in front of<br />
my wife, but I did sort of neglect her sometimes; I needed to study. You have to<br />
neglect things if you intend to get what you want done. There&#8217;s no question<br />
about this. </p>
<p>On this matter of drive Edison says, &#8220;Genius is 99% perspiration and 1%<br />
inspiration.&#8221; He may have been exaggerating, but the idea is that solid work,<br />
steadily applied, gets you surprisingly far. The steady application of effort<br />
with a little bit more work, <i>intelligently applied</i> is what does it.<br />
That&#8217;s the trouble; drive, misapplied, doesn&#8217;t get you anywhere. I&#8217;ve often<br />
wondered why so many of my good friends at Bell Labs who worked as hard or<br />
harder than I did, didn&#8217;t have so much to show for it. The misapplication of<br />
effort is a very serious matter. Just hard work is not enough &#8211; it must be<br />
applied sensibly. </p>
<p>There&#8217;s another trait on the side which I want to talk about; that trait is<br />
ambiguity. It took me a while to discover its importance. Most people like to<br />
believe something is or is not true. Great scientists tolerate ambiguity very<br />
well. They believe the theory enough to go ahead; they doubt it enough to notice<br />
the errors and faults so they can step forward and create the new replacement<br />
theory. If you believe too much you&#8217;ll never notice the flaws; if you doubt too<br />
much you won&#8217;t get started. It requires a lovely balance. But most great<br />
scientists are well aware of why their theories are true and they are also well<br />
aware of some slight misfits which don&#8217;t quite fit and they don&#8217;t forget it.<br />
Darwin writes in his autobiography that he found it necessary to write down<br />
every piece of evidence which appeared to contradict his beliefs because<br />
otherwise they would disappear from his mind. When you find apparent flaws<br />
you&#8217;ve got to be sensitive and keep track of those things, and keep an eye out<br />
for how they can be explained or how the theory can be changed to fit them.<br />
Those are often the great contributions. Great contributions are rarely done by<br />
adding another decimal place. It comes down to an emotional commitment. Most<br />
great scientists are completely committed to their problem. Those who don&#8217;t<br />
become committed seldom produce outstanding, first-class work. </p>
<p>Now again, emotional commitment is not enough. It is a necessary condition<br />
apparently. And I think I can tell you the reason why. Everybody who has studied<br />
creativity is driven finally to saying, &#8220;creativity comes out of your<br />
subconscious.&#8221; Somehow, suddenly, there it is. It just appears. Well, we know<br />
very little about the subconscious; but one thing you are pretty well aware of<br />
is that your dreams also come out of your subconscious. And you&#8217;re aware your<br />
dreams are, to a fair extent, a reworking of the experiences of the day. If you<br />
are deeply immersed and committed to a topic, day after day after day, your<br />
subconscious has nothing to do but work on your problem. And so you wake up one<br />
morning, or on some afternoon, and there&#8217;s the answer. For those who don&#8217;t get<br />
committed to their current problem, the subconscious goofs off on other things<br />
and doesn&#8217;t produce the big result. So the way to manage yourself is that when<br />
you have a real important problem you don&#8217;t let anything else get the center of<br />
your attention &#8211; you keep your thoughts on the problem. Keep your subconscious<br />
starved so it has to work on <i>your</i> problem, so you can sleep peacefully<br />
and get the answer in the morning, free. </p>
<p>Now Alan Chynoweth mentioned that I used to eat at the physics table. I had<br />
been eating with the mathematicians and I found out that I already knew a fair<br />
amount of mathematics; in fact, I wasn&#8217;t learning much. The physics table was,<br />
as he said, an exciting place, but I think he exaggerated on how much I<br />
contributed. It was very interesting to listen to Shockley, Brattain, Bardeen,<br />
J. B. Johnson, Ken McKay and other people, and I was learning a lot. But<br />
unfortunately a Nobel Prize came, and a promotion came, and what was left was<br />
the dregs. Nobody wanted what was left. Well, there was no use eating with them!
</p>
<p>Over on the other side of the dining hall was a chemistry table. I had worked<br />
with one of the fellows, Dave McCall; furthermore he was courting our secretary<br />
at the time. I went over and said, &#8220;Do you mind if I join you?&#8221; They can&#8217;t say<br />
no, so I started eating with them for a while. And I started asking, &#8220;What are<br />
the important problems of your field?&#8221; And after a week or so, &#8220;What important<br />
problems are you working on?&#8221; And after some more time I came in one day and<br />
said, &#8220;If what you are doing is not important, and if you don&#8217;t think it is<br />
going to lead to something important, why are you at Bell Labs working on it?&#8221;<br />
I wasn&#8217;t welcomed after that; I had to find somebody else to eat with! That was<br />
in the spring. </p>
<p>In the fall, Dave McCall stopped me in the hall and said, &#8220;Hamming, that<br />
remark of yours got underneath my skin. I thought about it all summer, i.e. what<br />
were the important problems in my field. I haven&#8217;t changed my research,&#8221; he<br />
says, &#8220;but I think it was well worthwhile.&#8221; And I said, &#8220;Thank you Dave,&#8221;<br />
and went on. I noticed a couple of months later he was made the head of the<br />
department. I noticed the other day he was a Member of the National Academy of<br />
Engineering. I noticed he has succeeded. I have never heard the names of any of<br />
the other fellows at that table mentioned in science and scientific circles.<br />
They were unable to ask themselves, &#8220;What are the important problems in my<br />
field?&#8221; </p>
<p>If you do not work on an important problem, it&#8217;s unlikely you&#8217;ll do important<br />
work. It&#8217;s perfectly obvious. Great scientists have thought through, in a<br />
careful way, a number of important problems in their field, and they keep an eye<br />
on wondering how to attack them. Let me warn you, &#8216;important problem&#8217; must be<br />
phrased carefully. The three outstanding problems in physics, in a certain<br />
sense, were never worked on while I was at Bell Labs. By important I mean<br />
guaranteed a Nobel Prize and any sum of money you want to mention. We didn&#8217;t<br />
work on (1) time travel, (2) teleportation, and (3) antigravity. They are not<br />
important problems because we do not have an attack. It&#8217;s not the consequence<br />
that makes a problem important, it is that you have a reasonable attack. That is<br />
what makes a problem important. When I say that most scientists don&#8217;t work on<br />
important problems, I mean it in that sense. The average scientist, so far as I<br />
can make out, spends almost all his time working on problems which he believes<br />
will not be important and he also doesn&#8217;t believe that they will lead to<br />
important problems. </p>
<p>I spoke earlier about planting acorns so that oaks will grow. You can&#8217;t<br />
always know exactly where to be, but you can keep active in places where<br />
something might happen. And even if you believe that great science is a matter<br />
of luck, you can stand on a mountain top where lightning strikes; you don&#8217;t have<br />
to hide in the valley where you&#8217;re safe. But the average scientist does routine<br />
safe work almost all the time and so he (or she) doesn&#8217;t produce much. It&#8217;s that<br />
simple. If you want to do great work, you clearly must work on important<br />
problems, and you should have an idea. </p>
<p>Along those lines at some urging from John Tukey and others, I finally<br />
adopted what I called &#8220;Great Thoughts Time.&#8221; When I went to lunch Friday noon,<br />
I would only discuss great thoughts after that. By great thoughts I mean ones<br />
like: &#8220;What will be the role of computers in all of AT&amp;T?&#8221;, &#8220;How will<br />
computers change science?&#8221; For example, I came up with the observation at that<br />
time that nine out of ten experiments were done in the lab and one in ten on the<br />
computer. I made a remark to the vice presidents one time, that it would be<br />
reversed, i.e. nine out of ten experiments would be done on the computer and one<br />
in ten in the lab. They knew I was a crazy mathematician and had no sense of<br />
reality. I knew they were wrong and they&#8217;ve been proved wrong while I have been<br />
proved right. They built laboratories when they didn&#8217;t need them. I saw that<br />
computers were transforming science because I spent a lot of time asking &#8220;What<br />
will be the impact of computers on science and how can I change it?&#8221; I asked<br />
myself, &#8220;How is it going to change Bell Labs?&#8221; I remarked one time, in the<br />
same address, that more than one-half of the people at Bell Labs will be<br />
interacting closely with computing machines before I leave. Well, you all have<br />
terminals now. I thought hard about where was my field going, where were the<br />
opportunities, and what were the important things to do. Let me go there so<br />
there is a chance I can do important things. </p>
<p>Most great scientists know many important problems. They have something<br />
between 10 and 20 important problems for which they are looking for an attack.<br />
And when they see a new idea come up, one hears them say &#8220;Well that bears on<br />
this problem.&#8221; They drop all the other things and get after it. Now I can tell<br />
you a horror story that was told to me but I can&#8217;t vouch for the truth of it. I<br />
was sitting in an airport talking to a friend of mine from Los Alamos about how<br />
it was lucky that the fission experiment occurred over in Europe when it did<br />
because that got us working on the atomic bomb here in the US. He said &#8220;No; at<br />
Berkeley we had gathered a bunch of data; we didn&#8217;t get around to reducing it<br />
because we were building some more equipment, but if we had reduced that data we<br />
would have found fission.&#8221; They had it in their hands and they didn&#8217;t pursue<br />
it. They came in second! </p>
<p>The great scientists, when an opportunity opens up, get after it and they<br />
pursue it. They drop all other things. They get rid of other things and they get<br />
after an idea because they had already thought the thing through. Their minds<br />
are prepared; they see the opportunity and they go after it. Now of course lots<br />
of times it doesn&#8217;t work out, but you don&#8217;t have to hit many of them to do some<br />
great science. It&#8217;s kind of easy. One of the chief tricks is to live a long<br />
time! </p>
<p>Another trait, it took me a while to notice. I noticed the following facts<br />
about people who work with the door open or the door closed. I notice that if<br />
you have the door to your office closed, you get more work done today and<br />
tomorrow, and you are more productive than most. But 10 years later somehow you<br />
don&#8217;t know quite know what problems are worth working on; all the hard work you<br />
do is sort of tangential in importance. He who works with the door open gets all<br />
kinds of interruptions, but he also occasionally gets clues as to what the world<br />
is and what might be important. Now I cannot prove the cause and effect sequence<br />
because you might say, &#8220;The closed door is symbolic of a closed mind.&#8221; I don&#8217;t<br />
know. But I can say there is a pretty good correlation between those who work<br />
with the doors open and those who ultimately do important things, although<br />
people who work with doors closed often work harder. Somehow they seem to work<br />
on slightly the wrong thing &#8211; not much, but enough that they miss fame. </p>
<p>I want to talk on another topic. It is based on the song which I think many<br />
of you know, &#8220;It ain&#8217;t what you do, it&#8217;s the way that you do it.&#8221; I&#8217;ll start<br />
with an example of my own. I was conned into doing on a digital computer, in the<br />
absolute binary days, a problem which the best analog computers couldn&#8217;t do. And<br />
I was getting an answer. When I thought carefully and said to myself, &#8220;You<br />
know, Hamming, you&#8217;re going to have to file a report on this military job; after<br />
you spend a lot of money you&#8217;re going to have to account for it and every analog<br />
installation is going to want the report to see if they can&#8217;t find flaws in<br />
it.&#8221; I was doing the required integration by a rather crummy method, to say the<br />
least, but I was getting the answer. And I realized that in truth the problem<br />
was not just to get the answer; it was to demonstrate for the first time, and<br />
beyond question, that I could beat the analog computer on its own ground with a<br />
digital machine. I reworked the method of solution, created a theory which was<br />
nice and elegant, and changed the way we computed the answer; the results were<br />
no different. The published report had an elegant method which was later known<br />
for years as &#8220;Hamming&#8217;s Method of Integrating Differential Equations.&#8221; It is<br />
somewhat obsolete now, but for a while it was a very good method. By changing<br />
the problem slightly, I did important work rather than trivial work. </p>
<p>In the same way, when using the machine up in the attic in the early days, I<br />
was solving one problem after another after another; a fair number were<br />
successful and there were a few failures. I went home one Friday after finishing<br />
a problem, and curiously enough I wasn&#8217;t happy; I was depressed. I could see<br />
life being a long sequence of one problem after another after another. After<br />
quite a while of thinking I decided, &#8220;No, I should be in the mass production of<br />
a variable product. I should be concerned with <i>all</i> of next year&#8217;s<br />
problems, not just the one in front of my face.&#8221; By changing the question I<br />
still got the same kind of results or better, but I changed things and did<br />
important work. I attacked the major problem &#8211; How do I conquer machines and do<br />
all of next year&#8217;s problems when I don&#8217;t know what they are going to be? How do<br />
I prepare for it? How do I do this one so I&#8217;ll be on top of it? How do I obey<br />
Newton&#8217;s rule? He said, &#8220;If I have seen further than others, it is because I&#8217;ve<br />
stood on the shoulders of giants.&#8221; These days we stand on each other&#8217;s feet!
</p>
<p>You should do your job in such a fashion that others can build on top of it,<br />
so they will indeed say, &#8220;Yes, I&#8217;ve stood on so and so&#8217;s shoulders and I saw<br />
further.&#8221; The essence of science is cumulative. By changing a problem slightly<br />
you can often do great work rather than merely good work. Instead of attacking<br />
isolated problems, I made the resolution that I would never again solve an<br />
isolated problem except as characteristic of a class. </p>
<p>Now if you are much of a mathematician you know that the effort to generalize<br />
often means that the solution is simple. Often by stopping and saying, &#8220;This is<br />
the problem he wants but this is characteristic of so and so. Yes, I can attack<br />
the whole class with a far superior method than the particular one because I was<br />
earlier embedded in needless detail.&#8221; The business of abstraction frequently<br />
makes things simple. Furthermore, I filed away the methods and prepared for the<br />
future problems. </p>
<p>To end this part, I&#8217;ll remind you, &#8220;It is a poor workman who blames his<br />
tools &#8211; the good man gets on with the job, given what he&#8217;s got, and gets the<br />
best answer he can.&#8221; And I suggest that by altering the problem, by looking at<br />
the thing differently, you can make a great deal of difference in your final<br />
productivity because you can either do it in such a fashion that people can<br />
indeed build on what you&#8217;ve done, or you can do it in such a fashion that the<br />
next person has to essentially duplicate again what you&#8217;ve done. It isn&#8217;t just a<br />
matter of the job, it&#8217;s the way you write the report, the way you write the<br />
paper, the whole attitude. It&#8217;s just as easy to do a broad, general job as one<br />
very special case. And it&#8217;s much more satisfying and rewarding! </p>
<p>I have now come down to a topic which is very distasteful; it is not<br />
sufficient to do a job, you have to sell it. &#8216;Selling&#8217; to a scientist is an<br />
awkward thing to do. It&#8217;s very ugly; you shouldn&#8217;t have to do it. The world is<br />
supposed to be waiting, and when you do something great, they should rush out<br />
and welcome it. But the fact is everyone is busy with their own work. You must<br />
present it so well that they will set aside what they are doing, look at what<br />
you&#8217;ve done, read it, and come back and say, &#8220;Yes, that was good.&#8221; I suggest<br />
that when you open a journal, as you turn the pages, you ask why you read some<br />
articles and not others. You had better write your report so when it is<br />
published in the Physical Review, or wherever else you want it, as the readers<br />
are turning the pages they won&#8217;t just turn your pages but they will stop and<br />
read yours. If they don&#8217;t stop and read it, you won&#8217;t get credit. </p>
<p>There are three things you have to do in selling. You have to learn to write<br />
clearly and well so that people will read it, you must learn to give reasonably<br />
formal talks, and you also must learn to give informal talks. We had a lot of<br />
so-called &#8216;back room scientists.&#8217; In a conference, they would keep quiet. Three<br />
weeks later after a decision was made they filed a report saying why you should<br />
do so and so. Well, it was too late. They would not stand up right in the middle<br />
of a hot conference, in the middle of activity, and say, &#8220;We should do this for<br />
these reasons.&#8221; You need to master that form of communication as well as<br />
prepared speeches. </p>
<p>When I first started, I got practically physically ill while giving a speech,<br />
and I was very, very nervous. I realized I either had to learn to give speeches<br />
smoothly or I would essentially partially cripple my whole career. The first<br />
time IBM asked me to give a speech in New York one evening, I decided I was<br />
going to give a really good speech, a speech that was wanted, not a technical<br />
one but a broad one, and at the end if they liked it, I&#8217;d quietly say, &#8220;Any<br />
time you want one I&#8217;ll come in and give you one.&#8221; As a result, I got a great<br />
deal of practice giving speeches to a limited audience and I got over being<br />
afraid. Furthermore, I could also then study what methods were effective and<br />
what were ineffective. </p>
<p>While going to meetings I had already been studying why some papers are<br />
remembered and most are not. The technical person wants to give a highly limited<br />
technical talk. Most of the time the audience wants a broad general talk and<br />
wants much more survey and background than the speaker is willing to give. As a<br />
result, many talks are ineffective. The speaker names a topic and suddenly<br />
plunges into the details he&#8217;s solved. Few people in the audience may follow. You<br />
should paint a general picture to say why it&#8217;s important, and then slowly give a<br />
sketch of what was done. Then a larger number of people will say, &#8220;Yes, Joe has<br />
done that,&#8221; or &#8220;Mary has done that; I really see where it is; yes, Mary really<br />
gave a good talk; I understand what Mary has done.&#8221; The tendency is to give a<br />
highly restricted, safe talk; this is usually ineffective. Furthermore, many<br />
talks are filled with far too much information. So I say this idea of selling is<br />
obvious. </p>
<p>Let me summarize. You&#8217;ve got to work on important problems. I deny that it is<br />
all luck, but I admit there is a fair element of luck. I subscribe to Pasteur&#8217;s<br />
&#8220;Luck favors the prepared mind.&#8221; I favor heavily what I did. Friday afternoons<br />
for years &#8211; great thoughts only &#8211; means that I committed 10% of my time trying<br />
to understand the bigger problems in the field, i.e. what was and what was not<br />
important. I found in the early days I had believed &#8216;this&#8217; and yet had spent all<br />
week marching in &#8216;that&#8217; direction. It was kind of foolish. If I really believe<br />
the action is over there, why do I march in this direction? I either had to<br />
change my goal or change what I did. So I changed something I did and I marched<br />
in the direction I thought was important. It&#8217;s that easy. </p>
<p>Now you might tell me you haven&#8217;t got control over what you have to work on.<br />
Well, when you first begin, you may not. But once you&#8217;re moderately successful,<br />
there are more people asking for results than you can deliver and you have some<br />
power of choice, but not completely. I&#8217;ll tell you a story about that, and it<br />
bears on the subject of educating your boss. I had a boss named Schelkunoff; he<br />
was, and still is, a very good friend of mine. Some military person came to me<br />
and demanded some answers by Friday. Well, I had already dedicated my computing<br />
resources to reducing data on the fly for a group of scientists; I was knee deep<br />
in short, small, important problems. This military person wanted me to solve his<br />
problem by the end of the day on Friday. I said, &#8220;No, I&#8217;ll give it to you<br />
Monday. I can work on it over the weekend. I&#8217;m not going to do it now.&#8221; He goes<br />
down to my boss, Schelkunoff, and Schelkunoff says, &#8220;You must run this for him;<br />
he&#8217;s got to have it by Friday.&#8221; I tell him, &#8220;Why do I?&#8221;; he says, &#8220;You have<br />
to.&#8221; I said, &#8220;Fine, Sergei, but you&#8217;re sitting in your office Friday afternoon<br />
catching the late bus home to watch as this fellow walks out that door.&#8221; I gave<br />
the military person the answers late Friday afternoon. I then went to<br />
Schelkunoff&#8217;s office and sat down; as the man goes out I say, &#8220;You see<br />
Schelkunoff, this fellow has nothing under his arm; but I gave him the<br />
answers.&#8221; On Monday morning Schelkunoff called him up and said, &#8220;Did you come<br />
in to work over the weekend?&#8221; I could hear, as it were, a pause as the fellow<br />
ran through his mind of what was going to happen; but he knew he would have had<br />
to sign in, and he&#8217;d better not say he had when he hadn&#8217;t, so he said he hadn&#8217;t.<br />
Ever after that Schelkunoff said, &#8220;You set your deadlines; you can change<br />
them.&#8221; </p>
<p>One lesson was sufficient to educate my boss as to why I didn&#8217;t want to do<br />
big jobs that displaced exploratory research and why I was justified in not<br />
doing crash jobs which absorb all the research computing facilities. I wanted<br />
instead to use the facilities to compute a large number of small problems.<br />
Again, in the early days, I was limited in computing capacity and it was clear,<br />
in my area, that a &#8220;mathematician had no use for machines.&#8221; But I needed more<br />
machine capacity. Every time I had to tell some scientist in some other area,<br />
&#8220;No I can&#8217;t; I haven&#8217;t the machine capacity,&#8221; he complained. I said &#8220;Go tell<br />
<i>your</i> Vice President that Hamming needs more computing capacity.&#8221; After a<br />
while I could see what was happening up there at the top; many people said to my<br />
Vice President, &#8220;Your man needs more computing capacity.&#8221; I got it! </p>
<p>I also did a second thing. When I loaned what little programming power we had<br />
to help in the early days of computing, I said, &#8220;We are not getting the<br />
recognition for our programmers that they deserve. When you publish a paper you<br />
will thank that programmer or you aren&#8217;t getting any more help from me. That<br />
programmer is going to be thanked by name; she&#8217;s worked hard.&#8221; I waited a<br />
couple of years. I then went through a year of BSTJ articles and counted what<br />
fraction thanked some programmer. I took it into the boss and said, &#8220;That&#8217;s the<br />
central role computing is playing in Bell Labs; if the BSTJ is important, that&#8217;s<br />
how important computing is.&#8221; He had to give in. You can educate your bosses.<br />
It&#8217;s a hard job. In this talk I&#8217;m only viewing from the bottom up; I&#8217;m not<br />
viewing from the top down. But I am telling you how you can get what you want in<br />
spite of top management. You have to sell your ideas there also. </p>
<p>Well I now come down to the topic, &#8220;Is the effort to be a great scientist<br />
worth it?&#8221; To answer this, you must ask people. When you get beyond their<br />
modesty, most people will say, &#8220;Yes, doing really first-class work, and knowing<br />
it, is as good as wine, women and song put together,&#8221; or if it&#8217;s a woman she<br />
says, &#8220;It is as good as wine, men and song put together.&#8221; And if you look at<br />
the bosses, they tend to come back or ask for reports, trying to participate in<br />
those moments of discovery. They&#8217;re always in the way. So evidently those who<br />
have done it, want to do it again. But it is a limited survey. I have never<br />
dared to go out and ask those who didn&#8217;t do great work how they felt about the<br />
matter. It&#8217;s a biased sample, but I still think it is worth the struggle. I<br />
think it is very definitely worth the struggle to try and do first-class work<br />
because the truth is, the value is in the struggle more than it is in the<br />
result. The struggle to make something of yourself seems to be worthwhile in<br />
itself. The success and fame are sort of dividends, in my opinion. </p>
<p>I&#8217;ve told you how to do it. It is so easy, so why do so many people, with all<br />
their talents, fail? For example, my opinion, to this day, is that there are in<br />
the mathematics department at Bell Labs quite a few people far more able and far<br />
better endowed than I, but they didn&#8217;t produce as much. Some of them did produce<br />
more than I did; Shannon produced more than I did, and some others produced a<br />
lot, but I was highly productive against a lot of other fellows who were better<br />
equipped. Why is it so? What happened to them? Why do so many of the people who<br />
have great promise, fail? </p>
<p>Well, one of the reasons is drive and commitment. The people who do great<br />
work with less ability but who are committed to it, get more done that those who<br />
have great skill and dabble in it, who work during the day and go home and do<br />
other things and come back and work the next day. They don&#8217;t have the deep<br />
commitment that is apparently necessary for really first-class work. They turn<br />
out lots of good work, but we were talking, remember, about first-class work.<br />
There is a difference. Good people, very talented people, almost always turn out<br />
good work. We&#8217;re talking about the outstanding work, the type of work that gets<br />
the Nobel Prize and gets recognition. </p>
<p>The second thing is, I think, the problem of personality defects. Now I&#8217;ll<br />
cite a fellow whom I met out in Irvine. He had been the head of a computing<br />
center and he was temporarily on assignment as a special assistant to the<br />
president of the university. It was obvious he had a job with a great future. He<br />
took me into his office one time and showed me his method of getting letters<br />
done and how he took care of his correspondence. He pointed out how inefficient<br />
the secretary was. He kept all his letters stacked around there; he knew where<br />
everything was. And he would, on his word processor, get the letter out. He was<br />
bragging how marvelous it was and how he could get so much more work done<br />
without the secretary&#8217;s interference. Well, behind his back, I talked to the<br />
secretary. The secretary said, &#8220;Of course I can&#8217;t help him; I don&#8217;t get his<br />
mail. He won&#8217;t give me the stuff to log in; I don&#8217;t know where he puts it on the<br />
floor. Of course I can&#8217;t help him.&#8221; So I went to him and said, &#8220;Look, if you<br />
adopt the present method and do what you can do single-handedly, you can go just<br />
that far and no farther than you can do single-handedly. If you will learn to<br />
work with the system, you can go as far as the system will support you.&#8221; And,<br />
he never went any further. He had his personality defect of wanting total<br />
control and was not willing to recognize that you need the support of the<br />
system. </p>
<p>You find this happening again and again; good scientists will fight the<br />
system rather than learn to work with the system and take advantage of all the<br />
system has to offer. It has a lot, if you learn how to use it. It takes<br />
patience, but you can learn how to use the system pretty well, and you can learn<br />
how to get around it. After all, if you want a decision &#8216;No&#8217;, you just go to<br />
your boss and get a &#8216;No&#8217; easy. If you want to do something, don&#8217;t ask, do it.<br />
Present him with an accomplished fact. Don&#8217;t give him a chance to tell you &#8216;No&#8217;.<br />
But if you want a &#8216;No&#8217;, it&#8217;s easy to get a &#8216;No&#8217;. </p>
<p>Another personality defect is ego assertion and I&#8217;ll speak in this case of my<br />
own experience. I came from Los Alamos and in the early days I was using a<br />
machine in New York at 590 Madison Avenue where we merely rented time. I was<br />
still dressing in western clothes, big slash pockets, a bolo and all those<br />
things. I vaguely noticed that I was not getting as good service as other<br />
people. So I set out to measure. You came in and you waited for your turn; I<br />
felt I was not getting a fair deal. I said to myself, &#8220;Why? No Vice President<br />
at IBM said, &#8216;Give Hamming a bad time&#8217;. It is the secretaries at the bottom who<br />
are doing this. When a slot appears, they&#8217;ll rush to find someone to slip in,<br />
but they go out and find somebody else. Now, why? I haven&#8217;t mistreated them.&#8221;<br />
Answer, I wasn&#8217;t dressing the way they felt somebody in that situation should.<br />
It came down to just that &#8211; I wasn&#8217;t dressing properly. I had to make the<br />
decision &#8211; was I going to assert my ego and dress the way I wanted to and have<br />
it steadily drain my effort from my professional life, or was I going to appear<br />
to conform better? I decided I would make an effort to appear to conform<br />
properly. The moment I did, I got much better service. And now, as an old<br />
colorful character, I get better service than other people. </p>
<p>You should dress according to the expectations of the audience spoken to. If<br />
I am going to give an address at the MIT computer center, I dress with a bolo<br />
and an old corduroy jacket or something else. I know enough not to let my<br />
clothes, my appearance, my manners get in the way of what I care about. An<br />
enormous number of scientists feel they must assert their ego and do their thing<br />
their way. They have got to be able to do this, that, or the other thing, and<br />
they pay a steady price. </p>
<p>John Tukey almost always dressed very casually. He would go into an important<br />
office and it would take a long time before the other fellow realized that this<br />
is a first-class man and he had better listen. For a long time John has had to<br />
overcome this kind of hostility. It&#8217;s wasted effort! I didn&#8217;t say you should<br />
conform; I said &#8220;The <i>appearance of conforming</i> gets you a long way.&#8221; If<br />
you chose to assert your ego in any number of ways, &#8220;I am going to do it my<br />
way,&#8221; you pay a small steady price throughout the whole of your professional<br />
career. And this, over a whole lifetime, adds up to an enormous amount of<br />
needless trouble. </p>
<p>By taking the trouble to tell jokes to the secretaries and being a little<br />
friendly, I got superb secretarial help. For instance, one time for some idiot<br />
reason all the reproducing services at Murray Hill were tied up. Don&#8217;t ask me<br />
how, but they were. I wanted something done. My secretary called up somebody at<br />
Holmdel, hopped the company car, made the hour-long trip down and got it<br />
reproduced, and then came back. It was a payoff for the times I had made an<br />
effort to cheer her up, tell her jokes and be friendly; it was that little extra<br />
work that later paid off for me. By realizing you have to use the system and<br />
studying how to get the system to do your work, you learn how to adapt the<br />
system to your desires. Or you can fight it steadily, as a small undeclared war,<br />
for the whole of your life. </p>
<p>And I think John Tukey paid a terrible price needlessly. He was a genius<br />
anyhow, but I think it would have been far better, and far simpler, had he been<br />
willing to conform a little bit instead of ego asserting. He is going to dress<br />
the way he wants all of the time. It applies not only to dress but to a thousand<br />
other things; people will continue to fight the system. Not that you shouldn&#8217;t<br />
occasionally! </p>
<p>When they moved the library from the middle of Murray Hill to the far end, a<br />
friend of mine put in a request for a bicycle. Well, the organization was not<br />
dumb. They waited awhile and sent back a map of the grounds saying, &#8220;Will you<br />
please indicate on this map what paths you are going to take so we can get an<br />
insurance policy covering you.&#8221; A few more weeks went by. They then asked,<br />
&#8220;Where are you going to store the bicycle and how will it be locked so we can<br />
do so and so.&#8221; He finally realized that of course he was going to be red-taped<br />
to death so he gave in. He rose to be the President of Bell Laboratories. </p>
<p>Barney Oliver was a good man. He wrote a letter one time to the IEEE. At that<br />
time the official shelf space at Bell Labs was so much and the height of the<br />
IEEE Proceedings at that time was larger; and since you couldn&#8217;t change the size<br />
of the official shelf space he wrote this letter to the IEEE Publication person<br />
saying, &#8220;Since so many IEEE members were at Bell Labs and since the official<br />
space was so high the journal size should be changed.&#8221; He sent it for his<br />
boss&#8217;s signature. Back came a carbon with his signature, but he still doesn&#8217;t<br />
know whether the original was sent or not. I am not saying you shouldn&#8217;t make<br />
gestures of reform. I am saying that my study of able people is that they don&#8217;t<br />
get themselves <i>committed</i> to that kind of warfare. They play it a little<br />
bit and drop it and get on with their work. </p>
<p>Many a second-rate fellow gets caught up in some little twitting of the<br />
system, and carries it through to warfare. He expends his energy in a foolish<br />
project. Now you are going to tell me that somebody has to change the system. I<br />
agree; somebody&#8217;s has to. Which do you want to be? The person who changes the<br />
system or the person who does first-class science? Which person is it that you<br />
want to be? Be clear, when you fight the system and struggle with it, what you<br />
are doing, how far to go out of amusement, and how much to waste your effort<br />
fighting the system. My advice is to let somebody else do it and you get on with<br />
becoming a first-class scientist. Very few of you have the ability to both<br />
reform the system <i>and</i> become a first-class scientist. </p>
<p>On the other hand, we can&#8217;t always give in. There are times when a certain<br />
amount of rebellion is sensible. I have observed almost all scientists enjoy a<br />
certain amount of twitting the system for the sheer love of it. What it comes<br />
down to basically is that you cannot be original in one area without having<br />
originality in others. Originality is being different. You can&#8217;t be an original<br />
scientist without having some other original characteristics. But many a<br />
scientist has let his quirks in other places make him pay a far higher price<br />
than is necessary for the ego satisfaction he or she gets. I&#8217;m not against all<br />
ego assertion; I&#8217;m against some. </p>
<p>Another fault is anger. Often a scientist becomes angry, and this is no way<br />
to handle things. Amusement, yes, anger, no. Anger is misdirected. You should<br />
follow and cooperate rather than struggle against the system all the time. </p>
<p>Another thing you should look for is the positive side of things instead of<br />
the negative. I have already given you several examples, and there are many,<br />
many more; how, given the situation, by changing the way I looked at it, I<br />
converted what was apparently a defect to an asset. I&#8217;ll give you another<br />
example. I am an egotistical person; there is no doubt about it. I knew that<br />
most people who took a sabbatical to write a book, didn&#8217;t finish it on time. So<br />
before I left, I told all my friends that when I come back, that book was going<br />
to be done! Yes, I would have it done &#8211; I&#8217;d have been ashamed to come back<br />
without it! I used my ego to make myself behave the way I wanted to. I bragged<br />
about something so I&#8217;d have to perform. I found out many times, like a cornered<br />
rat in a real trap, I was surprisingly capable. I have found that it paid to<br />
say, &#8220;Oh yes, I&#8217;ll get the answer for you Tuesday,&#8221; not having any idea how to<br />
do it. By Sunday night I was really hard thinking on how I was going to deliver<br />
by Tuesday. I often put my pride on the line and sometimes I failed, but as I<br />
said, like a cornered rat I&#8217;m surprised how often I did a good job. I think you<br />
need to learn to use yourself. I think you need to know how to convert a<br />
situation from one view to another which would increase the chance of success.
</p>
<p>Now self-delusion in humans is very, very common. There are enumerable ways<br />
of you changing a thing and kidding yourself and making it look some other way.<br />
When you ask, &#8220;Why didn&#8217;t you do such and such,&#8221; the person has a thousand<br />
alibis. If you look at the history of science, usually these days there are 10<br />
people right there ready, and we pay off for the person who is there first. The<br />
other nine fellows say, &#8220;Well, I had the idea but I didn&#8217;t do it and so on and<br />
so on.&#8221; There are so many alibis. Why weren&#8217;t you first? Why didn&#8217;t you do it<br />
right? Don&#8217;t try an alibi. Don&#8217;t try and kid yourself. You can tell other people<br />
all the alibis you want. I don&#8217;t mind. But to yourself try to be honest. </p>
<p>If you really want to be a first-class scientist you need to know yourself,<br />
your weaknesses, your strengths, and your bad faults, like my egotism. How can<br />
you convert a fault to an asset? How can you convert a situation where you<br />
haven&#8217;t got enough manpower to move into a direction when that&#8217;s exactly what<br />
you need to do? I say again that I have seen, as I studied the history, the<br />
successful scientist changed the viewpoint and what was a defect became an<br />
asset. </p>
<p>In summary, I claim that some of the reasons why so many people who have<br />
greatness within their grasp don&#8217;t succeed are: they don&#8217;t work on important<br />
problems, they don&#8217;t become emotionally involved, they don&#8217;t try and change what<br />
is difficult to some other situation which is easily done but is still<br />
important, and they keep giving themselves alibis why they don&#8217;t. They keep<br />
saying that it is a matter of luck. I&#8217;ve told you how easy it is; furthermore<br />
I&#8217;ve told you how to reform. Therefore, go forth and become great scientists!
</p>
<p>(End of the formal part of the talk.) </p>
<p><b>DISCUSSION &#8211; QUESTIONS AND ANSWERS</b> </p>
<p><i>A. G. Chynoweth:</i> Well that was 50 minutes of concentrated wisdom and<br />
observations accumulated over a fantastic career; I lost track of all the<br />
observations that were striking home. Some of them are very very timely. One was<br />
the plea for more computer capacity; I was hearing nothing but that this morning<br />
from several people, over and over again. So that was right on the mark today<br />
even though here we are 20 &#8211; 30 years after when you were making similar<br />
remarks, Dick. I can think of all sorts of lessons that all of us can draw from<br />
your talk. And for one, as I walk around the halls in the future I hope I won&#8217;t<br />
see as many closed doors in Bellcore. That was one observation I thought was<br />
very intriguing. </p>
<p>Thank you very, very much indeed Dick; that was a wonderful recollection.<br />
I&#8217;ll now open it up for questions. I&#8217;m sure there are many people who would like<br />
to take up on some of the points that Dick was making. </p>
<p><i>Hamming:</i> First let me respond to Alan Chynoweth about computing. I had<br />
computing in research and for 10 years I kept telling my management, &#8220;Get that<br />
!&amp;@#% machine out of research. We are being forced to run problems all the<br />
time. We can&#8217;t do research because were too busy operating and running the<br />
computing machines.&#8221; Finally the message got through. They were going to move<br />
computing out of research to someplace else. I was persona non grata to say the<br />
least and I was surprised that people didn&#8217;t kick my shins because everybody was<br />
having their toy taken away from them. I went in to Ed David&#8217;s office and said,<br />
&#8220;Look Ed, you&#8217;ve got to give your researchers a machine. If you give them a<br />
great big machine, we&#8217;ll be back in the same trouble we were before, so busy<br />
keeping it going we can&#8217;t think. Give them the smallest machine you can because<br />
they are very able people. They will learn how to do things on a small machine<br />
instead of mass computing.&#8221; As far as I&#8217;m concerned, that&#8217;s how UNIX arose. We<br />
gave them a moderately small machine and they decided to make it do great<br />
things. They had to come up with a system to do it on. It is called UNIX! </p>
<p><i>A. G. Chynoweth:</i> I just have to pick up on that one. In our present<br />
environment, Dick, while we wrestle with some of the red tape attributed to, or<br />
required by, the regulators, there is one quote that one exasperated AVP came up<br />
with and I&#8217;ve used it over and over again. He growled that, &#8220;UNIX was never a<br />
deliverable!&#8221; </p>
<p><i>Question:</i> What about personal stress? Does that seem to make a<br />
difference? </p>
<p><i>Hamming:</i> Yes, it does. If you don&#8217;t get emotionally involved, it<br />
doesn&#8217;t. I had incipient ulcers most of the years that I was at Bell Labs. I<br />
have since gone off to the Naval Postgraduate School and laid back somewhat, and<br />
now my health is much better. But if you want to be a great scientist you&#8217;re<br />
going to have to put up with stress. You can lead a nice life; you can be a nice<br />
guy or you can be a great scientist. But nice guys end last, is what Leo<br />
Durocher said. If you want to lead a nice happy life with a lot of recreation<br />
and everything else, you&#8217;ll lead a nice life. </p>
<p><i>Question:</i> The remarks about having courage, no one could argue with;<br />
but those of us who have gray hairs or who are well established don&#8217;t have to<br />
worry too much. But what I sense among the young people these days is a real<br />
concern over the risk taking in a highly competitive environment. Do you have<br />
any words of wisdom on this? </p>
<p><i>Hamming:</i> I&#8217;ll quote Ed David more. Ed David was concerned about the<br />
general loss of nerve in our society. It does seem to me that we&#8217;ve gone through<br />
various periods. Coming out of the war, coming out of Los Alamos where we built<br />
the bomb, coming out of building the radars and so on, there came into the<br />
mathematics department, and the research area, a group of people with a lot of<br />
guts. They&#8217;ve just seen things done; they&#8217;ve just won a war which was fantastic.<br />
We had reasons for having courage and therefore we did a great deal. I can&#8217;t<br />
arrange that situation to do it again. I cannot blame the present generation for<br />
not having it, but I agree with what you say; I just cannot attach blame to it.<br />
It doesn&#8217;t seem to me they have the desire for greatness; they lack the courage<br />
to do it. But we had, because we were in a favorable circumstance to have it; we<br />
just came through a tremendously successful war. In the war we were looking<br />
very, very bad for a long while; it was a very desperate struggle as you well<br />
know. And our success, I think, gave us courage and self confidence; that&#8217;s why<br />
you see, beginning in the late forties through the fifties, a tremendous<br />
productivity at the labs which was stimulated from the earlier times. Because<br />
many of us were earlier forced to learn other things &#8211; we were forced to learn<br />
the things we didn&#8217;t want to learn, we were forced to have an open door &#8211; and<br />
then we could exploit those things we learned. It is true, and I can&#8217;t do<br />
anything about it; I cannot blame the present generation either. It&#8217;s just a<br />
fact. </p>
<p><i>Question:</i> Is there something management could or should do? </p>
<p><i>Hamming:</i> Management can do very little. If you want to talk about<br />
managing research, that&#8217;s a totally different talk. I&#8217;d take another hour doing<br />
that. This talk is about how the individual gets very successful research done<br />
in spite of anything the management does or in spite of any other opposition.<br />
And how do you do it? Just as I observe people doing it. It&#8217;s just that simple<br />
and that hard! </p>
<p><i>Question:</i> Is brainstorming a daily process? </p>
<p><i>Hamming:</i> Once that was a very popular thing, but it seems not to have<br />
paid off. For myself I find it desirable to talk to other people; but a session<br />
of brainstorming is seldom worthwhile. I do go in to strictly talk to somebody<br />
and say, &#8220;Look, I think there has to be something here. Here&#8217;s what I think I<br />
see &#8230;&#8221; and then begin talking back and forth. But you want to pick capable<br />
people. To use another analogy, you know the idea called the &#8216;critical mass.&#8217; If<br />
you have enough stuff you have critical mass. There is also the idea I used to<br />
call &#8217;sound absorbers&#8217;. When you get too many sound absorbers, you give out an<br />
idea and they merely say, &#8220;Yes, yes, yes.&#8221; What you want to do is get that<br />
critical mass in action; &#8220;Yes, that reminds me of so and so,&#8221; or, &#8220;Have you<br />
thought about that or this?&#8221; When you talk to other people, you want to get rid<br />
of those sound absorbers who are nice people but merely say, &#8220;Oh yes,&#8221; and to<br />
find those who will stimulate you right back. </p>
<p>For example, you couldn&#8217;t talk to John Pierce without being stimulated very<br />
quickly. There were a group of other people I used to talk with. For example<br />
there was Ed Gilbert; I used to go down to his office regularly and ask him<br />
questions and listen and come back stimulated. I picked my people carefully with<br />
whom I did or whom I didn&#8217;t brainstorm because the sound absorbers are a curse.<br />
They are just nice guys; they fill the whole space and they contribute nothing<br />
except they absorb ideas and the new ideas just die away instead of echoing on.<br />
Yes, I find it necessary to talk to people. I think people with closed doors<br />
fail to do this so they fail to get their ideas sharpened, such as &#8220;Did you<br />
ever notice something over here?&#8221; I never knew anything about it &#8211; I can go<br />
over and look. Somebody points the way. On my visit here, I have already found<br />
several books that I must read when I get home. I talk to people and ask<br />
questions when I think they can answer me and give me clues that I do not know<br />
about. I go out and look! </p>
<p><i>Question:</i> What kind of tradeoffs did you make in allocating your time<br />
for reading and writing and actually doing research? </p>
<p><i>Hamming:</i> I believed, in my early days, that you should spend at least<br />
as much time in the polish and presentation as you did in the original research.<br />
Now at least 50% of the time must go for the presentation. It&#8217;s a big, big<br />
number. </p>
<p><i>Question:</i> How much effort should go into library work? </p>
<p><i>Hamming:</i> It depends upon the field. I will say this about it. There<br />
was a fellow at Bell Labs, a very, very, smart guy. He was always in the<br />
library; he read everything. If you wanted references, you went to him and he<br />
gave you all kinds of references. But in the middle of forming these theories, I<br />
formed a proposition: there would be no effect named after him in the long run.<br />
He is now retired from Bell Labs and is an Adjunct Professor. He was very<br />
valuable; I&#8217;m not questioning that. He wrote some very good Physical Review<br />
articles; but there&#8217;s no effect named after him because he read too much. If you<br />
read all the time what other people have done you will think the way they<br />
thought. If you want to think new thoughts that are different, then do what a<br />
lot of creative people do &#8211; get the problem reasonably clear and then refuse to<br />
look at any answers until you&#8217;ve thought the problem through carefully how you<br />
would do it, how you could slightly change the problem to be the correct one. So<br />
yes, you need to keep up. You need to keep up more to find out what the problems<br />
are than to read to find the solutions. The reading is necessary to know what is<br />
going on and what is possible. But reading to get the solutions does not seem to<br />
be the way to do great research. So I&#8217;ll give you two answers. You read; but it<br />
is not the amount, it is the way you read that counts. </p>
<p><i>Question:</i> How do you get your name attached to things? </p>
<p><i>Hamming:</i> By doing great work. I&#8217;ll tell you the hamming window one. I<br />
had given Tukey a hard time, quite a few times, and I got a phone call from him<br />
from Princeton to me at Murray Hill. I knew that he was writing up power spectra<br />
and he asked me if I would mind if he called a certain window a &#8220;Hamming<br />
window.&#8221; And I said to him, &#8220;Come on, John; you know perfectly well I did only<br />
a small part of the work but you also did a lot.&#8221; He said, &#8220;Yes, Hamming, but<br />
you contributed a lot of small things; you&#8217;re entitled to some credit.&#8221; So he<br />
called it the hamming window. Now, let me go on. I had twitted John frequently<br />
about true greatness. I said true greatness is when your name is like ampere,<br />
watt, and fourier &#8211; when it&#8217;s spelled with a lower case letter. That&#8217;s how the<br />
hamming window came about. </p>
<p><i>Question:</i> Dick, would you care to comment on the relative<br />
effectiveness between giving talks, writing papers, and writing books? </p>
<p><i>Hamming:</i> In the short-haul, papers are very important if you want to<br />
stimulate someone tomorrow. If you want to get recognition long-haul, it seems<br />
to me writing books is more contribution because most of us need orientation. In<br />
this day of practically infinite knowledge, we need orientation to find our way.<br />
Let me tell you what infinite knowledge is. Since from the time of Newton to<br />
now, we have come close to doubling knowledge every 17 years, more or less. And<br />
we cope with that, essentially, by specialization. In the next 340 years at that<br />
rate, there will be 20 doublings, i.e. a million, and there will be a million<br />
fields of specialty for every one field now. It isn&#8217;t going to happen. The<br />
present growth of knowledge will choke itself off until we get different tools.<br />
I believe that books which try to digest, coordinate, get rid of the<br />
duplication, get rid of the less fruitful methods and present the underlying<br />
ideas clearly of what we know now, will be the things the future generations<br />
will value. Public talks are necessary; private talks are necessary; written<br />
papers are necessary. But I am inclined to believe that, in the long-haul, books<br />
which leave out what&#8217;s not essential are more important than books which tell<br />
you everything because you don&#8217;t want to know everything. I don&#8217;t want to know<br />
that much about penguins is the usual reply. You just want to know the essence. </p>
<p><i>Question:</i> You mentioned the problem of the Nobel Prize and the<br />
subsequent notoriety of what was done to some of the careers. Isn&#8217;t that kind of<br />
a much more broad problem of fame? What can one do? </p>
<p><i>Hamming:</i> Some things you could do are the following. Somewhere around<br />
every seven years make a significant, if not complete, shift in your field.<br />
Thus, I shifted from numerical analysis, to hardware, to software, and so on,<br />
periodically, because you tend to use up your ideas. When you go to a new field,<br />
you have to start over as a baby. You are no longer the big mukity muk and you<br />
can start back there and you can start planting those acorns which will become<br />
the giant oaks. Shannon, I believe, ruined himself. In fact when he left Bell<br />
Labs, I said, &#8220;That&#8217;s the end of Shannon&#8217;s scientific career.&#8221; I received a<br />
lot of flak from my friends who said that Shannon was just as smart as ever. I<br />
said, &#8220;Yes, he&#8217;ll be just as smart, but that&#8217;s the end of his scientific<br />
career,&#8221; and I truly believe it was. </p>
<p>You have to change. You get tired after a while; you use up your originality<br />
in one field. You need to get something nearby. I&#8217;m not saying that you shift<br />
from music to theoretical physics to English literature; I mean within your<br />
field you should shift areas so that you don&#8217;t go stale. You couldn&#8217;t get away<br />
with forcing a change every seven years, but if you could, I would require a<br />
condition for doing research, being that you <i>will</i> change your field of<br />
research every seven years with a reasonable definition of what it means, or at<br />
the end of 10 years, management has the right to compel you to change. I would<br />
insist on a change because I&#8217;m serious. What happens to the old fellows is that<br />
they get a technique going; they keep on using it. They were marching in that<br />
direction which was right then, but the world changes. There&#8217;s the new<br />
direction; but the old fellows are still marching in their former direction.
</p>
<p>You need to get into a new field to get new viewpoints, and <i>before</i> you<br />
use up all the old ones. You can do something about this, but it takes effort<br />
and energy. It takes courage to say, &#8220;Yes, I will give up my great<br />
reputation.&#8221; For example, when error correcting codes were well launched,<br />
having these theories, I said, &#8220;Hamming, you are going to quit reading papers<br />
in the field; you are going to ignore it completely; you are going to try and do<br />
something else other than coast on that.&#8221; I deliberately refused to go on in<br />
that field. I wouldn&#8217;t even read papers to try to force myself to have a chance<br />
to do something else. I managed myself, which is what I&#8217;m preaching in this<br />
whole talk. Knowing many of my own faults, I manage myself. I have a lot of<br />
faults, so I&#8217;ve got a lot of problems, i.e. a lot of possibilities of<br />
management. </p>
<p><i>Question:</i> Would you compare research and management? </p>
<p><i>Hamming:</i> If you want to be a great researcher, you won&#8217;t make it being<br />
president of the company. If you want to be president of the company, that&#8217;s<br />
another thing. I&#8217;m not against being president of the company. I just don&#8217;t want<br />
to be. I think Ian Ross does a good job as President of Bell Labs. I&#8217;m not<br />
against it; but you have to be clear on what you want. Furthermore, when you&#8217;re<br />
young, you may have picked wanting to be a great scientist, but as you live<br />
longer, you may change your mind. For instance, I went to my boss, Bode, one day<br />
and said, &#8220;Why did you ever become department head? Why didn&#8217;t you just be a<br />
good scientist?&#8221; He said, &#8220;Hamming, I had a vision of what mathematics should<br />
be in Bell Laboratories. And I saw if that vision was going to be realized,<br />
<i>I</i> had to make it happen; <i>I</i> had to be department head.&#8221; When your<br />
vision of what you want to do is what you can do single-handedly, then you<br />
should pursue it. The day your vision, what you think needs to be done, is<br />
bigger than what you can do single-handedly, then you have to move toward<br />
management. And the bigger the vision is, the farther in management you have to<br />
go. If you have a vision of what the whole laboratory should be, or the whole<br />
Bell System, you have to get there to make it happen. You can&#8217;t make it happen<br />
from the bottom very easily. It depends upon what goals and what desires you<br />
have. And as they change in life, you have to be prepared to change. I chose to<br />
avoid management because I preferred to do what I could do single-handedly. But<br />
that&#8217;s the choice that I made, and it is biased. Each person is entitled to<br />
their choice. Keep an open mind. But when you do choose a path, for heaven&#8217;s<br />
sake be aware of what you have done and the choice you have made. Don&#8217;t try to<br />
do both sides. </p>
<p><i>Question:</i> How important is one&#8217;s own expectation or how important is<br />
it to be in a group or surrounded by people who expect great work from you? </p>
<p><i>Hamming:</i> At Bell Labs everyone expected good work from me &#8211; it was a<br />
big help. Everybody expects you to do a good job, so you do, if you&#8217;ve got<br />
pride. I think it&#8217;s very valuable to have first-class people around. I sought<br />
out the best people. The moment that physics table lost the best people, I left.<br />
The moment I saw that the same was true of the chemistry table, I left. I tried<br />
to go with people who had great ability so I could learn from them and who would<br />
expect great results out of me. By deliberately managing myself, I think I did<br />
much better than laissez faire. </p>
<p><i>Question:</i> You, at the outset of your talk, minimized or played down<br />
luck; but you seemed also to gloss over the circumstances that got you to Los<br />
Alamos, that got you to Chicago, that got you to Bell Laboratories. </p>
<p><i>Hamming:</i> There was some luck. On the other hand I don&#8217;t know the<br />
alternate branches. Until you can say that the other branches would not have<br />
been equally or more successful, I can&#8217;t say. Is it luck the particular thing<br />
you do? For example, when I met Feynman at Los Alamos, I knew he was going to<br />
get a Nobel Prize. I didn&#8217;t know what for. But I knew darn well he was going to<br />
do great work. No matter what directions came up in the future, this man would<br />
do great work. And sure enough, he did do great work. It isn&#8217;t that you only do<br />
a little great work at this circumstance and that was luck, there are many<br />
opportunities sooner or later. There are a whole pail full of opportunities, of<br />
which, if you&#8217;re in this situation, you seize one and you&#8217;re great over there<br />
instead of over here. There is an element of luck, yes and no. Luck favors a<br />
prepared mind; luck favors a prepared person. It is not guaranteed; I don&#8217;t<br />
guarantee success as being absolutely certain. I&#8217;d say luck changes the odds,<br />
but there is some definite control on the part of the individual. </p>
<p>Go forth, then, and do great work! </p>
<p>(End of the General Research Colloquium Talk.) </p>
<p><b>BIOGRAPHICAL SKETCH OF RICHARD HAMMING</b> </p>
<p>Richard W. Hamming was born February 11, 1915, in Chicago, Illinois. His<br />
formal education was marked by the following degrees (all in mathematics): B.S.<br />
1937, University of Chicago; M.A. 1939, University of Nebraska; and Ph.D. 1942,<br />
University of Illinois. His early experience was obtained at Los Alamos<br />
1945-1946, i.e. at the close of World War II, where he managed the computers<br />
used in building the first atomic bomb. From there he went directly to Bell<br />
Laboratories where he spent thirty years in various aspects of computing,<br />
numerical analysis, and management of computing, i.e. 1946-1976. On July 23,<br />
1976 he &#8216;moved his office&#8217; to the Naval Postgraduate School in Monterey,<br />
California where he taught, supervised research, and wrote books. </p>
<p>While at Bell Laboratories, he took time to teach in Universities, sometimes<br />
locally and sometimes on a full sabbatical leave; these activities included<br />
visiting professorships at New York University, Princeton University<br />
(Statistics), City College of New York, Stanford University, 1960-61, Stevens<br />
Institute of Technology (Mathematics), and the University of California, Irvine,<br />
1970-71. </p>
<p>Richard Hamming has received a number of awards which include: Fellow, IEEE,<br />
1968; the ACM Turing Prize, 1968; the IEEE Emanuel R. Piore Award, 1979; Member,<br />
National Academy of Engineering, 1980; and the Harold Pender Award, U. Penn.,<br />
1981. In 1987 a major IEEE award was named after him, namely the Richard W.<br />
Hamming Medal, &#8220;For exceptional contributions to information sciences and<br />
systems&#8221;; fittingly, he was also the first recipient of this award, 1988. In<br />
1996 in Munich he received the prestigious \$130,000 Eduard Rhein Award for<br />
Achievement in Technology for his work on error correcting codes. He was both a<br />
Founder and Past President of ACM, and a Vice Pres. of the AAAS Mathematics<br />
Section. </p>
<p>He is probably best known for his pioneering work on error-correcting codes,<br />
his work on integrating differential equations, and the spectral window which<br />
bears his name. His extensive writing has included a number of important,<br />
pioneering, and highly regarded books. These are: </p>
</p>
<ul>
<li><i>Numerical Methods for Scientists and Engineers</i>, McGraw-Hill, 1962;<br />
  Second edition 1973; Reprinted by Dover 1985; Translated into Russian.
  </li>
<li><i>Calculus and the Computer Revolution</i>, Houghton-Mifflin, 1968.
  </li>
<li><i>Introduction to Applied Numerical Analysis</i>, McGraw-Hill, 1971.
  </li>
<li><i>Computers and Society</i>, McGraw-Hill, 1972.
  </li>
<li><i>Digital Filters</i>, Prentice-Hall, 1977; Second edition 1983; Third<br />
  edition 1989; translated into several European languages.
  </li>
<li><i>Coding and Information Theory</i>, Prentice-Hall, 1980; Second edition<br />
  1986.
  </li>
<li><i>Methods of Mathematics Applied to Calculus, Probability and<br />
  Statistics</i>, Prentice-Hall, 1985.
  </li>
<li><i>The Art of Probability for Scientists and Engineers</i>,<br />
  Addison-Wesley, 1991.
  </li>
<li><i>The Art of Doing Science and Engineering: Learning to Learn</i>, Gordon<br />
  and Breach, 1997. </li>
</ul>
<p>He continued a very active life as Adjunct Professor, teaching and writing in<br />
the Mathematics and Computer Science Departments at the Naval Postgraduate<br />
School, Monterey, California for another twenty-one years before he retired to<br />
become Professor Emeritus in 1997. He was still teaching a course in the fall of<br />
1997. He passed away unexpectedly on January 7, 1998. </p>
<p><b>ACKNOWLEDGEMENT</b> </p>
<p>I would like to acknowledge the professional efforts of Donna Paradise of the<br />
Word Processing Center who did the initial transcription of the talk from the<br />
tape recording. She made my job of editing much easier. The errors of sentence<br />
parsing and punctuation are mine and mine alone. Finally I would like to express<br />
my sincere appreciation to Richard Hamming and Alan Chynoweth for all of their<br />
help in bringing this transcription to its present readable state. </p>
<p>J. F. Kaiser </p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2005/07/26/you-and-your-research/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Subscribe to ECCC Newsletter</title>
		<link>http://magic.aladdin.cs.cmu.edu/2005/07/22/subscribe-to-eccc-newsletter/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2005/07/22/subscribe-to-eccc-newsletter/#comments</comments>
		<pubDate>Sat, 23 Jul 2005 00:36:28 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/?p=131</guid>
		<description><![CDATA[Besides the mailing list of arXiv.org, I also recommend subscribing to the newsletter of ECCC. It&#8217;s pretty simple: just go to http://eccc.uni-trier.de/eccc/info/subscribe.html and you can submit your request there.
The benefit? You get to know some of the hottest results out there, right in your mailbox!
For example, this is what I got this morning:


From: Electronic Colloquium [...]]]></description>
			<content:encoded><![CDATA[<p>Besides the <a href="http://magic.aladdin.cs.cmu.edu/2005/04/20/subscribe-to-the-arxiv-mailing-list/">mailing list of arXiv.org</a>, I also recommend subscribing to the newsletter of <a href="http://eccc.uni-trier.de/eccc/">ECCC</a>. It&#8217;s pretty simple: just go to <a href="http://eccc.uni-trier.de/eccc/info/subscribe.html">http://eccc.uni-trier.de/eccc/info/subscribe.html</a> and you can submit your request there.</p>
<p>The benefit? You get to know some of the hottest results out there, right in your mailbox!</p>
<p>For example, this is what I got this morning:<br />
<span id="more-131"></span></p>
<p><code><br />
From: Electronic Colloquium in Computational Complexity &lt;eccc@eccc.uni-trier.de&gt;<br />
To: theory-a@listserv.nodak.edu<br />
Date: Fri, 22 Jul 2005 17:06:41 +0200 (CEST)<br />
Subject: Newly published ECCC reports (ECCC Newsletter)</p>
<p>The following new ECCC reports have been published:<br />
===================================================</p>
<p>TR05-074<br />
 Li-Sha HUANG, Xiaotie DENG:</p>
<p> On Complexity of Market Equilibria with Maximum Social Welfare</p>
<p>  Abstract:<br />
  We consider the computational complexity of the market equilibrium<br />
  problem by exploring the structural properties of the Leontief<br />
  exchange economy. We prove that, for economies guaranteed to have<br />
  a market equilibrium, finding one with maximum social welfare or<br />
  maximum individual welfare is NP-hard. In addition, we prove that<br />
  counting the number of equilibrium prices is #P-hard.</p>
<p>  Keywords: Computational Complexity,<br />
            NP-hardness,<br />
            Market Equilibrium,<br />
            Leontief Economy</p>
<p>TR05-073<br />
 Oded Goldreich and Dana Ron.:</p>
<p> Approximating Average Parameters of Graphs.</p>
<p>  Abstract:<br />
  Inspired by Feige ({em 36th STOC}, 2004), we initiate a study of<br />
  sublinear randomized algorithms for approximating average parameters<br />
  of a graph. Specifically, we consider the average degree of a graph<br />
  and the average distance between pairs of vertices in a graph.<br />
  Since our focus is on sublinear algorithms, these algorithms<br />
  access the input graph via queries to an adequate oracle.<br />
  We consider two types of queries. The first type is standard<br />
  neighborhood queries (i.e., {em what is the $i^xth$ neighbor of<br />
  vertex $v$?}), whereas the second type are queries regarding the<br />
  quantities that we need to find the average of (i.e., {em what is<br />
  the degree of vertex $v$?}/ and {em what is the distance between $u$<br />
  and $v$?}, respectively).<br />
  Loosely speaking, our results indicate a difference between the<br />
  two problems: For approximating the average degree,<br />
  the standard neighbor queries suffice and in fact are preferable<br />
  to degree queries. In contrast, for approximating average distances,<br />
  the standard neighbor queries are of little help whereas distance<br />
  queries are crucial.</p>
<p>  Keywords: Sublinear-time,<br />
            randomness,<br />
            approximation.</p>
<p>TR05-072<br />
 Christian Glasser, Alan L. Selman, Liyu Zhang:</p>
<p> Survey of Disjoint NP-Pairs and Relations to Propositional<br />
 Proof Systems</p>
<p>  Abstract:<br />
  We survey recent results on disjoint NP-pairs.  In particular, we<br />
  survey the relationship of disjoint NP-pairs to the theory of proof<br />
  systems for propositional calculus.</p>
<p>TR05-071<br />
 Marius Zimand:</p>
<p> Simple extractors via constructions of cryptographic pseudo-random<br />
 generators</p>
<p>  Abstract:<br />
  Trevisan has shown that constructions of pseudo-random generators from<br />
  hard functions (the Nisan-Wigderson approach) also produce extractors.<br />
  We show that constructions of pseudo-random generators from one-way<br />
  permutations (the Blum-Micali-Yao approach) can be used for building<br />
  extractors as well. Using this new technique we build extractors that<br />
  do not use designs or polynomial-based error-correcting codes and<br />
  that are very simple and efficient. For example, one extractor<br />
  produces each output bit separately in $O(log2 n)$ time.<br />
  These extractors work for weak sources with min entropy $lambda n$,<br />
  for arbitrary  constant $lambda > 0$, have seed length $O(log2 n)$,<br />
  and their output length is $approx n^{lambda/3}$.</p>
<p>  Keywords: extractor,<br />
            pseudo-random generator,<br />
            one-way permutation</p>
<p>TR05-070<br />
 Mahdi Cheraghchi:</p>
<p> On Matrix Rigidity and the Complexity of Linear Forms</p>
<p>  Abstract:<br />
  The rigidity function of a matrix is defined as the minimum number of<br />
  its entries that need to be changed in order to reduce the rank of<br />
  the matrix to below a given parameter. Proving a strong enough lower<br />
  bound on the rigidity of a matrix implies a nontrivial lower bound on<br />
  the complexity of any linear circuit computing the set of linear<br />
  forms associated with it. However, although it is shown that most<br />
  matrices are rigid enough, no explicit construction of a rigid family<br />
  of matrices is known.<br />
  In this survey report we review the concept of rigidity and some of<br />
  its interesting variations as well as several notable results related<br />
  to that. We also show the existence of highly rigid matrices<br />
  constructed by evaluation of bivariate polynomials over finite fields.</p>
<p>  Keywords: Matrix Rigidity,<br />
            Low Level Complexity,<br />
            Circuit Complexity,<br />
            Linear Forms</p>
<p>TR05-069<br />
 Piotr Berman, Marek Karpinski:</p>
<p> 8/7-Approximation Algorithm for (1,2)-TSP</p>
<p>  Abstract:<br />
  We design a polynomial time 8/7-approximation algorithm for the<br />
  Traveling Salesman Problem in which all distances are either one or<br />
  two. This improves over the best known approximation factor of 7/6<br />
  for that problem. As a direct  application we get a 7/6-approximation<br />
  algorithm for the Maximum Path Cover Problem, similarily improving<br />
  upon the best known approximation factor for that problem. The result<br />
  depends on a new method of consecutive path cover improvements and<br />
  on a new analysis of certain related color alternating paths. This<br />
  method could be of independent interest.</p>
<p>  Keywords: Approximation Algorithms,<br />
            Approximations Factors,<br />
            Metric TSP,<br />
            Path Cover Problems,<br />
            Alternating Paths,<br />
            Justification Points,<br />
            Consistency,<br />
            Small Step Improvements</p>
<p>TR05-068<br />
 Christian Glasser, A. Pavan, Alan L. Selman, Liyu Zhang:</p>
<p> Redundancy in Complete Sets</p>
<p>  Abstract:<br />
  We show that a set is m-autoreducible if and only if it is m-mitotic.<br />
  This solves a long standing open question in a surprising way. As a<br />
  consequence of this unconditional result and recent work by Glasser<br />
  et al., complete sets for all of the following complexity classes are<br />
  m-mitotic: NP, coNP, ParityP, PSPACE, and NEXP, as well as all<br />
  levels of PH, MODPH, and the Boolean hierarchy over NP. In the cases<br />
  of NP, PSPACE, NEXP, and PH, this at once answers several<br />
  well-studied open questions. These results tell us that complete<br />
  sets share a redundancy that was not known before.<br />
  We disprove the equivalence between autoreducibility and mitoticity<br />
  for all polynomial-time-bounded reducibilities between<br />
  3-tt-reducibility and Turing- reducibility: There exists a sparse set<br />
  in EXP that is polynomial-time 3-tt- autoreducible, but not weakly<br />
  polynomial-time T-mitotic. In particular, polynomial-time<br />
  T-autoreducibility does not imply polynomial-time weak T- mitoticity,<br />
  which solves an open question by Buhrman and Torenvliet.<br />
  We generalize autoreducibility to define poly-autoreducibility and<br />
  give evidence that NP-complete sets are poly-autoreducible.</p>
<p>TR05-067<br />
 Zeev Dvir, Amir Shpilka:</p>
<p> An Improved Analysis of Mergers</p>
<p>  Abstract:<br />
  Mergers are functions that transform k (possibly dependent) random<br />
  sources into a single random source, in a way that ensures that if<br />
  one of the input sources has min-entropy rate $delta$ then the<br />
  output has min-entropy rate close to $delta$. Mergers have proven to<br />
  be a very useful tool in explicit constructions of extractors and<br />
  condensers, and are also interesting objects in their own right. In<br />
  this work we present a new analysis of the merger construction of<br />
  [LRVW03]. Our analysis shows that the min-entropy rate of this<br />
  merger's output is actually $0.52*delta$ instead of $0.5*delta$,<br />
  where $delta$ is the min-entropy rate of one of the inputs. To obtain<br />
  this result we deviate from the usual linear algebra methods that<br />
  were used by [LRVW03] and introduce a new technique that involves<br />
  results from additive number theory.</p>
<p>  Keywords: extractors,<br />
            mergers,<br />
            randomness</p>
<p>TR05-066<br />
 Jakob Nordstroem:</p>
<p> Narrow Proofs May Be Spacious: Separating Space and Width in Resolution</p>
<p>  Abstract:<br />
  The width of a resolution proof is the maximal number of literals in<br />
  any clause of the proof. The space of a proof is the maximal number<br />
  of memory cells used if the proof is only allowed to resolve on<br />
  clauses kept in memory. Both of these measures have previously been<br />
  studied and related to the refutation size of unsatisfiable CNF<br />
  formulas. Also, the resolution refutation space of a formula has been<br />
  proven to be at least as large as the refutation width, but it has<br />
  remained unknown whether space can be separated from width or the<br />
  two measures coincide asymptotically. We prove that there is a family<br />
  of k-CNF formulas for which the refutation width in resolution is<br />
  constant but the refutation space is non-constant, thus solving an<br />
  open problem mentioned in several previous papers.</p>
<p>  Keywords: proof complexity,<br />
            resolution,<br />
            width, space,<br />
            separation,<br />
            lower bound,<br />
            pebble game</p>
<p>TR05-065<br />
 Alexander Barvinok, Alex Samorodnitsky:</p>
<p> Random Weighting, Asymptotic Counting, and Inverse Isoperimetry</p>
<p>  Abstract:<br />
  For a family X of k-subsets of the set 1...n, let |X| be the<br />
  cardinality of X and let Gamma(X, mu) be the expected maximum weight<br />
  of a subset from X when the weights of 1...n are chosen independently<br />
  at random from a symmetric probability distribution mu on R. We<br />
  consider the inverse isoperimetric problem of finding mu for which<br />
  Gamma(X, mu) gives the best estimate of ln |X|.<br />
  We prove that the optimal choice of mu is the logistic distribution,<br />
  in which case Gamma(X, mu) provides an asymptotically tight estimate<br />
  of ln |X| as k^{-1} ln |X| grows. Since in many important cases<br />
  Gamma(X, mu) can be easily computed, we obtain computationally<br />
  efficient approximation algorithms for a variety of counting problems.<br />
  Given mu, we describe families X of a given cardinality with the<br />
  minimum value of Gamma(X, mu), thus extending and sharpening various<br />
  isoperimetric inequalities in the Boolean cube.</p>
<p>TR05-064<br />
 Howard Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:</p>
<p> On earthmover distance, metric labeling, and 0-extension</p>
<p>  Abstract:<br />
  We study the classification problem {sc Metric Labeling} and its<br />
  special case {sc 0-Extension} in the context of earthmover metrics.<br />
  Researchers recently proposed using earthmover metrics to get a<br />
  polynomial time-solvable relaxation of {sc Metric Labeling};  until<br />
  now, however, no one knew if the integrality ratio was constant or<br />
  not, for either {sc Metric Labeling} or {sc 0-Extension}. We prove<br />
  * that the integrality ratio of the earthmover relaxation for<br />
    {sc Metric Labeling} is $Omega(log k)$, $k$ being the number of<br />
    labels (this bound is tight), whereas the best previous lower bound<br />
    on the integrality ratio was constant;<br />
  * that the integrality ratio of the earthmover relaxation for<br />
    {sc 0-Extension} is $Omega(sqrt{log k})$, $k$ being the number of<br />
    terminals (the integrality ratio was known to be<br />
    $O((log k)/loglog k)$), whereas  the best previous lower bound was<br />
    constant;<br />
  * that for no $epsilon>0$ is there a polynomial-time<br />
    $O((log n)^{1/4-eps})$-approximation algorithm for<br />
    {sc 0-Extension}, $n$ being the number of vertices, unless<br />
    NP$subseteq$DTIME$(n^{poly(log n)})$, whereas the strongest<br />
    inapproximability result known before was MAX SNP-hardness; and<br />
  * that there is a polynomial-time approximation algorithm for<br />
    {sc 0-Extension} with performance ratio $O(sqrt{diam(d)})$, where<br />
    $diam(d)$ is the ratio of largest distance to smallest nonzero<br />
    distance in the terminal metric.</p>
<p>TR05-063<br />
 Bodo Manthey, Ruediger Reischuk:</p>
<p> Smoothed Analysis of the Height of Binary Search Tress</p>
<p>  Abstract:<br />
  Binary search trees are one of the most fundamental data structures.<br />
  While the height of such a tree may be linear in the worst case, the<br />
  average height with respect to the uniform distribution is only<br />
  logarithmic. The exact value is one of the best studied problems in<br />
  average case complexity.</p>
<p>  Keywords: Smoothed Analysis,<br />
            Binary Search Trees,<br />
            Discrete Perturbations,<br />
            Permutations</p>
<p>TR05-062<br />
 A. Pavan, N. V. Vinodchandran:</p>
<p> 2-Local Random Reductions to 3-Valued Functions</p>
<p>  Abstract:<br />
  Yao (in a lecture at DIMACS Workshop on structural complexity and<br />
  cryptography) showed that if a language L is 2-locally-random<br />
  reducible to a  Boolean functio, then L is in PSPACE/poly.<br />
  Fortnow and Szegedy quantitatively improved Yao's result to show that<br />
  such languages are in fact in NP/poly (Information Processing Letters,<br />
  1992).<br />
  In this paper we extend Yao's result to show that if a language L<br />
  is 2-locally-random reducible to a target function which takes values<br />
  in {0,1,2}, then L is in PSPACE/poly.</p>
<p>  Keywords: local random reductions</p>
<p>TR05-061<br />
 Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:</p>
<p> On the Error Parameter of Dispersers</p>
<p>  Abstract:<br />
  Optimal dispersers have better dependence on the error than<br />
  optimal extractors. In this paper we give explicit disperser<br />
  constructions that beat the best possible extractors in some<br />
  parameters. Our constructions are not strong, but we show that<br />
  having such explicit strong constructions implies a solution<br />
  to the Ramsey graph construction problem.</p>
<p>  Keywords: Dispersers,<br />
            Extractors,<br />
            Expander Graphs,<br />
            Ramsey Graphs</p>
<p>=======================================================================</p>
<p>Online access to ECCC is available via the following network services:</p>
<p>FTP: ftp.eccc.uni-trier.de:/pub/eccc/<br />
WWW: http://www.eccc.uni-trier.de/eccc/<br />
</code></p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2005/07/22/subscribe-to-eccc-newsletter/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Depth through Breadth?</title>
		<link>http://magic.aladdin.cs.cmu.edu/2005/04/27/depth-through-breadth/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2005/04/27/depth-through-breadth/#comments</comments>
		<pubDate>Wed, 27 Apr 2005 16:26:42 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Discussion]]></category>
		<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/2005/04/27/depth-through-breadth/</guid>
		<description><![CDATA[Over the years I have heard many opinions from graduate students about going to talks  not related to their research interests. My impression is that more and more students feel that they should skip such talks because:

The talk is in an area that they are not familiar with. (&#8220;This talk will be way over [...]]]></description>
			<content:encoded><![CDATA[<p>Over the years I have heard many opinions from graduate students about going to talks <em> not</em> related to their research interests. My impression is that more and more students feel that they should skip such talks because:</p>
<ul>
<li>The talk is in an area that they are not familiar with. (&#8220;This talk will be way over my head.&#8221;)</li>
<li>They have more important things to do. (&#8220;My adviser will not go to such talks either.&#8221;)</li>
<li>Many talks are usually difficult to follow. (&#8220;It&#8217;s easier to directly read the paper.&#8221;)</li>
</ul>
<p>As some of you may know, recently Avi Wigderson gave a talk in STOC 2004 about <a href="http://www.math.ias.edu/~avi/TALKS/">why we should listen to talks in other areas</a>. He really seems to have some convincing arguments about why knowing other areas can help your own research. I won&#8217;t repeat them here.</p>
<p>And even though the opinion of a small potato like me doesn&#8217;t carry any weight, let me add to his list from a less utilitarian perspective (I do not claim Avi&#8217;s talk was utilitarian but the motivation he gave in his talk was certainly targeted to convince you of the benefits):</p>
<ul>
<li>Manuel Blum once told me that &#8220;a PhD should be someone who knows everything about something and something about everything&#8221; and I believe him.</li>
<li>I feel that even very productive graduate students should have more time than their advisers.</li>
<li>As a community (if it ever existed), we should show up to community events, even just to show our support and appreciation to the speaker and the community itself. (I know this is mostly a culture thing. I am a Chinese and we treasure fellowship.)</li>
</ul>
<p>What do you think?</p>
<p>P.S. I am spending the last 25 minutes to write this post because today one of our weekly &#8220;community event&#8221; scheduled at this time has been canceled due to various reasons. I don&#8217;t blame anyone for this. We all have our priorities and I respect that. (I lament only solely because there is a lack of free food. You believe me, right? <img src='http://magic.aladdin.cs.cmu.edu/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> )</p>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2005/04/27/depth-through-breadth/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Subscribe to the arXiv mailing list</title>
		<link>http://magic.aladdin.cs.cmu.edu/2005/04/20/subscribe-to-the-arxiv-mailing-list/</link>
		<comments>http://magic.aladdin.cs.cmu.edu/2005/04/20/subscribe-to-the-arxiv-mailing-list/#comments</comments>
		<pubDate>Wed, 20 Apr 2005 13:57:39 +0000</pubDate>
		<dc:creator>Maverick Woo</dc:creator>
				<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://magic.aladdin.cs.cmu.edu/2005/04/20/subscribe-to-the-arxiv-mailing-list/</guid>
		<description><![CDATA[First, I thank Anupam for telling me about this.
By subscribing to the arXiv mailing list on the subjects that you are interested in, you will get to know what has been submitted to arXiv recently.
Go to http://arxiv.org/archive/cs/cssub.html for more information on how to subscribe and what areas are available.
For example, this is my subscription email.
To: [...]]]></description>
			<content:encoded><![CDATA[<p>First, I thank Anupam for telling me about this.</p>
<p>By subscribing to the arXiv mailing list on the subjects that you are interested in, you will get to know what has been submitted to arXiv recently.</p>
<p>Go to <a href="http://arxiv.org/archive/cs/cssub.html">http://arxiv.org/archive/cs/cssub.html</a> for more information on how to subscribe and what areas are available.</p>
<p>For example, this is my subscription email.</p>
<pre>To: cs@arXiv.org
Subject: subscribe Maverick Woo

add Data Structures and Algorithms
add Discrete Mathematics
add Computational Complexity</pre>
<p>And this is what I got yesterday:<br />
<span id="more-22"></span></p>
<pre>From: send mail ONLY to cs <no -reply@arXiv.org>
To: cs daily title/abstract distribution <rabble @arXiv.org>
Date: Tue, 19 Apr 2005 07:51:40 -0400
Subject: cs daily Subj-class mailing 42 1

------------------------------------------------------------------------------
------------------------------------------------------------------------------
send mail only to cs@arXiv.org, do not reply to no-reply@...
send any complaints regarding submissions directly to submitter.
use a single `get' to request multiple papers, `list macros' for available
macro packages, and `help' for a list of available commands and other info.
------------------------------------------------------------------------------
point your www client at http://arXiv.org/
To unsubscribe, e-mail To: cs@arXiv.org, Subject: cancel
------------------------------------------------------------------------------
 Submissions to:
Computational Complexity
Discrete Mathematics
 received from  Fri 15 Apr 05 20:00:02 GMT  to  Mon 18 Apr 05 20:00:01 GMT
------------------------------------------------------------------------------
------------------------------------------------------------------------------
\
Paper: cs.DM/0504082
Date: Mon, 18 Apr 2005 13:45:09 GMT   (11kb)

Title: Coloring Artemis graphs
Authors: Benjamin L'{e}v\^{e}que (Leibniz - IMAG), Fr'{e}d'{e}ric Maffray
  (Leibniz - IMAG), Bruce Reed, Nicolas Trotignon (Leibniz - IMAG)
Proxy: ccsd ccsd-00004741
Subj-class: Discrete Mathematics
ACM-class: G.2.2
\
  We consider the class A of graphs that contain no odd hole, no antihole, and
no ``prism'' (a graph consisting of two disjoint triangles with three disjoint
paths between them). We show that the coloring algorithm found by the second
and fourth author can be implemented in time O(n^2m) for any graph in A with n
vertices and m edges, thereby improving on the complexity proposed in the
original paper.
\ ( http://arXiv.org/abs/cs/0504082 ,  11kb)
%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-
------------------------------------------------------------------------------
\
Paper (*cross-listing*): cond-mat/0504070
Date: Mon, 4 Apr 2005 09:42:16 GMT   (21kb)

Title: Clustering of solutions in the random satisfiability problem
Authors: M. Mezard, T. Mora, R. Zecchina
Comments: 4 pages, 1 figure
Subj-class: Disordered Systems and Neural Networks; Computational Complexity
\
  Using elementary rigorous methods we prove the existence of a clustered phase
in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are
grouped into clusters which are far away from each other. The results are in
agreement with previous predictions of the cavity method and give a rigorous
confirmation to one of its main building blocks. It can be generalized to other
systems of both physical and computational interest.
\ ( http://arXiv.org/abs/cond-mat/0504070 ,  21kb)
------------------------------------------------------------------------------
\
Paper: cs.GT/0504075
Date: Fri, 15 Apr 2005 22:11:55 GMT   (120kb,S)

Title: Dichotomy for Voting Systems
Authors: Edith Hemaspaandra and Lane A. Hemaspaandra
Report-no: URCS-TR-2005-861
Subj-class: Computer Science and Game Theory; Computational Complexity;
  Multiagent Systems
ACM-class: I.2.11; F.1.3; F.2.2
\
  Scoring protocols are a broad class of voting systems. Each is defined by a
vector $(\alpha_1,\alpha_2,...,\alpha_m)$, $\alpha_1 \geq \alpha_2 \geq >...
\geq \alpha_m$, of integers such that each voter contributes $\alpha_1$ points
to his/her first choice, $\alpha_2$ points to his/her second choice, and so on,
and any candidate receiving the most points is a winner.
  What is it about scoring-protocol election systems that makes some have the
desirable property of being NP-complete to manipulate, while others can be
manipulated in polynomial time? We find the complete, dichotomizing answer:
Diversity of dislike. Every scoring-protocol election system having two or more
point values assigned to candidates other than the favorite--i.e., having
$||\{\alpha_i \condition 2 \leq i \leq m\}||\geq 2$--is NP-complete to
manipulate. Every other scoring-protocol election system can be manipulated in
polynomial time. In effect, we show that--other than trivial systems (where all
candidates alway tie), plurality voting, and plurality voting's transparently
disguised translations--\emph{every} scoring-protocol election system is
NP-complete to manipulate.
\ ( http://arXiv.org/abs/cs/0504075 ,  120kb)
%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%--%%
------------------------------------------------------------------------------
\
Paper: cs.DM/0405059
replaced with revised version Mon, 18 Apr 2005 05:40:46 GMT   (11kb)

Title: Coloring Meyniel graphs in linear time
Authors: Benjamin L'{e}v\^{e}que (Leibniz - IMAG), Fr'{e}d'{e}ric Maffray
  (Leibniz - IMAG)
Proxy: ccsd ccsd-00001574
Subj-class: Discrete Mathematics; Combinatorics
ACM-class: G.2.2
\ ( http://arXiv.org/abs/cs/0405059 ,  11kb)
%%%---%%%---%%%---%%%---%%%---%%%---%%%---%%%---%%%---%%%---%%%---%%%---%%%---
</rabble></no></pre>
]]></content:encoded>
			<wfw:commentRss>http://magic.aladdin.cs.cmu.edu/2005/04/20/subscribe-to-the-arxiv-mailing-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
