<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-287.rss">
<title>Volume 5, Issue 1 (2009) | Journal of Computer Science</title>
<description>Volume 5, Issue 1 (2009) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/287</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.2009.1.10"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.11.22"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.23.32"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.33.38"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.39.48"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.49.56"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.57.63"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.64.70"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.71.78"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2009.79.85"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2009.1.10">
    <title><![CDATA[DNA Code Word Design for DNA Computing with Real-Time Polymerase Chain Reaction ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.1.10</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.1.10">doi:10.3844/jcssp.2009.1.10</a></p>Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP...]]></content:encoded>
    <dc:title><![CDATA[DNA Code Word Design for DNA Computing with Real-Time Polymerase Chain Reaction ]]></dc:title><dc:creator>Muhammad Faiz Mohamed Saaid</dc:creator><dc:creator>Zuwairie  Ibrahim</dc:creator><dc:creator>Mohamad Shukri Zainal Abidin</dc:creator><dc:creator>Marzuki  Khalid</dc:creator><dc:creator>Nor Haniza Sarmin</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.1.10</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.1.10</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.1.10</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.1.10</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.11.22">
    <title><![CDATA[Providing Reliability in Replicated Middleware Applications]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.11.22</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.11.22">doi:10.3844/jcssp.2009.11.22</a></p>Problem statement: Data inconsistency is raised in actively replicated environment due to non-determinism in the applications that defeats the purpose of replication as a fault-tolerance strategy. App...]]></content:encoded>
    <dc:title><![CDATA[Providing Reliability in Replicated Middleware Applications]]></dc:title><dc:creator>R.  Saravanan</dc:creator><dc:creator>N.  Ramaraj</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.11.22</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.11.22</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.11.22</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.11.22</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.23.32">
    <title><![CDATA[Artificial Neural Network Approach in Radar Target Classification]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.23.32</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.23.32">doi:10.3844/jcssp.2009.23.32</a></p>Problem statement: This study unveils the potential and utilization of Neural Network (NN) in radar applications for target classification. The radar system under test is a special of it kinds and kno...]]></content:encoded>
    <dc:title><![CDATA[Artificial Neural Network Approach in Radar Target Classification]]></dc:title><dc:creator>N.K.  Ibrahim</dc:creator><dc:creator>R.S.A. Raja Abdullah</dc:creator><dc:creator>M.I.  Saripan</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.23.32</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.23.32</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.23.32</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.23.32</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.33.38">
    <title><![CDATA[Image Steganography by Mapping Pixels to Letters]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.33.38</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.33.38">doi:10.3844/jcssp.2009.33.38</a></p>Problem statement: Steganography hides the very existence of a message so that if successful it generally attracts no suspicion at all. Using steganography, information can be hidden in carriers such ...]]></content:encoded>
    <dc:title><![CDATA[Image Steganography by Mapping Pixels to Letters]]></dc:title><dc:creator>Mohammed A.F. Al-Husainy</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.33.38</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.33.38</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.33.38</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.33.38</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.39.48">
    <title><![CDATA[Current State of Component-Oriented Software Development Practice in Malaysia: Towards Identifying Its Potential and Research Areas]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.39.48</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.39.48">doi:10.3844/jcssp.2009.39.48</a></p>Problem statement:  A study was conducted to investigate the current state of software development practice in Malaysia with regard to Component Oriented Software Development (COSD).  The objectives o...]]></content:encoded>
    <dc:title><![CDATA[Current State of Component-Oriented Software Development Practice in Malaysia: Towards Identifying Its Potential and Research Areas]]></dc:title><dc:creator>Hazleen  Aris</dc:creator><dc:creator>Siti Salwah Salim</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.39.48</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.39.48</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.39.48</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.39.48</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.49.56">
    <title><![CDATA[Efficient Reversible Montgomery Multiplier and Its Application to Hardware Cryptography ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.49.56</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.49.56">doi:10.3844/jcssp.2009.49.56</a></p>Problem Statement: Arithmetic Logic Unit (ALU) of a crypto-processor and microchips leak information through power consumption. Although the cryptographic protocols are secured against mathematical at...]]></content:encoded>
    <dc:title><![CDATA[Efficient Reversible Montgomery Multiplier and Its Application to Hardware Cryptography ]]></dc:title><dc:creator>Noor Muhammed Nayeem</dc:creator><dc:creator>Lafifa  Jamal</dc:creator><dc:creator>Hafiz Md. Hasan Babu</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.49.56</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.49.56</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.49.56</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.49.56</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.57.63">
    <title><![CDATA[A Channel Adaptive Energy Efficient and Fair Scheduling Media Access Control Protocol for Mobile AdHoc Networks ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.57.63</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.57.63">doi:10.3844/jcssp.2009.57.63</a></p>Problem statement: A major drawback in the existing protocols in dealing with energy management issues is that the time varying nature of the wireless channels among the ad hoc nodes is ignored. Appro...]]></content:encoded>
    <dc:title><![CDATA[A Channel Adaptive Energy Efficient and Fair Scheduling Media Access Control Protocol for Mobile AdHoc Networks ]]></dc:title><dc:creator>P.  Priakanth</dc:creator><dc:creator>P.  Thangaraj</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.57.63</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.57.63</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.57.63</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.57.63</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.64.70">
    <title><![CDATA[Benders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment Problems ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.64.70</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.64.70">doi:10.3844/jcssp.2009.64.70</a></p>Problem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem o...]]></content:encoded>
    <dc:title><![CDATA[Benders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment Problems ]]></dc:title><dc:creator>Sirirat  Muenvanichakul</dc:creator><dc:creator>Peerayuth  Charnsethikul</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.64.70</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.64.70</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.64.70</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.64.70</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.71.78">
    <title><![CDATA[Error Free Iterative Morphological Decomposition Algorithm for Shape Representation]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.71.78</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.71.78">doi:10.3844/jcssp.2009.71.78</a></p>Problem statement: A generalized skeleton transform allows a shape to be represented as a collection of modestly overlapped octagonal shape parts. One problem with several generalized Morphological sk...]]></content:encoded>
    <dc:title><![CDATA[Error Free Iterative Morphological Decomposition Algorithm for Shape Representation]]></dc:title><dc:creator>V. Vijaya Kumar</dc:creator><dc:creator>A.  Srikrishna</dc:creator><dc:creator>G. Hemantha Kumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.71.78</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.71.78</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.71.78</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.71.78</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2009.79.85">
    <title><![CDATA[Intelligent OkiKoSenPBX1 Security Patrol Robot via Network and Map-Based Route Planning ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2009.79.85</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2009; <a href="https://thescipub.com/jcs/jcssp.2009.79.85">doi:10.3844/jcssp.2009.79.85</a></p>Problem statement: With an increased demand for security and limited numbers of trained security personnel, some security mangers have a lot of ground to police and limited staff to cover it. To compe...]]></content:encoded>
    <dc:title><![CDATA[Intelligent OkiKoSenPBX1 Security Patrol Robot via Network and Map-Based Route Planning ]]></dc:title><dc:creator>Mbaïtiga  Zacharie</dc:creator><dc:identifier>doi:10.3844/jcssp.2009.79.85</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2009-01-31; | doi:10.3844/jcssp.2009.79.85</dc:source>
    <dc:date>2009-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2009.79.85</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2009.79.85</prism:url>
    </item></rdf:RDF>