<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/jaeschke/programming"><title>BibSonomy bookmarks for /user/jaeschke/programming</title><link>http://www.bibsonomy.org/rss/user/jaeschke/programming</link><description>BibSonomy RSS Feed for /user/jaeschke/programming</description><items><rdf:Seq><rdf:li rdf:resource="http://jibbering.com/faq/notes/closures/"/><rdf:li rdf:resource="http://www.uchobby.com/index.php/2007/11/24/arduino-interrupts/"/><rdf:li rdf:resource="http://xor0110.wordpress.com/2010/06/04/making-the-change-with-prolog-the-bad-the-ugly-and-the-good/"/><rdf:li rdf:resource="http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html"/><rdf:li rdf:resource="http://stackoverflow.com/questions/1726632/dynamic-programming-largest-square-block"/><rdf:li rdf:resource="http://www.davidbdean.com/2006/08/17/how-to-plot-a-2d-histogram-using-matlab/"/><rdf:li rdf:resource="http://pelican.rsvs.ulaval.ca/mediawiki/index.php/Making_density_maps_using_Gnuplot"/><rdf:li rdf:resource="http://code.google.com/p/openid-selector/"/><rdf:li rdf:resource="http://thedailywtf.com/Articles/Disgruntled-Bomb-Java-Edition.aspx"/><rdf:li rdf:resource="http://www.artechra.com/media/speaking/2010/OOP2010-Top10Mistakes.pdf"/><rdf:li rdf:resource="http://www.java-forum.org/misc.php?do=linkbacks"/><rdf:li rdf:resource="http://www.kalzumeus.com/2010/09/22/security-lessons-learned-from-the-diaspora-launch/"/><rdf:li rdf:resource="http://stackoverflow.com/questions/184618/what-is-the-best-comment-in-source-code-you-have-ever-encountered/482129#482129"/><rdf:li rdf:resource="http://www.itp.uni-hannover.de/~zawischa/ITP/proPS.html#umlauk"/><rdf:li rdf:resource="http://code.google.com/p/json-simple/"/><rdf:li rdf:resource="http://www.coranac.com/documents/arctangent/"/><rdf:li rdf:resource="http://www.piclist.com/techref/microchip/atan.htm"/><rdf:li rdf:resource="http://forums.parallax.com/forums/default.aspx?f=25&amp;m=451108"/><rdf:li rdf:resource="http://www.convict.lu/Jeunes/Math/arctan.htm"/><rdf:li rdf:resource="http://www.mhaller.de/archives/29-Obfuscating-and-reducing-JavaScript-using-Trinidad-plugin.html"/></rdf:Seq></items></channel><item rdf:about="http://jibbering.com/faq/notes/closures/"><title>Javascript Closures</title><description></description><link>http://jibbering.com/faq/notes/closures/</link><dc:creator>jaeschke</dc:creator><dc:date>2012-01-31T18:29:45+01:00</dc:date><dc:subject>closures html javascript programming web </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/closures"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/html"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.uchobby.com/index.php/2007/11/24/arduino-interrupts/"><title>Arduino Interrupts | uC Hobby</title><description>Often when working on microcontroller projects you need a background function to run at regular intervals. This is often done by setting up a hardware timer to</description><link>http://www.uchobby.com/index.php/2007/11/24/arduino-interrupts/</link><dc:creator>jaeschke</dc:creator><dc:date>2011-12-01T07:14:34+01:00</dc:date><dc:subject>arduino hardware interrupt programming </dc:subject><content:encoded>Often when working on microcontroller projects you need a background function to run at regular intervals. This is often done by setting up a hardware time&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;Often when working on microcontroller projects you need a background function to run at regular intervals. This is often done by setting up a hardware timer to&lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/arduino"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hardware"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/interrupt"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://xor0110.wordpress.com/2010/06/04/making-the-change-with-prolog-the-bad-the-ugly-and-the-good/"><title>Making the change with Prolog — the bad, the ugly and the good « xor</title><description></description><link>http://xor0110.wordpress.com/2010/06/04/making-the-change-with-prolog-the-bad-the-ugly-and-the-good/</link><dc:creator>jaeschke</dc:creator><dc:date>2011-11-13T18:07:03+01:00</dc:date><dc:subject>ai problem programming prolog solving </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ai"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/problem"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prolog"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solving"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html"><title>A Neighborhood of Infinity: You Could Have Invented Monads! (And Maybe You Already Have.)</title><description></description><link>http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html</link><dc:creator>jaeschke</dc:creator><dc:date>2011-11-03T08:47:56+01:00</dc:date><dc:subject>category haskell infinity monad programming theory </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/category"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/infinity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/monad"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://stackoverflow.com/questions/1726632/dynamic-programming-largest-square-block"><title>homework - Dynamic programming - Largest square block - Stack Overflow</title><description></description><link>http://stackoverflow.com/questions/1726632/dynamic-programming-largest-square-block</link><dc:creator>jaeschke</dc:creator><dc:date>2011-10-06T09:48:31+02:00</dc:date><dc:subject>algorithm empty large programming square </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/empty"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/large"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/square"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.davidbdean.com/2006/08/17/how-to-plot-a-2d-histogram-using-matlab/"><title>How to plot a 2D histogram using matlab</title><description></description><link>http://www.davidbdean.com/2006/08/17/how-to-plot-a-2d-histogram-using-matlab/</link><dc:creator>jaeschke</dc:creator><dc:date>2011-08-11T11:54:05+02:00</dc:date><dc:subject>density histogram math matlab plot programming </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/density"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/histogram"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/matlab"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/plot"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://pelican.rsvs.ulaval.ca/mediawiki/index.php/Making_density_maps_using_Gnuplot"><title>Making density maps using Gnuplot</title><description>To make a density map from a 2D set of data, the first step is to compute values for the third dimension. (Gnuplot has no facilities for computing these values automatically.) The simplest way is to make a 2D histogram; the plot is divided in small 2D regions, and the z-values are proportional to the number of points inside these regions. The following Python script will make an histogram from a time series of two dihedral angles. </description><link>http://pelican.rsvs.ulaval.ca/mediawiki/index.php/Making_density_maps_using_Gnuplot</link><dc:creator>jaeschke</dc:creator><dc:date>2011-08-11T11:22:47+02:00</dc:date><dc:subject>density gnuplot histogram math plot programming </dc:subject><content:encoded>To make a density map from a 2D set of data, the first step is to compute values for the third dimension. (Gnuplot has no facilities for computing these va&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;To make a density map from a 2D set of data, the first step is to compute values for the third dimension. (Gnuplot has no facilities for computing these values automatically.) The simplest way is to make a 2D histogram; the plot is divided in small 2D regions, and the z-values are proportional to the number of points inside these regions. The following Python script will make an histogram from a time series of two dihedral angles. &lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/density"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gnuplot"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/histogram"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/plot"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://code.google.com/p/openid-selector/"><title>openid-selector - A user-friendly way to select an OpenID - Google Project Hosting</title><description></description><link>http://code.google.com/p/openid-selector/</link><dc:creator>jaeschke</dc:creator><dc:date>2011-07-15T16:29:21+02:00</dc:date><dc:subject>html javascript library openid programming web </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/html"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/library"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/openid"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item><item rdf:about="http://thedailywtf.com/Articles/Disgruntled-Bomb-Java-Edition.aspx"><title>Disgruntled Bomb: Java Edition - The Daily WTF</title><description></description><link>http://thedailywtf.com/Articles/Disgruntled-Bomb-Java-Edition.aspx</link><dc:creator>jaeschke</dc:creator><dc:date>2011-05-25T08:42:02+02:00</dc:date><dc:subject>fun java programming </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fun"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.artechra.com/media/speaking/2010/OOP2010-Top10Mistakes.pdf"><title>Top 10 Architecture Mistakes</title><description></description><link>http://www.artechra.com/media/speaking/2010/OOP2010-Top10Mistakes.pdf</link><dc:creator>jaeschke</dc:creator><dc:date>2011-05-09T12:11:24+02:00</dc:date><dc:subject>architecture mistake programming software </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/architecture"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mistake"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.java-forum.org/misc.php?do=linkbacks"><title>java-forum.org - LinkBacks</title><description></description><link>http://www.java-forum.org/misc.php?do=linkbacks</link><dc:creator>jaeschke</dc:creator><dc:date>2010-11-20T19:11:25+01:00</dc:date><dc:subject>pingback programming refback trackback web </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pingback"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/refback"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/trackback"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.kalzumeus.com/2010/09/22/security-lessons-learned-from-the-diaspora-launch/"><title>Security Lessons Learned From The Diaspora Launch: MicroISV on a Shoestring</title><description>Last week, Diaspora — the OSS privacy-respecting social network — released a “pre-alpha developer preview” of their source code.  I took a look out it, mostly out of curiosity, and was struck by numerous severe security errors.  I then spent the next day digging through their code locally and trying to get in touch with the team to address them, privately.  In the course of this, I mentioned obliquely that the errors existed on Hacker News, and subsequently was interviewed by The Register and got quoted in a couple of hundred places.</description><link>http://www.kalzumeus.com/2010/09/22/security-lessons-learned-from-the-diaspora-launch/</link><dc:creator>jaeschke</dc:creator><dc:date>2010-09-24T08:41:53+02:00</dc:date><dc:subject>programming ruby security toread </dc:subject><content:encoded>Last week, Diaspora — the OSS privacy-respecting social network — released a “pre-alpha developer preview” of their source code.  I took a look out it, mos&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;Last week, Diaspora — the OSS privacy-respecting social network — released a “pre-alpha developer preview” of their source code.  I took a look out it, mostly out of curiosity, and was struck by numerous severe security errors.  I then spent the next day digging through their code locally and trying to get in touch with the team to address them, privately.  In the course of this, I mentioned obliquely that the errors existed on Hacker News, and subsequently was interviewed by The Register and got quoted in a couple of hundred places.&lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ruby"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/></rdf:Bag></taxo:topics></item><item rdf:about="http://stackoverflow.com/questions/184618/what-is-the-best-comment-in-source-code-you-have-ever-encountered/482129#482129"><title>What is the best comment in source code you have ever encountered? - Stack Overflow</title><description></description><link>http://stackoverflow.com/questions/184618/what-is-the-best-comment-in-source-code-you-have-ever-encountered/482129#482129</link><dc:creator>jaeschke</dc:creator><dc:date>2010-09-16T19:46:27+02:00</dc:date><dc:subject>code comment development fun funny joke programming source toread </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/comment"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/development"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fun"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/funny"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/joke"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/source"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.itp.uni-hannover.de/~zawischa/ITP/proPS.html#umlauk"><title>In PostScript programmieren!</title><description>Elementare Einführung in PostScript als Programmiersprache, Demonstrationsbeispiele aus dem Bereich der Farbenlehre u.a.</description><link>http://www.itp.uni-hannover.de/~zawischa/ITP/proPS.html#umlauk</link><dc:creator>jaeschke</dc:creator><dc:date>2010-07-24T21:03:52+02:00</dc:date><dc:subject>graphics postscript programming </dc:subject><content:encoded>Elementare Einführung in PostScript als Programmiersprache, Demonstrationsbeispiele aus dem Bereich der Farbenlehre u.a.</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/postscript"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://code.google.com/p/json-simple/"><title>json-simple - Project Hosting on Google Code</title><description>JSON.simple is a simple Java toolkit for JSON. You can use JSON.simple to encode or decode JSON text. </description><link>http://code.google.com/p/json-simple/</link><dc:creator>jaeschke</dc:creator><dc:date>2010-07-20T11:28:26+02:00</dc:date><dc:subject>java javascript json programming simple web </dc:subject><content:encoded>JSON.simple is a simple Java toolkit for JSON. You can use JSON.simple to encode or decode JSON text.</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/json"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/simple"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.coranac.com/documents/arctangent/"><title>Coranac » Off on a tangent : a look at arctangent implementations</title><description>Or: everything you never wanted to know about arctangent implementations and weren&amp;#039;t afraid to not ask. </description><link>http://www.coranac.com/documents/arctangent/</link><dc:creator>jaeschke</dc:creator><dc:date>2010-06-25T14:34:25+02:00</dc:date><dc:subject>arctan atan integer programming trigonometry </dc:subject><content:encoded>Or: everything you never wanted to know about arctangent implementations and weren&amp;#039;t afraid to not ask.</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/arctan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/atan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/integer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/trigonometry"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.piclist.com/techref/microchip/atan.htm"><title>arctangent for the PIC</title><description>This routine will take an 8 bit integer that corresponds to the numerator of a fraction whose denominator is 256 and find its arctangent. So the input ranges from 0 to 255 which corresponds to 0 to 255/256 = 0.996 . The output for an arctangent routine that returns a floating point number would be from 0 (atan(0)) to 0.783 (atan(255/256)) radians; or if you prefer, 0 to 44.89 degrees. However, this routine scales the output so that pi/4 radians (or 45 degrees) corresponds to 256. So for the input range of 0 to 255 you get an output of 0 to 255 ( atan(255/256) * 256 / (pi/4) is about 255). It&amp;#039;s probably a little more interesting to see an intermediate data point or two: </description><link>http://www.piclist.com/techref/microchip/atan.htm</link><dc:creator>jaeschke</dc:creator><dc:date>2010-06-25T14:30:42+02:00</dc:date><dc:subject>arctan atan integer pic programming trigonometry </dc:subject><content:encoded>This routine will take an 8 bit integer that corresponds to the numerator of a fraction whose denominator is 256 and find its arctangent. So the input rang&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;This routine will take an 8 bit integer that corresponds to the numerator of a fraction whose denominator is 256 and find its arctangent. So the input ranges from 0 to 255 which corresponds to 0 to 255/256 = 0.996 . The output for an arctangent routine that returns a floating point number would be from 0 (atan(0)) to 0.783 (atan(255/256)) radians; or if you prefer, 0 to 44.89 degrees. However, this routine scales the output so that pi/4 radians (or 45 degrees) corresponds to 256. So for the input range of 0 to 255 you get an output of 0 to 255 ( atan(255/256) * 256 / (pi/4) is about 255). It&amp;#039;s probably a little more interesting to see an intermediate data point or two: &lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/arctan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/atan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/integer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/trigonometry"/></rdf:Bag></taxo:topics></item><item rdf:about="http://forums.parallax.com/forums/default.aspx?f=25&amp;m=451108"><title>Quick and dirty four-quadrant integer-only arctangent in Spin :: Parallax Forums</title><description>I needed a quick arctangent function using integer arithmetic, so I could convert (Δx, Δy) target locations to turn angles.</description><link>http://forums.parallax.com/forums/default.aspx?f=25&amp;amp;m=451108</link><dc:creator>jaeschke</dc:creator><dc:date>2010-06-25T14:25:03+02:00</dc:date><dc:subject>arctan atan integer programming trigonometry </dc:subject><content:encoded>I needed a quick arctangent function using integer arithmetic, so I could convert (Δx, Δy) target locations to turn angles.</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/arctan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/atan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/integer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/trigonometry"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.convict.lu/Jeunes/Math/arctan.htm"><title>Arctan(x)</title><description>by polynomial approximation</description><link>http://www.convict.lu/Jeunes/Math/arctan.htm</link><dc:creator>jaeschke</dc:creator><dc:date>2010-06-25T14:24:22+02:00</dc:date><dc:subject>arctan atan integer programming trigonometry </dc:subject><content:encoded>by polynomial approximation</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/arctan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/atan"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/integer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/trigonometry"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.mhaller.de/archives/29-Obfuscating-and-reducing-JavaScript-using-Trinidad-plugin.html"><title>Obfuscating and reducing JavaScript using Trinidad plugin - Mike`s Blog</title><description></description><link>http://www.mhaller.de/archives/29-Obfuscating-and-reducing-JavaScript-using-Trinidad-plugin.html</link><dc:creator>jaeschke</dc:creator><dc:date>2010-05-28T18:06:26+02:00</dc:date><dc:subject>javascript maven plugin programming web </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/maven"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/plugin"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item></rdf:RDF>
