<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/">
<channel rdf:about="https://thescipub.com/feed/jcs/issue-279.rss">
<title>Volume 4, Issue 5 (2008) | Journal of Computer Science</title>
<description>Volume 4, Issue 5 (2008) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/279</link>
<admin:generatorAgent rdf:resource="https://thescipub.com/"/>
<admin:errorReportsTo rdf:resource="mailto:support@thescipub.com"/>
<dc:publisher>Science Publications</dc:publisher>
<dc:language>en</dc:language>
<prism:publicationName>Science Publications</prism:publicationName>
<items>
<rdf:Seq>
<rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.353.359"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.360.365"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.366.371"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.372.374"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.375.381"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.382.392"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.393.401"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.402.407"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.408.414"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.415.420"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2008.353.359">
    <title><![CDATA[Arithmetic Encoding Based Dynamic Source Routing for Ad-Hoc Networks ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.353.359</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.353.359">doi:10.3844/jcssp.2008.353.359</a></p>An ad hoc network is a collection of mobile stations forming a temporary network without the aid of any centralized coordinator. Routing messages are an essential component of Mobile Adhoc Networks, a...]]></content:encoded>
    <dc:title><![CDATA[Arithmetic Encoding Based Dynamic Source Routing for Ad-Hoc Networks ]]></dc:title><dc:creator>Ajay  Koul</dc:creator><dc:creator>R. B. Patel</dc:creator><dc:creator>V. K. Bhat</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.353.359</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.353.359</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.353.359</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.353.359</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.360.365">
    <title><![CDATA[E-Learning System Development using an Open-Source Customization Approach]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.360.365</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.360.365">doi:10.3844/jcssp.2008.360.365</a></p>Educational organizations have different methods of deploying E-learning systems, of which is using and developing open-source e-learning systems. One should consider some criteria when choosing a sui...]]></content:encoded>
    <dc:title><![CDATA[E-Learning System Development using an Open-Source Customization Approach]]></dc:title><dc:creator>H.  Mohammadi</dc:creator><dc:creator>S. A. Monadjemi</dc:creator><dc:creator>P.  Moallem</dc:creator><dc:creator>A. A. Olounabadi</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.360.365</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.360.365</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.360.365</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.360.365</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.366.371">
    <title><![CDATA[Power Saving Mechanism in Clustered Ad-Hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.366.371</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.366.371">doi:10.3844/jcssp.2008.366.371</a></p>In wireless Ad-Hoc networks, multihop transmission breaks the single hop path from a mobile node to another, into two or more hops, in a manner that the distances between transmitter and receiver are ...]]></content:encoded>
    <dc:title><![CDATA[Power Saving Mechanism in Clustered Ad-Hoc Networks]]></dc:title><dc:creator>Arwa  Zabian</dc:creator><dc:creator>Ahmed  Ibrahim</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.366.371</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.366.371</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.366.371</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.366.371</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.372.374">
    <title><![CDATA[Analysis of Speech Processing Strategies in Cochlear Implants]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.372.374</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.372.374">doi:10.3844/jcssp.2008.372.374</a></p>Cochlear implants can restore partial hearing to profoundly deaf people; the main function of these prostheses is to electrically stimulate the auditory nerve using an electrode array inserted in the ...]]></content:encoded>
    <dc:title><![CDATA[Analysis of Speech Processing Strategies in Cochlear Implants]]></dc:title><dc:creator>Kouachi  Rouiha</dc:creator><dc:creator>Djedou  Bachir</dc:creator><dc:creator>Bouchaala  Ali</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.372.374</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.372.374</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.372.374</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.372.374</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.375.381">
    <title><![CDATA[CTSS: A Tool for Efficient Information Extraction with Soft Matching Rules for Text Mining ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.375.381</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.375.381">doi:10.3844/jcssp.2008.375.381</a></p>The abundance of information available digitally in modern world had made a demand for structured information. The problem of text mining which dealt with discovering useful information from unstructu...]]></content:encoded>
    <dc:title><![CDATA[CTSS: A Tool for Efficient Information Extraction with Soft Matching Rules for Text Mining ]]></dc:title><dc:creator>A.  Christy</dc:creator><dc:creator>P.  Thambidurai</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.375.381</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.375.381</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.375.381</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.375.381</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.382.392">
    <title><![CDATA[The Complexity Paradigm: Implications for Information Systems and their Strategic Planning ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.382.392</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.382.392">doi:10.3844/jcssp.2008.382.392</a></p>The complexity framework was employed to analyse Information Systems and the strategic planning process associated with them. We provided an overview of the theories of complexity and their significan...]]></content:encoded>
    <dc:title><![CDATA[The Complexity Paradigm: Implications for Information Systems and their Strategic Planning ]]></dc:title><dc:creator>Indranil  Mukherjee</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.382.392</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.382.392</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.382.392</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.382.392</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.393.401">
    <title><![CDATA[A Fast Pattern Matching Algorithm with Two Sliding Windows (TSW)]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.393.401</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.393.401">doi:10.3844/jcssp.2008.393.401</a></p>In this research, we propose a fast pattern matching algorithm: The Two Sliding Windows (TSW) algorithm. The algorithm makes use of two sliding windows, each window has a size that is equal to the pat...]]></content:encoded>
    <dc:title><![CDATA[A Fast Pattern Matching Algorithm with Two Sliding Windows (TSW)]]></dc:title><dc:creator>Amjad  Hudaib</dc:creator><dc:creator>Rola  Al-Khalid</dc:creator><dc:creator>Dima  Suleiman</dc:creator><dc:creator>Mariam  Itriq</dc:creator><dc:creator>Aseel  Al-Anani</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.393.401</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.393.401</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.393.401</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.393.401</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.402.407">
    <title><![CDATA[A Software Agent for Automatic Creation of a PLC Program]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.402.407</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.402.407">doi:10.3844/jcssp.2008.402.407</a></p>Using structured design techniques to design a Programmable Logical Control (PLC) program would decrease the time needed for debugging and produces a concise bug free code. This study is concerned wit...]]></content:encoded>
    <dc:title><![CDATA[A Software Agent for Automatic Creation of a PLC Program]]></dc:title><dc:creator>Walid Mohamed Aly</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.402.407</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.402.407</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.402.407</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.402.407</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.408.414">
    <title><![CDATA[Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.408.414</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.408.414">doi:10.3844/jcssp.2008.408.414</a></p>We proposed a new zero-knowledge proof of identity protocol based on Mandelbrot and Julia Fractal sets. The Fractal based zero-knowledge protocol was possible because of the intrinsic connection betwe...]]></content:encoded>
    <dc:title><![CDATA[Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity]]></dc:title><dc:creator>Mohammad Ahmad Alia</dc:creator><dc:creator>Azman Bin Samsudin</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.408.414</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.408.414</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.408.414</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.408.414</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.415.420">
    <title><![CDATA[The Design of ADAT: A Tool for Assessing Automata-Based Assignments]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.415.420</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 May 2008; <a href="https://thescipub.com/jcs/jcssp.2008.415.420">doi:10.3844/jcssp.2008.415.420</a></p>This study describes the design of an automatic assessment system for assessing an automata-based assignment. Automata concept is taught in several undergraduate computing courses such as Theory of Co...]]></content:encoded>
    <dc:title><![CDATA[The Design of ADAT: A Tool for Assessing Automata-Based Assignments]]></dc:title><dc:creator>Zarina  Shukur</dc:creator><dc:creator>Nurul Fatihah Mohamed</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.415.420</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-05-31; | doi:10.3844/jcssp.2008.415.420</dc:source>
    <dc:date>2008-05-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.415.420</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.415.420</prism:url>
    </item></rdf:RDF>