<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>dimitris kalamaras &#187; coding</title>
	<atom:link href="http://dimitris.apeiro.gr/tag/coding/feed/" rel="self" type="application/rss+xml" />
	<link>http://dimitris.apeiro.gr</link>
	<description>mathematics, social network analysis,  free software...</description>
	<lastBuildDate>Fri, 26 Aug 2011 21:30:31 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>Create complex visual elements with Processing language</title>
		<link>http://dimitris.apeiro.gr/2009/07/30/create-complex-visual-elements-with-processing-language/</link>
		<comments>http://dimitris.apeiro.gr/2009/07/30/create-complex-visual-elements-with-processing-language/#comments</comments>
		<pubDate>Thu, 30 Jul 2009 11:06:50 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[Education]]></category>
		<category><![CDATA[Open Source]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[coding]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[openSUSE]]></category>
		<category><![CDATA[Processing]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=332</guid>
		<description><![CDATA[I was having a kind of &#8230;insomnia attack last Friday night, so I decided to search the openSUSE repositories for interesting applications. I was using openSUSE (11.1) at the moment, with lots of additional repos [1] from the excellent Build Service, so there were a lot of things there to explore. One thing led to [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2009/07/30/create-complex-visual-elements-with-processing-language/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>LIFO (2001)</title>
		<link>http://dimitris.apeiro.gr/2008/08/05/lifo/</link>
		<comments>http://dimitris.apeiro.gr/2008/08/05/lifo/#comments</comments>
		<pubDate>Mon, 04 Aug 2008 21:02:05 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[coding]]></category>
		<category><![CDATA[LIFO]]></category>
		<category><![CDATA[project]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=159</guid>
		<description><![CDATA[The goal of this project was to create a class (named lifo) of Last-In-First-Out Lists (Stacks) of integers with variable length. The class actually defines a new Data Type, named lifo. Each variable of this type will be a LIFO List. Of course, the class must have defined some operations (member-functions) for handling the lists, [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2008/08/05/lifo/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Horner Value Finder</title>
		<link>http://dimitris.apeiro.gr/2008/08/04/horner-value-finder/</link>
		<comments>http://dimitris.apeiro.gr/2008/08/04/horner-value-finder/#comments</comments>
		<pubDate>Mon, 04 Aug 2008 12:51:10 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[coding]]></category>
		<category><![CDATA[Fortran]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=154</guid>
		<description><![CDATA[This Pascal program finds the value of a Nth order polynomial: implementing Horner method without using any complex arithmetic in Fortran 77. Obviously, it can find complex values, for complex x&#8217;s, but without complex arithmetic. The program also uses ANSI codes to clear screen. PROGRAM HORNER1 REAL A&#40;0:30&#41;,B&#40;0:30&#41;,K,L,IM,R,AT,BT,PR,PIM INTEGER N,I CHARACTER ESC &#160; ESC=CHAR&#40;27&#41; &#160; [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2008/08/04/horner-value-finder/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Root-o-matic</title>
		<link>http://dimitris.apeiro.gr/2008/08/04/root-o-matic/</link>
		<comments>http://dimitris.apeiro.gr/2008/08/04/root-o-matic/#comments</comments>
		<pubDate>Mon, 04 Aug 2008 10:39:49 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[coding]]></category>
		<category><![CDATA[Fortran]]></category>
		<category><![CDATA[root]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=151</guid>
		<description><![CDATA[This little Fortran program, originally written in DOS, uses the arithmetic sequence to find the root of A. All you have to do is to enter A and a guess value .  Caution: This program is very old; it uses Escape codes to clear the screen. In DOS, it needs the ANSI.COM driver. I haven&#8217;t [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2008/08/04/root-o-matic/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Prime numbers&#8217; generator</title>
		<link>http://dimitris.apeiro.gr/2008/08/02/prime-numbers-generator/</link>
		<comments>http://dimitris.apeiro.gr/2008/08/02/prime-numbers-generator/#comments</comments>
		<pubDate>Sat, 02 Aug 2008 20:58:20 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Open Source]]></category>
		<category><![CDATA[coding]]></category>
		<category><![CDATA[Pascal]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=122</guid>
		<description><![CDATA[This is a Prime Numbers&#8217; Generator from Integers up to 2,000,000,000, written in Turbo Pascal. This program generates the prime numbers up to a given arithmetic limit, using 4 (four) different known methods. They are all based in modulo algebra. The methods are: This uses the mathematical definition of a prime number to generate them. [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2008/08/02/prime-numbers-generator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Qt (Μέρος Ι): Convertor</title>
		<link>http://dimitris.apeiro.gr/2008/08/02/qt-%ce%bc%ce%ad%cf%81%ce%bf%cf%82-%ce%b9-convertor/</link>
		<comments>http://dimitris.apeiro.gr/2008/08/02/qt-%ce%bc%ce%ad%cf%81%ce%bf%cf%82-%ce%b9-convertor/#comments</comments>
		<pubDate>Sat, 02 Aug 2008 19:53:30 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Qt]]></category>
		<category><![CDATA[Tutorials]]></category>
		<category><![CDATA[coding]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=97</guid>
		<description><![CDATA[Το Q Toolkit (Qt) είναι μία εργαλειοθήκη για δημιουργία εφαρμογών με γραφικό περιβάλλον (GUI), αντίστοιχη της GTK του Gnome. Ξεκίνησε να αναπτύσσεται το 1991 από τους Haavard Nord and Eirik Chambe-Eng και έγινε η βάση πάνω στην οποία στηρίχτηκε ολόκληρο το γραφικό περιβάλλον KDE. Ουσιαστικά, οι εκδόσεις του KDE ακολουθούν πάντα τις αναβαθμίσεις της Qt. [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2008/08/02/qt-%ce%bc%ce%ad%cf%81%ce%bf%cf%82-%ce%b9-convertor/feed/</wfw:commentRss>
		<slash:comments>15</slash:comments>
		</item>
		<item>
		<title>Integral in C (1997)</title>
		<link>http://dimitris.apeiro.gr/2008/08/01/integral-in-c-1997/</link>
		<comments>http://dimitris.apeiro.gr/2008/08/01/integral-in-c-1997/#comments</comments>
		<pubDate>Fri, 01 Aug 2008 19:58:10 +0000</pubDate>
		<dc:creator>dimitris</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[coding]]></category>

		<guid isPermaLink="false">http://dimitris.apeiro.gr/?p=100</guid>
		<description><![CDATA[This program uses the basis of the Archimedes (287-212 BC) method, known as exhaustion, to approximate the integral of a given real function in a given space [a,b]. First it segments the given space into N subspaces. It calculates: a) the sum of the areas of orthogonal parallelograms of height equal to the minimum of [...]]]></description>
		<wfw:commentRss>http://dimitris.apeiro.gr/2008/08/01/integral-in-c-1997/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

