<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-561.rss">
<title>Volume 8, Issue 12 (2012) | Journal of Computer Science</title>
<description>Volume 8, Issue 12 (2012) | Journal of Computer Science</description>
<link>https://thescipub.com/jcs/issue/561</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.1940.1945"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1946.1956"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1957.1960"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1961.1969"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1970.1978"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1979.1986"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1987.1995"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.1996.2007"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2008.2016"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2017.2024"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2025.2031"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2032.2041"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2042.2052"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2053.2061"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2062.2067"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2068.2074"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2075.2082"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2083.2097"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2098.2105"/><rdf:li rdf:resource="https://thescipub.com/jcs/jcssp.2012.2106.2111"/></rdf:Seq>
</items>
</channel><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1940.1945">
    <title><![CDATA[A Novel Multidictionary Based Text Compression]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1940.1945</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 8 November 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1940.1945">doi:10.3844/jcssp.2012.1940.1945</a></p>The amount of digital contents grows at a faster speed as a result does the demand for communicate them. On the other hand, the amount of storage and bandwidth increases at a slower rate. Thus powerfu...]]></content:encoded>
    <dc:title><![CDATA[A Novel Multidictionary Based Text Compression]]></dc:title><dc:creator>M. Baritha Begum</dc:creator><dc:creator>Y.  Venkataramani</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1940.1945</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-11-08; | doi:10.3844/jcssp.2012.1940.1945</dc:source>
    <dc:date>2012-11-08</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1940.1945</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1940.1945</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1946.1956">
    <title><![CDATA[Fuzzy Based Dynamic Buffer Management in Wimax 16m Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1946.1956</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 8 November 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1946.1956">doi:10.3844/jcssp.2012.1946.1956</a></p>In WiMAX 16m networks, buffer allocation is the major problem to be handled for offering Quality of Service (QoS). The lack of buffers increases the packet loss and queuing delay. In this study we pro...]]></content:encoded>
    <dc:title><![CDATA[Fuzzy Based Dynamic Buffer Management in Wimax 16m Networks]]></dc:title><dc:creator>D.  Karunkuzhali</dc:creator><dc:creator>Dinesh Chandra Tomar</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1946.1956</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-11-08; | doi:10.3844/jcssp.2012.1946.1956</dc:source>
    <dc:date>2012-11-08</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1946.1956</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1946.1956</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1957.1960">
    <title><![CDATA[Novel Preprocessing Technique in the Computer Aided Detection of Breast Cancer]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1957.1960</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 8 November 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1957.1960">doi:10.3844/jcssp.2012.1957.1960</a></p>Analyzing medical images is the most challenging task in medical image processing. Computer Aided Detection (CAD) tool is the aid for the radiologists in analyzing such images for the effective detect...]]></content:encoded>
    <dc:title><![CDATA[Novel Preprocessing Technique in the Computer Aided Detection of Breast Cancer]]></dc:title><dc:creator>Senthilkumar  Balasubramaniam</dc:creator><dc:creator>Umamaheswari  Govindaswamy</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1957.1960</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-11-08; | doi:10.3844/jcssp.2012.1957.1960</dc:source>
    <dc:date>2012-11-08</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1957.1960</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1957.1960</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1961.1969">
    <title><![CDATA[Restricted Domain Malay Speech Synthesizer Using Syntax-Prosody Representation]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1961.1969</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 14 November 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1961.1969">doi:10.3844/jcssp.2012.1961.1969</a></p>The speech synthesis approach required in restricted domain speech application is a synthesizer that has high quality like the speech output of ‘slot-filler’ approach but have at least the least f...]]></content:encoded>
    <dc:title><![CDATA[Restricted Domain Malay Speech Synthesizer Using Syntax-Prosody Representation]]></dc:title><dc:creator>Sabrina  Tiun</dc:creator><dc:creator>Rosni  Abdullah</dc:creator><dc:creator>Tang Enya Kong</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1961.1969</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-11-14; | doi:10.3844/jcssp.2012.1961.1969</dc:source>
    <dc:date>2012-11-14</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1961.1969</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1961.1969</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1970.1978">
    <title><![CDATA[Optimizing Clusters Alignment for Bilingual Malay-English Corpora]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1970.1978</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 26 November 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1970.1978">doi:10.3844/jcssp.2012.1970.1978</a></p>Bilingual corpora, containing the same documents in two different languages, are becoming an essential resource for natural language processing. Clustering bilingual corpora provides us with an insigh...]]></content:encoded>
    <dc:title><![CDATA[Optimizing Clusters Alignment for Bilingual Malay-English Corpora]]></dc:title><dc:creator>Rayner  Alfred</dc:creator><dc:creator>Chan Chen Jie</dc:creator><dc:creator>Ng Zhen Wei</dc:creator><dc:creator>Asni  Tahir</dc:creator><dc:creator>Joe Henry Obit</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1970.1978</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-11-26; | doi:10.3844/jcssp.2012.1970.1978</dc:source>
    <dc:date>2012-11-26</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1970.1978</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1970.1978</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1979.1986">
    <title><![CDATA[Cluster Based Time Division Multiple Access Scheduling Scheme for Zigbee Wireless Sensor Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1979.1986</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 26 November 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1979.1986">doi:10.3844/jcssp.2012.1979.1986</a></p>In IEEE 802.15.4 ZigBee Wireless Sensor Networks, an efficient scheduling mechanism is required for reliable data transmission. Further, concurrent transmission of huge data through CSMA/CA incurs mor...]]></content:encoded>
    <dc:title><![CDATA[Cluster Based Time Division Multiple Access Scheduling Scheme for Zigbee Wireless Sensor Networks]]></dc:title><dc:creator>B.  Meenakshi</dc:creator><dc:creator>P.  Anandhakumar</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1979.1986</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-11-26; | doi:10.3844/jcssp.2012.1979.1986</dc:source>
    <dc:date>2012-11-26</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1979.1986</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1979.1986</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1987.1995">
    <title><![CDATA[Data Integrity Proof and Secure Computation in Cloud Computing]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1987.1995</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 5 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1987.1995">doi:10.3844/jcssp.2012.1987.1995</a></p>Cloud computing is an emerging computing paradigm in which information technology resources and capacities are provided as services over the internet. The users can remotely store their data into the ...]]></content:encoded>
    <dc:title><![CDATA[Data Integrity Proof and Secure Computation in Cloud Computing]]></dc:title><dc:creator>Veeralakshmi  Ponnuramu</dc:creator><dc:creator>Latha  Tamilselvan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1987.1995</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-05; | doi:10.3844/jcssp.2012.1987.1995</dc:source>
    <dc:date>2012-12-05</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1987.1995</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1987.1995</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.1996.2007">
    <title><![CDATA[Mathematical Model Predicting the Critical Heat Flux of Nuclear Reactors]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.1996.2007</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 12 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.1996.2007">doi:10.3844/jcssp.2012.1996.2007</a></p>Boiling heat transfer system keeps a nuclear power plant safe without getting over-heated. Crisis will occur if the dissipated heat flux exceeds the critical heat flux value. This study assumes the fl...]]></content:encoded>
    <dc:title><![CDATA[Mathematical Model Predicting the Critical Heat Flux of Nuclear Reactors]]></dc:title><dc:creator>Chien-Hsiung  Lee</dc:creator><dc:creator>Lih-Wu  Hourng</dc:creator><dc:creator>Kuo-Wei  Lin</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.1996.2007</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-12; | doi:10.3844/jcssp.2012.1996.2007</dc:source>
    <dc:date>2012-12-12</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.1996.2007</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.1996.2007</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2008.2016">
    <title><![CDATA[A Heuristic Moving Vehicle Location Prediction Technique Via Optimal Paths Selection with Aid of Genetic Algorithm and Feed Forward Back Propagation Neural Network]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2008.2016</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 12 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2008.2016">doi:10.3844/jcssp.2012.2008.2016</a></p>The moving object or vehicle location prediction based on their spatial and temporal information is an important task in many applications. Different methods were utilized for performing the vehicle m...]]></content:encoded>
    <dc:title><![CDATA[A Heuristic Moving Vehicle Location Prediction Technique Via Optimal Paths Selection with Aid of Genetic Algorithm and Feed Forward Back Propagation Neural Network]]></dc:title><dc:creator>E. Baby Anitha</dc:creator><dc:creator>K.  Duraiswamy</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2008.2016</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-12; | doi:10.3844/jcssp.2012.2008.2016</dc:source>
    <dc:date>2012-12-12</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2008.2016</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2008.2016</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2017.2024">
    <title><![CDATA[Peak-to-Average Power Ratio Reduction Using Active Constellation Extension-Projection Onto Convex Sets Combined with Particle Swarm Optimization Added to Space Time Bloc Coding in Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing System]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2017.2024</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 12 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2017.2024">doi:10.3844/jcssp.2012.2017.2024</a></p>When generated Orthogonal Frequency Division Multiplexing (OFDM) signal is transmitted through a number of antennas in order to achieve diversity or cap any gain (higher transmission rate) then it is ...]]></content:encoded>
    <dc:title><![CDATA[Peak-to-Average Power Ratio Reduction Using Active Constellation Extension-Projection Onto Convex Sets Combined with Particle Swarm Optimization Added to Space Time Bloc Coding in Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing System]]></dc:title><dc:creator>Ahmed  Ouqour</dc:creator><dc:creator>Abdelhamid  Louliej</dc:creator><dc:creator>Younes  Jabrane</dc:creator><dc:creator>Brahim Ait Es Said</dc:creator><dc:creator>Abdellah Ait Ouahman</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2017.2024</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-12; | doi:10.3844/jcssp.2012.2017.2024</dc:source>
    <dc:date>2012-12-12</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2017.2024</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2017.2024</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2025.2031">
    <title><![CDATA[Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2025.2031</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 13 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2025.2031">doi:10.3844/jcssp.2012.2025.2031</a></p>In this study, we propose to design a call admission control algorithm which schedules the channels for Real time and non-real time users. In  Long Term Evolution (LTE) 3GPP Networks, several works we...]]></content:encoded>
    <dc:title><![CDATA[Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks]]></dc:title><dc:creator>J. Vijay Franklin</dc:creator><dc:creator>K.  Paramasivam</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2025.2031</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-13; | doi:10.3844/jcssp.2012.2025.2031</dc:source>
    <dc:date>2012-12-13</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2025.2031</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2025.2031</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2032.2041">
    <title><![CDATA[Traversal Algorithm for Complete Coverage]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2032.2041</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 15 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2032.2041">doi:10.3844/jcssp.2012.2032.2041</a></p>There are many applications which require complete coverage and obstacle avoidance. The classical A* algorithm provides the user a shortest path by avoiding the obstacle. As well, the Dijkstra’s alg...]]></content:encoded>
    <dc:title><![CDATA[Traversal Algorithm for Complete Coverage]]></dc:title><dc:creator>Kavitha  Thiayagarajan</dc:creator><dc:creator>Coimbatore Ganeshsankar Balaji</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2032.2041</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-15; | doi:10.3844/jcssp.2012.2032.2041</dc:source>
    <dc:date>2012-12-15</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2032.2041</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2032.2041</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2042.2052">
    <title><![CDATA[Secured Disclosure of Sensitive Data in Data Mining Techniques]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2042.2052</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 18 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2042.2052">doi:10.3844/jcssp.2012.2042.2052</a></p>Recent advances in data collection, data dissemination and related technologies have inaugurated a new era of research where existing data mining algorithms should be reconsidered from the point of vi...]]></content:encoded>
    <dc:title><![CDATA[Secured Disclosure of Sensitive Data in Data Mining Techniques]]></dc:title><dc:creator>Kirubhakar  Gurusamy</dc:creator><dc:creator>Venkatesh  Chakrapani</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2042.2052</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-18; | doi:10.3844/jcssp.2012.2042.2052</dc:source>
    <dc:date>2012-12-18</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2042.2052</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2042.2052</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2053.2061">
    <title><![CDATA[Web Document Segmentation Using Frequent Term Sets for Summarization]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2053.2061</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 19 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2053.2061">doi:10.3844/jcssp.2012.2053.2061</a></p>Query sensitive summarization aims at extracting the query relevant contents from web documents. Web page segmentation focuses on reducing the run time overhead of the summarization systems by groupin...]]></content:encoded>
    <dc:title><![CDATA[Web Document Segmentation Using Frequent Term Sets for Summarization]]></dc:title><dc:creator>Chitra  Pasupathi</dc:creator><dc:creator>Baskaran  Ramachandran</dc:creator><dc:creator>Sarukesi  Karunakaran</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2053.2061</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-19; | doi:10.3844/jcssp.2012.2053.2061</dc:source>
    <dc:date>2012-12-19</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2053.2061</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2053.2061</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2062.2067">
    <title><![CDATA[The Framework of Intelligent Telepresence Robot Based on Stereo Vision]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2062.2067</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 1 January 2013; <a href="https://thescipub.com/jcs/jcssp.2012.2062.2067">doi:10.3844/jcssp.2012.2062.2067</a></p>This research reports and presents a BeeBot, BINUS multi-client intelligent telepresence robot, a custom-build robot system specifically designed for teleconference with multiple people. The robot is ...]]></content:encoded>
    <dc:title><![CDATA[The Framework of Intelligent Telepresence Robot Based on Stereo Vision]]></dc:title><dc:creator>Widodo  Budiharto</dc:creator><dc:creator>Muchsin  Shodiq</dc:creator><dc:creator>Bayu  Kanigoro</dc:creator><dc:creator>  Hutomo</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2062.2067</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2013-01-01; | doi:10.3844/jcssp.2012.2062.2067</dc:source>
    <dc:date>2013-01-01</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2062.2067</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2062.2067</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2068.2074">
    <title><![CDATA[Soft Clustering Based Exposition to Multiple Dictionary Bag of Words]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2068.2074</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 20 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2068.2074">doi:10.3844/jcssp.2012.2068.2074</a></p>Object classification is a highly important area of computer vision and has many applications including robotics, searching images, face recognition, aiding visually impaired people, censoring images ...]]></content:encoded>
    <dc:title><![CDATA[Soft Clustering Based Exposition to Multiple Dictionary Bag of Words]]></dc:title><dc:creator>K. S. Sujatha</dc:creator><dc:creator>B.  Vinod</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2068.2074</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-20; | doi:10.3844/jcssp.2012.2068.2074</dc:source>
    <dc:date>2012-12-20</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2068.2074</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2068.2074</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2075.2082">
    <title><![CDATA[Enhanced Ensemble Prediction Algorithms for Detecting Faulty Modules in Object Oriented Systems Using Quality Metrics]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2075.2082</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 20 December 2012; <a href="https://thescipub.com/jcs/jcssp.2012.2075.2082">doi:10.3844/jcssp.2012.2075.2082</a></p>The high usage of software system poses high quality demand from users, which results in increased software complexity. To address these complexities, software quality engineering methods should be up...]]></content:encoded>
    <dc:title><![CDATA[Enhanced Ensemble Prediction Algorithms for Detecting Faulty Modules in Object Oriented Systems Using Quality Metrics]]></dc:title><dc:creator>M.  Punithavalli</dc:creator><dc:creator>C.  Neelamegam</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2075.2082</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2012-12-20; | doi:10.3844/jcssp.2012.2075.2082</dc:source>
    <dc:date>2012-12-20</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2075.2082</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2075.2082</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2083.2097">
    <title><![CDATA[Matching LSI for Scalable Information Retrieval]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2083.2097</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 2 January 2013; <a href="https://thescipub.com/jcs/jcssp.2012.2083.2097">doi:10.3844/jcssp.2012.2083.2097</a></p>Latent Semantic Indexing (LSI) is one of the well-liked techniques in the information retrieval fields. Different from the traditional information retrieval techniques, LSI is not based on the keyword...]]></content:encoded>
    <dc:title><![CDATA[Matching LSI for Scalable Information Retrieval]]></dc:title><dc:creator>Rajagopal  Palsonkennedy</dc:creator><dc:creator>T. V. Gopal</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2083.2097</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2013-01-02; | doi:10.3844/jcssp.2012.2083.2097</dc:source>
    <dc:date>2013-01-02</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2083.2097</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2083.2097</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2098.2105">
    <title><![CDATA[The Inverse Problem for Boolean Equations]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2098.2105</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 3 January 2013; <a href="https://thescipub.com/jcs/jcssp.2012.2098.2105">doi:10.3844/jcssp.2012.2098.2105</a></p>The Forward Problem (FB) of Boolean equations consists of finding solutions of a system of Boolean equations, or equivalently, a single Boolean equation of the form f(X) = 0 where f(X): Bn → B and B...]]></content:encoded>
    <dc:title><![CDATA[The Inverse Problem for Boolean Equations]]></dc:title><dc:creator>Ali Muhammad Ali Rushdi</dc:creator><dc:creator>Hussain Mobarak Albarakati</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2098.2105</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2013-01-03; | doi:10.3844/jcssp.2012.2098.2105</dc:source>
    <dc:date>2013-01-03</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2098.2105</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2098.2105</prism:url>
    </item><item rdf:about="https://thescipub.com/jcs/jcssp.2012.2106.2111">
    <title><![CDATA[Feature Fusion Technique for Colour Texture Classification System Based on Gray Level Co-occurrence Matrix]]></title>
    <link>https://thescipub.com/jcs/jcssp.2012.2106.2111</link>
    <content:encoded>
        <![CDATA[<p>Journal of Computer Science, Published online: 5 January 2013; <a href="https://thescipub.com/jcs/jcssp.2012.2106.2111">doi:10.3844/jcssp.2012.2106.2111</a></p>In this study, an efficient feature fusion based technique for the classification of colour texture images in VisTex album is presented. Gray Level Co-occurrence Matrix (GLCM) and its associated textu...]]></content:encoded>
    <dc:title><![CDATA[Feature Fusion Technique for Colour Texture Classification System Based on Gray Level Co-occurrence Matrix]]></dc:title><dc:creator>A.  Suresh</dc:creator><dc:creator>K. L. Shunmuganathan</dc:creator><dc:identifier>doi:10.3844/jcssp.2012.2106.2111</dc:identifier>
    <dc:source>Journal of Computer Science, Published online: 2013-01-05; | doi:10.3844/jcssp.2012.2106.2111</dc:source>
    <dc:date>2013-01-05</dc:date>
    <prism:publicationName>Science Publications</prism:publicationName>
    <prism:doi>10.3844/jcssp.2012.2106.2111</prism:doi>
    <prism:url>https://thescipub.com/jcs/jcssp.2012.2106.2111</prism:url>
    </item></rdf:RDF>