<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: slow progress through saved items</title>
	<atom:link href="http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/feed/" rel="self" type="application/rss+xml" />
	<link>http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/</link>
	<description></description>
	<pubDate>Mon, 08 Sep 2008 01:59:58 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.1</generator>
		<item>
		<title>By: malvasia bianca &#187; Blog Archive &#187; saved items queue: january 27, 2008</title>
		<link>http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/#comment-79862</link>
		<dc:creator>malvasia bianca &#187; Blog Archive &#187; saved items queue: january 27, 2008</dc:creator>
		<pubDate>Sun, 27 Jan 2008 18:48:02 +0000</pubDate>
		<guid isPermaLink="false">http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/#comment-79862</guid>
		<description>[...] About two and a half months ago, I had 89 saved items in my feed reader. I noted that I wasn&#8217;t shrinking that number as quickly as I expected, and predicted that, two months later, I&#8217;d have shrunk the list by a further 20 items. It&#8217;s a more than two later; how am I doing? [...]</description>
		<content:encoded><![CDATA[<p>[...] About two and a half months ago, I had 89 saved items in my feed reader. I noted that I wasn&#8217;t shrinking that number as quickly as I expected, and predicted that, two months later, I&#8217;d have shrunk the list by a further 20 items. It&#8217;s a more than two later; how am I doing? [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: david carlton</title>
		<link>http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/#comment-69607</link>
		<dc:creator>david carlton</dc:creator>
		<pubDate>Tue, 06 Nov 2007 19:19:45 +0000</pubDate>
		<guid isPermaLink="false">http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/#comment-69607</guid>
		<description>Yes, you're quite right.  The advantage of breaking up the queue is that it will give me information as to whether or not I'm draining my book recommendations faster than I'm adding new recommendations.  Once I have that information, I can take a few courses of action.  If it turns out that my reading isn't keeping up, I can look at my priorities and either drop recommendations unread or read more.  And I'll probably do some of the former, if for no other reason than, in times when I was reading significantly more books than I am now, those books in turn generated more to-read items, so I'm not confident that reading more books would actually help a lot.  (Curse you, bibliographies!)

If it turns out that my reading rate is actually keeping ahead of the entry rate, on the other hand, then I can wait until the queue is down to a smaller level (5 items?) and then lower my mental threshold for adding items to the list.  Which I'm not sure is completely impossible: I've modified my "visit the library" algorithm to include a pre-step of taking the oldest book or two on this queue, searching the library catalog for them, and putting in a hold or interlibrary loan request before necessary.  (And then checking out one or two fewer books when I go to the library in person.)  This means that, for better or for worse, my reading is now biased towards books that other people blog about.  (So if you think I'd be interested in a book, don't tell me, just blog about it!)  Actually, then, maybe when the queue gets short, I'll change my library visit algorithm to eliminate that bias?  Or set up a special rss feed (using delicious or tada lists or something) for other book recommendations, that I could then subscribe to?  So many possibilities, which is why I like thinking/talking about this sort of thing: queue management isn't a static process at all.</description>
		<content:encoded><![CDATA[<p>Yes, you&#8217;re quite right.  The advantage of breaking up the queue is that it will give me information as to whether or not I&#8217;m draining my book recommendations faster than I&#8217;m adding new recommendations.  Once I have that information, I can take a few courses of action.  If it turns out that my reading isn&#8217;t keeping up, I can look at my priorities and either drop recommendations unread or read more.  And I&#8217;ll probably do some of the former, if for no other reason than, in times when I was reading significantly more books than I am now, those books in turn generated more to-read items, so I&#8217;m not confident that reading more books would actually help a lot.  (Curse you, bibliographies!)</p>
<p>If it turns out that my reading rate is actually keeping ahead of the entry rate, on the other hand, then I can wait until the queue is down to a smaller level (5 items?) and then lower my mental threshold for adding items to the list.  Which I&#8217;m not sure is completely impossible: I&#8217;ve modified my &#8220;visit the library&#8221; algorithm to include a pre-step of taking the oldest book or two on this queue, searching the library catalog for them, and putting in a hold or interlibrary loan request before necessary.  (And then checking out one or two fewer books when I go to the library in person.)  This means that, for better or for worse, my reading is now biased towards books that other people blog about.  (So if you think I&#8217;d be interested in a book, don&#8217;t tell me, just blog about it!)  Actually, then, maybe when the queue gets short, I&#8217;ll change my library visit algorithm to eliminate that bias?  Or set up a special rss feed (using delicious or tada lists or something) for other book recommendations, that I could then subscribe to?  So many possibilities, which is why I like thinking/talking about this sort of thing: queue management isn&#8217;t a static process at all.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Joe Pallas</title>
		<link>http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/#comment-69451</link>
		<dc:creator>Joe Pallas</dc:creator>
		<pubDate>Tue, 06 Nov 2007 02:04:32 +0000</pubDate>
		<guid isPermaLink="false">http://malvasiabianca.org/archives/2007/11/slow-progress-through-saved-items/#comment-69451</guid>
		<description>I'm not sure I buy the logic here.  Suppose, hypothetically, that the rate at which books you might want to read--heck, it's a hypothetical, so make it books you are certain you want to read.  Suppose these books enter your universe at a rate that exceeds your ability to read them even if you could read continuously without sleep or other breaks.

Clearly, in that hypothetical case, "spend more time reading" is not going to achieve the goal of keeping the queue size under control.  But the hypothetical isn't so far-fetched.  I think it's safe to say that books you would want to read are being produced faster than you can read them, it's just that technology has conspired to make you aware of them (ignorance was bliss?).

So maybe a better strategy is to find a way to reduce the queue size without reading everything in the queue.</description>
		<content:encoded><![CDATA[<p>I&#8217;m not sure I buy the logic here.  Suppose, hypothetically, that the rate at which books you might want to read&#8211;heck, it&#8217;s a hypothetical, so make it books you are certain you want to read.  Suppose these books enter your universe at a rate that exceeds your ability to read them even if you could read continuously without sleep or other breaks.</p>
<p>Clearly, in that hypothetical case, &#8220;spend more time reading&#8221; is not going to achieve the goal of keeping the queue size under control.  But the hypothetical isn&#8217;t so far-fetched.  I think it&#8217;s safe to say that books you would want to read are being produced faster than you can read them, it&#8217;s just that technology has conspired to make you aware of them (ignorance was bliss?).</p>
<p>So maybe a better strategy is to find a way to reduce the queue size without reading everything in the queue.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
