<?xml version="1.0" encoding="utf-8"?>
<!-- generator="FeedCreator 1.7.2-ppt DokuWiki" -->
<?xml-stylesheet href="http://wiki.phiepsilon.org/lib/styles/feed.css" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://wiki.phiepsilon.org/feed.php">
        <title>Scribe-Pad</title>
        <description></description>
        <link>http://wiki.phiepsilon.org/</link>
        <image rdf:resource="http://wiki.phiepsilon.org/lib/images/favicon.ico" />
       <dc:date>2010-09-05T19:30:50-05:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=bit_banging&amp;amp;rev=1175952957"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=bitwise_questions&amp;amp;rev=1175950854"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=code-snippets&amp;amp;rev=1175951696"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=droste_effect&amp;amp;rev=1175951798"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=game_of_life&amp;amp;rev=1175951921"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=joy_of_lisping&amp;amp;rev=1176819662"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=kernel-commenting-style&amp;amp;rev=1175952670"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=knight_tour&amp;amp;rev=1175951368"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=lover_paradox&amp;amp;rev=1175950798"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=neo_system&amp;amp;rev=1175950771"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=p_np_problem&amp;amp;rev=1175950721"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=poly_infinite_products&amp;amp;rev=1176129971"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=sequence_encounter&amp;amp;rev=1209851991"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=solve_it_archives&amp;amp;rev=1182418833"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=strict_inequalities&amp;amp;rev=1209909100"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=svg-template-header&amp;amp;rev=1175951723"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=technical-abbrevations-expansions&amp;amp;rev=1175952637"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=user_mode_driver&amp;amp;rev=1175952843"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=week-1&amp;amp;rev=1176104025"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=week-2&amp;amp;rev=1176104157"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=week-3&amp;amp;rev=1176104205"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=week-4&amp;amp;rev=1176104240"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=week-5&amp;amp;rev=1176104270"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=week-6&amp;amp;rev=1176104308"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=welcome&amp;amp;rev=1209407785"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=x86_helloworld&amp;amp;rev=1175952518"/>
                <rdf:li rdf:resource="http://wiki.phiepsilon.org/doku.php?id=xor_equation&amp;amp;rev=1175951032"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://wiki.phiepsilon.org/lib/images/favicon.ico">
        <title>Scribe-Pad</title>
        <link>http://wiki.phiepsilon.org/</link>
        <url>http://wiki.phiepsilon.org/lib/images/favicon.ico</url>
    </image>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=bit_banging&amp;amp;rev=1175952957">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:35:57-05:00</dc:date>
        <title>bit_banging</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=bit_banging&amp;amp;rev=1175952957</link>
        <description>As the title says it all, this is about ‘Banging’ the ‘Bit’. This comes as a handy method for simplifying data transactions over certain interfaces. Here are a few applications where this can be used:

	*  Programming a flash/PLD (though complex due to protocols, can be done).
	*  Providing clock source to a peripheral where trace connecting clock is unavailable.
	*  Data transaction in both Master/Slave mode with certain peripherals. But the complexity increases when in slave mode.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=bitwise_questions&amp;amp;rev=1175950854">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:00:54-05:00</dc:date>
        <title>bitwise_questions</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=bitwise_questions&amp;amp;rev=1175950854</link>
        <description>1. The Sequence

Given the inputs I={1,3,5}, return outputs O={3,5,1}. Meaning, given I=1, return O=3, and so on. These are the constraints imposed:

	*  No extra memory other than ‘I’ should be used to process.
	*  Only operators available are: &amp;, |, ~, ^, &gt;&gt;, &lt;&lt;, +, -. 
	*  No logical operators/if’s/for’s/while’s please.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=code-snippets&amp;amp;rev=1175951696">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:14:56-05:00</dc:date>
        <title>code-snippets</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=code-snippets&amp;amp;rev=1175951696</link>
        <description>Just a collection of Misc. Snippets. Not completely optimized and i wouldnot like to guarantee about the validation of the algorithm implemented in them. This code snippets are open for public and could be used as you wish (if at all it serves some purpose of yours :).</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=droste_effect&amp;amp;rev=1175951798">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:16:38-05:00</dc:date>
        <title>droste_effect</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=droste_effect&amp;amp;rev=1175951798</link>
        <description>Droste Effect

[A square droste image.] A recursive enumeration of an art within itself is the droste effect. The word droste has its origin from the Dutch language. It is almost similar to the fractaline nature of the art.

