<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-263.rss">
<title>Volume 3, Issue 1 (2007) | Journal of Computer Science</title>
<description>Volume 3, Issue 1 (2007) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/263</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.2007.1.8"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.9.13"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.14.24"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.25.27"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.28.34"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.35.42"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.43.46"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.47.50"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.51.56"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2007.57.61"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2007.1.8">
    <title><![CDATA[Deterministic Timed AFA: A New Class of Timed Alternating Finite Automata]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.1.8</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.1.8">doi:10.3844/jcssp.2007.1.8</a></p>Timed Alternating Finite Automata (TAFA), a natural generalization of Timed Finite Automata (TFA), are synchronous and powerful models for real-time computations. They become an effective and expressi...]]></content:encoded>
    <dc:title><![CDATA[Deterministic Timed AFA: A New Class of Timed Alternating Finite Automata]]></dc:title><dc:creator>Abdelaziz  Fellah</dc:creator><dc:creator>Zachary  Friggstad</dc:creator><dc:creator>Soufiane  Noureddine</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.1.8</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.1.8</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.1.8</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.1.8</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.9.13">
    <title><![CDATA[Packed Forest Chart Parser]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.9.13</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.9.13">doi:10.3844/jcssp.2007.9.13</a></p>Packed forest chart parser, like the traditional chart parsing algorithm, uses charts to store all the information produced while parsing to avoid redundant works. Its advantage over the traditional c...]]></content:encoded>
    <dc:title><![CDATA[Packed Forest Chart Parser]]></dc:title><dc:creator>Qi  Haoliang</dc:creator><dc:creator>Li  Sheng</dc:creator><dc:creator>Yang  Muyun</dc:creator><dc:creator>Zhao  Tiejun</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.9.13</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.9.13</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.9.13</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.9.13</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.14.24">
    <title><![CDATA[A Framework for Distributed Dynamic Load Balancing in Heterogeneous Cluster]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.14.24</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.14.24">doi:10.3844/jcssp.2007.14.24</a></p>Distributed Dynamic load balancing (DDLB) is an important system function destined to distribute workload among available processors to improve throughput and/or execution times of parallel computer i...]]></content:encoded>
    <dc:title><![CDATA[A Framework for Distributed Dynamic Load Balancing in Heterogeneous Cluster]]></dc:title><dc:creator>Neeraj  Nehra</dc:creator><dc:creator>R. B. Patel</dc:creator><dc:creator>V. K. Bhat</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.14.24</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.14.24</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.14.24</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.14.24</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.25.27">
    <title><![CDATA[Lossless Compression Using LFSRs]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.25.27</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.25.27">doi:10.3844/jcssp.2007.25.27</a></p>While lossy compression techniques are used for images, sound. where feature reproduction is more important than the actual data, it is necessary to use lossless compression for certain files containi...]]></content:encoded>
    <dc:title><![CDATA[Lossless Compression Using LFSRs]]></dc:title><dc:creator>R.  Muthiah</dc:creator><dc:creator>K.  Neelakantan</dc:creator><dc:creator>Somi  Sebastian</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.25.27</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.25.27</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.25.27</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.25.27</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.28.34">
    <title><![CDATA[Formal Analysis of Fault-tolerant Algorithm in the Time-triggered Architecture ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.28.34</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.28.34">doi:10.3844/jcssp.2007.28.34</a></p>Time-Triggered architecture (TTA) provides a computing infrastructure for the design and implementation of dependable distributed systems. The core building block of the TTA is the communication proto...]]></content:encoded>
    <dc:title><![CDATA[Formal Analysis of Fault-tolerant Algorithm in the Time-triggered Architecture ]]></dc:title><dc:creator>Aliouat  Zibouda</dc:creator><dc:creator>Aliouat  Makhlouf</dc:creator><dc:creator>Batouche  Chawki</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.28.34</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.28.34</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.28.34</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.28.34</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.35.42">
    <title><![CDATA[A Secure Protocol Based on a Sedentary Agent for Mobile Agent Environments]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.35.42</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.35.42">doi:10.3844/jcssp.2007.35.42</a></p>The main challenge when deploying mobile agent environments pertains to security issues concerning mobile agents and their executive platform. This paper proposes a secure protocol which protects mobi...]]></content:encoded>
    <dc:title><![CDATA[A Secure Protocol Based on a Sedentary Agent for Mobile Agent Environments]]></dc:title><dc:creator>Abdelmorhit E. Rhazi</dc:creator><dc:creator>Samuel  Pierre</dc:creator><dc:creator>Hanifa  Boucheneb</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.35.42</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.35.42</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.35.42</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.35.42</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.43.46">
    <title><![CDATA[Towards an Exclusion Mutual Tolerant Algorithm to Failures]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.43.46</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.43.46">doi:10.3844/jcssp.2007.43.46</a></p>The distributed algorithmic is widely used in various economic and industrial fields as finance, medical, industry, telecommunication. New technologies are increasing rapidly. From now on, application...]]></content:encoded>
    <dc:title><![CDATA[Towards an Exclusion Mutual Tolerant Algorithm to Failures]]></dc:title><dc:creator>M.  Senouci</dc:creator><dc:creator>A.  Liazid</dc:creator><dc:creator>D.  Benhamamouch</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.43.46</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.43.46</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.43.46</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.43.46</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.47.50">
    <title><![CDATA[Exploring Strategies for Parallel Computing of RS Data Assimilation with SWAP-GA]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.47.50</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.47.50">doi:10.3844/jcssp.2007.47.50</a></p>An agro-hydrological simulation model is useful for agriculture monitoring. One issue in running such model is parameter identification, especially when the target area is large such as provincial or ...]]></content:encoded>
    <dc:title><![CDATA[Exploring Strategies for Parallel Computing of RS Data Assimilation with SWAP-GA]]></dc:title><dc:creator>Shamim  Akhter</dc:creator><dc:creator>Kiyoshi  Honda</dc:creator><dc:creator>Yann  Chemin</dc:creator><dc:creator>Putchong  Uthayopas</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.47.50</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.47.50</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.47.50</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.47.50</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.51.56">
    <title><![CDATA[Free Vibration Analysis of a Cross-Ply Laminated Composite Beam on Pasternak Foundation ]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.51.56</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.51.56">doi:10.3844/jcssp.2007.51.56</a></p>In this study, free vibration analysis of a cross-ply laminated composite beam (LCB) on Pasternak foundation was investigated. Natural frequencies of beam on Pasternak foundation are computed using fi...]]></content:encoded>
    <dc:title><![CDATA[Free Vibration Analysis of a Cross-Ply Laminated Composite Beam on Pasternak Foundation ]]></dc:title><dc:creator>R. A. Jafari-Talookolaei</dc:creator><dc:creator>M. T. Ahmadian</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.51.56</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.51.56</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.51.56</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.51.56</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2007.57.61">
    <title><![CDATA[Distributed Shared Memory Consistency Object-based Model]]></title>
    <link>https://thescipub.com/jcs/jcssp.2007.57.61</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 31 January 2007; <a href="https://thescipub.com/jcs/jcssp.2007.57.61">doi:10.3844/jcssp.2007.57.61</a></p>A novel model that describes consistency in shared memory was developed, presented and discussed. The new object-based model handles errors of inaccuracy and misrepresentation in distributed shared me...]]></content:encoded>
    <dc:title><![CDATA[Distributed Shared Memory Consistency Object-based Model]]></dc:title><dc:creator>Abdelfatah A. Yahya</dc:creator><dc:creator>Rana M.I. Bader</dc:creator><dc:identifier>doi:10.3844/jcssp.2007.57.61</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2007-01-31; | doi:10.3844/jcssp.2007.57.61</dc:source>
    <dc:date>2007-01-31</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2007.57.61</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2007.57.61</prism:url>
    </item></rdf:RDF>