<?xml version="1.0" encoding="UTF-8"?>
<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="https://www.bibsonomy.org/user/jganong/programming"><title>BibSonomy bookmarks for /user/jganong/programming</title><link>https://www.bibsonomy.org/user/jganong/programming</link><description>BibSonomy RSS Feed for /user/jganong/programming</description><items><rdf:Seq><rdf:li rdf:resource="http://www-cs-students.stanford.edu/~amitp/gameprog.html"/><rdf:li rdf:resource="http://www.cse.iitb.ac.in/~kart/Quotes%20-%20Dev.html"/><rdf:li rdf:resource="http://www.fortran-2000.com/ArnaudRecipes/CompilerTricks.html#NumAppDiff"/><rdf:li rdf:resource="http://www.levien.com/type/myfonts/inconsolata.html"/><rdf:li rdf:resource="http://paulgraham.com/head.html"/><rdf:li rdf:resource="http://blog.assembleron.com/2007/07/11/what-motivates-programmers/"/><rdf:li rdf:resource="http://lecturefox.com/computerscience/"/><rdf:li rdf:resource="http://worrydream.com/MagicInk/"/><rdf:li rdf:resource="http://www.proggyfonts.com/index.php?menu=about"/><rdf:li rdf:resource="http://www.sysprog.net/quotlang.html"/><rdf:li rdf:resource="http://www.reciprocality.org/Reciprocality/r0/"/><rdf:li rdf:resource="http://www.binarycreativity.com/2006/08/11/things-you-need-to-know-before-interviewing-for-a-game-programming-position/"/><rdf:li rdf:resource="http://www.nist.gov/dads/"/></rdf:Seq></items></channel><item rdf:about="http://www-cs-students.stanford.edu/~amitp/gameprog.html"><title>Amit’s Game Programming Information</title><description></description><link>http://www-cs-students.stanford.edu/~amitp/gameprog.html</link><dc:creator>jganong</dc:creator><dc:date>2007-12-04T19:23:54+01:00</dc:date><dc:subject>game programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-12-04T19:23:54+01:00&#034; href=&#034;http://www-cs-students.stanford.edu/~amitp/gameprog.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www-cs-students.stanford.edu/~amitp/gameprog.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/game"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cse.iitb.ac.in/~kart/Quotes%20-%20Dev.html"><title>Programming Quotes</title><description></description><link>http://www.cse.iitb.ac.in/~kart/Quotes%20-%20Dev.html</link><dc:creator>jganong</dc:creator><dc:date>2007-12-04T18:50:42+01:00</dc:date><dc:subject>funny programming proverbs quotes simplicity </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-12-04T18:50:42+01:00&#034; href=&#034;http://www.cse.iitb.ac.in/~kart/Quotes%20-%20Dev.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cse.iitb.ac.in/~kart/Quotes%20-%20Dev.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/funny"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proverbs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/quotes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/simplicity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.fortran-2000.com/ArnaudRecipes/CompilerTricks.html#NumAppDiff"><title>Compiler and tools tricks</title><description></description><link>http://www.fortran-2000.com/ArnaudRecipes/CompilerTricks.html#NumAppDiff</link><dc:creator>jganong</dc:creator><dc:date>2007-10-23T18:25:04+02:00</dc:date><dc:subject>programming tools </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-10-23T18:25:04+02:00&#034; href=&#034;http://www.fortran-2000.com/ArnaudRecipes/CompilerTricks.html#NumAppDiff&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.fortran-2000.com/ArnaudRecipes/CompilerTricks.html#NumAppDiff&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.levien.com/type/myfonts/inconsolata.html"><title>Inconsolata</title><description></description><link>http://www.levien.com/type/myfonts/inconsolata.html</link><dc:creator>jganong</dc:creator><dc:date>2007-10-02T16:35:24+02:00</dc:date><dc:subject>font micro-serifs monospace programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-10-02T16:35:24+02:00&#034; href=&#034;http://www.levien.com/type/myfonts/inconsolata.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.levien.com/type/myfonts/inconsolata.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/font"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/micro-serifs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monospace"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://paulgraham.com/head.html"><title>Holding a Program in One&#039;s Head</title><description></description><link>http://paulgraham.com/head.html</link><dc:creator>jganong</dc:creator><dc:date>2007-08-23T19:58:56+02:00</dc:date><dc:subject>concentration programming simplicity work </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-08-23T19:58:56+02:00&#034; href=&#034;http://paulgraham.com/head.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://paulgraham.com/head.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concentration"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/simplicity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/work"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blog.assembleron.com/2007/07/11/what-motivates-programmers/"><title>The Programming and Management Blog » What motivates programmers?</title><description></description><link>http://blog.assembleron.com/2007/07/11/what-motivates-programmers/</link><dc:creator>jganong</dc:creator><dc:date>2007-07-20T19:32:17+02:00</dc:date><dc:subject>lego meetings programming solving </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-07-20T19:32:17+02:00&#034; href=&#034;http://blog.assembleron.com/2007/07/11/what-motivates-programmers/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://blog.assembleron.com/2007/07/11/what-motivates-programmers/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lego"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/meetings"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/solving"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lecturefox.com/computerscience/"><title>university lectures computer science</title><description>sicp, blender, python, java, etc!</description><link>http://lecturefox.com/computerscience/</link><dc:creator>jganong</dc:creator><dc:date>2007-04-25T17:44:20+02:00</dc:date><dc:subject>lectures online programming </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;sicp, blender, python, java, etc!&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lectures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/online"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://worrydream.com/MagicInk/"><title>Magic Ink: Information Software and the Graphical Interface</title><description>interactivity is actually a curse for users and a crutch for designers</description><link>http://worrydream.com/MagicInk/</link><dc:creator>jganong</dc:creator><dc:date>2007-04-04T16:11:15+02:00</dc:date><dc:subject>essays interface programming toread </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;interactivity is actually a curse for users and a crutch for designers&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/essays"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/interface"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/toread"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.proggyfonts.com/index.php?menu=about"><title>Proggy Programming Fonts</title><description>home of the Proggy programmer&#039;s fonts (Proggy Clean, Proggy Square, Proggy Small, and Proggy Tiny)</description><link>http://www.proggyfonts.com/index.php?menu=about</link><dc:creator>jganong</dc:creator><dc:date>2007-02-27T23:37:50+01:00</dc:date><dc:subject>font programming </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;home of the Proggy programmer&amp;#039;s fonts (Proggy Clean, Proggy Square, Proggy Small, and Proggy Tiny)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/font"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.sysprog.net/quotlang.html"><title>Quotes about Computer Languages</title><description>It should be noted that no ethically-trained software engineer would ever consent to write a DestroyBaghdad procedure. Basic professional ethics would instead require him to write a DestroyCity procedure, to which Baghdad could be given as a parameter. (N</description><link>http://www.sysprog.net/quotlang.html</link><dc:creator>jganong</dc:creator><dc:date>2007-02-21T22:40:05+01:00</dc:date><dc:subject>fun humour programming </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;It should be noted that no ethically-trained software engineer would ever consent to write a DestroyBaghdad procedure. Basic professional ethics would instead require him to write a DestroyCity procedure, to which Baghdad could be given as a parameter. (N&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fun"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/humour"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.reciprocality.org/Reciprocality/r0/"><title>The Programmers Stone</title><description>recapture, explore and celebrate the Art of Computer Programming.</description><link>http://www.reciprocality.org/Reciprocality/r0/</link><dc:creator>jganong</dc:creator><dc:date>2007-02-12T16:51:19+01:00</dc:date><dc:subject>philosophy programming </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;recapture, explore and celebrate the Art of Computer Programming.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.binarycreativity.com/2006/08/11/things-you-need-to-know-before-interviewing-for-a-game-programming-position/"><title>Binary Creativity - Things You Need to Know before Interviewing for a Game Programming Position</title><description>ou do need to have very good linear algebra skills. If you don’t know what the formula for a dot product is (a dot b = a.x * b.x + a.y * b.y + a.z * b.z ) and what it means geometrically (|a| * |b| * cosine of the angle between a and b), then there’s</description><link>http://www.binarycreativity.com/2006/08/11/things-you-need-to-know-before-interviewing-for-a-game-programming-position/</link><dc:creator>jganong</dc:creator><dc:date>2007-01-25T19:51:22+01:00</dc:date><dc:subject>games jobs programming </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;ou do need to have very good linear algebra skills. If you don’t know what the formula for a dot product is (a dot b = a.x * b.x + a.y * b.y + a.z * b.z ) and what it means geometrically (|a| * |b| * cosine of the angle between a and b), then there’s&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/games"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/jobs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.nist.gov/dads/"><title>Dictionary of Algorithms and Data Structures</title><description></description><link>http://www.nist.gov/dads/</link><dc:creator>jganong</dc:creator><dc:date>2006-08-23T20:00:36+02:00</dc:date><dc:subject>algorithms free programming reference </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-08-23T20:00:36+02:00&#034; href=&#034;http://www.nist.gov/dads/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.nist.gov/dads/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/free"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reference"/></rdf:Bag></taxo:topics></item></rdf:RDF>