<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-418.rss">
<title>Volume 7, Issue 5 (2011) | Journal of Computer Science</title>
<description>Volume 7, Issue 5 (2011) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/418</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.2011.591.599"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.600.604"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.605.610"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.611.618"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.619.628"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.629.637"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.638.643"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.644.650"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.651.656"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.657.663"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.664.670"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.671.677"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.678.682"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.683.689"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.690.697"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.698.706"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.707.714"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.715.722"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.723.730"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.731.735"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.736.743"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.744.748"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.749.756"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.757.761"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.762.769"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.770.778"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.779.784"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.785.789"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.790.799"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2011.800.820"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2011.591.599">
    <title><![CDATA[Interactive Computing Framework for Engineering Applications]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.591.599</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.591.599">doi:10.3844/jcssp.2011.591.599</a></p>Problem statement: Even though the computational steering state-of-the-art environments
allow users to embed their simulation codes as a module for an interactive steering without the
necessity for ...]]></content:encoded>
    <dc:title><![CDATA[Interactive Computing Framework for Engineering Applications]]></dc:title><dc:creator>Jovana  Knezevic</dc:creator><dc:creator>Jerome  Frisch</dc:creator><dc:creator>Ralf-Peter  Mundani</dc:creator><dc:creator>Ernst  Rank</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.591.599</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.591.599</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.591.599</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.591.599</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.600.604">
    <title><![CDATA[Quality of Service Policy for IEEE 802.11 Networks with Service Rate Selection based on Fairness Index]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.600.604</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.600.604">doi:10.3844/jcssp.2011.600.604</a></p>Problem statement: The IEEE802.11 standard states that all stations have the same
probability of accessing the network, but does not consider important parameters such as transmission
rates and sign...]]></content:encoded>
    <dc:title><![CDATA[Quality of Service Policy for IEEE 802.11 Networks with Service Rate Selection based on Fairness Index]]></dc:title><dc:creator>Lia Toledo Moreira Mota</dc:creator><dc:creator>Alexandre de Assis Mota</dc:creator><dc:creator>Luis Fernando Fontolan</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.600.604</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.600.604</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.600.604</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.600.604</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.605.610">
    <title><![CDATA[Application of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic Conditions]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.605.610</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.605.610">doi:10.3844/jcssp.2011.605.610</a></p>Problem statement: This study deals with the pickup and delivery traveling salesman
problem with traffic conditions (PDTSPTW), an extension of the pickup and delivery traveling
salesman problem (PDT...]]></content:encoded>
    <dc:title><![CDATA[Application of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic Conditions]]></dc:title><dc:creator>Supat  Patvichaichod</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.605.610</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.605.610</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.605.610</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.605.610</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.611.618">
    <title><![CDATA[Weighted Kernel Density Estimation of the Prepulse Inhibition Test]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.611.618</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.611.618">doi:10.3844/jcssp.2011.611.618</a></p>Problem statement: The goal of this study was to devise a more reliable and sensitive
method for analysis of experimental data of the Prepulse Inhibition (PPI), the reduction in startle
reaction tow...]]></content:encoded>
    <dc:title><![CDATA[Weighted Kernel Density Estimation of the Prepulse Inhibition Test]]></dc:title><dc:creator>Hongbo  Zhou</dc:creator><dc:creator>Qiang  Cheng</dc:creator><dc:creator>Hong-Ju  Yang</dc:creator><dc:creator>Haiyun  Xu</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.611.618</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.611.618</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.611.618</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.611.618</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.619.628">
    <title><![CDATA[Decision Based Development of Productline: A Quintessence Usability Approach]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.619.628</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.619.628">doi:10.3844/jcssp.2011.619.628</a></p>Problem statement: A well designed user interface is comprehensible and controllable,
helping users to complete their work successfully and efficiently and to feel competent and satisfied.
To improv...]]></content:encoded>
    <dc:title><![CDATA[Decision Based Development of Productline: A Quintessence Usability Approach]]></dc:title><dc:creator>R.V. Siva Balan</dc:creator><dc:creator>M.  Punithavalli</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.619.628</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.619.628</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.619.628</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.619.628</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.629.637">
    <title><![CDATA[Situation, Team and Role based Access Control]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.629.637</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.629.637">doi:10.3844/jcssp.2011.629.637</a></p>Problem statement: An emergency system of sharing and exchanging user’s personal information is demanded in medical treatment and disaster situations. Approach: In such a system, personal informatio...]]></content:encoded>
    <dc:title><![CDATA[Situation, Team and Role based Access Control]]></dc:title><dc:creator>Kyoji  Kawagoe</dc:creator><dc:creator>Keisuke  Kasai</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.629.637</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.629.637</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.629.637</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.629.637</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.638.643">
    <title><![CDATA[Performance Analysis of Global Search Algorithm Based Multiuser Detector for Multi Carrier Code Division Multiple Access System under Clipping Noise]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.638.643</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.638.643">doi:10.3844/jcssp.2011.638.643</a></p>Problem statement: Multi Carrier Code Division Multiple Access (MC-CDMA), a
promising technology for the 4G communication systems. The major limitation of MC-CDMA system
is the Multiple Access Inter...]]></content:encoded>
    <dc:title><![CDATA[Performance Analysis of Global Search Algorithm Based Multiuser Detector for Multi Carrier Code Division Multiple Access System under Clipping Noise]]></dc:title><dc:creator>S.  Sivanesskumar</dc:creator><dc:creator>R.  Sukanesh</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.638.643</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.638.643</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.638.643</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.638.643</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.644.650">
    <title><![CDATA[A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.644.650</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.644.650">doi:10.3844/jcssp.2011.644.650</a></p>Problem statement: String matching algorithm had been an essential means for searching
biological sequence database. With the constant expansion in scientific data such as DNA and Protein;
the devel...]]></content:encoded>
    <dc:title><![CDATA[A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms]]></dc:title><dc:creator>Abdulwahab Ali Almazroi</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.644.650</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.644.650</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.644.650</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.644.650</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.651.656">
    <title><![CDATA[Authentication Based and Optimized Routing Technique in Mobile Ad hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.651.656</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.651.656">doi:10.3844/jcssp.2011.651.656</a></p>Problem statement: An Ad hoc network has been defined as a self-organizing, dynamic topology
network formed by a group of wireless mobile nodes. Minimal configuration, absence of infrastructure and q...]]></content:encoded>
    <dc:title><![CDATA[Authentication Based and Optimized Routing Technique in Mobile Ad hoc Networks]]></dc:title><dc:creator>S.  Varadhaganapathy</dc:creator><dc:creator>A. M. Natarajan</dc:creator><dc:creator>S. N. Sivanandam</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.651.656</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.651.656</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.651.656</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.651.656</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.657.663">
    <title><![CDATA[A Novel Approach to Medical Image Segmentation]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.657.663</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.657.663">doi:10.3844/jcssp.2011.657.663</a></p>Problem statement: Segmentation is a vital aspect of medical imaging. It aids in the
visualization of medical data and diagnostics of various diseases. Ultrasound image segmentation, in
particular e...]]></content:encoded>
    <dc:title><![CDATA[A Novel Approach to Medical Image Segmentation]]></dc:title><dc:creator>Nandagopalan  Shanmugam</dc:creator><dc:creator>Adiga B. Suryanarayana</dc:creator><dc:creator>Sudarshan  TSB</dc:creator><dc:creator>Dhanalakshmi  Chandrashekar</dc:creator><dc:creator>Cholenally Nanjappa Manjunath</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.657.663</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.657.663</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.657.663</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.657.663</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.664.670">
    <title><![CDATA[Comparison between Vertex Merge Algorithm and Dsatur Algorithm]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.664.670</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.664.670">doi:10.3844/jcssp.2011.664.670</a></p>Problem statement: In this study, the channel allocation problem in direct sequence spread
spectrum was investigated. First, Coloring in channel allocation has been discussed in detail. Second; a
ne...]]></content:encoded>
    <dc:title><![CDATA[Comparison between Vertex Merge Algorithm and Dsatur Algorithm]]></dc:title><dc:creator>  Handrizal</dc:creator><dc:creator>A.  Noraziah</dc:creator><dc:creator>Ahmed N. Abdalla</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.664.670</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.664.670</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.664.670</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.664.670</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.671.677">
    <title><![CDATA[Design of Synthetic Optimizing Neuro Fuzzy Temperature Controller for Dual Screw Profile Plastic Extruder Using Labview]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.671.677</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.671.677">doi:10.3844/jcssp.2011.671.677</a></p>Problem statement: The temperature control in plastic extrusion machine is an important
factor to produce high quality plastic products. The first order temperature control system in plastic
extrusi...]]></content:encoded>
    <dc:title><![CDATA[Design of Synthetic Optimizing Neuro Fuzzy Temperature Controller for Dual Screw Profile Plastic Extruder Using Labview]]></dc:title><dc:creator>Ravi  Samikannu</dc:creator><dc:creator>Balakrishnan Anantharaman Poonamallie</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.671.677</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.671.677</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.671.677</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.671.677</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.678.682">
    <title><![CDATA[Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.678.682</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.678.682">doi:10.3844/jcssp.2011.678.682</a></p>Problem statement: An inherent feature of mobile ad hoc networks is the frequent change of
network topology leading to stability and reliability problems of the network. Highly dynamic and dense
net...]]></content:encoded>
    <dc:title><![CDATA[Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network]]></dc:title><dc:creator>V.  Balaji</dc:creator><dc:creator>V.  Duraisamy</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.678.682</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.678.682</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.678.682</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.678.682</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.683.689">
    <title><![CDATA[A Novel Technique for Web Log mining with Better Data Cleaning and Transaction Identification]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.683.689</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.683.689">doi:10.3844/jcssp.2011.683.689</a></p>Problem statement: In the internet era web sites on the internet are useful source of
information for almost every activity. So there is a rapid development of World Wide Web in its
volume of traffi...]]></content:encoded>
    <dc:title><![CDATA[A Novel Technique for Web Log mining with Better Data Cleaning and Transaction Identification]]></dc:title><dc:creator>J.  Vellingiri</dc:creator><dc:creator>S. Chenthur Pandian</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.683.689</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.683.689</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.683.689</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.683.689</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.690.697">
    <title><![CDATA[Structured Integration Test Suite Generation Process for Multi-Agent System]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.690.697</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.690.697">doi:10.3844/jcssp.2011.690.697</a></p>Problem statement: In recent years, Agent-Oriented Software Engineering (AOSE)
methodologies are proposed to develop complex distributed systems based upon the agent paradigm.
The implementation for...]]></content:encoded>
    <dc:title><![CDATA[Structured Integration Test Suite Generation Process for Multi-Agent System]]></dc:title><dc:creator>Zina  Houhamdi</dc:creator><dc:creator>Belkacem  Athamena</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.690.697</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.690.697</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.690.697</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.690.697</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.698.706">
    <title><![CDATA[Efficient Multimodal Biometric Authentication Using Fast Fingerprint Verification and Enhanced Iris Features]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.698.706</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.698.706">doi:10.3844/jcssp.2011.698.706</a></p>Problem statement: The accuracy of biometric systems varies with the kind of biometric
feature used in it. The Unmoral biometric system is prone to interclass variations. Approach: We
implement Mult...]]></content:encoded>
    <dc:title><![CDATA[Efficient Multimodal Biometric Authentication Using Fast Fingerprint Verification and Enhanced Iris Features]]></dc:title><dc:creator>A. Jameer Basha</dc:creator><dc:creator>V.  Palanisamy</dc:creator><dc:creator>T.  Purusothaman</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.698.706</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.698.706</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.698.706</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.698.706</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.707.714">
    <title><![CDATA[Feature Subset Selection for Hot Method Prediction using Genetic Algorithm wrapped with Support Vector Machines]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.707.714</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.707.714">doi:10.3844/jcssp.2011.707.714</a></p>Problem statement: All compilers have simple profiling-based heuristics to identify and
predict program hot methods and also to make optimization decisions. The major challenge in the
profile-based ...]]></content:encoded>
    <dc:title><![CDATA[Feature Subset Selection for Hot Method Prediction using Genetic Algorithm wrapped with Support Vector Machines]]></dc:title><dc:creator>Sandra  Johnson</dc:creator><dc:creator>Valli  Shanmugam</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.707.714</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.707.714</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.707.714</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.707.714</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.715.722">
    <title><![CDATA[Accurate Orthogonal Circular Moment Invariants of Gray-Level Images]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.715.722</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.715.722">doi:10.3844/jcssp.2011.715.722</a></p>Problem statement: Orthogonal circular moments of gray level images such as Zernike,
pseudo Zernike and Fourier-Mellin moments are widely used in different applications of image
processing, pattern ...]]></content:encoded>
    <dc:title><![CDATA[Accurate Orthogonal Circular Moment Invariants of Gray-Level Images]]></dc:title><dc:creator>Khalid Mohamed Hosny</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.715.722</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.715.722</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.715.722</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.715.722</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.723.730">
    <title><![CDATA[Misbehaving Node Detection in Mobile Ad Hoc Networks using Multi Hop Acknowledgement Scheme]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.723.730</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.723.730">doi:10.3844/jcssp.2011.723.730</a></p>Problem statement: For any node in a Mobile Ad hoc Network conservation of battery
power and bandwidth are the priority. Hence, they try to reduce the overload they would otherwise
incur when they f...]]></content:encoded>
    <dc:title><![CDATA[Misbehaving Node Detection in Mobile Ad Hoc Networks using Multi Hop Acknowledgement Scheme]]></dc:title><dc:creator>Usha  Sakthivel</dc:creator><dc:creator>S.  Radha</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.723.730</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.723.730</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.723.730</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.723.730</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.731.735">
    <title><![CDATA[Comparative Performance Evaluation of Routing Algorithms in IEEE 802.15.4 and IEEE 802.11 with Different Ad Hoc Routing Protocol]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.731.735</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.731.735">doi:10.3844/jcssp.2011.731.735</a></p>Problem statement: Wireless ADHOC networks are self organized dynamic networks can
share wireless channel without any established central control standard for IEEE 802.11. Approach:
The most common ...]]></content:encoded>
    <dc:title><![CDATA[Comparative Performance Evaluation of Routing Algorithms in IEEE 802.15.4 and IEEE 802.11 with Different Ad Hoc Routing Protocol]]></dc:title><dc:creator>P.  Anitha</dc:creator><dc:creator>C.  Chandrasekar</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.731.735</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.731.735</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.731.735</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.731.735</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.736.743">
    <title><![CDATA[Improved Vertex Chain Code Based Mapping Algorithm for Curve Length Estimation]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.736.743</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.736.743">doi:10.3844/jcssp.2011.736.743</a></p>Problem statement: Image representation has always been an important and interesting topic in
image processing and pattern recognition. However, curve tracing and its relative operations are the main...]]></content:encoded>
    <dc:title><![CDATA[Improved Vertex Chain Code Based Mapping Algorithm for Curve Length Estimation]]></dc:title><dc:creator>Habibollah  Haron</dc:creator><dc:creator>Amjad  Rehman</dc:creator><dc:creator>L.A.  Wulandhari</dc:creator><dc:creator>Tanzila  Saba</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.736.743</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.736.743</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.736.743</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.736.743</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.744.748">
    <title><![CDATA[OR-Bridging Fault Identification and Diagnosis for Exclusive-OR Sum of Products Reed-Muller Canonical Circuits]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.744.748</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.744.748">doi:10.3844/jcssp.2011.744.748</a></p>Problem statement: The faults in digital circuit can be classified broadly as single stuck-atfaults,
multiple stuck-ay-faults, stuck-open faults, stuck-on faults, path delay faults, transient faults....]]></content:encoded>
    <dc:title><![CDATA[OR-Bridging Fault Identification and Diagnosis for Exclusive-OR Sum of Products Reed-Muller Canonical Circuits]]></dc:title><dc:creator>V.  Geetha</dc:creator><dc:creator>N.  Devarajan</dc:creator><dc:creator>P. N. Neelakantan</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.744.748</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.744.748</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.744.748</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.744.748</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.749.756">
    <title><![CDATA[The Efficiency Measurement of Parallel Production Systems: A Non-radial Data Envelopment Analysis Model]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.749.756</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.749.756">doi:10.3844/jcssp.2011.749.756</a></p>Problem statement: Data Envelopment Analysis (DEA) is a non-parametric technique for
measuring the relative efficiency of a set of production systems or Decision Making Units (DMU) that
have multipl...]]></content:encoded>
    <dc:title><![CDATA[The Efficiency Measurement of Parallel Production Systems: A Non-radial Data Envelopment Analysis Model]]></dc:title><dc:creator>Ali  Ashrafi</dc:creator><dc:creator>Azmi Bin Jaafar</dc:creator><dc:creator>Mohd Rizam Abu Bakar</dc:creator><dc:creator>Lai Soon Lee</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.749.756</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.749.756</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.749.756</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.749.756</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.757.761">
    <title><![CDATA[Classifying Single Trail Electroencephalogram Using Gaussian Smoothened Fast Hartley Transform for Brain Computer Interface during Motor Imagery]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.757.761</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.757.761">doi:10.3844/jcssp.2011.757.761</a></p>Problem statement: Brain-Computer Interface (BCI) is a emerging research area which
translates the brain signals for any motor related actions into computer understandable signals by
capturing the s...]]></content:encoded>
    <dc:title><![CDATA[Classifying Single Trail Electroencephalogram Using Gaussian Smoothened Fast Hartley Transform for Brain Computer Interface during Motor Imagery]]></dc:title><dc:creator>V. B. Deepa</dc:creator><dc:creator>P.  Thangaraj</dc:creator><dc:creator>S.  Chitra</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.757.761</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.757.761</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.757.761</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.757.761</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.762.769">
    <title><![CDATA[Improving the Performance of Multivariate Bernoulli Model based Documents Clustering Algorithms using Transformation Techniques]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.762.769</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.762.769">doi:10.3844/jcssp.2011.762.769</a></p>Problem statement: Document clustering is the most important areas of data mining since
they are very much and currently the subject of significant global research since such areas strengthen
the en...]]></content:encoded>
    <dc:title><![CDATA[Improving the Performance of Multivariate Bernoulli Model based Documents Clustering Algorithms using Transformation Techniques]]></dc:title><dc:creator>Perumal  Pitchandi</dc:creator><dc:creator>Nedunchezhian  Raju</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.762.769</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.762.769</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.762.769</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.762.769</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.770.778">
    <title><![CDATA[Design Dynamic Coupling Measurement of Distributed Object Oriented Software Using Trace Events]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.770.778</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.770.778">doi:10.3844/jcssp.2011.770.778</a></p>Problem statement: A common way to define and measure coupling is through structural
properties and static code analysis. However, because of polymorphism, dynamic binding and the
common presence of...]]></content:encoded>
    <dc:title><![CDATA[Design Dynamic Coupling Measurement of Distributed Object Oriented Software Using Trace Events]]></dc:title><dc:creator>S.  Babu</dc:creator><dc:creator>R. M.S. Parvathi</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.770.778</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.770.778</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.770.778</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.770.778</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.779.784">
    <title><![CDATA[Cache Based Distributed Query Processing in Mobile Ad hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.779.784</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.779.784">doi:10.3844/jcssp.2011.779.784</a></p>Problem statement: In the last few years, the evolution of the mobile networks leads to the
query processing in mobile computing an impressive research area. The mobile computing technology
needs to...]]></content:encoded>
    <dc:title><![CDATA[Cache Based Distributed Query Processing in Mobile Ad hoc Networks]]></dc:title><dc:creator>T. P. Andamuthu</dc:creator><dc:creator>P.  Balasubramanie</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.779.784</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.779.784</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.779.784</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.779.784</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.785.789">
    <title><![CDATA[A Novel Enhancement Technique of the Hill Cipher for Effective Cryptographic Purposes]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.785.789</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.785.789">doi:10.3844/jcssp.2011.785.789</a></p>Problem statement: The Hill cipher is the first polygraph cipher which has a few advantages
in data encryption. However, it is vulnerable to known plaintext attack. Besides, an invertible key matrix...]]></content:encoded>
    <dc:title><![CDATA[A Novel Enhancement Technique of the Hill Cipher for Effective Cryptographic Purposes]]></dc:title><dc:creator>A. F.A. Abidin</dc:creator><dc:creator>O. Y. Chuan</dc:creator><dc:creator>M. R.K. Ariffin</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.785.789</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.785.789</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.785.789</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.785.789</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.790.799">
    <title><![CDATA[Applying Packet Generator for Secure Network Environment]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.790.799</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 7 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.790.799">doi:10.3844/jcssp.2011.790.799</a></p>Problem statement: Viruses and hacker attacks typically generate a recognizable pattern or “signature” of packets. Most of Network Traffic Analyzer can identify these packets and alert the adminis...]]></content:encoded>
    <dc:title><![CDATA[Applying Packet Generator for Secure Network Environment]]></dc:title><dc:creator>Mohammed N. Abdul Wahid</dc:creator><dc:creator>Zuriati Ahmed Zulkarnain</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.790.799</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-07; | doi:10.3844/jcssp.2011.790.799</dc:source>
    <dc:date>2011-05-07</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.790.799</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.790.799</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2011.800.820">
    <title><![CDATA[Feature Selection for High Dimensional Data: An Evolutionary Filter Approach]]></title>
    <link>https://thescipub.com/jcs/jcssp.2011.800.820</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 9 May 2011; <a href="https://thescipub.com/jcs/jcssp.2011.800.820">doi:10.3844/jcssp.2011.800.820</a></p>Problem statement: Feature selection is a task of crucial importance for the application of
machine learning in various domains. In addition, the recent increase of data dimensionality poses a
sever...]]></content:encoded>
    <dc:title><![CDATA[Feature Selection for High Dimensional Data: An Evolutionary Filter Approach]]></dc:title><dc:creator>Anwar Ali Yahya</dc:creator><dc:creator>Addin  Osman</dc:creator><dc:creator>Abd Rahman Ramli</dc:creator><dc:creator>Adlan  Balola</dc:creator><dc:identifier>doi:10.3844/jcssp.2011.800.820</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2011-05-09; | doi:10.3844/jcssp.2011.800.820</dc:source>
    <dc:date>2011-05-09</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2011.800.820</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2011.800.820</prism:url>
    </item></rdf:RDF>