<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-704.rss">
<title>Volume 10, Issue 7 (2014) | Journal of Computer Science</title>
<description>Volume 10, Issue 7 (2014) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/704</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.2014.1094.1106"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1107.1114"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1115.1119"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1120.1129"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1130.1134"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1135.1138"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1139.1150"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1151.1155"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1156.1165"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1166.1173"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1174.1185"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1186.1196"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1197.1206"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1207.1215"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1216.1221"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1222.1230"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1231.1237"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1238.1248"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1249.1252"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1253.1258"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1259.1268"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1269.1280"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1281.1290"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1291.1297"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1298.1306"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1307.1314"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1315.1323"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1324.1335"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1336.1343"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2014.1344.1354"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1094.1106">
    <title><![CDATA[HARDWARE REALIZATION OF HIGH SPEED ELLIPTIC CURVE POINT MULTIPLICATION USING PRECOMPUTATION OVER GF(P)]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1094.1106</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 4 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1094.1106">doi:10.3844/jcssp.2014.1094.1106</a></p>Two new theoretical approaches for the hardware realization of high speed elliptic curve point multiplication over a prime field (GF(p)) are presented. These hardware implementations use multiple unit...]]></content:encoded>
    <dc:title><![CDATA[HARDWARE REALIZATION OF HIGH SPEED ELLIPTIC CURVE POINT MULTIPLICATION USING PRECOMPUTATION OVER GF(P)]]></dc:title><dc:creator>N.  Shylashree</dc:creator><dc:creator>V.  Sridhar</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1094.1106</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-04; | doi:10.3844/jcssp.2014.1094.1106</dc:source>
    <dc:date>2014-02-04</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1094.1106</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1094.1106</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1107.1114">
    <title><![CDATA[SLOPE STABILITY ANALYSIS OF KALLAR-COONOOR HILL ROAD STRETCH OF THE NILGIRIS]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1107.1114</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 4 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1107.1114">doi:10.3844/jcssp.2014.1107.1114</a></p>The stability of slopes is always under severe threats in many parts of Western Ghats, especially in Kallar-Coonoor hill road stretch, causing disruption, loss of human life and economy. To minimize t...]]></content:encoded>
    <dc:title><![CDATA[SLOPE STABILITY ANALYSIS OF KALLAR-COONOOR HILL ROAD STRETCH OF THE NILGIRIS]]></dc:title><dc:creator>P.  Nalina</dc:creator><dc:creator>T.  Meenambal</dc:creator><dc:creator>R. Sathyanarayan Sridhar</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1107.1114</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-04; | doi:10.3844/jcssp.2014.1107.1114</dc:source>
    <dc:date>2014-02-04</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1107.1114</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1107.1114</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1115.1119">
    <title><![CDATA[GRAPHSJ 3: A MODERN DIDACTIC APPLICATION FOR GRAPH ALGORITHMS]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1115.1119</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 10 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1115.1119">doi:10.3844/jcssp.2014.1115.1119</a></p>In 2009 the authors developed an open source Java application and framework, GraphsJ, to help the students in their approach to the study of graph algorithms, by guiding them to understand their logic...]]></content:encoded>
    <dc:title><![CDATA[GRAPHSJ 3: A MODERN DIDACTIC APPLICATION FOR GRAPH ALGORITHMS]]></dc:title><dc:creator>Gianluca  Costa</dc:creator><dc:creator>Claudia  D’Ambrosio</dc:creator><dc:creator>Silvano  Martello</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1115.1119</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-10; | doi:10.3844/jcssp.2014.1115.1119</dc:source>
    <dc:date>2014-02-10</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1115.1119</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1115.1119</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1120.1129">
    <title><![CDATA[TRUSTWORTHY ENABLED RELIABLE COMMUNICATION ARCHITECTURE IN MOBILE AD HOC NETWORK]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1120.1129</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 12 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1120.1129">doi:10.3844/jcssp.2014.1120.1129</a></p>Ad hoc networks are widely used in military and other scientific area. There are various kind of routing protocols are available to establish the route, with the proper analyzation one can choose the ...]]></content:encoded>
    <dc:title><![CDATA[TRUSTWORTHY ENABLED RELIABLE COMMUNICATION ARCHITECTURE IN MOBILE AD HOC NETWORK]]></dc:title><dc:creator>Saravanan  Dhavamani</dc:creator><dc:creator>Chandarasekaran  Ramasamy</dc:creator><dc:creator>M. G. Sharavana Kumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1120.1129</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-12; | doi:10.3844/jcssp.2014.1120.1129</dc:source>
    <dc:date>2014-02-12</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1120.1129</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1120.1129</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1130.1134">
    <title><![CDATA[ALL OPTICAL IMPLEMENTATION OF HIGH SPEED AND LOW POWER REVERSIBLE FULL ADDER USING SEMICONDUCTOR OPTICAL AMPLIFIER BASED MACH-ZEHNDER INTERFEROMETER]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1130.1134</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 12 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1130.1134">doi:10.3844/jcssp.2014.1130.1134</a></p>In the recent years reversible logic design has promising applications in low power computing, optical computing, quantum computing. VLSI design mainly concentrates on low power logic circuit design. ...]]></content:encoded>
    <dc:title><![CDATA[ALL OPTICAL IMPLEMENTATION OF HIGH SPEED AND LOW POWER REVERSIBLE FULL ADDER USING SEMICONDUCTOR OPTICAL AMPLIFIER BASED MACH-ZEHNDER INTERFEROMETER]]></dc:title><dc:creator>R. M. Bommi</dc:creator><dc:creator>S. Selvakumar Raja</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1130.1134</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-12; | doi:10.3844/jcssp.2014.1130.1134</dc:source>
    <dc:date>2014-02-12</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1130.1134</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1130.1134</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1135.1138">
    <title><![CDATA[NOVEL REVERSIBLE VARIABLE PRECISION MULTIPLIER USING REVERSIBLE LOGIC GATES]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1135.1138</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 12 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1135.1138">doi:10.3844/jcssp.2014.1135.1138</a></p>Multipliers play a vital role in digital systems especially in digital processors. There are many algorithms and designs were proposed in the earlier works, but still there is a need and a greater int...]]></content:encoded>
    <dc:title><![CDATA[NOVEL REVERSIBLE VARIABLE PRECISION MULTIPLIER USING REVERSIBLE LOGIC GATES]]></dc:title><dc:creator>M.  Saravanan</dc:creator><dc:creator>K. Suresh Manic</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1135.1138</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-12; | doi:10.3844/jcssp.2014.1135.1138</dc:source>
    <dc:date>2014-02-12</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1135.1138</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1135.1138</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1139.1150">
    <title><![CDATA[HYPERPARAMETER SELECTION IN KERNEL PRINCIPAL COMPONENT ANALYSIS]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1139.1150</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 15 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1139.1150">doi:10.3844/jcssp.2014.1139.1150</a></p>In kernel methods, choosing a suitable kernel is indispensable for favorable results. No well-founded methods, however, have been established in general for unsupervised learning. We focus on kernel P...]]></content:encoded>
    <dc:title><![CDATA[HYPERPARAMETER SELECTION IN KERNEL PRINCIPAL COMPONENT ANALYSIS]]></dc:title><dc:creator>Md. Ashad Alam</dc:creator><dc:creator>Kenji  Fukumizu</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1139.1150</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-15; | doi:10.3844/jcssp.2014.1139.1150</dc:source>
    <dc:date>2014-02-15</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1139.1150</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1139.1150</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1151.1155">
    <title><![CDATA[ITERATIVE DICHOTOMISER-3 ALGORITHM IN DATA MINING APPLIED TO DIABETES DATABASE]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1151.1155</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 15 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1151.1155">doi:10.3844/jcssp.2014.1151.1155</a></p>In this study, eight major factors playing significant role in the Pima Indian population are analyzed. Real time data is taken from the large dataset of National Institute of Diabetes and Digestive a...]]></content:encoded>
    <dc:title><![CDATA[ITERATIVE DICHOTOMISER-3 ALGORITHM IN DATA MINING APPLIED TO DIABETES DATABASE]]></dc:title><dc:creator>P.  Vasudevan</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1151.1155</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-15; | doi:10.3844/jcssp.2014.1151.1155</dc:source>
    <dc:date>2014-02-15</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1151.1155</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1151.1155</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1156.1165">
    <title><![CDATA[A LOAD BALANCING MODEL USING FIREFLY ALGORITHM IN CLOUD COMPUTING]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1156.1165</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 15 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1156.1165">doi:10.3844/jcssp.2014.1156.1165</a></p>Cloud computing is a model that points at streamlining the on-demand provisioning of software, hardware and data as services and providing end-users with flexible and scalable services accessible thro...]]></content:encoded>
    <dc:title><![CDATA[A LOAD BALANCING MODEL USING FIREFLY ALGORITHM IN CLOUD COMPUTING]]></dc:title><dc:creator>A. Paulin Florence</dc:creator><dc:creator>V.  Shanthi</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1156.1165</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-15; | doi:10.3844/jcssp.2014.1156.1165</dc:source>
    <dc:date>2014-02-15</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1156.1165</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1156.1165</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1166.1173">
    <title><![CDATA[EXPLOITING SOCIAL TAGS TO OVERCOME COLD START RECOMMENDATION PROBLEM]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1166.1173</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 18 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1166.1173">doi:10.3844/jcssp.2014.1166.1173</a></p>The practice and method of collaboratively creating and managing tags to annotate and categorize content has resulted in the creation of folksonomy. Folksonomies provide new opportunities and challeng...]]></content:encoded>
    <dc:title><![CDATA[EXPLOITING SOCIAL TAGS TO OVERCOME COLD START RECOMMENDATION PROBLEM]]></dc:title><dc:creator>A. S. Ghabayen</dc:creator><dc:creator>Shahrul Azman Noah</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1166.1173</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-18; | doi:10.3844/jcssp.2014.1166.1173</dc:source>
    <dc:date>2014-02-18</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1166.1173</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1166.1173</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1174.1185">
    <title><![CDATA[TRUST BASED AUTOMATIC QUERY FORMULATION SEARCH ON EXPERT AND KNOWLEDGE USERS SYSTEMS]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1174.1185</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 18 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1174.1185">doi:10.3844/jcssp.2014.1174.1185</a></p>Due to enhance in complexity of services, there is a necessity for dynamic interaction models. For a service-oriented system to work properly, we need a context-sensitive trust based search. Automatic...]]></content:encoded>
    <dc:title><![CDATA[TRUST BASED AUTOMATIC QUERY FORMULATION SEARCH ON EXPERT AND KNOWLEDGE USERS SYSTEMS]]></dc:title><dc:creator>K.  Sridharan</dc:creator><dc:creator>M.  Chitra</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1174.1185</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-18; | doi:10.3844/jcssp.2014.1174.1185</dc:source>
    <dc:date>2014-02-18</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1174.1185</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1174.1185</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1186.1196">
    <title><![CDATA[AN EFFICIENT HYBRID ALGORITHM TO REDUCE LATENCY IN AD-HOC AGGREGATION]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1186.1196</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 18 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1186.1196">doi:10.3844/jcssp.2014.1186.1196</a></p>A data warehouse is a collection of data gathered and organized so that it can easily be analyzed, extracted, synthesized and also be used for the purpose of further understanding data. Peer to Peer n...]]></content:encoded>
    <dc:title><![CDATA[AN EFFICIENT HYBRID ALGORITHM TO REDUCE LATENCY IN AD-HOC AGGREGATION]]></dc:title><dc:creator>N.  Rajkumar</dc:creator><dc:creator>N. K. Senthil Kumar</dc:creator><dc:creator>P.  Subha</dc:creator><dc:creator>R.  Kavitha</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1186.1196</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-18; | doi:10.3844/jcssp.2014.1186.1196</dc:source>
    <dc:date>2014-02-18</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1186.1196</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1186.1196</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1197.1206">
    <title><![CDATA[COMPARATIVE STUDY OF K-MEANS AND K-MEANS++ CLUSTERING ALGORITHMS ON CRIME DOMAIN]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1197.1206</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 19 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1197.1206">doi:10.3844/jcssp.2014.1197.1206</a></p>This study presents the results of an experimental study of two document clustering techniques which are k-means and k-means++. In particular, we compare the two main approaches in crime document clus...]]></content:encoded>
    <dc:title><![CDATA[COMPARATIVE STUDY OF K-MEANS AND K-MEANS++ CLUSTERING ALGORITHMS ON CRIME DOMAIN]]></dc:title><dc:creator>Bashar  Aubaidan</dc:creator><dc:creator>Masnizah  Mohd</dc:creator><dc:creator>Mohammed  Albared</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1197.1206</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-19; | doi:10.3844/jcssp.2014.1197.1206</dc:source>
    <dc:date>2014-02-19</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1197.1206</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1197.1206</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1207.1215">
    <title><![CDATA[SECURE COMMUNICATION PROTOCOL FOR PROTECTING COMPUTATION RESULT OF FREE ROAMING MOBILE AGENT]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1207.1215</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 19 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1207.1215">doi:10.3844/jcssp.2014.1207.1215</a></p>Mobile agent plays an important role in developing applications of open, distributed and mixed environments, such as the internet. Mobile agent or mobile software agent is piece of software that can o...]]></content:encoded>
    <dc:title><![CDATA[SECURE COMMUNICATION PROTOCOL FOR PROTECTING COMPUTATION RESULT OF FREE ROAMING MOBILE AGENT]]></dc:title><dc:creator>G.  Geetha</dc:creator><dc:creator>C.  Jayakumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1207.1215</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-19; | doi:10.3844/jcssp.2014.1207.1215</dc:source>
    <dc:date>2014-02-19</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1207.1215</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1207.1215</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1216.1221">
    <title><![CDATA[DETECTION OF FLOOD ATTACKS IN DTN USING RATE LIMITER TECHNIQUE]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1216.1221</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 19 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1216.1221">doi:10.3844/jcssp.2014.1216.1221</a></p>Flood attacks means a network becomes so weighed down with packets, caused by the attackers. It prevents packets being sent/received between the nodes in the network. There are many methods adopted to...]]></content:encoded>
    <dc:title><![CDATA[DETECTION OF FLOOD ATTACKS IN DTN USING RATE LIMITER TECHNIQUE]]></dc:title><dc:creator>C.  Balamurugan</dc:creator><dc:creator>M.  Viswanathan</dc:creator><dc:creator>T. Abhishek Kumar</dc:creator><dc:creator>G. S. Raj</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1216.1221</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-19; | doi:10.3844/jcssp.2014.1216.1221</dc:source>
    <dc:date>2014-02-19</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1216.1221</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1216.1221</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1222.1230">
    <title><![CDATA[IMAGE ENCRYPTION BASED ON SINGULAR VALUE DECOMPOSITION]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1222.1230</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 19 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1222.1230">doi:10.3844/jcssp.2014.1222.1230</a></p>Image encryption is one of the most methods of information hiding. A novel secure encryption method for image encryption is presented in this study. The proposed algorithm based on using singular valu...]]></content:encoded>
    <dc:title><![CDATA[IMAGE ENCRYPTION BASED ON SINGULAR VALUE DECOMPOSITION]]></dc:title><dc:creator>Nidhal K. El Abbadi</dc:creator><dc:creator>Adil  Mohamad</dc:creator><dc:creator>Mohammed  Abdul-Hameed</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1222.1230</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-19; | doi:10.3844/jcssp.2014.1222.1230</dc:source>
    <dc:date>2014-02-19</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1222.1230</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1222.1230</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1231.1237">
    <title><![CDATA[AN INTELLIGENT RECOGNITION SYSTEM FOR IDENTIFICATION OF WOOD SPECIES]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1231.1237</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 19 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1231.1237">doi:10.3844/jcssp.2014.1231.1237</a></p>The recognition of wood species is needed is many areas like construction industry, furniture manufacturing, etc.,. The wood is traditionally classified by human experts. But human identification of w...]]></content:encoded>
    <dc:title><![CDATA[AN INTELLIGENT RECOGNITION SYSTEM FOR IDENTIFICATION OF WOOD SPECIES]]></dc:title><dc:creator>S.  Mohan</dc:creator><dc:creator>K.  Venkatachalapathy</dc:creator><dc:creator>P.  Sudhakar</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1231.1237</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-19; | doi:10.3844/jcssp.2014.1231.1237</dc:source>
    <dc:date>2014-02-19</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1231.1237</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1231.1237</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1238.1248">
    <title><![CDATA[ADAPTIVE I/O SWITCHING FOR SEAMLESS CONVERGENCE OF SMART PHONES AND EXTERNAL I/O DEVICES]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1238.1248</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 21 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1238.1248">doi:10.3844/jcssp.2014.1238.1248</a></p>To be small and easy to carry, mobile devices cannot be equipped with large and highly capable input/output devices. In order to overcome these limitations, this study proposes adaptive I/O switching ...]]></content:encoded>
    <dc:title><![CDATA[ADAPTIVE I/O SWITCHING FOR SEAMLESS CONVERGENCE OF SMART PHONES AND EXTERNAL I/O DEVICES]]></dc:title><dc:creator>Oh-Chul  Kwon</dc:creator><dc:creator>Jusung  Kim</dc:creator><dc:creator>Chang-Gun  Lee</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1238.1248</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-21; | doi:10.3844/jcssp.2014.1238.1248</dc:source>
    <dc:date>2014-02-21</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1238.1248</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1238.1248</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1249.1252">
    <title><![CDATA[STEGANOGRAPHY APPLICATION PROGRAM USING THE ID3V2 IN THE MP3 AUDIO FILE ON MOBILE PHONE]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1249.1252</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 21 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1249.1252">doi:10.3844/jcssp.2014.1249.1252</a></p>The MPEG Layer-III File or MP3 can contain the ID3v2 tag which able to store information not only the song and singer’s name but also song lyric and alblum cover figure. The steganography technique ...]]></content:encoded>
    <dc:title><![CDATA[STEGANOGRAPHY APPLICATION PROGRAM USING THE ID3V2 IN THE MP3 AUDIO FILE ON MOBILE PHONE]]></dc:title><dc:creator>Afan Galih Salman</dc:creator><dc:creator>  Rojali</dc:creator><dc:creator>Bayu  Kanigoro</dc:creator><dc:creator>  Nayoko</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1249.1252</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-21; | doi:10.3844/jcssp.2014.1249.1252</dc:source>
    <dc:date>2014-02-21</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1249.1252</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1249.1252</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1253.1258">
    <title><![CDATA[MEDICAL IMAGE SEGMENTATION FOR ANATOMICAL KNOWLEDGE EXTRACTION]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1253.1258</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 22 February 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1253.1258">doi:10.3844/jcssp.2014.1253.1258</a></p>Computed Tomography-Angiography (CTA) images of the abdomen, followed by precise segmentation and subsequent computation of shape based features of liver play an important role in hepatic surgery, pat...]]></content:encoded>
    <dc:title><![CDATA[MEDICAL IMAGE SEGMENTATION FOR ANATOMICAL KNOWLEDGE EXTRACTION]]></dc:title><dc:creator>Ms Maya Eapen</dc:creator><dc:creator>Reeba  Korah</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1253.1258</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-02-22; | doi:10.3844/jcssp.2014.1253.1258</dc:source>
    <dc:date>2014-02-22</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1253.1258</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1253.1258</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1259.1268">
    <title><![CDATA[DEVELOPMENT OF OBSTACLE AVOIDANCE TECHNIQUE IN WEB-BASED GEOGRAPHIC INFORMATION SYSTEM FOR TRAFFIC MANAGEMENT USING OPEN SOURCE SOFTWARE]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1259.1268</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 16 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1259.1268">doi:10.3844/jcssp.2014.1259.1268</a></p>The shortest path routing is one of the well-known network analysis techniques implemented in road management systems. Pg Routing as an extension of Postgre SQL/Post GIS database is an open source lib...]]></content:encoded>
    <dc:title><![CDATA[DEVELOPMENT OF OBSTACLE AVOIDANCE TECHNIQUE IN WEB-BASED GEOGRAPHIC INFORMATION SYSTEM FOR TRAFFIC MANAGEMENT USING OPEN SOURCE SOFTWARE]]></dc:title><dc:creator>Nik Mohd Ramli Nik Yusoff</dc:creator><dc:creator>Helmi Zulhaidi Mohd Shafri</dc:creator><dc:creator>Ratnasamy  Muniandy</dc:creator><dc:creator>Islam Mohammad Wali</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1259.1268</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-16; | doi:10.3844/jcssp.2014.1259.1268</dc:source>
    <dc:date>2014-06-16</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1259.1268</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1259.1268</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1269.1280">
    <title><![CDATA[CLUSTERING TWEETS USING CELLULAR GENETIC ALGORITHM]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1269.1280</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 16 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1269.1280">doi:10.3844/jcssp.2014.1269.1280</a></p>As the popularity of Twitter continues to increase rapidly, it is extremely necessary to analyze the huge amount of data that Twitter users generate. A popular method of tweet analysis is clustering. ...]]></content:encoded>
    <dc:title><![CDATA[CLUSTERING TWEETS USING CELLULAR GENETIC ALGORITHM]]></dc:title><dc:creator>Amr  Adel</dc:creator><dc:creator>Essam  ElFakharany</dc:creator><dc:creator>Amr  Badr</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1269.1280</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-16; | doi:10.3844/jcssp.2014.1269.1280</dc:source>
    <dc:date>2014-06-16</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1269.1280</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1269.1280</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1281.1290">
    <title><![CDATA[AN EFFICIENT AND VARIABLE INTERVAL REKEYING FOR DYNAMIC AD HOC MULTICAST GROUP USING KEY PATH REDUCTION]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1281.1290</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 16 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1281.1290">doi:10.3844/jcssp.2014.1281.1290</a></p>Key distribution is one of the major issues in secure ad hoc multicast group communication. There has been an extensive research on rekeying, to reduce cost. In this study, we propose an efficient and...]]></content:encoded>
    <dc:title><![CDATA[AN EFFICIENT AND VARIABLE INTERVAL REKEYING FOR DYNAMIC AD HOC MULTICAST GROUP USING KEY PATH REDUCTION]]></dc:title><dc:creator>R.  Pugalenthi</dc:creator><dc:creator>T. V. Gopal</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1281.1290</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-16; | doi:10.3844/jcssp.2014.1281.1290</dc:source>
    <dc:date>2014-06-16</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1281.1290</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1281.1290</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1291.1297">
    <title><![CDATA[A BIO-SURVEILLANCE SYSTEM USING EFFICIENT ALGORITHM FOR INFORMATION SHARING APPLICATIONS]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1291.1297</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1291.1297">doi:10.3844/jcssp.2014.1291.1297</a></p>Bio-Surveillance represents a health information system for public that stores and integrates health related information and data across a variety of data. Bio-surveillance strategies are projected fo...]]></content:encoded>
    <dc:title><![CDATA[A BIO-SURVEILLANCE SYSTEM USING EFFICIENT ALGORITHM FOR INFORMATION SHARING APPLICATIONS]]></dc:title><dc:creator>Shobhanjaly P. Nair</dc:creator><dc:creator>K.  Silambarasan</dc:creator><dc:creator>N.  Bindhu</dc:creator><dc:creator>R.  Srinivasan</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1291.1297</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1291.1297</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1291.1297</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1291.1297</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1298.1306">
    <title><![CDATA[DEPENDABILITY ATTRIBUTES FOR INCREASED SECURITY IN COMPONENT-BASED SOFTWARE DEVELOPMENT]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1298.1306</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1298.1306">doi:10.3844/jcssp.2014.1298.1306</a></p>Existing software applications become increasingly distributed as their continuity and lifetimes are lengthened; consequently, the users’ dependence on these applications is increased. The security ...]]></content:encoded>
    <dc:title><![CDATA[DEPENDABILITY ATTRIBUTES FOR INCREASED SECURITY IN COMPONENT-BASED SOFTWARE DEVELOPMENT]]></dc:title><dc:creator>Hasan  Kahtan</dc:creator><dc:creator>Nordin Abu Bakar</dc:creator><dc:creator>Rosmawati  Nordin</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1298.1306</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1298.1306</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1298.1306</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1298.1306</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1307.1314">
    <title><![CDATA[REMOVAL OF HIGH DENSITY IMPULSE NOISE USING MORPHOLOGICAL BASED ADAPTIVE UNSYMMETRICAL TRIMMED MID-POINT FILTER]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1307.1314</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1307.1314">doi:10.3844/jcssp.2014.1307.1314</a></p>A Morphological based Adaptive Unsymmetrical Trimmed Mid-Point Filter (MAUTMPF) for the restoration of gray scale images corrupted by salt and pepper noise for varying noise densities is proposed in t...]]></content:encoded>
    <dc:title><![CDATA[REMOVAL OF HIGH DENSITY IMPULSE NOISE USING MORPHOLOGICAL BASED ADAPTIVE UNSYMMETRICAL TRIMMED MID-POINT FILTER]]></dc:title><dc:creator>S.  Saravanakumar</dc:creator><dc:creator>A. Ebenezer Jeyakumar</dc:creator><dc:creator>K. N. Vijeyakumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1307.1314</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1307.1314</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1307.1314</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1307.1314</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1315.1323">
    <title><![CDATA[TRAFFIC CONTROLLED-DEDICATED SHORT RANGE COMMUNICATION: A SECURE COMMUNICATION USING TRAFFIC CONTROLLED DEDICATED SHORT RANGE COMMUNICATION MODEL IN VEHICULAR AD HOC NETWORKS FOR SAFETY RELATED SERVICES]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1315.1323</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1315.1323">doi:10.3844/jcssp.2014.1315.1323</a></p>To increase the road safety and secure communication among the vehicles in the network environment, Dedicated Short Range Communication (DSRC) is followed. Nowadays, research over DSRC is dramatically...]]></content:encoded>
    <dc:title><![CDATA[TRAFFIC CONTROLLED-DEDICATED SHORT RANGE COMMUNICATION: A SECURE COMMUNICATION USING TRAFFIC CONTROLLED DEDICATED SHORT RANGE COMMUNICATION MODEL IN VEHICULAR AD HOC NETWORKS FOR SAFETY RELATED SERVICES]]></dc:title><dc:creator>K.  Chandramohan</dc:creator><dc:creator>P.  Kamalakkannan</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1315.1323</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1315.1323</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1315.1323</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1315.1323</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1324.1335">
    <title><![CDATA[SUPER RESOLUTION FOR EGYPTSAT-1 IMAGES WITH ERRATIC SHIFT]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1324.1335</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1324.1335">doi:10.3844/jcssp.2014.1324.1335</a></p>The key point of the Super-Resolution (SR) process is the accurate registration of the low resolution images, i.e., accurate measuring of the fixed shift between them, to obtain high resolution image....]]></content:encoded>
    <dc:title><![CDATA[SUPER RESOLUTION FOR EGYPTSAT-1 IMAGES WITH ERRATIC SHIFT]]></dc:title><dc:creator>A. H. Nasr</dc:creator><dc:creator>Gh.S.  El-Tawel</dc:creator><dc:creator>A. K. Helmy</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1324.1335</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1324.1335</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1324.1335</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1324.1335</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1336.1343">
    <title><![CDATA[IMPROVING QUALITY OF SERVICE IN IP NETWORKS FOR MULTIMEDIA APPLICATIONS WITH OPTIMAL FRAGMENTATION]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1336.1343</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1336.1343">doi:10.3844/jcssp.2014.1336.1343</a></p>The tremendous increase of Internet users and the wide ranging need to support both multimedia traffic and other traffic leads to service differentiation schemes. Multimedia applications have uncompro...]]></content:encoded>
    <dc:title><![CDATA[IMPROVING QUALITY OF SERVICE IN IP NETWORKS FOR MULTIMEDIA APPLICATIONS WITH OPTIMAL FRAGMENTATION]]></dc:title><dc:creator>K. Sasi Kala Rani</dc:creator><dc:creator>J.  Suganthi</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1336.1343</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1336.1343</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1336.1343</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1336.1343</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2014.1344.1354">
    <title><![CDATA[ENHANCED ENCAPSULATED SECURITY PAYLOAD A NEW MECHANISM TO SECURE INTERNET PROTOCOL VERSION 6 OVER INTERNET PROTOCOL VERSION 4]]></title>
    <link>https://thescipub.com/jcs/jcssp.2014.1344.1354</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 17 June 2014; <a href="https://thescipub.com/jcs/jcssp.2014.1344.1354">doi:10.3844/jcssp.2014.1344.1354</a></p>A considerable amount of time will be needed before each system in the Internet can convert from Internet Protocol version 4 (IPv4) to Internet Protocol version 6 (IPv6). Three strategies have been pr...]]></content:encoded>
    <dc:title><![CDATA[ENHANCED ENCAPSULATED SECURITY PAYLOAD A NEW MECHANISM TO SECURE INTERNET PROTOCOL VERSION 6 OVER INTERNET PROTOCOL VERSION 4]]></dc:title><dc:creator>Rosilah  Hassan</dc:creator><dc:creator>Amjed Sid Ahmed</dc:creator><dc:creator>Nur Effendy Othman</dc:creator><dc:creator>Samer  Sami</dc:creator><dc:identifier>doi:10.3844/jcssp.2014.1344.1354</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2014-06-17; | doi:10.3844/jcssp.2014.1344.1354</dc:source>
    <dc:date>2014-06-17</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2014.1344.1354</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2014.1344.1354</prism:url>
    </item></rdf:RDF>