<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments for Daniel Lemire&#039;s blog</title>
	<atom:link href="http://lemire.me/blog/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://lemire.me/blog</link>
	<description>Computer Scientist and Open Scholar: Databases, Information Retrieval, Business Intelligence.</description>
	<lastBuildDate>Thu, 24 May 2012 04:42:46 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>Comment on Fast bitmap decoding by Itman</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55264</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Thu, 24 May 2012 04:42:46 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55264</guid>
		<description>Misspelling
without -&gt; with our</description>
		<content:encoded><![CDATA[<p>Misspelling<br />
without -&gt; with our</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Itman</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55263</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Thu, 24 May 2012 04:42:13 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55263</guid>
		<description>Uuuuups. Sorry. Yes, you are right. Memoization is faster than a naive approach (we know it from experience without system). It also makes sense that a memory-less BitmapFast version is faster than memoization, because it memory access is expensive, even in the case of L1 hit.

I still would not exclude that your implementation of memoization can be improved somewhat (will check someday).</description>
		<content:encoded><![CDATA[<p>Uuuuups. Sorry. Yes, you are right. Memoization is faster than a naive approach (we know it from experience without system). It also makes sense that a memory-less BitmapFast version is faster than memoization, because it memory access is expensive, even in the case of L1 hit.</p>
<p>I still would not exclude that your implementation of memoization can be improved somewhat (will check someday).</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55262</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Thu, 24 May 2012 04:33:49 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55262</guid>
		<description>@Itman

My little program reports speed in millions of integers per second. So higher values are better.

Do you still think our results are inconsistent?</description>
		<content:encoded><![CDATA[<p>@Itman</p>
<p>My little program reports speed in millions of integers per second. So higher values are better.</p>
<p>Do you still think our results are inconsistent?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Itman</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55261</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Thu, 24 May 2012 04:06:27 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55261</guid>
		<description>I have added extra info. Otherwise, it was hard to parse. Naive algorithms are the best, next goes memoization. I also suspect that memoization might be optimized:


       to32: 16.384    32: 10.923      32Fast: 13.107  32Memo: 9.362   to64: 10.923    64: 10.923      64Fast: 8.192   64Memo: 9.362
1       to32: 16.384    32: 4.369       32Fast: 10.923  32Memo: 5.958   to64: 9.362     64: 0.809       64Fast: 8.192   64Memo: 5.958
2       to32: 16.384    32: 2.849       32Fast: 9.362   32Memo: 4.096   to64: 8.192     64: 2.114       64Fast: 7.282   64Memo: 3.855
3       to32: 5.461     32: 1.82        32Fast: 8.192   32Memo: 2.849   to64: 7.282     64: 1.337       64Fast: 5.958   64Memo: 2.731
4       to32: 13.107    32: 1.092       32Fast: 6.554   32Memo: 2.185   to64: 6.554     64: 0.728       64Fast: 5.041   64Memo: 1.928
5       to32: 13.107    32: 0.607       32Fast: 4.681   32Memo: 1.598   to64: 5.461     64: 0.428       64Fast: 4.369   64Memo: 1.394
6       to32: 7.282     32: 0.324       32Fast: 3.449   32Memo: 1.04    to64: 4.369     64: 0.224       64Fast: 3.121   64Memo: 0.923
7       to32: 3.277     32: 0.168       32Fast: 2.427   32Memo: 0.655   to64: 2.849     64: 0.115       64Fast: 2.427   64Memo: 0.516
8       to32: 1.725     32: 0.085       32Fast: 1.68    32Memo: 0.383   to64: 1.598     64: 0.058       64Fast: 1.82    64Memo: 0.298
9       to32: 0.851     32: 0.043       32Fast: 1.024   32Memo: 0.21    to64: 0.95      64: 0.029       64Fast: 1.285   64Memo: 0.172
</description>
		<content:encoded><![CDATA[<p>I have added extra info. Otherwise, it was hard to parse. Naive algorithms are the best, next goes memoization. I also suspect that memoization might be optimized:</p>
<p>       to32: 16.384    32: 10.923      32Fast: 13.107  32Memo: 9.362   to64: 10.923    64: 10.923      64Fast: 8.192   64Memo: 9.362<br />
1       to32: 16.384    32: 4.369       32Fast: 10.923  32Memo: 5.958   to64: 9.362     64: 0.809       64Fast: 8.192   64Memo: 5.958<br />
2       to32: 16.384    32: 2.849       32Fast: 9.362   32Memo: 4.096   to64: 8.192     64: 2.114       64Fast: 7.282   64Memo: 3.855<br />
3       to32: 5.461     32: 1.82        32Fast: 8.192   32Memo: 2.849   to64: 7.282     64: 1.337       64Fast: 5.958   64Memo: 2.731<br />
4       to32: 13.107    32: 1.092       32Fast: 6.554   32Memo: 2.185   to64: 6.554     64: 0.728       64Fast: 5.041   64Memo: 1.928<br />
5       to32: 13.107    32: 0.607       32Fast: 4.681   32Memo: 1.598   to64: 5.461     64: 0.428       64Fast: 4.369   64Memo: 1.394<br />
6       to32: 7.282     32: 0.324       32Fast: 3.449   32Memo: 1.04    to64: 4.369     64: 0.224       64Fast: 3.121   64Memo: 0.923<br />
7       to32: 3.277     32: 0.168       32Fast: 2.427   32Memo: 0.655   to64: 2.849     64: 0.115       64Fast: 2.427   64Memo: 0.516<br />
8       to32: 1.725     32: 0.085       32Fast: 1.68    32Memo: 0.383   to64: 1.598     64: 0.058       64Fast: 1.82    64Memo: 0.298<br />
9       to32: 0.851     32: 0.043       32Fast: 1.024   32Memo: 0.21    to64: 0.95      64: 0.029       64Fast: 1.285   64Memo: 0.172</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Creating incentives for better science by Charles Warner</title>
		<link>http://lemire.me/blog/archives/2012/05/22/creating-incentives-for-better-science/comment-page-1/#comment-55260</link>
		<dc:creator>Charles Warner</dc:creator>
		<pubDate>Wed, 23 May 2012 19:07:50 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4312#comment-55260</guid>
		<description>Many years ago, when I was researching on the old DARPANET, invariably, there were far more citations than I could ever read (let alone purchase on the typical budget).  Especially when researching a subject with which I was relatively unfamiliar, filtering out the chaff was quite difficult.  I quickly uncovered a valuable filter:  those who publish frequently very seldom are publishing new work, and very seldom is one going to find significant information in these works.  On the other hand, authors who publish quite infrequently quite often have the most valuable information as a proportion of total words to read.  Even though this is not a &quot;fool proof&quot; filter, it still seems viable in today&#039;s world.  The value of an author&#039;s output is inversely proportional to the frequency of publication.
Also, when one thinks of the personal investment that an investigator has made in achieving status within his chosen field, it is understandable that:  first, he is going to be more prone to accept the &quot;conventional wisdom of the years&quot; through habit as much as through any rational analysis of the evidence, and, secondly, who is going to willingly throw out a lifetime of study and learning, admitting that that lifetime was mostly wasted effort?  It is a whole lot easier to tweak the old model to account for new evidence than it is to build a whole new model...</description>
		<content:encoded><![CDATA[<p>Many years ago, when I was researching on the old DARPANET, invariably, there were far more citations than I could ever read (let alone purchase on the typical budget).  Especially when researching a subject with which I was relatively unfamiliar, filtering out the chaff was quite difficult.  I quickly uncovered a valuable filter:  those who publish frequently very seldom are publishing new work, and very seldom is one going to find significant information in these works.  On the other hand, authors who publish quite infrequently quite often have the most valuable information as a proportion of total words to read.  Even though this is not a &#8220;fool proof&#8221; filter, it still seems viable in today&#8217;s world.  The value of an author&#8217;s output is inversely proportional to the frequency of publication.<br />
Also, when one thinks of the personal investment that an investigator has made in achieving status within his chosen field, it is understandable that:  first, he is going to be more prone to accept the &#8220;conventional wisdom of the years&#8221; through habit as much as through any rational analysis of the evidence, and, secondly, who is going to willingly throw out a lifetime of study and learning, admitting that that lifetime was mostly wasted effort?  It is a whole lot easier to tweak the old model to account for new evidence than it is to build a whole new model&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Itman</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55259</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Wed, 23 May 2012 16:42:57 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55259</guid>
		<description>I will re-run it -server option. Maybe that was causing a problem.

&gt;I’d be curious to see how you implement it.

In Java, it is a bit a hard. In C++, you just use an array of structures.</description>
		<content:encoded><![CDATA[<p>I will re-run it -server option. Maybe that was causing a problem.</p>
<p>&gt;I’d be curious to see how you implement it.</p>
<p>In Java, it is a bit a hard. In C++, you just use an array of structures.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55258</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Wed, 23 May 2012 16:31:03 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55258</guid>
		<description>@Itman

&lt;em&gt;On my laptop, BTW, naive encodings are the fastest, not fast32, fast64 versions. &lt;/em&gt;

Really? Can you share the output you get?

Please use the -server flag with java, otherwise numbers tend to be all over the place.

&lt;em&gt; I would have put all the data in a single contiguous array (maybe better from a perspective of caching). &lt;/em&gt;

I&#039;d be curious to see how you implement it.

&lt;em&gt; I also wonder if results obtained for Java also hold for C++.&lt;/em&gt;

I agree. I might hack something together.</description>
		<content:encoded><![CDATA[<p>@Itman</p>
<p><em>On my laptop, BTW, naive encodings are the fastest, not fast32, fast64 versions. </em></p>
<p>Really? Can you share the output you get?</p>
<p>Please use the -server flag with java, otherwise numbers tend to be all over the place.</p>
<p><em> I would have put all the data in a single contiguous array (maybe better from a perspective of caching). </em></p>
<p>I&#8217;d be curious to see how you implement it.</p>
<p><em> I also wonder if results obtained for Java also hold for C++.</em></p>
<p>I agree. I might hack something together.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Itman</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55257</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Wed, 23 May 2012 15:39:47 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55257</guid>
		<description>Interesting. On my laptop, BTW, naive encodings are the fastest, not fast32, fast64 versions. I will have to double check this (can&#039;t do now). In addition, I see that the memoization is implemented through a 2-level addressing scheme. I would have put  all the data in a single contiguous array (maybe better from a perspective of caching). I also wonder if results obtained for Java also hold for C++.</description>
		<content:encoded><![CDATA[<p>Interesting. On my laptop, BTW, naive encodings are the fastest, not fast32, fast64 versions. I will have to double check this (can&#8217;t do now). In addition, I see that the memoization is implemented through a 2-level addressing scheme. I would have put  all the data in a single contiguous array (maybe better from a perspective of caching). I also wonder if results obtained for Java also hold for C++.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The case against double-blind peer review by Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2011/04/28/the-case-against-double-blind-peer-review/comment-page-1/#comment-55256</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Wed, 23 May 2012 02:45:26 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=3101#comment-55256</guid>
		<description>@Epizdochie

&lt;em&gt;I feel that the editor would have no ammo once he receives the reviews from the reviewers&lt;/em&gt;

The objectivity of the editor is important especially because reviewers are rarely unanimous. Editors effectively act as super-reviewers. An editor can stop a paper from going to peer review. He can pull the paper out of the process after receiving even a hint of criticism, or he can ignore much of the criticism and push the paper forward. 

The decision of the editor is typically final and without appeal. The recommendation of a reviewer is always only a recommendation, it can always be ignored by the editor.

So, really, if you feel that it is important that your identity be hidden, it should be hidden from the editor.</description>
		<content:encoded><![CDATA[<p>@Epizdochie</p>
<p><em>I feel that the editor would have no ammo once he receives the reviews from the reviewers</em></p>
<p>The objectivity of the editor is important especially because reviewers are rarely unanimous. Editors effectively act as super-reviewers. An editor can stop a paper from going to peer review. He can pull the paper out of the process after receiving even a hint of criticism, or he can ignore much of the criticism and push the paper forward. </p>
<p>The decision of the editor is typically final and without appeal. The recommendation of a reviewer is always only a recommendation, it can always be ignored by the editor.</p>
<p>So, really, if you feel that it is important that your identity be hidden, it should be hidden from the editor.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The case against double-blind peer review by Epizdochie</title>
		<link>http://lemire.me/blog/archives/2011/04/28/the-case-against-double-blind-peer-review/comment-page-1/#comment-55255</link>
		<dc:creator>Epizdochie</dc:creator>
		<pubDate>Wed, 23 May 2012 01:42:54 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=3101#comment-55255</guid>
		<description>You&#039;re very prompt, Daniel, I commend you for that (I also have an appreciation for the situation at hand, I am anonymous in this conversation, but you&#039;re not, sorry).
I feel that the editor would have no ammo once he receives the reviews from the reviewers, so a double-blind would hurt no one, Also, the rejection of a paper based on a perceived lack of prestigious affiliation would be hard to prove even if the reviewers are known (after all, the author is a nobody to start with, AND, there is no published work to speak of, so who would pay any attention to him/her?) - a double-blind probably seems a better choice there, at least no one can cry &quot;foul&quot;.

But anyway, I&#039;m glad that turning the tables on the reviewers (i.e., making them non-anonymous) seems like a good idea to you, too, so let&#039;s work on that, it looks like a good start,

Again, thanks for replying.</description>
		<content:encoded><![CDATA[<p>You&#8217;re very prompt, Daniel, I commend you for that (I also have an appreciation for the situation at hand, I am anonymous in this conversation, but you&#8217;re not, sorry).<br />
I feel that the editor would have no ammo once he receives the reviews from the reviewers, so a double-blind would hurt no one, Also, the rejection of a paper based on a perceived lack of prestigious affiliation would be hard to prove even if the reviewers are known (after all, the author is a nobody to start with, AND, there is no published work to speak of, so who would pay any attention to him/her?) &#8211; a double-blind probably seems a better choice there, at least no one can cry &#8220;foul&#8221;.</p>
<p>But anyway, I&#8217;m glad that turning the tables on the reviewers (i.e., making them non-anonymous) seems like a good idea to you, too, so let&#8217;s work on that, it looks like a good start,</p>
<p>Again, thanks for replying.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The mythical bitmap index by Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2008/08/20/the-mythical-bitmap-index/comment-page-1/#comment-55254</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Wed, 23 May 2012 00:16:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/archives/2008/08/20/the-mythical-bitmap-index/#comment-55254</guid>
		<description>@Lil 

Please report issues using either github or preferably, Google code: 

http://code.google.com/p/lemurbitmapindex/issues/list

Be sure to specify which compiler you are using.</description>
		<content:encoded><![CDATA[<p>@Lil </p>
<p>Please report issues using either github or preferably, Google code: </p>
<p><a href="http://code.google.com/p/lemurbitmapindex/issues/list" rel="nofollow">http://code.google.com/p/lemurbitmapindex/issues/list</a></p>
<p>Be sure to specify which compiler you are using.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The mythical bitmap index by Lil</title>
		<link>http://lemire.me/blog/archives/2008/08/20/the-mythical-bitmap-index/comment-page-1/#comment-55253</link>
		<dc:creator>Lil</dc:creator>
		<pubDate>Tue, 22 May 2012 23:27:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/archives/2008/08/20/the-mythical-bitmap-index/#comment-55253</guid>
		<description>Hi I was trying to use your c++ implementation, but when I try to do the make I got the following error

headers/ewahutil.h:21:23: error: conflicting declaration ‘typedef long unsigned int uint32_t’
/usr/include/stdint.h:52:23: error: ‘uint32_t’ has a previous declaration as ‘typedef unsigned int uint32_t’
make: *** [unit] Error 1

can yout tell me how to fix it.</description>
		<content:encoded><![CDATA[<p>Hi I was trying to use your c++ implementation, but when I try to do the make I got the following error</p>
<p>headers/ewahutil.h:21:23: error: conflicting declaration ‘typedef long unsigned int uint32_t’<br />
/usr/include/stdint.h:52:23: error: ‘uint32_t’ has a previous declaration as ‘typedef unsigned int uint32_t’<br />
make: *** [unit] Error 1</p>
<p>can yout tell me how to fix it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fast bitmap decoding by Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2012/05/21/fast-bitmap-decoding/comment-page-1/#comment-55252</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Tue, 22 May 2012 21:22:49 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=4283#comment-55252</guid>
		<description>@Itman

I&#039;ve implemented memoization. The result is poor. Please see my implementation:

https://github.com/lemire/Code-used-on-Daniel-Lemire-s-blog/blob/master/2012/05/21/testbitmap.java</description>
		<content:encoded><![CDATA[<p>@Itman</p>
<p>I&#8217;ve implemented memoization. The result is poor. Please see my implementation:</p>
<p><a href="https://github.com/lemire/Code-used-on-Daniel-Lemire-s-blog/blob/master/2012/05/21/testbitmap.java" rel="nofollow">https://github.com/lemire/Code-used-on-Daniel-Lemire-s-blog/blob/master/2012/05/21/testbitmap.java</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The case against double-blind peer review by Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2011/04/28/the-case-against-double-blind-peer-review/comment-page-1/#comment-55251</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Tue, 22 May 2012 21:03:46 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=3101#comment-55251</guid>
		<description>@Epizdochie

&lt;blockquote&gt;
Reviewers “suspect” who the author is, “google” his/her prior work, fail to check derivations based on the authors’ reputation, and spend their otherwise precious time on inconsequential aspects – focus on the paper given to you for review, and do not concern yourself with the author and his affiliation. Look, if you don’t have time to do a proper review, THEN DON’T DO IT
&lt;/blockquote&gt;

The person taking the decision to accept or reject the paper, the editor, knows your reputation and your affiliation. So, sadly, there is no way to take this out of the equation. In fact, in a double-blind system, the editor has even more power.

To properly review a paper, I need to compare it with the state-of-the-art and previous work. Typically, this means reviewing (even unknowingly) what the author worked on previously. So, you cannot just focus on the paper as a separate entity.

&lt;blockquote&gt;(...) fairer would be to disclose the identity/affiliation of the reviewers to the author, so that he/she could have a better idea about how competent they really are to judge his/her work. How comfortable would reviewers feel in that situation?&lt;/blockquote&gt;

I have been advocating precisely this scheme for years. If you are going to criticize someone, you should be able to do it openly, in front of witnesses, not under the cover of anonymity.

But it works both ways... if you are going to ask me to review your work, through a journal or otherwise, please let me know who you are.

Once everything is public, the focus will naturally be on the science. If people unfairly review your work (because you lack a prestigious affiliation) then you&#039;ll be able to point to the evidence, as it will all be out there. It also takes power away from the editors, and it puts it back in the community at large.</description>
		<content:encoded><![CDATA[<p>@Epizdochie</p>
<blockquote><p>
Reviewers “suspect” who the author is, “google” his/her prior work, fail to check derivations based on the authors’ reputation, and spend their otherwise precious time on inconsequential aspects – focus on the paper given to you for review, and do not concern yourself with the author and his affiliation. Look, if you don’t have time to do a proper review, THEN DON’T DO IT
</p></blockquote>
<p>The person taking the decision to accept or reject the paper, the editor, knows your reputation and your affiliation. So, sadly, there is no way to take this out of the equation. In fact, in a double-blind system, the editor has even more power.</p>
<p>To properly review a paper, I need to compare it with the state-of-the-art and previous work. Typically, this means reviewing (even unknowingly) what the author worked on previously. So, you cannot just focus on the paper as a separate entity.</p>
<blockquote><p>(&#8230;) fairer would be to disclose the identity/affiliation of the reviewers to the author, so that he/she could have a better idea about how competent they really are to judge his/her work. How comfortable would reviewers feel in that situation?</p></blockquote>
<p>I have been advocating precisely this scheme for years. If you are going to criticize someone, you should be able to do it openly, in front of witnesses, not under the cover of anonymity.</p>
<p>But it works both ways&#8230; if you are going to ask me to review your work, through a journal or otherwise, please let me know who you are.</p>
<p>Once everything is public, the focus will naturally be on the science. If people unfairly review your work (because you lack a prestigious affiliation) then you&#8217;ll be able to point to the evidence, as it will all be out there. It also takes power away from the editors, and it puts it back in the community at large.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The case against double-blind peer review by Epizdochie</title>
		<link>http://lemire.me/blog/archives/2011/04/28/the-case-against-double-blind-peer-review/comment-page-1/#comment-55250</link>
		<dc:creator>Epizdochie</dc:creator>
		<pubDate>Tue, 22 May 2012 19:31:21 +0000</pubDate>
		<guid isPermaLink="false">http://lemire.me/blog/?p=3101#comment-55250</guid>
		<description>I am emphatically FOR double-blind reviews, and reading the above comments re-inforce my conviction. Reviewers &quot;suspect&quot; who the author is, &quot;google&quot; his/her prior work, fail to check derivations based on the authors&#039; reputation, and spend their otherwise precious time on inconsequential aspects - focus on the paper given to you for review, and do not concern yourself with the author and his affiliation. Look, if you don&#039;t have time to do a proper review, THEN DON&#039;T DO IT, and say so from the start - there are probably other people in the whole wide world ready to step up and do a proper job (but you wouldn&#039;t want that, would you, you want to be part of the game, don&#039;t you, you want to be able to make or break other people, right?). The absence of a double-blind review perpetuates the rigging of the system and is deeply unfair to the authors - if you don&#039;t want to do that, fairer would be to disclose the identity/affiliation of the reviewers to the author, so that he/she could have a better idea about how competent they really are to judge his/her work. How comfortable would reviewers feel in that situation?</description>
		<content:encoded><![CDATA[<p>I am emphatically FOR double-blind reviews, and reading the above comments re-inforce my conviction. Reviewers &#8220;suspect&#8221; who the author is, &#8220;google&#8221; his/her prior work, fail to check derivations based on the authors&#8217; reputation, and spend their otherwise precious time on inconsequential aspects &#8211; focus on the paper given to you for review, and do not concern yourself with the author and his affiliation. Look, if you don&#8217;t have time to do a proper review, THEN DON&#8217;T DO IT, and say so from the start &#8211; there are probably other people in the whole wide world ready to step up and do a proper job (but you wouldn&#8217;t want that, would you, you want to be part of the game, don&#8217;t you, you want to be able to make or break other people, right?). The absence of a double-blind review perpetuates the rigging of the system and is deeply unfair to the authors &#8211; if you don&#8217;t want to do that, fairer would be to disclose the identity/affiliation of the reviewers to the author, so that he/she could have a better idea about how competent they really are to judge his/her work. How comfortable would reviewers feel in that situation?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