The Dutch painter/mathematician, M.C.Escher‘s “Print Gallery” is a very good example of the Droste effect. The puzzle that lied in the central blank spot of the image has been revealed by a group of Mathematicians at the University of Leiden in Netherlands.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=game_of_life&amp;amp;rev=1175951921">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:18:41-05:00</dc:date>
        <title>game_of_life</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=game_of_life&amp;amp;rev=1175951921</link>
        <description>This is a small analysis of the celebrated Conway’s Game of Life. History of this game is really fascinating. All started with John Von Neumann’s wish of creating self-evolving machines and this is just a simplified quantification of his attempt by Conway.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=joy_of_lisping&amp;amp;rev=1176819662">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-17T09:21:02-05:00</dc:date>
        <title>joy_of_lisping</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=joy_of_lisping&amp;amp;rev=1176819662</link>
        <description>Not for fun, but actually started to have some fun with cutty parenthesis lurking around the code, has a more ‘machine’ like flavour coding with those symbols. But the serious fun has become a bit serious after grabbing the beauty of the Lisp. The beauty of Lisp is its limited types/keywords, with flexible extension for building maximal blocks. Here are some snippets written for fun but could be put under analysis. There exists lot of variants of Lisp for the snippets presented below is writ…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=kernel-commenting-style&amp;amp;rev=1175952670">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:31:10-05:00</dc:date>
        <title>kernel-commenting-style</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=kernel-commenting-style&amp;amp;rev=1175952670</link>
        <description>Commenting Style

In order to make the task of extracting the functional headers easier, we could follow one of the numerous commenting styles available (javadoc, linuxdoc, kernel etc..). Here is a brief description of commenting in the kernel style.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=knight_tour&amp;amp;rev=1175951368">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:09:28-05:00</dc:date>
        <title>knight_tour</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=knight_tour&amp;amp;rev=1175951368</link>
        <description>Problem of Chess have fascinated the human race for decades/centuries together. Im no escape! Here again, we would like to discuss the knight tour and the so called knight graph from which the tour is derieved. The knight graph is again an interesting one, artistically! Here are few snapshots of the knight graph and the code snippet to generate them.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=lover_paradox&amp;amp;rev=1175950798">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T07:59:58-05:00</dc:date>
        <title>lover_paradox</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=lover_paradox&amp;amp;rev=1175950798</link>
        <description>Paradox of Love

Just yet another paradox that flashes after realizing the Russel’s classic paradox. The content here is to be taken just as a fun stuff and _NO_ unethical motives behind.

The Story

Once upon a time there existed a person of truth (as people address) who didn’t have a pair. He was questioned regarding this as why didn’t he choose a pair for himself. The truthful person smiles for a moment and replies back in a soothing tone that,</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=neo_system&amp;amp;rev=1175950771">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T07:59:31-05:00</dc:date>
        <title>neo_system</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=neo_system&amp;amp;rev=1175950771</link>
        <description>Dream design of a system

Out of sheer curiosity, there were a list of questions as equal to that of a kid’s wish that comes on its way. Here are a list of few of them proceeding to the artificialism from the naturalism. Its a ‘new’ system and finally i say a ‘wow’ which gets the name, ‘newow’ and i dont like to see letters being redundant on the new word. Hence removing those ‘w’, which is already ‘double u’:-) the name ‘neo’ for the system evolved.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=p_np_problem&amp;amp;rev=1175950721">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T07:58:41-05:00</dc:date>
        <title>p_np_problem</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=p_np_problem&amp;amp;rev=1175950721</link>
        <description>IS P=NP?

 A celebrated problem in the theory of computation, really had fascinated many. A few thoughts over the problem is given below. This approach of solving the problem ofcourse has a flaw. The whole thread of discussion can be found in  google-groups-cs-theory link.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=poly_infinite_products&amp;amp;rev=1176129971">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T09:46:11-05:00</dc:date>
        <title>poly_infinite_products</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=poly_infinite_products&amp;amp;rev=1176129971</link>
        <description>Polynomials are undoubtedly a beautiful representation of abstraction by humans. Here we restrict our explorations in polynomials that carry integral powers/coefficients. Here are few simpler polynomials and their factorizations.
Some examples
 

