<article>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#article10_02_26_1343222</id>
	<title>IBM Claims Breakthrough Energy-Efficient Algorithm</title>
	<author>kdawson</author>
	<datestamp>1267192320000</datestamp>
	<htmltext>jitendraharlalka sends news of a <a href="http://seattletimes.nwsource.com/html/technologybrierdudleysblog/2011185413\_ibm\_announcing\_crazy\_algorithm.html">claimed algorithmic breakthrough by IBM</a>, though from the scant technical detail provided it's hard to tell exactly how important the development might be. IBM apparently presented its results yesterday at the <a href="http://www.siam.org/meetings/pp10/index.php">Society for Industrial and Applied Mathematics conference</a> in Seattle. The breathless <a href="http://finance.yahoo.com/news/Made-in-IBM-Labs-IBM-prnews-3674581922.html?x=0&amp;.v=1">press release</a> begins: <i>"IBM Research today unveiled a breakthrough method based on a mathematical algorithm that reduces the computational complexity, costs, and energy usage for analyzing the quality of massive amounts of data by two orders of magnitude. This new method will greatly help enterprises extract and use the data more quickly and efficiently to develop more accurate and predictive models. In a record-breaking experiment, IBM researchers used the fourth most powerful supercomputer in the world... to validate nine terabytes of data... in less than 20 minutes, without compromising accuracy.  Ordinarily, using the same system, this would take more than a day. Additionally, the process used just one percent of the energy that would typically be required."</i></htmltext>
<tokenext>jitendraharlalka sends news of a claimed algorithmic breakthrough by IBM , though from the scant technical detail provided it 's hard to tell exactly how important the development might be .
IBM apparently presented its results yesterday at the Society for Industrial and Applied Mathematics conference in Seattle .
The breathless press release begins : " IBM Research today unveiled a breakthrough method based on a mathematical algorithm that reduces the computational complexity , costs , and energy usage for analyzing the quality of massive amounts of data by two orders of magnitude .
This new method will greatly help enterprises extract and use the data more quickly and efficiently to develop more accurate and predictive models .
In a record-breaking experiment , IBM researchers used the fourth most powerful supercomputer in the world... to validate nine terabytes of data... in less than 20 minutes , without compromising accuracy .
Ordinarily , using the same system , this would take more than a day .
Additionally , the process used just one percent of the energy that would typically be required .
"</tokentext>
<sentencetext>jitendraharlalka sends news of a claimed algorithmic breakthrough by IBM, though from the scant technical detail provided it's hard to tell exactly how important the development might be.
IBM apparently presented its results yesterday at the Society for Industrial and Applied Mathematics conference in Seattle.
The breathless press release begins: "IBM Research today unveiled a breakthrough method based on a mathematical algorithm that reduces the computational complexity, costs, and energy usage for analyzing the quality of massive amounts of data by two orders of magnitude.
This new method will greatly help enterprises extract and use the data more quickly and efficiently to develop more accurate and predictive models.
In a record-breaking experiment, IBM researchers used the fourth most powerful supercomputer in the world... to validate nine terabytes of data... in less than 20 minutes, without compromising accuracy.
Ordinarily, using the same system, this would take more than a day.
Additionally, the process used just one percent of the energy that would typically be required.
"</sentencetext>
</article>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284682</id>
	<title>Re:I'd expect this</title>
	<author>PopeRatzo</author>
	<datestamp>1267198020000</datestamp>
	<modclass>Flamebait</modclass>
	<modscore>-1</modscore>
	<htmltext><blockquote><div><p>smart people, not greenards</p></div></blockquote><p>Somebody had to explain to the "smart people" that it had to be done.</p><p>And did you think up "greenards" by yourself or did you hear it from Rush?</p></div>
	</htmltext>
<tokenext>smart people , not greenardsSomebody had to explain to the " smart people " that it had to be done.And did you think up " greenards " by yourself or did you hear it from Rush ?</tokentext>
<sentencetext>smart people, not greenardsSomebody had to explain to the "smart people" that it had to be done.And did you think up "greenards" by yourself or did you hear it from Rush?
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284308</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286076</id>
	<title>Re:Color me impressed!</title>
	<author>Ltap</author>
	<datestamp>1267204860000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Time to roll in that 16,384-bit RSA!</htmltext>
<tokenext>Time to roll in that 16,384-bit RSA !</tokentext>
<sentencetext>Time to roll in that 16,384-bit RSA!</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284584</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285726</id>
	<title>Re:just trying to be relevant</title>
	<author>tomhath</author>
	<datestamp>1267203360000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Exactly. I once fixed a report that was running for 8 hours, cut it down to 90 seconds. But no one in their right mind would suggest that saved 99.7\% of any energy, because the server was still running when the report was done. Now the other report that crashed the server after I fixed it is a different story...</htmltext>
<tokenext>Exactly .
I once fixed a report that was running for 8 hours , cut it down to 90 seconds .
But no one in their right mind would suggest that saved 99.7 \ % of any energy , because the server was still running when the report was done .
Now the other report that crashed the server after I fixed it is a different story.. .</tokentext>
<sentencetext>Exactly.
I once fixed a report that was running for 8 hours, cut it down to 90 seconds.
But no one in their right mind would suggest that saved 99.7\% of any energy, because the server was still running when the report was done.
Now the other report that crashed the server after I fixed it is a different story...</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31295088</id>
	<title>The just fixed it</title>
	<author>vikstar</author>
	<datestamp>1267212420000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><i>"in less than 20 minutes, without compromising accuracy. Ordinarily, using the same system, this would take more than a day"</i><br>This just means that they were doing a pretty damn lousy job before they fixed the problem.</p></htmltext>
<tokenext>" in less than 20 minutes , without compromising accuracy .
Ordinarily , using the same system , this would take more than a day " This just means that they were doing a pretty damn lousy job before they fixed the problem .</tokentext>
<sentencetext>"in less than 20 minutes, without compromising accuracy.
Ordinarily, using the same system, this would take more than a day"This just means that they were doing a pretty damn lousy job before they fixed the problem.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288422</id>
	<title>Re:Here's the actual paper.</title>
	<author>Anonymous</author>
	<datestamp>1267212360000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>1</modscore>
	<htmltext><p>The slashdot shouldn't concentrate on the breakthrough energy efficiency marketing green crap. They should concentrate on the fact that IBM has, in essence, patented a mathematical algorithm. Yes, they did patent it! I mean, WTF?! Since when is matrix diagonalization (or somesuch) is patentable?</p></htmltext>
<tokenext>The slashdot should n't concentrate on the breakthrough energy efficiency marketing green crap .
They should concentrate on the fact that IBM has , in essence , patented a mathematical algorithm .
Yes , they did patent it !
I mean , WTF ? !
Since when is matrix diagonalization ( or somesuch ) is patentable ?</tokentext>
<sentencetext>The slashdot shouldn't concentrate on the breakthrough energy efficiency marketing green crap.
They should concentrate on the fact that IBM has, in essence, patented a mathematical algorithm.
Yes, they did patent it!
I mean, WTF?!
Since when is matrix diagonalization (or somesuch) is patentable?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285832</id>
	<title>Re:Here's the actual paper.</title>
	<author>Anonymous</author>
	<datestamp>1267203900000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Sounds like the risk analysis/data mining that was used to justify the pricing of derivatives on Wall Street during the run-up to the 2007 meltdown. Hopefully, they'll restrict the usage of this software to something less destructive, like the modeling of nuclear weapons.</p></htmltext>
