<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Patent Absurdity &#8211; or Bilski, the movie</title>
	<atom:link href="http://news.swpat.org/2010/04/patent-absurdity/feed/" rel="self" type="application/rss+xml" />
	<link>http://news.swpat.org/2010/04/patent-absurdity/</link>
	<description></description>
	<lastBuildDate>Sat, 24 Jul 2010 16:07:43 +0100</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Johnathan lanke</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1526</link>
		<dc:creator>Johnathan lanke</dc:creator>
		<pubDate>Mon, 10 May 2010 05:02:36 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1526</guid>
		<description>According to this [http://patentabsurdity.com/about.html] page, these software packages were used:
    *  Cinelerra for video editing
    * Audacity for audio editing
    * Inkscape, Python and Blender for animation
    * Ogg Theora and Ogg Vorbis codecs
    * Edited on GNU/Linux machines</description>
		<content:encoded><![CDATA[<p>According to this [http://patentabsurdity.com/about.html] page, these software packages were used:<br />
    *  Cinelerra for video editing<br />
    * Audacity for audio editing<br />
    * Inkscape, Python and Blender for animation<br />
    * Ogg Theora and Ogg Vorbis codecs<br />
    * Edited on GNU/Linux machines</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Yusei TAHARA</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1452</link>
		<dc:creator>Yusei TAHARA</dc:creator>
		<pubDate>Sun, 09 May 2010 16:49:20 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1452</guid>
		<description>And, could you write about this plan(FSF will be organising the making of videos with embedded subtitles) to the subtitles wiki page below as official message?  FSF told me that their translation team will check accuracy of the translation together. Then others will not become confused like me.

http://en.swpat.org/wiki/Patently_Absurd/Subtitles</description>
		<content:encoded><![CDATA[<p>And, could you write about this plan(FSF will be organising the making of videos with embedded subtitles) to the subtitles wiki page below as official message?  FSF told me that their translation team will check accuracy of the translation together. Then others will not become confused like me.</p>
<p><a href="http://en.swpat.org/wiki/Patently_Absurd/Subtitles" rel="nofollow">http://en.swpat.org/wiki/Patently_Absurd/Subtitles</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Yusei TAHARA</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1451</link>
		<dc:creator>Yusei TAHARA</dc:creator>
		<pubDate>Sun, 09 May 2010 16:35:30 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1451</guid>
		<description>Thank you for your answer. Your understanding is right. I asked to FSF and got the same answer. 
My intention was to show people the film with embedded subtitles, so the current license is OK now.</description>
		<content:encoded><![CDATA[<p>Thank you for your answer. Your understanding is right. I asked to FSF and got the same answer.<br />
My intention was to show people the film with embedded subtitles, so the current license is OK now.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ciaran</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1262</link>
		<dc:creator>Ciaran</dc:creator>
		<pubDate>Sat, 08 May 2010 07:00:43 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1262</guid>
		<description>My understanding is that FSF will be organising the making of videos with embedded subtitles.

Changing the licence might not be possible (whether it’s really desirable is another question). The contributors consented to be in this film. They didn’t consent to being in “this film plus any film based on this film”.</description>
		<content:encoded><![CDATA[<p>My understanding is that FSF will be organising the making of videos with embedded subtitles.</p>
<p>Changing the licence might not be possible (whether it’s really desirable is another question). The contributors consented to be in this film. They didn’t consent to being in “this film plus any film based on this film”.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Yusei TAHARA</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1168</link>
		<dc:creator>Yusei TAHARA</dc:creator>
		<pubDate>Fri, 07 May 2010 16:09:45 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1168</guid>
		<description>Thank you for great film! I love it.

About subtitles, as other people mentioned, please consider changing the license to CC BY-SA (to ALLOW DERIVATIVE WORKS) or consider adding an exception to embed subtitles.

Frankly to say, using &quot;.srt&quot; file with supported video player is very difficult for many people. This licence restriction prevents us to popularize this movie. Embedded subtitles is really important.</description>
		<content:encoded><![CDATA[<p>Thank you for great film! I love it.</p>
<p>About subtitles, as other people mentioned, please consider changing the license to CC BY-SA (to ALLOW DERIVATIVE WORKS) or consider adding an exception to embed subtitles.</p>
<p>Frankly to say, using &#8220;.srt&#8221; file with supported video player is very difficult for many people. This licence restriction prevents us to popularize this movie. Embedded subtitles is really important.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ciaran</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1122</link>
		<dc:creator>Ciaran</dc:creator>
		<pubDate>Fri, 07 May 2010 07:14:03 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1122</guid>
		<description>(It was spam; explained above)</description>
		<content:encoded><![CDATA[<p>(It was spam; explained above)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jonathan</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-1100</link>
		<dc:creator>jonathan</dc:creator>
		<pubDate>Fri, 07 May 2010 01:46:55 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-1100</guid>
		<description>hi.

Good work!

The Encoding of the HD version is still quite bad. Overquotes sometimes appear and disappear immediately, leaving the rest of the video just &quot;hanging&quot; for a few seconds before it continues: 

In the HD version: Timebase errors on VLC Mac OS X at: 57s and jumps to 1:01s. There are similar issues elsewhere in the film.

Please fix. I would like to show others the HD version. For the time being, I&#039;ll stick with &quot;High Quality.&quot;</description>
		<content:encoded><![CDATA[<p>hi.</p>
<p>Good work!</p>
<p>The Encoding of the HD version is still quite bad. Overquotes sometimes appear and disappear immediately, leaving the rest of the video just &#8220;hanging&#8221; for a few seconds before it continues: </p>
<p>In the HD version: Timebase errors on VLC Mac OS X at: 57s and jumps to 1:01s. There are similar issues elsewhere in the film.</p>
<p>Please fix. I would like to show others the HD version. For the time being, I&#8217;ll stick with &#8220;High Quality.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: les</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-981</link>
		<dc:creator>les</dc:creator>
		<pubDate>Wed, 05 May 2010 18:16:30 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-981</guid>
		<description>Here&#039;s a claim to software that uses linked lists from &#039;74/&#039;76

1. A display refresh method comprising the steps of:

    encoding data representing figures to be displayed as data characters;
    encoding data representing enhancement features and execution path instructions as control characters;
    combining the data and control characters to form linked list data blocks; and
    interpreting the linked list data blocks to form displayable lines.

http://www.google.com/patents/about?id=0OkAAAAAEBAJ&amp;dq=%22linked+list%22&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=0&amp;as_miny_is=1700&amp;as_maxm_is=0&amp;as_maxy_is=1980&amp;num=30</description>
		<content:encoded><![CDATA[<p>Here&#8217;s a claim to software that uses linked lists from &#8216;74/&#8217;76</p>
<p>1. A display refresh method comprising the steps of:</p>
<p>    encoding data representing figures to be displayed as data characters;<br />
    encoding data representing enhancement features and execution path instructions as control characters;<br />
    combining the data and control characters to form linked list data blocks; and<br />
    interpreting the linked list data blocks to form displayable lines.</p>
<p><a href="http://www.google.com/patents/about?id=0OkAAAAAEBAJ&amp;dq=%22linked+list%22&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=0&amp;as_miny_is=1700&amp;as_maxm_is=0&amp;as_maxy_is=1980&amp;num=30" rel="nofollow">http://www.google.com/patents/about?id=0OkAAAAAEBAJ&amp;dq=%22linked+list%22&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=0&amp;as_miny_is=1700&amp;as_maxm_is=0&amp;as_maxy_is=1980&amp;num=30</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: les</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-868</link>
		<dc:creator>les</dc:creator>
		<pubDate>Tue, 04 May 2010 15:55:13 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-868</guid>
		<description>Here&#039;s claim 1 from a patent to FFT:

1. The machine method of generating a sequence of signals which represent Fourier series coefficients of an input sequence of N real-valued signals comprising the steps of:

1. storing said input sequence of signals in a machine memory,

2. generating an ordered set of complex-valued signals,

3. selectively combining in a machine and according to a constant relation said stored signals and said complex-valued signals, thereby to form a new sequence of complex-valued signals none of which bears a necessary conjugate relation to another,

4. storing said new sequence of signals in said machine memory in place of said sequence of signals previously stored in said machine memory, and

5. iteratively performing steps (3) and (4) with the sequence generated by the immediately preceding iteration and said ordered set of signals entering as operands. 

That issued in &#039;71 from an application filed in &#039;68.

http://www.google.com/patents/about?id=hg9uAAAAEBAJ&amp;dq=method+of+fast+Fourier+transform&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980


And Claim 5 from another FFT related Patent from &#039;74/&#039; 77


5. A method of computing the discrete Fourier transform of a waveform comprising the steps of:

    receiving a series of digital data representative of said waveform;
    storing sequentially said series of digital data representative of said waveform;
    subtracting the oldest stored data from the newest stored data to obtain a difference each time a data is received;
    generating a series of predetermined constants;
    providing an output shift storage means;
    adding sequentially each of the data stored in said output shift storage means to said difference to produce a series of addition signals;
    multiplying each addition signal by a predetermined constant from said series of predetermined constants to obtain a series of products;
    sequentially storing said series of products in said output shift storage means;
    whereby said output shift storage means contains a series of Fourier coefficients.

http://www.google.com/patents/about?id=2ao6AAAAEBAJ&amp;dq=method+of+fast+Fourier+transform&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980</description>
		<content:encoded><![CDATA[<p>Here&#8217;s claim 1 from a patent to FFT:</p>
<p>1. The machine method of generating a sequence of signals which represent Fourier series coefficients of an input sequence of N real-valued signals comprising the steps of:</p>
<p>1. storing said input sequence of signals in a machine memory,</p>
<p>2. generating an ordered set of complex-valued signals,</p>
<p>3. selectively combining in a machine and according to a constant relation said stored signals and said complex-valued signals, thereby to form a new sequence of complex-valued signals none of which bears a necessary conjugate relation to another,</p>
<p>4. storing said new sequence of signals in said machine memory in place of said sequence of signals previously stored in said machine memory, and</p>
<p>5. iteratively performing steps (3) and (4) with the sequence generated by the immediately preceding iteration and said ordered set of signals entering as operands. </p>
<p>That issued in &#8216;71 from an application filed in &#8216;68.</p>
<p><a href="http://www.google.com/patents/about?id=hg9uAAAAEBAJ&amp;dq=method+of+fast+Fourier+transform&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980" rel="nofollow">http://www.google.com/patents/about?id=hg9uAAAAEBAJ&amp;dq=method+of+fast+Fourier+transform&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980</a></p>
<p>And Claim 5 from another FFT related Patent from &#8216;74/&#8217; 77</p>
<p>5. A method of computing the discrete Fourier transform of a waveform comprising the steps of:</p>
<p>    receiving a series of digital data representative of said waveform;<br />
    storing sequentially said series of digital data representative of said waveform;<br />
    subtracting the oldest stored data from the newest stored data to obtain a difference each time a data is received;<br />
    generating a series of predetermined constants;<br />
    providing an output shift storage means;<br />
    adding sequentially each of the data stored in said output shift storage means to said difference to produce a series of addition signals;<br />
    multiplying each addition signal by a predetermined constant from said series of predetermined constants to obtain a series of products;<br />
    sequentially storing said series of products in said output shift storage means;<br />
    whereby said output shift storage means contains a series of Fourier coefficients.</p>
<p><a href="http://www.google.com/patents/about?id=2ao6AAAAEBAJ&amp;dq=method+of+fast+Fourier+transform&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980" rel="nofollow">http://www.google.com/patents/about?id=2ao6AAAAEBAJ&amp;dq=method+of+fast+Fourier+transform&amp;as_drrb_ap=q&amp;as_minm_ap=0&amp;as_miny_ap=&amp;as_maxm_ap=0&amp;as_maxy_ap=&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: les</title>
		<link>http://news.swpat.org/2010/04/patent-absurdity/#comment-867</link>
		<dc:creator>les</dc:creator>
		<pubDate>Tue, 04 May 2010 15:40:55 +0000</pubDate>
		<guid isPermaLink="false">http://news.swpat.org/?p=350#comment-867</guid>
		<description>Hi Ben -

I wasted 2 minutes on your behalf and searched for patents prior to 1980 related to sorting data.  Here&#039;s clam 34 from the first I looked at:

34. A computer method for sorting a plurality of record units each having a keyfield, in accordance with the code value of said keyfields, wherein each of said keyfields includes a plurality of keyfield bits arranged in a predetermined keyfield bit order, comprising, in combination, the steps of:

generating a plurality of record unit address signals each accessing a corresponding one of said record units, to form a first address sequence;

processing said first address sequence signals to form a first and second address sub-sequence comprising, respectively, all addresses accessing record units whose first keyfield bit in said predetermined keyfield bit order is &quot;0&quot; and &quot;1&quot;;

combining said first and second address sub-sequences into a second address sequence wherein the members of said first address subsequence precede the members of said second address subsequence;

repeating said steps of processing and combining under control of all remaining keyfield bits to provide a final record unit address sequence; and

selectively transferring said record units from a first to a second storage in a single pass in an access sequence controlled by said final address sequence, whereby said record units are stored in said second storage in an ordered sequence according to their relative keyfield values. 


Here&#039;s a link to the whole patent:

http://www.google.com/patents/about?id=EIc2AAAAEBAJ&amp;dq=method+of+sorting+data&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980

It issued in 1973, from an application that was filed in &#039;71.

I hope Professor Knuth doesn&#039;t have to return his Turing Award.

I understand your point of view.  If I haven&#039;t responded to earlier arguments that software is special, its because I find the position to be too silly to respond to.  You are making a distinction without a difference.  The computer mouse and the airplane were there to be found just as any algorithm is....Just as David was in the marble before Mikey chipped away the bits that weren&#039;t David. 

Besides the patent laws allow for the patenting of discoveries...:

35 USC 101:

Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.</description>
		<content:encoded><![CDATA[<p>Hi Ben -</p>
<p>I wasted 2 minutes on your behalf and searched for patents prior to 1980 related to sorting data.  Here&#8217;s clam 34 from the first I looked at:</p>
<p>34. A computer method for sorting a plurality of record units each having a keyfield, in accordance with the code value of said keyfields, wherein each of said keyfields includes a plurality of keyfield bits arranged in a predetermined keyfield bit order, comprising, in combination, the steps of:</p>
<p>generating a plurality of record unit address signals each accessing a corresponding one of said record units, to form a first address sequence;</p>
<p>processing said first address sequence signals to form a first and second address sub-sequence comprising, respectively, all addresses accessing record units whose first keyfield bit in said predetermined keyfield bit order is &#8220;0&#8243; and &#8220;1&#8243;;</p>
<p>combining said first and second address sub-sequences into a second address sequence wherein the members of said first address subsequence precede the members of said second address subsequence;</p>
<p>repeating said steps of processing and combining under control of all remaining keyfield bits to provide a final record unit address sequence; and</p>
<p>selectively transferring said record units from a first to a second storage in a single pass in an access sequence controlled by said final address sequence, whereby said record units are stored in said second storage in an ordered sequence according to their relative keyfield values. </p>
<p>Here&#8217;s a link to the whole patent:</p>
<p><a href="http://www.google.com/patents/about?id=EIc2AAAAEBAJ&amp;dq=method+of+sorting+data&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980" rel="nofollow">http://www.google.com/patents/about?id=EIc2AAAAEBAJ&amp;dq=method+of+sorting+data&amp;as_drrb_is=b&amp;as_minm_is=1&amp;as_miny_is=1700&amp;as_maxm_is=1&amp;as_maxy_is=1980</a></p>
<p>It issued in 1973, from an application that was filed in &#8216;71.</p>
<p>I hope Professor Knuth doesn&#8217;t have to return his Turing Award.</p>
<p>I understand your point of view.  If I haven&#8217;t responded to earlier arguments that software is special, its because I find the position to be too silly to respond to.  You are making a distinction without a difference.  The computer mouse and the airplane were there to be found just as any algorithm is&#8230;.Just as David was in the marble before Mikey chipped away the bits that weren&#8217;t David. </p>
<p>Besides the patent laws allow for the patenting of discoveries&#8230;:</p>
<p>35 USC 101:</p>
<p>Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