For now, leaving all the rules of convergence, that play a tricky role of deciding the expansions, we take it for granted that some kind of convergence rule would hold and go on to investigate on the patterns of expansions in these polynomials.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=sequence_encounter&amp;amp;rev=1209851991">
        <dc:format>text/html</dc:format>
        <dc:date>2008-05-03T16:59:51-05:00</dc:date>
        <title>sequence_encounter</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=sequence_encounter&amp;amp;rev=1209851991</link>
        <description>Sequences are so fascinating in their beauty. The changes in patterns and the dynamics would tie us up for the whole lifetime. It is hard to be an exception to avoid sequences. Here are few encounters with them. Journey through the sequences are so fascinating that you would cross the meadows that look the same but different.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=solve_it_archives&amp;amp;rev=1182418833">
        <dc:format>text/html</dc:format>
        <dc:date>2007-06-21T04:40:33-05:00</dc:date>
        <title>solve_it_archives</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=solve_it_archives&amp;amp;rev=1182418833</link>
        <description>This section is a collection of problems that range from simple bit-related problems to digital designs. As such, no restriction is placed on proposing the problems. We do like to stick with few basic principles in this arena. Here are they: 

	*  Anyone can propose a problem and anyone can solve. 
	*  Take care not to repeat the problems that were already solved or proposed.
	*  Make sure to maintain the count in this page to reflect the number of problems.
	*  Its not demanding on the problem …</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=strict_inequalities&amp;amp;rev=1209909100">
        <dc:format>text/html</dc:format>
        <dc:date>2008-05-04T08:51:40-05:00</dc:date>
        <title>strict_inequalities</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=strict_inequalities&amp;amp;rev=1209909100</link>
        <description>Let us consider a sequence of integers,
Sequence - A


We form another sequence that is roughly half the length of the above sequence,
Sequence - B




We cannot of course ensure the same inequality to hold for the above , but in case if we want the above inequality to hold, we need to change values of some of the . Assuming that we change , in order to meet the constraint in , and we proceed further to create another sequence , in the following way as  is obtained from . This process is not inf…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=svg-template-header&amp;amp;rev=1175951723">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:15:23-05:00</dc:date>
        <title>svg-template-header</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=svg-template-header&amp;amp;rev=1175951723</link>
        <description>Just a small utility header to use the SVG file format. _shamelessly_ copied the SVG tags from W3C.


#ifndef SVG_TEMPLATE_H
#define SVG_TEMPLATE_H

#define SVG_BEGIN     &quot;&lt;?xml version=\&quot;1.0\&quot; standalone=\&quot;no\&quot;?&gt;\n&quot;

#define SVG_DOCTYPE   &quot;&lt;!DOCTYPE svg PUBLIC \&quot;-//W3C//DTD SVG 1.1//EN\&quot;\n&quot;       \
                      &quot;\&quot;http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\&quot;&gt;\n&quot;

#define SVG_IMAGE     &quot;&lt;svg width=\&quot;%d\&quot; height=\&quot;%d\&quot; version=\&quot;1.1\&quot;\n&quot;        \
                      &quot;xmlns=\&quot;http…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=technical-abbrevations-expansions&amp;amp;rev=1175952637">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:30:37-05:00</dc:date>
        <title>technical-abbrevations-expansions</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=technical-abbrevations-expansions&amp;amp;rev=1175952637</link>
        <description>Expansions

This page contains a random list of expansions related to miscellaneous fields.

Electronics/Telecom
 Abbrevation  Expanded as  Abbrevation  Expanded as DTMF  Dual Tone Multi FrequencyCCS   Common Channel SignalingCAS   Channel Associated SignalingSDH   Synchronous Digital HierarchyTDM   Time Division MultiplexingFDM   Frequency Division MultiplexingWDM   Wave Division MultiplexingTSI   Time Slot InterchangePDH   Plesiochronous Digital HierarchySTDM  Statistical Time Division Multipl…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=user_mode_driver&amp;amp;rev=1175952843">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:34:03-05:00</dc:date>
        <title>user_mode_driver</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=user_mode_driver&amp;amp;rev=1175952843</link>
        <description>In this user mode drivers, access of registers through mmap and interrupts through proc interface is discussed. This is a from Peter Chubb's User Mode Driver mechanism for linux kernel 2.6. A casual one to handle the scenarios from user space is discussed below. Whereas, it has limitations like shared interrupts cannot be used with this mechanism and a lot more. Infact at certain cases it would result in a deadlock and further discussions on this mechanism could be viewed in this discussion thre…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=week-1&amp;amp;rev=1176104025">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T02:33:45-05:00</dc:date>
        <title>week-1</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=week-1&amp;amp;rev=1176104025</link>
        <description>1. The Sequence

Given the inputs I={1,3,5}, return outputs O={3,5,1}. Meaning, given I=1, return O=3, and so on. These are the constraints imposed:

	*  No extra memory other than ‘I’ should be used to process.
	*  Only operators available are: &amp;, |, ~, ^, &gt;&gt;, &lt;&lt;, +, -. 
	*  No logical operators/if’s/for’s/while’s please.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=week-2&amp;amp;rev=1176104157">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T02:35:57-05:00</dc:date>
        <title>week-2</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=week-2&amp;amp;rev=1176104157</link>
        <description>1. Is a Zero?