<tokenext>Sounds like the risk analysis/data mining that was used to justify the pricing of derivatives on Wall Street during the run-up to the 2007 meltdown .
Hopefully , they 'll restrict the usage of this software to something less destructive , like the modeling of nuclear weapons .</tokentext>
<sentencetext>Sounds like the risk analysis/data mining that was used to justify the pricing of derivatives on Wall Street during the run-up to the 2007 meltdown.
Hopefully, they'll restrict the usage of this software to something less destructive, like the modeling of nuclear weapons.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31291878</id>
	<title>Re:Impressive but</title>
	<author>Anonymous</author>
	<datestamp>1267185720000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Yes, but you don't want to have to clean up the mess it will leave...</p></htmltext>
<tokenext>Yes , but you do n't want to have to clean up the mess it will leave.. .</tokentext>
<sentencetext>Yes, but you don't want to have to clean up the mess it will leave...</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288826</id>
	<title>Re:Color me impressed!</title>
	<author>Plunky</author>
	<datestamp>1267213920000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><blockquote><div><p>Your cell phone is more powerful than the biggest supercomputer that existed in 1970.</p></div></blockquote><p>Intrigued, I checked wikipedia for <a href="http://en.wikipedia.org/wiki/Supercomputers#Timeline\_of\_supercomputers" title="wikipedia.org">supercomputers</a> [wikipedia.org] and found that in 1969 the CDC7600 was rated at 36 MFLOPS. Now, my phone is a couple of years old HTC Elf which I found a <a href="http://www.3dnews.ru/phone/htc\_touch/print" title="3dnews.ru">russian website</a> [3dnews.ru] claiming about 1 MFLOP for, but I found that an <a href="http://www.appleiphoneschool.com/2009/01/27/diagnostics-test-your-mflops/" title="appleiphoneschool.com">iPhone</a> [appleiphoneschool.com] page claims 5-6 MFLOPS is normal, and a post at XDA developers forum claims 1-2 MFLOPS for <a href="http://www.xda-developers.com/forum/showthread.php?t=631810" title="xda-developers.com">Android G1</a> [xda-developers.com] even with overclocking</p><p>So, come back in a couple of years because I don't think we are quite there yet..</p></div>
	</htmltext>
<tokenext>Your cell phone is more powerful than the biggest supercomputer that existed in 1970.Intrigued , I checked wikipedia for supercomputers [ wikipedia.org ] and found that in 1969 the CDC7600 was rated at 36 MFLOPS .
Now , my phone is a couple of years old HTC Elf which I found a russian website [ 3dnews.ru ] claiming about 1 MFLOP for , but I found that an iPhone [ appleiphoneschool.com ] page claims 5-6 MFLOPS is normal , and a post at XDA developers forum claims 1-2 MFLOPS for Android G1 [ xda-developers.com ] even with overclockingSo , come back in a couple of years because I do n't think we are quite there yet. .</tokentext>
<sentencetext>Your cell phone is more powerful than the biggest supercomputer that existed in 1970.Intrigued, I checked wikipedia for supercomputers [wikipedia.org] and found that in 1969 the CDC7600 was rated at 36 MFLOPS.
Now, my phone is a couple of years old HTC Elf which I found a russian website [3dnews.ru] claiming about 1 MFLOP for, but I found that an iPhone [appleiphoneschool.com] page claims 5-6 MFLOPS is normal, and a post at XDA developers forum claims 1-2 MFLOPS for Android G1 [xda-developers.com] even with overclockingSo, come back in a couple of years because I don't think we are quite there yet..
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284462</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284462</id>
	<title>Re:Color me impressed!</title>
	<author>mcgrew</author>
	<datestamp>1267196760000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><i>Hopefully us mere mortals will be able to benefit from such algorihtms</i></p><p>It's a certainty. Your cell phone is more powerful than the biggest supercomputer that existed in 1970.</p></htmltext>
<tokenext>Hopefully us mere mortals will be able to benefit from such algorihtmsIt 's a certainty .
Your cell phone is more powerful than the biggest supercomputer that existed in 1970 .</tokentext>
<sentencetext>Hopefully us mere mortals will be able to benefit from such algorihtmsIt's a certainty.
Your cell phone is more powerful than the biggest supercomputer that existed in 1970.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288472</id>
	<title>Re:Impressive but</title>
	<author>Mashdar</author>
	<datestamp>1267212540000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Only up to 9 TB. And thats 10^12. Don't try 2^40.</htmltext>
<tokenext>Only up to 9 TB .
And thats 10 ^ 12 .
Do n't try 2 ^ 40 .</tokentext>
<sentencetext>Only up to 9 TB.
And thats 10^12.
Don't try 2^40.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286574</id>
	<title>Re:Green-washing</title>
	<author>thtrgremlin</author>
	<datestamp>1267206420000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>yeah, but its two orders of magnitude. That's significant. All with you on fuck the new red revolution, but this is real savings to people that actually do stuff. It isn't like they converted the savings to tons of carbon dioxide, dihydrogen monoxide or polar bear.</htmltext>
<tokenext>yeah , but its two orders of magnitude .
That 's significant .
All with you on fuck the new red revolution , but this is real savings to people that actually do stuff .
It is n't like they converted the savings to tons of carbon dioxide , dihydrogen monoxide or polar bear .</tokentext>
<sentencetext>yeah, but its two orders of magnitude.
That's significant.
All with you on fuck the new red revolution, but this is real savings to people that actually do stuff.
It isn't like they converted the savings to tons of carbon dioxide, dihydrogen monoxide or polar bear.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284406</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285652</id>
	<title>What a shocker</title>
	<author>gibson\_81</author>
	<datestamp>1267203060000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>From TFS:<br>"reduces the computational complexity[...]by two orders of magnitude[...]<br>Additionally, the process used just one percent of the energy that would typically be required"<br>Well, duh, what's so shocking about a computation taking 1\% of the time previously needed now only takes 1\% of the energy as well?</p></htmltext>
<tokenext>From TFS : " reduces the computational complexity [ ... ] by two orders of magnitude [ ... ] Additionally , the process used just one percent of the energy that would typically be required " Well , duh , what 's so shocking about a computation taking 1 \ % of the time previously needed now only takes 1 \ % of the energy as well ?</tokentext>
<sentencetext>From TFS:"reduces the computational complexity[...]by two orders of magnitude[...]Additionally, the process used just one percent of the energy that would typically be required"Well, duh, what's so shocking about a computation taking 1\% of the time previously needed now only takes 1\% of the energy as well?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285608</id>
	<title>Obviously they are going to Patent the algorithm</title>
	<author>StillNeedMoreCoffee</author>
	<datestamp>1267202760000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Obviously are not releasing details until the Patent application goes through and the Patent Troll company set up. They certainly would not release the information so other people could just steal their idea. Maybe they will package it in sealed application and rent it out.  Hmmmm anyone remember the Chess Playing Mechanical Turk? (1770).</p></htmltext>
