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: Bottom-up automata</title> <meta name="description" content="Search results for: Bottom-up automata"> <meta name="keywords" content="Bottom-up automata"> <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="Bottom-up automata" 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="Bottom-up automata"> <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> 51</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Bottom-up automata</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">51</span> Classification Based on Deep Neural Cellular Automata Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yasser%20F.%20Hassan">Yasser F. Hassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Deep learning structure is a branch of machine learning science and greet achievement in research and applications. Cellular neural networks are regarded as array of nonlinear analog processors called cells connected in a way allowing parallel computations. The paper discusses how to use deep learning structure for representing neural cellular automata model. The proposed learning technique in cellular automata model will be examined from structure of deep learning. A deep automata neural cellular system modifies each neuron based on the behavior of the individual and its decision as a result of multi-level deep structure learning. The paper will present the architecture of the model and the results of simulation of approach are given. Results from the implementation enrich deep neural cellular automata system and shed a light on concept formulation of the model and the learning in it. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cellular%20automata" title="Cellular automata">Cellular automata</a>, <a href="https://publications.waset.org/search?q=neural%20cellular%20automata" title=" neural cellular automata"> neural cellular automata</a>, <a href="https://publications.waset.org/search?q=deep%20learning" title=" deep learning"> deep learning</a>, <a href="https://publications.waset.org/search?q=classification." title=" classification."> classification.</a> </p> <a href="https://publications.waset.org/10010605/classification-based-on-deep-neural-cellular-automata-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010605/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010605/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010605/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010605/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010605/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010605/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010605/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010605/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010605/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010605/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010605.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">866</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">50</span> The Different Ways to Describe Regular Languages by Using Finite Automata and the Changing Algorithm Implementation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abdulmajid%20Mukhtar%20Afat">Abdulmajid Mukhtar Afat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper aims at introducing finite automata theory, the different ways to describe regular languages and create a program to implement the subset construction algorithms to convert nondeterministic finite automata (NFA) to deterministic finite automata (DFA). This program is written in c++ programming language. The program reads FA 5tuples from text file and then classifies it into either DFA or NFA. For DFA, the program will read the string w and decide whether it is acceptable or not. If accepted, the program will save the tracking path and point it out. On the other hand, when the automation is NFA, the program will change the Automation to DFA so that it is easy to track and it can decide whether the w exists in the regular language or not.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20Automata" title="Finite Automata">Finite Automata</a>, <a href="https://publications.waset.org/search?q=subset%20construction%20DFA" title=" subset construction DFA"> subset construction DFA</a>, <a href="https://publications.waset.org/search?q=NFA." title=" NFA."> NFA.</a> </p> <a href="https://publications.waset.org/9999575/the-different-ways-to-describe-regular-languages-by-using-finite-automata-and-the-changing-algorithm-implementation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999575/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999575/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999575/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999575/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999575/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999575/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999575/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999575/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999575/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999575/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999575.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">1986</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">49</span> Bridged Quantum Cellular Automata based on Si/SiO2 Superlattices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.V.%20Matyushkin">I.V. Matyushkin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The new architecture for quantum cellular automata is offered. A QCA cell includes two layers nc-Si, divided by a dielectric. Among themselves cells are connected by the bridge from a conductive material. The comparison is made between this and QCA, offered earlier by C. Lent's group. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=quantum%20cellular%20automata%20%28QCA%29" title="quantum cellular automata (QCA)">quantum cellular automata (QCA)</a>, <a href="https://publications.waset.org/search?q=nc-Si" title=" nc-Si"> nc-Si</a>, <a href="https://publications.waset.org/search?q=Si%2FSiO2%20superlattices" title="Si/SiO2 superlattices">Si/SiO2 superlattices</a>, <a href="https://publications.waset.org/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/13086/bridged-quantum-cellular-automata-based-on-sisio2-superlattices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13086/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13086/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13086/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13086/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13086/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13086/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13086/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13086/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13086/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13086/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13086.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">1405</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">48</span> Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Makoto%20Sakamoto">Makoto Sakamoto</a>, <a href="https://publications.waset.org/search?q=Yasuo%20Uchida"> Yasuo Uchida</a>, <a href="https://publications.waset.org/search?q=Makoto%20Nagatomo"> Makoto Nagatomo</a>, <a href="https://publications.waset.org/search?q=Takao%20Ito"> Takao Ito</a>, <a href="https://publications.waset.org/search?q=Tsunehiro%20Yoshinaga">Tsunehiro Yoshinaga</a>, <a href="https://publications.waset.org/search?q=Satoshi%20Ikeda">Satoshi Ikeda</a>, <a href="https://publications.waset.org/search?q=Masahiro%20Yokomichi">Masahiro Yokomichi</a>, <a href="https://publications.waset.org/search?q=Hiroshi%20Furutani"> Hiroshi Furutani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In theoretical computer science, the Turing machine has played a number of important roles in understanding and exploiting basic concepts and mechanisms in computing and information processing [20]. It is a simple mathematical model of computers [9]. After that, M.Blum and C.Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing, and investigated their pattern recognition abilities in 1967 [7]. Since then, a lot of researchers in this field have been investigating many properties about automata on a two- or three-dimensional tape. On the other hand, the question of whether processing fourdimensional digital patterns is much more difficult than two- or threedimensional ones is of great interest from the theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computasional model of four-dimensional pattern processing has been meaningful [8]-[19],[21]. This paper introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape where these finite automata work independently (in parallel). Those finite automata whose input heads scan the same cell of the input tape can communicate with each other, that is, every finite automaton is allowed to know the internal states of other finite automata on the same cell it is scanning at the moment. In this paper, we mainly investigate some accepting powers of a cooperating system of eight- or seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is an eight-way four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the fu-ture, but not in the past on a four-dimensional input tape.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=computational%20complexity" title="computational complexity">computational complexity</a>, <a href="https://publications.waset.org/search?q=cooperating%20system" title=" cooperating system"> cooperating system</a>, <a href="https://publications.waset.org/search?q=finite%0D%0Aautomaton" title=" finite automaton"> finite automaton</a>, <a href="https://publications.waset.org/search?q=four-dimension" title=" four-dimension"> four-dimension</a>, <a href="https://publications.waset.org/search?q=hierarchy" title=" hierarchy"> hierarchy</a>, <a href="https://publications.waset.org/search?q=multihead." title=" multihead."> multihead.</a> </p> <a href="https://publications.waset.org/6351/hierarchies-based-on-the-number-of-cooperating-systems-of-finite-automata-on-four-dimensional-input-tapes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6351/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6351/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6351/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6351/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6351/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6351/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6351/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6351/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6351/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6351/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6351.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">1888</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">47</span> Using 蔚 Value in Describe Regular Languages by Using Finite Automata, Operation on Languages and the Changing Algorithm Implementation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abdulmajid%20Mukhtar%20Afat">Abdulmajid Mukhtar Afat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper aims at introducing nondeterministic finite automata with ε value which is used to perform some operations on languages. a program is created to implement the algorithm that converts nondeterministic finite automata with ε value (ε-NFA) to deterministic finite automata (DFA).The program is written in c++ programming language. The program inputs are FA 5-tuples from text file and then classifies it into either DFA/NFA or ε -NFA. For DFA, the program will get the string <em>w</em> and decide whether it is accepted or rejected. The tracking path for an accepted string is saved by the program. In case of NFA or ε-NFA automation, the program changes the automation to DFA to enable tracking and to decide if the string <em>w</em> exists in the regular language or not.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20automata" title="Finite automata">Finite automata</a>, <a href="https://publications.waset.org/search?q=DFA" title=" DFA"> DFA</a>, <a href="https://publications.waset.org/search?q=NFA" title=" NFA"> NFA</a>, <a href="https://publications.waset.org/search?q=%CE%B5-NFA" title=" 蔚-NFA"> 蔚-NFA</a>, <a href="https://publications.waset.org/search?q=Eclose" title=" Eclose"> Eclose</a>, <a href="https://publications.waset.org/search?q=operations%20on%20languages." title=" operations on languages."> operations on languages.</a> </p> <a href="https://publications.waset.org/10010172/using-e-value-in-describe-regular-languages-by-using-finite-automata-operation-on-languages-and-the-changing-algorithm-implementation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010172/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010172/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010172/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010172/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010172/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010172/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010172/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010172/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010172/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010172/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010172.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">837</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">46</span> A new Cellular Automata Model of Cardiac Action Potential Propagation based on Summation of Excited Neighbors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20Pourhasanzade">F. Pourhasanzade</a>, <a href="https://publications.waset.org/search?q=S.%20H.%20Sabzpoushan"> S. H. Sabzpoushan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The heart tissue is an excitable media. A Cellular Automata is a type of model that can be used to model cardiac action potential propagation. One of the advantages of this approach against the methods based on differential equations is its high speed in large scale simulations. Recent cellular automata models are not able to avoid flat edges in the result patterns or have large neighborhoods. In this paper, we present a new model to eliminate flat edges by minimum number of neighbors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cellular%20Automata" title="Cellular Automata">Cellular Automata</a>, <a href="https://publications.waset.org/search?q=Action%20Potential%20Simulation" title=" Action Potential Simulation"> Action Potential Simulation</a>, <a href="https://publications.waset.org/search?q=Isotropic%20Pattern." title="Isotropic Pattern.">Isotropic Pattern.</a> </p> <a href="https://publications.waset.org/13719/a-new-cellular-automata-model-of-cardiac-action-potential-propagation-based-on-summation-of-excited-neighbors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13719/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13719/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13719/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13719/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13719/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13719/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13719/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13719/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13719/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13719/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13719.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">1949</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">45</span> A Cheating Model for Cellular Automata-Based Secret Sharing Schemes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Borna%20Jafarpour">Borna Jafarpour</a>, <a href="https://publications.waset.org/search?q=Azadeh%20Nematzadeh"> Azadeh Nematzadeh</a>, <a href="https://publications.waset.org/search?q=Vahid%20Kazempour"> Vahid Kazempour</a>, <a href="https://publications.waset.org/search?q=Babak%20Sadeghian"> Babak Sadeghian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Cellular automata have been used for design of cryptosystems. Recently some secret sharing schemes based on linear memory cellular automata have been introduced which are used for both text and image. In this paper, we illustrate that these secret sharing schemes are vulnerable to dishonest participants- collusion. We propose a cheating model for the secret sharing schemes based on linear memory cellular automata. For this purpose we present a novel uniform model for representation of all secret sharing schemes based on cellular automata. Participants can cheat by means of sending bogus shares or bogus transition rules. Cheaters can cooperate to corrupt a shared secret and compute a cheating value added to it. Honest participants are not aware of cheating and suppose the incorrect secret as the valid one. We prove that cheaters can recover valid secret by removing the cheating value form the corrupted secret. We provide methods of calculating the cheating value.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cellular%20automata" title="Cellular automata">Cellular automata</a>, <a href="https://publications.waset.org/search?q=cheating%20model" title=" cheating model"> cheating model</a>, <a href="https://publications.waset.org/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a>, <a href="https://publications.waset.org/search?q=threshold%20scheme." title=" threshold scheme."> threshold scheme.</a> </p> <a href="https://publications.waset.org/12471/a-cheating-model-for-cellular-automata-based-secret-sharing-schemes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12471/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12471/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12471/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12471/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12471/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12471/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12471/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12471/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12471/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12471/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12471.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">1586</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">44</span> Data Mining Using Learning Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20R.%20Aghaebrahimi">M. R. Aghaebrahimi</a>, <a href="https://publications.waset.org/search?q=S.%20H.%20Zahiri"> S. H. Zahiri</a>, <a href="https://publications.waset.org/search?q=M.%20Amiri"> M. Amiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a data miner based on the learning automata is proposed and is called LA-miner. The LA-miner extracts classification rules from data sets automatically. The proposed algorithm is established based on the function optimization using learning automata. The experimental results on three benchmarks indicate that the performance of the proposed LA-miner is comparable with (sometimes better than) the Ant-miner (a data miner algorithm based on the Ant Colony optimization algorithm) and CNZ (a well-known data mining algorithm for classification). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20mining" title="Data mining">Data mining</a>, <a href="https://publications.waset.org/search?q=Learning%20automata" title=" Learning automata"> Learning automata</a>, <a href="https://publications.waset.org/search?q=Classification%0Arules" title=" Classification rules"> Classification rules</a>, <a href="https://publications.waset.org/search?q=Knowledge%20discovery." title=" Knowledge discovery."> Knowledge discovery.</a> </p> <a href="https://publications.waset.org/6146/data-mining-using-learning-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6146/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6146/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6146/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6146/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6146/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6146/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6146/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6146/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6146/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6146/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6146.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">1935</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">43</span> Construction of Intersection of Nondeterministic Finite Automata using Z Notation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nazir%20Ahmad%20Zafar">Nazir Ahmad Zafar</a>, <a href="https://publications.waset.org/search?q=Nabeel%20Sabir"> Nabeel Sabir</a>, <a href="https://publications.waset.org/search?q=Amir%20Ali"> Amir Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Functionalities and control behavior are both primary requirements in design of a complex system. Automata theory plays an important role in modeling behavior of a system. Z is an ideal notation which is used for describing state space of a system and then defining operations over it. Consequently, an integration of automata and Z will be an effective tool for increasing modeling power for a complex system. Further, nondeterministic finite automata (NFA) may have different implementations and therefore it is needed to verify the transformation from diagrams to a code. If we describe formal specification of an NFA before implementing it, then confidence over transformation can be increased. In this paper, we have given a procedure for integrating NFA and Z. Complement of a special type of NFA is defined. Then union of two NFAs is formalized after defining their complements. Finally, formal construction of intersection of NFAs is described. The specification of this relationship is analyzed and validated using Z/EVES tool. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Modeling" title="Modeling">Modeling</a>, <a href="https://publications.waset.org/search?q=Nondeterministic%20finite%20automata" title=" Nondeterministic finite automata"> Nondeterministic finite automata</a>, <a href="https://publications.waset.org/search?q=Znotation" title=" Znotation"> Znotation</a>, <a href="https://publications.waset.org/search?q=Integration%20of%20approaches" title=" Integration of approaches"> Integration of approaches</a>, <a href="https://publications.waset.org/search?q=Validation." title=" Validation."> Validation.</a> </p> <a href="https://publications.waset.org/12799/construction-of-intersection-of-nondeterministic-finite-automata-using-z-notation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12799/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12799/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12799/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12799/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12799/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12799/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12799/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12799/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12799/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12799/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12799.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">3181</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">42</span> On Decomposition of Maximal Prefix Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nikolai%20Krainiukov">Nikolai Krainiukov</a>, <a href="https://publications.waset.org/search?q=Boris%20Melnikov"> Boris Melnikov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We study the properties of maximal prefix codes. The codes have many applications in computer science, theory of formal languages, data processing and data classification. Our approaches to study use finite state automata (so-called flower automata) for the representation of prefix codes. An important task is the decomposition of prefix codes into prime prefix codes (factors). We discuss properties of such prefix code decompositions. A linear time algorithm is designed to find the prime decomposition. We used the GAP computer algebra system, which allows us to perform algebraic operations for free semigroups, monoids and automata.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Maximal%20prefix%20code" title="Maximal prefix code">Maximal prefix code</a>, <a href="https://publications.waset.org/search?q=regular%20languages" title=" regular languages"> regular languages</a>, <a href="https://publications.waset.org/search?q=flower%20automata" title=" flower automata"> flower automata</a>, <a href="https://publications.waset.org/search?q=prefix%20code%20decomposing." title=" prefix code decomposing."> prefix code decomposing.</a> </p> <a href="https://publications.waset.org/10013756/on-decomposition-of-maximal-prefix-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013756/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013756/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013756/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013756/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013756/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013756/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013756/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013756/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013756/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013756/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013756.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">69</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">41</span> Rough Neural Networks in Adapting Cellular Automata Rule for Reducing Image Noise</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yasser%20F.%20Hassan">Yasser F. Hassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The reduction or removal of noise in a color image is an essential part of image processing, whether the final information is used for human perception or for an automatic inspection and analysis. This paper describes the modeling system based on the rough neural network model to adaptive cellular automata for various image processing tasks and noise remover. In this paper, we consider the problem of object processing in colored image using rough neural networks to help deriving the rules which will be used in cellular automata for noise image. The proposed method is compared with some classical and recent methods. The results demonstrate that the new model is capable of being trained to perform many different tasks, and that the quality of these results is comparable or better than established specialized algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Rough%20Sets" title="Rough Sets">Rough Sets</a>, <a href="https://publications.waset.org/search?q=Rough%20Neural%20Networks" title=" Rough Neural Networks"> Rough Neural Networks</a>, <a href="https://publications.waset.org/search?q=Cellular%20Automata" title=" Cellular Automata"> Cellular Automata</a>, <a href="https://publications.waset.org/search?q=Image%20Processing." title=" Image Processing. "> Image Processing. </a> </p> <a href="https://publications.waset.org/9997247/rough-neural-networks-in-adapting-cellular-automata-rule-for-reducing-image-noise" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997247/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997247/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997247/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997247/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997247/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997247/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997247/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997247/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997247/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997247/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997247.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">1948</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">40</span> Equivalent Transformation for Heterogeneous Traffic Cellular Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shih-Ching%20Lo">Shih-Ching Lo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Understanding driving behavior is a complicated researching topic. To describe accurate speed, flow and density of a multiclass users traffic flow, an adequate model is needed. In this study, we propose the concept of standard passenger car equivalent (SPCE) instead of passenger car equivalent (PCE) to estimate the influence of heavy vehicles and slow cars. Traffic cellular automata model is employed to calibrate and validate the results. According to the simulated results, the SPCE transformations present good accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=traffic%20flow" title="traffic flow">traffic flow</a>, <a href="https://publications.waset.org/search?q=passenger%20car%20equivalent" title=" passenger car equivalent"> passenger car equivalent</a>, <a href="https://publications.waset.org/search?q=cellular%0Aautomata" title=" cellular automata"> cellular automata</a> </p> <a href="https://publications.waset.org/1134/equivalent-transformation-for-heterogeneous-traffic-cellular-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1134/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1134/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1134/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1134/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1134/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1134/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1134/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1134/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1134/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1134/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1134.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">1710</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">39</span> Performance Analysis of Learning Automata-Based Routing Algorithms in Sparse Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Z.Farhadpour">Z.Farhadpour</a>, <a href="https://publications.waset.org/search?q=Mohammad.R.Meybodi"> Mohammad.R.Meybodi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A number of routing algorithms based on learning automata technique have been proposed for communication networks. How ever, there has been little work on the effects of variation of graph scarcity on the performance of these algorithms. In this paper, a comprehensive study is launched to investigate the performance of LASPA, the first learning automata based solution to the dynamic shortest path routing, across different graph structures with varying scarcities. The sensitivity of three main performance parameters of the algorithm, being average number of processed nodes, scanned edges and average time per update, to variation in graph scarcity is reported. Simulation results indicate that the LASPA algorithm can adapt well to the scarcity variation in graph structure and gives much better outputs than the existing dynamic and fixed algorithms in terms of performance criteria. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Learning%20automata" title="Learning automata">Learning automata</a>, <a href="https://publications.waset.org/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/search?q=algorithm" title=" algorithm"> algorithm</a>, <a href="https://publications.waset.org/search?q=sparse%0Agraph" title=" sparse graph"> sparse graph</a> </p> <a href="https://publications.waset.org/863/performance-analysis-of-learning-automata-based-routing-algorithms-in-sparse-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/863/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/863/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/863/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/863/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/863/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/863/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/863/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/863/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/863/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/863/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/863.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">1357</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">38</span> A Hybrid System of Hidden Markov Models and Recurrent Neural Networks for Learning Deterministic Finite State Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Pavan%20K.%20Rallabandi">Pavan K. Rallabandi</a>, <a href="https://publications.waset.org/search?q=Kailash%20C.%20Patidar"> Kailash C. Patidar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present an optimization technique or a learning algorithm using the hybrid architecture by combining the most popular sequence recognition models such as Recurrent Neural Networks (RNNs) and Hidden Markov models (HMMs). In order to improve the sequence/pattern recognition/classification performance by applying a hybrid/neural symbolic approach, a gradient descent learning algorithm is developed using the Real Time Recurrent Learning of Recurrent Neural Network for processing the knowledge represented in trained Hidden Markov Models. The developed hybrid algorithm is implemented on automata theory as a sample test beds and the performance of the designed algorithm is demonstrated and evaluated on learning the deterministic finite state automata. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hybrid%20systems" title="Hybrid systems">Hybrid systems</a>, <a href="https://publications.waset.org/search?q=Hidden%20Markov%20Models" title=" Hidden Markov Models"> Hidden Markov Models</a>, <a href="https://publications.waset.org/search?q=Recurrent%0D%0Aneural%20networks" title=" Recurrent neural networks"> Recurrent neural networks</a>, <a href="https://publications.waset.org/search?q=Deterministic%20finite%20state%20automata." title=" Deterministic finite state automata."> Deterministic finite state automata.</a> </p> <a href="https://publications.waset.org/10002715/a-hybrid-system-of-hidden-markov-models-and-recurrent-neural-networks-for-learning-deterministic-finite-state-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002715/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002715/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002715/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002715/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002715/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002715/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002715/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002715/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002715/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002715/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002715.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">2884</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">37</span> Proffering a Brand New Methodology to Resource Discovery in Grid based on Economic Criteria Using Learning Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ali%20Sarhadi">Ali Sarhadi</a>, <a href="https://publications.waset.org/search?q=Mohammad%20Reza%20Meybodi"> Mohammad Reza Meybodi</a>, <a href="https://publications.waset.org/search?q=Ali%20Yousefi"> Ali Yousefi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Resource discovery is one of the chief services of a grid. A new approach to discover the provenances in grid through learning automata has been propounded in this article. The objective of the aforementioned resource-discovery service is to select the resource based upon the user-s applications and the mercantile yardsticks that is to say opting for an originator which can accomplish the user-s tasks in the most economic manner. This novel service is submitted in two phases. We proffered an applicationbased categorization by means of an intelligent nerve-prone plexus. The user in question sets his or her application as the input vector of the nerve-prone nexus. The output vector of the aforesaid network limns the appropriateness of any one of the resource for the presented executive procedure. The most scrimping option out of those put forward in the previous stage which can be coped with to fulfill the task in question is picked out. Te resource choice is carried out by means of the presented algorithm based upon the learning automata.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Resource%20discovery" title="Resource discovery">Resource discovery</a>, <a href="https://publications.waset.org/search?q=learning%20automata" title=" learning automata"> learning automata</a>, <a href="https://publications.waset.org/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/search?q=economic%20policy" title=" economic policy"> economic policy</a> </p> <a href="https://publications.waset.org/10662/proffering-a-brand-new-methodology-to-resource-discovery-in-grid-based-on-economic-criteria-using-learning-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10662/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10662/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10662/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10662/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10662/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10662/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10662/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10662/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10662/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10662/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10662.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">1453</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">36</span> Some Relationships between Classes of Reverse Watson-Crick Finite Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kazuki%20Murakami">Kazuki Murakami</a>, <a href="https://publications.waset.org/search?q=Takashige%20Nakamura"> Takashige Nakamura</a>, <a href="https://publications.waset.org/search?q=Noriko%20Sakamoto"> Noriko Sakamoto</a>, <a href="https://publications.waset.org/search?q=Kunio%20Aizawa"> Kunio Aizawa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A Watson-Crick automaton is recently introduced as a computational model of DNA computing framework. It works on tapes consisting of double stranded sequences of symbols. Symbols placed on the corresponding cells of the double-stranded sequences are related by a complimentary relation. In this paper, we investigate a variation of Watson-Crick automata in which both heads read the tape in reverse directions. They are called reverse Watson-Crick finite automata (RWKFA). We show that all of following four classes, i.e., simple, 1-limited, all-final, all-final and simple, are equal to non-restricted version of RWKFA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=automaton" title="automaton">automaton</a>, <a href="https://publications.waset.org/search?q=DNA%20computing" title=" DNA computing"> DNA computing</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=Watson-Crick%20automaton" title="Watson-Crick automaton">Watson-Crick automaton</a> </p> <a href="https://publications.waset.org/3446/some-relationships-between-classes-of-reverse-watson-crick-finite-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3446/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3446/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3446/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3446/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3446/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3446/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3446/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3446/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3446/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3446/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3446.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1517</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">35</span> Involving Action Potential Morphology on a New Cellular Automata Model of Cardiac Action Potential Propagation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20Pourhasanzade">F. Pourhasanzade</a>, <a href="https://publications.waset.org/search?q=S.%20H.%20Sabzpoushan"> S. H. Sabzpoushan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computer modeling has played a unique role in understanding electrocardiography. Modeling and simulating cardiac action potential propagation is suitable for studying normal and pathological cardiac activation. This paper presents a 2-D Cellular Automata model for simulating action potential propagation in cardiac tissue. We demonstrate a novel algorithm in order to use minimum neighbors. This algorithm uses the summation of the excitability attributes of excited neighboring cells. We try to eliminate flat edges in the result patterns by inserting probability to the model. We also preserve the real shape of action potential by using linear curve fitting of one well known electrophysiological model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cellular%20Automata" title="Cellular Automata">Cellular Automata</a>, <a href="https://publications.waset.org/search?q=Action%20Potential%20Propagation" title=" Action Potential Propagation"> Action Potential Propagation</a>, <a href="https://publications.waset.org/search?q=cardiac%20tissue" title="cardiac tissue">cardiac tissue</a>, <a href="https://publications.waset.org/search?q=Isotropic%20Pattern" title=" Isotropic Pattern"> Isotropic Pattern</a>, <a href="https://publications.waset.org/search?q=accurate%20shape%20of%20cardiac%20actionpotential." title=" accurate shape of cardiac actionpotential."> accurate shape of cardiac actionpotential.</a> </p> <a href="https://publications.waset.org/11542/involving-action-potential-morphology-on-a-new-cellular-automata-model-of-cardiac-action-potential-propagation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11542/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11542/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11542/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11542/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11542/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11542/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11542/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11542/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11542/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11542/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11542.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">1327</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">34</span> Cellular Automata Based Robust Watermarking Architecture towards the VLSI Realization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=V.%20H.%20Mankar">V. H. Mankar</a>, <a href="https://publications.waset.org/search?q=T.%20S.%20Das"> T. S. Das</a>, <a href="https://publications.waset.org/search?q=S.%20K.%20Sarkar"> S. K. Sarkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we have proposed a novel blind watermarking architecture towards its hardware implementation in VLSI. In order to facilitate this hardware realization, cellular automata (CA) concept is introduced. The CA has been already accepted as an attractive structure for VLSI implementation because of its modularity, parallelism, high performance and reliability. The hardware realizable multiresolution spread spectrum watermarking techniques are very few in numbers in spite of their best ever resiliency against signal impairments. This is because of the computational cost and complexity associated with their different filter banks and lifting techniques. The concept of cellular automata theory in order to form a new transform domain technique i.e. Cellular Automata Transform (CAT) have been incorporated. Since CA provides spreading sequences having very low cross-correlation properties, the CA based pseudorandom sequence generator is considered in the present work. Considering the watermarking technique as a digital communication process, an error control coding (ECC) must be incorporated in the data hiding schemes. Besides the hardware implementation of entire CA based data hiding technique, the individual blocks of the algorithm using CA provide the best result than that of some other methods irrespective of the hardware and software technique. The Cellular Automata Transform, CA based PN sequence generator, and CA ECC are the requisite blocks that are developed not only to meet the reliable hardware requirements but also for the basic spread spectrum watermarking features. The proposed algorithm shows statistical invisibility and resiliency against various common signal-processing operations. This algorithmic design utilizes the existing allocated bandwidth in the data transmission channel in a more efficient manner.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cellular%20automata" title="Cellular automata">Cellular automata</a>, <a href="https://publications.waset.org/search?q=watermarking" title=" watermarking"> watermarking</a>, <a href="https://publications.waset.org/search?q=error%20control%20coding" title=" error control coding"> error control coding</a>, <a href="https://publications.waset.org/search?q=PN%20sequence" title=" PN sequence"> PN sequence</a>, <a href="https://publications.waset.org/search?q=VLSI." title=" VLSI."> VLSI.</a> </p> <a href="https://publications.waset.org/15454/cellular-automata-based-robust-watermarking-architecture-towards-the-vlsi-realization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15454/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15454/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15454/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15454/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15454/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15454/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15454/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15454/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15454/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15454/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15454.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">2067</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">33</span> Improved Artificial Immune System Algorithm with Local Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ramin%20Javadzadeh.">Ramin Javadzadeh.</a>, <a href="https://publications.waset.org/search?q=Zahra%20Afsahi"> Zahra Afsahi</a>, <a href="https://publications.waset.org/search?q=MohammadReza%20Meybodi"> MohammadReza Meybodi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Artificial immune systems algorithms are Meta heuristic optimization method, which are used for clustering and pattern recognition applications are abundantly. These algorithms in multimodal optimization problems are more efficient than genetic algorithms. A major drawback in these algorithms is their slow convergence to global optimum and their weak stability can be considered in various running of these algorithms. In this paper, improved Artificial Immune System Algorithm is introduced for the first time to overcome its problems of artificial immune system. That use of the small size of a local search around the memory antibodies is used for improving the algorithm efficiently. The credibility of the proposed approach is evaluated by simulations, and it is shown that the proposed approach achieves better results can be achieved compared to the standard artificial immune system algorithms <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20immune%20system" title="Artificial immune system">Artificial immune system</a>, <a href="https://publications.waset.org/search?q=Cellular%20Automata" title=" Cellular Automata"> Cellular Automata</a>, <a href="https://publications.waset.org/search?q=Cellular%20learning%20automata" title="Cellular learning automata">Cellular learning automata</a>, <a href="https://publications.waset.org/search?q=Cellular%20learning%20automata" title=" Cellular learning automata"> Cellular learning automata</a>, <a href="https://publications.waset.org/search?q=" title=""></a>, <a href="https://publications.waset.org/search?q=Local%20search" title=" Local search"> Local search</a>, <a href="https://publications.waset.org/search?q=Optimization." title="Optimization.">Optimization.</a> </p> <a href="https://publications.waset.org/6604/improved-artificial-immune-system-algorithm-with-local-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6604/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6604/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6604/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6604/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6604/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6604/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6604/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6604/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6604/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6604/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6604.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">1892</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">32</span> A New Method for Multiobjective Optimization Based on Learning Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20R.%20Aghaebrahimi">M. R. Aghaebrahimi</a>, <a href="https://publications.waset.org/search?q=S.%20H.%20Zahiri"> S. H. Zahiri</a>, <a href="https://publications.waset.org/search?q=M.%20Amiri"> M. Amiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The necessity of solving multi dimensional complicated scientific problems beside the necessity of several objective functions optimization are the most motive reason of born of artificial intelligence and heuristic methods. In this paper, we introduce a new method for multiobjective optimization based on learning automata. In the proposed method, search space divides into separate hyper-cubes and each cube is considered as an action. After gathering of all objective functions with separate weights, the cumulative function is considered as the fitness function. By the application of all the cubes to the cumulative function, we calculate the amount of amplification of each action and the algorithm continues its way to find the best solutions. In this Method, a lateral memory is used to gather the significant points of each iteration of the algorithm. Finally, by considering the domination factor, pareto front is estimated. Results of several experiments show the effectiveness of this method in comparison with genetic algorithm based method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Function%20optimization" title="Function optimization">Function optimization</a>, <a href="https://publications.waset.org/search?q=Multiobjective%20optimization" title=" Multiobjective optimization"> Multiobjective optimization</a>, <a href="https://publications.waset.org/search?q=Learning%20automata." title=" Learning automata."> Learning automata.</a> </p> <a href="https://publications.waset.org/2077/a-new-method-for-multiobjective-optimization-based-on-learning-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2077/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2077/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2077/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2077/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2077/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2077/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2077/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2077/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2077/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2077/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2077.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">1678</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">31</span> New Algorithms for Finding Short Reset Sequences in Synchronizing Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Adam%20Roman">Adam Roman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Finding synchronizing sequences for the finite automata is a very important problem in many practical applications (part orienters in industry, reset problem in biocomputing theory, network issues etc). Problem of finding the shortest synchronizing sequence is NP-hard, so polynomial algorithms probably can work only as heuristic ones. In this paper we propose two versions of polynomial algorithms which work better than well-known Eppstein-s Greedy and Cycle algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Synchronizing%20words" title="Synchronizing words">Synchronizing words</a>, <a href="https://publications.waset.org/search?q=reset%20sequences" title=" reset sequences"> reset sequences</a>, <a href="https://publications.waset.org/search?q=%C4%8Cern%C3%BD%20Conjecture" title=" 膶ern媒 Conjecture"> 膶ern媒 Conjecture</a> </p> <a href="https://publications.waset.org/1803/new-algorithms-for-finding-short-reset-sequences-in-synchronizing-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1803/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1803/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1803/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1803/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1803/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1803/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1803/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1803/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1803/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1803/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1803.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">1600</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">30</span> A Neuro-Automata Decision Support System for the Control of Late Blight in Tomato Crops</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Gizelle%20K.%20Vianna">Gizelle K. Vianna</a>, <a href="https://publications.waset.org/search?q=Gustavo%20S.%20Oliveira"> Gustavo S. Oliveira</a>, <a href="https://publications.waset.org/search?q=Gabriel%20V.%20Cunha"> Gabriel V. Cunha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The use of decision support systems in agriculture may help monitoring large fields of crops by automatically detecting the symptoms of foliage diseases. In our work, we designed and implemented a decision support system for small tomatoes producers. This work investigates ways to recognize the late blight disease from the analysis of digital images of tomatoes, using a pair of multilayer perceptron neural networks. The networks outputs are used to generate repainted tomato images in which the injuries on the plant are highlighted, and to calculate the damage level of each plant. Those levels are then used to construct a situation map of a farm where a cellular automata simulates the outbreak evolution over the fields. The simulator can test different pesticides actions, helping in the decision on when to start the spraying and in the analysis of losses and gains of each choice of action.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20neural%20networks" title="Artificial neural networks">Artificial neural networks</a>, <a href="https://publications.waset.org/search?q=cellular%20automata" title=" cellular automata"> cellular automata</a>, <a href="https://publications.waset.org/search?q=decision%20support%20system" title=" decision support system"> decision support system</a>, <a href="https://publications.waset.org/search?q=pattern%20recognition." title=" pattern recognition."> pattern recognition.</a> </p> <a href="https://publications.waset.org/10006812/a-neuro-automata-decision-support-system-for-the-control-of-late-blight-in-tomato-crops" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006812/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006812/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006812/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006812/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006812/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006812/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006812/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006812/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006812/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006812/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006812.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">1056</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">29</span> Hybrid Model Based on Artificial Immune System and Cellular Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ramin%20Javadzadeh">Ramin Javadzadeh</a>, <a href="https://publications.waset.org/search?q=Zahra%20Afsahi"> Zahra Afsahi</a>, <a href="https://publications.waset.org/search?q=MohammadReza%20Meybodi"> MohammadReza Meybodi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The hybridization of artificial immune system with cellular automata (CA-AIS) is a novel method. In this hybrid model, the cellular automaton within each cell deploys the artificial immune system algorithm under optimization context in order to increase its fitness by using its neighbor-s efforts. The hybrid model CA-AIS is introduced to fix the standard artificial immune system-s weaknesses. The credibility of the proposed approach is evaluated by simulations and it shows that the proposed approach achieves better results compared to standard artificial immune system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20Immune%20System" title="Artificial Immune System">Artificial Immune System</a>, <a href="https://publications.waset.org/search?q=Cellular%20Automat" title=" Cellular Automat"> Cellular Automat</a>, <a href="https://publications.waset.org/search?q=neighborhood" title="neighborhood">neighborhood</a> </p> <a href="https://publications.waset.org/14386/hybrid-model-based-on-artificial-immune-system-and-cellular-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14386/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14386/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14386/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14386/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14386/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14386/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14386/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14386/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14386/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14386/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14386.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">1603</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">28</span> Design and Optimization of Parity Generator and Parity Checker Based On Quantum-dot Cellular Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Santanu%20Santra">Santanu Santra</a>, <a href="https://publications.waset.org/search?q=Utpal%20Roy"> Utpal Roy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Quantum-dot Cellular Automata (QCA) is one of the most substitute emerging nanotechnologies for electronic circuits, because of lower power consumption, higher speed and smaller size in comparison with CMOS technology. The basic devices, a Quantum-dot cell can be used to implement logic gates and wires. As it is the fundamental building block on nanotechnology circuits. By applying XOR gate the hardware requirements for a QCA circuit can be decrease and circuits can be simpler in terms of level, delay and cell count. This article present a modest approach for implementing novel optimized XOR gate, which can be applied to design many variants of complex QCA circuits. Proposed XOR gate is simple in structure and powerful in terms of implementing any digital circuits. In order to verify the functionality of the proposed design some complex implementation of parity generator and parity checker circuits are proposed and simulating by QCA Designer tool and compare with some most recent design. Simulation results and physical relations confirm its usefulness in implementing every digital circuit.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clock" title="Clock">Clock</a>, <a href="https://publications.waset.org/search?q=CMOS%20technology" title=" CMOS technology"> CMOS technology</a>, <a href="https://publications.waset.org/search?q=Logic%20gates" title=" Logic gates"> Logic gates</a>, <a href="https://publications.waset.org/search?q=QCA%20Designer" title=" QCA Designer"> QCA Designer</a>, <a href="https://publications.waset.org/search?q=Quantum-dot%20Cellular%20Automata%20%28QCA%29." title=" Quantum-dot Cellular Automata (QCA)."> Quantum-dot Cellular Automata (QCA).</a> </p> <a href="https://publications.waset.org/9997899/design-and-optimization-of-parity-generator-and-parity-checker-based-on-quantum-dot-cellular-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997899/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997899/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997899/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997899/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997899/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997899/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997899/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997899/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997899/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997899/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997899.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">7836</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">27</span> Optimizing Dialogue Strategy Learning Using Learning Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=G.%20Kumaravelan">G. Kumaravelan</a>, <a href="https://publications.waset.org/search?q=R.%20Sivakumar"> R. Sivakumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modeling the behavior of the dialogue management in the design of a spoken dialogue system using statistical methodologies is currently a growing research area. This paper presents a work on developing an adaptive learning approach to optimize dialogue strategy. At the core of our system is a method formalizing dialogue management as a sequential decision making under uncertainty whose underlying probabilistic structure has a Markov Chain. Researchers have mostly focused on model-free algorithms for automating the design of dialogue management using machine learning techniques such as reinforcement learning. But in model-free algorithms there exist a dilemma in engaging the type of exploration versus exploitation. Hence we present a model-based online policy learning algorithm using interconnected learning automata for optimizing dialogue strategy. The proposed algorithm is capable of deriving an optimal policy that prescribes what action should be taken in various states of conversation so as to maximize the expected total reward to attain the goal and incorporates good exploration and exploitation in its updates to improve the naturalness of humancomputer interaction. We test the proposed approach using the most sophisticated evaluation framework PARADISE for accessing to the railway information system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dialogue%20management" title="Dialogue management">Dialogue management</a>, <a href="https://publications.waset.org/search?q=Learning%20automata" title=" Learning automata"> Learning automata</a>, <a href="https://publications.waset.org/search?q=Reinforcement%0Alearning" title=" Reinforcement learning"> Reinforcement learning</a>, <a href="https://publications.waset.org/search?q=Spoken%20dialogue%20system" title=" Spoken dialogue system"> Spoken dialogue system</a> </p> <a href="https://publications.waset.org/12363/optimizing-dialogue-strategy-learning-using-learning-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12363/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12363/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12363/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12363/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12363/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12363/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12363/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12363/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12363/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12363/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12363.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">1611</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">26</span> Evolutionary Training of Hybrid Systems of Recurrent Neural Networks and Hidden Markov Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rohitash%20Chandra">Rohitash Chandra</a>, <a href="https://publications.waset.org/search?q=Christian%20W.%20Omlin"> Christian W. Omlin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a hybrid architecture of recurrent neural networks (RNNs) inspired by hidden Markov models (HMMs). We train the hybrid architecture using genetic algorithms to learn and represent dynamical systems. We train the hybrid architecture on a set of deterministic finite-state automata strings and observe the generalization performance of the hybrid architecture when presented with a new set of strings which were not present in the training data set. In this way, we show that the hybrid system of HMM and RNN can learn and represent deterministic finite-state automata. We ran experiments with different sets of population sizes in the genetic algorithm; we also ran experiments to find out which weight initializations were best for training the hybrid architecture. The results show that the hybrid architecture of recurrent neural networks inspired by hidden Markov models can train and represent dynamical systems. The best training and generalization performance is achieved when the hybrid architecture is initialized with random real weight values of range -15 to 15. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Deterministic%20finite-state%20automata" title="Deterministic finite-state automata">Deterministic finite-state automata</a>, <a href="https://publications.waset.org/search?q=genetic%0Aalgorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=hidden%20Markov%20models" title=" hidden Markov models"> hidden Markov models</a>, <a href="https://publications.waset.org/search?q=hybrid%20systems%20and%20recurrent%0Aneural%20networks." title=" hybrid systems and recurrent neural networks."> hybrid systems and recurrent neural networks.</a> </p> <a href="https://publications.waset.org/12598/evolutionary-training-of-hybrid-systems-of-recurrent-neural-networks-and-hidden-markov-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12598/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12598/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12598/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12598/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12598/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12598/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12598/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12598/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12598/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12598/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12598.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">1890</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">25</span> Measuring of Urban Sustainability in Town Planners Practice</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J.%20Zagorskas">J. Zagorskas</a>, <a href="https://publications.waset.org/search?q=I.%20Veteikyte"> I. Veteikyte</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Physical urban form is recognized to be the media for human transactions. It directly influences the travel demand of people in a specific urban area and the amount of energy used for transportation. Distorted, sprawling form often creates sustainability problems in urban areas. It is declared in EU strategic planning documents that compact urban form and mixed land use pattern must be given the main focus to achieve better sustainability in urban areas, but the methods to measure and compare these characteristics are still not clear. This paper presents the simple methods to measure the spatial characteristics of urban form by analyzing the location and distribution of objects in an urban environment. The extended CA (cellular automata) model is used to simulate urban development scenarios.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cellular%20automata%20%28CA%29" title="Cellular automata (CA)">Cellular automata (CA)</a>, <a href="https://publications.waset.org/search?q=Mixed%20used%20planning" title=" Mixed used planning"> Mixed used planning</a>, <a href="https://publications.waset.org/search?q=Spatial%20analysis" title=" Spatial analysis"> Spatial analysis</a>, <a href="https://publications.waset.org/search?q=Urban%20compactness" title=" Urban compactness"> Urban compactness</a>, <a href="https://publications.waset.org/search?q=Geographic%20information%0D%0Asystems%20%28GIS%29." title=" Geographic information systems (GIS)."> Geographic information systems (GIS).</a> </p> <a href="https://publications.waset.org/16602/measuring-of-urban-sustainability-in-town-planners-practice" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16602/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16602/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16602/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16602/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16602/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16602/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16602/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16602/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16602/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16602/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16602.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">2688</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">24</span> Locating Critical Failure Surface in Rock Slope Stability with Hybrid Model Based on Artificial Immune System and Cellular Learning Automata (CLA-AIS)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ramin%20Javadzadeh">Ramin Javadzadeh</a>, <a href="https://publications.waset.org/search?q=Emad%20Javadzadeh"> Emad Javadzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Locating the critical slip surface with the minimum factor of safety for a rock slope is a difficult problem. In recent years, some modern global optimization methods have been developed with success in treating various types of problems, but very few of such methods have been applied to rock mechanical problems. In this paper, use of hybrid model based on artificial immune system and cellular learning automata is proposed. The results show that the algorithm is an effective and efficient optimization method with a high level of confidence rate.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CLA-AIS" title="CLA-AIS">CLA-AIS</a>, <a href="https://publications.waset.org/search?q=failure%20surface" title=" failure surface"> failure surface</a>, <a href="https://publications.waset.org/search?q=optimization%20methods" title=" optimization methods"> optimization methods</a>, <a href="https://publications.waset.org/search?q=rock%20slope." title=" rock slope."> rock slope.</a> </p> <a href="https://publications.waset.org/12863/locating-critical-failure-surface-in-rock-slope-stability-with-hybrid-model-based-on-artificial-immune-system-and-cellular-learning-automata-cla-ais" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12863/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12863/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12863/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12863/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12863/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12863/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12863/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12863/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12863/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12863/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12863.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">2011</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">23</span> Solution of Two Dimensional Quasi-Harmonic Equations with CA Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20Rezaie%20Moghaddam">F. Rezaie Moghaddam</a>, <a href="https://publications.waset.org/search?q=J.%20Amani"> J. Amani</a>, <a href="https://publications.waset.org/search?q=T.%20Rezaie%20Moghaddam"> T. Rezaie Moghaddam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many computational techniques were applied to solution of heat conduction problem. Those techniques were the finite difference (FD), finite element (FE) and recently meshless methods. FE is commonly used in solution of equation of heat conduction problem based on the summation of stiffness matrix of elements and the solution of the final system of equations. Because of summation process of finite element, convergence rate was decreased. Hence in the present paper Cellular Automata (CA) approach is presented for the solution of heat conduction problem. Each cell considered as a fixed point in a regular grid lead to the solution of a system of equations is substituted by discrete systems of equations with small dimensions. Results show that CA can be used for solution of heat conduction problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Heat%20conduction" title="Heat conduction">Heat conduction</a>, <a href="https://publications.waset.org/search?q=Cellular%20automata" title=" Cellular automata"> Cellular automata</a>, <a href="https://publications.waset.org/search?q=convergencerate" title=" convergencerate"> convergencerate</a>, <a href="https://publications.waset.org/search?q=discrete%20system." title=" discrete system."> discrete system.</a> </p> <a href="https://publications.waset.org/471/solution-of-two-dimensional-quasi-harmonic-equations-with-ca-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/471/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/471/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/471/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/471/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/471/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/471/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/471/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/471/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/471/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/471/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/471.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">1774</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">22</span> Modeling User Behaviour by Planning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Alfredo%20Milani">Alfredo Milani</a>, <a href="https://publications.waset.org/search?q=Silvia%20Suriani"> Silvia Suriani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A model of user behaviour based automated planning is introduced in this work. The behaviour of users of web interactive systems can be described in term of a planning domain encapsulating the timed actions patterns representing the intended user profile. The user behaviour recognition is then posed as a planning problem where the goal is to parse a given sequence of user logs of the observed activities while reaching a final state. A general technique for transforming a timed finite state automata description of the behaviour into a numerical parameter planning model is introduced. Experimental results show that the performance of a planning based behaviour model is effective and scalable for real world applications. A major advantage of the planning based approach is to represent in a single automated reasoning framework problems of plan recognitions, plan synthesis and plan optimisation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=User%20behaviour" title="User behaviour">User behaviour</a>, <a href="https://publications.waset.org/search?q=Timed%20Transition%20Automata" title=" Timed Transition Automata"> Timed Transition Automata</a>, <a href="https://publications.waset.org/search?q=Automated%20Planning." title="Automated Planning.">Automated Planning.</a> </p> <a href="https://publications.waset.org/8765/modeling-user-behaviour-by-planning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8765/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8765/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8765/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8765/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8765/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8765/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8765/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8765/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8765/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8765/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8765.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">1347</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=Bottom-up%20automata&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Bottom-up%20automata&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>