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: selective mutation</title> <meta name="description" content="Search results for: selective mutation"> <meta name="keywords" content="selective mutation"> <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="selective mutation" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="selective mutation"> <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> 253</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: selective mutation</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">253</span> Selective Mutation for Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sung%20Hoon%20Jung">Sung Hoon Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a selective mutation method for improving the performances of genetic algorithms. In selective mutation, individuals are first ranked and then additionally mutated one bit in a part of their strings which is selected corresponding to their ranks. This selective mutation helps genetic algorithms to fast approach the global optimum and to quickly escape local optima. This results in increasing the performances of genetic algorithms. We measured the effects of selective mutation with four function optimization problems. It was found from extensive experiments that the selective mutation can significantly enhance the performances of genetic algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=selective%20mutation" title=" selective mutation"> selective mutation</a>, <a href="https://publications.waset.org/search?q=function%20optimization" title=" function optimization"> function optimization</a> </p> <a href="https://publications.waset.org/10404/selective-mutation-for-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10404/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10404/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10404/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10404/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10404/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10404/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10404/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10404/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10404/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10404/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10404.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">1836</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">252</span> The Rank-scaled Mutation Rate for Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mike%20Sewell">Mike Sewell</a>, <a href="https://publications.waset.org/search?q=Jagath%20Samarabandu"> Jagath Samarabandu</a>, <a href="https://publications.waset.org/search?q=Ranga%20Rodrigo"> Ranga Rodrigo</a>, <a href="https://publications.waset.org/search?q=Kenneth%20McIsaac"> Kenneth McIsaac</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A novel method of individual level adaptive mutation rate control called the rank-scaled mutation rate for genetic algorithms is introduced. The rank-scaled mutation rate controlled genetic algorithm varies the mutation parameters based on the rank of each individual within the population. Thereby the distribution of the fitness of the papulation is taken into consideration in forming the new mutation rates. The best fit mutate at the lowest rate and the least fit mutate at the highest rate. The complexity of the algorithm is of the order of an individual adaptation scheme and is lower than that of a self-adaptation scheme. The proposed algorithm is tested on two common problems, namely, numerical optimization of a function and the traveling salesman problem. The results show that the proposed algorithm outperforms both the fixed and deterministic mutation rate schemes. It is best suited for problems with several local optimum solutions without a high demand for excessive mutation rates.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithms" title="Genetic algorithms">Genetic algorithms</a>, <a href="https://publications.waset.org/search?q=mutation%20rate%20control" title=" mutation rate control"> mutation rate control</a>, <a href="https://publications.waset.org/search?q=adaptive%20mutation." title=" adaptive mutation."> adaptive mutation.</a> </p> <a href="https://publications.waset.org/10554/the-rank-scaled-mutation-rate-for-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10554/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10554/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10554/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10554/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10554/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10554/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10554/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10554/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10554/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10554/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10554.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">2669</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">251</span> Metamorphism, Formal Grammars and Undecidable Code Mutation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Eric%20Filiol">Eric Filiol</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a formalisation of the different existing code mutation techniques (polymorphism and metamorphism) by means of formal grammars. While very few theoretical results are known about the detection complexity of viral mutation techniques, we exhaustively address this critical issue by considering the Chomsky classification of formal grammars. This enables us to determine which family of code mutation techniques are likely to be detected or on the contrary are bound to remain undetected. As an illustration we then present, on a formal basis, a proof-of-concept metamorphic mutation engine denoted PB MOT, whose detection has been proven to be undecidable.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Polymorphism" title="Polymorphism">Polymorphism</a>, <a href="https://publications.waset.org/search?q=Metamorphism" title=" Metamorphism"> Metamorphism</a>, <a href="https://publications.waset.org/search?q=Formal%20Grammars" title=" Formal Grammars"> Formal Grammars</a>, <a href="https://publications.waset.org/search?q=Formal%20Languages" title="Formal Languages">Formal Languages</a>, <a href="https://publications.waset.org/search?q=Language%20Decision" title=" Language Decision"> Language Decision</a>, <a href="https://publications.waset.org/search?q=Code%20Mutation" title=" Code Mutation"> Code Mutation</a>, <a href="https://publications.waset.org/search?q=Word%20Problem" title=" Word Problem"> Word Problem</a> </p> <a href="https://publications.waset.org/1369/metamorphism-formal-grammars-and-undecidable-code-mutation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1369/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1369/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1369/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1369/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1369/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1369/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1369/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1369/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1369/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1369/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1369.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">2429</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">250</span> The Effect of Program Type on Mutation Testing: Comparative Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Falah">B. Falah</a>, <a href="https://publications.waset.org/search?q=N.%20E.%20Abakouy"> N. E. Abakouy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to its high computational cost, mutation testing has been neglected by researchers. Recently, many cost and mutants’ reduction techniques have been developed, improved, and experimented, but few of them has relied the possibility of reducing the cost of mutation testing on the program type of the application under test. This paper is a comparative study between four operators’ selection techniques (mutants sampling, class level operators, method level operators, and all operators’ selection) based on the program code type of each application under test. It aims at finding an alternative approach to reveal the effect of code type on mutation testing score. The result of our experiment shows that the program code type can affect the mutation score and that the programs using polymorphism are best suited to be tested with mutation testing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Equivalent%20mutant" title="Equivalent mutant">Equivalent mutant</a>, <a href="https://publications.waset.org/search?q=killed%20mutant" title=" killed mutant"> killed mutant</a>, <a href="https://publications.waset.org/search?q=mutation%20score" title=" mutation score"> mutation score</a>, <a href="https://publications.waset.org/search?q=mutation%20testing" title=" mutation testing"> mutation testing</a>, <a href="https://publications.waset.org/search?q=program%20code%20type." title=" program code type."> program code type.</a> </p> <a href="https://publications.waset.org/10003608/the-effect-of-program-type-on-mutation-testing-comparative-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003608/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003608/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003608/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003608/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003608/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003608/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003608/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003608/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003608/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003608/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003608.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">1416</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">249</span> Mutation Rate for Evolvable Hardware</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Emanuele%20Stomeo">Emanuele Stomeo</a>, <a href="https://publications.waset.org/search?q=Tatiana%20Kalganova"> Tatiana Kalganova</a>, <a href="https://publications.waset.org/search?q=Cyrille%20Lambert"> Cyrille Lambert</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evolvable hardware (EHW) refers to a selfreconfiguration hardware design, where the configuration is under the control of an evolutionary algorithm (EA). A lot of research has been done in this area several different EA have been introduced. Every time a specific EA is chosen for solving a particular problem, all its components, such as population size, initialization, selection mechanism, mutation rate, and genetic operators, should be selected in order to achieve the best results. In the last three decade a lot of research has been carried out in order to identify the best parameters for the EA-s components for different 鈥渢est-problems". However different researchers propose different solutions. In this paper the behaviour of mutation rate on (1+位) evolution strategy (ES) for designing logic circuits, which has not been done before, has been deeply analyzed. The mutation rate for an EHW system modifies values of the logic cell inputs, the cell type (for example from AND to NOR) and the circuit output. The behaviour of the mutation has been analyzed based on the number of generations, genotype redundancy and number of logic gates used for the evolved circuits. The experimental results found provide the behaviour of the mutation rate to be used during evolution for the design and optimization of logic circuits. The researches on the best mutation rate during the last 40 years are also summarized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Evolvable%20hardware" title="Evolvable hardware">Evolvable hardware</a>, <a href="https://publications.waset.org/search?q=mutation%20rate" title=" mutation rate"> mutation rate</a>, <a href="https://publications.waset.org/search?q=evolutionarycomputation" title=" evolutionarycomputation"> evolutionarycomputation</a>, <a href="https://publications.waset.org/search?q=design%20of%20logic%20circuit." title=" design of logic circuit."> design of logic circuit.</a> </p> <a href="https://publications.waset.org/6198/mutation-rate-for-evolvable-hardware" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6198/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6198/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6198/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6198/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6198/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6198/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6198/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6198/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6198/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6198/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6198.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">1501</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">248</span> Solving the Economic Dispatch Problem using Novel Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Khamsawang">S. Khamsawang</a>, <a href="https://publications.waset.org/search?q=S.%20Jiriwibhakorn"> S. Jiriwibhakorn</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an improved approach based on conventional particle swarm optimization (PSO) for solving an economic dispatch(ED) problem with considering the generator constraints. The mutation operators of the differential evolution (DE) are used for improving diversity exploration of PSO, which called particle swarm optimization with mutation operators (PSOM). The mutation operators are activated if velocity values of PSO nearly to zero or violated from the boundaries. Four scenarios of mutation operators are implemented for PSOM. The simulation results of all scenarios of the PSOM outperform over the PSO and other existing approaches which appeared in literatures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Novel%20particle%20swarm%20optimization" title="Novel particle swarm optimization">Novel particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=Economic%0Adispatch%20problem" title=" Economic dispatch problem"> Economic dispatch problem</a>, <a href="https://publications.waset.org/search?q=Mutation%20operator" title=" Mutation operator"> Mutation operator</a>, <a href="https://publications.waset.org/search?q=Prohibited%20operating%20zones" title=" Prohibited operating zones"> Prohibited operating zones</a>, <a href="https://publications.waset.org/search?q=Differential%20Evolution." title=" Differential Evolution."> Differential Evolution.</a> </p> <a href="https://publications.waset.org/9302/solving-the-economic-dispatch-problem-using-novel-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9302/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9302/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9302/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9302/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9302/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9302/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9302/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9302/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9302/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9302/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9302.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">2318</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">247</span> Chose the Right Mutation Rate for Better Evolve Combinational Logic Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Emanuele%20Stomeo">Emanuele Stomeo</a>, <a href="https://publications.waset.org/search?q=Tatiana%20Kalganova"> Tatiana Kalganova</a>, <a href="https://publications.waset.org/search?q=Cyrille%20Lambert"> Cyrille Lambert</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evolvable hardware (EHW) is a developing field that applies evolutionary algorithm (EA) to automatically design circuits, antennas, robot controllers etc. A lot of research has been done in this area and several different EAs have been introduced to tackle numerous problems, as scalability, evolvability etc. However every time a specific EA is chosen for solving a particular task, all its components, such as population size, initialization, selection mechanism, mutation rate, and genetic operators, should be selected in order to achieve the best results. In the last three decade the selection of the right parameters for the EA-s components for solving different 鈥渢est-problems" has been investigated. In this paper the behaviour of mutation rate for designing logic circuits, which has not been done before, has been deeply analyzed. The mutation rate for an EHW system modifies the number of inputs of each logic gates, the functionality (for example from AND to NOR) and the connectivity between logic gates. The behaviour of the mutation has been analyzed based on the number of generations, genotype redundancy and number of logic gates for the evolved circuits. The experimental results found provide the behaviour of the mutation rate during evolution for the design and optimization of simple logic circuits. The experimental results propose the best mutation rate to be used for designing combinational logic circuits. The research presented is particular important for those who would like to implement a dynamic mutation rate inside the evolutionary algorithm for evolving digital circuits. The researches on the mutation rate during the last 40 years are also summarized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Design%20of%20logic%20circuit" title="Design of logic circuit">Design of logic circuit</a>, <a href="https://publications.waset.org/search?q=evolutionary%20computation" title=" evolutionary computation"> evolutionary computation</a>, <a href="https://publications.waset.org/search?q=evolvable%20hardware" title="evolvable hardware">evolvable hardware</a>, <a href="https://publications.waset.org/search?q=mutation%20rate." title=" mutation rate."> mutation rate.</a> </p> <a href="https://publications.waset.org/10551/chose-the-right-mutation-rate-for-better-evolve-combinational-logic-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10551/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10551/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10551/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10551/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10551/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10551/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10551/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10551/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10551/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10551/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10551.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">1693</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">246</span> A New Self-Adaptive EP Approach for ANN Weights Training</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kristina%20Davoian">Kristina Davoian</a>, <a href="https://publications.waset.org/search?q=Wolfram-M.%20Lippe"> Wolfram-M. Lippe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evolutionary Programming (EP) represents a methodology of Evolutionary Algorithms (EA) in which mutation is considered as a main reproduction operator. This paper presents a novel EP approach for Artificial Neural Networks (ANN) learning. The proposed strategy consists of two components: the self-adaptive, which contains phenotype information and the dynamic, which is described by genotype. Self-adaptation is achieved by the addition of a value, called the network weight, which depends on a total number of hidden layers and an average number of neurons in hidden layers. The dynamic component changes its value depending on the fitness of a chromosome, exposed to mutation. Thus, the mutation step size is controlled by two components, encapsulated in the algorithm, which adjust it according to the characteristics of a predefined ANN architecture and the fitness of a particular chromosome. The comparative analysis of the proposed approach and the classical EP (Gaussian mutation) showed, that that the significant acceleration of the evolution process is achieved by using both phenotype and genotype information in the mutation strategy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20Neural%20Networks%20%28ANN%29" title="Artificial Neural Networks (ANN)">Artificial Neural Networks (ANN)</a>, <a href="https://publications.waset.org/search?q=Learning%0ATheory" title=" Learning Theory"> Learning Theory</a>, <a href="https://publications.waset.org/search?q=Evolutionary%20Programming%20%28EP%29" title=" Evolutionary Programming (EP)"> Evolutionary Programming (EP)</a>, <a href="https://publications.waset.org/search?q=Mutation" title=" Mutation"> Mutation</a>, <a href="https://publications.waset.org/search?q=Self-Adaptation." title=" Self-Adaptation."> Self-Adaptation.</a> </p> <a href="https://publications.waset.org/960/a-new-self-adaptive-ep-approach-for-ann-weights-training" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/960/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/960/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/960/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/960/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/960/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/960/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/960/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/960/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/960/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/960/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/960.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">1828</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">245</span> Prioritization of Mutation Test Generation with Centrality Measure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Supachai%20Supmak">Supachai Supmak</a>, <a href="https://publications.waset.org/search?q=Yachai%20Limpiyakorn"> Yachai Limpiyakorn</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Mutation testing can be applied for the quality assessment of test cases. Prioritization of mutation test generation has been a critical element of the industry practice that would contribute to the evaluation of test cases. The industry generally delivers the product under the condition of time to the market and thus, inevitably sacrifices software testing tasks, even though many test cases are required for software verification. This paper presents an approach of applying a social network centrality measure, PageRank, to prioritize mutation test generation. The source code with the highest values of PageRank, will be focused first when developing their test cases as these modules are vulnerable for defects or anomalies which may cause the consequent defects in many other associated modules. Moreover, the approach would help identify the reducible test cases in the test suite, still maintaining the same criteria as the original number of test cases.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Software%20testing" title="Software testing">Software testing</a>, <a href="https://publications.waset.org/search?q=mutation%20test" title=" mutation test"> mutation test</a>, <a href="https://publications.waset.org/search?q=network%20centrality%20measure" title=" network centrality measure"> network centrality measure</a>, <a href="https://publications.waset.org/search?q=test%20case%20prioritization." title=" test case prioritization."> test case prioritization.</a> </p> <a href="https://publications.waset.org/10012679/prioritization-of-mutation-test-generation-with-centrality-measure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012679/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012679/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012679/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012679/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012679/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012679/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012679/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012679/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012679/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012679/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012679.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">543</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">244</span> Feasibility of the Evolutionary Algorithm using Different Behaviours of the Mutation Rate to Design Simple Digital Logic Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Konstantin%20Movsovic">Konstantin Movsovic</a>, <a href="https://publications.waset.org/search?q=Emanuele%20Stomeo"> Emanuele Stomeo</a>, <a href="https://publications.waset.org/search?q=Tatiana%20Kalganova"> Tatiana Kalganova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The evolutionary design of electronic circuits, or evolvable hardware, is a discipline that allows the user to automatically obtain the desired circuit design. The circuit configuration is under the control of evolutionary algorithms. Several researchers have used evolvable hardware to design electrical circuits. Every time that one particular algorithm is selected to carry out the evolution, it is necessary that all its parameters, such as mutation rate, population size, selection mechanisms etc. are tuned in order to achieve the best results during the evolution process. This paper investigates the abilities of evolution strategy to evolve digital logic circuits based on programmable logic array structures when different mutation rates are used. Several mutation rates (fixed and variable) are analyzed and compared with each other to outline the most appropriate choice to be used during the evolution of combinational logic circuits. The experimental results outlined in this paper are important as they could be used by every researcher who might need to use the evolutionary algorithm to design digital logic circuits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Evolvable%20hardware" title="Evolvable hardware">Evolvable hardware</a>, <a href="https://publications.waset.org/search?q=evolutionary%20algorithm" title=" evolutionary algorithm"> evolutionary algorithm</a>, <a href="https://publications.waset.org/search?q=digitallogic%20circuit" title=" digitallogic circuit"> digitallogic circuit</a>, <a href="https://publications.waset.org/search?q=mutation%20rate." title=" mutation rate."> mutation rate.</a> </p> <a href="https://publications.waset.org/10421/feasibility-of-the-evolutionary-algorithm-using-different-behaviours-of-the-mutation-rate-to-design-simple-digital-logic-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10421/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10421/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10421/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10421/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10421/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10421/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10421/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10421/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10421/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10421/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10421.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">1502</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">243</span> A Study on Stochastic Integral Associated with Catastrophes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Reni%20Sagayaraj">M. Reni Sagayaraj</a>, <a href="https://publications.waset.org/search?q=S.%20Anand%20Gnana%20Selvam"> S. Anand Gnana Selvam</a>, <a href="https://publications.waset.org/search?q=R.%20Reynald%20Susainathan"> R. Reynald Susainathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We analyze stochastic integrals associated with a mutation process. To be specific, we describe the cell population process and derive the differential equations for the joint generating functions for the number of mutants and their integrals in generating functions and their applications. We obtain first-order moments of the processes of the two-way mutation process in first-order moment structure of X (t) and Y (t) and the second-order moments of a one-way mutation process. In this paper, we obtain the limiting behaviour of the integrals in limiting distributions of X (t) and Y (t).</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Stochastic%20integrals" title="Stochastic integrals">Stochastic integrals</a>, <a href="https://publications.waset.org/search?q=single%E2%80%93server%20queue%20model" title=" single鈥搒erver queue model"> single鈥搒erver queue model</a>, <a href="https://publications.waset.org/search?q=catastrophes" title=" catastrophes"> catastrophes</a>, <a href="https://publications.waset.org/search?q=busy%20period." title=" busy period."> busy period.</a> </p> <a href="https://publications.waset.org/10005954/a-study-on-stochastic-integral-associated-with-catastrophes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005954/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005954/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005954/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005954/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005954/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005954/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005954/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005954/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005954/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005954/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005954.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">800</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">242</span> The Need for Selective Credit Policy Implementation: Case of Croatia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Drago%20Jakovcevic">Drago Jakovcevic</a>, <a href="https://publications.waset.org/search?q=Mihovil%20Andelinovic"> Mihovil Andelinovic</a>, <a href="https://publications.waset.org/search?q=Igor%20Husak"> Igor Husak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to explore the economic circumstances in which the selective credit policy, the least used instrument of four types of instruments on disposal to central banks, should be used. The most significant example includes the use of selective credit policies in response to the emergence of the global financial crisis by the FED. Specifics of the potential use of selective credit policies as the instigator of economic growth in Croatia, a small open economy, are determined by high euroization of financial system, fixed exchange rate and long-term trend growth of external debt that is related to the need to maintain high levels of foreign reserves. In such conditions, the classic forms of selective credit policies are unsuitable for the introduction. Several alternative approaches to implement selective credit policies are examined in this paper. Also, thorough analysis of distribution of selective monetary policy loans among economic sectors in Croatia is conducted in order to minimize the risk of investing funds and maximize the return, in order to influence the GDP growth.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Global%20crisis" title="Global crisis">Global crisis</a>, <a href="https://publications.waset.org/search?q=Selective%20credit%20policy" title=" Selective credit policy"> Selective credit policy</a>, <a href="https://publications.waset.org/search?q=Small%20open%20economy." title=" Small open economy."> Small open economy.</a> </p> <a href="https://publications.waset.org/9998424/the-need-for-selective-credit-policy-implementation-case-of-croatia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998424/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998424/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998424/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998424/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998424/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998424/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998424/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998424/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998424/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998424/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998424.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">1618</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">241</span> Mutation Analysis of the ATP7B Gene in 43 Vietnamese Wilson鈥檚 Disease Patients</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Huong%20M.%20T.%20Nguyen">Huong M. T. Nguyen</a>, <a href="https://publications.waset.org/search?q=Hoa%20A.%20P.%20Nguyen"> Hoa A. P. Nguyen</a>, <a href="https://publications.waset.org/search?q=Mai%20P.%20T.%20Nguyen"> Mai P. T. Nguyen</a>, <a href="https://publications.waset.org/search?q=Ngoc%20D.%20Ngo"> Ngoc D. Ngo</a>, <a href="https://publications.waset.org/search?q=Van%20T.%20Ta"> Van T. Ta</a>, <a href="https://publications.waset.org/search?q=Hai%20T.%20Le"> Hai T. Le</a>, <a href="https://publications.waset.org/search?q=Chi%20V.%20Phan"> Chi V. Phan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wilson’s disease (WD) is an autosomal recessive disorder of the copper metabolism, which is caused by a mutation in the copper-transporting P-type ATPase (<em>ATP7B</em>). The mechanism of this disease is the failure of hepatic excretion of copper to bile, and leads to copper deposits in the liver and other organs. The <em>ATP7B</em> gene is located on the long arm of chromosome 13 (13q14.3). This study aimed to investigate the gene mutation in the Vietnamese patients with WD, and make a presymptomatic diagnosis for their familial members. Forty-three WD patients and their 65 siblings were identified as having <em>ATP7B</em> gene mutations. Genomic DNA was extracted from peripheral blood samples; 21 exons and exon-intron boundaries of the <em>ATP7B</em> gene were analyzed by direct sequencing. We recognized four mutations ([R723=; H724Tfs*34], V1042Cfs*79, D1027H, and IVS6+3A>G) in the sum of 20 detectable mutations, accounting for 87.2% of the total. Mutation S105* was determined to have a high rate (32.6%) in this study. The hotspot regions of <em>ATP7B</em> were found at exons 2, 16, and 8, and intron 14, in 39.6 %, 11.6 %, 9.3%, and 7 % of patients, respectively. Among nine homozygote/compound heterozygote siblings of the patients with WD, three individuals were determined as asymptomatic by screening mutations of the probands. They would begin treatment after diagnosis. In conclusion, 20 different mutations were detected in 43 WD patients. Of this number, four novel mutations were explored, including [R723=; H724Tfs*34], V1042Cfs*79, D1027H, and IVS6+3A>G. The mutation S105* is the most prevalent and has been considered as a biomarker that can be used in a rapid detection assay for diagnosis of WD patients. Exons 2, 8, and 16, and intron 14 should be screened initially for WD patients in Vietnam. Based on risk profile for WD, genetic testing for presymptomatic patients is also useful in diagnosis and treatment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ATP7B%20gene" title="ATP7B gene">ATP7B gene</a>, <a href="https://publications.waset.org/search?q=mutation%20detection" title=" mutation detection"> mutation detection</a>, <a href="https://publications.waset.org/search?q=presymptomatic%20diagnosis" title=" presymptomatic diagnosis"> presymptomatic diagnosis</a>, <a href="https://publications.waset.org/search?q=Vietnamese%20Wilson%E2%80%99s%20disease." title=" Vietnamese Wilson鈥檚 disease."> Vietnamese Wilson鈥檚 disease.</a> </p> <a href="https://publications.waset.org/10006441/mutation-analysis-of-the-atp7b-gene-in-43-vietnamese-wilsons-disease-patients" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006441/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006441/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006441/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006441/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006441/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006441/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006441/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006441/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006441/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006441/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006441.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">1709</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">240</span> Survivability of Verhulst-free Populations under Mutation Accumulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chrysline%20Margus%20N.%20Pi%C3%B1ol">Chrysline Margus N. Pi帽ol</a>, <a href="https://publications.waset.org/search?q=Jenifer%20DP.%20De%20Maligaya"> Jenifer DP. De Maligaya</a>, <a href="https://publications.waset.org/search?q=Ahl%20G.%20Balitaon"> Ahl G. Balitaon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Stable nonzero populations without random deaths caused by the Verhulst factor (Verhulst-free) are a rarity. Majority either grow without bounds or die of excessive harmful mutations. To delay the accumulation of bad genes or diseases, a new environmental parameter 螕 is introduced in the simulation. Current results demonstrate that stability may be achieved by setting 螕 = 0.1. These steady states approach a maximum size that scales inversely with reproduction age. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aging" title="Aging">Aging</a>, <a href="https://publications.waset.org/search?q=mutation%20accumulation" title=" mutation accumulation"> mutation accumulation</a>, <a href="https://publications.waset.org/search?q=population%0D%0Adynamics." title=" population dynamics."> population dynamics.</a> </p> <a href="https://publications.waset.org/7280/survivability-of-verhulst-free-populations-under-mutation-accumulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7280/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7280/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7280/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7280/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7280/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7280/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7280/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7280/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7280/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7280/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7280.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">1275</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">239</span> Selective Forwarding Attack and Its Detection Algorithms: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sushil%20Sarwa">Sushil Sarwa</a>, <a href="https://publications.waset.org/search?q=Rajeev%20Kumar"> Rajeev Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The wireless mesh networks (WMNs) are emerging technology in wireless networking as they can serve large scale high speed internet access. Due to its wireless multi-hop feature, wireless mesh network is prone to suffer from many attacks, such as denial of service attack (DoS). We consider a special case of DoS attack which is selective forwarding attack (a.k.a. gray hole attack). In such attack, a misbehaving mesh router selectively drops the packets it receives rom its predecessor mesh router. It is very hard to detect that packet loss is due to medium access collision, bad channel quality or because of selective forwarding attack. In this paper, we present a review of detection algorithms of selective forwarding attack and discuss their advantage & disadvantage. Finally we conclude this paper with open research issues and challenges.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CAD%20algorithm" title="CAD algorithm">CAD algorithm</a>, <a href="https://publications.waset.org/search?q=CHEMAS" title=" CHEMAS"> CHEMAS</a>, <a href="https://publications.waset.org/search?q=selective%20forwarding%0D%0Aattack" title=" selective forwarding attack"> selective forwarding attack</a>, <a href="https://publications.waset.org/search?q=watchdog%20%26%20pathrater" title=" watchdog & pathrater"> watchdog & pathrater</a>, <a href="https://publications.waset.org/search?q=wireless%20mesh%20network." title=" wireless mesh network."> wireless mesh network.</a> </p> <a href="https://publications.waset.org/16344/selective-forwarding-attack-and-its-detection-algorithms-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16344/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16344/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16344/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16344/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16344/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16344/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16344/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16344/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16344/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16344/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16344.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">2796</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">238</span> Dynamic Network Routing Method Based on Chromosome Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xun%20Liang">Xun Liang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we probe into the traffic assignment problem by the chromosome-learning-based path finding method in simulation, which is to model the driver' behavior in the with-in-a-day process. By simply making a combination and a change of the traffic route chromosomes, the driver at the intersection chooses his next route. The various crossover and mutation rules are proposed with extensive examples.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Chromosome%20learning" title="Chromosome learning">Chromosome learning</a>, <a href="https://publications.waset.org/search?q=crossover" title=" crossover"> crossover</a>, <a href="https://publications.waset.org/search?q=mutation" title=" mutation"> mutation</a>, <a href="https://publications.waset.org/search?q=traffic%20path%20finding." title=" traffic path finding."> traffic path finding.</a> </p> <a href="https://publications.waset.org/3061/dynamic-network-routing-method-based-on-chromosome-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3061/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3061/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3061/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3061/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3061/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3061/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3061/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3061/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3061/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3061/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3061.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">1348</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">237</span> Estimation of OPC, Fly Ash and Slag Contents in Blended and Composite Cements by Selective Dissolution Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Suresh%20Palla">Suresh Palla</a>, <a href="https://publications.waset.org/search?q=Suresh%20Vanguri"> Suresh Vanguri</a>, <a href="https://publications.waset.org/search?q=Anitha"> Anitha</a>, <a href="https://publications.waset.org/search?q=B.%20N.%20Mohapatra"> B. N. Mohapatra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the results of the study on the estimation of fly ash, slag and cement contents in blended and composite cements by selective dissolution method. Types of cement samples investigated include Ordinary Portland Cement (OPC) with fly ash as performance improver, OPC with slag as performance improver, Portland Pozzolana Cement (PPC), Portland Slag Cement (PSC) and composite cement confirming to respective Indian Standards. Slag and OPC contents in PSC were estimated by selectively dissolving OPC in stage 1 and selectively dissolving slag in stage 2. In the case of composite cement sample, the percentage of cement, slag and fly ash were estimated systematically by selective dissolution of cement, slag and fly ash in three stages. In the first stage, cement is dissolved and separated by leaving the residue of slag and fly ash, designated as R1. The second stage involves gravimetric estimation of fractions of OPC, residue and selective dissolution of fly ash and slag contents. Fly ash content, R2 was estimated through gravimetric analysis. Thereafter, the difference between the R1 and R2 is considered as slag content. The obtained results of cement, fly ash and slag using selective dissolution method showed 10% of standard deviation with the corresponding percentage of respective constituents. The results suggest that this selective dissolution method can be successfully used for estimation of OPC and Supplementary Cementitious material (SCM) contents in different types of cements. </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Selective%20dissolution%20method" title="Selective dissolution method">Selective dissolution method</a>, <a href="https://publications.waset.org/search?q=fly%20ash" title=" fly ash"> fly ash</a>, <a href="https://publications.waset.org/search?q=Ground%20Granulated%20blast%20furnace%20slag" title=" Ground Granulated blast furnace slag"> Ground Granulated blast furnace slag</a>, <a href="https://publications.waset.org/search?q=EDTA." title=" EDTA."> EDTA.</a> </p> <a href="https://publications.waset.org/10012454/estimation-of-opc-fly-ash-and-slag-contents-in-blended-and-composite-cements-by-selective-dissolution-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012454/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012454/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012454/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012454/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012454/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012454/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012454/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012454/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012454/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012454/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012454.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">405</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">236</span> A Family of Affine Projection Adaptive Filtering Algorithms With Selective Regressors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20Shams%20Esfand%20Abadi">Mohammad Shams Esfand Abadi</a>, <a href="https://publications.waset.org/search?q=Nader%20Hadizadeh%20Kashani"> Nader Hadizadeh Kashani</a>, <a href="https://publications.waset.org/search?q=Vahid%20Mehrdad"> Vahid Mehrdad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present a general formalism for the establishment of the family of selective regressor affine projection algorithms (SR-APA). The SR-APA, the SR regularized APA (SR-RAPA), the SR partial rank algorithm (SR-PRA), the SR binormalized data reusing least mean squares (SR-BNDR-LMS), and the SR normalized LMS with orthogonal correction factors (SR-NLMS-OCF) algorithms are established by this general formalism. We demonstrate the performance of the presented algorithms through simulations in acoustic echo cancellation scenario. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20filter" title="Adaptive filter">Adaptive filter</a>, <a href="https://publications.waset.org/search?q=affine%20projection" title=" affine projection"> affine projection</a>, <a href="https://publications.waset.org/search?q=selective%20regressor." title=" selective regressor."> selective regressor.</a> </p> <a href="https://publications.waset.org/832/a-family-of-affine-projection-adaptive-filtering-algorithms-with-selective-regressors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/832/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/832/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/832/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/832/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/832/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/832/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/832/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/832/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/832/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/832/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/832.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">1574</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">235</span> Statistical Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20Ali%20Tabarzad">Mohammad Ali Tabarzad</a>, <a href="https://publications.waset.org/search?q=Caro%20Lucas"> Caro Lucas</a>, <a href="https://publications.waset.org/search?q=Ali%20Hamzeh"> Ali Hamzeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Adaptive Genetic Algorithms extend the Standard Gas to use dynamic procedures to apply evolutionary operators such as crossover, mutation and selection. In this paper, we try to propose a new adaptive genetic algorithm, which is based on the statistical information of the population as a guideline to tune its crossover, selection and mutation operators. This algorithms is called Statistical Genetic Algorithm and is compared with traditional GA in some benchmark problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithms" title="Genetic Algorithms">Genetic Algorithms</a>, <a href="https://publications.waset.org/search?q=Statistical%20Information%20ofthe%20Population" title=" Statistical Information ofthe Population"> Statistical Information ofthe Population</a>, <a href="https://publications.waset.org/search?q=PAUX" title=" PAUX"> PAUX</a>, <a href="https://publications.waset.org/search?q=SSO." title=" SSO."> SSO.</a> </p> <a href="https://publications.waset.org/3717/statistical-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3717/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3717/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3717/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3717/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3717/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3717/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3717/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3717/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3717/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3717/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3717.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">1754</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">234</span> Minimizing Mutant Sets by Equivalence and Subsumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Samia%20Alblwi">Samia Alblwi</a>, <a href="https://publications.waset.org/search?q=Amani%20Ayad"> Amani Ayad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Mutation testing is the art of generating syntactic variations of a base program and checking whether a candidate test suite can identify all the mutants that are not semantically equivalent to the base; this technique can be used to assess the quality of test suite. One of the main obstacles to the widespread use of mutation testing is cost, as even small programs (a few dozen lines of code) can give rise to a large number of mutants (up to hundreds); this has created an incentive to seek to reduce the number of mutants while preserving their collective effectiveness. Two criteria have been used to reduce the size of mutant sets: equivalence, which aims to partition the set of mutants into equivalence classes modulo semantic equivalence, and selecting one representative per class; and, subsumption, which aims to define a partial ordering among mutants that ranks mutants by effectiveness and seeks to select maximal elements in this ordering. In this paper, we analyze these two policies using analytical and empirical criteria.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mutation%20testing" title="Mutation testing">Mutation testing</a>, <a href="https://publications.waset.org/search?q=mutant%20sets" title=" mutant sets"> mutant sets</a>, <a href="https://publications.waset.org/search?q=mutant%20equivalence" title=" mutant equivalence"> mutant equivalence</a>, <a href="https://publications.waset.org/search?q=mutant%20subsumption" title=" mutant subsumption"> mutant subsumption</a>, <a href="https://publications.waset.org/search?q=mutant%20set%20minimization." title=" mutant set minimization."> mutant set minimization.</a> </p> <a href="https://publications.waset.org/10013444/minimizing-mutant-sets-by-equivalence-and-subsumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013444/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013444/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013444/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013444/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013444/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013444/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013444/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013444/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013444/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013444/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013444.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">193</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">233</span> Source of Oseltamivir Resistance Due to R152K Mutation of Influenza B Virus Neuraminidase: Molecular Modeling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J.%20Tengrang">J. Tengrang</a>, <a href="https://publications.waset.org/search?q=T.%20Rungrotmongkol"> T. Rungrotmongkol</a>, <a href="https://publications.waset.org/search?q=S.%20Hannongbua"> S. Hannongbua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Every 2-3 years the influenza B virus serves epidemics. Neuraminidase (NA) is an important target for influenza drug design. Although, oseltamivir, an oral neuraminidase drug, has been shown good inhibitory efficiency against wild-type of influenza B virus, the lower susceptibility to the R152K mutation has been reported. Better understanding of oseltamivir efficiency and resistance toward the influenza B NA wild-type and R152K mutant, respectively, could be useful for rational drug design. Here, two complex systems of wild-type and R152K NAs with oseltamivir bound were studied using molecular dynamics (MD) simulations. Based on 5-ns MD simulation, the loss of notable hydrogen bond and decrease in per-residue decomposition energy from the mutated residue K152 contributed to drug compared to those of R152 in wildtype were found to be a primary source of high-level of oseltamivir resistance due to the R152K mutation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Influenza%20B%20neuraminidase" title="Influenza B neuraminidase">Influenza B neuraminidase</a>, <a href="https://publications.waset.org/search?q=Molecular%20dynamics%0Asimulation" title=" Molecular dynamics simulation"> Molecular dynamics simulation</a>, <a href="https://publications.waset.org/search?q=Oseltamivir%20resistance" title=" Oseltamivir resistance"> Oseltamivir resistance</a>, <a href="https://publications.waset.org/search?q=R152K%20mutant" title=" R152K mutant"> R152K mutant</a> </p> <a href="https://publications.waset.org/5452/source-of-oseltamivir-resistance-due-to-r152k-mutation-of-influenza-b-virus-neuraminidase-molecular-modeling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5452/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5452/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5452/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5452/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5452/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5452/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5452/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5452/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5452/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5452/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5452.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">1910</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">232</span> Metal-Dielectric Antireflection Coating on Metallic Substrate for Solar Selective Absorbers of Concentrating Solar Power Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chien-Cheng%20Kuo">Chien-Cheng Kuo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We design and discuss metal-dielectric antireflection coating on metallic substrates for Solar Selective Absorbers of Concentrating Solar Power Systems. The average reflectance is 8.5% at 400-3000nm and 84.4% at 3000nm-10000nm of the metal-dielectric structure.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Concentrating%20solar%20power%20systems" title="Concentrating solar power systems">Concentrating solar power systems</a>, <a href="https://publications.waset.org/search?q=solar%20thermal" title=" solar thermal"> solar thermal</a>, <a href="https://publications.waset.org/search?q=solar%20selective%20absorber" title=" solar selective absorber"> solar selective absorber</a>, <a href="https://publications.waset.org/search?q=absorptance" title=" absorptance"> absorptance</a>, <a href="https://publications.waset.org/search?q=emittance." title=" emittance."> emittance.</a> </p> <a href="https://publications.waset.org/10296/metal-dielectric-antireflection-coating-on-metallic-substrate-for-solar-selective-absorbers-of-concentrating-solar-power-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10296/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10296/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10296/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10296/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10296/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10296/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10296/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10296/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10296/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10296/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10296.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">1817</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">231</span> Selective and Facilitated Transport of Vanadium (VO2 +) Ion through Supported Liquid Membrane and Effects of Membrane Characteristics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Danial%20Husseinzadeh">Danial Husseinzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new supported liquid membrane (SLM) system for the selective transport of VO2 + ions was prepared in this present work. The SLM was a thin porous polyvinylidene difluoride (PVDF) membrane soaked with Di-(2-ethylhexyl) phosphoric acid (D2EHPA) as mobile carrier in Xylene as organic solvent. D2EHPA acts as a highly selective carrier for the uphill transport of VO2 + ions through the SLM. The transport of VO2 + ions reached to 64%. In the presence of P2O7-2 ion as suitable masking agent in the feed solution, the interfering effects of other cations were eliminated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Facilitated%20ion%20transport" title="Facilitated ion transport">Facilitated ion transport</a>, <a href="https://publications.waset.org/search?q=Membrane%20characteristics" title=" Membrane characteristics"> Membrane characteristics</a>, <a href="https://publications.waset.org/search?q=Supported%20liquid%20membranes" title=" Supported liquid membranes"> Supported liquid membranes</a>, <a href="https://publications.waset.org/search?q=Vanadium." title=" Vanadium."> Vanadium.</a> </p> <a href="https://publications.waset.org/1538/selective-and-facilitated-transport-of-vanadium-vo2-ion-through-supported-liquid-membrane-and-effects-of-membrane-characteristics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1538/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1538/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1538/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1538/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1538/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1538/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1538/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1538/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1538/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1538/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1538.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">1847</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">230</span> A Multi-Population Differential Evolution with Adaptive Mutation and Local Search for Global Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhoucheng%20Bao">Zhoucheng Bao</a>, <a href="https://publications.waset.org/search?q=Haiyan%20Zhu"> Haiyan Zhu</a>, <a href="https://publications.waset.org/search?q=Tingting%20Pang"> Tingting Pang</a>, <a href="https://publications.waset.org/search?q=Zuling%20Wang"> Zuling Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a multi population Differential Evolution (DE) with adaptive mutation and local search for global optimization, named AMMADE in order to better coordinate the cooperation between the populations and the rational use of resources. In AMMADE, the population is divided based on the Euclidean distance sorting method at each generation to appropriately coordinate the cooperation between subpopulations and the usage of resources, such that the best-performed subpopulation will get more computing resources in the next generation. Further, an adaptive local search strategy is employed on the best-performed subpopulation to achieve a balanced search. The proposed algorithm has been tested by solving optimization problems taken from CEC2014 benchmark problems. Experimental results show that our algorithm can achieve a competitive or better result than related methods. The results also confirm the significance of devised strategies in the proposed algorithm.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Differential%20evolution" title="Differential evolution">Differential evolution</a>, <a href="https://publications.waset.org/search?q=multi-mutation%20strategies" title=" multi-mutation strategies"> multi-mutation strategies</a>, <a href="https://publications.waset.org/search?q=memetic%20algorithm" title=" memetic algorithm"> memetic algorithm</a>, <a href="https://publications.waset.org/search?q=adaptive%20local%20search." title=" adaptive local search."> adaptive local search.</a> </p> <a href="https://publications.waset.org/10012611/a-multi-population-differential-evolution-with-adaptive-mutation-and-local-search-for-global-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012611/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012611/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012611/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012611/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012611/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012611/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012611/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012611/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012611/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012611/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012611.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">442</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">229</span> Application of Adaptive Genetic Algorithm in Function Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Panpan%20Xu">Panpan Xu</a>, <a href="https://publications.waset.org/search?q=Shulin%20Sui"> Shulin Sui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The crossover probability and mutation probability are the two important factors in genetic algorithm. The adaptive genetic algorithm can improve the convergence performance of genetic algorithm, in which the crossover probability and mutation probability are adaptively designed with the changes of fitness value. We apply adaptive genetic algorithm into a function optimization problem. The numerical experiment represents that adaptive genetic algorithm improves the convergence speed and avoids local convergence.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Adaptive%20genetic%20algorithm" title=" Adaptive genetic algorithm"> Adaptive genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Function%20optimization." title=" Function optimization."> Function optimization.</a> </p> <a href="https://publications.waset.org/10003327/application-of-adaptive-genetic-algorithm-in-function-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003327/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003327/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003327/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003327/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003327/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003327/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003327/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003327/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003327/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003327/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003327.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">1724</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">228</span> Preparation and Evaluation of New Nanocatalysts for Selective Oxidation of H2S to Sulfur</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20Rezaee">Mohammad Rezaee</a>, <a href="https://publications.waset.org/search?q=Mohammad%20Kazemeini"> Mohammad Kazemeini</a>, <a href="https://publications.waset.org/search?q=Ali%20Morad%20Rashidi"> Ali Morad Rashidi</a>, <a href="https://publications.waset.org/search?q=Moslem%20Fattahi"> Moslem Fattahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Selective oxidation of H2S to elemental sulfur in a fixed bed reactor over newly synthesized alumina nanocatalysts was physio-chemically investigated and results compared with a commercial Claus catalyst. Amongst these new materials, Al2O3- supported sodium oxide prepared with wet chemical technique and Al2O3 nanocatalyst prepared with spray pyrolysis method were the most active catalysts for selective oxidation of H2S to elemental sulfur. Other prepared nanocatalysts were quickly deactivated, mainly due to the interaction with H2S and conversion into sulfides. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=H2S" title="H2S">H2S</a>, <a href="https://publications.waset.org/search?q=Claus%20process" title=" Claus process"> Claus process</a>, <a href="https://publications.waset.org/search?q=Al2O3" title=" Al2O3"> Al2O3</a>, <a href="https://publications.waset.org/search?q=Spray%20pyrolysis%20method" title=" Spray pyrolysis method"> Spray pyrolysis method</a>, <a href="https://publications.waset.org/search?q=Wet%20chemical%20technique" title=" Wet chemical technique"> Wet chemical technique</a> </p> <a href="https://publications.waset.org/14294/preparation-and-evaluation-of-new-nanocatalysts-for-selective-oxidation-of-h2s-to-sulfur" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14294/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14294/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14294/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14294/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14294/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14294/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14294/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14294/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14294/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14294/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14294.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">2513</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">227</span> An Improved Genetic Algorithm to Solve the Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Omar%20M.%20Sallabi">Omar M. Sallabi</a>, <a href="https://publications.waset.org/search?q=Younis%20El-Haddad"> Younis El-Haddad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Genetic Algorithm (GA) is one of the most important methods used to solve many combinatorial optimization problems. Therefore, many researchers have tried to improve the GA by using different methods and operations in order to find the optimal solution within reasonable time. This paper proposes an improved GA (IGA), where the new crossover operation, population reformulates operation, multi mutation operation, partial local optimal mutation operation, and rearrangement operation are used to solve the Traveling Salesman Problem. The proposed IGA was then compared with three GAs, which use different crossover operations and mutations. The results of this comparison show that the IGA can achieve better results for the solutions in a faster time.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AI" title="AI">AI</a>, <a href="https://publications.waset.org/search?q=Genetic%20algorithms" title=" Genetic algorithms"> Genetic algorithms</a>, <a href="https://publications.waset.org/search?q=TSP." title=" TSP."> TSP.</a> </p> <a href="https://publications.waset.org/15802/an-improved-genetic-algorithm-to-solve-the-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15802/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15802/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15802/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15802/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15802/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15802/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15802/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15802/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15802/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15802/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15802.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">2613</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">226</span> An Analysis of Abortion Laws and Sex Selective Abortion in India: A Case Study of Rajasthan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Priya%20Bhakat">Priya Bhakat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A son in every Hindu society pays his own father the debt and he owes him for his own life whereas a girl child is treated as a burden mainly in case of first child. Even today in India we have many societies which does not welcome girl child. Although there is an increase in overall sex ratio, there is a continuous decline in child sex ratio. This paper focuses on issues of sex selective abortion in Rajasthan based on secondary data. It is found that 90.0 percentages of women in Rajasthan wants at least one son. Around 34.3 percentages of women wants more sons than daughters and only 1.5 percentages of women wants more daughters than sons. It is very common among the rich and educated people.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Rajasthan" title="Rajasthan">Rajasthan</a>, <a href="https://publications.waset.org/search?q=Family%20Planning%20Program%20%28FPP%29" title=" Family Planning Program (FPP)"> Family Planning Program (FPP)</a>, <a href="https://publications.waset.org/search?q=Sex%0D%0ASelective%20Abortion%20%28SSA%29" title=" Sex Selective Abortion (SSA)"> Sex Selective Abortion (SSA)</a>, <a href="https://publications.waset.org/search?q=Sex%20Ratio%20at%20Birth%20%28SRB%29." title=" Sex Ratio at Birth (SRB)."> Sex Ratio at Birth (SRB).</a> </p> <a href="https://publications.waset.org/11262/an-analysis-of-abortion-laws-and-sex-selective-abortion-in-india-a-case-study-of-rajasthan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11262/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11262/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11262/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11262/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11262/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11262/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11262/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11262/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11262/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11262/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11262.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">3686</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">225</span> The Automated Selective Acquisition System </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Atisthan%20Wuttimanop">Atisthan Wuttimanop</a>, <a href="https://publications.waset.org/search?q=Suchada%20Rianmora"> Suchada Rianmora</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>To support design process for launching the product on time, reverse engineering (RE) process has been introduced for quickly generating 3D CAD model from its physical object. The accuracy of the 3D CAD model depends upon the data acquisition technique selected, contact or non-contact methods. In order to reduce times used for acquiring surface and eliminating noises, the automated selective acquisition system has been developed and presented in this research as the alternative channel for non-contact acquisition technique where the data is selectively and locally scanned contour by contour without performing data reduction process. The results present as the organized contour points which are directly used to generate 3D virtual model. The comparison between the proposed technique and another non-contact scanning technique has been presented and discussed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Automated%20selective%20acquisition%20system" title="Automated selective acquisition system">Automated selective acquisition system</a>, <a href="https://publications.waset.org/search?q=Non-contact%20acquisition" title=" Non-contact acquisition"> Non-contact acquisition</a>, <a href="https://publications.waset.org/search?q=Reverse%20engineering" title=" Reverse engineering"> Reverse engineering</a>, <a href="https://publications.waset.org/search?q=3D%20scanners." title=" 3D scanners."> 3D scanners.</a> </p> <a href="https://publications.waset.org/9996980/the-automated-selective-acquisition-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9996980/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9996980/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9996980/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9996980/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9996980/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9996980/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9996980/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9996980/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9996980/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9996980/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9996980.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">1609</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">224</span> Cascaded H-Bridge Five Level Inverter Based Selective Harmonic Eliminated Pulse Width Modulation for Harmonic Elimination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Selvaperumal">S. Selvaperumal</a>, <a href="https://publications.waset.org/search?q=M.%20S.%20Sivagamasundari"> M. S. Sivagamasundari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, selective harmonic elimination pulse width modulation technique is employed to eliminate lower order harmonics like third by determination of solving non-linear equations. The cascaded H-bridge five level inverter is driven by the Peripheral Interface Controlled (PIC) Microcontroller 16F877A. The performance of single phase cascaded H-bridge five level inverter with relevant to harmonics and a variety of switches with solar cell as its input source is simulated by employing MATLAB/Simulink. A hardware model is developed to verify the performance of the developed system.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multilevel%20inverter" title="Multilevel inverter">Multilevel inverter</a>, <a href="https://publications.waset.org/search?q=cascaded%20H-Bridge%20multilevel%20inverter" title=" cascaded H-Bridge multilevel inverter"> cascaded H-Bridge multilevel inverter</a>, <a href="https://publications.waset.org/search?q=total%20harmonic%20distortion" title=" total harmonic distortion"> total harmonic distortion</a>, <a href="https://publications.waset.org/search?q=selective%20harmonic%20elimination%20pulse%20width%20modulation" title=" selective harmonic elimination pulse width modulation"> selective harmonic elimination pulse width modulation</a>, <a href="https://publications.waset.org/search?q=MATLAB." title=" MATLAB."> MATLAB.</a> </p> <a href="https://publications.waset.org/10010073/cascaded-h-bridge-five-level-inverter-based-selective-harmonic-eliminated-pulse-width-modulation-for-harmonic-elimination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010073/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010073/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010073/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010073/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010073/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010073/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010073/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010073/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010073/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010073/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010073.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">827</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=selective%20mutation&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>