<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-506.rss">
<title>Volume 8, Issue 5 (2012) | Journal of Computer Science</title>
<description>Volume 8, Issue 5 (2012) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/506</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.2012.621.631"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.632.636"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.637.647"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.648.655"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.656.664"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.665.672"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.673.680"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.681.693"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.694.700"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.701.704"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.705.710"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.711.715"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.716.720"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.721.730"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.731.736"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.737.746"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.747.751"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.752.760"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.761.766"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.767.774"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.775.779"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.780.788"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.789.795"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.796.803"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.804.808"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2012.621.631">
    <title><![CDATA[A New Self-Adaptive Neuro Fuzzy Inference System for the Removal of  Non-Linear Artifacts from the Respiratory Signal]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.621.631</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 16 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.621.631">doi:10.3844/jcssp.2012.621.631</a></p>Problem statement: In this study, a new ANFIS-based adaptive filter is proposed to remove the non-linear artifacts from the respiratory signal measured using MEMS based accelerometer sensor. The data ...]]></content:encoded>
    <dc:title><![CDATA[A New Self-Adaptive Neuro Fuzzy Inference System for the Removal of  Non-Linear Artifacts from the Respiratory Signal]]></dc:title><dc:creator>A. Bhavani Sankar</dc:creator><dc:creator>D.  Kumar</dc:creator><dc:creator>K.  Seethalakshmi</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.621.631</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-16; | doi:10.3844/jcssp.2012.621.631</dc:source>
    <dc:date>2012-02-16</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.621.631</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.621.631</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.632.636">
    <title><![CDATA[Dynamic Approach to Defend Against Distributed Denial of Service Attacks Using an Adaptive Spin Lock Rate Control Mechanism]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.632.636</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.632.636">doi:10.3844/jcssp.2012.632.636</a></p>Problem statement: The last decade has seen many prominent Distributed Denial of Service (DDoS) attacks on high profile webservers. In this study, we deal with DDoS attacks by proposing a dynamic reac...]]></content:encoded>
    <dc:title><![CDATA[Dynamic Approach to Defend Against Distributed Denial of Service Attacks Using an Adaptive Spin Lock Rate Control Mechanism]]></dc:title><dc:creator>R.  Anurekha</dc:creator><dc:creator>K.  Duraiswamy</dc:creator><dc:creator>A.  Viswanathan</dc:creator><dc:creator>V. P. Arunachalam</dc:creator><dc:creator>K. Ganesh Kumar</dc:creator><dc:creator>A.  Rajivkannan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.632.636</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-17; | doi:10.3844/jcssp.2012.632.636</dc:source>
    <dc:date>2012-02-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.632.636</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.632.636</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.637.647">
    <title><![CDATA[Enhancing Security in E-Health Communications using Multi-Agent System]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.637.647</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.637.647">doi:10.3844/jcssp.2012.637.647</a></p>Problem statement: In this study, we address the security needs in online communications, specifically in the e-health domain. We focus on how to provide different security strengths to different type...]]></content:encoded>
    <dc:title><![CDATA[Enhancing Security in E-Health Communications using Multi-Agent System]]></dc:title><dc:creator>Rossilawati  Sulaiman</dc:creator><dc:creator>Dharmendra  Sharma</dc:creator><dc:creator>Wanli  Ma</dc:creator><dc:creator>Dat  Tran</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.637.647</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-17; | doi:10.3844/jcssp.2012.637.647</dc:source>
    <dc:date>2012-02-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.637.647</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.637.647</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.648.655">
    <title><![CDATA[Adaptive Multi-Path Routing for Load Balancing in Mobile Ad Hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.648.655</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 18 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.648.655">doi:10.3844/jcssp.2012.648.655</a></p>Problem statement: Load balancing and network congestion are the major problems in Mobile Ad-hoc Networks (MANET) routing. Most of the existing routing protocols provide solutions to load balancing or...]]></content:encoded>
    <dc:title><![CDATA[Adaptive Multi-Path Routing for Load Balancing in Mobile Ad Hoc Networks]]></dc:title><dc:creator>S.  Soundararajan</dc:creator><dc:creator>R. S. Bhuvaneswaran</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.648.655</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-18; | doi:10.3844/jcssp.2012.648.655</dc:source>
    <dc:date>2012-02-18</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.648.655</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.648.655</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.656.664">
    <title><![CDATA[A Density Based Dynamic Data Clustering Algorithm based on Incremental Dataset ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.656.664</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 20 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.656.664">doi:10.3844/jcssp.2012.656.664</a></p>Problem statement: Clustering and visualizing high-dimensional dynamic data is a challenging problem. Most of the existing clustering algorithms are based on the static statistical relationship among ...]]></content:encoded>
    <dc:title><![CDATA[A Density Based Dynamic Data Clustering Algorithm based on Incremental Dataset ]]></dc:title><dc:creator>S. Angel Latha Mary</dc:creator><dc:creator>K.R. Shankar Kumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.656.664</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-20; | doi:10.3844/jcssp.2012.656.664</dc:source>
    <dc:date>2012-02-20</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.656.664</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.656.664</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.665.672">
    <title><![CDATA[A Forager Bee's Intelligence Inspired Dynamic Queue Scheduling for the Internet Traffic]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.665.672</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 22 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.665.672">doi:10.3844/jcssp.2012.665.672</a></p>Problem statement: In the present evolution of large scale internet communication, per flow control scheme faces scalability issue due to tremendous number of flows. The aggregation based approaches s...]]></content:encoded>
    <dc:title><![CDATA[A Forager Bee's Intelligence Inspired Dynamic Queue Scheduling for the Internet Traffic]]></dc:title><dc:creator>Y.  Suresh</dc:creator><dc:creator>S.  Arumugam</dc:creator><dc:creator>M. A. Bhagyaveni</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.665.672</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-22; | doi:10.3844/jcssp.2012.665.672</dc:source>
    <dc:date>2012-02-22</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.665.672</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.665.672</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.673.680">
    <title><![CDATA[A Fault Tolerant Congestion Aware Routing Protocol for Mobile Adhoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.673.680</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 23 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.673.680">doi:10.3844/jcssp.2012.673.680</a></p>Problem statement: The performance of ad hoc routing protocols will significantly degrade when there are faulty nodes in the network. Packet losses and bandwidth degradation are caused due to congesti...]]></content:encoded>
    <dc:title><![CDATA[A Fault Tolerant Congestion Aware Routing Protocol for Mobile Adhoc Networks]]></dc:title><dc:creator>G.  Rajkumar</dc:creator><dc:creator>K.  Duraiswamy</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.673.680</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-23; | doi:10.3844/jcssp.2012.673.680</dc:source>
    <dc:date>2012-02-23</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.673.680</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.673.680</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.681.693">
    <title><![CDATA[Integration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange Crossover]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.681.693</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 24 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.681.693">doi:10.3844/jcssp.2012.681.693</a></p>Problem statement: The problem of scheduling n jobs on m machines with each job having specific machine  route has been researched over the decade. The Job Shop Scheduling (JSS) is one of the hardest ...]]></content:encoded>
    <dc:title><![CDATA[Integration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange Crossover]]></dc:title><dc:creator>R.  Thamilselvan</dc:creator><dc:creator>P.  Balasubramanie</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.681.693</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-24; | doi:10.3844/jcssp.2012.681.693</dc:source>
    <dc:date>2012-02-24</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.681.693</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.681.693</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.694.700">
    <title><![CDATA[Performance of Improved Directed Diffusion Protocol for Sensor Networks under Different Mobility Models]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.694.700</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 25 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.694.700">doi:10.3844/jcssp.2012.694.700</a></p>Problem statement: In sensor networks, some routing protocols performance differs under different mobility models. In ns2, there are two kinds of directed diffusion protocols, rate based gradient mech...]]></content:encoded>
    <dc:title><![CDATA[Performance of Improved Directed Diffusion Protocol for Sensor Networks under Different Mobility Models]]></dc:title><dc:creator>K. E. Kannammal</dc:creator><dc:creator>T.  Purusothaman</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.694.700</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-25; | doi:10.3844/jcssp.2012.694.700</dc:source>
    <dc:date>2012-02-25</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.694.700</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.694.700</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.701.704">
    <title><![CDATA[Features Extraction Based on Linear Regression Technique]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.701.704</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 25 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.701.704">doi:10.3844/jcssp.2012.701.704</a></p>Problem statement: The matching problem of complex objects is one of the most difficult task in the pattern recognition field. These problems are made difficult by seemingly infinite varieties of shap...]]></content:encoded>
    <dc:title><![CDATA[Features Extraction Based on Linear Regression Technique]]></dc:title><dc:creator>Khalid W. Magld</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.701.704</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-25; | doi:10.3844/jcssp.2012.701.704</dc:source>
    <dc:date>2012-02-25</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.701.704</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.701.704</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.705.710">
    <title><![CDATA[Parallel Memetic Algorithm for VLSI Circuit Partitioning Problem using Graphical Processing Units]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.705.710</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 27 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.705.710">doi:10.3844/jcssp.2012.705.710</a></p>Problem statement: Memetic Algorithm (MA) is a form of population-based hybrid Genetic Algorithm (GA) coupled with an individual learning procedure capable of performing local refinements. Here we use...]]></content:encoded>
    <dc:title><![CDATA[Parallel Memetic Algorithm for VLSI Circuit Partitioning Problem using Graphical Processing Units]]></dc:title><dc:creator>P.  Subbaraj</dc:creator><dc:creator>P.  Sivakumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.705.710</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-27; | doi:10.3844/jcssp.2012.705.710</dc:source>
    <dc:date>2012-02-27</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.705.710</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.705.710</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.711.715">
    <title><![CDATA[The Best Candidates Method for Solving Optimization Problems]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.711.715</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 27 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.711.715">doi:10.3844/jcssp.2012.711.715</a></p>Problem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the opti...]]></content:encoded>
    <dc:title><![CDATA[The Best Candidates Method for Solving Optimization Problems]]></dc:title><dc:creator>Hlayel Abdallah Ahmad</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.711.715</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-27; | doi:10.3844/jcssp.2012.711.715</dc:source>
    <dc:date>2012-02-27</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.711.715</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.711.715</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.716.720">
    <title><![CDATA[Segmentation of Ureteric and Bladder Calculi in Ultrasound Images]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.716.720</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 27 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.716.720">doi:10.3844/jcssp.2012.716.720</a></p>Problem statement: The framework for segmenting calculi in ureter and bladder using ultrasound images is proposed in this study. Calculi are due to abnormal collection of certain chemicals like oxalat...]]></content:encoded>
    <dc:title><![CDATA[Segmentation of Ureteric and Bladder Calculi in Ultrasound Images]]></dc:title><dc:creator>S.  Sridhar</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.716.720</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-27; | doi:10.3844/jcssp.2012.716.720</dc:source>
    <dc:date>2012-02-27</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.716.720</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.716.720</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.721.730">
    <title><![CDATA[Efficient Broadcasting in Mobile Ad Hoc Networks Using Context Aware Adaptive Routing Protocol during Network Partitions]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.721.730</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.721.730">doi:10.3844/jcssp.2012.721.730</a></p>Problem statement: In mobile ado network, broadcasting is a common operation for route establishment and for sending control and emergency messages. Reliable Broadcasting in mobile ad hoc networks req...]]></content:encoded>
    <dc:title><![CDATA[Efficient Broadcasting in Mobile Ad Hoc Networks Using Context Aware Adaptive Routing Protocol during Network Partitions]]></dc:title><dc:creator>S. V.M.G. Bavithiraja</dc:creator><dc:creator>R.  Radhakrishnan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.721.730</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-28; | doi:10.3844/jcssp.2012.721.730</dc:source>
    <dc:date>2012-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.721.730</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.721.730</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.731.736">
    <title><![CDATA[A Survey on Joint Compression and Encryption Techniques for Video Data]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.731.736</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 28 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.731.736">doi:10.3844/jcssp.2012.731.736</a></p>Problem statement: When we send any video data over the network it consumes more time. This is due to the huge size of the video file when compared to text file. Therefore, video data should be compre...]]></content:encoded>
    <dc:title><![CDATA[A Survey on Joint Compression and Encryption Techniques for Video Data]]></dc:title><dc:creator>K. John Singh</dc:creator><dc:creator>R.  Manimegalai</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.731.736</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-28; | doi:10.3844/jcssp.2012.731.736</dc:source>
    <dc:date>2012-02-28</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.731.736</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.731.736</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.737.746">
    <title><![CDATA[Implementation of a Novel Control Strategy Using Fuzzy Logic Controller to Shunt Active Filter for Line Harmonic Reduction]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.737.746</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 29 February 2012; <a href="https://thescipub.com/jcs/jcssp.2012.737.746">doi:10.3844/jcssp.2012.737.746</a></p>Problem statement: Now days, power quality has been given attention due to the intensive use of power electronic equipments in all types of industries such as steel, paper, textile industries and so o...]]></content:encoded>
    <dc:title><![CDATA[Implementation of a Novel Control Strategy Using Fuzzy Logic Controller to Shunt Active Filter for Line Harmonic Reduction]]></dc:title><dc:creator>N.  Senthilnathan</dc:creator><dc:creator>T.  Manigandan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.737.746</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-02-29; | doi:10.3844/jcssp.2012.737.746</dc:source>
    <dc:date>2012-02-29</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.737.746</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.737.746</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.747.751">
    <title><![CDATA[Medical Image Compression with Lossless Region of Interest Using Adaptive Active Contour]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.747.751</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 1 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.747.751">doi:10.3844/jcssp.2012.747.751</a></p>Problem statement: With increasing bandwidth, digital medical image storage and transmission is a boon to patients and health professionals alike. Medical images are available instantly and avoid the ...]]></content:encoded>
    <dc:title><![CDATA[Medical Image Compression with Lossless Region of Interest Using Adaptive Active Contour]]></dc:title><dc:creator>R.  Loganathan</dc:creator><dc:creator>Y. S. Kumaraswamy</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.747.751</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-01; | doi:10.3844/jcssp.2012.747.751</dc:source>
    <dc:date>2012-03-01</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.747.751</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.747.751</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.752.760">
    <title><![CDATA[The Impact of Radio Propagation Models on Ad Hoc Networks Performances]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.752.760</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 2 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.752.760">doi:10.3844/jcssp.2012.752.760</a></p>Problem statement: Wireless networks are characterized by a dynamic topology triggered by the nodes mobility. Thus, the wireless multi-hops connection and the channel do not have determinist behaviour...]]></content:encoded>
    <dc:title><![CDATA[The Impact of Radio Propagation Models on Ad Hoc Networks Performances]]></dc:title><dc:creator>A.  Rhattoy</dc:creator><dc:creator>A.  Zatni</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.752.760</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-02; | doi:10.3844/jcssp.2012.752.760</dc:source>
    <dc:date>2012-03-02</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.752.760</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.752.760</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.761.766">
    <title><![CDATA[Realization of Fault Tolerant Routing Protocol for Zigbee]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.761.766</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 2 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.761.766">doi:10.3844/jcssp.2012.761.766</a></p>Problem statement: Increased use of handheld devices and sensor devices pose problems in existing routing protocols. The performance of the existing routing protocols deteriorates very much on these d...]]></content:encoded>
    <dc:title><![CDATA[Realization of Fault Tolerant Routing Protocol for Zigbee]]></dc:title><dc:creator>Sharmila  Sankar</dc:creator><dc:creator>  Sankaranarayanan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.761.766</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-02; | doi:10.3844/jcssp.2012.761.766</dc:source>
    <dc:date>2012-03-02</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.761.766</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.761.766</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.767.774">
    <title><![CDATA[A New Hybrid Approach for Heterogeneous Radio Access Technology Selection]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.767.774</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 2 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.767.774">doi:10.3844/jcssp.2012.767.774</a></p>Problem statement: The Next generation wireless networks are heterogeneous in nature where different Radio Access Technologies (RAT) coexists in the same coverage area. The user terminal should be abl...]]></content:encoded>
    <dc:title><![CDATA[A New Hybrid Approach for Heterogeneous Radio Access Technology Selection]]></dc:title><dc:creator>J.  Preethi</dc:creator><dc:creator>S.  Palaniswami</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.767.774</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-02; | doi:10.3844/jcssp.2012.767.774</dc:source>
    <dc:date>2012-03-02</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.767.774</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.767.774</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.775.779">
    <title><![CDATA[An Efficient Method for Contrast Enhancement in Still Images using Histogram Modification Framework]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.775.779</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 2 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.775.779">doi:10.3844/jcssp.2012.775.779</a></p>Problem statement: Image enhancement improves an image appearance by increasing dominance of some features or by decreasing ambiguity between different regions of the image. Histogram based image enha...]]></content:encoded>
    <dc:title><![CDATA[An Efficient Method for Contrast Enhancement in Still Images using Histogram Modification Framework]]></dc:title><dc:creator>C. G. Ravichandran</dc:creator><dc:creator>V.  Magudeeswaran</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.775.779</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-02; | doi:10.3844/jcssp.2012.775.779</dc:source>
    <dc:date>2012-03-02</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.775.779</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.775.779</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.780.788">
    <title><![CDATA[A Dynamic Resource Allocation Method for Parallel DataProcessing in Cloud Computing]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.780.788</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 1 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.780.788">doi:10.3844/jcssp.2012.780.788</a></p>Problem statement: One of the Cloud Services, Infrastructure as a Service (IaaS) provides a Compute resourses for demand in various applications like Parallel Data processing. The computer resources o...]]></content:encoded>
    <dc:title><![CDATA[A Dynamic Resource Allocation Method for Parallel DataProcessing in Cloud Computing]]></dc:title><dc:creator>V. Venkatesa Kumar</dc:creator><dc:creator>S.  Palaniswami</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.780.788</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-01; | doi:10.3844/jcssp.2012.780.788</dc:source>
    <dc:date>2012-03-01</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.780.788</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.780.788</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.789.795">
    <title><![CDATA[Performance Analysis of Multi Spectral Band Image Compression using Discrete Wavelet Transform]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.789.795</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 6 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.789.795">doi:10.3844/jcssp.2012.789.795</a></p>Problem statement: Efficient and effective utilization of transmission bandwidth and storage capacity have been a core area of research for remote sensing images. Hence image compression is required f...]]></content:encoded>
    <dc:title><![CDATA[Performance Analysis of Multi Spectral Band Image Compression using Discrete Wavelet Transform]]></dc:title><dc:creator>R.  Kousalyadevi</dc:creator><dc:creator>S. S. Ramakrishnan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.789.795</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-06; | doi:10.3844/jcssp.2012.789.795</dc:source>
    <dc:date>2012-03-06</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.789.795</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.789.795</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.796.803">
    <title><![CDATA[Intelligent Semantic Universal Search in Mobile Platform]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.796.803</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 9 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.796.803">doi:10.3844/jcssp.2012.796.803</a></p>Problem statement: As the performance of mobile devices is getting higher, a large quantity of information is stored and managed in mobile devices. Therefore, the precise and intelligent universal sea...]]></content:encoded>
    <dc:title><![CDATA[Intelligent Semantic Universal Search in Mobile Platform]]></dc:title><dc:creator>Jinhyung  Kim</dc:creator><dc:creator>Myunggwon  Hwang</dc:creator><dc:creator>Hanmin  Jung</dc:creator><dc:creator>Doheon  Jung</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.796.803</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-09; | doi:10.3844/jcssp.2012.796.803</dc:source>
    <dc:date>2012-03-09</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.796.803</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.796.803</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.804.808">
    <title><![CDATA[Normalized Web Distance Based Web Query Classification]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.804.808</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 9 March 2012; <a href="https://thescipub.com/jcs/jcssp.2012.804.808">doi:10.3844/jcssp.2012.804.808</a></p>Problem statement: The problem is to classify a given web query to a set of 67 target categories. The target categories are ranked based on the degree of similarity to a given query. Approach: The fea...]]></content:encoded>
    <dc:title><![CDATA[Normalized Web Distance Based Web Query Classification]]></dc:title><dc:creator>S. Lovelyn Rose</dc:creator><dc:creator>K. R. Chandran</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.804.808</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-03-09; | doi:10.3844/jcssp.2012.804.808</dc:source>
    <dc:date>2012-03-09</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.804.808</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.804.808</prism:url>
    </item></rdf:RDF>