<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-300.rss">
<title>Volume 6, Issue 3 (2010) | Journal of Computer Science</title>
<description>Volume 6, Issue 3 (2010) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/300</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.2010.229.234"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.235.243"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.244.249"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.250.252"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.253.260"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.261.268"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.269.278"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.279.284"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.285.295"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.296.304"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.305.311"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.312.319"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.320.322"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.323.329"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.330.335"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.336.340"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.341.349"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.350.356"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.357.362"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.363.368"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2010.369.373"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2010.229.234">
    <title><![CDATA[A Framework for Group Key Management Protocol Assessment Independent of View Synchrony]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.229.234</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.229.234">doi:10.3844/jcssp.2010.229.234</a></p>Problem statement: As group key management extended into the area of large dynamic networks, complex issues emerged involving the many operations that run over several network topologies. The issues t...]]></content:encoded>
    <dc:title><![CDATA[A Framework for Group Key Management Protocol Assessment Independent of View Synchrony]]></dc:title><dc:creator>David  Manz</dc:creator><dc:creator>Paul  Oman</dc:creator><dc:creator>Jim  Alves-Foss</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.229.234</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.229.234</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.229.234</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.229.234</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.235.243">
    <title><![CDATA[Dropping down the Maximum Item Set: Improving the Stylometric Authorship Attribution Algorithm in the Text Mining for Authorship Investigation]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.235.243</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.235.243">doi:10.3844/jcssp.2010.235.243</a></p>Problem statement: Stylometric authorship attribution is an approach concerned about analyzing texts in text mining, e.g., novels and plays that famous authors wrote, trying to measure the authors sty...]]></content:encoded>
    <dc:title><![CDATA[Dropping down the Maximum Item Set: Improving the Stylometric Authorship Attribution Algorithm in the Text Mining for Authorship Investigation]]></dc:title><dc:creator>Tareef Kamil Mustafa</dc:creator><dc:creator>Norwati  Mustapha</dc:creator><dc:creator>Masrah Azrifah Azmi</dc:creator><dc:creator>Nasir B. Sulaiman</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.235.243</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.235.243</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.235.243</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.235.243</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.244.249">
    <title><![CDATA[A Cryptosystem Using the Concepts of Algebraic Geometric Code]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.244.249</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.244.249">doi:10.3844/jcssp.2010.244.249</a></p>Problem statement: Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes...]]></content:encoded>
    <dc:title><![CDATA[A Cryptosystem Using the Concepts of Algebraic Geometric Code]]></dc:title><dc:creator>K. V. Pramod</dc:creator><dc:creator>C.  Manju</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.244.249</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.244.249</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.244.249</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.244.249</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.250.252">
    <title><![CDATA[Development of a "Programmable Logic Controller Circuitry" For Optimal Power Distribution in a Manufacturing Industries ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.250.252</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.250.252">doi:10.3844/jcssp.2010.250.252</a></p>Problem statement: In industries the powder demand/consumption is fixed by the power supply agency. However, at times, the demand/Consumption may exceed the fixed level and will result in, the industr...]]></content:encoded>
    <dc:title><![CDATA[Development of a "Programmable Logic Controller Circuitry" For Optimal Power Distribution in a Manufacturing Industries ]]></dc:title><dc:creator>K.  Selvaraj</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.250.252</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.250.252</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.250.252</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.250.252</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.253.260">
    <title><![CDATA[UML Diagrams Generator: A New CASE Tool to Construct the Use-Case and Class Diagrams from an Event Table]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.253.260</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.253.260">doi:10.3844/jcssp.2010.253.260</a></p>Problem statement: Building UML diagrams is a very important and time consuming task for both requirements and design phases. However, some of these diagrams, such as use-case and class diagrams can b...]]></content:encoded>
    <dc:title><![CDATA[UML Diagrams Generator: A New CASE Tool to Construct the Use-Case and Class Diagrams from an Event Table]]></dc:title><dc:creator>Mohammad I. Muhairat</dc:creator><dc:creator>Rafa E. Al-Qutaish</dc:creator><dc:creator>Akram A. Abdelqader</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.253.260</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.253.260</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.253.260</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.253.260</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.261.268">
    <title><![CDATA[Design and Implementation of Parallel Subunit for Synthesis Mathematical Models]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.261.268</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.261.268">doi:10.3844/jcssp.2010.261.268</a></p>Problem statement: Mathematical modeling of different natural and technical objects and processes is one of the most important directions that needs high performance computing with huge memory. To red...]]></content:encoded>
    <dc:title><![CDATA[Design and Implementation of Parallel Subunit for Synthesis Mathematical Models]]></dc:title><dc:creator>Issa M. Shehabat</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.261.268</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.261.268</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.261.268</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.261.268</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.269.278">
    <title><![CDATA[Improving Triple Play Services Using Multi Protocol Label Switching Technology]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.269.278</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.269.278">doi:10.3844/jcssp.2010.269.278</a></p>Problem statement: Traditional IP networks have many limitations such as routing tables, which can be complex and time consuming. These limitations affect the performance of the network in some applic...]]></content:encoded>
    <dc:title><![CDATA[Improving Triple Play Services Using Multi Protocol Label Switching Technology]]></dc:title><dc:creator>Waheed  Yasin</dc:creator><dc:creator>Hamidah  Ibrahim</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.269.278</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.269.278</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.269.278</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.269.278</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.279.284">
    <title><![CDATA[Combinatorial Properties of Modified Chordal Rings Degree Four Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.279.284</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.279.284">doi:10.3844/jcssp.2010.279.284</a></p>Problem statement: Modified Chordal Rings Degree Four, called CHRm4 is the first modified structure of chordal rings. This CHRm4 is an undirected circulant graph and is a double loop graph. Approach: ...]]></content:encoded>
    <dc:title><![CDATA[Combinatorial Properties of Modified Chordal Rings Degree Four Networks]]></dc:title><dc:creator>R. N. Farah</dc:creator><dc:creator>M.  Othman</dc:creator><dc:creator>M. H. Selamat</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.279.284</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.279.284</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.279.284</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.279.284</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.285.295">
    <title><![CDATA[e-Learning Management System Using Service Oriented Architecture]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.285.295</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.285.295">doi:10.3844/jcssp.2010.285.295</a></p>Problem statement: Service Oriented Architecture (SOA) defines how to integrate widely disparate applications for a world that is Web based and uses multiple implementation platforms.  Using (SOA) one...]]></content:encoded>
    <dc:title><![CDATA[e-Learning Management System Using Service Oriented Architecture]]></dc:title><dc:creator>Mohammed A. Jabr</dc:creator><dc:creator>Hussein K. Al-Omari</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.285.295</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.285.295</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.285.295</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.285.295</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.296.304">
    <title><![CDATA[Memory Storage Issues of Temporal Database Applications on Relational Database Management Systems]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.296.304</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.296.304">doi:10.3844/jcssp.2010.296.304</a></p>Problem statement: Many existing database applications manage time-varying data. These database applications are referred to as temporal databases or time-oriented database applications that are consi...]]></content:encoded>
    <dc:title><![CDATA[Memory Storage Issues of Temporal Database Applications on Relational Database Management Systems]]></dc:title><dc:creator>Sami M. Halawani</dc:creator><dc:creator>Nashwan A. Al-Romema</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.296.304</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.296.304</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.296.304</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.296.304</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.305.311">
    <title><![CDATA[Off-Line Signature Authentication Based on Moment Invariants Using Support Vector Machine]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.305.311</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.305.311">doi:10.3844/jcssp.2010.305.311</a></p>Problem statement: The research addressed the computational load reduction in off-line signature verification based on minimal features using bayes classifier, fast Fourier transform, linear discrimin...]]></content:encoded>
    <dc:title><![CDATA[Off-Line Signature Authentication Based on Moment Invariants Using Support Vector Machine]]></dc:title><dc:creator>k. R. Radhika</dc:creator><dc:creator>M. K. Venkatesha</dc:creator><dc:creator>G. N. Sekhar</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.305.311</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.305.311</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.305.311</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.305.311</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.312.319">
    <title><![CDATA[Nodes Density and Broadcast Management in Heterogeneous Environments of Mobile Ad-Hoc Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.312.319</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.312.319">doi:10.3844/jcssp.2010.312.319</a></p>Problem statement: The research presented in this study looks into Mobile Ad-Hoc Networks (MANETs) environment that has varying node densities, called heterogeneous density environment. Such environme...]]></content:encoded>
    <dc:title><![CDATA[Nodes Density and Broadcast Management in Heterogeneous Environments of Mobile Ad-Hoc Networks]]></dc:title><dc:creator>Essam  Natsheh</dc:creator><dc:creator>Khalid  Buragga</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.312.319</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.312.319</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.312.319</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.312.319</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.320.322">
    <title><![CDATA[Stego Encrypted Message in Any Language for Network Communication Using Quadratic Method]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.320.322</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.320.322">doi:10.3844/jcssp.2010.320.322</a></p>Problem statement: Extensive use of digital media like text, images, audio and video on the internet generated a requirement for providing traffic security. For carrying out confidential communication...]]></content:encoded>
    <dc:title><![CDATA[Stego Encrypted Message in Any Language for Network Communication Using Quadratic Method]]></dc:title><dc:creator>Ahmed Ch. Shakir</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.320.322</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.320.322</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.320.322</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.320.322</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.323.329">
    <title><![CDATA[Improving Term Extraction Using Particle Swarm Optimization Techniques]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.323.329</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.323.329">doi:10.3844/jcssp.2010.323.329</a></p>Problem statement: Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatically. The purpose of th...]]></content:encoded>
    <dc:title><![CDATA[Improving Term Extraction Using Particle Swarm Optimization Techniques]]></dc:title><dc:creator>Mohammad  Syafrullah</dc:creator><dc:creator>Naomie  Salim</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.323.329</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.323.329</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.323.329</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.323.329</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.330.335">
    <title><![CDATA[Structural Modeling of Fundamental Frequency Contour for Thai Expressive Speech]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.330.335</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.330.335">doi:10.3844/jcssp.2010.330.335</a></p>Problem statement: Appropriate modeling of fundamental Frequency (F0) contour for speech is a key factor to preserve the quality of speech prosody. One successful approach has been conducted for tonal...]]></content:encoded>
    <dc:title><![CDATA[Structural Modeling of Fundamental Frequency Contour for Thai Expressive Speech]]></dc:title><dc:creator>Suphattharachai  Chomphan</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.330.335</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.330.335</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.330.335</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.330.335</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.336.340">
    <title><![CDATA[Object Based Middleware for Grid Computing]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.336.340</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.336.340">doi:10.3844/jcssp.2010.336.340</a></p>Problem statement: "Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications a...]]></content:encoded>
    <dc:title><![CDATA[Object Based Middleware for Grid Computing]]></dc:title><dc:creator>S.  Muruganantham</dc:creator><dc:creator>P. K. Srivastha</dc:creator><dc:creator>  Khanaa</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.336.340</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.336.340</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.336.340</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.336.340</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.341.349">
    <title><![CDATA[Comparative Evaluation of Phone Duration Models for Greek Emotional Speech]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.341.349</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.341.349">doi:10.3844/jcssp.2010.341.349</a></p>Problem statement: In this study we cope with the task of phone duration modeling for Greek emotional speech synthesis. Approach: Various well established machine learning techniques are applied for t...]]></content:encoded>
    <dc:title><![CDATA[Comparative Evaluation of Phone Duration Models for Greek Emotional Speech]]></dc:title><dc:creator>Alexandros  Lazaridis</dc:creator><dc:creator>Vasiliki  Bourna</dc:creator><dc:creator>Nikos  Fakotakis</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.341.349</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.341.349</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.341.349</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.341.349</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.350.356">
    <title><![CDATA[Machine Translation of Noun Phrases from Arabic to English Using Transfer-Based Approach]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.350.356</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.350.356">doi:10.3844/jcssp.2010.350.356</a></p>Problem statement: Any Arabic to English Machine Translation (MT) system should be capable of dealing with word order which Arabic exhibits. This poses a significant challenge to MT due to the vast nu...]]></content:encoded>
    <dc:title><![CDATA[Machine Translation of Noun Phrases from Arabic to English Using Transfer-Based Approach]]></dc:title><dc:creator>Omar  Shirko</dc:creator><dc:creator>Nazlia  Omar</dc:creator><dc:creator>Haslina  Arshad</dc:creator><dc:creator>Mohammed  Albared</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.350.356</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.350.356</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.350.356</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.350.356</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.357.362">
    <title><![CDATA[Cohesive Token Passing Algorithm Utilizing Software Agents]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.357.362</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.357.362">doi:10.3844/jcssp.2010.357.362</a></p>Problem statement: The communications domain has utilized the implementation of protocols for a wide spectrum of applications. This encompasses Medium Access Control (MAC) protocols. MAC protocols hav...]]></content:encoded>
    <dc:title><![CDATA[Cohesive Token Passing Algorithm Utilizing Software Agents]]></dc:title><dc:creator>A. Fua’ad Abdulrazzak</dc:creator><dc:creator>Shamala  Subramaniam</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.357.362</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.357.362</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.357.362</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.357.362</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.363.368">
    <title><![CDATA[Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data Points]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.363.368</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.363.368">doi:10.3844/jcssp.2010.363.368</a></p>Problem statement: Clustering is one of the most important research areas in the field of data mining. Clustering means creating groups of objects based on their features in such a way that the object...]]></content:encoded>
    <dc:title><![CDATA[Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data Points]]></dc:title><dc:creator>T.  Velmurugan</dc:creator><dc:creator>T.  Santhanam</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.363.368</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.363.368</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.363.368</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.363.368</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2010.369.373">
    <title><![CDATA[A Derivative-Free Optimization Method for Solving Classification Problem]]></title>
    <link>https://thescipub.com/jcs/jcssp.2010.369.373</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 March 2010; <a href="https://thescipub.com/jcs/jcssp.2010.369.373">doi:10.3844/jcssp.2010.369.373</a></p>Problem statement: The aim of data classification is to establish rules for the classification of some observations assuming that we have a database, which includes of at least two classes. There is a...]]></content:encoded>
    <dc:title><![CDATA[A Derivative-Free Optimization Method for Solving Classification Problem]]></dc:title><dc:creator>Parvaneh  Shabanzadeh</dc:creator><dc:creator>Malik Abu Hassan</dc:creator><dc:creator>Wah June Leong</dc:creator><dc:identifier>doi:10.3844/jcssp.2010.369.373</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2010-03-31; | doi:10.3844/jcssp.2010.369.373</dc:source>
    <dc:date>2010-03-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2010.369.373</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2010.369.373</prism:url>
    </item></rdf:RDF>