<tokenext>Obviously are not releasing details until the Patent application goes through and the Patent Troll company set up .
They certainly would not release the information so other people could just steal their idea .
Maybe they will package it in sealed application and rent it out .
Hmmmm anyone remember the Chess Playing Mechanical Turk ?
( 1770 ) .</tokentext>
<sentencetext>Obviously are not releasing details until the Patent application goes through and the Patent Troll company set up.
They certainly would not release the information so other people could just steal their idea.
Maybe they will package it in sealed application and rent it out.
Hmmmm anyone remember the Chess Playing Mechanical Turk?
(1770).</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285234</id>
	<title>Re:Clarification?</title>
	<author>godrik</author>
	<datestamp>1267201080000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>5</modscore>
	<htmltext><p>The conference proceedings are not online yet. So I am not sure. I could not even find the title of the talk on the conference web page</p><p>I know people who are at SIAM PP and they are all : "why are they talking about PP on slashdot ?". There was no major anouncement. I'll check the proceedings again next week, but I believe there is no major improvement. IBM is probably just trying to get some more light.</p><p>We can find the following IBM talks in yesterday page :<br><a href="http://meetings.siam.org/sess/dsp\_programsess.cfm?SESSIONCODE=9507" title="siam.org">http://meetings.siam.org/sess/dsp\_programsess.cfm?SESSIONCODE=9507</a> [siam.org]<br>The paper have the same author and name than this paper published last year :<br><a href="http://portal.acm.org/citation.cfm?id=1645413.1645421" title="acm.org">http://portal.acm.org/citation.cfm?id=1645413.1645421</a> [acm.org]</p><p>So they are probable publishing an improvement on their 2009 work.</p></htmltext>
<tokenext>The conference proceedings are not online yet .
So I am not sure .
I could not even find the title of the talk on the conference web pageI know people who are at SIAM PP and they are all : " why are they talking about PP on slashdot ? " .
There was no major anouncement .
I 'll check the proceedings again next week , but I believe there is no major improvement .
IBM is probably just trying to get some more light.We can find the following IBM talks in yesterday page : http : //meetings.siam.org/sess/dsp \ _programsess.cfm ? SESSIONCODE = 9507 [ siam.org ] The paper have the same author and name than this paper published last year : http : //portal.acm.org/citation.cfm ? id = 1645413.1645421 [ acm.org ] So they are probable publishing an improvement on their 2009 work .</tokentext>
<sentencetext>The conference proceedings are not online yet.
So I am not sure.
I could not even find the title of the talk on the conference web pageI know people who are at SIAM PP and they are all : "why are they talking about PP on slashdot ?".
There was no major anouncement.
I'll check the proceedings again next week, but I believe there is no major improvement.
IBM is probably just trying to get some more light.We can find the following IBM talks in yesterday page :http://meetings.siam.org/sess/dsp\_programsess.cfm?SESSIONCODE=9507 [siam.org]The paper have the same author and name than this paper published last year :http://portal.acm.org/citation.cfm?id=1645413.1645421 [acm.org]So they are probable publishing an improvement on their 2009 work.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288682</id>
	<title>Re:Impressive but</title>
	<author>iggymanz</author>
	<datestamp>1267213320000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>that has trivial solution, just UPDATE collection SET with\_ron\_jeremy =TRUE;</p></htmltext>
<tokenext>that has trivial solution , just UPDATE collection SET with \ _ron \ _jeremy = TRUE ;</tokentext>
<sentencetext>that has trivial solution, just UPDATE collection SET with\_ron\_jeremy =TRUE;</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31328982</id>
	<title>Re:Impressive but</title>
	<author>Anonymous</author>
	<datestamp>1267540860000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>You don't want it organised.</p></htmltext>
<tokenext>You do n't want it organised .</tokentext>
<sentencetext>You don't want it organised.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</id>
	<title>just trying to be relevant</title>
	<author>pydev</author>
	<datestamp>1267196340000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>5</modscore>
	<htmltext><p>Sounds like someone found a faster algorithm (maybe just constants), and since energy efficiency is the hot new thing, "faster" is now translated into "saves energy".</p></htmltext>
<tokenext>Sounds like someone found a faster algorithm ( maybe just constants ) , and since energy efficiency is the hot new thing , " faster " is now translated into " saves energy " .</tokentext>
<sentencetext>Sounds like someone found a faster algorithm (maybe just constants), and since energy efficiency is the hot new thing, "faster" is now translated into "saves energy".</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285350</id>
	<title>Re:What was the algorithm?</title>
	<author>Richy\_T</author>
	<datestamp>1267201560000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>They pushed the turbo button. Freaking interns.</p></htmltext>
<tokenext>They pushed the turbo button .
Freaking interns .</tokentext>
<sentencetext>They pushed the turbo button.
Freaking interns.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284862</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285886</id>
	<title>Re:Clarification?</title>
	<author>Anonymous</author>
	<datestamp>1267204200000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>From the summary (article? this is<nobr> <wbr></nobr>/.!) it seems like they've created a faster CRC-like algorithm.</p></htmltext>
<tokenext>From the summary ( article ?
this is /. !
) it seems like they 've created a faster CRC-like algorithm .</tokentext>
<sentencetext>From the summary (article?
this is /.!
) it seems like they've created a faster CRC-like algorithm.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284800</id>
	<title>Re:just trying to be relevant</title>
	<author>Anonymous</author>
	<datestamp>1267198500000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Did you actually read the article? Why was parent modded up? 1 day processing to 20 minutes processing is obviously a measure of speed. Common sense tells you that spending 20 minutes to do something takes less energy than taking up to a day doing the same thing.</p></htmltext>
<tokenext>Did you actually read the article ?
Why was parent modded up ?
1 day processing to 20 minutes processing is obviously a measure of speed .
Common sense tells you that spending 20 minutes to do something takes less energy than taking up to a day doing the same thing .</tokentext>
<sentencetext>Did you actually read the article?
Why was parent modded up?
1 day processing to 20 minutes processing is obviously a measure of speed.
Common sense tells you that spending 20 minutes to do something takes less energy than taking up to a day doing the same thing.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285266</id>
	<title>So...</title>
	<author>Anonymous</author>
	<datestamp>1267201200000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>are they marketing the price of the new algorithm? Peak oil trumps software. If they open source it...never mind.</p></htmltext>
<tokenext>are they marketing the price of the new algorithm ?
Peak oil trumps software .
If they open source it...never mind .</tokentext>
<sentencetext>are they marketing the price of the new algorithm?
Peak oil trumps software.
If they open source it...never mind.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285430</id>
	<title>Re:just trying to be relevant</title>
	<author>sakonofie</author>
	<datestamp>1267201980000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>I kept thinking that they just took the 20 min. running time and divided that by 1 day.  This is roughly 1.38 percent.  Make an assumption about energy consumption being constant while the machine is running, and viola instant buzzword compliance. But then I read the article,<blockquote><div><p>*the JuGene supercomputer at Forschungszentrum Julich requires about 52800 kWh for one day of operation on the full machine, the IBM demonstration required an estimated 700 kWh</p></div>
</blockquote><p>
Which is roughly 1.32 percent.  So no big surprises.</p></div>
	</htmltext>
<tokenext>I kept thinking that they just took the 20 min .
running time and divided that by 1 day .
This is roughly 1.38 percent .
Make an assumption about energy consumption being constant while the machine is running , and viola instant buzzword compliance .
But then I read the article , * the JuGene supercomputer at Forschungszentrum Julich requires about 52800 kWh for one day of operation on the full machine , the IBM demonstration required an estimated 700 kWh Which is roughly 1.32 percent .
So no big surprises .</tokentext>
<sentencetext>I kept thinking that they just took the 20 min.
running time and divided that by 1 day.
This is roughly 1.38 percent.
Make an assumption about energy consumption being constant while the machine is running, and viola instant buzzword compliance.
But then I read the article,*the JuGene supercomputer at Forschungszentrum Julich requires about 52800 kWh for one day of operation on the full machine, the IBM demonstration required an estimated 700 kWh

