CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: Code Clones</title> <meta name="description" content="Search results for: Code Clones"> <meta name="keywords" content="Code Clones"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="Code Clones" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Code Clones"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 741</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Code Clones</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">741</span> Syntax Sensitive and Language Independent Detection of Code Clones</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kazuaki%20Maeda">Kazuaki Maeda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a new technique to detect code clones from the lexical and syntactic point of view, which is based on PALEX source code representation. The PALEX code contains the recorded parsing actions and also lexical formatting information including white spaces and comments. We can record a list of parsing actions (shift, reduce, and reading a token) during a compiling process after a compiler finishes analyzing the source code. The proposed technique has advantages for syntax sensitive approach and language independency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20Clones" title="Code Clones">Code Clones</a>, <a href="https://publications.waset.org/search?q=Source%20Code%20Representation" title=" Source Code Representation"> Source Code Representation</a>, <a href="https://publications.waset.org/search?q=XML" title=" XML"> XML</a>, <a href="https://publications.waset.org/search?q=Parser" title="Parser">Parser</a>, <a href="https://publications.waset.org/search?q=Parser%20Generator" title=" Parser Generator"> Parser Generator</a> </p> <a href="https://publications.waset.org/13000/syntax-sensitive-and-language-independent-detection-of-code-clones" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13000/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13000/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13000/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13000/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13000/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13000/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13000/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13000/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13000/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13000/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13000.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1460</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">740</span> Visualization of Code Clone Detection Results and the Implementation with Structured Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kazuaki%20Maeda">Kazuaki Maeda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper describes a code clone visualization method, called FC graph, and the implementation issues. Code clone detection tools usually show the results in a textual representation. If the results are large, it makes a problem to software maintainers with understanding them. One of the approaches to overcome the situation is visualization of code clone detection results. A scatter plot is a popular approach to the visualization. However, it represents only one-to-one correspondence and it is difficult to find correspondence of code clones over multiple files. FC graph represents correspondence among files, code clones and packages in Java. All nodes in FC graph are positioned using force-directed graph layout, which is dynami- cally calculated to adjust the distances of nodes until stabilizing them. We applied FC graph to some open source programs and visualized the results. In the author’s experience, FC graph is helpful to grasp correspondence of code clones over multiple files and also code clones with in a file.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=code%20clone%20detection" title="code clone detection">code clone detection</a>, <a href="https://publications.waset.org/search?q=program%20comprehension" title=" program comprehension"> program comprehension</a>, <a href="https://publications.waset.org/search?q=software%20maintenance" title=" software maintenance"> software maintenance</a>, <a href="https://publications.waset.org/search?q=visualization" title=" visualization"> visualization</a> </p> <a href="https://publications.waset.org/4659/visualization-of-code-clone-detection-results-and-the-implementation-with-structured-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4659/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4659/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4659/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4659/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4659/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4659/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4659/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4659/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4659/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4659/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4659.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1513</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">739</span> A Rapid Code Acquisition Scheme in OOC-Based CDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Keunhong%20Chae">Keunhong Chae</a>, <a href="https://publications.waset.org/search?q=Seokho%20Yoon"> Seokho Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20acquisition" title="Code acquisition">Code acquisition</a>, <a href="https://publications.waset.org/search?q=optical%20CDMA" title=" optical CDMA"> optical CDMA</a>, <a href="https://publications.waset.org/search?q=optical%20orthogonal%0D%0Acode" title=" optical orthogonal code"> optical orthogonal code</a>, <a href="https://publications.waset.org/search?q=serial%20algorithm." title=" serial algorithm."> serial algorithm.</a> </p> <a href="https://publications.waset.org/10000869/a-rapid-code-acquisition-scheme-in-ooc-based-cdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000869/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000869/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000869/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000869/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000869/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000869/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000869/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000869/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000869/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000869/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000869.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2157</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">738</span> Codes and Formulation of Appropriate Constraints via Entropy Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20K.%20Tuli">R. K. Tuli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In present communication, we have developed the suitable constraints for the given the mean codeword length and the measures of entropy. This development has proved that Renyi-s entropy gives the minimum value of the log of the harmonic mean and the log of power mean. We have also developed an important relation between best 1:1 code and the uniquely decipherable code by using different measures of entropy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Codeword" title="Codeword">Codeword</a>, <a href="https://publications.waset.org/search?q=Instantaneous%20code" title=" Instantaneous code"> Instantaneous code</a>, <a href="https://publications.waset.org/search?q=Prefix%20code" title=" Prefix code"> Prefix code</a>, <a href="https://publications.waset.org/search?q=Uniquely%20decipherable%20code" title="Uniquely decipherable code">Uniquely decipherable code</a>, <a href="https://publications.waset.org/search?q=Best%20one-one%20code" title=" Best one-one code"> Best one-one code</a>, <a href="https://publications.waset.org/search?q=Mean%20codewordlength" title=" Mean codewordlength"> Mean codewordlength</a> </p> <a href="https://publications.waset.org/927/codes-and-formulation-of-appropriate-constraints-via-entropy-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/927/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/927/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/927/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/927/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/927/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/927/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/927/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/927/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/927/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/927/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/927.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1298</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">737</span> Amplified Ribosomal DNA Restriction Analysis Method to Assess Rumen Microbial Diversity of Ruminant</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Natsir">A. Natsir</a>, <a href="https://publications.waset.org/search?q=M.%20Nadir"> M. Nadir</a>, <a href="https://publications.waset.org/search?q=S.%20Syahrir"> S. Syahrir</a>, <a href="https://publications.waset.org/search?q=A.%20Mujnisa"> A. Mujnisa</a>, <a href="https://publications.waset.org/search?q=N.%20Purnomo"> N. Purnomo</a>, <a href="https://publications.waset.org/search?q=A.%20R.%20Egan"> A. R. Egan</a>, <a href="https://publications.waset.org/search?q=B.%20J.%20Leury"> B. J. Leury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Rumen degradation characteristic of feedstuff is one of the prominent factors affecting microbial population in rumen of animal. High rumen degradation rate of faba bean protein may lead to inconstant rumen conditions that could have a prominent impact on rumen microbial diversity. Amplified Ribosomal DNA Restriction Analysis (ARDRA) is utilized to monitor diversity of rumen microbes on sheep fed low quality forage supplemented by faba beans. Four mature merino sheep with existing rumen cannula were used in this study according to 4 x 4 Latin square design. The results of study indicated that there were 37 different ARDRA types identified out of 136 clones examined. Among those clones, five main clone types existed across the treatments with different percentages. In conclusion, the ARDRA method is potential to be used as a routine tool to assess the temporary changes in the rumen community as a result of different feeding strategies.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ARDRA%20method" title="ARDRA method">ARDRA method</a>, <a href="https://publications.waset.org/search?q=clones" title=" clones"> clones</a>, <a href="https://publications.waset.org/search?q=microbial%20diversity" title=" microbial diversity"> microbial diversity</a>, <a href="https://publications.waset.org/search?q=ribotypes" title=" ribotypes"> ribotypes</a>, <a href="https://publications.waset.org/search?q=ruminants." title=" ruminants."> ruminants.</a> </p> <a href="https://publications.waset.org/10006201/amplified-ribosomal-dna-restriction-analysis-method-to-assess-rumen-microbial-diversity-of-ruminant" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006201/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006201/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006201/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006201/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006201/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006201/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006201/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006201/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006201/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006201/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006201.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1466</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">736</span> Performance of Random Diagonal Codes for Spectral Amplitude Coding Optical CDMA Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hilal%20A.%20Fadhil">Hilal A. Fadhil</a>, <a href="https://publications.waset.org/search?q=Syed%20A.%20Aljunid"> Syed A. Aljunid</a>, <a href="https://publications.waset.org/search?q=R.%20Badlishah%20Ahmed"> R. Badlishah Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we study the use of a new code called Random Diagonal (RD) code for Spectral Amplitude Coding (SAC) optical Code Division Multiple Access (CDMA) networks, using Fiber Bragg-Grating (FBG), FBG consists of a fiber segment whose index of reflection varies periodically along its length. RD code is constructed using code level and data level, one of the important properties of this code is that the cross correlation at data level is always zero, which means that Phase intensity Induced Phase (PIIN) is reduced. We find that the performance of the RD code will be better than Modified Frequency Hopping (MFH) and Hadamard code It has been observed through experimental and theoretical simulation that BER for RD code perform significantly better than other codes. Proof –of-principle simulations of encoding with 3 channels, and 10 Gbps data transmission have been successfully demonstrated together with FBG decoding scheme for canceling the code level from SAC-signal. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=FBG" title="FBG">FBG</a>, <a href="https://publications.waset.org/search?q=MFH" title=" MFH"> MFH</a>, <a href="https://publications.waset.org/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/search?q=PIIN" title=" PIIN"> PIIN</a>, <a href="https://publications.waset.org/search?q=BER." title=" BER."> BER.</a> </p> <a href="https://publications.waset.org/519/performance-of-random-diagonal-codes-for-spectral-amplitude-coding-optical-cdma-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/519/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/519/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/519/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/519/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/519/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/519/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/519/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/519/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/519/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/519/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/519.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1743</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">735</span> Code-Switching in Facebook Chatting Among Maldivian Teenagers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Aaidha%20Hammad">Aaidha Hammad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This study examines the phenomenon of code switching among teenagers in the Maldives while they carry out conversations through Facebook in the form of “Facebook Chatting”. The current study aims at evaluating the frequency of code-switching and it investigates between what languages code-switching occurs. Besides the study identifies the types of words that are often codeswitched and the triggers for code switching. The methodology used in this study is mixed method of qualitative and quantitative approach. In this regard, the chat log of a group conversation between 10 teenagers was collected and analyzed. A questionnaire was also administered through online to 24 different teenagers from different corners of the Maldives. The age of teenagers ranged between 16 and 19 years. The findings of the current study revealed that while Maldivian teenagers chat in Facebook they very often code switch and these switches are most commonly between Dhivehi and English, but some other languages are also used to some extent. It also identified the different types of words that are being often code switched among the teenagers. Most importantly it explored different reasons behind code switching among the Maldivian teenagers in Facebook chatting.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code-switching" title="Code-switching">Code-switching</a>, <a href="https://publications.waset.org/search?q=Facebook" title=" Facebook"> Facebook</a>, <a href="https://publications.waset.org/search?q=Facebook%20chatting%20Maldivian%20teenagers." title=" Facebook chatting Maldivian teenagers."> Facebook chatting Maldivian teenagers.</a> </p> <a href="https://publications.waset.org/10008770/code-switching-in-facebook-chatting-among-maldivian-teenagers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008770/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008770/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008770/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008770/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008770/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008770/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008770/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008770/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008770/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008770/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008770.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1098</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">734</span> Flowering Response of a Red Pitaya Germplasm Collection to Lighting Addition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dinh-Ha%20Tran">Dinh-Ha Tran</a>, <a href="https://publications.waset.org/search?q=Chung-Ruey%20Yen"> Chung-Ruey Yen</a>, <a href="https://publications.waset.org/search?q=Yu-Kuang%20H.%20Chen"> Yu-Kuang H. Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A collection of thirty cultivars/clones of a red pitaya was used to investigate flowering response to lighting supplementation in the winter season of 2013-2014 in southern Taiwan. The night-breaking treatment was conducted during the period of 10 Oct. 2013 to 5 Mar. 2014 with 4-continuous hours (22.00 – 02.00 hrs) of additional lighting daily using incandescent bulbs (100W). Among cultivars and clones tested, twenty-three genotypes, most belonging to the red-magenta flesh type, were found to have positively flowering response to the lighting treatment. The duration of night-breaking treatment for successful flowering initiation varied from 33- 48 days. The lighting-sensitive genotypes bore 1-2 flowering flushes. Floral and fruiting stages took 21-26 and 46-59 days, respectively. Among sixteen fruiting genotypes, the highest fruit set rates were found in Damao 9, D4, D13, Chaozou large, Chaozhou 5, Small Nick and F22. Five cultivars and clones (Orejona, D4, Chaozhou large, Chaozhou 5 and Small Nick) produced fruits with an average weight of more than 300 g per fruit which were higher than those of the fruits formed in the summer of 2013. Fruits produced during off-season containing total soluble solids (TSS) from 17.5 to 20.7oBrix, which were higher than those produced inseason.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Flowering%20response" title="Flowering response">Flowering response</a>, <a href="https://publications.waset.org/search?q=long-day%20plant" title=" long-day plant"> long-day plant</a>, <a href="https://publications.waset.org/search?q=night-breaking%0D%0Atreatment" title=" night-breaking treatment"> night-breaking treatment</a>, <a href="https://publications.waset.org/search?q=off-season%20production" title=" off-season production"> off-season production</a>, <a href="https://publications.waset.org/search?q=pitaya." title=" pitaya."> pitaya.</a> </p> <a href="https://publications.waset.org/10000565/flowering-response-of-a-red-pitaya-germplasm-collection-to-lighting-addition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000565/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000565/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000565/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000565/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000565/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000565/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000565/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000565/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000565/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000565/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000565.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3963</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">733</span> PIIN Suppression Using Random Diagonal Code for Spectral Amplitude Coding Optical CDMA System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hilal%20Adnan%20Fadhil"> Hilal Adnan Fadhil</a>, <a href="https://publications.waset.org/search?q=Syed%20Alwei"> Syed Alwei</a>, <a href="https://publications.waset.org/search?q=R.%20Badlishah%20Ahmad"> R. Badlishah Ahmad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new code for spectral-amplitude coding optical code-division multiple-access system is proposed called Random diagonal (RD) code. This code is constructed using code segment and data segment. One of the important properties of this code is that the cross correlation at data segment is always zero, which means that Phase Intensity Induced Noise (PIIN) is reduced. For the performance analysis, the effects of phase-induced intensity noise, shot noise, and thermal noise are considered simultaneously. Bit-error rate (BER) performance is compared with Hadamard and Modified Frequency Hopping (MFH) codes. It is shown that the system using this new code matrices not only suppress PIIN, but also allows larger number of active users compare with other codes. Simulation results shown that using point to point transmission with three encoded channels, RD code has better BER performance than other codes, also its found that at 0 dbm PIIN noise are 10-10 and 10-11 for RD and MFH respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=OCDMA" title="OCDMA">OCDMA</a>, <a href="https://publications.waset.org/search?q=MFH" title=" MFH"> MFH</a>, <a href="https://publications.waset.org/search?q=PIIN" title=" PIIN"> PIIN</a>, <a href="https://publications.waset.org/search?q=and%20BER." title=" and BER."> and BER.</a> </p> <a href="https://publications.waset.org/7707/piin-suppression-using-random-diagonal-code-for-spectral-amplitude-coding-optical-cdma-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7707/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7707/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7707/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7707/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7707/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7707/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7707/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7707/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7707/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7707/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7707.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1787</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">732</span> Optical Multicast over OBS Networks: An Approach Based On Code-Words and Tunable Decoders</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Maha%20Sliti">Maha Sliti</a>, <a href="https://publications.waset.org/search?q=Walid%20Abdallah"> Walid Abdallah</a>, <a href="https://publications.waset.org/search?q=Noureddine%20Boudriga"> Noureddine Boudriga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In the frame of this work, we present an optical multicasting approach based on optical code-words. Our approach associates, in the edge node, an optical code-word to a group multicast address. In the core node, a set of tunable decoders are used to send a traffic data to multiple destinations based on the received code-word. The use of code-words, which correspond to the combination of an input port and a set of output ports, allows the implementation of an optical switching matrix. At the reception of a burst, it will be delayed in an optical memory. And, the received optical code-word is split to a set of tunable optical decoders. When it matches a configured code-word, the delayed burst is switched to a set of output ports.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optical%20multicast" title="Optical multicast">Optical multicast</a>, <a href="https://publications.waset.org/search?q=optical%20burst%20switching%20networks" title=" optical burst switching networks"> optical burst switching networks</a>, <a href="https://publications.waset.org/search?q=optical%20code-words" title=" optical code-words"> optical code-words</a>, <a href="https://publications.waset.org/search?q=tunable%20decoder" title=" tunable decoder"> tunable decoder</a>, <a href="https://publications.waset.org/search?q=virtual%20optical%20memory." title=" virtual optical memory."> virtual optical memory.</a> </p> <a href="https://publications.waset.org/9998560/optical-multicast-over-obs-networks-an-approach-based-on-code-words-and-tunable-decoders" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998560/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998560/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998560/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998560/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998560/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998560/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998560/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998560/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998560/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998560/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998560.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1686</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">731</span> Optical Multicast over OBS Networks: An Approach Based On Code-Words and Tunable Decoders</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Maha%20Sliti">Maha Sliti</a>, <a href="https://publications.waset.org/search?q=Walid%20Abdallah"> Walid Abdallah</a>, <a href="https://publications.waset.org/search?q=Noureddine%20Boudriga"> Noureddine Boudriga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In the frame of this work, we present an optical multicasting approach based on optical code-words. Our approach associates, in the edge node, an optical code-word to a group multicast address. In the core node, a set of tunable decoders are used to send a traffic data to multiple destinations based on the received code-word. The use of code-words, which correspond to the combination of an input port and a set of output ports, allows the implementation of an optical switching matrix. At the reception of a burst, it will be delayed in an optical memory. And, the received optical code-word is split to a set of tunable optical decoders. When it matches a configured code-word, the delayed burst is switched to a set of output ports.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optical%20multicast" title="Optical multicast">Optical multicast</a>, <a href="https://publications.waset.org/search?q=optical%20burst%20switching%20networks" title=" optical burst switching networks"> optical burst switching networks</a>, <a href="https://publications.waset.org/search?q=optical%20code-words" title=" optical code-words"> optical code-words</a>, <a href="https://publications.waset.org/search?q=tunable%20decoder" title=" tunable decoder"> tunable decoder</a>, <a href="https://publications.waset.org/search?q=virtual%20optical%20memory." title=" virtual optical memory."> virtual optical memory.</a> </p> <a href="https://publications.waset.org/9998597/optical-multicast-over-obs-networks-an-approach-based-on-code-words-and-tunable-decoders" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998597/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998597/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998597/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998597/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998597/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998597/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998597/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998597/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998597/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998597/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998597.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1760</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">730</span> Simulation of Hamming Coding and Decoding for Microcontroller Radiation Hardening</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rehab%20I.%20Abdul%20Rahman">Rehab I. Abdul Rahman</a>, <a href="https://publications.waset.org/search?q=Mazhar%20B.%20Tayel"> Mazhar B. Tayel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a method of hardening the 8051 micro-controller, able to assure reliable operation in the presence of bit flips caused by radiation. Aiming at avoiding such faults in the 8051 micro-controller, Hamming code protection was used in its SRAM memory and registers. A VHDL code has been used for this hamming code protection.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Radiation" title="Radiation">Radiation</a>, <a href="https://publications.waset.org/search?q=hardening" title=" hardening"> hardening</a>, <a href="https://publications.waset.org/search?q=bitflip" title=" bitflip"> bitflip</a>, <a href="https://publications.waset.org/search?q=hamming%20code." title=" hamming code."> hamming code.</a> </p> <a href="https://publications.waset.org/10000673/simulation-of-hamming-coding-and-decoding-for-microcontroller-radiation-hardening" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000673/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000673/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000673/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000673/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000673/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000673/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000673/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000673/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000673/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000673/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000673.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2984</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">729</span> A Multilanguage Source Code Retrieval System Using Structural-Semantic Fingerprints </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohamed%20Amine%20Ouddan">Mohamed Amine Ouddan</a>, <a href="https://publications.waset.org/search?q=Hassane%20Essafi"> Hassane Essafi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Source code retrieval is of immense importance in the software engineering field. The complex tasks of retrieving and extracting information from source code documents is vital in the development cycle of the large software systems. The two main subtasks which result from these activities are code duplication prevention and plagiarism detection. In this paper, we propose a Mohamed Amine Ouddan, and Hassane Essafi source code retrieval system based on two-level fingerprint representation, respectively the structural and the semantic information within a source code. A sequence alignment technique is applied on these fingerprints in order to quantify the similarity between source code portions. The specific purpose of the system is to detect plagiarism and duplicated code between programs written in different programming languages belonging to the same class, such as C, Cµ, Java and CSharp. These four languages are supported by the actual version of the system which is designed such that it may be easily adapted for any programming language. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Source%20code%20retrieval" title="Source code retrieval">Source code retrieval</a>, <a href="https://publications.waset.org/search?q=plagiarism%20detection" title=" plagiarism detection"> plagiarism detection</a>, <a href="https://publications.waset.org/search?q=clonedetection" title=" clonedetection"> clonedetection</a>, <a href="https://publications.waset.org/search?q=sequence%20alignment." title=" sequence alignment."> sequence alignment.</a> </p> <a href="https://publications.waset.org/12393/a-multilanguage-source-code-retrieval-system-using-structural-semantic-fingerprints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12393/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12393/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12393/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12393/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12393/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12393/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12393/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12393/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12393/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12393/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12393.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1792</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">728</span> The Feasibility of Augmenting an Augmented Reality Image Card on a Quick Response Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Alfred%20Chen">Alfred Chen</a>, <a href="https://publications.waset.org/search?q=Shr%20Yu%20Lu"> Shr Yu Lu</a>, <a href="https://publications.waset.org/search?q=Cong%20Seng%20Hong"> Cong Seng Hong</a>, <a href="https://publications.waset.org/search?q=Yur-June%20Wang"> Yur-June Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research attempts to study the feasibility of augmenting an augmented reality (AR) image card on a Quick Response (QR) code. The authors have developed a new visual tag, which contains a QR code and an augmented AR image card. The new visual tag has features of reading both of the revealed data of the QR code and the instant data from the AR image card. Furthermore, a handheld communicating device is used to read and decode the new visual tag, and then the concealed data of the new visual tag can be revealed and read through its visual display. In general, the QR code is designed to store the corresponding data or, as a key, to access the corresponding data from the server through internet. Those reveled data from the QR code are represented in text. Normally, the AR image card is designed to store the corresponding data in 3-Dimensional or animation/video forms. By using QR code's property of high fault tolerant rate, the new visual tag can access those two different types of data by using a handheld communicating device. The new visual tag has an advantage of carrying much more data than independent QR code or AR image card. The major findings of this research are: 1) the most efficient area for the designed augmented AR card augmenting on the QR code is 9% coverage area out of the total new visual tag-s area, and 2) the best location for the augmented AR image card augmenting on the QR code is located in the bottom-right corner of the new visual tag. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Augmented%20reality" title="Augmented reality">Augmented reality</a>, <a href="https://publications.waset.org/search?q=QR%20code" title=" QR code"> QR code</a>, <a href="https://publications.waset.org/search?q=Visual%20tag" title=" Visual tag"> Visual tag</a>, <a href="https://publications.waset.org/search?q=Handheldcommunicating%20device" title=" Handheldcommunicating device"> Handheldcommunicating device</a> </p> <a href="https://publications.waset.org/5470/the-feasibility-of-augmenting-an-augmented-reality-image-card-on-a-quick-response-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5470/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5470/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5470/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5470/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5470/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5470/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5470/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5470/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5470/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5470/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5470.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1555</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">727</span> Ranking and Unranking Algorithms for k-ary Trees in Gray Code Order</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Fateme%20Ashari-Ghomi">Fateme Ashari-Ghomi</a>, <a href="https://publications.waset.org/search?q=Najme%20Khorasani"> Najme Khorasani</a>, <a href="https://publications.waset.org/search?q=Abbas%20Nowzari-Dalini"> Abbas Nowzari-Dalini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present two new ranking and unranking algorithms for k-ary trees represented by x-sequences in Gray code order. These algorithms are based on a gray code generation algorithm developed by Ahrabian et al.. In mentioned paper, a recursive backtracking generation algorithm for x-sequences corresponding to k-ary trees in Gray code was presented. This generation algorithm is based on Vajnovszki-s algorithm for generating binary trees in Gray code ordering. Up to our knowledge no ranking and unranking algorithms were given for x-sequences in this ordering. we present ranking and unranking algorithms with O(kn2) time complexity for x-sequences in this Gray code ordering <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=k-ary%20Tree%20Generation" title="k-ary Tree Generation">k-ary Tree Generation</a>, <a href="https://publications.waset.org/search?q=Ranking" title=" Ranking"> Ranking</a>, <a href="https://publications.waset.org/search?q=Unranking" title=" Unranking"> Unranking</a>, <a href="https://publications.waset.org/search?q=Gray%0ACode." title=" Gray Code."> Gray Code.</a> </p> <a href="https://publications.waset.org/9384/ranking-and-unranking-algorithms-for-k-ary-trees-in-gray-code-order" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9384/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9384/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9384/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9384/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9384/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9384/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9384/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9384/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9384/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9384/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9384.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2106</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">726</span> Array Data Transformation for Source Code Obfuscation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Praveen"> S. Praveen</a>, <a href="https://publications.waset.org/search?q=P.%20Sojan%20Lal"> P. Sojan Lal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Obfuscation is a low cost software protection methodology to avoid reverse engineering and re engineering of applications. Source code obfuscation aims in obscuring the source code to hide the functionality of the codes. This paper proposes an Array data transformation in order to obfuscate the source code which uses arrays. The applications using the proposed data structures force the programmer to obscure the logic manually. It makes the developed obscured codes hard to reverse engineer and also protects the functionality of the codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Reverse%20Engineering" title="Reverse Engineering">Reverse Engineering</a>, <a href="https://publications.waset.org/search?q=Source%20Code%20Obfuscation." title=" Source Code Obfuscation."> Source Code Obfuscation.</a> </p> <a href="https://publications.waset.org/2537/array-data-transformation-for-source-code-obfuscation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2537/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2537/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2537/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2537/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2537/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2537/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2537/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2537/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2537/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2537/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2537.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2036</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">725</span> Directors- Islamic Code of Ethics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ahmad%20Saiful%20Azlin%20Puteh%20Salin">Ahmad Saiful Azlin Puteh Salin</a>, <a href="https://publications.waset.org/search?q=Norlela%20Kamaludin"> Norlela Kamaludin</a>, <a href="https://publications.waset.org/search?q=Siti%20Khadijah%20Ab%20Manan"> Siti Khadijah Ab Manan</a>, <a href="https://publications.waset.org/search?q=Mohd%20Shatari%20Abdul%20Ghafar"> Mohd Shatari Abdul Ghafar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a new model of Islamic code of ethics for directors. Several corporate scandals and local (example Transmile and Megan Media) and overseas corporate (example Parmalat and Enron) collapses show that the current corporate governance and regulatory reform are unable to prevent these events from recurring. Arguably, the code of ethics for directors is under research and the current code of ethics only concentrates on binding the work of the employee of the organization as a whole, without specifically putting direct attention to the directors, the group of people responsible for the performance of the company. This study used a semi-structured interview survey of well-known Islamic scholars such as the Mufti to develop the model. It is expected that the outcome of the research is a comprehensive model of code of ethics based on the Islamic principles that can be applied and used by the company to construct a code of ethics for their directors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20of%20ethics" title="Code of ethics">Code of ethics</a>, <a href="https://publications.waset.org/search?q=director" title=" director"> director</a>, <a href="https://publications.waset.org/search?q=Islam" title=" Islam"> Islam</a>, <a href="https://publications.waset.org/search?q=ethics" title=" ethics"> ethics</a> </p> <a href="https://publications.waset.org/14165/directors-islamic-code-of-ethics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14165/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14165/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14165/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14165/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14165/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14165/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14165/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14165/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14165/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14165/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14165.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1939</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">724</span> Morphological Characteristics and Pollination Requirement in Red Pitaya (Hylocereus spp.) </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dinh%20Ha">Dinh Ha</a>, <a href="https://publications.waset.org/search?q=Tran"> Tran</a>, <a href="https://publications.waset.org/search?q=Chung%20-%20Ruey%20Yen"> Chung - Ruey Yen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This study explored the morphological characteristics and effects of pollination methods on fruit set and characteristics in 4 red pitaya (<em>Hylocereus </em>spp.) clones. The distinctive morphological recognition and classification among pitaya clones were confirmed by the stem, flower and fruit features. The fruit production season was indicated from the beginning of May to the end of August – the beginning of September with 6-7 flowering cycles per year. The floral stage took from 15-19 days and fruit duration spent 30–32 days. VN White, fully self-compatible, obtained high fruit set rates (80.0–90.5%) in all pollination treatments and the maximum fruit weight (402.6g) in hand self- and (403.4g) in open-pollination. Chaozhou 5 was partially self-compatible while Orejona and F<sub>11</sub> were completely self-incompatible. Hand cross-pollination increased significantly fruit set (95.8; 88.4 and 90.2%) and fruit weight (374.2; 281.8 and 416.3 g) in Chaozhou 5, Orejona, and F<sub>11</sub>, respectively. TSS contents were not much influenced by pollination methods.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hylocereus%20spp." title="Hylocereus spp.">Hylocereus spp.</a>, <a href="https://publications.waset.org/search?q=morphology" title=" morphology"> morphology</a>, <a href="https://publications.waset.org/search?q=floral%20phenology" title=" floral phenology"> floral phenology</a>, <a href="https://publications.waset.org/search?q=pollination%20requirement." title=" pollination requirement. "> pollination requirement. </a> </p> <a href="https://publications.waset.org/9997630/morphological-characteristics-and-pollination-requirement-in-red-pitaya-hylocereus-spp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997630/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997630/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997630/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997630/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997630/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997630/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997630/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997630/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997630/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997630/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997630.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3546</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">723</span> Morphological Characteristics and Pollination Requirement in Red Pitaya (Hylocereus spp.) </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dinh%20-%20Ha%20Tran">Dinh - Ha Tran</a>, <a href="https://publications.waset.org/search?q=Chung%20-%20Ruey%20Yen"> Chung - Ruey Yen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This study explored the morphological characteristics and effects of pollination methods on fruit set and characteristics in 4 red pitaya (<em>Hylocereus </em>spp.) clones. The distinctive morphological recognition and classification among pitaya clones were confirmed by the stem, flower and fruit features. The fruit production season was indicated from the beginning of May to the end of August – the beginning of September with 6-7 flowering cycles per year. The floral stage took from 15-19 days and fruit duration spent 30–32 days. VN White, fully self-compatible, obtained high fruit set rates (80.0–90.5%) in all pollination treatments and the maximum fruit weight (402.6g) in hand self- and (403.4g) in open-pollination. Chaozhou 5 was partially self-compatible while Orejona and F<sub>11</sub> were completely self-incompatible. Hand cross-pollination increased significantly fruit set (95.8; 88.4 and 90.2%) and fruit weight (374.2; 281.8 and 416.3g) in Chaozhou 5, Orejona and F<sub>11</sub>, respectively. TSS contents were not much influcenced by pollination methods.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hylocereus%20spp." title="Hylocereus spp.">Hylocereus spp.</a>, <a href="https://publications.waset.org/search?q=morphology" title=" morphology"> morphology</a>, <a href="https://publications.waset.org/search?q=floral%20phenology" title=" floral phenology"> floral phenology</a>, <a href="https://publications.waset.org/search?q=pollination%20requirement." title=" pollination requirement. "> pollination requirement. </a> </p> <a href="https://publications.waset.org/9997795/morphological-characteristics-and-pollination-requirement-in-red-pitaya-hylocereus-spp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997795/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997795/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997795/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997795/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997795/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997795/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997795/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997795/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997795/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997795/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997795.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2936</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">722</span> Lowering Error Floors by Concatenation of Low-Density Parity-Check and Array Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Cinna%20Soltanpur">Cinna Soltanpur</a>, <a href="https://publications.waset.org/search?q=Mohammad%20Ghamari"> Mohammad Ghamari</a>, <a href="https://publications.waset.org/search?q=Behzad%20Momahed%20Heravi"> Behzad Momahed Heravi</a>, <a href="https://publications.waset.org/search?q=Fatemeh%20Zare"> Fatemeh Zare</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-error-ratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to lower the error floors of LDPC code. The outer code in the proposed concatenation is the LDPC, and the inner code is a high rate array code. This approach applies an interactive hybrid process between the BCJR decoding for the array code and the SPA for the LDPC code together with bit-pinning and bit-flipping techniques. Margulis code of size (2640, 1320) has been used for the simulation and it has been shown that the proposed concatenation and decoding scheme can considerably improve the error floor performance with minimal rate loss. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Concatenated%20coding" title="Concatenated coding">Concatenated coding</a>, <a href="https://publications.waset.org/search?q=low%E2%80%93density%20parity%E2%80%93check%20codes" title=" low–density parity–check codes"> low–density parity–check codes</a>, <a href="https://publications.waset.org/search?q=array%20code" title=" array code"> array code</a>, <a href="https://publications.waset.org/search?q=error%20floors." title=" error floors. "> error floors. </a> </p> <a href="https://publications.waset.org/10006914/lowering-error-floors-by-concatenation-of-low-density-parity-check-and-array-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006914/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006914/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006914/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006914/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006914/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006914/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006914/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006914/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006914/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006914/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006914.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">993</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">721</span> Maximum Distance Separable b-Symbol Repeated-Root γ-Constacylic Codes over a Finite Chain Ring of Length 2</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jamal%20Laaouine">Jamal Laaouine</a>, <a href="https://publications.waset.org/search?q=Mohammed%20Elhassani%20Charkani"> Mohammed Elhassani Charkani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Let p be a prime and let b be an integer. MDS b-symbol codes are a direct generalization of MDS codes. The γ-constacyclic codes of length pˢ over the finite commutative chain ring Fₚm [u]/ < u² > had been classified into four distinct types, where is a nonzero element of the field Fₚm. Let C₃ be a code of Type 3. In this paper, we obtain the b-symbol distance db(C₃) of the code C₃. Using this result, necessary and sufficient conditions under which C₃ is an MDS b-symbol code are given.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=constacyclic%20code" title="constacyclic code">constacyclic code</a>, <a href="https://publications.waset.org/search?q=repeated-root%20code" title=" repeated-root code"> repeated-root code</a>, <a href="https://publications.waset.org/search?q=maximum%20distance%20separable" title=" maximum distance separable"> maximum distance separable</a>, <a href="https://publications.waset.org/search?q=MDS%20codes" title=" MDS codes"> MDS codes</a>, <a href="https://publications.waset.org/search?q=b-symbol%20distance" title=" b-symbol distance"> b-symbol distance</a>, <a href="https://publications.waset.org/search?q=finite%20chain%20rings" title=" finite chain rings"> finite chain rings</a> </p> <a href="https://publications.waset.org/10012327/maximum-distance-separable-b-symbol-repeated-root-gh-constacylic-codes-over-a-finite-chain-ring-of-length-2" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012327/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012327/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012327/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012327/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012327/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012327/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012327/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012327/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012327/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012327/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012327.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">420</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">720</span> Design and Performance Analysis of One Dimensional Zero Cross-Correlation Coding Technique for a Fixed Wavelength Hopping SAC-OCDMA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Satyasen%20Panda">Satyasen Panda</a>, <a href="https://publications.waset.org/search?q=Urmila%20Bhanja"> Urmila Bhanja</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a SAC-OCDMA code with zero cross correlation property to minimize the Multiple Access Interface (MAI) as New Zero Cross Correlation code (NZCC), which is found to be more scalable compared to the other existing SAC-OCDMA codes. This NZCC code is constructed using address segment and data segment. In this work, the proposed NZCC code is implemented in an optical system using the Opti-System software for the spectral amplitude coded optical code-division multiple-access (SAC-OCDMA) scheme. The main contribution of the proposed NZCC code is the zero cross correlation, which reduces both the MAI and PIIN noises. The proposed NZCC code reveals properties of minimum cross-correlation, flexibility in selecting the code parameters and supports a large number of users, combined with high data rate and longer fiber length. Simulation results reveal that the optical code division multiple access system based on the proposed NZCC code accommodates maximum number of simultaneous users with higher data rate transmission, lower Bit Error Rates (BER) and longer travelling distance without any signal quality degradation, as compared to the former existing SAC-OCDMA codes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cross%20Correlation" title="Cross Correlation">Cross Correlation</a>, <a href="https://publications.waset.org/search?q=Optical%20Code%20Division%20Multiple%20Access" title=" Optical Code Division Multiple Access"> Optical Code Division Multiple Access</a>, <a href="https://publications.waset.org/search?q=Spectral%20Amplitude%20Coding%20Optical%20Code%20Division%20Multiple%20Access" title=" Spectral Amplitude Coding Optical Code Division Multiple Access"> Spectral Amplitude Coding Optical Code Division Multiple Access</a>, <a href="https://publications.waset.org/search?q=Multiple%20Access%20Interference" title=" Multiple Access Interference"> Multiple Access Interference</a>, <a href="https://publications.waset.org/search?q=Phase%20Induced%20Intensity%20Noise" title=" Phase Induced Intensity Noise"> Phase Induced Intensity Noise</a>, <a href="https://publications.waset.org/search?q=New%20Zero%20Cross%20Correlation%20code." title=" New Zero Cross Correlation code."> New Zero Cross Correlation code.</a> </p> <a href="https://publications.waset.org/10003968/design-and-performance-analysis-of-one-dimensional-zero-cross-correlation-coding-technique-for-a-fixed-wavelength-hopping-sac-ocdma" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003968/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003968/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003968/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003968/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003968/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003968/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003968/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003968/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003968/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003968/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003968.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2243</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">719</span> Implementation of a Reed-Solomon Code as an ECC in Yet Another Flash File System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sungjoon%20Sim">Sungjoon Sim</a>, <a href="https://publications.waset.org/search?q=Soongyu%20Kwon"> Soongyu Kwon</a>, <a href="https://publications.waset.org/search?q=Dongjae%20Song"> Dongjae Song</a>, <a href="https://publications.waset.org/search?q=Jong%20Tae%20Kim"> Jong Tae Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Flash memory has become an important storage device in many embedded systems because of its high performance, low power consumption and shock resistance. Multi-level cell (MLC) is developed as an effective solution for reducing the cost and increasing the storage density in recent years. However, most of flash file system cannot handle the error correction sufficiently. To correct more errors for MLC, we implement Reed-Solomon (RS) code to YAFFS, what is widely used for flash-based file system. RS code has longer computing time but the correcting ability is much higher than that of Hamming code. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Reed-Solomon" title="Reed-Solomon">Reed-Solomon</a>, <a href="https://publications.waset.org/search?q=NAND%20flash%20memory" title=" NAND flash memory"> NAND flash memory</a>, <a href="https://publications.waset.org/search?q=YAFFS" title=" YAFFS"> YAFFS</a>, <a href="https://publications.waset.org/search?q=ErrorCorrecting%20Code" title=" ErrorCorrecting Code"> ErrorCorrecting Code</a>, <a href="https://publications.waset.org/search?q=Flash%20File%20System" title=" Flash File System"> Flash File System</a> </p> <a href="https://publications.waset.org/14810/implementation-of-a-reed-solomon-code-as-an-ecc-in-yet-another-flash-file-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14810/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14810/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14810/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14810/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14810/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14810/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14810/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14810/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14810/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14810/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14810.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2497</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">718</span> Spread Spectrum Code Estimationby Particle Swarm Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Vahid%20R.%20Asghari">Vahid R. Asghari</a>, <a href="https://publications.waset.org/search?q=Mehrdad%20Ardebilipour"> Mehrdad Ardebilipour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the context of spectrum surveillance, a new method to recover the code of spread spectrum signal is presented, while the receiver has no knowledge of the transmitter-s spreading sequence. In our previous paper, we used Genetic algorithm (GA), to recover spreading code. Although genetic algorithms (GAs) are well known for their robustness in solving complex optimization problems, but nonetheless, by increasing the length of the code, we will often lead to an unacceptable slow convergence speed. To solve this problem we introduce Particle Swarm Optimization (PSO) into code estimation in spread spectrum communication system. In searching process for code estimation, the PSO algorithm has the merits of rapid convergence to the global optimum, without being trapped in local suboptimum, and good robustness to noise. In this paper we describe how to implement PSO as a component of a searching algorithm in code estimation. Swarm intelligence boasts a number of advantages due to the use of mobile agents. Some of them are: Scalability, Fault tolerance, Adaptation, Speed, Modularity, Autonomy, and Parallelism. These properties make swarm intelligence very attractive for spread spectrum code estimation. They also make swarm intelligence suitable for a variety of other kinds of channels. Our results compare between swarm-based algorithms and Genetic algorithms, and also show PSO algorithm performance in code estimation process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20estimation" title="Code estimation">Code estimation</a>, <a href="https://publications.waset.org/search?q=Particle%20Swarm%20Optimization%28PSO%29" title=" Particle Swarm Optimization(PSO)"> Particle Swarm Optimization(PSO)</a>, <a href="https://publications.waset.org/search?q=Spread%20spectrum." title=" Spread spectrum."> Spread spectrum.</a> </p> <a href="https://publications.waset.org/12337/spread-spectrum-code-estimationby-particle-swarm-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12337/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12337/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12337/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12337/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12337/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12337/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12337/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12337/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12337/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12337/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12337.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2136</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">717</span> Semi-Blind Two-Dimensional Code Acquisition in CDMA Communications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rui%20Wu">Rui Wu</a>, <a href="https://publications.waset.org/search?q=Tapani%20Ristaniemi"> Tapani Ristaniemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we propose a new algorithm for joint time-delay and direction-of-arrival (DOA) estimation, here called two-dimensional code acquisition, in an asynchronous directsequence code-division multiple-access (DS-CDMA) array system. This algorithm depends on eigenvector-eigenvalue decomposition of sample correlation matrix, and requires to know desired user-s training sequence. The performance of the algorithm is analyzed both analytically and numerically in uncorrelated and coherent multipath environment. Numerical examples show that the algorithm is robust with unknown number of coherent signals.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Two-Dimensional%20Code%20Acquisition" title="Two-Dimensional Code Acquisition">Two-Dimensional Code Acquisition</a>, <a href="https://publications.waset.org/search?q=EV-t" title=" EV-t"> EV-t</a>, <a href="https://publications.waset.org/search?q=DSCDMA" title=" DSCDMA"> DSCDMA</a> </p> <a href="https://publications.waset.org/2408/semi-blind-two-dimensional-code-acquisition-in-cdma-communications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2408/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2408/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2408/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2408/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2408/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2408/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2408/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2408/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2408/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2408/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2408.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1526</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">716</span> Two Approaches to Code Mobility in an Agent-based E-commerce System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Costin%20Badica">Costin Badica</a>, <a href="https://publications.waset.org/search?q=Maria%20Ganzha"> Maria Ganzha</a>, <a href="https://publications.waset.org/search?q=Marcin%20Paprzycki"> Marcin Paprzycki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Recently, a model multi-agent e-commerce system based on mobile buyer agents and transfer of strategy modules was proposed. In this paper a different approach to code mobility is introduced, where agent mobility is replaced by local agent creation supplemented by similar code mobility as in the original proposal. UML diagrams of agents involved in the new approach to mobility and the augmented system activity diagram are presented and discussed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Agent%20system" title="Agent system">Agent system</a>, <a href="https://publications.waset.org/search?q=agent%20mobility" title=" agent mobility"> agent mobility</a>, <a href="https://publications.waset.org/search?q=code%20mobility" title=" code mobility"> code mobility</a>, <a href="https://publications.waset.org/search?q=e-commerce" title=" e-commerce"> e-commerce</a>, <a href="https://publications.waset.org/search?q=UML%20formalization." title=" UML formalization."> UML formalization.</a> </p> <a href="https://publications.waset.org/8510/two-approaches-to-code-mobility-in-an-agent-based-e-commerce-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8510/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8510/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8510/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8510/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8510/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8510/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8510/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8510/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8510/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8510/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8510.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1435</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">715</span> Decoder Design for a New Single Error Correcting/Double Error Detecting Code </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20T.%20Anwar">M. T. Anwar</a>, <a href="https://publications.waset.org/search?q=P.%20K.%20Lala"> P. K. Lala</a>, <a href="https://publications.waset.org/search?q=P.%20Thenappan"> P. Thenappan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the decoder design for the single error correcting and double error detecting code proposed by the authors in an earlier paper. The speed of error detection and correction of a code is largely dependent upon the associated encoder and decoder circuits. The complexity and the speed of such circuits are determined by the number of 1?s in the parity check matrix (PCM). The number of 1?s in the parity check matrix for the code proposed by the authors are fewer than in any currently known single error correcting/double error detecting code. This results in simplified encoding and decoding circuitry for error detection and correction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decoder" title="Decoder">Decoder</a>, <a href="https://publications.waset.org/search?q=Hsiao%20code" title=" Hsiao code"> Hsiao code</a>, <a href="https://publications.waset.org/search?q=Parity%20Check%20Matrix" title=" Parity Check Matrix"> Parity Check Matrix</a>, <a href="https://publications.waset.org/search?q=Syndrome%20Pattern." title=" Syndrome Pattern."> Syndrome Pattern.</a> </p> <a href="https://publications.waset.org/926/decoder-design-for-a-new-single-error-correctingdouble-error-detecting-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/926/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/926/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/926/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/926/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/926/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/926/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/926/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/926/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/926/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/926/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/926.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2080</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">714</span> Variable Rate Superorthogonal Turbo Code with the OVSF Code Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Insah%20Bhurtah">Insah Bhurtah</a>, <a href="https://publications.waset.org/search?q=P.%20Clarel%20Catherine"> P. Clarel Catherine</a>, <a href="https://publications.waset.org/search?q=K.%20M.%20Sunjiv%20Soyjaudah"> K. M. Sunjiv Soyjaudah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>When using modern Code Division Multiple Access (CDMA) in mobile communications, the user must be able to vary the transmission rate of users to allocate bandwidth efficiently. In this work, Orthogonal Variable Spreading Factor (OVSF) codes are used with the same principles applied in a low-rate superorthogonal turbo code due to their variable-length properties. The introduced system is the Variable Rate Superorthogonal Turbo Code (VRSTC) where puncturing is not performed on the encoder’s final output but rather before selecting the output to achieve higher rates. Due to bandwidth expansion, the codes outperform an ordinary turbo code in the AWGN channel. Simulations results show decreased performance compared to those obtained with the employment of Walsh-Hadamard codes. However, with OVSF codes, the VRSTC system keeps the orthogonality of codewords whilst producing variable rate codes contrary to Walsh-Hadamard codes where puncturing is usually performed on the final output.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/search?q=MAP%20Decoding" title=" MAP Decoding"> MAP Decoding</a>, <a href="https://publications.waset.org/search?q=OVSF" title=" OVSF"> OVSF</a>, <a href="https://publications.waset.org/search?q=Superorthogonal%20Turbo%20Code." title=" Superorthogonal Turbo Code. "> Superorthogonal Turbo Code. </a> </p> <a href="https://publications.waset.org/9996956/variable-rate-superorthogonal-turbo-code-with-the-ovsf-code-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9996956/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9996956/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9996956/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9996956/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9996956/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9996956/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9996956/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9996956/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9996956/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9996956/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9996956.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2176</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">713</span> Coloured Reconfigurable Nets for Code Mobility Modeling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kahloul%20Laid">Kahloul Laid</a>, <a href="https://publications.waset.org/search?q=Chaoui%20Allaoua"> Chaoui Allaoua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Code mobility technologies attract more and more developers and consumers. Numerous domains are concerned, many platforms are developed and interest applications are realized. However, developing good software products requires modeling, analyzing and proving steps. The choice of models and modeling languages is so critical on these steps. Formal tools are powerful in analyzing and proving steps. However, poorness of classical modeling language to model mobility requires proposition of new models. The objective of this paper is to provide a specific formalism “Coloured Reconfigurable Nets" and to show how this one seems to be adequate to model different kinds of code mobility.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20mobility" title="Code mobility">Code mobility</a>, <a href="https://publications.waset.org/search?q=modelling%20mobility" title=" modelling mobility"> modelling mobility</a>, <a href="https://publications.waset.org/search?q=labelled%20reconfigurable%20nets" title=" labelled reconfigurable nets"> labelled reconfigurable nets</a>, <a href="https://publications.waset.org/search?q=Coloured%20reconfigurable%20nets" title=" Coloured reconfigurable nets"> Coloured reconfigurable nets</a>, <a href="https://publications.waset.org/search?q=mobile%20code%20design%20paradigms." title=" mobile code design paradigms."> mobile code design paradigms.</a> </p> <a href="https://publications.waset.org/15961/coloured-reconfigurable-nets-for-code-mobility-modeling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15961/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15961/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15961/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15961/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15961/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15961/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15961/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15961/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15961/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15961/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15961.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1558</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">712</span> A Corpus-Based Analysis on Code-Mixing Features in Mandarin-English Bilingual Children in Singapore</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xunan%20Huang">Xunan Huang</a>, <a href="https://publications.waset.org/search?q=Caicai%20Zhang"> Caicai Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper investigated the code-mixing features in Mandarin-English bilingual children in Singapore. First, it examined whether the code-mixing rate was different in Mandarin Chinese and English contexts. Second, it explored the syntactic categories of code-mixing in Singapore bilingual children. Moreover, this study investigated whether morphological information was preserved when inserting syntactic components into the matrix language. Data are derived from the Singapore Bilingual Corpus, in which the recordings and transcriptions of sixty English-Mandarin 5-to-6-year-old children were preserved for analysis. Results indicated that the rate of code-mixing was asymmetrical in the two language contexts, with the rate being significantly higher in the Mandarin context than that in the English context. The asymmetry is related to language dominance in that children are more likely to code-mix when using their nondominant language. Concerning the syntactic categories of code-mixing words in the Singaporean bilingual children, we found that noun-mixing, verb-mixing, and adjective-mixing are the three most frequently used categories in code-mixing in the Mandarin context. This pattern mirrors the syntactic categories of code-mixing in the Cantonese context in Cantonese-English bilingual children, and the general trend observed in lexical borrowing. Third, our results also indicated that English vocabularies that carry morphological information are embedded in bare forms in the Mandarin context. These findings shed light upon how bilingual children take advantage of the two languages in mixed utterances in a bilingual environment.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code-mixing" title="Code-mixing">Code-mixing</a>, <a href="https://publications.waset.org/search?q=Mandarin%20Chinese" title=" Mandarin Chinese"> Mandarin Chinese</a>, <a href="https://publications.waset.org/search?q=English" title=" English"> English</a>, <a href="https://publications.waset.org/search?q=bilingual%20children." title=" bilingual children."> bilingual children.</a> </p> <a href="https://publications.waset.org/10008904/a-corpus-based-analysis-on-code-mixing-features-in-mandarin-english-bilingual-children-in-singapore" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008904/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008904/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008904/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008904/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008904/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008904/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008904/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008904/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008904/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008904/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008904.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1121</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=24">24</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=25">25</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Code%20Clones&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>