Given a number (8/16/32/64 bit, +/-ve or 0) find if its a zero-valued number. Pretty easy task isnt? But wait! Here are a few restrictions on that: 

	*  No logical operators should be used [!, &gt;, &gt;=, &lt;, &lt;=, &amp;&amp;, ||, ==]
	*  No if’s/for’s/while’s etc.
	*  Only operators allowed: [ &amp;, |, ~, ^, +, -, &gt;&gt;, &lt;&lt; ]</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=week-3&amp;amp;rev=1176104205">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T02:36:45-05:00</dc:date>
        <title>week-3</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=week-3&amp;amp;rev=1176104205</link>
        <description>1. Palindromic Binary Strings

Let us consider the k-bit binary strings. We inspect the palindromic strings of length k. Here are few analysis: 
 k-bits  Palindromic Strings  Total  1  0×0, 0×1  2  2  0×00, 0×11  2  3  0×000, 0×010, 0×101, 0×111  4 
 And the above goes like this. What we are interested in is that, how many binary palindromic strings exists for a given length, N? Can we have an expression for the above in terms of N?</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=week-4&amp;amp;rev=1176104240">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T02:37:20-05:00</dc:date>
        <title>week-4</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=week-4&amp;amp;rev=1176104240</link>
        <description>1. Complex, is it so complex?

Consider the scenario of complex multiplication. The basics of complex algebra tells (a + ib)(c + id) = (ac - bd) + i(ad + bc). Here we see, we do 4 multiplications and 2 additions. Consider architectures where multiplication operations are much costlier than addition. Can we do the above multiplication in a compact form so that the multiplication gets reduced? At which scenario its better to go for that method with less multiplication?</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=week-5&amp;amp;rev=1176104270">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T02:37:50-05:00</dc:date>
        <title>week-5</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=week-5&amp;amp;rev=1176104270</link>
        <description>1. Shuttles in Space

Consider the scenario where the people of this world goes into a ET-spree for search of life out of earth. They send N space shuttles out in different directions in search of life. To maintain the team of shuttles, they need to communicate with each other so that they exchange the information of their present location in space and their guess on existance of life on the location they presently stand.</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=week-6&amp;amp;rev=1176104308">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-09T02:38:28-05:00</dc:date>
        <title>week-6</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=week-6&amp;amp;rev=1176104308</link>
        <description>String Compression

Dexter is out with a crazy idea of designing a string compression algorithm. He wanted to store distinct symbols and any combination/permutation of that symbols is valid and hence need to keep track of all of them. So, he decides to proceed in this way:</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=welcome&amp;amp;rev=1209407785">
        <dc:format>text/html</dc:format>
        <dc:date>2008-04-28T13:36:25-05:00</dc:date>
        <title>welcome</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=welcome&amp;amp;rev=1209407785</link>
        <description>Aroused by curiosity, and by the way of pleasure in finding things out, certain scribblings of this amateur has been recorded. Thoughts always flow. There are designed to be that way. Its upto the system to hold the thoughts for itself that it fades away with time or to trust upon an illusive storage unit miles away which depends on the storage action using magnetics in a box. The system in me decides to choose the later, thus would be an open book and would record the thoughts that seems worthy…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=x86_helloworld&amp;amp;rev=1175952518">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:28:38-05:00</dc:date>
        <title>x86_helloworld</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=x86_helloworld&amp;amp;rev=1175952518</link>
        <description>This is the result of the exploration into the world of mystery, the world of obfuscated coding. Actually some months back, there was a C code to print “Hello World” but uses no function by name main. It just had a char array, main. 

The main idea is to write the very first C code without using the main as a function but as an array. Is it possible? This is what the analysis about. Why is the x86? The title gives a very strong hint that the code is highly architecture dependent. An obfuscat…</description>
    </item>
    <item rdf:about="http://wiki.phiepsilon.org/doku.php?id=xor_equation&amp;amp;rev=1175951032">
        <dc:format>text/html</dc:format>
        <dc:date>2007-04-07T08:03:52-05:00</dc:date>
        <title>xor_equation</title>
        <link>http://wiki.phiepsilon.org/doku.php?id=xor_equation&amp;amp;rev=1175951032</link>
        <description>The given equation to be solved in the integral domain is the following:
X ^ Y = X - Y, where X &gt;= 0, Y &gt;= 0 ................... (1)
The Edges

	*  As always, we have X ^ Y &gt;= 0, we are restricted to values, X &gt;= Y as the set of all solutions should be constrained to. This implies,</description>
    </item>
</rdf:RDF>