Which is roughly 1.32 percent.
So no big surprises.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284804</id>
	<title>Re:This is a pretty good energy-saving algo...</title>
	<author>biryokumaru</author>
	<datestamp>1267198560000</datestamp>
	<modclass>Funny</modclass>
	<modscore>3</modscore>
	<htmltext><p><div class="quote"><p>Running this once should reduce your PC's energy consumption to near zoro:</p></div><p>The only problem is, with all that jumping around and swordplay, Zorro ends up using <i>tons</i> of energy.</p></div>
	</htmltext>
<tokenext>Running this once should reduce your PC 's energy consumption to near zoro : The only problem is , with all that jumping around and swordplay , Zorro ends up using tons of energy .</tokentext>
<sentencetext>Running this once should reduce your PC's energy consumption to near zoro:The only problem is, with all that jumping around and swordplay, Zorro ends up using tons of energy.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284672</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288032</id>
	<title>Explanations ..</title>
	<author>roguegramma</author>
	<datestamp>1267211160000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Nothing new, probably just using caching and a makefile-like dependency-checking algorithm.</p><p>Kind like you can speed up the calculations in the game of life if you calculate the sums of 3 adjacent cells over x first, and calculate the sums over y of the previous sums. So you use 4 addition operations instead of 8 (and some array indexing operations which I'm too lazy to calculate, probably 6 instead of 8).</p><p>Really sad that they will probably patent it so no one else can use it for 20 years.</p></htmltext>
<tokenext>Nothing new , probably just using caching and a makefile-like dependency-checking algorithm.Kind like you can speed up the calculations in the game of life if you calculate the sums of 3 adjacent cells over x first , and calculate the sums over y of the previous sums .
So you use 4 addition operations instead of 8 ( and some array indexing operations which I 'm too lazy to calculate , probably 6 instead of 8 ) .Really sad that they will probably patent it so no one else can use it for 20 years .</tokentext>
<sentencetext>Nothing new, probably just using caching and a makefile-like dependency-checking algorithm.Kind like you can speed up the calculations in the game of life if you calculate the sums of 3 adjacent cells over x first, and calculate the sums over y of the previous sums.
So you use 4 addition operations instead of 8 (and some array indexing operations which I'm too lazy to calculate, probably 6 instead of 8).Really sad that they will probably patent it so no one else can use it for 20 years.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284862</id>
	<title>What was the algorithm?</title>
	<author>spiffmastercow</author>
	<datestamp>1267198920000</datestamp>
	<modclass>Redundant</modclass>
	<modscore>1</modscore>
	<htmltext>What was the algorithm?  For all I know (having not read TFA), it could be that they replaced bubble sort with quicksort.</htmltext>
<tokenext>What was the algorithm ?
For all I know ( having not read TFA ) , it could be that they replaced bubble sort with quicksort .</tokentext>
<sentencetext>What was the algorithm?
For all I know (having not read TFA), it could be that they replaced bubble sort with quicksort.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285964</id>
	<title>They ran it on the Lotus Notes codebase...</title>
	<author>Anonymous</author>
	<datestamp>1267204500000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>...and it automatically fired three project managers.</p></htmltext>
<tokenext>...and it automatically fired three project managers .</tokentext>
<sentencetext>...and it automatically fired three project managers.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286814</id>
	<title>Secret:  Here's the algorithm</title>
	<author>UnknowingFool</author>
	<datestamp>1267207080000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I shouldn't be telling anyone this but I found the algorithm.  Here it is in Java, please convert it to your preferred language.</p><p>

<tt>
public int computeData(Data data) {
     return 42;
}
</tt>

</p><p>Oh crap, I forgot to post this anonymously.  <b>Why are there mice all over the pl@</b>#M  *^&amp;I RCS$WE^\%
</p><p>
[CARRIER LOST]</p></htmltext>
<tokenext>I should n't be telling anyone this but I found the algorithm .
Here it is in Java , please convert it to your preferred language .
public int computeData ( Data data ) { return 42 ; } Oh crap , I forgot to post this anonymously .
Why are there mice all over the pl @ # M * ^ &amp;I RCS $ WE ^ \ % [ CARRIER LOST ]</tokentext>
<sentencetext>I shouldn't be telling anyone this but I found the algorithm.
Here it is in Java, please convert it to your preferred language.
public int computeData(Data data) {
     return 42;
}


Oh crap, I forgot to post this anonymously.
Why are there mice all over the pl@#M  *^&amp;I RCS$WE^\%

[CARRIER LOST]</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289866</id>
	<title>Re:Here's the actual paper.</title>
	<author>Slicebo</author>
	<datestamp>1267175280000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>"... computing the diagonal of inverse covariance matrices..."</p><p>Oh, gotcha.  Why didn't you say so in the first place?</p></htmltext>
<tokenext>" ... computing the diagonal of inverse covariance matrices... " Oh , gotcha .
Why did n't you say so in the first place ?</tokentext>
<sentencetext>"... computing the diagonal of inverse covariance matrices..."Oh, gotcha.
Why didn't you say so in the first place?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285592</id>
	<title>Sounds like magic to me.</title>
	<author>buddyglass</author>
	<datestamp>1267202760000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Burn 'em.</htmltext>
<tokenext>Burn 'em .</tokentext>
<sentencetext>Burn 'em.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284406</id>
	<title>Green-washing</title>
	<author>AdamInParadise</author>
	<datestamp>1267196520000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I'm all for energy-efficient algorithms and datacenter but this PR is nothing but green-washing. IBM's algorithm is just faster so it uses less energy. Duh.</p><p>Automatically spreading loads across datacenters in multiple locations to take advantage of local environmental conditions so you don't have to use chillers, now that's something.</p></htmltext>
<tokenext>I 'm all for energy-efficient algorithms and datacenter but this PR is nothing but green-washing .
IBM 's algorithm is just faster so it uses less energy .
Duh.Automatically spreading loads across datacenters in multiple locations to take advantage of local environmental conditions so you do n't have to use chillers , now that 's something .</tokentext>
<sentencetext>I'm all for energy-efficient algorithms and datacenter but this PR is nothing but green-washing.
IBM's algorithm is just faster so it uses less energy.
Duh.Automatically spreading loads across datacenters in multiple locations to take advantage of local environmental conditions so you don't have to use chillers, now that's something.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372</id>
	<title>Here's the actual paper.</title>
	<author>Anonymous</author>
	<datestamp>1267201680000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>5</modscore>
	<htmltext><p>"Low cost high performance uncertainty quantification", full text available in PDF.</p><p><a href="http://portal.acm.org/citation.cfm?id=1645421&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=77531079&amp;CFTOKEN=42017699&amp;ret=1#Fulltext" title="acm.org">http://portal.acm.org/citation.cfm?id=1645421&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=77531079&amp;CFTOKEN=42017699&amp;ret=1#Fulltext</a> [acm.org]</p><p>And, here's the abstract:</p><p>Uncertainty quantification in risk analysis has become a key<br>application. In this context, computing the diagonal of in-<br>verse covariance matrices is of paramount importance. Stan-<br>dard techniques, that employ matrix factorizations, incur a<br>cubic cost which quickly becomes intractable with the cur-<br>rent explosion of data sizes. In this work we reduce this<br>complexity to quadratic with the synergy of two algorithms<br>that gracefully complement each other and lead to a radi-<br>cally different approach. First, we turned to stochastic esti-<br>mation of the diagonal. This allowed us to cast the problem<br>as a linear system with a relatively small number of multiple<br>right hand sides. Second, for this linear system we developed<br>a novel, mixed precision, iterative refinement scheme, which<br>uses iterative solvers instead of matrix factorizations. We<br>demonstrate that the new framework not only achieves the<br>much needed quadratic cost but in addition offers excellent<br>opportunities for scaling at massively parallel environments.<br>We based our implementation on BLAS 3 kernels that en-<br>sure very high processor performance. We achieved a peak<br>performance of 730 TFlops on 72 BG/P racks, with a sus-<br>tained performance 73\% of theoretical peak. We stress that<br>the techniques presented in this work are quite general and<br>applicable to several other important applications.</p></htmltext>
<tokenext>" Low cost high performance uncertainty quantification " , full text available in PDF.http : //portal.acm.org/citation.cfm ? id = 1645421&amp;coll = GUIDE&amp;dl = GUIDE&amp;CFID = 77531079&amp;CFTOKEN = 42017699&amp;ret = 1 # Fulltext [ acm.org ] And , here 's the abstract : Uncertainty quantification in risk analysis has become a keyapplication .
In this context , computing the diagonal of in-verse covariance matrices is of paramount importance .
Stan-dard techniques , that employ matrix factorizations , incur acubic cost which quickly becomes intractable with the cur-rent explosion of data sizes .
In this work we reduce thiscomplexity to quadratic with the synergy of two algorithmsthat gracefully complement each other and lead to a radi-cally different approach .
First , we turned to stochastic esti-mation of the diagonal .
This allowed us to cast the problemas a linear system with a relatively small number of multipleright hand sides .
Second , for this linear system we developeda novel , mixed precision , iterative refinement scheme , whichuses iterative solvers instead of matrix factorizations .
Wedemonstrate that the new framework not only achieves themuch needed quadratic cost but in addition offers excellentopportunities for scaling at massively parallel environments.We based our implementation on BLAS 3 kernels that en-sure very high processor performance .
We achieved a peakperformance of 730 TFlops on 72 BG/P racks , with a sus-tained performance 73 \ % of theoretical peak .
We stress thatthe techniques presented in this work are quite general andapplicable to several other important applications .</tokentext>
<sentencetext>"Low cost high performance uncertainty quantification", full text available in PDF.http://portal.acm.org/citation.cfm?id=1645421&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=77531079&amp;CFTOKEN=42017699&amp;ret=1#Fulltext [acm.org]And, here's the abstract:Uncertainty quantification in risk analysis has become a keyapplication.
In this context, computing the diagonal of in-verse covariance matrices is of paramount importance.
Stan-dard techniques, that employ matrix factorizations, incur acubic cost which quickly becomes intractable with the cur-rent explosion of data sizes.
In this work we reduce thiscomplexity to quadratic with the synergy of two algorithmsthat gracefully complement each other and lead to a radi-cally different approach.
First, we turned to stochastic esti-mation of the diagonal.
This allowed us to cast the problemas a linear system with a relatively small number of multipleright hand sides.
Second, for this linear system we developeda novel, mixed precision, iterative refinement scheme, whichuses iterative solvers instead of matrix factorizations.
Wedemonstrate that the new framework not only achieves themuch needed quadratic cost but in addition offers excellentopportunities for scaling at massively parallel environments.We based our implementation on BLAS 3 kernels that en-sure very high processor performance.
We achieved a peakperformance of 730 TFlops on 72 BG/P racks, with a sus-tained performance 73\% of theoretical peak.
We stress thatthe techniques presented in this work are quite general andapplicable to several other important applications.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289042</id>
	<title>Re:Clarification?</title>
	<author>iggymanz</author>
	<datestamp>1267214760000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>From: IBM, Global Marketing and Creative Division<br>To:      TwinBee (slashdot id 767046)<br>Date:  26 February 2010<br>Re:     Clarification</p><p>Dear Sir:</p><p>We Hate You.</p><p>Sincerely,</p><p>Norbert Bluesoot<br>Director, IBM Global Marketing and Creative</p></htmltext>
<tokenext>From : IBM , Global Marketing and Creative DivisionTo : TwinBee ( slashdot id 767046 ) Date : 26 February 2010Re : ClarificationDear Sir : We Hate You.Sincerely,Norbert BluesootDirector , IBM Global Marketing and Creative</tokentext>
<sentencetext>From: IBM, Global Marketing and Creative DivisionTo:      TwinBee (slashdot id 767046)Date:  26 February 2010Re:     ClarificationDear Sir:We Hate You.Sincerely,Norbert BluesootDirector, IBM Global Marketing and Creative</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285084</id>
	<title>Re:Clarification?</title>
	<author>swillden</author>
	<datestamp>1267200120000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>Can someone please clarify exactly what they've achieved here? All I hear is that they can somehow sift through large quantities of data much quicker. What kind of data? What are they trying to extract? And for what end?</p></div><p>I don't know about the rest of it, but I can answer the last question:  To boost IBM's stock price!  And as the holder of a number of IBM stock options, I must say I think that's a wonderful goal.<nobr> <wbr></nobr>:-)</p></div>
	</htmltext>
<tokenext>Can someone please clarify exactly what they 've achieved here ?
All I hear is that they can somehow sift through large quantities of data much quicker .
What kind of data ?
What are they trying to extract ?
And for what end ? I do n't know about the rest of it , but I can answer the last question : To boost IBM 's stock price !
And as the holder of a number of IBM stock options , I must say I think that 's a wonderful goal .
: - )</tokentext>
<sentencetext>Can someone please clarify exactly what they've achieved here?
All I hear is that they can somehow sift through large quantities of data much quicker.
What kind of data?
What are they trying to extract?
And for what end?I don't know about the rest of it, but I can answer the last question:  To boost IBM's stock price!
And as the holder of a number of IBM stock options, I must say I think that's a wonderful goal.
:-)
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286016</id>
	<title>Re:Here's the actual paper.</title>
	<author>ath1901</author>
	<datestamp>1267204620000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>OK, so instead of computing the covariance matrices using standard matrix inversion methods, they estimate it using stochastic methods and the algorithm is massively parallelisable.</p><p>So, the massive speedup is compared to standard matrix inversion techniques, probably in combination with the extra speed from parallelisation.</p><p>Sounds like a great algorithm. I guess it "saves energy" just like quicksort "saves energy" compared to bubblesort...</p></htmltext>
