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: coding rules</title> <meta name="description" content="Search results for: coding rules"> <meta name="keywords" content="coding rules"> <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="coding rules" 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/abstracts/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="coding rules"> <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> 1690</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: coding rules</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1690</span> A Study on Puzzle-Based Game to Teach Elementary Students to Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaisoon%20Baek">Jaisoon Baek</a>, <a href="https://publications.waset.org/abstracts/search?q=Gyuhwan%20Oh"> Gyuhwan Oh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we developed a puzzle game based on coding and a web-based management system to observe the user's learning status in real time and maximize the understanding of the coding of elementary students. We have improved upon and existing coding game which cannot be connected to textual language coding or comprehends learning state. We analyzed the syntax of various coding languages for the curriculum and provided a menu to convert icon into textual coding languages. In addition, the management system includes multiple types of tutoring, real-time analysis of user play data and feedback. Following its application in regular elementary school software classes, students reported positive effects on understanding and interest in coding were shown by students. It is expected that this will contribute to quality improvement in software education by providing contents with proven educational value by breaking away from simple learning-oriented coding games. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coding%20education" title="coding education">coding education</a>, <a href="https://publications.waset.org/abstracts/search?q=serious%20game" title=" serious game"> serious game</a>, <a href="https://publications.waset.org/abstracts/search?q=coding" title=" coding"> coding</a>, <a href="https://publications.waset.org/abstracts/search?q=education%20management%20system" title=" education management system"> education management system</a> </p> <a href="https://publications.waset.org/abstracts/103630/a-study-on-puzzle-based-game-to-teach-elementary-students-to-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103630.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">141</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1689</span> Computational Thinking Based Coding Environment for Coding and Free Semester Mathematics Education in Korea</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Han%20Hyuk%20Cho">Han Hyuk Cho</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanik%20Jo"> Hanik Jo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, coding education has been globally emphasized, and the Free Semester System and coding education were introduced to the public schools from the beginning of 2016 and 2018 respectively in Korea. With the introduction of the Free Semester System and the rising demand of Computational Thinking (CT) capacity, this paper aims to design ‘Coding Environment’ and Minecraft-like Turtlecraft in which learners can design and construct mathematical objects through mathematical symbolic expressions. Students can transfer the constructed mathematical objects to the Turtlecraft environment (open-source codingmath website), and also can print them out through 3D printers. Furthermore, we design learnable mathematics and coding curriculum by representing the figurate numbers and patterns in terms of executable expression in the coding context and connecting them to algebraic symbols, which will allow students to experience mathematical patterns and symbolic coding expressions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coding%20education" title="coding education">coding education</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20thinking" title=" computational thinking"> computational thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematics%20education" title=" mathematics education"> mathematics education</a>, <a href="https://publications.waset.org/abstracts/search?q=TurtleMAL%20and%20Turtlecraft" title=" TurtleMAL and Turtlecraft"> TurtleMAL and Turtlecraft</a> </p> <a href="https://publications.waset.org/abstracts/96410/computational-thinking-based-coding-environment-for-coding-and-free-semester-mathematics-education-in-korea" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96410.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">206</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1688</span> A High Compression Ratio for a Losseless Image Compression Based on the Arithmetic Coding with the Sorted Run Length Coding: Meteosat Second Generation Image Compression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cherifi%20Mehdi">Cherifi Mehdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahdir%20Mourad"> Lahdir Mourad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ameur%20Soltane"> Ameur Soltane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image compression is the heart of several multimedia techniques. It is used to reduce the number of bits required to represent an image. Meteosat Second Generation (MSG) satellite allows the acquisition of 12 image files every 15 minutes and that results in a large databases sizes. In this paper, a novel image compression method based on the arithmetic coding with the sorted Run Length Coding (SRLC) for MSG images is proposed. The SRLC allows us to find the occurrence of the consecutive pixels of the original image to create a sorted run. The arithmetic coding allows the encoding of the sorted data of the previous stage to retrieve a unique code word that represents a binary code stream in the sorted order to boost the compression ratio. Through this article, we show that our method can perform the best results concerning compression ratio and bit rate unlike the method based on the Run Length Coding (RLC) and the arithmetic coding. Evaluation criteria like the compression ratio and the bit rate allow the confirmation of the efficiency of our method of image compression. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title="image compression">image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=arithmetic%20coding" title=" arithmetic coding"> arithmetic coding</a>, <a href="https://publications.waset.org/abstracts/search?q=Run%20Length%20Coding" title=" Run Length Coding"> Run Length Coding</a>, <a href="https://publications.waset.org/abstracts/search?q=RLC" title=" RLC"> RLC</a>, <a href="https://publications.waset.org/abstracts/search?q=Sorted%20Run%20Length%20Coding" title=" Sorted Run Length Coding"> Sorted Run Length Coding</a>, <a href="https://publications.waset.org/abstracts/search?q=SRLC" title=" SRLC"> SRLC</a>, <a href="https://publications.waset.org/abstracts/search?q=Meteosat%20Second%20Generation" title=" Meteosat Second Generation"> Meteosat Second Generation</a>, <a href="https://publications.waset.org/abstracts/search?q=MSG" title=" MSG"> MSG</a> </p> <a href="https://publications.waset.org/abstracts/16704/a-high-compression-ratio-for-a-losseless-image-compression-based-on-the-arithmetic-coding-with-the-sorted-run-length-coding-meteosat-second-generation-image-compression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16704.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">354</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1687</span> Spread Spectrum with Notch Frequency Using Pulse Coding Method for Switching Converter of Communication Equipment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yasunori%20Kobori">Yasunori Kobori</a>, <a href="https://publications.waset.org/abstracts/search?q=Futoshi%20Fukaya"> Futoshi Fukaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Takuya%20Arafune"> Takuya Arafune</a>, <a href="https://publications.waset.org/abstracts/search?q=Nobukazu%20Tsukiji"> Nobukazu Tsukiji</a>, <a href="https://publications.waset.org/abstracts/search?q=Nobukazu%20Takai"> Nobukazu Takai</a>, <a href="https://publications.waset.org/abstracts/search?q=Haruo%20Kobayashi"> Haruo Kobayashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an EMI spread spectrum technique to enable to set notch frequencies using pulse coding method for DC-DC switching converters of communication equipment. The notches in the spectrum of the switching pulses appear at the frequencies obtained from empirically derived equations with the proposed spread spectrum technique using the pulse coding methods, the PWM (Pulse Width Modulation) coding or the PCM (Pulse Cycle Modulation) coding. This technique would be useful for the switching converters in the communication equipment which receives standard radio waves, without being affected by noise from the switching converters. In our proposed technique, the notch frequencies in the spectrum depend on the pulse coding method. We have investigated this technique to apply to the switching converters and found that there is good relationship agreement between the notch frequencies and the empirical equations. The notch frequencies with the PWM coding is equal to the equation F=k/(WL-WS). With the PCM coding, that is equal to the equation F=k/(TL-TS). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=notch%20frequency" title="notch frequency">notch frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=pulse%20coding" title=" pulse coding"> pulse coding</a>, <a href="https://publications.waset.org/abstracts/search?q=spread%20spectrum" title=" spread spectrum"> spread spectrum</a>, <a href="https://publications.waset.org/abstracts/search?q=switching%20converter" title=" switching converter"> switching converter</a> </p> <a href="https://publications.waset.org/abstracts/44582/spread-spectrum-with-notch-frequency-using-pulse-coding-method-for-switching-converter-of-communication-equipment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44582.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">374</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1686</span> Medical Image Compression by Region of Interest Based on DT-CWT Using Run-length Coding and Huffman Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Seddiki">Ali Seddiki</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Djebbouri"> Mohamed Djebbouri</a>, <a href="https://publications.waset.org/abstracts/search?q=Driss%20Guerchi"> Driss Guerchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Medical imaging produces human body pictures in digital form. Since these imaging techniques produce prohibitive amounts of data, compression is necessary for storage and communication purposes. In some areas in medicine, it may be sufficient to maintain high image quality only in region of interest (ROI). This paper discusses a contribution to quality purpose compression in the region of interest of scintigraphic images based on dual tree complex wavelet transform (DT-CWT) using Run-Length coding (RLE) and Huffman coding (HC). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DT-CWT" title="DT-CWT">DT-CWT</a>, <a href="https://publications.waset.org/abstracts/search?q=region%20of%20interest" title=" region of interest"> region of interest</a>, <a href="https://publications.waset.org/abstracts/search?q=run%20length%20coding" title=" run length coding"> run length coding</a>, <a href="https://publications.waset.org/abstracts/search?q=Scintigraphic%20images" title=" Scintigraphic images"> Scintigraphic images</a> </p> <a href="https://publications.waset.org/abstracts/40076/medical-image-compression-by-region-of-interest-based-on-dt-cwt-using-run-length-coding-and-huffman-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40076.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">282</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1685</span> The Increasing Importance of CFC Rules: An OECD+ Country Overview</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Axel%20Prettl">Axel Prettl</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper provides an overview of the different CFC rule settings in the OECD and 22 additional countries for the years 2004 to 2014 and compares them. In order to do so, it gives a summary of law amendments for every country, provides a comparison and afterwards all CFC rules are rated in their ”power of anti-avoidance” over time. For that rating of CFC rules, the largest common denominator of rule characteristics is used to keep it as abstract as necessary and possible. The paper points out that the CFC rules in the considered countries are very different in their specifications and they reach from very strict to very low binding. All in all these rules get more and more common and important; more countries implement a CFC legislation and the strictness of most of them rises over time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CFC%20rules" title="CFC rules">CFC rules</a>, <a href="https://publications.waset.org/abstracts/search?q=international%20taxation" title=" international taxation"> international taxation</a>, <a href="https://publications.waset.org/abstracts/search?q=corporate%20taxation" title=" corporate taxation"> corporate taxation</a>, <a href="https://publications.waset.org/abstracts/search?q=country%20comparison" title=" country comparison"> country comparison</a> </p> <a href="https://publications.waset.org/abstracts/46197/the-increasing-importance-of-cfc-rules-an-oecd-country-overview" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46197.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">310</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1684</span> Improved Performance Using Adaptive Pre-Coding in the Cellular Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim">Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Hyun%20Ro"> Jae-Hyun Ro</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang-Bin%20Ha"> Chang-Bin Ha</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes the cooperative transmission scheme with pre-coding because the cellular communication requires high reliability. The cooperative transmission scheme uses pre-coding method with limited feedback information among small cells. Particularly, the proposed scheme has adaptive mode according to the position of mobile station. Thus, demand of recent wireless communication is resolved by this scheme. From the simulation results, the proposed scheme has better performance compared to the conventional scheme in the cellular network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CDD" title="CDD">CDD</a>, <a href="https://publications.waset.org/abstracts/search?q=cellular%20network" title=" cellular network"> cellular network</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-coding" title=" pre-coding"> pre-coding</a>, <a href="https://publications.waset.org/abstracts/search?q=SPC" title=" SPC"> SPC</a> </p> <a href="https://publications.waset.org/abstracts/42216/improved-performance-using-adaptive-pre-coding-in-the-cellular-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42216.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">569</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1683</span> Usage of Channel Coding Techniques for Peak-to-Average Power Ratio Reduction in Visible Light Communications Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20L.%20D.%20N.%20M.%20de%20Silva">P. L. D. N. M. de Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20G.%20Edirisinghe"> S. G. Edirisinghe</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Weerasuriya"> R. Weerasuriya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High peak-to-average power ratio (PAPR) is a concern of orthogonal frequency division multiplexing (OFDM) based visible light communication (VLC) systems. Discrete Fourier Transform spread (DFT-s) OFDM is an alternative single carrier modulation scheme which would address this concern. Employing channel coding techniques is another mechanism to reduce the PAPR. Previous research has been conducted to study the impact of these techniques separately. However, to the best of the knowledge of the authors, no study has been done so far to identify the improvement which can be harnessed by hybridizing these two techniques for VLC systems. Therefore, this is a novel study area under this research. In addition, channel coding techniques such as Polar codes and Turbo codes have been tested in the VLC domain. However, other efficient techniques such as Hamming coding and Convolutional coding have not been studied too. Therefore, the authors present the impact of the hybrid of DFT-s OFDM and Channel coding (Hamming coding and Convolutional coding) on PAPR in VLC systems using Matlab simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convolutional%20coding" title="convolutional coding">convolutional coding</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20Fourier%20transform%20spread%20orthogonal%20frequency%20division%20multiplexing" title=" discrete Fourier transform spread orthogonal frequency division multiplexing"> discrete Fourier transform spread orthogonal frequency division multiplexing</a>, <a href="https://publications.waset.org/abstracts/search?q=hamming%20coding" title=" hamming coding"> hamming coding</a>, <a href="https://publications.waset.org/abstracts/search?q=peak-to-average%20power%20ratio" title=" peak-to-average power ratio"> peak-to-average power ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=visible%20light%20communications" title=" visible light communications"> visible light communications</a> </p> <a href="https://publications.waset.org/abstracts/150222/usage-of-channel-coding-techniques-for-peak-to-average-power-ratio-reduction-in-visible-light-communications-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150222.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">154</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1682</span> Image Steganography Using Predictive Coding for Secure Transmission</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Baljit%20Singh%20Khehra">Baljit Singh Khehra</a>, <a href="https://publications.waset.org/abstracts/search?q=Jagreeti%20Kaur"> Jagreeti Kaur </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, steganographic strategy is used to hide the text file inside an image. To increase the storage limit, predictive coding is utilized to implant information. In the proposed plan, one can exchange secure information by means of predictive coding methodology. The predictive coding produces high stego-image. The pixels are utilized to insert mystery information in it. The proposed information concealing plan is powerful as contrasted with the existing methodologies. By applying this strategy, a provision helps clients to productively conceal the information. Entropy, standard deviation, mean square error and peak signal noise ratio are the parameters used to evaluate the proposed methodology. The results of proposed approach are quite promising. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20image" title=" reversible image"> reversible image</a>, <a href="https://publications.waset.org/abstracts/search?q=predictive%20coding" title=" predictive coding"> predictive coding</a> </p> <a href="https://publications.waset.org/abstracts/9850/image-steganography-using-predictive-coding-for-secure-transmission" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9850.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">417</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1681</span> Semi-Automatic Method to Assist Expert for Association Rules Validation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amdouni%20Hamida">Amdouni Hamida</a>, <a href="https://publications.waset.org/abstracts/search?q=Gammoudi%20Mohamed%20Mohsen"> Gammoudi Mohamed Mohsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to help the expert to validate association rules extracted from data, some quality measures are proposed in the literature. We distinguish two categories: objective and subjective measures. The first one depends on a fixed threshold and on data quality from which the rules are extracted. The second one consists on providing to the expert some tools in the objective to explore and visualize rules during the evaluation step. However, the number of extracted rules to validate remains high. Thus, the manually mining rules task is very hard. To solve this problem, we propose, in this paper, a semi-automatic method to assist the expert during the association rule's validation. Our method uses rule-based classification as follow: (i) We transform association rules into classification rules (classifiers), (ii) We use the generated classifiers for data classification. (iii) We visualize association rules with their quality classification to give an idea to the expert and to assist him during validation process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=rule-based%20classification" title=" rule-based classification"> rule-based classification</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20quality" title=" classification quality"> classification quality</a>, <a href="https://publications.waset.org/abstracts/search?q=validation" title=" validation"> validation</a> </p> <a href="https://publications.waset.org/abstracts/29443/semi-automatic-method-to-assist-expert-for-association-rules-validation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29443.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">439</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1680</span> Adaptive Multiple Transforms Hardware Architecture for Versatile Video Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Damak">T. Damak</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Houidi"> S. Houidi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Ben%20Ayed"> M. A. Ben Ayed</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Masmoudi"> N. Masmoudi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Versatile Video Coding standard (VVC) is actually under development by the Joint Video Exploration Team (or JVET). An Adaptive Multiple Transforms (AMT) approach was announced. It is based on different transform modules that provided an efficient coding. However, the AMT solution raises several issues especially regarding the complexity of the selected set of transforms. This can be an important issue, particularly for a future industrial adoption. This paper proposed an efficient hardware implementation of the most used transform in AMT approach: the DCT II. The developed circuit is adapted to different block sizes and can reach a minimum frequency of 192 MHz allowing an optimized execution time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20multiple%20transforms" title="adaptive multiple transforms">adaptive multiple transforms</a>, <a href="https://publications.waset.org/abstracts/search?q=AMT" title=" AMT"> AMT</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT%20II" title=" DCT II"> DCT II</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware" title=" hardware"> hardware</a>, <a href="https://publications.waset.org/abstracts/search?q=transform" title=" transform"> transform</a>, <a href="https://publications.waset.org/abstracts/search?q=versatile%20video%20coding" title=" versatile video coding"> versatile video coding</a>, <a href="https://publications.waset.org/abstracts/search?q=VVC" title=" VVC"> VVC</a> </p> <a href="https://publications.waset.org/abstracts/108705/adaptive-multiple-transforms-hardware-architecture-for-versatile-video-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108705.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">146</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1679</span> Scintigraphic Image Coding of Region of Interest Based on SPIHT Algorithm Using Global Thresholding and Huffman Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Seddiki">A. Seddiki</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Djebbouri"> M. Djebbouri</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Guerchi"> D. Guerchi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Medical imaging produces human body pictures in digital form. Since these imaging techniques produce prohibitive amounts of data, compression is necessary for storage and communication purposes. Many current compression schemes provide a very high compression rate but with considerable loss of quality. On the other hand, in some areas in medicine, it may be sufficient to maintain high image quality only in region of interest (ROI). This paper discusses a contribution to the lossless compression in the region of interest of Scintigraphic images based on SPIHT algorithm and global transform thresholding using Huffman coding. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20thresholding%20transform" title="global thresholding transform">global thresholding transform</a>, <a href="https://publications.waset.org/abstracts/search?q=huffman%20coding" title=" huffman coding"> huffman coding</a>, <a href="https://publications.waset.org/abstracts/search?q=region%20of%20interest" title=" region of interest"> region of interest</a>, <a href="https://publications.waset.org/abstracts/search?q=SPIHT%20coding" title=" SPIHT coding"> SPIHT coding</a>, <a href="https://publications.waset.org/abstracts/search?q=scintigraphic%20images" title=" scintigraphic images"> scintigraphic images</a> </p> <a href="https://publications.waset.org/abstracts/17067/scintigraphic-image-coding-of-region-of-interest-based-on-spiht-algorithm-using-global-thresholding-and-huffman-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17067.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">367</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1678</span> Identifying Protein-Coding and Non-Coding Regions in Transcriptomes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Angela%20U.%20Makolo">Angela U. Makolo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Protein-coding and Non-coding regions determine the biology of a sequenced transcriptome. Research advances have shown that Non-coding regions are important in disease progression and clinical diagnosis. Existing bioinformatics tools have been targeted towards Protein-coding regions alone. Therefore, there are challenges associated with gaining biological insights from transcriptome sequence data. These tools are also limited to computationally intensive sequence alignment, which is inadequate and less accurate to identify both Protein-coding and Non-coding regions. Alignment-free techniques can overcome the limitation of identifying both regions. Therefore, this study was designed to develop an efficient sequence alignment-free model for identifying both Protein-coding and Non-coding regions in sequenced transcriptomes. Feature grouping and randomization procedures were applied to the input transcriptomes (37,503 data points). Successive iterations were carried out to compute the gradient vector that converged the developed Protein-coding and Non-coding Region Identifier (PNRI) model to the approximate coefficient vector. The logistic regression algorithm was used with a sigmoid activation function. A parameter vector was estimated for every sample in 37,503 data points in a bid to reduce the generalization error and cost. Maximum Likelihood Estimation (MLE) was used for parameter estimation by taking the log-likelihood of six features and combining them into a summation function. Dynamic thresholding was used to classify the Protein-coding and Non-coding regions, and the Receiver Operating Characteristic (ROC) curve was determined. The generalization performance of PNRI was determined in terms of F1 score, accuracy, sensitivity, and specificity. The average generalization performance of PNRI was determined using a benchmark of multi-species organisms. The generalization error for identifying Protein-coding and Non-coding regions decreased from 0.514 to 0.508 and to 0.378, respectively, after three iterations. The cost (difference between the predicted and the actual outcome) also decreased from 1.446 to 0.842 and to 0.718, respectively, for the first, second and third iterations. The iterations terminated at the 390th epoch, having an error of 0.036 and a cost of 0.316. The computed elements of the parameter vector that maximized the objective function were 0.043, 0.519, 0.715, 0.878, 1.157, and 2.575. The PNRI gave an ROC of 0.97, indicating an improved predictive ability. The PNRI identified both Protein-coding and Non-coding regions with an F1 score of 0.970, accuracy (0.969), sensitivity (0.966), and specificity of 0.973. Using 13 non-human multi-species model organisms, the average generalization performance of the traditional method was 74.4%, while that of the developed model was 85.2%, thereby making the developed model better in the identification of Protein-coding and Non-coding regions in transcriptomes. The developed Protein-coding and Non-coding region identifier model efficiently identified the Protein-coding and Non-coding transcriptomic regions. It could be used in genome annotation and in the analysis of transcriptomes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sequence%20alignment-free%20model" title="sequence alignment-free model">sequence alignment-free model</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20thresholding%20classification" title=" dynamic thresholding classification"> dynamic thresholding classification</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20randomization" title=" input randomization"> input randomization</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20annotation" title=" genome annotation"> genome annotation</a> </p> <a href="https://publications.waset.org/abstracts/183177/identifying-protein-coding-and-non-coding-regions-in-transcriptomes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183177.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">68</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1677</span> Network Coding with Buffer Scheme in Multicast for Broadband Wireless Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gunasekaran%20Raja">Gunasekaran Raja</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramkumar%20Jayaraman"> Ramkumar Jayaraman</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajakumar%20Arul"> Rajakumar Arul</a>, <a href="https://publications.waset.org/abstracts/search?q=Kottilingam%20Kottursamy"> Kottilingam Kottursamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Broadband Wireless Network (BWN) is the promising technology nowadays due to the increased number of smartphones. Buffering scheme using network coding considers the reliability and proper degree distribution in Worldwide interoperability for Microwave Access (WiMAX) multi-hop network. Using network coding, a secure way of transmission is performed which helps in improving throughput and reduces the packet loss in the multicast network. At the outset, improved network coding is proposed in multicast wireless mesh network. Considering the problem of performance overhead, degree distribution makes a decision while performing buffer in the encoding / decoding process. Consequently, BuS (Buffer Scheme) based on network coding is proposed in the multi-hop network. Here the encoding process introduces buffer for temporary storage to transmit packets with proper degree distribution. The simulation results depend on the number of packets received in the encoding/decoding with proper degree distribution using buffering scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encoding%20and%20decoding" title="encoding and decoding">encoding and decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer" title=" buffer"> buffer</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20coding" title=" network coding"> network coding</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20distribution" title=" degree distribution"> degree distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=broadband%20wireless%20networks" title=" broadband wireless networks"> broadband wireless networks</a>, <a href="https://publications.waset.org/abstracts/search?q=multicast" title=" multicast"> multicast</a> </p> <a href="https://publications.waset.org/abstracts/48856/network-coding-with-buffer-scheme-in-multicast-for-broadband-wireless-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48856.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">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1676</span> A Method for Reduction of Association Rules in Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diego%20De%20Castro%20Rodrigues">Diego De Castro Rodrigues</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcelo%20Lisboa%20Rocha"> Marcelo Lisboa Rocha</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniela%20M.%20De%20Q.%20Trevisan"> Daniela M. De Q. Trevisan</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcos%20Dias%20Da%20Conceicao"> Marcos Dias Da Conceicao</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Rosa"> Gabriel Rosa</a>, <a href="https://publications.waset.org/abstracts/search?q=Rommel%20M.%20Barbosa"> Rommel M. Barbosa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of association rules algorithms within data mining is recognized as being of great value in the knowledge discovery in databases. Very often, the number of rules generated is high, sometimes even in databases with small volume, so the success in the analysis of results can be hampered by this quantity. The purpose of this research is to present a method for reducing the quantity of rules generated with association algorithms. Therefore, a computational algorithm was developed with the use of a Weka Application Programming Interface, which allows the execution of the method on different types of databases. After the development, tests were carried out on three types of databases: synthetic, model, and real. Efficient results were obtained in reducing the number of rules, where the worst case presented a gain of more than 50%, considering the concepts of support, confidence, and lift as measures. This study concluded that the proposed model is feasible and quite interesting, contributing to the analysis of the results of association rules generated from the use of algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=rules%20reduction" title=" rules reduction"> rules reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a> </p> <a href="https://publications.waset.org/abstracts/110517/a-method-for-reduction-of-association-rules-in-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110517.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">161</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1675</span> Coding and Decoding versus Space Diversity for ‎Rayleigh Fading Radio Frequency Channels ‎</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Mahmoud%20Ahmed%20Abouelmagd">Ahmed Mahmoud Ahmed Abouelmagd </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The diversity is the usual remedy of the transmitted signal level variations (Fading phenomena) in radio frequency channels. Diversity techniques utilize two or more copies of a signal and combine those signals to combat fading. The basic concept of diversity is to transmit the signal via several independent diversity branches to get independent signal replicas via time – frequency - space - and polarization diversity domains. Coding and decoding processes can be an alternative remedy for fading phenomena, it cannot increase the channel capacity, but it can improve the error performance. In this paper we propose the use of replication decoding with BCH code class, and Viterbi decoding algorithm with convolution coding; as examples of coding and decoding processes. The results are compared to those obtained from two optimized selection space diversity techniques. The performance of Rayleigh fading channel, as the model considered for radio frequency channels, is evaluated for each case. The evaluation results show that the coding and decoding approaches, especially the BCH coding approach with replication decoding scheme, give better performance compared to that of selection space diversity optimization approaches. Also, an approach for combining the coding and decoding diversity as well as the space diversity is considered, the main disadvantage of this approach is its complexity but it yields good performance results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rayleigh%20fading" title="Rayleigh fading">Rayleigh fading</a>, <a href="https://publications.waset.org/abstracts/search?q=diversity" title=" diversity"> diversity</a>, <a href="https://publications.waset.org/abstracts/search?q=BCH%20codes" title=" BCH codes"> BCH codes</a>, <a href="https://publications.waset.org/abstracts/search?q=Replication%20decoding" title=" Replication decoding"> Replication decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=%E2%80%8Econvolution%20coding" title=" ‎convolution coding"> ‎convolution coding</a>, <a href="https://publications.waset.org/abstracts/search?q=viterbi%20decoding" title=" viterbi decoding"> viterbi decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20diversity" title=" space diversity"> space diversity</a> </p> <a href="https://publications.waset.org/abstracts/19844/coding-and-decoding-versus-space-diversity-for-rayleigh-fading-radio-frequency-channels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19844.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">443</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1674</span> A Guide to User-Friendly Bash Prompt: Adding Natural Language Processing Plus Bash Explanation to the Command Interface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Teh%20Kean%20Kheng">Teh Kean Kheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Low%20Soon%20Yee"> Low Soon Yee</a>, <a href="https://publications.waset.org/abstracts/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 2022, as the future world becomes increasingly computer-related, more individuals are attempting to study coding for themselves or in school. This is because they have discovered the value of learning code and the benefits it will provide them. But learning coding is difficult for most people. Even senior programmers that have experience for a decade year still need help from the online source while coding. The reason causing this is that coding is not like talking to other people; it has the specific syntax to make the computer understand what we want it to do, so coding will be hard for normal people if they don’t have contact in this field before. Coding is hard. If a user wants to learn bash code with bash prompt, it will be harder because if we look at the bash prompt, we will find that it is just an empty box and waiting for a user to tell the computer what we want to do, if we don’t refer to the internet, we will not know what we can do with the prompt. From here, we can conclude that the bash prompt is not user-friendly for new users who are learning bash code. Our goal in writing this paper is to give an idea to implement a user-friendly Bash prompt in Ubuntu OS using Artificial Intelligent (AI) to lower the threshold of learning in Bash code, to make the user use their own words and concept to write and learn Bash code. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=user-friendly" title="user-friendly">user-friendly</a>, <a href="https://publications.waset.org/abstracts/search?q=bash%20code" title=" bash code"> bash code</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold" title=" threshold"> threshold</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20similarity" title=" semantic similarity"> semantic similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=lexical%20similarity" title=" lexical similarity"> lexical similarity</a> </p> <a href="https://publications.waset.org/abstracts/161116/a-guide-to-user-friendly-bash-prompt-adding-natural-language-processing-plus-bash-explanation-to-the-command-interface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161116.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">142</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1673</span> Polymorphic Positions, Haplotypes, and Mutations Detected In The Mitochonderial DNA Coding Region By Sanger Sequence Technique </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Imad%20H.%20Hameed">Imad H. Hameed</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20A.%20Jebor"> Mohammad A. Jebor</a>, <a href="https://publications.waset.org/abstracts/search?q=Ammera%20J.%20Omer"> Ammera J. Omer </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this research is to study the mitochonderial coding region by using the Sanger sequencing technique and establish the degree of variation characteristic of a fragment. FTA® Technology (FTA™ paper DNA extraction) utilized to extract DNA. Portion of coding region encompassing positions 11719 –12384 amplified in accordance with the Anderson reference sequence. PCR products purified by EZ-10 spin column then sequenced and Detected by using the ABI 3730xL DNA Analyzer. Five new polymorphic positions 11741, 11756, 11878, 11887 and 12133 are described may be suitable sources for identification purpose in future. The calculated value D= 0.95 and RMP=0.048 of the genetic diversity should be understood as high in the context of coding function of the analysed DNA fragment. The relatively high gene diversity and a relatively low random match probability were observed in Iraq population. The obtained data can be used to identify the variable nucleotide positions characterized by frequent occurrence which is most promising for various identifications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coding%20region" title="coding region">coding region</a>, <a href="https://publications.waset.org/abstracts/search?q=Iraq" title=" Iraq"> Iraq</a>, <a href="https://publications.waset.org/abstracts/search?q=mitochondrial%20DNA" title=" mitochondrial DNA"> mitochondrial DNA</a>, <a href="https://publications.waset.org/abstracts/search?q=polymorphic%20positions" title=" polymorphic positions"> polymorphic positions</a>, <a href="https://publications.waset.org/abstracts/search?q=sanger%20technique" title=" sanger technique"> sanger technique</a> </p> <a href="https://publications.waset.org/abstracts/2065/polymorphic-positions-haplotypes-and-mutations-detected-in-the-mitochonderial-dna-coding-region-by-sanger-sequence-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2065.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">437</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1672</span> A Hybrid P2P Storage Scheme Based on Erasure Coding and Replication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Usman%20Mahmood">Usman Mahmood</a>, <a href="https://publications.waset.org/abstracts/search?q=Khawaja%20M.%20U.%20Suleman"> Khawaja M. U. Suleman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A peer-to-peer storage system has challenges like; peer availability, data protection, churn rate. To address these challenges different redundancy, replacement and repair schemes are used. This paper presents a hybrid scheme of redundancy using replication and erasure coding. We calculate and compare the storage, access, and maintenance costs of our proposed scheme with existing redundancy schemes. For realistic behaviour of peers a trace of live peer-to-peer system is used. The effect of different replication, and repair schemes are also shown. The proposed hybrid scheme performs better than existing double coding hybrid scheme in all metrics and have an improved maintenance cost than hierarchical codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=erasure%20coding" title="erasure coding">erasure coding</a>, <a href="https://publications.waset.org/abstracts/search?q=P2P" title=" P2P"> P2P</a>, <a href="https://publications.waset.org/abstracts/search?q=redundancy" title=" redundancy"> redundancy</a>, <a href="https://publications.waset.org/abstracts/search?q=replication" title=" replication"> replication</a> </p> <a href="https://publications.waset.org/abstracts/37720/a-hybrid-p2p-storage-scheme-based-on-erasure-coding-and-replication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37720.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">394</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1671</span> The Effectiveness of National Fiscal Rules in the Asia-Pacific Countries</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chiung-Ju%20Huang">Chiung-Ju Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Hong%20Ho"> Yuan-Hong Ho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study utilizes the International Monetary Fund (IMF) Fiscal Rules Dataset focusing on four specific fiscal rules such as expenditure rule, revenue rule, budget balance rule, and debt rule and five main characteristics of each fiscal rule those are monitoring, enforcement, coverage, legal basis, and escape clause to construct the Fiscal Rule Index for nine countries in the Asia-Pacific region from 1996 to 2015. After constructing the fiscal rule index for each country, we utilize the Panel Generalized Method of Moments (Panel GMM) by using the constructed fiscal rule index to examine the effectiveness of fiscal rules in reducing procyclicality. Empirical results show that national fiscal rules have a significantly negative impact on procyclicality of government expenditure. Additionally, stricter fiscal rules combined with high government effectiveness are effective in reducing procyclicality of government expenditure. Results of this study indicate that for nine Asia-Pacific countries, policymakers’ use of fiscal rules and government effectiveness to reducing procyclicality of fiscal policy are effective. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=counter-cyclical%20policy" title="counter-cyclical policy">counter-cyclical policy</a>, <a href="https://publications.waset.org/abstracts/search?q=fiscal%20rules" title=" fiscal rules"> fiscal rules</a>, <a href="https://publications.waset.org/abstracts/search?q=government%20efficiency" title=" government efficiency"> government efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=procyclical%20policy" title=" procyclical policy"> procyclical policy</a> </p> <a href="https://publications.waset.org/abstracts/95982/the-effectiveness-of-national-fiscal-rules-in-the-asia-pacific-countries" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95982.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">280</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1670</span> Performance Evaluation of One and Two Dimensional Prime Codes for Optical Code Division Multiple Access Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gurjit%20Kaur">Gurjit Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Neena%20Gupta"> Neena Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have analyzed and compared the performance of various coding schemes. The basic ID prime sequence codes are unique in only dimension, i.e. time slots, whereas 2D coding techniques are not unique by their time slots but with their wavelengths also. In this research, we have evaluated and compared the performance of 1D and 2D coding techniques constructed using prime sequence coding pattern for Optical Code Division Multiple Access (OCDMA) system on a single platform. Analysis shows that 2D prime code supports lesser number of active users than 1D codes, but they are having large code family and are the most secure codes compared to other codes. The performance of all these codes is analyzed on basis of number of active users supported at a Bit Error Rate (BER) of 10-9. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CDMA" title="CDMA">CDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OCDMA" title=" OCDMA"> OCDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=OOC" title=" OOC"> OOC</a>, <a href="https://publications.waset.org/abstracts/search?q=PC" title=" PC"> PC</a>, <a href="https://publications.waset.org/abstracts/search?q=EPC" title=" EPC"> EPC</a>, <a href="https://publications.waset.org/abstracts/search?q=MPC" title=" MPC"> MPC</a>, <a href="https://publications.waset.org/abstracts/search?q=2-D%20PC%2FPC" title=" 2-D PC/PC"> 2-D PC/PC</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBc" title=" λc"> λc</a>, <a href="https://publications.waset.org/abstracts/search?q=%CE%BBa" title=" λa"> λa</a> </p> <a href="https://publications.waset.org/abstracts/45035/performance-evaluation-of-one-and-two-dimensional-prime-codes-for-optical-code-division-multiple-access-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45035.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">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1669</span> Spatiotemporal Community Detection and Analysis of Associations among Overlapping Communities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=JooYoung%20Lee">JooYoung Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Rasheed%20Hussain"> Rasheed Hussain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Understanding the relationships among communities of users is the key to blueprint the evolution of human society. Majority of people are equipped with GPS devices, such as smart phones and smart cars, which can trace their whereabouts. In this paper, we discover communities of device users based on real locations in a given time frame. We, then, study the associations of discovered communities, referred to as temporal communities, and generate temporal and probabilistic association rules. The rules describe how strong communities are associated. By studying the generated rules, we can automatically extract underlying hierarchies of communities and permanent communities such as work places. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=community%20detection" title=" community detection"> community detection</a>, <a href="https://publications.waset.org/abstracts/search?q=evolution%20of%20communities" title=" evolution of communities"> evolution of communities</a>, <a href="https://publications.waset.org/abstracts/search?q=spatiotemporal" title=" spatiotemporal"> spatiotemporal</a> </p> <a href="https://publications.waset.org/abstracts/62840/spatiotemporal-community-detection-and-analysis-of-associations-among-overlapping-communities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62840.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">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1668</span> Whole Exome Sequencing Data Analysis of Rare Diseases: Non-Coding Variants and Copy Number Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Fahiminiya">S. Fahiminiya</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Nadaf"> J. Nadaf</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Rauch"> F. Rauch</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Jerome-Majewska"> L. Jerome-Majewska</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Majewski"> J. Majewski </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Sequencing of protein coding regions of human genome (Whole Exome Sequencing; WES), has demonstrated a great success in the identification of causal mutations for several rare genetic disorders in human. Generally, most of WES studies have focused on rare variants in coding exons and splicing-sites where missense substitutions lead to the alternation of protein product. Although focusing on this category of variants has revealed the mystery behind many inherited genetic diseases in recent years, a subset of them remained still inconclusive. Here, we present the result of our WES studies where analyzing only rare variants in coding regions was not conclusive but further investigation revealed the involvement of non-coding variants and copy number variations (CNV) in etiology of the diseases. Methods: Whole exome sequencing was performed using our standard protocols at Genome Quebec Innovation Center, Montreal, Canada. All bioinformatics analyses were done using in-house WES pipeline. Results: To date, we successfully identified several disease causing mutations within gene coding regions (e.g. SCARF2: Van den Ende-Gupta syndrome and SNAP29: 22q11.2 deletion syndrome) by using WES. In addition, we showed that variants in non-coding regions and CNV have also important value and should not be ignored and/or filtered out along the way of bioinformatics analysis on WES data. For instance, in patients with osteogenesis imperfecta type V and in patients with glucocorticoid deficiency, we identified variants in 5'UTR, resulting in the production of longer or truncating non-functional proteins. Furthermore, CNVs were identified as the main cause of the diseases in patients with metaphyseal dysplasia with maxillary hypoplasia and brachydactyly and in patients with osteogenesis imperfecta type VII. Conclusions: Our study highlights the importance of considering non-coding variants and CNVs during interpretation of WES data, as they can be the only cause of disease under investigation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=whole%20exome%20sequencing%20data" title="whole exome sequencing data">whole exome sequencing data</a>, <a href="https://publications.waset.org/abstracts/search?q=non-coding%20variants" title=" non-coding variants"> non-coding variants</a>, <a href="https://publications.waset.org/abstracts/search?q=copy%20number%20variations" title=" copy number variations"> copy number variations</a>, <a href="https://publications.waset.org/abstracts/search?q=rare%20diseases" title=" rare diseases"> rare diseases</a> </p> <a href="https://publications.waset.org/abstracts/24069/whole-exome-sequencing-data-analysis-of-rare-diseases-non-coding-variants-and-copy-number-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24069.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">419</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1667</span> Performance Improvement of Cooperative Scheme in Wireless OFDM Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ki-Ro%20Kim">Ki-Ro Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Seung-Jun%20Yu"> Seung-Jun Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, the wireless communication systems are required to have high quality and provide high bit rate data services. Researchers have studied various multiple antenna scheme to meet the demand. In practical application, it is difficult to deploy multiple antennas for limited size and cost. Cooperative diversity techniques are proposed to overcome the limitations. Cooperative communications have been widely investigated to improve performance of wireless communication. Among diversity schemes, space-time block code has been widely studied for cooperative communication systems. In this paper, we propose a new cooperative scheme using pre-coding and space-time block code. The proposed cooperative scheme provides improved error performance than a conventional cooperative scheme using space-time block coding scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title="cooperative communication">cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=space-time%20block%20coding" title=" space-time block coding"> space-time block coding</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-coding" title=" pre-coding"> pre-coding</a> </p> <a href="https://publications.waset.org/abstracts/3515/performance-improvement-of-cooperative-scheme-in-wireless-ofdm-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3515.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">359</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1666</span> Fast Prediction Unit Partition Decision and Accelerating the Algorithm Using Cudafor Intra and Inter Prediction of HEVC</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiang%20Zhang">Qiang Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chun%20Yuan"> Chun Yuan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the PU (Prediction Unit) decision process is the most time consuming part of the emerging HEVC (High Efficient Video Coding) standardin intra and inter frame coding, this paper proposes the fast PU decision algorithm and speed up the algorithm using CUDA (Compute Unified Device Architecture). In intra frame coding, the fast PU decision algorithm uses the texture features to skip intra-frame prediction or terminal the intra-frame prediction for smaller PU size. In inter frame coding of HEVC, the fast PU decision algorithm takes use of the similarity of its own two Nx2N size PU's motion vectors and the hierarchical structure of CU (Coding Unit) partition to skip some modes of PU partition, so as to reduce the motion estimation times. The accelerate algorithm using CUDA is based on the fast PU decision algorithm which uses the GPU to make the motion search and the gradient computation could be parallel computed. The proposed algorithm achieves up to 57% time saving compared to the HM 10.0 with little rate-distortion losses (0.043dB drop and 1.82% bitrate increase on average). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=HEVC" title="HEVC">HEVC</a>, <a href="https://publications.waset.org/abstracts/search?q=PU%20decision" title=" PU decision"> PU decision</a>, <a href="https://publications.waset.org/abstracts/search?q=inter%20prediction" title=" inter prediction"> inter prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=intra%20prediction" title=" intra prediction"> intra prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=CUDA" title=" CUDA"> CUDA</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel" title=" parallel"> parallel</a> </p> <a href="https://publications.waset.org/abstracts/9627/fast-prediction-unit-partition-decision-and-accelerating-the-algorithm-using-cudafor-intra-and-inter-prediction-of-hevc" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9627.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">399</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1665</span> Transparency in Politics: Evaluation Rules and Principles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stylianos%20Galoukas">Stylianos Galoukas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> since the eve of human societies, the need for survival and covering even the most basic needs such as hunting for food, led to the realization of the need for regulation between the personal and common interest. This led to the establishment of initially unwritten and later on, written rules which then became the Law. Transparency as a word has been used for more than 2.500 years. Born in ancient Greece around the 5th BC century and although it was not originally correlated to political or public administration acts, its enclosed principles and rules, were given even then, great attention. In today’s times of fake news and meta-politics, transparency has greatly correlated with the fight against corruption especially in the financially related matters. It is believed however that transparency, being a much wider than corruption meaning, has an even greater role to play than the corruption counterpart. It can be further used to unveil or examine the genuineness of the will towards the public interest, behind every public policy or political act. Therefore, herein the timeless and fundamental principles of institutional and public administration transparency are made clear as well as their application rules that can and ought to be used as evaluation criteria. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evaluation%20citeria" title="evaluation citeria">evaluation citeria</a>, <a href="https://publications.waset.org/abstracts/search?q=policies" title=" policies"> policies</a>, <a href="https://publications.waset.org/abstracts/search?q=politics" title=" politics"> politics</a>, <a href="https://publications.waset.org/abstracts/search?q=principles" title=" principles"> principles</a>, <a href="https://publications.waset.org/abstracts/search?q=rules" title=" rules"> rules</a>, <a href="https://publications.waset.org/abstracts/search?q=transparency" title=" transparency"> transparency</a> </p> <a href="https://publications.waset.org/abstracts/83180/transparency-in-politics-evaluation-rules-and-principles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83180.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">198</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1664</span> Association Rules Mining Task Using Metaheuristics: Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abir%20Derouiche">Abir Derouiche</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdesslem%20Layeb"> Abdesslem Layeb </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Association Rule Mining (ARM) is one of the most popular data mining tasks and it is widely used in various areas. The search for association rules is an NP-complete problem that is why metaheuristics have been widely used to solve it. The present paper presents the ARM as an optimization problem and surveys the proposed approaches in the literature based on metaheuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Optimization" title="Optimization">Optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Metaheuristics" title=" Metaheuristics"> Metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=Data%20Mining" title=" Data Mining"> Data Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Association%20rules%20Mining" title=" Association rules Mining"> Association rules Mining</a> </p> <a href="https://publications.waset.org/abstracts/120254/association-rules-mining-task-using-metaheuristics-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120254.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">159</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1663</span> Classification Rule Discovery by Using Parallel Ant Colony Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Waseem%20Shahzad">Waseem Shahzad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayesha%20Tahir%20Khan"> Ayesha Tahir Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamid%20Hussain%20Awan"> Hamid Hussain Awan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ant-Miner algorithm that lies under ACO algorithms is used to extract knowledge from data in the form of rules. A variant of Ant-Miner algorithm named as cAnt-MinerPB is used to generate list of rules using pittsburgh approach in order to maintain the rule interaction among the rules that are generated. In this paper, we propose a parallel Ant MinerPB in which Ant colony optimization algorithm runs parallel. In this technique, a data set is divided vertically (i-e attributes) into different subsets. These subsets are created based on the correlation among attributes using Mutual Information (MI). It generates rules in a parallel manner and then merged to form a final list of rules. The results have shown that the proposed technique achieved higher accuracy when compared with original cAnt-MinerPB and also the execution time has also reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20Ant-MinerPB" title=" parallel Ant-MinerPB"> parallel Ant-MinerPB</a>, <a href="https://publications.waset.org/abstracts/search?q=vertical%20partitioning" title=" vertical partitioning"> vertical partitioning</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20rule%20discovery" title=" classification rule discovery"> classification rule discovery</a> </p> <a href="https://publications.waset.org/abstracts/43773/classification-rule-discovery-by-using-parallel-ant-colony-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43773.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">295</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1662</span> Linguistic Symbols Principle Construction in Cultural Creative Product Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pei-Jun%20Xue">Pei-Jun Xue</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming-Yu%20Hsiao"> Ming-Yu Hsiao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Language is the emblem of a culture, representing the extension of cultural life. In addition, it is also an important tool for communication and message transmission. It carries not only information but also covers the self-conscious of the information constructor as well as the situational experiences of users from different backgrounds. Moreover, design can be regarded as a language, a dynamic process of coding and decoding. With the designers’ experiences in everyday life, they bring them into the products’ experiences. Considered from the aspects of atmosphere and the five senses, a designer should consider and reconsider how to communicate the messages effectively to suit the users’ needs. In the process of language learning, we should understand the construction behind it and the rules of the compositions of language codes. Regarding the understanding of the design of works or the form of product construction, it is necessary for us to understand the coding system during the process of product construction. The form (signifiers) and meanings (signified) of Chinese characters are closely related. At the same time, it is also a process of simplifying the complicated to the simple. This study discusses the chinese characters that used in the cultural symbols construction, and analysis of existing products by Peirce's semiotic triangles. Through people's cognition of Chinese characters and constitute method, help to understand the way of construction product symbol. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cultural-creative%20product%20design" title="cultural-creative product design">cultural-creative product design</a>, <a href="https://publications.waset.org/abstracts/search?q=cultural%20product" title=" cultural product"> cultural product</a>, <a href="https://publications.waset.org/abstracts/search?q=cultural%20symbols" title=" cultural symbols"> cultural symbols</a>, <a href="https://publications.waset.org/abstracts/search?q=linguistic%20symbols" title=" linguistic symbols"> linguistic symbols</a> </p> <a href="https://publications.waset.org/abstracts/45320/linguistic-symbols-principle-construction-in-cultural-creative-product-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45320.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">449</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1661</span> Cognitive SATP for Airborne Radar Based on Slow-Time Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fanqiang%20Kong">Fanqiang Kong</a>, <a href="https://publications.waset.org/abstracts/search?q=Jindong%20Zhang"> Jindong Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Daiyin%20Zhu"> Daiyin Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Space-time adaptive processing (STAP) techniques have been motivated as a key enabling technology for advanced airborne radar applications. In this paper, the notion of cognitive radar is extended to STAP technique, and cognitive STAP is discussed. The principle for improving signal-to-clutter ratio (SCNR) based on slow-time coding is given, and the corresponding optimization algorithm based on cyclic and power-like algorithms is presented. Numerical examples show the effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=space-time%20adaptive%20processing%20%28STAP%29" title="space-time adaptive processing (STAP)">space-time adaptive processing (STAP)</a>, <a href="https://publications.waset.org/abstracts/search?q=airborne%20radar" title=" airborne radar"> airborne radar</a>, <a href="https://publications.waset.org/abstracts/search?q=signal-to-clutter%20ratio" title=" signal-to-clutter ratio"> signal-to-clutter ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=slow-time%20coding" title=" slow-time coding"> slow-time coding</a> </p> <a href="https://publications.waset.org/abstracts/71518/cognitive-satp-for-airborne-radar-based-on-slow-time-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71518.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">273</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/abstracts/search?q=coding%20rules&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&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/abstracts/search?q=coding%20rules&page=56">56</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&page=57">57</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coding%20rules&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>