<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-276.rss">
<title>Volume 4, Issue 2 (2008) | Journal of Computer Science</title>
<description>Volume 4, Issue 2 (2008) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/276</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.80.86"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.87.94"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.95.102"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.103.110"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.111.116"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.117.124"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.125.128"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.129.132"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.133.138"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.139.147"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.148.150"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.151.160"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.161.166"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2008.167.171"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2008.80.86">
    <title><![CDATA[Ant Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc Network ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.80.86</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.80.86">doi:10.3844/jcssp.2008.80.86</a></p>Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure and frequent node mobility. A class of ant colony based routing protocols has recently gained attention...]]></content:encoded>
    <dc:title><![CDATA[Ant Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc Network ]]></dc:title><dc:creator>B.  Kalaavathi</dc:creator><dc:creator>K.  Duraiswamy</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.80.86</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.80.86</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.80.86</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.80.86</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.87.94">
    <title><![CDATA[FPGA Implementation of Power Aware FIR Filter Using Reduced Transition Pipelined Variable Precision Gating ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.87.94</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.87.94">doi:10.3844/jcssp.2008.87.94</a></p>With the emergence of portable computing and communication system, power awareness is one of the major objectives of VLSI Design. This is its ability to scale power consumption based on the time-varyi...]]></content:encoded>
    <dc:title><![CDATA[FPGA Implementation of Power Aware FIR Filter Using Reduced Transition Pipelined Variable Precision Gating ]]></dc:title><dc:creator>A.  Senthilkumar</dc:creator><dc:creator>A. M. Natarajan</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.87.94</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.87.94</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.87.94</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.87.94</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.95.102">
    <title><![CDATA[A Middleware Service for Increasing Applications Integration Availability]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.95.102</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.95.102">doi:10.3844/jcssp.2008.95.102</a></p>Middleware has become an integral part of many distributed applications offering effective integration and interoperability solutions. In some situations a problem may occur where the integration of d...]]></content:encoded>
    <dc:title><![CDATA[A Middleware Service for Increasing Applications Integration Availability]]></dc:title><dc:creator>Nader  Mohamed</dc:creator><dc:creator>Jameela  Al-Jaroodi</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.95.102</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.95.102</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.95.102</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.95.102</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.103.110">
    <title><![CDATA[Access Weight Replica Consistency Protocol For Large Scale Data Grid]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.103.110</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.103.110">doi:10.3844/jcssp.2008.103.110</a></p>Replication is a well known technique to improve reliability and performance for a Data Grid. Keeping consistent content at all distributed replica is an important subject in Data Grid. Replica consis...]]></content:encoded>
    <dc:title><![CDATA[Access Weight Replica Consistency Protocol For Large Scale Data Grid]]></dc:title><dc:creator>Mohammed  Radi</dc:creator><dc:creator>Ali  Mamat</dc:creator><dc:creator>M. M. Deris</dc:creator><dc:creator>Hamidah  Ibrahim</dc:creator><dc:creator>Subramaniam  Shamala</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.103.110</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.103.110</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.103.110</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.103.110</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.111.116">
    <title><![CDATA[Improved Offline Signature Verification Scheme Using Feature Point Extraction Method ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.111.116</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.111.116">doi:10.3844/jcssp.2008.111.116</a></p>Signature verification is a technology that can solve security problems in our networked society. A new improved offline signature verification scheme is proposed which is based on selecting 60 featur...]]></content:encoded>
    <dc:title><![CDATA[Improved Offline Signature Verification Scheme Using Feature Point Extraction Method ]]></dc:title><dc:creator>Debasish  Jena</dc:creator><dc:creator>Banshidhar  Majhi</dc:creator><dc:creator>Sanjay K. Jena</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.111.116</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.111.116</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.111.116</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.111.116</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.117.124">
    <title><![CDATA[A Block Cipher using Feistal&apos;s Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.117.124</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.117.124">doi:10.3844/jcssp.2008.117.124</a></p>In this research, we have developed a block cipher for a block of size 112 bits by using an iterative method involving a permutation of the plaintext and the subkeys generated in each iteration. Here ...]]></content:encoded>
    <dc:title><![CDATA[A Block Cipher using Feistal&apos;s Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix]]></dc:title><dc:creator>Aruna  Varanasi</dc:creator><dc:creator>S. U. Kumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.117.124</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.117.124</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.117.124</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.117.124</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.125.128">
    <title><![CDATA[Testing Image Encryption by Output Feedback (OFB)]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.125.128</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.125.128">doi:10.3844/jcssp.2008.125.128</a></p>When it is necessary to securely transmit data in open networks, the encryption must be performed. Most of the cryptographic algorithms were mainly developed for text data. Unfortunately, algorithms t...]]></content:encoded>
    <dc:title><![CDATA[Testing Image Encryption by Output Feedback (OFB)]]></dc:title><dc:creator>Yas A. Alsultanny</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.125.128</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.125.128</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.125.128</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.125.128</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.129.132">
    <title><![CDATA[Fast Algorithms for Outlier Detection]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.129.132</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.129.132">doi:10.3844/jcssp.2008.129.132</a></p>Finding fast algorithms to detect outliers (as unusual objects) by their distance to neighboring objects is a big desire. Two algorithms were proposed to detect outliers quickly. The first was based o...]]></content:encoded>
    <dc:title><![CDATA[Fast Algorithms for Outlier Detection]]></dc:title><dc:creator>Fawaz A.M. Masoud</dc:creator><dc:creator>Moh'd B. Al- Zoubi</dc:creator><dc:creator>Imad  Salah</dc:creator><dc:creator>Ali  Al-Dahoud</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.129.132</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.129.132</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.129.132</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.129.132</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.133.138">
    <title><![CDATA[Classification of Textures by Avoiding Complex Patterns]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.133.138</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.133.138">doi:10.3844/jcssp.2008.133.138</a></p>The present research advocates a new method for texture classification based on primitive patterns. For this, an optimal set of eight simple patterns are selected based on their discrimination. The pe...]]></content:encoded>
    <dc:title><![CDATA[Classification of Textures by Avoiding Complex Patterns]]></dc:title><dc:creator>V. V. Kumar</dc:creator><dc:creator>B. E. Reddy</dc:creator><dc:creator>U. S.N. Raju</dc:creator><dc:creator>A.  Suresh</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.133.138</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.133.138</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.133.138</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.133.138</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.139.147">
    <title><![CDATA[Memory Convergence and Optimization with Fuzzy PSO and ACS]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.139.147</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.139.147">doi:10.3844/jcssp.2008.139.147</a></p>Associative neural memories are models of biological phenomena that allow for the storage of pattern associations and the retrieval of the desired output pattern upon presentation of a possibly noisy ...]]></content:encoded>
    <dc:title><![CDATA[Memory Convergence and Optimization with Fuzzy PSO and ACS]]></dc:title><dc:creator>Subhash C. Pandey</dc:creator><dc:creator>Dr. P. Misra</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.139.147</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.139.147</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.139.147</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.139.147</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.148.150">
    <title><![CDATA[Heterogeneous GPRS-WLAN Integration Based on Ad-Hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.148.150</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.148.150">doi:10.3844/jcssp.2008.148.150</a></p>In heterogeneous microcellular networks like 802.11(WLAN)-GPRS, users can roam around through vertical handoffs. The major problem in heterogeneous networks is that they support different QoS requirem...]]></content:encoded>
    <dc:title><![CDATA[Heterogeneous GPRS-WLAN Integration Based on Ad-Hoc Networks]]></dc:title><dc:creator>S.  Louvros</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.148.150</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.148.150</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.148.150</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.148.150</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.151.160">
    <title><![CDATA[Improving Response Time of Authorization Process of Credit Card System Using Multi-Threading and Shared-Memory Pool Techniques ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.151.160</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.151.160">doi:10.3844/jcssp.2008.151.160</a></p>Current credit card authorization was developed on single-threaded model whereby authentication process takes longer time to respond due to sequential process of card's risk management profile and its...]]></content:encoded>
    <dc:title><![CDATA[Improving Response Time of Authorization Process of Credit Card System Using Multi-Threading and Shared-Memory Pool Techniques ]]></dc:title><dc:creator>Siti H.A. Hamid</dc:creator><dc:creator>Mohd H.N.M. Nasir</dc:creator><dc:creator>Wong Y. Ming</dc:creator><dc:creator>Hazrina  Hassan</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.151.160</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.151.160</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.151.160</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.151.160</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.161.166">
    <title><![CDATA[A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.161.166</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.161.166">doi:10.3844/jcssp.2008.161.166</a></p>This paper proposed a new Distributed Score Based Clustering Algorithm (DSBCA) for Mobile Ad-hoc Networks (MANETs).In MANETs, select suitable nodes in clusters as cluster heads are so important. The p...]]></content:encoded>
    <dc:title><![CDATA[A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks]]></dc:title><dc:creator>Sahar  Adabi</dc:creator><dc:creator>Sam  Jabbehdari</dc:creator><dc:creator>Amirmasoud  Rahmani</dc:creator><dc:creator>Sepideh  Adabi</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.161.166</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.161.166</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.161.166</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.161.166</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2008.167.171">
    <title><![CDATA[Improving Quality of Clustering using Cellular Automata for Information retrieval]]></title>
    <link>https://thescipub.com/jcs/jcssp.2008.167.171</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2008; <a href="https://thescipub.com/jcs/jcssp.2008.167.171">doi:10.3844/jcssp.2008.167.171</a></p>Clustering has been widely applied to Information Retrieval (IR) on the grounds of its potential improved effectiveness over inverted file search. Clustering is a mostly unsupervised procedure and the...]]></content:encoded>
    <dc:title><![CDATA[Improving Quality of Clustering using Cellular Automata for Information retrieval]]></dc:title><dc:creator>P. K. Sree</dc:creator><dc:creator>G. V.S. Raju</dc:creator><dc:creator>I. R. Babu</dc:creator><dc:creator>S. V. Raju</dc:creator><dc:identifier>doi:10.3844/jcssp.2008.167.171</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2008-02-28; | doi:10.3844/jcssp.2008.167.171</dc:source>
    <dc:date>2008-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2008.167.171</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2008.167.171</prism:url>
    </item></rdf:RDF>