<tokenext>OK , so instead of computing the covariance matrices using standard matrix inversion methods , they estimate it using stochastic methods and the algorithm is massively parallelisable.So , the massive speedup is compared to standard matrix inversion techniques , probably in combination with the extra speed from parallelisation.Sounds like a great algorithm .
I guess it " saves energy " just like quicksort " saves energy " compared to bubblesort.. .</tokentext>
<sentencetext>OK, so instead of computing the covariance matrices using standard matrix inversion methods, they estimate it using stochastic methods and the algorithm is massively parallelisable.So, the massive speedup is compared to standard matrix inversion techniques, probably in combination with the extra speed from parallelisation.Sounds like a great algorithm.
I guess it "saves energy" just like quicksort "saves energy" compared to bubblesort...</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284780</id>
	<title>Re:Wat</title>
	<author>PopeRatzo</author>
	<datestamp>1267198440000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><blockquote><div><p>I guess they stopped using Windows Vista?</p></div></blockquote><p>2006 called and wants its jokes back.</p></div>
	</htmltext>
<tokenext>I guess they stopped using Windows Vista ? 2006 called and wants its jokes back .</tokentext>
<sentencetext>I guess they stopped using Windows Vista?2006 called and wants its jokes back.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284354</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284308</id>
	<title>I'd expect this</title>
	<author>Anonymous</author>
	<datestamp>1267195980000</datestamp>
	<modclass>Flamebait</modclass>
	<modscore>-1</modscore>
	<htmltext><p>Out of smart people, not greenards</p></htmltext>
