<?xml version="1.0" encoding="UTF-8"?>
<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>Win-Vector Blog &#187; Opinion</title>
	<atom:link href="http://www.win-vector.com/blog/category/opinion/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.win-vector.com/blog</link>
	<description>The Applied Theorist&#039;s Point of View</description>
	<lastBuildDate>Thu, 29 Jul 2010 17:09:49 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Must Have Software</title>
		<link>http://www.win-vector.com/blog/2010/05/must-have-software/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=must-have-software</link>
		<comments>http://www.win-vector.com/blog/2010/05/must-have-software/#comments</comments>
		<pubDate>Fri, 28 May 2010 17:26:07 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Computers]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Tutorials]]></category>
		<category><![CDATA[Excel]]></category>
		<category><![CDATA[git]]></category>
		<category><![CDATA[GnuPG]]></category>
		<category><![CDATA[Keynote]]></category>
		<category><![CDATA[Latex]]></category>
		<category><![CDATA[Must Have Software]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[R]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[Tools]]></category>
		<category><![CDATA[TrueCrypt]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=1461</guid>
		<description><![CDATA[Having worked with Unix (BSD, HPUX, IRIX, Linux and OSX), Windows (NT4, 2000, XP, Vista and 7) for quite a while I have seen a lot of different software tools. I would like to quickly exhibit my &#8220;must have&#8221; list. These are the packages that I find to be the single &#8220;must have offerings&#8221; in [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2009/07/microsoft-store-again/' rel='bookmark' title='Permanent Link: Microsoft Store Again'>Microsoft Store Again</a></li>
<li><a href='http://www.win-vector.com/blog/2009/01/exciting-technique-1-the-r-language/' rel='bookmark' title='Permanent Link: Exciting Technique #1: The &#8220;R&#8221; language.'>Exciting Technique #1: The &#8220;R&#8221; language.</a></li>
<li><a href='http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/' rel='bookmark' title='Permanent Link: Public Service Article: JSTOR and other Useful Research Archives'>Public Service Article: JSTOR and other Useful Research Archives</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>Having worked with Unix (BSD, HPUX, IRIX, Linux and OSX), Windows (NT4, 2000, XP, Vista and 7) for quite a while I have seen a lot of different software tools.  I would like to quickly exhibit my &#8220;must have&#8221; list.  These are the packages that I find to be the single &#8220;must have offerings&#8221; in a number of categories.  I have avoided some categories (such as editors, email programs, programing language, IDEs, photo editors, backup solutions, databases, database tools and web tools) where I have no feeling of having seen a single absolute best offering.</p>
<p>The spirit of the list is to pick items such that: if you disagree with an item in this list then either you are wrong or you know something I would really like to hear about.</p>
<p><span id="more-1461"></span></p>
<dl>
<dt><strong>Encryption, disk images: <a href="http://www.truecrypt.org/" target="ext">TrueCrypt</a> (open source: Linux, Windows, OSX)</strong></dt>
<dd>TrueCrypt can create portable encrypted virtual disks (files that can be mounted as a disk on any operating system).</dd>
<dd></dd>
<dt><strong>Encryption, files: <a href="http://www.gnupg.org/" target="ext">GnuPG</a> (open source: Linux, Windows, OSX)</strong></dt>
<dd>GnuPG is the tool to use to encrypt files for email.</dd>
<dd></dd>
<dt><strong>Presentation: <a href="http://www.apple.com/iwork/keynote/" target="ext">Apple Keynote</a> (commercial: OSX)</strong></dt>
<dd>Keynote is not quite as friendly as Microsoft PowerPoint, but it quickly produces beautiful presentations.</dd>
<dt><strong>Reference Library: <a href="http://mekentosj.com/papers/" target="ext">Papers</a> (commercial: OSX)</strong></dt>
<dd>&#8220;iTunes for PDF.&#8221;  Manage thousands of PDFs and references, annotate with meta-data, place papers into multiple project folders.  An interesting runner-up is <a href="http://bibdesk.sourceforge.net/" target="ext">BibDesk</a> (open source: OSX).</dd>
<dt><strong>Spreadsheet: <a href="http://office.microsoft.com/en-gb/excel/default.aspx" target="ext">Microsoft Excel</a> (commercial: Windows, OSX)</strong></dt>
<dd>Open Office and Google Docs are getting better every day, but neither come close to Microsoft Excel in functionality and versatility of user interface.  If you are on a platform that supports Excel, working regularly with spreadsheets and using something other than Excel: it really means that you do not value your time.</dd>
<dt><strong>Statistics Software: <a href="http://www.r-project.org/" target="ext">R</a> (open source: Linux, Windows, OSX)</strong></dt>
<dd>R is rapidly becoming the platform of choice for statisticians and is (with the addition of lattice and ggplot2) the best way to produce graphs.  R has fairly nasty programming language, but has so many statistical operations available that it can not be avoided.</dd>
<dt><strong>Technical Documentation: <a href="http://www.tug.org/" target="ext">LaTeX</a> (open source: Linux, Windows, OSX)</strong></dt>
<dd>It may seem antiquated but TeX/LaTex is still far more powerful than the &#8220;WSYWYG&#8221; pretenders.  The separation of presentation from specification, automatic management of references, table of contents and being able<br />
to include PDFs from external files (which get refreshed when you re-build the document) are all lifesavers.</dd>
<dt><strong>Version Control: <a href="http://git-scm.com/" target="ext">git</a> (open source: Linux, Windows, OSX)</strong></dt>
<dd>Just about the only version control system that: doesn&#8217;t damage the data you are trying to manage by adding dot-files into all of the directories, can routinely handle large files and can work productively without a network connection.  <a href="http://www.perforce.com/" target="ext">Perforce</a> is powerful central server commercial option (with the ability to have central policies, control and review).
</dd>
</dl>
<p></p>
<p>I look forward to learning which of my choices are considered poor and what your must-haves are.</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2009/07/microsoft-store-again/' rel='bookmark' title='Permanent Link: Microsoft Store Again'>Microsoft Store Again</a></li>
<li><a href='http://www.win-vector.com/blog/2009/01/exciting-technique-1-the-r-language/' rel='bookmark' title='Permanent Link: Exciting Technique #1: The &#8220;R&#8221; language.'>Exciting Technique #1: The &#8220;R&#8221; language.</a></li>
<li><a href='http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/' rel='bookmark' title='Permanent Link: Public Service Article: JSTOR and other Useful Research Archives'>Public Service Article: JSTOR and other Useful Research Archives</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2010/05/must-have-software/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>SIGACT Review of: Combinatorics the Rota Way</title>
		<link>http://www.win-vector.com/blog/2010/04/sigact-review-of-combinatorics-the-rota-way/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=sigact-review-of-combinatorics-the-rota-way</link>
		<comments>http://www.win-vector.com/blog/2010/04/sigact-review-of-combinatorics-the-rota-way/#comments</comments>
		<pubDate>Wed, 21 Apr 2010 03:51:56 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Book Reviews]]></category>
		<category><![CDATA[Combinatorics]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=1450</guid>
		<description><![CDATA[SIGACT News review of: Combinatorics the Rota Way. Also found on Professor Gasarch&#8217;s page and ACM SIGACT News Volume 41, Issue 2 (paywall) Review of Combinatorics The Rota Way by Joseph P.S. Kung, Gian-Carlo Rota and Catherine H. Yan Cambridge, 2009 396 pages, Trade Paperback Review by John Mount, jmount@win-vector.com April 20, 2010 Introduction Combinatorics, [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/08/what-is-mathematics-really/' rel='bookmark' title='Permanent Link: What is Mathematics, Really?'>What is Mathematics, Really?</a></li>
<li><a href='http://www.win-vector.com/blog/2009/05/the-joy-of-calculation/' rel='bookmark' title='Permanent Link: The Joy of Calculation'>The Joy of Calculation</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/sorting-in-anger/' rel='bookmark' title='Permanent Link: Sorting Used in Anger'>Sorting Used in Anger</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>SIGACT News review of: Combinatorics the Rota Way.  Also found on <a href="http://www.cs.umd.edu/~gasarch/bookrev/41-2.pdf" target="ext">Professor Gasarch&#8217;s page</a> and  <a href="http://portal.acm.org/browse_dl.cfm?idx=J697" target="ext">ACM SIGACT News Volume 41, Issue 2 (paywall)</a></p>
<p><span id="more-1450"></span></p>
<div align="center"><b>Review of<br />
Combinatorics The Rota Way<br />
by Joseph P.S. Kung, Gian-Carlo Rota and Catherine H. Yan<br />
Cambridge, 2009<br />
396 pages, Trade Paperback</b></div>
<div align="center"><b>Review by<br />
John Mount, jmount@win-vector.com<br />
April 20, 2010</b></div>
<h1><a name="SECTION00010000000000000000">Introduction</a></h1>
<p>Combinatorics, as it matures, becomes harder to succinctly describe. The field has progressed from the basic study of finite sets and counting techniques to being the discipline where questions involving counting, graphs, connectivity, mappings and partial orders all naturally reside. But the objects that combinatorics studies turn out not to be the correct foundation to support modern combinatorial methods. Many combinatorial methods were dismissed as mere technique until combinatorics expanded to include the natural domains of these methods: lattices, formal power series, valuation rings, matroids and many diverse algebras. One person who pushed hard for this coherence and unity was Gian-Carlo Rota.</p>
<p>An example of a high-school level combinatorial trick is proving the equation</p>
<div align="center"><img width="101" height="60" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg1.png" alt="$\displaystyle \sum_{i=0}^{n} \binom{n}{i} = 2^n $"></div>
<p>by applying the binomial theorem to <img width="61" height="31" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg2.png" alt="$ (1+1)^n$"> . This trick is transformed into a method when you recognize that you really should be working in the ring of formal power series and invent the Umbral Calculus. With the Umbral Calculus you can use the equivalence of the following two equations:</p>
<div align="center">
<table cellpadding="0" align="center" width="100%">
<tr valign="middle">
<td nowrap align="right"><img width="20" height="30" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg3.png" alt="$\displaystyle b^n$"></td>
<td width="10" align="center" nowrap><img width="17" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg4.png" alt="$\displaystyle =$"></td>
<td align="left" nowrap><img width="155" height="60" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg5.png" alt="$\displaystyle (a+1)^n = \sum_{i=0}^{n} \binom{n}{i} a^i$"></td>
<td width="10" align="right">&nbsp;</td>
</tr>
<tr valign="middle">
<td nowrap align="right"><img width="21" height="30" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg6.png" alt="$\displaystyle a^n$"></td>
<td width="10" align="center" nowrap><img width="17" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg4.png" alt="$\displaystyle =$"></td>
<td align="left" nowrap><img width="205" height="60" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg7.png" alt="$\displaystyle (b-1)^n = \sum_{i=0}^{n} (-1)^{n-i} \binom{n}{i} b^i$"></td>
<td width="10" align="right">&nbsp;</td>
</tr>
</table>
</div>
<p><br clear="all"><br />
(i.e. <img width="68" height="29" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg8.png" alt="$ b = a+1$"> is equivalent to <img width="68" height="29" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg9.png" alt="$ a=b-1$"> ) to prove that for any two arbitrary infinite sequences <img width="37" height="29" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg10.png" alt="$ a_i,b_i$"> the following two statements are also equivalent:</p>
<p></p>
<div align="center"><a name="eq1"></a><a name="eq2"></a><br />
<table cellpadding="0" align="center" width="100%">
<tr valign="middle">
<td nowrap align="right"><img width="20" height="29" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg11.png" alt="$\displaystyle b_n$"></td>
<td width="10" align="center" nowrap><img width="17" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg4.png" alt="$\displaystyle =$"></td>
<td align="left" nowrap><img width="81" height="60" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg12.png" alt="$\displaystyle \sum_{i=0}^{n} \binom{n}{i} a_i \;$">for all<img width="18" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg13.png" alt="$\displaystyle \; n$"></td>
<td width="10" align="right">(1)</td>
</tr>
<tr valign="middle">
<td nowrap align="right"><img width="21" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg14.png" alt="$\displaystyle a_n$"></td>
<td width="10" align="center" nowrap><img width="17" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg4.png" alt="$\displaystyle =$"></td>
<td align="left" nowrap><img width="133" height="60" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg15.png" alt="$\displaystyle \sum_{i=0}^{n} (-1)^{n-i} \binom{n}{i} b_i \;$">for all<img width="22" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg16.png" alt="$\displaystyle \; n.$"></td>
<td width="10" align="right">(2)</td>
</tr>
</table>
</div>
<p><br clear="all"><br />
For example: we could pick <img width="45" height="28" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg17.png" alt="$ a_i = i$"> and substitute it into Equation&nbsp;<a href="#eq1">1</a>. With some work we see this implies <img width="73" height="34" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg18.png" alt="$ b_i= 2^{i-1} i$"> .<a name="tex2html1" href="#foot43"><sup>1</sup></a>Then by the Umbral result we know Equation&nbsp;<a href="#eq2">2</a> must also be true so we get a new identity: <img width="186" height="34" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg22.png" alt="$ n = \sum_{i=0}^{n} (-1)^{n-i} \binom{n}{i} 2^{i-1} i$"> . This algebraic production of a new identity is very different than the classical method of &#8220;counting two ways&#8221; (or being lucky enough to come up with a clever bijection to prove the identity).</p>
<h1><a name="SECTION00020000000000000000">Summary</a></h1>
<p>The book &#8220;Combinatorics the Rota Way&#8221; is itself hard to succinctly describe. The first and third authors tell of writing this book using notes from the Massachusetts Institute of Technology&#8217;s course 18.315 collected over a span of more than 30 years. Gian-Carlo Rota himself was added as a posthumous author. The book itself contains more than a single course-year&#8217;s worth of material and is packed very densely.</p>
<p>The book&#8217;s emphasis is abstract and algebraic. The exercises are not to teach, but are instead to identify applications of combinatorics in other mathematical disciplines. The book is the product of a strong push to demonstrate many combinatorial methods in their most powerful, but not most obvious, forms. This work is clearly a labor of love and contains some remarkable material. However, due to the large breadth of the work not much time is spent on motivation or on concrete examples.</p>
<h2><a name="SECTION00021000000000000000">Chapter 1: Sets, Functions and Relations</a></h2>
<p>The first chapter covers the definitional foundations of combinatorics: sets, lattices, partial orders, functions and relations. These are the discrete objects that the book will reason about by later building more complicated algebraic objects. This section is very dense and reads like a compressed Bourbaki treatment of discrete mathematics.</p>
<p>One portion of this chapter that is problematic is the section on entropy that seems to serve no purpose other than to prepare the reader for exercise 1.4.10 which demonstrates an abstraction of entropy. Also, exercises 1.2.5(j,k) are needlessly cruel in asking the reader to recreate the Robertson-Seymour graph minor theorem. There have been books where the reader is successfully guided through a major result by exercises, such as the Weak Perfect Graph Theorem in Lov&aacute;sz&#8217;s &#8220;Combinatorial Problems and Exercises&#8221;, but this book is not structured in that manner.</p>
<h2><a name="SECTION00022000000000000000">Chapter 2: Matching Theory</a></h2>
<p>The second chapter is a welcome change in tone and opens with a quote from Harper and Rota describing matching theory and a clever 1979 Putnam exam problem is worked into the exercises and solutions. Central to the chapter is &#8220;marriage theorem&#8221;, which determines when matchings are possible. Also discussed is Birkhoff&#8217;s Theorem, which states that every doubly stochastic matrix is a convex combination of permutations matrices, which relates matchings to matrices. The text is lively and includes a number of well-researched asides, such as the origin of the name &#8220;The Hungarian Method.&#8221; However, there are some problems with forward reference: for example the reader is asked to work a couple of exercise (2.4.5 and 2.4.6) using the Binet-Cauchy formula, which isn&#8217;t discussed at length until chapter 6.</p>
<h2><a name="SECTION00023000000000000000">Chapter 3: Partially Ordered Sets and Lattices</a></h2>
<p>This chapter begins with a very exciting presentation of the M&ouml;bius Function (the convolutional inverse of what is essentially the indicator function of a partial order). It is a real pleasure to see this material well presented in a general lattice setting, instead of the more common and specialized number theoretic setting. The chapter moves on to chains (ordered sequences in lattices) and anti-chains (sets of incomparable elements) in partial orders. The authors present Dilworth&#8217;s theorem which states that every partial can be covered by a number of chains no larger than the size of the largest anti-chain.<a name="tex2html2" href="#foot57"><sup>2</sup></a> The chapter continues with Sperner Theory, which relates counting anti-chains to binomial coefficients. Chapter 3 concludes with valuation rings and M&ouml;bius Algebras: a transition to the more algebraic style found in Chapter 4.</p>
<h2><a name="SECTION00024000000000000000">Chapter 4: Generating Functions and the Umbral Calculus</a></h2>
<p>This is a key chapter. The book introduces the Umbral Calculus, a transform space automating the manipulation of generating functions. The algebra of delta operators is introduced, which provides an abstraction of differentiation. Finally co-algebras are explored, which abstract the processes of factoring.</p>
<p>A rare (and unfortunate) typo on page-190 mis-defines a basic sequence <img width="42" height="31" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg23.png" alt="$ p_n(x)$"> for the delta operator <img width="17" height="29" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg24.png" alt="$ Q$"> as obeying <img width="131" height="31" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg25.png" alt="$ Q p_n(x) = p_{n-1}(x)$"> instead of the correct equation: <img width="140" height="31" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg26.png" alt="$ Q p_n(x) = n p_{n-1}(x)$"> . A careful reader can spot the mistake as it is inconsistent with the the subsequent demonstrations and uses.</p>
<h2><a name="SECTION00025000000000000000">Chapter 5: Symmetric Functions and Baxter Algebras</a></h2>
<p>This chapter treats a number of important algebraic topics. Symmetric functions are studied and identified as being the obvious class of functions that contains all of the well know generating functions already studied. P&oacute;lya&#8217;s Enumeration Theory, which is the method of counting the number of equivalence classes of distinct arrangements, is given a very interesting exposition. But the book skips the classic examples and exercises, such as counting the number of ways to construct distinct necklaces from colored beads, that would be needed for the topic to be fully approachable. Baxter Algebras, which abstract both summation and integration by parts, are introduced and via a study the sequence shift operator. By this point the book has abstract versions of both differentiation and integration, providing a combinatorial groundwork to prove theorems on &#8220;the calculus&#8221; that are more general than is possible in any one theory of differentiation or integration.</p>
<h2><a name="SECTION00026000000000000000">Chapter 6: Determinants, Matrices and Polynomials</a></h2>
<p>This chapter is most similar to classical polynomial invariant theory, the study of symmetric functions of the roots of polynomials such as the discriminant. A major theme of this chapter is the study of the relations between properties of polynomial coefficients and the locations of roots of the polynomials. The study of matrices brings us to the remarkable Binet-Cauchy Formula for the determinant of a product of matrices. The results are deep, but it is a shame that more time isn&#8217;t spent on simple concrete applications such as using the Binet-Cauchy formula to count the number of spanning trees in a graph. This chapter reveals the parts of combinatorics that come from analysis and the study of locations of roots of polynomials (via group theory), in contrast to the parts that come from enumerating finite sets, linear algebra and abstract algebra. This is also the chapter where the exterior algebra, a favorite tool of Rota&#8217;s, is most discussed.</p>
<p>A typo on page 275 (a potentially confusing comma in the definition of the <img width="46" height="31" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg27.png" alt="$ eval()$"> operation) can be recovered from because the authors have the nice habit of explicitly calling out the domain and range of functions.</p>
<h1><a name="SECTION00030000000000000000">Opinion</a></h1>
<p>Some important questions about this book are: is Gian-Carlo Rota a coauthor, what is the purpose of the book and who is the best audience?</p>
<p>Gian-Carlo Rota seems appropriately labeled as a co-author, as clearly a lot of his work went into the book. The book is not suitable to be used as an introductory text book or as a reference. It is a book meant to be read. The ideal audience is capable of graduate level mathematics, is comfortable with a high degree of abstraction and algebra and is already familiar with many of the structures and techniques of combinatorics: sets, graphs, matrices, alternating sequences and generating functions. A mathematician or computer scientist wanting to learn more about the science of combinatorics will find a good read here.</p>
<p>The book works best as a second read of the topics covered. If you already know of a combinatorial method, like P&oacute;lya&#8217;s Enumeration Theory, this book is a good place to find the starting point for an alternate and powerful treatment of the topic. The book admits to not being self contained, and has a few forward-reference problems. However, this is forgivable when you realize the goal of this book is not to teach some easy discrete mathematics before you move on to analysis, but to extract the important combinatorial methods and themes from all of mathematics.</p>
<p>The content is well written, very accurate and well edited. The index is good, but not quite up to the job. The bibliography is very good and divided into three useful sections: papers by Gian-Carlo Rota and coworkers, books for further reading and a section of references.</p>
<p>We close with a extract from the book at hand. Many mathematicians have used the phrase &#8220;merely combinatorial proof&#8221; as a phrase of dismissal. However, when properly founded, combinatorial proofs are in fact more general than proofs that depend on additional specific details from the original problem domain. The authors take some justifiable pleasure in including points like: &#8220;Hilbert&#8217;s basis theorem is equivalent to the &#8216;trivial combinatorial fact&#8217; given in Gordan&#8217;s lemma.&#8221; This is certainly a taste of combinatorics the Rota way.</p>
<p></p>
<hr />
<h4>Footnotes</h4>
<dl>
<dt><a name="foot43">&#8230;.</a><a href="#tex2html1"><sup>1</sup></a></dt>
<dd>For this use the binomial theorem to expand <img width="62" height="31" align="middle" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg19.png" alt="$ (1+x)^n$"> , differentiate with respect to <img width="13" height="14" align="bottom" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg20.png" alt="$ x$"> and then substitute in <img width="42" height="14" align="bottom" border="0" src="http://www.win-vector.com/blog/wp-content/uploads/2010/04/CTRimg21.png" alt="$ x=1$"> .</dd>
<dt><a name="foot57">&#8230; anti-chain.</a><a href="#tex2html2"><sup>2</sup></a></dt>
<dd>From this they derive just about the only Ramsey-theoretic style result in the book: any large partial order must have a large chain or large anti-chain.</dd>
</dl>
<p></p>
<hr />


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/08/what-is-mathematics-really/' rel='bookmark' title='Permanent Link: What is Mathematics, Really?'>What is Mathematics, Really?</a></li>
<li><a href='http://www.win-vector.com/blog/2009/05/the-joy-of-calculation/' rel='bookmark' title='Permanent Link: The Joy of Calculation'>The Joy of Calculation</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/sorting-in-anger/' rel='bookmark' title='Permanent Link: Sorting Used in Anger'>Sorting Used in Anger</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2010/04/sigact-review-of-combinatorics-the-rota-way/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Relative returns: a banker versus trader paradox</title>
		<link>http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=relative-returns-a-banker-versus-trader-paradox</link>
		<comments>http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/#comments</comments>
		<pubDate>Thu, 07 Jan 2010 22:20:04 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Rants]]></category>
		<category><![CDATA[Statistics]]></category>
		<category><![CDATA[Finance]]></category>
		<category><![CDATA[logarithm]]></category>
		<category><![CDATA[paradox]]></category>
		<category><![CDATA[percent change]]></category>
		<category><![CDATA[relative returns]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=1296</guid>
		<description><![CDATA[Quick Joke. Q: What is the difference between a banker and a trader? A: A banker will try and tell you a 10% loss followed by a 10% gain is breaking even. This is a bit less arcane than some of the issues we usually discuss on the Win-Vector Blog, but it is a fun [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/03/r-annoyances/' rel='bookmark' title='Permanent Link: R annoyances'>R annoyances</a></li>
<li><a href='http://www.win-vector.com/blog/2009/07/thievery-considered-harmful/' rel='bookmark' title='Permanent Link: Thievery considered harmful'>Thievery considered harmful</a></li>
<li><a href='http://www.win-vector.com/blog/2009/05/programs-reduced-to-statistics/' rel='bookmark' title='Permanent Link: Programs reduced to statistics'>Programs reduced to statistics</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>Quick Joke. </p>
<blockquote><p>Q: What is the difference between a banker and a trader?<br />
A: A banker will try and tell you a 10% loss followed by a 10% gain is breaking even.</p></blockquote>
<p><span id="more-1296"></span><br />
This is a bit less arcane than some of the issues we usually discuss on the Win-Vector Blog, but it is a fun one.  And it does take some effort to disabuse yourself of the banker&#8217;s fallacy.</p>
<p>It turns out that a lot of our instincts about something as simple as ratios is not quite right.  Likely this is because the innate skills of counting leads to a deep understanding of addition and not of multiplication.  Take for example the opening joke: a 10% loss followed by a 10% gain sounds like it should be exactly breaking even.  But in fact it is exactly a 1% loss.</p>
<p>To compute the loss and gain on $100 we would say after the 10% loss we have $100*(1-0.1) = $90.  A 10% gain on this remaining portion would be written as $90*(1 + 0.1) = $99 which, as predicted, is missing a dollar.  An incorrect explanation would be something along the lines &#8220;well the loss was first, so it applied to a larger number than the gain.&#8221; But relative losses and gains work by multiplying and therefore is insensitive to order.  It is a fact that a 10% loss followed by a 10% gain is exactly the same as a 10% gain followed by a 10% loss (which eliminates the attempted explanation).  The correct explanation is the flaw was far earlier than you would think: you should not believe that the opposite of 10% loss is a 10% gain.   To undo the effect of a 10% loss you need just over an 11% gain (a 11.1111111% gain).</p>
<p>For a more dramatic example consider the Dow Jones Industrial Average.  It was at $12827 on January 7th 2008, by March 5th of 2009 it had fallen to $6594 or a 48% loss.  By January 4th 2010 it had experienced a 60% gain relative to March 5th 2009- but that only got us to $10583, still a 17% loss relative to January 7th 2008.  The opposite of 48% loss is in fact 192% gain (which obviously has not happened).</p>
<p>Bankers typically quote interest rates as if they were additive.  Things like points and fees are all added.  This is almost correct for small interest rates.  This nearly right (but actually wrong) language is why we have a bestiary of confusing terms describing interest: simple interest, compound interest and yield.  The bankers need some way to signal which numbers will actually be used for computing your mortgage payments versus which numbers will be used for advertising (and in the US they tended not to tell you many of the more important numbers until they were required to by law).</p>
<p>Traders, on the other hand, are very comfortable with multiplying relative losses and relative gains.  The main trick of achieving such mastery is to convert multiplication into addition.  The way to do this is the log() function (or the logarithm).</p>
<p>The log() function is simple function that has the property that log(a*b) = log(a) + log(b).  For connivence lets pick our notation so that log(10) = 1.  From this we can deduce that it must be the case that:</p>
<p><center><br />
<table>
<tr>
<td><strong>statement</strong></td>
<td><strong>justification</strong></td>
</tr>
<tr>
<td>
log(1000) = 3
</td>
<td>
 because: log(1000) = log(10*10*10) = log(10) + log(10) + log(10) = 1 + 1 + 1
</td>
</tr>
<tr>
<td>
log(1) = 0
</td>
<td>
because: log(1) = log(1*1) = log(1) + log(1)<br />
</tr>
<tr>
<td>
log(0.1) = -1
</td>
<td>
because: 0 = log(1) = log(0.1 * 10) = log(0.1) + 1 .
</td>
</tr>
</table>
<p></center></p>
<p>log() can not be used on zero or negative numbers (at least not if you expect a real number as a result).   For other values we use our calculator.</p>
<p>A trader uses logarithms to think additively  about relative changes (also called &#8220;returns&#8221;).  Breaking even is represented as 0 (our friend log(1)), relative increases are represented as positive numbers and relative decreases are represented as negative numbers.  For example a 10% loss is represented additively using logarithms as log(1- 0.1) = -0.0458.  Now in this logarithm notation the additive opposite of a -0.0458 is in fact (as you would hope) +0.0458.  You can even double check: log(1 + 0.1111111) = 0.0458.  In this notation the mathematics and the language work together- the opposite of a loss is a gain with the same magnitude (and positive sign).</p>
<p>Returning to our initial example: a 10% loss is represented as -0.0458 and a 10% gain is represented as log(1 + 0.1) = 0.0414, so if we add them (how we combing operations in the logarithmic notation) we get -0.0044.  Notice this is not zero, and is in fact equal to log(0 &#8211; 0.01) or a net-loss of 1%.</p>
<p>The point is that even trivial math becomes difficult if you are forced, by language or convention, to work from false premises.</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/03/r-annoyances/' rel='bookmark' title='Permanent Link: R annoyances'>R annoyances</a></li>
<li><a href='http://www.win-vector.com/blog/2009/07/thievery-considered-harmful/' rel='bookmark' title='Permanent Link: Thievery considered harmful'>Thievery considered harmful</a></li>
<li><a href='http://www.win-vector.com/blog/2009/05/programs-reduced-to-statistics/' rel='bookmark' title='Permanent Link: Programs reduced to statistics'>Programs reduced to statistics</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>On The Hysteria Over &#8220;The Cloud&#8221;</title>
		<link>http://www.win-vector.com/blog/2009/08/on-the-hysteria-over-the-cloud/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=on-the-hysteria-over-the-cloud</link>
		<comments>http://www.win-vector.com/blog/2009/08/on-the-hysteria-over-the-cloud/#comments</comments>
		<pubDate>Thu, 13 Aug 2009 23:12:53 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Expository Writing]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Cloud Computing]]></category>
		<category><![CDATA[Data Centers]]></category>
		<category><![CDATA[Mainframes]]></category>
		<category><![CDATA[PC Revolution]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=237</guid>
		<description><![CDATA[On The Hysteria Over &#8220;The Cloud&#8221; The frenzy of anticipation and opinion about &#8220;The Cloud&#8221; is so intense and so pointless it becomes &#8220;parody proof.&#8221; It is as Jerry Holkins and Mike Krahulik wrote (regarding a different situation): It&#8217;s like trying to make fun of a clown. What, are you going to make fun of [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/02/postels-law-not-sure-who-to-be-angry-with/' rel='bookmark' title='Permanent Link: Postel&#8217;s Law: Not Sure Who To Be Angry With'>Postel&#8217;s Law: Not Sure Who To Be Angry With</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/sorting-in-anger/' rel='bookmark' title='Permanent Link: Sorting Used in Anger'>Sorting Used in Anger</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/i-know-i-am-the-one-being-a-jerk/' rel='bookmark' title='Permanent Link: I know, I am the one being a jerk'>I know, I am the one being a jerk</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>On The Hysteria Over &#8220;The Cloud&#8221;<br />
<center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/180px-Lenticular_Cloud_in_Wyoming_0034b.jpg" alt="180px-Lenticular_Cloud_in_Wyoming_0034b.jpg" border="0" width="180" height="120" /><br />
</center></p>
<p />
The frenzy of anticipation and opinion about &#8220;The Cloud&#8221; is so intense and so pointless it becomes &#8220;parody proof.&#8221;<br />
<span id="more-237"></span>It is as Jerry Holkins and Mike Krahulik wrote (regarding a different situation):</p>
<blockquote><p>
It&#8217;s like trying to make fun of a clown.  What, are you going to make fun of his tiny car?  His floppy shoes? It just doesn&#8217;t work.
</p></blockquote>
<p />
I would like to point out that (by computer science standards) the cloud is not new and has for some time been considered inevitable.</p>
<p />
But what is &#8220;The Cloud?&#8221; What the cloud is depends a bit on what conversation you are being drawn into.  If the conversation is about computing then the cloud is remote computers, software and services like Wikipedia, GMail, SalesForce.com, Google Docs, Amazon EC2/S3 and Google App Engine.  If the conversation is about human interaction then the cloud is ecosystems like Facebook, Twitter and RSS.  Each of these are facets of important longer term trends, but for individual companies and technologies the pendulum is about as fast on the down-swing as it was on the up-swing.  At this time we can safely declare a number of recent important players dead: Friendster, AltaVista, WSDL, Usenet, IRC and Web2.0.  </p>
<p />
<p>It is true that the network itself is more useful than the computer, but this idea is not new to our third millennium.  The current people getting rich promoting this idea did not invent this idea, they grew up in its shadow.  The early big thinkers on computers had big plans.  Plans much larger than Tetris, payroll processing, COBOL and punched cards.</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/Hollerith_punched_card.jpg" alt="Hollerith_punched_card.jpg" border="0" width="434" height="246" /><br />
</center></p>
<p />
<p>Take the article <cite>&#8220;As We May Think&#8221; (by Vannevar Bush, The Atlantic Monthly (1945))</cite>.  In it Vannevar Bush writes:
<p />
<blockquote><p>
Consider a future device for individual use, which is a sort of mechanized private file and library.  It needs a name, and, to coin one at random, &#8220;memex&#8221; will do. A memex is a device in which an individual stores all his books, records, and communications, and which is mechanized so that it may be consulted with exceeding speed and flexibility. It is an enlarged intimate supplement to his memory.
</p></blockquote>
<p /> At first this sounds like nothing more than <cite>&#8220;Danny Dunn and the Homework Machine&#8221; (by Jay Williams (1964), Scholastic Press)</cite><br />
<center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/DannyDunnHomeworkMachine.jpg" alt="DannyDunnHomeworkMachine.jpg" border="0" width="240" height="240" />.<br />
</center></p>
<p /> But in his essay Vannevar Bush uses the phrase &#8220;it can presumably be operated from a distance&#8221; and ends his essay with a long section of how many professions would benefit from a Memex (we show here only one):
<p />
<blockquote><p>
Wholly new forms of encyclopedias will appear, ready made with a mesh of associative trails running through them, ready to be dropped into the memex and there amplified. The lawyer has at his touch the associated opinions and decisions of his whole experience, and of the experience of friends and authorities.
</p></blockquote>
<p /> Obviously we are reading this with a modern eye, but here we have the antecedents of hypertext and the Wikipedia.
<p />
<p>We can trace this thread further forward to <cite>&#8220;Augmenting Human Intellect: A Conceptual Framework&#8221; (by Douglas C Engelbart (1962))</cite> and the famous <a href="http://sloan.stanford.edu/MouseSite/1968Demo.html">1968 demo</a>.</p>
<p>And we can further trace the ideas passing through: <cite> &#8220;Literary Machines: The report on, and of, Project Xanadu concerning word processing, electronic publishing, hypertext, thinkertoys, tomorrow&#8217;s intellectual revolution, and certain other topics including knowledge, education and freedom&#8221; (by Ted Nelson (1981), Mindful Press, Sausalito, California.) </cite>  </p>
<p />
<p>These works were all about knowledge engineering, information storage, networking and communication.  There was an extreme urgency in these works.  Both Engelbart and Nelson felt we had a limited window to gain the ability to organize the world&#8217;s information before some catastrophic error or misunderstanding eliminated us all.  This feeling of urgency and doom came from another exciting application of real time networked computers: <a href="http://en.wikipedia.org/wiki/Semi_Automatic_Ground_Environment">SAGE</a>.  SAGE was the &#8220;Semi Automatic Ground Environment&#8221; first made operational in 1959.  It involved networked computers, light pen based operator terminals and was the system that the United States had ready to fight World War III.</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/File-SAGE_control_room.png" alt="File-SAGE_control_room.png" border="0" width="180" height="232" /><br />
</center></p>
<p>This was the era of near infinite budgets, block sized computer complexes, massive mainframes and IT priesthoods that ran the whole show.</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/180px-Sage_typical_building.jpg" alt="180px-Sage_typical_building.jpg" border="0" width="180" height="136" /><br />
</center></p>
<p>The inevitable march was on. Some large fraction of the GDP would be forever dedicated to building and maintaining monument sized networked computing facilities.  Your degree of relevance and power in society would be directly determined by how close you could get to these facilities.  Then something happened and distracted everyone.  The distraction was so immediate and so complete that by the time the inevitable march restarted (block sized Google data centers and a <a href="http://green.yahoo.com/blog/ecogeek/1125/yahoo-data-center-will-be-powered-by-niagara-falls.html"> proposed Yahoo data center to be built attached to Niagara falls</a>) everyone thought it was a new thing.</p>
<p>What happened was the 1958 demonstrations of successful integrated circuits.  This and the transistor started an era of micro-miniaturization that took the world by storm.  By 1971 Intel had released a single chip CPU (the 4004) as a commercial product.  This chip implemented the core of a computer in a fingertip size package that contained 2300 transistors.</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/180px-Intel_4004.jpg" alt="180px-Intel_4004.jpg" border="0" width="180" height="173" /><br />
</center></p>
<p>From here on everything was desktop calculators, pocket calculators and digital watches.  And then the personal computer and the personal computer revolution hit.</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/180px-Popular_Electronics_Cover_Jan_1975.jpg" alt="180px-Popular_Electronics_Cover_Jan_1975.jpg" border="0" width="180" height="240" /><br />
</center></p>
<p>IBM kicked the PC revolution into high gear when they pushed into the market in 1981.  The personal computer was a supreme distraction that pulled attention away from the monolithic computers for fifteen years.  And for a long while networking and shared information were both nearly forgotten. Computers were for spreadsheets, desktop publishing and other non-networked tasks.
<p />
<p>However, out of public view the monolithic network continued to develop.  The Internet was started as ARPAnet and grew connecting universities and defense contractors from 1969 through now.  The messaging formats (it is inappropriate to use the more common term &#8220;technology&#8221; to describe HTTP and HTML) we call &#8220;The World Wide Web&#8221; were invented (without much fanfare) in 1989.  Netscape was founded in 1994 and made the World Wide Web and Internet available to the PC.  And then the Internet hit like a Tsunami.  Electronic commerce and speculation funded the the initial burst.  Then on-line advertising took over and we are back to building new encyclopedias, tracking everyone and once again building city block sized computers (now called data centers).</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/08/google_data_center_lenoir.jpg" alt="google_data_center_lenoir.jpg" border="0" width="512" height="355" /><br />
</center></p>
<p>Once again we are being told our data is too important to be locked in our desk (or PC) and everything is migrating back to the mainframe (now called &#8220;the cloud&#8221;).
<p />
<p>Will the cycle reverse?  If applications are moving into the cloud now will they ever move back out?
<p />
<p>Moore&#8217;s law has a way of shrinking things (a current smart phone outperforms many early mainframes, super computers and data centers).  Will individual PCs once again be more important than the network?  Some of the more useful parts of the Internet (like the Wikipedia) are small enough to put on current PCs.  The data centers and networks will not go away any time soon, but excitement and attention could move on to something else.  Devices that you could carry everywhere and that have intermittent or expensive connections to the Internet might have an advantage in being able to cache some of the Internet.  And excitement follows what is new, so a stable pervasive cloud would likely be taken for granted (like roads, power, telephone and other utilities).
<p />
<p>Another thing that could migrate applications back out of the cloud (assuming they migrate in) is if access to the user becomes too important to delegate to the cloud.  eCommerce applications take user access when they can get it, but many other applications may depend more on immediate access to the user than on grabbing fresh data from the network.  For example a pacemaker is likely to run most of its application from an embedded computer- this computer might talk to the cloud when it can, but the application will be designed to stand alone as long as possible.
<p />
<p>In the end evangelizing the coming triumph of factory scale computing and networking is pointless.  It is already here and has no great need for cheerleaders.</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/02/postels-law-not-sure-who-to-be-angry-with/' rel='bookmark' title='Permanent Link: Postel&#8217;s Law: Not Sure Who To Be Angry With'>Postel&#8217;s Law: Not Sure Who To Be Angry With</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/sorting-in-anger/' rel='bookmark' title='Permanent Link: Sorting Used in Anger'>Sorting Used in Anger</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/i-know-i-am-the-one-being-a-jerk/' rel='bookmark' title='Permanent Link: I know, I am the one being a jerk'>I know, I am the one being a jerk</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/08/on-the-hysteria-over-the-cloud/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Should your mom use Google search?</title>
		<link>http://www.win-vector.com/blog/2009/07/should-your-mom-use-google-search/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=should-your-mom-use-google-search</link>
		<comments>http://www.win-vector.com/blog/2009/07/should-your-mom-use-google-search/#comments</comments>
		<pubDate>Fri, 24 Jul 2009 02:30:30 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Rants]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[Search]]></category>
		<category><![CDATA[Tracking Cookies]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=221</guid>
		<description><![CDATA[Today&#8217;s question is: &#8220;should your mom use Google search?&#8221; It it is a good thing that Google has directly told us that their motto is &#8220;don&#8217;t be evil,&#8221; as their systems are subtle and difficult to evaluate. I have two areas of concern. My first concern is: what is going on with the ads on [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/06/yaygda-yet-another-yahoo-google-deal-article/' rel='bookmark' title='Permanent Link: YAYGDA (Yet Another Yahoo Google Deal Article)'>YAYGDA (Yet Another Yahoo Google Deal Article)</a></li>
<li><a href='http://www.win-vector.com/blog/2008/05/is-search-advertising-a-market-for-lemons/' rel='bookmark' title='Permanent Link: Is Search Advertising a Market for Lemons?'>Is Search Advertising a Market for Lemons?</a></li>
<li><a href='http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/' rel='bookmark' title='Permanent Link: Public Service Article: JSTOR and other Useful Research Archives'>Public Service Article: JSTOR and other Useful Research Archives</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>Today&#8217;s question is: &#8220;should your mom use Google search?&#8221;  It it is a good thing that Google has directly told us that their motto is &#8220;don&#8217;t be evil,&#8221; as their systems are subtle and difficult to evaluate.</p>
<p><span id="more-221"></span><br />
I have two areas of concern.</p>
<p><b>My first concern is:</b> what is going on with the ads on Google search?  Are they safe to click on?  Check out this ad (from a Google search page):</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/07/Search1.png" alt="Search1.png" border="0" width="255" height="112" /><br />
</center></p>
<p>Where do you think the link would lead to if you clicked on it?  First guess: &#8220;www.dmb.com/duns&#8221; which is further labeled &#8220;Official Site.&#8221;  This sounds like we would directly link to the venerable company &#8220;Dun and Bradstreet.&#8221;  This is not the case.  The text <i>and</i> the green site are apparently part of the ad.  Hovering the mouse or capturing the link yields the following huge and hard to decipher URL:</p>
<pre>

http://www.google.com/aclk?sa=L&#038;ai=CwmvMvAVpSsyeDpvusAO4y5D8D5aTi3qAv83oDPXK5f0CEAEguVQoA1Dw0pOr-_____8BYMn2-IbIo6AZyAEBqgQdT9AhbH2fVXmJHnIy-TNNj_HkY7JsaGV106RyaVw&#038;num=1&#038;sig=AGiWqtwX5zxePZHhDkpqJBojcybMzKkFSw&#038;

q=http://track.did-it.com/n%3Flid%3D13619863%26tid%3D3fe34bfe02723%26eng_creative%3D3345771492%26eng_keyword%3Dd-u-n-s%2520number%26eng_placement
%3D%26url%3Dhttp://smallbusiness.dnb.com/webapp/wcs/stores/servlet/SmbHome%3FstoreId%3D10001%26cm_mmc%3DGoogle-_-Adword-_-online-_-d-u-n-s%2520number%26LID%3D13619863
</pre>
<p>Can you anticipate where this goes?  You can see the following three URL fragments inside the URL:</p>
<ul>
<li>
<tt>http://www.google.com/</tt>
</li>
<li>
<tt>http://track.did-it.com/</tt>
</li>
<li>
<tt>http://smallbusiness.dnb.com/</tt>
</li>
</ul>
<p>Reading from left to right you can be pretty sure the URL goes to a Google server that uses the rest of the URL as an argument.  We can then assume that this Google server performs some bookkeeping and redirects to <tt>http://track.did-it.com/</tt> .  We can then  further assume that track.did-it.com performs some more bookkeeping and redirects to <tt>http://smallbusiness.dnb.com/</tt>.   Notice the first non-Google URL does not match the advertised URL.  We don&#8217;t know what is encoded into each of these pieces and we are only assuming the track.did-it.com server unpacks the URL from the argument; maybe that is a red herring and it redirects us to somewhere else entirely.</p>
<p>Frankly I have no idea if this really happens.  I do know from experience that Google did re-direct to track.did-it.com because my anti-spyware traps caught this, blocked the page load and issued a warning.  This sort of thing could be a very irritating late night call from Mom- she gets a web-safety warning (anti-phishing, anti-virus, cookie request or something else) from a site she is not on, she is not loading inclusions from (images, scripts, iframes and so on) and she is not knowingly clicking on.  </p>
<p>Is there a finite list of partners that Google allows to re-direct?  Can anybody do this?  Can I produce and place ads with arbitrary redirections?</p>
<p><b>My second concern is:</b> do you even need to click to leave the Google search page?</p>
<p>Check out what happens with a fresh copy of Mozilla Firefox (no plugins and nothing added to the browser) when you search for &#8220;Bing&#8221; on Google:</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/07/Search2.png" alt="Search2.png" border="0" width="682" height="220" /><br />
</center></p>
<p>Let&#8217;s look at that pop-up a little closer:</p>
<p><center><br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/07/Cookie.png" alt="Cookie.png" border="0" width="446" height="160" /><br />
</center></p>
<p>Why would www.bing.com get a chance to set a cookie?  Doesn&#8217;t that only happen in response to a request from my copy of Firefox?  Did some script on the Google search page or some obscure &#8220;web acceleration&#8221; option in Firefox pre-fetch the content of the first Google link or first Google Ad (triggering the cookie request)?  Let&#8217;s not worry too much over cause (Google is the major funding source for Firefox),  but look for possible effects.  Does the destination site (Bing) see traffic from the Google page even if the user never clicked on the link?  Something like that would inflate the already huge stature of Google as a traffic source.  How much of my site&#8217;s &#8220;web traffic&#8221; comes from phantom clicks (from abandoned searches)?  Finally, how safe is it?  How much more than the cookie is being loaded?  What if the site linked to has malware- is this a no-click infection route?</p>
<p>Some of these subtle features are necessary to support an ad network.  But the implementation does not seem minimal.  Allowing hosts to differ from ad content and performing a pre-fetch with every search both expose searchers to additional risk.</p>
<p><strong>EDIT:</strong></p>
<p>Found the prefetch.   A Firefox tag that Google knows to set (see <a href="http://lwn.net/Articles/139725/">What is firefox prefetching?</a>)- and sure enough if I perform Google search using Firefox we see:</p>
<pre><tt>&lt;link rel="prefetch" href="http://www.bing.com/"&gt;</tt></pre>
<p>(and I don&#8217;t see this tag when using Safari).<br />
So that is the mechanism- still wondering how much risk this is to users. Also wondering how much this skews traffic statistics into Firefox&#8217;s and Google&#8217;s favor (I haven&#8217;t seen the prefetch tag on Yahoo search or Bing search).</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/06/yaygda-yet-another-yahoo-google-deal-article/' rel='bookmark' title='Permanent Link: YAYGDA (Yet Another Yahoo Google Deal Article)'>YAYGDA (Yet Another Yahoo Google Deal Article)</a></li>
<li><a href='http://www.win-vector.com/blog/2008/05/is-search-advertising-a-market-for-lemons/' rel='bookmark' title='Permanent Link: Is Search Advertising a Market for Lemons?'>Is Search Advertising a Market for Lemons?</a></li>
<li><a href='http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/' rel='bookmark' title='Permanent Link: Public Service Article: JSTOR and other Useful Research Archives'>Public Service Article: JSTOR and other Useful Research Archives</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/07/should-your-mom-use-google-search/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Microsoft Store Again</title>
		<link>http://www.win-vector.com/blog/2009/07/microsoft-store-again/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=microsoft-store-again</link>
		<comments>http://www.win-vector.com/blog/2009/07/microsoft-store-again/#comments</comments>
		<pubDate>Tue, 21 Jul 2009 17:39:55 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Rants]]></category>
		<category><![CDATA[Computers]]></category>
		<category><![CDATA[Retail]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=212</guid>
		<description><![CDATA[Microsoft is once again going to try its hand at retail stores (for example see the following CNET article). From my experience I think this is going to be horrible. But it does not have to be- Microsoft (if it had the will) could produce a great store that is profitable and improves the world. [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/05/must-have-software/' rel='bookmark' title='Permanent Link: Must Have Software'>Must Have Software</a></li>
<li><a href='http://www.win-vector.com/blog/2010/02/living-in-a-lognormal-world/' rel='bookmark' title='Permanent Link: Living in A Lognormal World'>Living in A Lognormal World</a></li>
<li><a href='http://www.win-vector.com/blog/2009/07/should-your-mom-use-google-search/' rel='bookmark' title='Permanent Link: Should your mom use Google search?'>Should your mom use Google search?</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>Microsoft is once again going to try its hand at retail stores (for example see the following <a href="http://news.cnet.com/8301-13860_3-10287499-56.html">CNET article</a>).  From my experience I think this is going to be horrible.  But it does not have to be- Microsoft (if it had the will) could produce a great store that is profitable and improves the world.  Here is my quick history and wish list.</p>
<p><span id="more-212"></span></p>
<p>Microsoft has tried retail outlets before.  So we have some knowledge of what to expect.</p>
<p>In particular I am thinking of the Microsoft store that was part of the new San Francisco Metreon Mall (opened in June of 1999).  At the time Microsoft had no good reason to produce such a store.  They were not ready for a major consumer product push and didn&#8217;t release the original Xbox until 2001 or the Zune until 2006.  This era was also a gap in their consumer operating system release cycle (Windows 98 was already out, Windows ME didn&#8217;t come out until Q2 2000 and Windows XP Q3 2001).  In 1999 there still were Gateway computer retail stores and Apple Stores were still two years in the future. This Microsoft Store satisfied no discernible need, promoted no major strategy and was deservedly forgotten.  From their own press release the purpose of the store was to sell &#8220;more than 90 items of apparel, desk accessories, office supplies and other items with the microsoftSF logo&#8221; ( see <a href="http://www.microsoft.com/presspass/press/1999/jun99/microsoftsfpr.mspx">presspass</a>).  A fairly low marketing ambition- which predictably failed.</p>
<p>Fast forward to 2009.  A Microsoft store could work, if Microsoft were willing to make a good one.  I doubt they are willing.  Likely they feel hey can easily cut themselves a lucrative slice of retail pie (now that they have major consumer products like Xbox, Zune and Windows Media Center).  This will fail- these are all significant products, but together they don&#8217;t make for an interesting store or cohesive shopping experience or lifestyle pitch.</p>
<p>Instead, imaging the following store.</p>
<ul>
<li>
A Microsoft store where a competent sales staff sells major brand PCs (like a Sony, HP, Leveno and so on).  But for a small mark-up they wipe out the manufacturer&#8217;s defective Windows install and spyware.  They install a clean full version of Windows 7 (or Windows XP).  A store where they consult with you and which version of Office really is best for you and then sell and install this.
</li>
</ul>
<p>Even I would go there (and I use Apple OSX  and Linux almost exclusively). Microsoft is too big an ecosystem to ignore.  We need to be able to buy mainstream (and that means Microsoft) PCs, operating systems and software packages at retail (and not just at box stores).</p>
<p>Let me illustrate my point using the last time I purchased a PC.  After an hour of trying to deal with Leveno&#8217;s atrocious web-site (they really do not want to sell computers retail) I got up and drove to the Metreon Sony Store and purchased a Sony Vaio.</p>
<p>Here is what happened: </p>
<ul>
<li>
The Sony Vaio could not handle the Vista it came installed with.
</li>
<li>
The Sony Vaio came without restore media- making a clean re-install of the operating system impossible.
</li>
<li>
The Sony Vaio  came laden with all kinds of crapware (trial anti-virus software, Internet poker offers).
</li>
<li>
I (later) spent around $400 on Office Professional just to find out I could not uninstall enough of the Sony demo version of Office to get rid of  some sort of killing dependence on &#8220;Contact Manager&#8221; (some sort of enterprise wide service that a home PC would not have).
</li>
<li>
I purchased two old copies of XP.  I used one to reformat the Vaio and donated that to my father in law for web-surfing.  We then used the other copy of XP to host Office Professional (which we really wanted and needed) inside a virtual machine on a hand-me-down Macbook.  End of Microsoft Windows (outside of virtual machines) in our household.  If Windows can do something good we now have no way of seeing it (since we now only run Windows inside a virtual machine, which is unfair to Windows).
</li>
</ul>
<p>A careful reader would say &#8220;this is unfair, it was Sony that was bad not Microsoft.&#8221;  That is correct.  But there really (right now) is no way for an individual consumer to directly deal with Microsoft.  Eliminate some of the wall of stupid between me and Microsoft and I probably would use more of their products.</p>
<p>Here is what I (and probably most other consumers would pay big for).</p>
<ul>
<li>
A Microsoft store that re-sells major brand PCs (Sony, HP so on) that have been opened, re-imaged with a clean OS from Microsoft (not the evil OEMs) and given out with install/restore media.
</li>
<li>
Ability to buy a copy of Office Professional that will work on my PC.  Here is my proposition.  I drop off my PC and $400,  next day I come back and take back only the PC and I have a copy of Office Professional that works and isn&#8217;t whining about a bunch of unresolved dependencies to servers and services I do not own.  I also need to know which version of Office to get (and I know it may cost more than the cheapest one) without reading some impenetrable &#8220;enterprise white paper.&#8221;
</li>
<li>
A store with a staff that lets me safely say &#8220;I don&#8217;t know Dad, maybe you should take it back in to the Microsoft Store.&#8221;  I&#8217;ll pay.  I&#8217;d buy training, support, warrantees, read marketing materials and try product demos
</li>
</ul>
<p>Again, a careful reader would point out that all of these activities are labor intensive and going to be very low margin.  This too can be fixed.  Once Microsoft installers are wasting Microsoft&#8217;s time and money (instead of wasting my time and money) the installers will be fixed.  Installing Microsoft Office could be come as easy as selecting a new application in Ubuntu (my current gold standard in easy installs).</p>
<p>I would welcome and support a good Microsoft retail effort, I just don&#8217;t believe one to be very likely.</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/05/must-have-software/' rel='bookmark' title='Permanent Link: Must Have Software'>Must Have Software</a></li>
<li><a href='http://www.win-vector.com/blog/2010/02/living-in-a-lognormal-world/' rel='bookmark' title='Permanent Link: Living in A Lognormal World'>Living in A Lognormal World</a></li>
<li><a href='http://www.win-vector.com/blog/2009/07/should-your-mom-use-google-search/' rel='bookmark' title='Permanent Link: Should your mom use Google search?'>Should your mom use Google search?</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/07/microsoft-store-again/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Thievery considered harmful</title>
		<link>http://www.win-vector.com/blog/2009/07/thievery-considered-harmful/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=thievery-considered-harmful</link>
		<comments>http://www.win-vector.com/blog/2009/07/thievery-considered-harmful/#comments</comments>
		<pubDate>Mon, 06 Jul 2009 16:18:32 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Finance]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Rants]]></category>
		<category><![CDATA[Thieves]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=178</guid>
		<description><![CDATA[A bit of a tempest in finance news involving accusations of sensitive code stolen from a major trading desk. For emerging details see: Special Agent Michael G. McSwain&#8217;s charges Mathew Goldstein&#8217;s Reuters article Zero Hedge blog entry For me this triggers some strong (and sad) personal memories. No matter what inappropriate &#8220;Robin Hood&#8221; intellectual property [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/04/sorting-in-anger/' rel='bookmark' title='Permanent Link: Sorting Used in Anger'>Sorting Used in Anger</a></li>
<li><a href='http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/' rel='bookmark' title='Permanent Link: Relative returns: a banker versus trader paradox'>Relative returns: a banker versus trader paradox</a></li>
<li><a href='http://www.win-vector.com/blog/2008/09/a-quick-appreciation-of-the-sharpe-ratio/' rel='bookmark' title='Permanent Link: A Quick Appreciation of the Sharpe Ratio'>A Quick Appreciation of the Sharpe Ratio</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>A bit of a tempest in finance news involving accusations of sensitive code stolen from a major trading desk.  For emerging details see:</p>
<ul>
<li>
<a href="http://static.reuters.com/resources/media/editorial/20090706/Complaint%20--%20Aleynikov.pdf" target="other">Special Agent Michael G. McSwain&#8217;s charges</a>
</li>
<li>
<a href="http://blogs.reuters.com/commentaries/2009/07/05/a-goldman-trading-scandal/" target="other">Mathew Goldstein&#8217;s Reuters article</a>
</li>
<li>
<a href="http://zerohedge.blogspot.com/2009/07/is-case-of-quant-trading-industrial.html" target="other">Zero Hedge blog entry</a>
</li>
</ul>
<p><span id="more-178"></span></p>
<p>For me this triggers some strong (and sad) personal memories.</p>
<p>No matter what inappropriate &#8220;Robin Hood&#8221; intellectual property fantasies you have this (if true) is just wrong. I have never been a huge fan of the <a href="http://www.acm.org/about/code-of-ethics" target="other">ACM Code of Ethics</a> (which does cover this situation, but fails to seriously address much beyond having  responsibilities to your employer) but this sort of incident reminds me why computer science needs some approximation of a shared set of ethics that we can try to refer to.</p>
<p>A particularly sad part of the story that attracted my attention was the reliance on &#8220;bash history&#8221; to try and establish what happened.  Attempting to &#8220;prove&#8221; something using a &#8220;bash history&#8221; is something I have painful experience with.  The &#8220;bash history&#8221; system is incredibly inadequate even for what it was designed for (caching recent commands).  Simply having two shells open can cause non-deterministic overwriting, deletion, clobbering and time disorderings in the history file.  Furthermore bash history has no dates, times, directories or any other contextual hints written into it.  Finally bash history has no hashes, signatures, nonces, sequence numbers or any other device that helps establish authenticity.</p>
<p>Now for my story.  We (by chance) caught somebody walking off with our group&#8217;s entire source tree.  In the end all we had to go on was the bash history.  To hostile eyes bash history is nowhere near what you would call &#8220;forensic grade evidence.&#8221;  Unfortunately for us the theft was intramural, the thief was merely taking the code to another group in the same company to later mine and represent as their own work.  At this point even language worked against us- every time we accidentally said something like &#8220;our code&#8221; (as in the code we produced, not the code we own) we were perceived as being anti-company.  Evil prevailed (the thief was promoted) and I looked stupid for working so hard to try to interpret such low-quality evidence.  But we live in an objective world- just because you can&#8217;t prove something doesn&#8217;t mean there isn&#8217;t some buried ugly truth.</p>
<p>So what was stolen?  Not the code, that moved from one pocket of the corporation that owned it to another pocket of the same corporation.  What was stolen was reputation.  The thief presumably appeared to out-produce both his old colleagues and his new ones (who don&#8217;t have a few absconded person-years of development to draw from).  So an apology to anyone who was asked why they could not code as fast as our escaped &#8220;genius,&#8221; it was certainly not our intent to so equip him.  And a larger apology to the rest of the team, sorry we could not prove the misappropriation of your work.  </p>
<p>Of course Shakespeare said it much better (from Othello):</p>
<blockquote>
<pre>
Good name in man and woman, dear my lord,
Is the immediate jewel of their souls:
Who steals my purse steals trash; ’t is something, nothing;
’T was mine, ’t is his, and has been slave to thousands;
But he that filches from me my good name
Robs me of that which not enriches him
And makes me poor indeed.
</pre>
</blockquote>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/04/sorting-in-anger/' rel='bookmark' title='Permanent Link: Sorting Used in Anger'>Sorting Used in Anger</a></li>
<li><a href='http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/' rel='bookmark' title='Permanent Link: Relative returns: a banker versus trader paradox'>Relative returns: a banker versus trader paradox</a></li>
<li><a href='http://www.win-vector.com/blog/2008/09/a-quick-appreciation-of-the-sharpe-ratio/' rel='bookmark' title='Permanent Link: A Quick Appreciation of the Sharpe Ratio'>A Quick Appreciation of the Sharpe Ratio</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/07/thievery-considered-harmful/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Public Service Article: JSTOR and other Useful Research Archives</title>
		<link>http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=public-service-article-jstor-and-other-useful-research-archives</link>
		<comments>http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/#comments</comments>
		<pubDate>Sun, 28 Jun 2009 17:41:44 +0000</pubDate>
		<dc:creator>Nina Zumel</dc:creator>
				<category><![CDATA[Expository Writing]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Public Service Article]]></category>
		<category><![CDATA[JSTOR]]></category>
		<category><![CDATA[libraries are cool]]></category>
		<category><![CDATA[Online Libraries]]></category>
		<category><![CDATA[online research]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=169</guid>
		<description><![CDATA[How do you get access to current and historical research articles if you are not affiliated with a university or large research organization? Our second public service article discusses some useful online research archives.Most readers of this blog probably keep track of the latest developments in their field through journal subscriptions and memberships to appropriate [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/06/yaygda-yet-another-yahoo-google-deal-article/' rel='bookmark' title='Permanent Link: YAYGDA (Yet Another Yahoo Google Deal Article)'>YAYGDA (Yet Another Yahoo Google Deal Article)</a></li>
<li><a href='http://www.win-vector.com/blog/2009/08/on-the-hysteria-over-the-cloud/' rel='bookmark' title='Permanent Link: On The Hysteria Over &#8220;The Cloud&#8221;'>On The Hysteria Over &#8220;The Cloud&#8221;</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/i-know-i-am-the-one-being-a-jerk/' rel='bookmark' title='Permanent Link: I know, I am the one being a jerk'>I know, I am the one being a jerk</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>How do you get access to current and historical research articles if you are not affiliated with a university or large research organization? Our second public service article discusses some useful online research archives.<span id="more-169"></span>Most readers of this blog probably keep track of the latest developments in their field through journal subscriptions and memberships to appropriate professional associations. Perhaps some of you even splurge on digital library subscriptions, such as IEEE Explore or the INFORMS Digital Library &#8212;  both of which I have found quite useful. In our field (Computer Science), academic researchers are generally conscientious about making their research papers available through their websites. </p>
<p>But researchers in other fields are not always so good about making copies of their papers easily available, and older classic papers (say, for example, Bradley Efron&#8217;s 1979 <em>Annals of Statistics</em> paper on the Jackknife) are often still worth reading, but are not always easy to find. Where to go?</p>
<p>This is a list of some resources that I&#8217;ve discovered over the years. The list isn&#8217;t comprehensive, by any means, but I offer them here because maybe you will find them helpful, too. The list, and my opinions, are biased towards research in the mathematical and computer sciences, but many of these resources are potentially useful for any research area, including the humanities.</p>
<p><strong>JSTOR</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/jstor_logo.gif" alt="jstor_logo.gif" border="0" width="60" height="80" align="left" /></p>
<p><a href="http://www.jstor.org/">JSTOR</a> is a digital archive of over one thousand scholarly journals, covering topics in the humanities, social and physical sciences and mathematics. I love JSTOR. It is an incredibly useful resource, containing the full contents of every issue of every journal in their collection up to within 3-5 years of the present time (it&#8217;s a moving wall). The collection is full-text searchable. I use JSTOR to find classic papers in Math, Statistics, and Computer Science, as well as more recent papers that have been published in journals that are otherwise not available to me.</p>
<p>Access to JSTOR is available to members of participating institutions, mostly universities, but also many public libraries. I have access to JSTOR free with my San Francisco Public Library card, via the <a href="http://sfpl.org/">SFPL website</a>. (I believe that any resident of California is eligible for a SFPL library card with proof of California residency; good news if you are in California and your local library doesn&#8217;t subscribe). </p>
<p><em><br />
As a side note, San Francisco Public Library subscribes to several quite useful digital research services, including FirstSearch, the OED, Encyclopedia Brittanica, and Morningstar. Some of these other services also provide access to selected full-text articles. SFPL also participates in ILL (Interlibrary Loan) and Link+, a similar cross-library loan service. All good reasons to support your local library!</em></p>
<p><strong>ArXiv</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/arxiv.jpg" alt="arxiv.jpg" border="0" width="194" height="49" align="left" /></p>
<p><a href="http://arxiv.org/">ArXiv</a> is a pre-print server hosted by Cornell, serving pre-prints of papers in Physics, Mathematics, Computer Science, Quantitative Biology, Quantitative Finance and Statistics. Many important researchers use ArXiv to get around the fact that major journal publishers insist on holding the copyright to articles published in their journals. &#8220;Pre-prints&#8221; haven&#8217;t yet been published, and hence the authors are free to distribute them freely. Fields Medalist Terence Tao <a href="http://arxiv.org/find/all/1/au:+tao_terence/0/1/0/all/0/1">regularly distributes his about-to-be published work</a> through ArXiv. </p>
<p>On the other hand, ArXiv has very open submission policies, so you should be more careful of the papers you find here than you would be with a refereed or curated source, such as JSTOR or PubMed Central (which we will discuss later). ArXiv has, unfortunately, more than its fair share of what Augustus de Morgan used to politely call &#8220;<a href="http://www.amazon.com/Budget-Paradoxes-Augustus-Morgan/dp/1602063206">paradoxers</a>&#8220;. The &#8220;Journal Reference&#8221; field of the article summaries will generally give you an indication of whether or not the paper is legitimate, in the sense of having been peer-reviewed; but note, for instance, this paper on a <a href="http://arxiv.org/abs/cs/0610042">polynomial-time algorithm for Traveling Salesman</a> (the Traveling Salesman problem is provably NP-complete, so a result of this magnitude would win the <a href="http://www.claymath.org/millennium/">Clay Millennium Prize</a>, if true). </p>
<p><em>Another side note: I&#8217;ve linked to the Amazon page on de Morgan&#8217;s </em>Budget of Paradoxes<em> because that was the first synopsis I found. The copyright on the book has expired, so if you are actually interested in reading it (it&#8217;s fairly funny, in places), you can find the full version on Google Books or Project Gutenberg.<br />
</em></p>
<p><strong>CiteSeerX</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/CSxbeta.jpg" alt="CSxbeta.jpg" border="0" width="187" height="32" align="left" /><br />
CiteSeer was the original search engine and archive for online technical papers; it got me through graduate school, and my first post-PhD position at SRI. I don&#8217;t believe that the original CiteSeer system is still active, but its successor, <a href="http://citeseerx.ist.psu.edu/">CiteSeerX</a>, is being developed and hosted at Penn State. It concentrates on computer science literature, as did the original. CiteSeerX builds its corpus by webcrawling, so again, the papers it finds are not necessarily refereed. Like its predecessor, CiteSeerX search results include the paper&#8217;s abstract, a BibTex citation, a list of the paper&#8217;s references, a pointer to the paper&#8217;s original location, and (usually) an archived version of the paper, in case the original link has gone dead. Good stuff.</p>
<p><strong>AccessMyLibrary</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/img_page_header.jpg" alt="img_page_header.jpg" border="0" width="189" height="38" align="left" /><br />
<a href="http://www.accessmylibrary.com/">AccessMyLibrary</a> is a service that pools the periodical resources of several libraries across the United States. Any article in a periodical held by a participating library is available for free download to anyone who holds a library card in any other participating library. I find this service less useful than JSTOR: the holdings are generally newspapers and popular magazines, although there are some journals represented, as well as law and business reviews. The download format strips all of the original formatting from articles, which makes them rather ugly and a bit harder to read. I think you lose the figures, too. Still, it&#8217;s free if you have a library card, and it&#8217;s a good place to search for an article if you can&#8217;t find it anywhere else.</p>
<p><strong>Questia</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/questia.jpg" alt="questia.jpg" border="0" width="208" height="48" align="left" /></p>
<p><a href="http://www.questia.com/Index.jsp">Questia</a> is a for-pay service that claims to have &#8220;the world&#8217;s largest online collection of books and journal articles in the humanities and social sciences, plus magazine and newspaper articles&#8221;. Their collection is full-text searchable and, as they say, &#8220;you can read every title cover to cover&#8221;. Good luck doing so, though &#8212; articles and book chapters are not downloadable. Instead, you have to read them through Questia&#8217;s online interface, which is pretty clunky. On the plus side, they allow you to build your own &#8220;bookshelves&#8221; to collect books and articles that are relevant to you by topic or project. You can bookmark key sections, and highlight key passages. I used Questia when I was involved in research projects with psychology and organizational science aspects. I could get hold of articles or textbooks that I wanted to look at faster than through Interlibrary Loan, and more conveniently than going down to Stanford. The subscription fee at the time was cheaper than a membership to the APA or buying the articles piecemeal from Elsevier, or whoever. </p>
<p>Currently, Questia&#8217;s subscription fee is $19.95/month for full library access; you can also subscribe to specific collections (such as Psychology, Literature, or Philosophy) for $9.95 per collection per month.</p>
<p><strong>Mendeley</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/header-logo.png" alt="header-logo.png" border="0" width="171" height="32" align="left" /><br />
Another way to find useful literature is to connect with other people out there who share your interests. <a href="http://www.mendeley.com/">Mendeley</a> is a tool that allows you to organize your collection of research papers, share it with colleagues, and to peruse the collections of other researchers with similar interests. I haven&#8217;t used it myself; but a friend of ours who is an active and influential AI researcher recommends it. It&#8217;s certainly worth a mention. </p>
<p><strong>PubMed Central</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/pmclogo.gif" alt="pmclogo.gif" border="0" width="145" height="75" align="left" /></p>
<p><a href="http://www.pubmedcentral.nih.gov/about/intro.html">PubMed Central</a> is a free digital archive of biomedical and life sciences journal literature, sponsored and managed by the NIH. We don&#8217;t do life science research here at Win-Vector, but I&#8217;m mentioning PubMed because of this awesome policy by the NIH:</p>
<div style="text-align:center;"><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/nih.jpg" alt="nih.jpg" border="0" width="580" height="271" /></div>
<p>NSF and DoD should institute similar policies, too.</p>
<p><strong>Google Books, Google Scholar</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/logo.gif" alt="logo.gif" border="0" width="138" height="55" align="left" /></p>
<p>Yes, they&#8217;re out there. Personally, I find them less useful than JSTOR or a subscription to (say) IEEE Explore. Google Scholar generally returns the abstracts of articles at sites that don&#8217;t provide open access to the full-text article, such as the website of the journal that published the article, or the website of a restricted research archive, like the ACM. This is useful, in that it tells you that the article exists, but it&#8217;s rather frustrating, too. I don&#8217;t find Google Scholar to be significantly more helpful than doing a general Google search on the same keywords. On the other hand, some people swear by Google Scholar, so obviously your mileage may vary.</p>
<p>Google Books has a very annoying habit of returning hits on your search terms, then not giving you read access to the page in question. Useless. If you happen to be doing research in an area where older books in the public domain are still of interest (for instance, my amateur interest in folklore and mythology), then Google Books can be quite helpful; of course, this situation is generally not true in technical research. </p>
<p><strong>Offline: Your Local University Library</strong></p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/iStock_000005201261XSmall.jpg" alt="iStock_000005201261XSmall.jpg" border="0" width="214" height="140" align="left" /></p>
<p>Here in the Bay Area, we are fortunate because the Stanford Library System has generous visitor access policies. The visitors&#8217; policy statement is <a href="http://library.stanford.edu/how_to/borrow_get_access/non_stanford_users/access.html">here</a>; briefly, non-Stanford visitors are allowed 7 courtesy visits per year, with no borrowing privileges. For more visits, you can purchase an access card. I used the Stanford Libraries when my company was down in Mountain View, and I&#8217;m grateful for their openness. I don&#8217;t think many universities are as generous as Stanford is, but if you are near a university campus, it doesn&#8217;t hurt to check. For instance, the University of San Francisco will sell access cards to their library, with or without borrowing privileges, to non-affiliated visitors (<a href="http://www.usfca.edu/library/alumni.html#visitaccess">it ain&#8217;t cheap</a>), and allows practicing California attorneys access to their Law Library. <a href="http://www.library.sfsu.edu/about/info-for/visit.html">San Francisco State</a> has a Friends of the Library program, whereby non-affiliated visitors have access and borrowing privileges to the CSUSF library collection for $45/year. </p>
<p>And there you have it. Research away!</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2008/06/yaygda-yet-another-yahoo-google-deal-article/' rel='bookmark' title='Permanent Link: YAYGDA (Yet Another Yahoo Google Deal Article)'>YAYGDA (Yet Another Yahoo Google Deal Article)</a></li>
<li><a href='http://www.win-vector.com/blog/2009/08/on-the-hysteria-over-the-cloud/' rel='bookmark' title='Permanent Link: On The Hysteria Over &#8220;The Cloud&#8221;'>On The Hysteria Over &#8220;The Cloud&#8221;</a></li>
<li><a href='http://www.win-vector.com/blog/2008/04/i-know-i-am-the-one-being-a-jerk/' rel='bookmark' title='Permanent Link: I know, I am the one being a jerk'>I know, I am the one being a jerk</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Public Service Article: Back Up</title>
		<link>http://www.win-vector.com/blog/2009/06/public-service-article-back-up/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=public-service-article-back-up</link>
		<comments>http://www.win-vector.com/blog/2009/06/public-service-article-back-up/#comments</comments>
		<pubDate>Fri, 12 Jun 2009 00:09:04 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Administrativia]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[Public Service Article]]></category>
		<category><![CDATA[Back Ups]]></category>
		<category><![CDATA[Computers]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=144</guid>
		<description><![CDATA[This is a public service article encouraging all of us to back up our data (which more and more is our lives). I sketch some methods and resources for doing this. As more of our life becomes digital (work, finances, passwords, pictures, contacts,dairies,videos and email) we must be more diligent in backing up our data. [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/' rel='bookmark' title='Permanent Link: Public Service Article: JSTOR and other Useful Research Archives'>Public Service Article: JSTOR and other Useful Research Archives</a></li>
<li><a href='http://www.win-vector.com/blog/2008/06/yaygda-yet-another-yahoo-google-deal-article/' rel='bookmark' title='Permanent Link: YAYGDA (Yet Another Yahoo Google Deal Article)'>YAYGDA (Yet Another Yahoo Google Deal Article)</a></li>
<li><a href='http://www.win-vector.com/blog/2009/07/microsoft-store-again/' rel='bookmark' title='Permanent Link: Microsoft Store Again'>Microsoft Store Again</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>This is a public service article encouraging all of us to back up our data (which more and more is our lives).  I sketch some methods and resources for doing this.</p>
<p>As more of our life becomes digital (work, finances, passwords, pictures, contacts,dairies,videos and email) we must be more diligent in backing up our data.  If your hard drive fails at work you might lose some spreadsheets (and you might not lose anything if your IT department is on their toes) if you computer fails at home you lose your wedding album.  Your hard disk will fail and try to take all of your data (life) with it- it is a matter of when not a matter of if.  You want this to be an inconvenience, not a disaster.  Become expert at backing up and take the time to help others.<br />
<span id="more-144"></span><br />
First some definitions.  Everything stored on your computer is called &#8220;data&#8221; and it is most commonly stored on a single &#8220;hard drive.&#8221;  The act of making an extra copy of your data is traditionally called &#8220;backing up.&#8221;  The act of trying to get access to your extra copy of your data is traditionally called &#8220;restoring.&#8221;  The whole point of backing up is to be able to restore.  If you can&#8217;t get your data back it really doesn&#8217;t matter what steps you took.  Backing up with no ability to restore is just <a href="http://en.wikipedia.org/wiki/Cargo_cult">cargo cult</a> behavior.</p>
<p>If you have a professional service available they will likely do a better job than you can (this is one reason that larger businesses have professional IT staffs).  However, at home you are likely on your own.</p>
<p>This is an opinion piece and I am advocating backing up everything (whole drives) locally.  If you do not back up everything you will need to choose what to back up and what to skip- and you will make mistakes and lose things.  If you do not have a local back up, you might not be able to restore (back up service goes out of business, internet connections are still too slow to be practical).  At the very least you should have a local back up; a remote back up is a good second step.  Remote back up services are a good idea for important data and there are some high quality ones, but a few have gone out of business (<a href="http://en.wikipedia.org/wiki/Xdrive_(website)">Xdrive</a>) so do not want one to be your only chance of salvation.</p>
<p>Let us first address a  technical issue- what sort of set-up are you backing up?  The three most common situations are: Windows, OSX and other Unix (Linux/BSD, yes I know OSX is a Unix).  Each of these have different appropriate tools:</p>
<ul>
<li>Windows:
<p>For Windows Home type operating systems you are unlikely to have access to Microsoft&#8217;s back up tools (which is a real shame, the tools are more useful at home than at a business).  So you need to install something.</p>
<p>I have not researched the Windows world extensively, so I can not give advice.  I can, however relate my experiences and current policies.</p>
<p>I now avoid EMC Retrospect (often comes free with USB drives) at all costs.  My experience has been that EMC Retrospect is hard to use to restore your data (the whole point of backing up).  For me it often refused to run (due to licensing issues) and it was very sensitive to the exact version of the Microsoft.Net framework that was installed on my Windows system.  Two separate times an update in the Microsoft.Net system rendered EMC Retrospect unusable (and broke nothing else).</p>
<p>I have happily purchased Acronis True Image three times now (twice for myself and once for a friend).  Their website is a bit confusing (you must be careful to get the retail product, not the many thousands of dollar enterprise product).  The software seems to be very good.  It can back up, restore and can even read data from an &#8220;image&#8221; (which means you can get to your data with out even restoring).</p>
</li>
<li>OSX:
<p>An embarrassment of riches:</p>
<p>The free options include following Jamie Zawinski&#8217;s wonderful <a href="http://jwz.livejournal.com/801607.html">advice</a> (which I am shamelessly stealing from here) , using the  free copy of <a href="http://www.shirt-pocket.com/SuperDuper/SuperDuperDescription.html">SuperDuper!</a> (which is very good and a complete back up solution even in the free version) or Time Machine (the back up utility included in the current Mac operating system: Leopard).</p>
<p>One huge advantage of modern Macs is if you have formatted your drive correctly you can boot off a USB drive.  So if you use the above instructions you can plug your back in and use it to run (delaying your need to open up your machine or attempt a restore until later).  This is also important in rehearing your restore procedures.</p>
<p>Finally, if you have the cash there is the somewhat over-priced (but wonderful) <a href="http://www.apple.com/timecapsule/">Time Capsule</a>.  You can live without Time Capsule, but it is part of my &#8220;dream set up&#8221; (described below).
</li>
<li>Unix:
<p>Follow any sort of advice on how to script back ups (such as <a href="http://jwz.livejournal.com/801607.html">Jamie Zawinski&#8217;s</a>) and you should be protected.  Rsync is a great tool.
</li>
</ul>
<p>More important than the back up tools is having a precise back up goal and a matching back up plan.  I use my own goal and plan as an example and you can use it as a basis for safer or more risky plans (depending on your resources and needs).</p>
<p>My goal is to: (with very high probability) not lose more than a week of my life.  The plan to achieve this is a full local back up every week and the willingness to buy some new equipment if I have to do a restore.   A failure could delay my work for a day or so, but not put me out of business.  For my business it does not make sense to ensure &#8220;no down time&#8221;- this is an unreasonably expensive thing to try to achieve (and the inappropriateness of this goal is one reason many people have no back ups at all).   My worst case &#8220;restore&#8221; plan is to drive to a store and buy the cheapest temporary computer.  A more likely case is I just need to use one of my extra drives to do my restore (very cheap).  I would then restore the back up onto a fresh drive (or the temporary computer) and work from there until I could repair or replace my major system.  </p>
<p>My back up plan has several &#8220;eyes open&#8221; weaknesses.  I only back up every week, so I could lose a week&#8217;s of data if my disk dies right before a back up.  Also, to restore my data could take a day and $500 (trip to store to buy a temporary computer and hours to restore drive contents).  Knowing these weaknesses are the point of the back up plan:  I am trading hoping that my drive doesn&#8217;t blow up and take all of my data away for hoping my drive doesn&#8217;t blow up and cost me a day of work and few hundred dollars.  That is I am trading the Sword of Damocles for worrying about something like stubbing my toe.  Drive failures while inevitable are not frequent. if I put a quarter in a jar every day I don&#8217;t have a drive failure I would more than likely have the $500 needed to perform an emergency restore saved up long before I have a drive failure.  By not purchasing excess extra equipment (computers) before the failure I save money by maybe not having to purchase it all or at least purchasing cheaper and better equipment at the time of failure (instead of now).</p>
<p>Now to describe my implementation of my plan.  First I purchased the following<br />
things:</p>
<ul>
<li>Time Capsule (optional):
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/apple-time-capsule_1.jpg" alt="apple-time-capsule_1.jpg" border="0" width="440" height="330" />
</li>
<li>
Thermaltake  External Hard Drive SATA Dock ($40 : <a href="http://www.newegg.com/">Newegg</a>):</p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/dock-station.jpg" alt="dock-station.jpg" border="0" width="459" height="459" />
</li>
<li>
Two 1TB drives ($90/each  <a href="http://www.newegg.com/">Newegg</a>, these<br />
are the cheaper &#8220;internal&#8221; drives that go into desktop computers or into the Themaltake dock.  If you don&#8217;t like the ugly you could skip the Themaltake dock and buy USB drives instead.):</p>
<p><img src="http://www.win-vector.com/blog/wp-content/uploads/2009/06/HD-S1000S32.jpg" alt="HD-S1000S32.jpg" border="0" width="400" height="320" />
</li>
<p>So for a little over $220 I am in business.  Every week I could take one of the drives out of its envelope, stick it in the Thermaltake dock and use one of the tools described above to create a complete back up.  What I actually do is even better.  Any time I want I ask my computer to use Time Machine to back up to the Time Capsule (typically takes about 20 minutes) and then once a week I stick a drive in the Themaltake dock and let the Time Capsule copy itself onto the drive (so both me and my computer are completely uninvolved  in the 8 hours this step can take).  For offsite back ups (to defend against things like fire) I can take one of the drives to a safe place off site (locker, safe deposit box).  I recommend physical protection (locks, fire safes) to protect your drives (not encryption, there is a good chance you will get something wrong with encryption and not be able to restore).</p>
<p>Using Time Machine gives me the benefit of having multiple back ups so I can look at earlier versions of files and the speed of only needing to perform incremental back ups (only what has changed needs to be copied).  Another way to get the advantage of having extra versions of all of your files is to put most of your files under management of a &#8220;source control system&#8221; like <a href="http://bazaar-vcs.org/">Bazaar</a>.  Systems like this (free, runs on Windows, OSX and Unix) let you keep all versions of all of your files (answers things like &#8220;what did I have in the file before I deleted it last week?&#8221;) and are incredibly useful (you will wonder how you lived without them).</p>
<p>Finally I end with some &#8220;defensive thinking&#8221; required to succeed with back ups.  I have not said why I purchased two extra drives. This is so I can rotate which extra drive I back up onto.  Drives most often fail when being used- so it is very plausible that my main machine could die while backing up.  If the main machine dies while backing up then not only is its data lost but the back up is also useless (as the main machine was interrupted while trying to write it out).  This is not quite ironic because while it is contrary to what you would want it is not unexpected.  To be safe from a failure during the back up procedure you must have a second drive that is not being used.  Only after the first back up is known to have succeeded can you then back up onto the other drive.</p>
<p>You must rehearse and think through all of your back up steps.  If you are lucky you will find flaws in your plan during rehearsals instead of when you go to restore.  For example tape back up procedures are notorious for writing out years incremental back ups that don&#8217;t work during a restore attempt.  Use a system that allows safe rehearsals (such as trying to boot from a bootable back up or inspect a file from an Acronis image or Time Machine archive).  Plans that only allow restores are not safely rehearsable (if the rehearsal fails you damage something on your primary machine).  Also: if you are really trying to restore you are not likely to be in a good mood, iron out potential kinks with rehearsals not during a panic.</p>
<p>No plan is perfect- we can not cheaply eliminate all risk.  In this case what we can do is eliminate exposure to likely scenarios.  Data loss can still happen, but it is not inevitable.</p>
</ul>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2009/06/public-service-article-jstor-and-other-useful-research-archives/' rel='bookmark' title='Permanent Link: Public Service Article: JSTOR and other Useful Research Archives'>Public Service Article: JSTOR and other Useful Research Archives</a></li>
<li><a href='http://www.win-vector.com/blog/2008/06/yaygda-yet-another-yahoo-google-deal-article/' rel='bookmark' title='Permanent Link: YAYGDA (Yet Another Yahoo Google Deal Article)'>YAYGDA (Yet Another Yahoo Google Deal Article)</a></li>
<li><a href='http://www.win-vector.com/blog/2009/07/microsoft-store-again/' rel='bookmark' title='Permanent Link: Microsoft Store Again'>Microsoft Store Again</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/06/public-service-article-back-up/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>The Joy of Calculation</title>
		<link>http://www.win-vector.com/blog/2009/05/the-joy-of-calculation/?utm_source=rss&amp;utm_medium=rss&amp;utm_campaign=the-joy-of-calculation</link>
		<comments>http://www.win-vector.com/blog/2009/05/the-joy-of-calculation/#comments</comments>
		<pubDate>Tue, 12 May 2009 15:27:22 +0000</pubDate>
		<dc:creator>John Mount</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Opinion]]></category>
		<category><![CDATA[A=B]]></category>
		<category><![CDATA[Calculation]]></category>
		<category><![CDATA[Handbooks]]></category>
		<category><![CDATA[HP15c]]></category>

		<guid isPermaLink="false">http://www.win-vector.com/blog/?p=87</guid>
		<description><![CDATA[I recently had the pleasure of finding a copy of the manual for my favorite calculator. I know it is incredibly nerdy to have a favorite calculator (and even more nerdy to read the manual), but it really got me thinking. The manual subtly sold an incredible point of view: the engineer&#8217;s view. The manual [...]


Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/' rel='bookmark' title='Permanent Link: Relative returns: a banker versus trader paradox'>Relative returns: a banker versus trader paradox</a></li>
<li><a href='http://www.win-vector.com/blog/2008/02/hello-world-an-instance-rhetoric-in-computer-science/' rel='bookmark' title='Permanent Link: Hello World: An Instance Of Rhetoric in Computer Science'>Hello World: An Instance Of Rhetoric in Computer Science</a></li>
<li><a href='http://www.win-vector.com/blog/2008/10/something-i-dont-get-about-business-and-bailouts/' rel='bookmark' title='Permanent Link: Something I don&#8217;t get about business and bailouts'>Something I don&#8217;t get about business and bailouts</a></li>
</ol>]]></description>
			<content:encoded><![CDATA[<p>I recently had the pleasure of finding a copy of the manual for my favorite calculator.  I know it is incredibly nerdy to have a favorite calculator (and even more nerdy to read the manual), but it really got me thinking.<span id="more-87"></span></p>
<p>The manual subtly sold an incredible point of view: the engineer&#8217;s view.  The manual appears trivial at the surface but is in fact a very good rhetoric pushing a fascinating point of view: you can infer things quickly.  This led me to think about a number of technical viewpoints (engineers point of view, scientists point of view and lastly mathematicians point of view).  They are all lumped together as &#8220;quantitative&#8221; but they are radically different.</p>
<p>Listen to this (from the beginning of the HP15C calculator manual):</p>
<p> <br />
<img src="http://www.win-vector.com/blog/wp-content/uploads/2009/05/calculationexample.gif" border="0" alt="CalculationExample.gif" width="521" height="500" /><br />
 </p>
<p>Notice the emphasis on the physical activity of calculation.  The emphasis is not on equations, mathematics or physics.  The calculation is deliberately described as key strokes.  No attempt is made to justify any of the steps or numbers used.  The point being made is: if you are agile and ready (have the correct fore-knowledge) you can calculate.  If you can calculate you can know things.  Robert Heinlein made this point about slide-rules in his science fiction story: &#8220;Have Spacesuit- Will Travel.&#8221;  And likely a similar joy can be felt while accounting on an abacus.</p>
<p>This is the engineer&#8217;s view: the world continuously gives up many small and simple clues as to what is going on around you.  These are like &#8220;tells&#8221; in poker.  You can reason from them and build incredible things using them.  The smallness and simplicity of the techniques are pure comfort.</p>
<p>In Michael Lewis&#8217;s &#8220;Liars Poker&#8221; the author mentions a moment when he knows that everything he is being told about the market is a lie.  He knows this because he attempts to converts one statement about the market into another using his calculator.  When he attempts the conversion (figuring out something he was not supposed to know from clues coming from something he was told) it does not add up.  Importantly he describes working this out on his calculator- not using a sophisticated computer model or a spreadsheet.  He is comfortable in his heterodox position because he calculated it by hand in small and simple steps.</p>
<p>This joy in comparing one conclusion to another (using a calculator) differs from the idealized scientist&#8217;s view in that there is no derivation or application of deeper laws.  The engineer&#8217;s view is: if you can remember it or guess at it then you don&#8217;t need to derive it.</p>
<p>Some of the great scientists (Enrico Fermi) and mathematicians (Stanislaw Ulam) became masters of the engineering view and could dazzle with it.</p>
<p>One of Fermi&#8217;s famous stunts was measuring the yield of a nuclear bomb test by observing how far scraps of paper were moved.  Fermi may have worked from first principles, but he could also have used a simple pre-prepared trick. If he had observed how far scraps of paper had moved in an earlier conventional bomb test (which he now knew the yield of) and then applied a simple engineering trick called &#8220;dimensional analysis&#8221; that let him reason the amount of work observed (how far the slips of paper were moved) depended linearly on the bomb yield and decreased as the cube of how far away he was from the explosion.  So all he did was compute the ratio of of how far the slips moved in each test and then divide this three times in succession by the ratio of how far way he was from the center of each test.  Merely being able to divide told Fermi something (the new bomb yield) before he was officially allowed to know it.  Notice how he did not need to use any facts about the bombs being tested, the speed of sound, atmospheric pressure, density or temperature.</p>
<p>Such reasoning may seem crude- but it is far more informative and far more exciting than the published work of many lesser scientists.  The bulk of most merely poor scientific work (as opposed to outright wrong work) is of the form: &#8220;here are some pointless measurements I got by applying an expensive new instrument in exactly the situations the manufacturer designed it for.&#8221;  Or &#8220;here are some manipulations that seem original since I don&#8217;t feel I have to cite any non-physicists.&#8221;</p>
<p>I side with the mathematicians (not the engineers or even scientists) and I think it is safe to say that mathematicians (who have their own particular view) are more sympathetic to the engineer&#8217;s view than to the scientist&#8217;s view.</p>
<p>One joke that has been told about me is that I am not happy at a presentation unless there is an equation on the board.  This is typical of mathematicians.  The excitement comes from the opportunity to &#8220;kick the times.&#8221;  Once you remove enough details an equation is a simple statement of the form &#8220;A=B&#8221; (to borrow the title of a wonderful book by Marko Petkovsek, Herbert Wilf and Doron Zeilberger).  An equation is a welcome moment of concreteness in contrast to the many painful abstractions that are necessary for much of mathematics.  The dirty secret is that mathematicians perk up when an equation is on the board not because they like equations- but they are hoping to plug in values for &#8220;A&#8221; and &#8220;B&#8221; such that the equation is shown to be false.  My branch of mathematics (theoretical computer science) is more a competitive than a cooperative field.  One measure of audience interest in my field was if somebody to grab the magic marker out of your hand to try and write down a counter-example to what you were trying to demonstrate.  Gian-Carlo Rota tells a similar tale where someone in a mathematical audience grabs the chalk and tries to complete the presentation.</p>
<p>One reason I side with the mathematicians and not the engineers is: if pressed too far the engineer&#8217;s view goes wrong.  The way it goes wrong is found in the thick classic comprehensive engineering handbooks.  These books attempt to store and systematize all of a given field&#8217;s engineering knowledge.  Once you attempt to become comprehensive and are devoting all of your intellect to memorizing and applying the standard approximations and estimates you are lost.</p>
<p>I also do not side with the scientists because mathematicians have no sympathy for trying to &#8220;buy your way out of solving a hard problem&#8221; by running an expensive experiment.  Mathematicians do work with data (even messy data) but we call this &#8220;application&#8221; not &#8220;proof.&#8221;</p>
<p>To me the best view is: if you can derive anything then you do not need to remember anything.</p>


<p>Related posts:<ol><li><a href='http://www.win-vector.com/blog/2010/01/relative-returns-a-banker-versus-trader-paradox/' rel='bookmark' title='Permanent Link: Relative returns: a banker versus trader paradox'>Relative returns: a banker versus trader paradox</a></li>
<li><a href='http://www.win-vector.com/blog/2008/02/hello-world-an-instance-rhetoric-in-computer-science/' rel='bookmark' title='Permanent Link: Hello World: An Instance Of Rhetoric in Computer Science'>Hello World: An Instance Of Rhetoric in Computer Science</a></li>
<li><a href='http://www.win-vector.com/blog/2008/10/something-i-dont-get-about-business-and-bailouts/' rel='bookmark' title='Permanent Link: Something I don&#8217;t get about business and bailouts'>Something I don&#8217;t get about business and bailouts</a></li>
</ol></p>]]></content:encoded>
			<wfw:commentRss>http://www.win-vector.com/blog/2009/05/the-joy-of-calculation/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
