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: Gray Code.</title> <meta name="description" content="Search results for: Gray Code."> <meta name="keywords" content="Gray Code."> <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="Gray Code." 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="Gray Code."> <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> 827</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Gray Code.</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">827</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">826</span> Skew Cyclic Codes over Fq+uFq+…+uk-1Fq</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jing%20Li">Jing Li</a>, <a href="https://publications.waset.org/search?q=Xiuli%20Li"> Xiuli Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper studies a special class of linear codes, called skew cyclic codes, over the ring <em>R</em>= <em>F<sub>q</sub></em>+<em>uF<sub>q</sub></em>+…+<em>u<sup>k-</sup></em><sup>1</sup><em>F<sub>q</sub></em>, where <em>q</em> is a prime power. A Gray map <em>ɸ</em> from <em>R</em> to <em>F<sub>q</sub></em> and a Gray map <em>ɸ'</em> from <em>R<sup>n</sup></em> to <em>F<sup>n</sup><sub>q</sub></em> are defined, as well as an automorphism <em>Θ</em> over <em>R</em>. It is proved that the images of skew cyclic codes over <em>R</em> under map <em>ɸ'</em> and <em>Θ</em> are cyclic codes over <em>F<sub>q</sub></em>, and they still keep the dual relation.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Skew%20cyclic%20code" title="Skew cyclic code">Skew cyclic code</a>, <a href="https://publications.waset.org/search?q=gray%20map" title=" gray map"> gray map</a>, <a href="https://publications.waset.org/search?q=automophism" title=" automophism"> automophism</a>, <a href="https://publications.waset.org/search?q=cyclic%20code." title=" cyclic code."> cyclic code.</a> </p> <a href="https://publications.waset.org/10007567/skew-cyclic-codes-over-fqufquk-1fq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007567/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007567/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007567/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007567/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007567/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007567/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007567/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007567/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007567/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007567/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007567.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">1092</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">825</span> Enhancing the Network Security with Gray Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Thomas%20Adi%20Purnomo%20Sidhi">Thomas Adi Purnomo Sidhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Nowadays, network is an essential need in almost every part of human daily activities. People now can seamlessly connect to others through the Internet. With advanced technology, our personal data now can be more easily accessed. One of many components we are concerned for delivering the best network is a security issue. This paper is proposing a method that provides more options for security. This research aims to improve network security by focusing on the physical layer which is the first layer of the OSI model. The layer consists of the basic networking hardware transmission technologies of a network. With the use of observation method, the research produces a schematic design for enhancing the network security through the gray code converter.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network" title="Network">Network</a>, <a href="https://publications.waset.org/search?q=network%20security" title=" network security"> network security</a>, <a href="https://publications.waset.org/search?q=gray%20code" title=" gray code"> gray code</a>, <a href="https://publications.waset.org/search?q=physical%20layer." title=" physical layer."> physical layer.</a> </p> <a href="https://publications.waset.org/10003931/enhancing-the-network-security-with-gray-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003931/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003931/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003931/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003931/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003931/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003931/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003931/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003931/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003931/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003931/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003931.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">2168</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">824</span> Design and Economical Performance of Gray Water Treatment Plant in Rural Region</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bhausaheb%20L.%20Pangarkar">Bhausaheb L. Pangarkar</a>, <a href="https://publications.waset.org/search?q=Saroj%20B.%20Parjane"> Saroj B. Parjane</a>, <a href="https://publications.waset.org/search?q=M.G.%20Sane"> M.G. Sane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In India, the quarrel between the budding human populace and the planet-s unchanging supply of freshwater and falling water tables has strained attention the reuse of gray water as an alternative water resource in rural development. This paper present the finest design of laboratory scale gray water treatment plant, which is a combination of natural and physical operations such as primary settling with cascaded water flow, aeration, agitation and filtration, hence called as hybrid treatment process. The economical performance of the plant for treatment of bathrooms, basins and laundries gray water showed in terms of deduction competency of water pollutants such as COD (83%), TDS (70%), TSS (83%), total hardness (50%), oil and grease (97%), anions (46%) and cations (49%). Hence, this technology could be a good alternative to treat gray water in residential rural area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Gray%20water%20treatment%20plant" title="Gray water treatment plant">Gray water treatment plant</a>, <a href="https://publications.waset.org/search?q=gray%20water" title=" gray water"> gray water</a>, <a href="https://publications.waset.org/search?q=naturaltechnology" title=" naturaltechnology"> naturaltechnology</a>, <a href="https://publications.waset.org/search?q=pollutant." title=" pollutant."> pollutant.</a> </p> <a href="https://publications.waset.org/537/design-and-economical-performance-of-gray-water-treatment-plant-in-rural-region" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/537/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/537/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/537/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/537/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/537/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/537/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/537/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/537/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/537/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/537/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/537.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">4145</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">823</span> Securing Message in Wireless Sensor Network by using New Method of Code Conversions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ahmed%20Chalak%20Shakir">Ahmed Chalak Shakir</a>, <a href="https://publications.waset.org/search?q=GuXuemai"> GuXuemai</a>, <a href="https://publications.waset.org/search?q=Jia%20Min"> Jia Min</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, wireless sensor networks have been paid more interest, are widely used in a lot of commercial and military applications, and may be deployed in critical scenarios (e.g. when a malfunctioning network results in danger to human life or great financial loss). Such networks must be protected against human intrusion by using the secret keys to encrypt the exchange messages between communicating nodes. Both the symmetric and asymmetric methods have their own drawbacks for use in key management. Thus, we avoid the weakness of these two cryptosystems and make use of their advantages to establish a secure environment by developing the new method for encryption depending on the idea of code conversion. The code conversion-s equations are used as the key for designing the proposed system based on the basics of logic gate-s principals. Using our security architecture, we show how to reduce significant attacks on wireless sensor networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=logic%20gates" title="logic gates">logic gates</a>, <a href="https://publications.waset.org/search?q=code%20conversions" title=" code conversions"> code conversions</a>, <a href="https://publications.waset.org/search?q=Gray-code" title=" Gray-code"> Gray-code</a>, <a href="https://publications.waset.org/search?q=and%0Aclustering." title=" and clustering."> and clustering.</a> </p> <a href="https://publications.waset.org/7300/securing-message-in-wireless-sensor-network-by-using-new-method-of-code-conversions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7300/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7300/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7300/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7300/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7300/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7300/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7300/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7300/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7300/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7300/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7300.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">1655</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">822</span> Bit Model Based Key Management Scheme for Secure Group Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Varalakshmi">R. Varalakshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>For the last decade, researchers have started to focus their interest on Multicast Group Key Management Framework. The central research challenge is secure and efficient group key distribution. The present paper is based on the Bit model based Secure Multicast Group key distribution scheme using the most popular absolute encoder output type code named Gray Code. The focus is of two folds. The first fold deals with the reduction of computation complexity which is achieved in our scheme by performing fewer multiplication operations during the key updating process. To optimize the number of multiplication operations, an O(1) time algorithm to multiply two N-bit binary numbers which could be used in an N x N bit-model of reconfigurable mesh is used in this proposed work. The second fold aims at reducing the amount of information stored in the Group Center and group members while performing the update operation in the key content. Comparative analysis to illustrate the performance of various key distribution schemes is shown in this paper and it has been observed that this proposed algorithm reduces the computation and storage complexity significantly. Our proposed algorithm is suitable for high performance computing environment.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multicast%20Group%20key%20distribution" title="Multicast Group key distribution">Multicast Group key distribution</a>, <a href="https://publications.waset.org/search?q=Bit%20model" title=" Bit model"> Bit model</a>, <a href="https://publications.waset.org/search?q=Integer%0D%0AMultiplications" title=" Integer Multiplications"> Integer Multiplications</a>, <a href="https://publications.waset.org/search?q=reconfigurable%20mesh" title=" reconfigurable mesh"> reconfigurable mesh</a>, <a href="https://publications.waset.org/search?q=optimal%20algorithm" title=" optimal algorithm"> optimal algorithm</a>, <a href="https://publications.waset.org/search?q=Gray%20Code" title=" Gray Code"> Gray Code</a>, <a href="https://publications.waset.org/search?q=Computation%20Complexity" title=" Computation Complexity"> Computation Complexity</a>, <a href="https://publications.waset.org/search?q=Storage%20Complexity." title=" Storage Complexity."> Storage Complexity.</a> </p> <a href="https://publications.waset.org/10003002/bit-model-based-key-management-scheme-for-secure-group-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003002/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003002/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003002/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003002/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003002/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003002/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003002/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003002/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003002/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003002/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003002.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">1971</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">821</span> Data Embedding Based on Better Use of Bits in Image Pixels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rehab%20H.%20Alwan">Rehab H. Alwan</a>, <a href="https://publications.waset.org/search?q=Fadhil%20J.%20Kadhim"> Fadhil J. Kadhim</a>, <a href="https://publications.waset.org/search?q=Ahmad%20T.%20Al-Taani"> Ahmad T. Al-Taani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this study, a novel approach of image embedding is introduced. The proposed method consists of three main steps. First, the edge of the image is detected using Sobel mask filters. Second, the least significant bit LSB of each pixel is used. Finally, a gray level connectivity is applied using a fuzzy approach and the ASCII code is used for information hiding. The prior bit of the LSB represents the edged image after gray level connectivity, and the remaining six bits represent the original image with very little difference in contrast. The proposed method embeds three images in one image and includes, as a special case of data embedding, information hiding, identifying and authenticating text embedded within the digital images. Image embedding method is considered to be one of the good compression methods, in terms of reserving memory space. Moreover, information hiding within digital image can be used for security information transfer. The creation and extraction of three embedded images, and hiding text information is discussed and illustrated, in the following sections.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20embedding" title="Image embedding">Image embedding</a>, <a href="https://publications.waset.org/search?q=Edge%20detection" title=" Edge detection"> Edge detection</a>, <a href="https://publications.waset.org/search?q=gray%20level%20connectivity" title=" gray level connectivity"> gray level connectivity</a>, <a href="https://publications.waset.org/search?q=information%20hiding" title=" information hiding"> information hiding</a>, <a href="https://publications.waset.org/search?q=digital%20image%20compression." title=" digital image compression."> digital image compression.</a> </p> <a href="https://publications.waset.org/14545/data-embedding-based-on-better-use-of-bits-in-image-pixels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14545/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14545/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14545/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14545/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14545/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14545/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14545/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14545/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14545/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14545/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14545.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">2148</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">820</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">819</span> Texture Feature Extraction of Infrared River Ice Images using Second-Order Spatial Statistics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bharathi%20P.%20T">Bharathi P. T</a>, <a href="https://publications.waset.org/search?q=P.%20Subashini"> P. Subashini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Ice cover County has a significant impact on rivers as it affects with the ice melting capacity which results in flooding, restrict navigation, modify the ecosystem and microclimate. River ices are made up of different ice types with varying ice thickness, so surveillance of river ice plays an important role. River ice types are captured using infrared imaging camera which captures the images even during the night times. In this paper the river ice infrared texture images are analysed using first-order statistical methods and secondorder statistical methods. The second order statistical methods considered are spatial gray level dependence method, gray level run length method and gray level difference method. The performance of the feature extraction methods are evaluated by using Probabilistic Neural Network classifier and it is found that the first-order statistical method and second-order statistical method yields low accuracy. So the features extracted from the first-order statistical method and second-order statistical method are combined and it is observed that the result of these combined features (First order statistical method + gray level run length method) provides higher accuracy when compared with the features from the first-order statistical method and second-order statistical method alone.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Gray%20Level%20Difference%20Method" title="Gray Level Difference Method">Gray Level Difference Method</a>, <a href="https://publications.waset.org/search?q=Gray%20Level%20Run%0D%0ALength%20Method" title=" Gray Level Run Length Method"> Gray Level Run Length Method</a>, <a href="https://publications.waset.org/search?q=Kurtosis" title=" Kurtosis"> Kurtosis</a>, <a href="https://publications.waset.org/search?q=Probabilistic%20Neural%20Network" title=" Probabilistic Neural Network"> Probabilistic Neural Network</a>, <a href="https://publications.waset.org/search?q=Skewness" title=" Skewness"> Skewness</a>, <a href="https://publications.waset.org/search?q=Spatial%20Gray%20Level%20Dependence%20Method." title=" Spatial Gray Level Dependence Method."> Spatial Gray Level Dependence Method.</a> </p> <a href="https://publications.waset.org/14822/texture-feature-extraction-of-infrared-river-ice-images-using-second-order-spatial-statistics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14822/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14822/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14822/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14822/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14822/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14822/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14822/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14822/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14822/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14822/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14822.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">2908</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">818</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">817</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">1461</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">816</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">815</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">814</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">813</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">812</span> Labeling Method in Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20Motameni">H. Motameni</a>, <a href="https://publications.waset.org/search?q=M.%20Norouzi"> M. Norouzi</a>, <a href="https://publications.waset.org/search?q=M.%20Jahandar"> M. Jahandar</a>, <a href="https://publications.waset.org/search?q=A.%20Hatami"> A. Hatami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper a way of hiding text message (Steganography) in the gray image has been presented. In this method tried to find binary value of each character of text message and then in the next stage, tried to find dark places of gray image (black) by converting the original image to binary image for labeling each object of image by considering on 8 connectivity. Then these images have been converted to RGB image in order to find dark places. Because in this way each sequence of gray color turns into RGB color and dark level of grey image is found by this way if the Gary image is very light the histogram must be changed manually to find just dark places. In the final stage each 8 pixels of dark places has been considered as a byte and binary value of each character has been put in low bit of each byte that was created manually by dark places pixels for increasing security of the main way of steganography (LSB).</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Binary%20image" title="Binary image">Binary image</a>, <a href="https://publications.waset.org/search?q=labeling" title=" labeling"> labeling</a>, <a href="https://publications.waset.org/search?q=low%20bit" title=" low bit"> low bit</a>, <a href="https://publications.waset.org/search?q=neighborhood" title=" neighborhood"> neighborhood</a>, <a href="https://publications.waset.org/search?q=RGB%0D%0Aimage" title=" RGB image"> RGB image</a>, <a href="https://publications.waset.org/search?q=steganography" title=" steganography"> steganography</a>, <a href="https://publications.waset.org/search?q=threshold." title=" threshold."> threshold.</a> </p> <a href="https://publications.waset.org/6371/labeling-method-in-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6371/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6371/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6371/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6371/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6371/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6371/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6371/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6371/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6371/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6371/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6371.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">2138</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">811</span> Generating Class-Based Test Cases for Interface Classes of Object-Oriented Gray-Box Frameworks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jehad%20Al%20Dallal">Jehad Al Dallal</a>, <a href="https://publications.waset.org/search?q=Paul%20Sorenson"> Paul Sorenson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An application framework provides a reusable design and implementation for a family of software systems. Application developers extend the framework to build their particular applications using hooks. Hooks are the places identified to show how to use and customize the framework. Hooks define Framework Interface Classes (FICs) and their possible specifications, which helps in building reusable test cases for the implementations of these classes. In applications developed using gray-box frameworks, FICs inherit framework classes or use them without inheritance. In this paper, a test-case generation technique is extended to build test cases for FICs built for gray-box frameworks. A tool is developed to automate the introduced technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Class%20testing" title="Class testing">Class testing</a>, <a href="https://publications.waset.org/search?q=object-oriented%20framework" title=" object-oriented framework"> object-oriented framework</a>, <a href="https://publications.waset.org/search?q=reusable%0Atest%20case." title=" reusable test case."> reusable test case.</a> </p> <a href="https://publications.waset.org/14414/generating-class-based-test-cases-for-interface-classes-of-object-oriented-gray-box-frameworks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14414/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14414/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14414/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14414/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14414/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14414/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14414/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14414/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14414/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14414/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14414.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">1517</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">810</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">809</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">808</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">807</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">1793</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">806</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">805</span> Multiple Object Tracking using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chen-Chien%20Hsu">Chen-Chien Hsu</a>, <a href="https://publications.waset.org/search?q=Guo-Tang%20Dai"> Guo-Tang Dai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a particle swarm optimization (PSO) based approach for multiple object tracking based on histogram matching. To start with, gray-level histograms are calculated to establish a feature model for each of the target object. The difference between the gray-level histogram corresponding to each particle in the search space and the target object is used as the fitness value. Multiple swarms are created depending on the number of the target objects under tracking. Because of the efficiency and simplicity of the PSO algorithm for global optimization, target objects can be tracked as iterations continue. Experimental results confirm that the proposed PSO algorithm can rapidly converge, allowing real-time tracking of each target object. When the objects being tracked move outside the tracking range, global search capability of the PSO resumes to re-trace the target objects. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=multiple%20object%20tracking" title="multiple object tracking">multiple object tracking</a>, <a href="https://publications.waset.org/search?q=particle%20swarm%0Aoptimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=gray-level%20histogram" title=" gray-level histogram"> gray-level histogram</a>, <a href="https://publications.waset.org/search?q=image" title=" image"> image</a> </p> <a href="https://publications.waset.org/10583/multiple-object-tracking-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10583/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10583/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10583/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10583/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10583/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10583/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10583/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10583/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10583/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10583/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10583.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">4100</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">804</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">803</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">1940</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">802</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">801</span> Local Mesh Co-Occurrence Pattern for Content Based Image Retrieval</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Yesubai%20Rubavathi">C. Yesubai Rubavathi</a>, <a href="https://publications.waset.org/search?q=R.%20Ravi"> R. Ravi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the local mesh co-occurrence patterns (LMCoP) using HSV color space for image retrieval system. HSV color space is used in this method to utilize color, intensity and brightness of images. Local mesh patterns are applied to define the local information of image and gray level co-occurrence is used to obtain the co-occurrence of LMeP pixels. Local mesh co-occurrence pattern extracts the local directional information from local mesh pattern and converts it into a well-mannered feature vector using gray level co-occurrence matrix. The proposed method is tested on three different databases called MIT VisTex, Corel, and STex. Also, this algorithm is compared with existing methods, and results in terms of precision and recall are shown in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Content-based%20image%20retrieval%20system" title="Content-based image retrieval system">Content-based image retrieval system</a>, <a href="https://publications.waset.org/search?q=HSV%20color%0D%0Aspace" title=" HSV color space"> HSV color space</a>, <a href="https://publications.waset.org/search?q=gray%20level%20co-occurrence%20matrix" title=" gray level co-occurrence matrix"> gray level co-occurrence matrix</a>, <a href="https://publications.waset.org/search?q=local%20mesh%20pattern." title=" local mesh pattern."> local mesh pattern.</a> </p> <a href="https://publications.waset.org/10002132/local-mesh-co-occurrence-pattern-for-content-based-image-retrieval" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002132/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002132/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002132/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002132/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002132/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002132/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002132/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002132/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002132/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002132/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002132.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">2222</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">800</span> Image Mapping with Cumulative Distribution Function for Quick Convergence of Counter Propagation Neural Networks in Image Compression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Anna%20Durai">S. Anna Durai</a>, <a href="https://publications.waset.org/search?q=E.%20Anna%20Saro"> E. Anna Saro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In general the images used for compression are of different types like dark image, high intensity image etc. When these images are compressed using Counter Propagation Neural Network, it takes longer time to converge. The reason for this is that the given image may contain a number of distinct gray levels with narrow difference with their neighborhood pixels. If the gray levels of the pixels in an image and their neighbors are mapped in such a way that the difference in the gray levels of the neighbor with the pixel is minimum, then compression ratio as well as the convergence of the network can be improved. To achieve this, a Cumulative Distribution Function is estimated for the image and it is used to map the image pixels. When the mapped image pixels are used the Counter Propagation Neural Network yield high compression ratio as well as it converges quickly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Correlation" title="Correlation">Correlation</a>, <a href="https://publications.waset.org/search?q=Counter%20Propagation%20Neural%20Networks" title=" Counter Propagation Neural Networks"> Counter Propagation Neural Networks</a>, <a href="https://publications.waset.org/search?q=Cummulative%20Distribution%20Function" title="Cummulative Distribution Function">Cummulative Distribution Function</a>, <a href="https://publications.waset.org/search?q=Image%20compression." title=" Image compression."> Image compression.</a> </p> <a href="https://publications.waset.org/2194/image-mapping-with-cumulative-distribution-function-for-quick-convergence-of-counter-propagation-neural-networks-in-image-compression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2194/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2194/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2194/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2194/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2194/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2194/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2194/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2194/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2194/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2194/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2194.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">1670</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">799</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">798</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> <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=Gray%0ACode.&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&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=Gray%0ACode.&page=27">27</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&page=28">28</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Gray%0ACode.&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>