<tokenext>Out of smart people , not greenards</tokentext>
<sentencetext>Out of smart people, not greenards</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286986</id>
	<title>Re:Awesome!</title>
	<author>Jesus\_666</author>
	<datestamp>1267207620000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Apparently IBM found a generic algorithm that can be applied to any problem. Sorting, filtering, traveling salesman...</htmltext>
<tokenext>Apparently IBM found a generic algorithm that can be applied to any problem .
Sorting , filtering , traveling salesman.. .</tokentext>
<sentencetext>Apparently IBM found a generic algorithm that can be applied to any problem.
Sorting, filtering, traveling salesman...</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284424</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285190</id>
	<title>Re:Impressive but</title>
	<author>Anonymous</author>
	<datestamp>1267200840000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p><div class="quote"><p>Can it organise my porn?</p></div><p>Sure! In fact, that shouldn't take it more than a minute... After all, you don't either...</p></div>
	</htmltext>
<tokenext>Can it organise my porn ? Sure !
In fact , that should n't take it more than a minute... After all , you do n't either.. .</tokentext>
<sentencetext>Can it organise my porn?Sure!
In fact, that shouldn't take it more than a minute... After all, you don't either...
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289216</id>
	<title>Congrats IBM!</title>
	<author>chaynlynk</author>
	<datestamp>1267215300000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>You managed to optimize your SQL query.<br>
<br>
When I optimize my queries, why don't I get press releases?!</htmltext>
<tokenext>You managed to optimize your SQL query .
When I optimize my queries , why do n't I get press releases ?
!</tokentext>
<sentencetext>You managed to optimize your SQL query.
When I optimize my queries, why don't I get press releases?
!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284672</id>
	<title>This is a pretty good energy-saving algo...</title>
	<author>FreeUser</author>
	<datestamp>1267197900000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Implemented for Linux, but analogously applicable to other systems.  Running this once should reduce your PC's energy consumption to near zoro:</p><p><tt><br>#!/bin/bash<br>#<br># save-energy.sh<br>#<br># Save enormous amounts of energy, irrespective of cost in lost computation<br># must be run as root<nobr> <wbr></nobr>/sbin/shutdown<br></tt></p><p>Of course, effeciency will be lost if you do anything else with your PC (like turn it back on), but hey, no algorithm is perfect for all use cases.</p></htmltext>
<tokenext>Implemented for Linux , but analogously applicable to other systems .
Running this once should reduce your PC 's energy consumption to near zoro : # ! /bin/bash # # save-energy.sh # # Save enormous amounts of energy , irrespective of cost in lost computation # must be run as root /sbin/shutdownOf course , effeciency will be lost if you do anything else with your PC ( like turn it back on ) , but hey , no algorithm is perfect for all use cases .</tokentext>
<sentencetext>Implemented for Linux, but analogously applicable to other systems.
Running this once should reduce your PC's energy consumption to near zoro:#!/bin/bash## save-energy.sh## Save enormous amounts of energy, irrespective of cost in lost computation# must be run as root /sbin/shutdownOf course, effeciency will be lost if you do anything else with your PC (like turn it back on), but hey, no algorithm is perfect for all use cases.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288646</id>
	<title>I outperform any search engine</title>
	<author>Ceriel Nosforit</author>
	<datestamp>1267213140000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Low Cost High Performance Uncertainty Quantification<br><a href="http://portal.acm.org/citation.cfm?id=1645421&amp;jmp=cit&amp;coll=portal&amp;dl=ACM&amp;CFID=62671076&amp;CFTOKEN=92670385#CIT" title="acm.org">http://portal.acm.org/citation.cfm?id=1645421&amp;jmp=cit&amp;coll=portal&amp;dl=ACM&amp;CFID=62671076&amp;CFTOKEN=92670385#CIT</a> [acm.org]</p><p>Keywords:<br>Inverse Covariance Matrices, Stochastic Estimation, Iterative<br>Renement, Iterative Solvers, Quadratic Cost, Massive<br>Parallelism</p></htmltext>
<tokenext>Low Cost High Performance Uncertainty Quantificationhttp : //portal.acm.org/citation.cfm ? id = 1645421&amp;jmp = cit&amp;coll = portal&amp;dl = ACM&amp;CFID = 62671076&amp;CFTOKEN = 92670385 # CIT [ acm.org ] Keywords : Inverse Covariance Matrices , Stochastic Estimation , IterativeRenement , Iterative Solvers , Quadratic Cost , MassiveParallelism</tokentext>
<sentencetext>Low Cost High Performance Uncertainty Quantificationhttp://portal.acm.org/citation.cfm?id=1645421&amp;jmp=cit&amp;coll=portal&amp;dl=ACM&amp;CFID=62671076&amp;CFTOKEN=92670385#CIT [acm.org]Keywords:Inverse Covariance Matrices, Stochastic Estimation, IterativeRenement, Iterative Solvers, Quadratic Cost, MassiveParallelism</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31287096</id>
	<title>Re:Impressive but</title>
	<author>sackvillian</author>
	<datestamp>1267207980000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>Can it organise my porn?</p></div><p>Possibly, but so far it's only been tested up to nine terabytes of data.</p></div>
	</htmltext>
<tokenext>Can it organise my porn ? Possibly , but so far it 's only been tested up to nine terabytes of data .</tokentext>
<sentencetext>Can it organise my porn?Possibly, but so far it's only been tested up to nine terabytes of data.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284584</id>
	<title>Re:Color me impressed!</title>
	<author>Tuoqui</author>
	<datestamp>1267197420000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>ofcourse it will, dont you realize the NSA will be using this to crack encryption like 10000\% faster?<nobr> <wbr></nobr>:P</p></htmltext>
<tokenext>ofcourse it will , dont you realize the NSA will be using this to crack encryption like 10000 \ % faster ?
: P</tokentext>
<sentencetext>ofcourse it will, dont you realize the NSA will be using this to crack encryption like 10000\% faster?
:P</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31293456</id>
	<title>Re:just trying to be relevant</title>
	<author>Hurricane78</author>
	<datestamp>1267194840000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Well, that&rsquo;s just the intermediate form. Since investors are going to translate it into &ldquo;Saves money. <em>Lots</em> of money!&rdquo;.</p><p>I can&rsquo;t see how this is a bad thing.<br>(Except of course if they patent the algorithm and have draconian terms.)</p></htmltext>
<tokenext>Well , that    s just the intermediate form .
Since investors are going to translate it into    Saves money .
Lots of money !    .I can    t see how this is a bad thing .
( Except of course if they patent the algorithm and have draconian terms .
)</tokentext>
<sentencetext>Well, that’s just the intermediate form.
Since investors are going to translate it into “Saves money.
Lots of money!”.I can’t see how this is a bad thing.
(Except of course if they patent the algorithm and have draconian terms.
)</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31297312</id>
	<title>not just a change in constants</title>
	<author>LandruBek</author>
	<datestamp>1267292760000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>You're right that spinning this as a green result is trendy.  But it can't be just a change in constants, since they say they reduced the complexity.  "Reducing the complexity" is a technical term that means the speed, as a function of input size n (or l,m,n, etc.), keeps improving as n gets bigger.  That is,<br><tt><br>lim              time\_required\_new(n) / time\_required\_old(n)   =   0.<br>n --&gt; infinity<br></tt></p><p>An example is that an O(n log n) algorithm like Heapsort has reduced complexity compared to an O(n**2) algorithm like selection sort.  But you can't legitimately claim to have "reduced the complexity" just by cleaning up the code or cutting out a constant factor of work (like going from bubble sort to selection sort).</p></htmltext>
<tokenext>You 're right that spinning this as a green result is trendy .
But it ca n't be just a change in constants , since they say they reduced the complexity .
" Reducing the complexity " is a technical term that means the speed , as a function of input size n ( or l,m,n , etc .
) , keeps improving as n gets bigger .
That is,lim time \ _required \ _new ( n ) / time \ _required \ _old ( n ) = 0.n -- &gt; infinityAn example is that an O ( n log n ) algorithm like Heapsort has reduced complexity compared to an O ( n * * 2 ) algorithm like selection sort .
But you ca n't legitimately claim to have " reduced the complexity " just by cleaning up the code or cutting out a constant factor of work ( like going from bubble sort to selection sort ) .</tokentext>
<sentencetext>You're right that spinning this as a green result is trendy.
But it can't be just a change in constants, since they say they reduced the complexity.
"Reducing the complexity" is a technical term that means the speed, as a function of input size n (or l,m,n, etc.
), keeps improving as n gets bigger.
That is,lim              time\_required\_new(n) / time\_required\_old(n)   =   0.n --&gt; infinityAn example is that an O(n log n) algorithm like Heapsort has reduced complexity compared to an O(n**2) algorithm like selection sort.
But you can't legitimately claim to have "reduced the complexity" just by cleaning up the code or cutting out a constant factor of work (like going from bubble sort to selection sort).</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31299320</id>
	<title>What they've done</title>
	<author>justanothermathnerd</author>
	<datestamp>1267262640000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>2</modscore>
	<htmltext><p>For anyone who's interested in what these guys have done- the WHPCF'09 paper by Bekas and Fedulova (and going back a bit further, their 2007 paper by Bekas et al.) give the details.</p><p>In many statistical problems we end up with the problem of finding the diagonal entries of the inverse of a known symmetric and positive definite matrix A.  For example, in linear regression the variances for the fitted parameters are found on the diagonal of inv(X'*X).  When this matrix A is very large, the computation can be very expensive, since it requires O(N^3) time by conventional methods (Compute the Cholesky factorization of A and then use the Cholesky factors to solve for N right hand sides.)</p><p>Bekas et al. have developed a Monte Carlo approach that can give good (e.g. 2-3 digits of accuracy) estimates of the diagonal entries in inv(A) by using an interative method to approximately solve systems of linear equations involving A.  The approximate iterative solutions take roughly O(N^2) time, and there are s of these systems to solve, where sN.  Thus the computational complexity is lowered from O(N^3) to roughly O(N^2).  Furthermore, you can solve these s systems of equations in parallel.  Going one step further, you can do a lot of the computation in single precision, so it can be done on GPGPU's and other machines that don't do double precision floating point efficiently.</p></htmltext>
<tokenext>For anyone who 's interested in what these guys have done- the WHPCF'09 paper by Bekas and Fedulova ( and going back a bit further , their 2007 paper by Bekas et al .
) give the details.In many statistical problems we end up with the problem of finding the diagonal entries of the inverse of a known symmetric and positive definite matrix A. For example , in linear regression the variances for the fitted parameters are found on the diagonal of inv ( X ' * X ) .
When this matrix A is very large , the computation can be very expensive , since it requires O ( N ^ 3 ) time by conventional methods ( Compute the Cholesky factorization of A and then use the Cholesky factors to solve for N right hand sides .
) Bekas et al .
have developed a Monte Carlo approach that can give good ( e.g .
2-3 digits of accuracy ) estimates of the diagonal entries in inv ( A ) by using an interative method to approximately solve systems of linear equations involving A. The approximate iterative solutions take roughly O ( N ^ 2 ) time , and there are s of these systems to solve , where sN .
Thus the computational complexity is lowered from O ( N ^ 3 ) to roughly O ( N ^ 2 ) .
Furthermore , you can solve these s systems of equations in parallel .
Going one step further , you can do a lot of the computation in single precision , so it can be done on GPGPU 's and other machines that do n't do double precision floating point efficiently .</tokentext>
<sentencetext>For anyone who's interested in what these guys have done- the WHPCF'09 paper by Bekas and Fedulova (and going back a bit further, their 2007 paper by Bekas et al.
) give the details.In many statistical problems we end up with the problem of finding the diagonal entries of the inverse of a known symmetric and positive definite matrix A.  For example, in linear regression the variances for the fitted parameters are found on the diagonal of inv(X'*X).
When this matrix A is very large, the computation can be very expensive, since it requires O(N^3) time by conventional methods (Compute the Cholesky factorization of A and then use the Cholesky factors to solve for N right hand sides.
)Bekas et al.
have developed a Monte Carlo approach that can give good (e.g.
2-3 digits of accuracy) estimates of the diagonal entries in inv(A) by using an interative method to approximately solve systems of linear equations involving A.  The approximate iterative solutions take roughly O(N^2) time, and there are s of these systems to solve, where sN.
Thus the computational complexity is lowered from O(N^3) to roughly O(N^2).
Furthermore, you can solve these s systems of equations in parallel.
Going one step further, you can do a lot of the computation in single precision, so it can be done on GPGPU's and other machines that don't do double precision floating point efficiently.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</id>
	<title>Impressive but</title>
	<author>Anonymous</author>
	<datestamp>1267196400000</datestamp>
	<modclass>Funny</modclass>
	<modscore>3</modscore>
	<htmltext><p>Can it organise my porn?</p></htmltext>
<tokenext>Can it organise my porn ?</tokentext>
<sentencetext>Can it organise my porn?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426</id>
	<title>Clarification?</title>
	<author>Twinbee</author>
	<datestamp>1267196580000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>4</modscore>
	<htmltext><p>Can someone please clarify exactly what they've achieved here? All I hear is that they can somehow sift through large quantities of data much quicker. What kind of data? What are they trying to extract? And for what end?</p></htmltext>
<tokenext>Can someone please clarify exactly what they 've achieved here ?
All I hear is that they can somehow sift through large quantities of data much quicker .
What kind of data ?
What are they trying to extract ?
And for what end ?</tokentext>
<sentencetext>Can someone please clarify exactly what they've achieved here?
All I hear is that they can somehow sift through large quantities of data much quicker.
What kind of data?
What are they trying to extract?
And for what end?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284876</id>
	<title>A more informative link</title>
	<author>Anonymous</author>
	<datestamp>1267199040000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>3</modscore>
	<htmltext><p>Here's a link with actual content on what the algorithm does:</p><p>http://www.hpcwire.com/features/IBM-Invents-Short-Cut-to-Assessing-Data-Quality-85427987.html</p></htmltext>
<tokenext>Here 's a link with actual content on what the algorithm does : http : //www.hpcwire.com/features/IBM-Invents-Short-Cut-to-Assessing-Data-Quality-85427987.html</tokentext>
<sentencetext>Here's a link with actual content on what the algorithm does:http://www.hpcwire.com/features/IBM-Invents-Short-Cut-to-Assessing-Data-Quality-85427987.html</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284354</id>
	<title>Wat</title>
	<author>Anonymous</author>
	<datestamp>1267196280000</datestamp>
	<modclass>Funny</modclass>
	<modscore>4</modscore>
	<htmltext><blockquote><div><p>reduces the computational complexity, costs, and energy usage for analyzing the quality of massive amounts of data by two orders of magnitude.</p></div></blockquote><p>I guess they stopped using Windows Vista?</p></div>
	</htmltext>
<tokenext>reduces the computational complexity , costs , and energy usage for analyzing the quality of massive amounts of data by two orders of magnitude.I guess they stopped using Windows Vista ?</tokentext>
<sentencetext>reduces the computational complexity, costs, and energy usage for analyzing the quality of massive amounts of data by two orders of magnitude.I guess they stopped using Windows Vista?
	</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330</id>
	<title>Color me impressed!</title>
	<author>spammeister</author>
	<datestamp>1267196100000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>And that color would be blue! Hopefully us mere mortals will be able to benefit from such algorihtms.</htmltext>
<tokenext>And that color would be blue !
Hopefully us mere mortals will be able to benefit from such algorihtms .</tokentext>
<sentencetext>And that color would be blue!
Hopefully us mere mortals will be able to benefit from such algorihtms.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286620</id>
	<title>What does it mean for encryption and security?</title>
	<author>tchdab1</author>
	<datestamp>1267206540000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>The description of this "new algorithm" is pretty sparse.<br>Any word on if it allows faster solutions to encryption problems so that we now all need longer passwords?</p></htmltext>
<tokenext>The description of this " new algorithm " is pretty sparse.Any word on if it allows faster solutions to encryption problems so that we now all need longer passwords ?</tokentext>
<sentencetext>The description of this "new algorithm" is pretty sparse.Any word on if it allows faster solutions to encryption problems so that we now all need longer passwords?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286184</id>
	<title>Re:just trying to be relevant</title>
	<author>Anonymous</author>
	<datestamp>1267205160000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>When I first read the headline I was imagining that they'd come up with a brand new semi-magical compiler optimisation trick that would make code run fast enough that you notice the difference in power bills.<br>,br&gt;Seems unlikely.</p></htmltext>
<tokenext>When I first read the headline I was imagining that they 'd come up with a brand new semi-magical compiler optimisation trick that would make code run fast enough that you notice the difference in power bills.,br &gt; Seems unlikely .</tokentext>
<sentencetext>When I first read the headline I was imagining that they'd come up with a brand new semi-magical compiler optimisation trick that would make code run fast enough that you notice the difference in power bills.,br&gt;Seems unlikely.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285200</id>
	<title>Re:I'd expect this</title>
	<author>Crudely\_Indecent</author>
	<datestamp>1267200840000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>You're talking about a company that builds supercomputers to play chess.  They're hardly greenards.</p><p>They are, however, moving to greener pastures in response to the demands of the marketplace.</p><p>That sounds smart to me.</p></htmltext>
<tokenext>You 're talking about a company that builds supercomputers to play chess .
They 're hardly greenards.They are , however , moving to greener pastures in response to the demands of the marketplace.That sounds smart to me .</tokentext>
<sentencetext>You're talking about a company that builds supercomputers to play chess.
They're hardly greenards.They are, however, moving to greener pastures in response to the demands of the marketplace.That sounds smart to me.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284308</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284692</id>
	<title>Re:Color me impressed!</title>
	<author>PopeRatzo</author>
	<datestamp>1267198080000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><blockquote><div><p>Hopefully us mere mortals will be able to benefit from such algorihtms.</p></div></blockquote><p>Not if the energy industry has anything to say about it.</p></div>
	</htmltext>
<tokenext>Hopefully us mere mortals will be able to benefit from such algorihtms.Not if the energy industry has anything to say about it .</tokentext>
<sentencetext>Hopefully us mere mortals will be able to benefit from such algorihtms.Not if the energy industry has anything to say about it.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284362</id>
	<title>Cool, they've "discovered" PostgreSQL.</title>
	<author>Anonymous</author>
	<datestamp>1267196280000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>1</modscore>
	<htmltext><p>After we moved from MySQL to PostgreSQL, we saw similar performance improvements. Then we doubled our performance again when we moved to FreeBSD from Linux. We never expected a few software changes to have such a big impact, but were happy that we could reuse all of our existing hardware.</p></htmltext>
<tokenext>After we moved from MySQL to PostgreSQL , we saw similar performance improvements .
Then we doubled our performance again when we moved to FreeBSD from Linux .
We never expected a few software changes to have such a big impact , but were happy that we could reuse all of our existing hardware .</tokentext>
<sentencetext>After we moved from MySQL to PostgreSQL, we saw similar performance improvements.
Then we doubled our performance again when we moved to FreeBSD from Linux.
We never expected a few software changes to have such a big impact, but were happy that we could reuse all of our existing hardware.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285566</id>
	<title>Guess what...</title>
	<author>Anonymous</author>
	<datestamp>1267202580000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>20 minutes is roughly 1\% of "More than a day",</p><p>so it's not only using "1\% of the energy required",<br>
&nbsp; it's just using 1\% of the time required,</p><p>so this is not a breakthrough of energy efficiency,  it's a "CPU time" breakthrough, LOL</p></htmltext>
<tokenext>20 minutes is roughly 1 \ % of " More than a day " ,so it 's not only using " 1 \ % of the energy required " ,   it 's just using 1 \ % of the time required,so this is not a breakthrough of energy efficiency , it 's a " CPU time " breakthrough , LOL</tokentext>
<sentencetext>20 minutes is roughly 1\% of "More than a day",so it's not only using "1\% of the energy required",
  it's just using 1\% of the time required,so this is not a breakthrough of energy efficiency,  it's a "CPU time" breakthrough, LOL</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285250</id>
	<title>Re:Impressive but</title>
	<author>Anonymous</author>
	<datestamp>1267201140000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p><div class="quote"><p>Can it organise my porn?</p></div><p>Yes, and in less time than it takes you to... uh, organize yourself.</p><p>Penis.</p></div>
	</htmltext>
<tokenext>Can it organise my porn ? Yes , and in less time than it takes you to... uh , organize yourself.Penis .</tokentext>
<sentencetext>Can it organise my porn?Yes, and in less time than it takes you to... uh, organize yourself.Penis.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284424</id>
	<title>Awesome!</title>
	<author>daceaser</author>
	<datestamp>1267196580000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>4</modscore>
	<htmltext><p>I'll buy three!</p><p>What do they do exactly?</p></htmltext>
<tokenext>I 'll buy three ! What do they do exactly ?</tokentext>
<sentencetext>I'll buy three!What do they do exactly?</sentencetext>
</comment>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_26</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31297312
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_20</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285190
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286184
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285200
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284308
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286016
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_24</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285726
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_23</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288422
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285832
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_28</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286076
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284584
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289042
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284692
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288682
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_27</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289866
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_21</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31293456
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284804
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284672
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_15</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285234
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286986
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284424
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286574
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284406
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285430
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_25</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31328982
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_19</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285886
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_29</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284780
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284354
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_16</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288472
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285250
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31287096
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_17</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284682
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284308
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285084
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_14</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288826
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284462
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_30</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31291878
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_18</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285350
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284862
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_02_26_1343222_22</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284800
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
</commentlist>
</thread>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285566
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.14</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284876
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284330
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284462
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288826
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284692
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284584
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286076
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284354
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284780
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284378
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31287096
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31291878
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285250
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31328982
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288472
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288682
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285190
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31299320
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285372
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285832
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288422
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289866
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286016
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284862
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285350
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284426
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285886
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31289042
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285234
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285084
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284372
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285430
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285726
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284672
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284804
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31297312
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31293456
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286184
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284800
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31288646
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284308
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284682
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31285200
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284362
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284424
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286986
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_02_26_1343222.5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31284406
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_02_26_1343222.31286574
</commentlist>
</conversation>
