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: complete K-ary tree</title> <meta name="description" content="Search results for: complete K-ary tree"> <meta name="keywords" content="complete K-ary tree"> <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="complete K-ary tree" 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="complete K-ary tree"> <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> 1071</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: complete K-ary tree</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1071</span> Adding Edges between One Node and Every Other Node with the Same Depth in a Complete K-ary Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kiyoshi%20Sawada">Kiyoshi Sawada</a>, <a href="https://publications.waset.org/search?q=Takashi%20Mitsuishi"> Takashi Mitsuishi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a model of adding relations between members of the same level in a pyramid organization structure which is a complete K-ary tree such that the communication of information between every member in the organization becomes the most efficient. When edges between one node and every other node with the same depth N in a complete K-ary tree of height H are added, an optimal depth N* = H is obtained by minimizing the total path length which is the sum of lengths of shortest paths between every pair of all nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=complete%20K-ary%20tree" title="complete K-ary tree">complete K-ary tree</a>, <a href="https://publications.waset.org/search?q=organization%20structure" title=" organization structure"> organization structure</a>, <a href="https://publications.waset.org/search?q=shortest%20path" title=" shortest path"> shortest path</a> </p> <a href="https://publications.waset.org/15622/adding-edges-between-one-node-and-every-other-node-with-the-same-depth-in-a-complete-k-ary-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15622/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15622/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15622/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15622/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15622/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15622/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15622/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15622/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15622/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15622/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15622.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">1356</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">1070</span> The Game of Col on Complete K-ary Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Alessandro%20Cincotti">Alessandro Cincotti</a>, <a href="https://publications.waset.org/search?q=Timothee%20Bossart"> Timothee Bossart</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Col is a classic combinatorial game played on graphs and to solve a general instance is a PSPACE-complete problem. However, winning strategies can be found for some specific graph instances. In this paper, the solution of Col on complete k-ary trees is presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Combinatorial%20game" title="Combinatorial game">Combinatorial game</a>, <a href="https://publications.waset.org/search?q=Complete%20k-ary%20tree" title=" Complete k-ary tree"> Complete k-ary tree</a>, <a href="https://publications.waset.org/search?q=Mapcoloring%0Agame." title=" Mapcoloring game."> Mapcoloring game.</a> </p> <a href="https://publications.waset.org/2783/the-game-of-col-on-complete-k-ary-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2783/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2783/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2783/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2783/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2783/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2783/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2783/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2783/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2783/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2783/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2783.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">1188</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">1069</span> N-Sun Decomposition of Complete Graphs and Complete Bipartite Graphs </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Anitha">R. Anitha</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20Lekshmi"> R. S. Lekshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph decompositions are vital in the study of combinatorial design theory. Given two graphs G and H, an H-decomposition of G is a partition of the edge set of G into disjoint isomorphic copies of H. An n-sun is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper we have proved that the complete graph of order 2n, K2n can be decomposed into n-2 n-suns, a Hamilton cycle and a perfect matching, when n is even and for odd case, the decomposition is n-1 n-suns and a perfect matching. For an odd order complete graph K2n+1, delete the star subgraph K1, 2n and the resultant graph K2n is decomposed as in the case of even order. The method of building n-suns uses Walecki's construction for the Hamilton decomposition of complete graphs. A spanning tree decomposition of even order complete graphs is also discussed using the labeling scheme of n-sun decomposition. A complete bipartite graph Kn, n can be decomposed into n/2 n-suns when n/2 is even. When n/2 is odd, Kn, n can be decomposed into (n-2)/2 n-suns and a Hamilton cycle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hamilton%20cycle" title="Hamilton cycle">Hamilton cycle</a>, <a href="https://publications.waset.org/search?q=n-sun%20decomposition" title=" n-sun decomposition"> n-sun decomposition</a>, <a href="https://publications.waset.org/search?q=perfectmatching" title=" perfectmatching"> perfectmatching</a>, <a href="https://publications.waset.org/search?q=spanning%20tree." title=" spanning tree."> spanning tree.</a> </p> <a href="https://publications.waset.org/2421/n-sun-decomposition-of-complete-graphs-and-complete-bipartite-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2421/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2421/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2421/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2421/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2421/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2421/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2421/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2421/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2421/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2421/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2421.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">2262</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">1068</span> Data Oriented Modeling of Uniform Random Variable: Applied Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ahmad%20Habibizad%20Navin">Ahmad Habibizad Navin</a>, <a href="https://publications.waset.org/search?q=Mehdi%20Naghian%20Fesharaki"> Mehdi Naghian Fesharaki</a>, <a href="https://publications.waset.org/search?q=Mirkamal%20Mirnia"> Mirkamal Mirnia</a>, <a href="https://publications.waset.org/search?q=Mohamad%20Teshnelab"> Mohamad Teshnelab</a>, <a href="https://publications.waset.org/search?q=Ehsan%20Shahamatnia"> Ehsan Shahamatnia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we introduce new data oriented modeling of uniform random variable well-matched with computing systems. Due to this conformity with current computers structure, this modeling will be efficiently used in statistical inference. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Uniform%20random%20variable" title="Uniform random variable">Uniform random variable</a>, <a href="https://publications.waset.org/search?q=Data%20oriented%20modeling" title=" Data oriented modeling"> Data oriented modeling</a>, <a href="https://publications.waset.org/search?q=Statistical%20inference" title="Statistical inference">Statistical inference</a>, <a href="https://publications.waset.org/search?q=Prodigraph" title=" Prodigraph"> Prodigraph</a>, <a href="https://publications.waset.org/search?q=Statistically%20complete%20tree" title=" Statistically complete tree"> Statistically complete tree</a>, <a href="https://publications.waset.org/search?q=Uniformdigital%20probability%20digraph" title=" Uniformdigital probability digraph"> Uniformdigital probability digraph</a>, <a href="https://publications.waset.org/search?q=Uniform%20n-complete%20probability%20tree." title=" Uniform n-complete probability tree."> Uniform n-complete probability tree.</a> </p> <a href="https://publications.waset.org/1287/data-oriented-modeling-of-uniform-random-variable-applied-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1287/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1287/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1287/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1287/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1287/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1287/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1287/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1287/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1287/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1287/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1287.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">1631</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">1067</span> Spanning Tree Transformation of Connected Graphs into Single-Row Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.L.%20Loh">S.L. Loh</a>, <a href="https://publications.waset.org/search?q=S.%20Salleh"> S. Salleh</a>, <a href="https://publications.waset.org/search?q=N.H.%20Sarmin"> N.H. Sarmin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. In this paper, a model for spanning tree transformation of connected graphs into single-row networks, namely Spanning Tree of Connected Graph Modeling (STCGM) will be introduced. Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Graph%20theory" title="Graph theory">Graph theory</a>, <a href="https://publications.waset.org/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/search?q=single-rowrouting%20and%20spanning%20tree." title=" single-rowrouting and spanning tree."> single-rowrouting and spanning tree.</a> </p> <a href="https://publications.waset.org/4353/spanning-tree-transformation-of-connected-graphs-into-single-row-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4353/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4353/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4353/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4353/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4353/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4353/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4353/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4353/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4353/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4353/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4353.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">1736</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">1066</span> N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Anitha">R. Anitha</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20Lekshmi"> R. S. Lekshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph decompositions are vital in the study of combinatorial design theory. A decomposition of a graph G is a partition of its edge set. An n-sun graph is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper, we define n-sun decomposition of some even order graphs with a perfect matching. We have proved that the complete graph K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have n-sun decompositions. A labeling scheme is used to construct the n-suns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decomposition" title="Decomposition">Decomposition</a>, <a href="https://publications.waset.org/search?q=Hamilton%20cycle" title=" Hamilton cycle"> Hamilton cycle</a>, <a href="https://publications.waset.org/search?q=n-sun%20graph" title=" n-sun graph"> n-sun graph</a>, <a href="https://publications.waset.org/search?q=perfect%20matching" title=" perfect matching"> perfect matching</a>, <a href="https://publications.waset.org/search?q=spanning%20tree." title=" spanning tree."> spanning tree.</a> </p> <a href="https://publications.waset.org/3193/n-sun-decomposition-of-complete-complete-bipartite-and-some-harary-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3193/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3193/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3193/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3193/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3193/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3193/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3193/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3193/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3193/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3193/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3193.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">2396</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">1065</span> Construction Of Decentralized Lifetime Maximizing Tree for Data Aggregation in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Deepali%20Virmani">Deepali Virmani </a>, <a href="https://publications.waset.org/search?q=Satbir%20Jain"> Satbir Jain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper , a novel technique to create one such tree is proposed .This tree preserves the energy and maximizes the lifetime of event sources while they are constantly transmitting for data aggregation. The term Decentralized Lifetime Maximizing Tree (DLMT) is used to denote this tree. DLMT features in nodes with higher energy tend to be chosen as data aggregating parents so that the time to detect the first broken tree link can be extended and less energy is involved in tree maintenance. By constructing the tree in such a way, the protocol is able to reduce the frequency of tree reconstruction, minimize the amount of data loss ,minimize the delay during data collection and preserves the energy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=branch%20energy" title="branch energy">branch energy</a>, <a href="https://publications.waset.org/search?q=decentralized" title=" decentralized"> decentralized</a>, <a href="https://publications.waset.org/search?q=energy%20level" title=" energy level "> energy level </a>, <a href="https://publications.waset.org/search?q=lifetime" title=" lifetime"> lifetime</a>, <a href="https://publications.waset.org/search?q=tree%20energy" title="tree energy">tree energy</a>, <a href="https://publications.waset.org/search?q=wireless%20sensor%20networks." title=" wireless sensor networks."> wireless sensor networks.</a> </p> <a href="https://publications.waset.org/9441/construction-of-decentralized-lifetime-maximizing-tree-for-data-aggregation-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9441/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9441/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9441/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9441/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9441/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9441/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9441/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9441/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9441/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9441/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9441.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">1488</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">1064</span> Balancing of Quad Tree using Point Pattern Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Amitava%20Chakraborty">Amitava Chakraborty</a>, <a href="https://publications.waset.org/search?q=Sudip%20Kumar%20De"> Sudip Kumar De</a>, <a href="https://publications.waset.org/search?q=Ranjan%20Dasgupta"> Ranjan Dasgupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Point quad tree is considered as one of the most common data organizations to deal with spatial data & can be used to increase the efficiency for searching the point features. As the efficiency of the searching technique depends on the height of the tree, arbitrary insertion of the point features may make the tree unbalanced and lead to higher time of searching. This paper attempts to design an algorithm to make a nearly balanced quad tree. Point pattern analysis technique has been applied for this purpose which shows a significant enhancement of the performance and the results are also included in the paper for the sake of completeness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Algorithm" title="Algorithm">Algorithm</a>, <a href="https://publications.waset.org/search?q=Height%20balanced%20tree" title=" Height balanced tree"> Height balanced tree</a>, <a href="https://publications.waset.org/search?q=Point%20patternanalysis" title=" Point patternanalysis"> Point patternanalysis</a>, <a href="https://publications.waset.org/search?q=Point%20quad%20tree." title=" Point quad tree."> Point quad tree.</a> </p> <a href="https://publications.waset.org/12292/balancing-of-quad-tree-using-point-pattern-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12292/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12292/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12292/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12292/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12292/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12292/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12292/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12292/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12292/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12292/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12292.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">2699</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">1063</span> An Attribute-Centre Based Decision Tree Classification Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=G%C3%B6khan%20Silahtaro%C4%9Flu">G枚khan Silahtaro臒lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Decision tree algorithms have very important place at classification model of data mining. In literature, algorithms use entropy concept or gini index to form the tree. The shape of the classes and their closeness to each other some of the factors that affect the performance of the algorithm. In this paper we introduce a new decision tree algorithm which employs data (attribute) folding method and variation of the class variables over the branches to be created. A comparative performance analysis has been held between the proposed algorithm and C4.5. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Classification" title="Classification">Classification</a>, <a href="https://publications.waset.org/search?q=decision%20tree" title=" decision tree"> decision tree</a>, <a href="https://publications.waset.org/search?q=split" title=" split"> split</a>, <a href="https://publications.waset.org/search?q=pruning" title=" pruning"> pruning</a>, <a href="https://publications.waset.org/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/search?q=gini." title=" gini."> gini.</a> </p> <a href="https://publications.waset.org/14986/an-attribute-centre-based-decision-tree-classification-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14986/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14986/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14986/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14986/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14986/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14986/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14986/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14986/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14986/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14986/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14986.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">1369</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">1062</span> Improving Fault Resilience and Reconstruction of Overlay Multicast Tree Using Leaving Time of Participants</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bhed%20Bahadur%20Bista">Bhed Bahadur Bista</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Network layer multicast, i.e. IP multicast, even after many years of research, development and standardization, is not deployed in large scale due to both technical (e.g. upgrading of routers) and political (e.g. policy making and negotiation) issues. Researchers looked for alternatives and proposed application/overlay multicast where multicast functions are handled by end hosts, not network layer routers. Member hosts wishing to receive multicast data form a multicast delivery tree. The intermediate hosts in the tree act as routers also, i.e. they forward data to the lower hosts in the tree. Unlike IP multicast, where a router cannot leave the tree until all members below it leave, in overlay multicast any member can leave the tree at any time thus disjoining the tree and disrupting the data dissemination. All the disrupted hosts have to rejoin the tree. This characteristic of the overlay multicast causes multicast tree unstable, data loss and rejoin overhead. In this paper, we propose that each node sets its leaving time from the tree and sends join request to a number of nodes in the tree. The nodes in the tree will reject the request if their leaving time is earlier than the requesting node otherwise they will accept the request. The node can join at one of the accepting nodes. This makes the tree more stable as the nodes will join the tree according to their leaving time, earliest leaving time node being at the leaf of the tree. Some intermediate nodes may not follow their leaving time and leave earlier than their leaving time thus disrupting the tree. For this, we propose a proactive recovery mechanism so that disrupted nodes can rejoin the tree at predetermined nodes immediately. We have shown by simulation that there is less overhead when joining the multicast tree and the recovery time of the disrupted nodes is much less than the previous works. Keywords <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network%20layer%20multicast" title="Network layer multicast">Network layer multicast</a>, <a href="https://publications.waset.org/search?q=Fault%20Resilience" title=" Fault Resilience"> Fault Resilience</a>, <a href="https://publications.waset.org/search?q=IP%20multicast" title=" IP multicast"> IP multicast</a> </p> <a href="https://publications.waset.org/4898/improving-fault-resilience-and-reconstruction-of-overlay-multicast-tree-using-leaving-time-of-participants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4898/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4898/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4898/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4898/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4898/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4898/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4898/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4898/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4898/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4898/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4898.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">1387</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">1061</span> The Mutated Distance between Two Mixture Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wan%20Chian%20Li">Wan Chian Li</a>, <a href="https://publications.waset.org/search?q=Justie%20Su-Tzu%20Juan"> Justie Su-Tzu Juan</a>, <a href="https://publications.waset.org/search?q=Yi-Chun%20Wang"> Yi-Chun Wang</a>, <a href="https://publications.waset.org/search?q=Shu-Chuan%20Chen"> Shu-Chuan Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The evolutionary tree is an important topic in bioinformation. In 2006, Chen and Lindsay proposed a new method to build the mixture tree from DNA sequences. Mixture tree is a new type evolutionary tree, and it has two additional information besides the information of ordinary evolutionary tree. One of the information is time parameter, and the other is the set of mutated sites. In 2008, Lin and Juan proposed an algorithm to compute the distance between two mixture trees. Their algorithm computes the distance with only considering the time parameter between two mixture trees. In this paper, we proposes a method to measure the similarity of two mixture trees with considering the set of mutated sites and develops two algorithm to compute the distance between two mixture trees. The time complexity of these two proposed algorithms are O(n2 × max{h(T1), h(T2)}) and O(n2), respectively</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=evolutionary%20tree" title="evolutionary tree">evolutionary tree</a>, <a href="https://publications.waset.org/search?q=mixture%20tree" title=" mixture tree"> mixture tree</a>, <a href="https://publications.waset.org/search?q=mutated%20site" title=" mutated site"> mutated site</a>, <a href="https://publications.waset.org/search?q=distance." title=" distance."> distance.</a> </p> <a href="https://publications.waset.org/14336/the-mutated-distance-between-two-mixture-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14336/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14336/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14336/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14336/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14336/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14336/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14336/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14336/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14336/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14336/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14336.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1416</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1060</span> Improved C-Fuzzy Decision Tree for Intrusion Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Krishnamoorthi%20Makkithaya">Krishnamoorthi Makkithaya</a>, <a href="https://publications.waset.org/search?q=N.%20V.%20Subba%20Reddy"> N. V. Subba Reddy</a>, <a href="https://publications.waset.org/search?q=U.%20Dinesh%20Acharya"> U. Dinesh Acharya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the number of networked computers grows, intrusion detection is an essential component in keeping networks secure. Various approaches for intrusion detection are currently being in use with each one has its own merits and demerits. This paper presents our work to test and improve the performance of a new class of decision tree c-fuzzy decision tree to detect intrusion. The work also includes identifying best candidate feature sub set to build the efficient c-fuzzy decision tree based Intrusion Detection System (IDS). We investigated the usefulness of c-fuzzy decision tree for developing IDS with a data partition based on horizontal fragmentation. Empirical results indicate the usefulness of our approach in developing the efficient IDS. <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=Decision%20tree" title=" Decision tree"> Decision tree</a>, <a href="https://publications.waset.org/search?q=Feature%20selection" title=" Feature selection"> Feature selection</a>, <a href="https://publications.waset.org/search?q=Fuzzyc-%20means%20clustering" title=" Fuzzyc- means clustering"> Fuzzyc- means clustering</a>, <a href="https://publications.waset.org/search?q=Intrusion%20detection." title=" Intrusion detection."> Intrusion detection.</a> </p> <a href="https://publications.waset.org/15151/improved-c-fuzzy-decision-tree-for-intrusion-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15151/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15151/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15151/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15151/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15151/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15151/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15151/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15151/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15151/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15151/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15151.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">1576</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">1059</span> Visualising Energy Efficiency Landscape</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hairulliza%20M.%20Judi">Hairulliza M. Judi</a>, <a href="https://publications.waset.org/search?q=Soon%20Y.%20Chee"> Soon Y. Chee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses the landscape design that could increase energy efficiency in a house. By planting trees in a house compound, the tree shades prevent direct sunlight from heating up the building, and it enables cooling off the surrounding air. The requirement for air-conditioning could be minimized and the air quality could be improved. During the life time of a tree, the saving cost from the mentioned benefits could be up to US $ 200 for each tree. The project intends to visually describe the landscape design in a house compound that could enhance energy efficiency and consequently lead to energy saving. The house compound model was developed in three dimensions by using AutoCAD 2005, the animation was programmed by using LightWave 3D softwares i.e. Modeler and Layout to display the tree shadings in the wall. The visualization was executed on a VRML Pad platform and implemented on a web environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Tree%20planting" title="Tree planting">Tree planting</a>, <a href="https://publications.waset.org/search?q=tree%20shading" title=" tree shading"> tree shading</a>, <a href="https://publications.waset.org/search?q=energy%20efficiency" title=" energy efficiency"> energy efficiency</a>, <a href="https://publications.waset.org/search?q=visualization." title=" visualization."> visualization.</a> </p> <a href="https://publications.waset.org/599/visualising-energy-efficiency-landscape" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/599/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/599/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/599/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/599/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/599/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/599/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/599/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/599/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/599/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/599/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/599.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">1700</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">1058</span> The Leaves of a Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhu%20Jiaming">Zhu Jiaming</a>, <a href="https://publications.waset.org/search?q=Yu%20Mengna"> Yu Mengna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, models based on quantitative analysis, physical geometry and regression analysis are established, by using analytic hierarchy process analysis, fuzzy cluster analysis, fuzzy photographic and data fitting. The reasons of various leaf shapes among different species and the differences between the leaf shapes on same tree have been solved by using software, such as Eviews, VB and Matlab. We also successfully estimate the leaf mass of a tree and the correlation with the tree profile. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Leaf%20shape%3B%20Mass%3B%20Fuzzy%20cluster%3B%20Regression%20analysis%3B%0AEviews%3B%20Matlab" title="Leaf shape; Mass; Fuzzy cluster; Regression analysis; Eviews; Matlab">Leaf shape; Mass; Fuzzy cluster; Regression analysis; Eviews; Matlab</a> </p> <a href="https://publications.waset.org/10780/the-leaves-of-a-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10780/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10780/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10780/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10780/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10780/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10780/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10780/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10780/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10780/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10780/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10780.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">1597</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">1057</span> Balancing Neural Trees to Improve Classification Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Asha%20Rani">Asha Rani</a>, <a href="https://publications.waset.org/search?q=Christian%20Micheloni">Christian Micheloni</a>, <a href="https://publications.waset.org/search?q=Gian%20Luca%20Foresti"> Gian Luca Foresti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a neural tree (NT) classifier having a simple perceptron at each node is considered. A new concept for making a balanced tree is applied in the learning algorithm of the tree. At each node, if the perceptron classification is not accurate and unbalanced, then it is replaced by a new perceptron. This separates the training set in such a way that almost the equal number of patterns fall into each of the classes. Moreover, each perceptron is trained only for the classes which are present at respective node and ignore other classes. Splitting nodes are employed into the neural tree architecture to divide the training set when the current perceptron node repeats the same classification of the parent node. A new error function based on the depth of the tree is introduced to reduce the computational time for the training of a perceptron. Experiments are performed to check the efficiency and encouraging results are obtained in terms of accuracy and computational costs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Neural%20Tree" title="Neural Tree">Neural Tree</a>, <a href="https://publications.waset.org/search?q=Pattern%20Classification" title=" Pattern Classification"> Pattern Classification</a>, <a href="https://publications.waset.org/search?q=Perceptron" title=" Perceptron"> Perceptron</a>, <a href="https://publications.waset.org/search?q=Splitting%0ANodes." title=" Splitting Nodes."> Splitting Nodes.</a> </p> <a href="https://publications.waset.org/8593/balancing-neural-trees-to-improve-classification-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8593/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8593/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8593/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8593/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8593/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8593/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8593/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8593/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8593/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8593/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8593.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">1225</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">1056</span> NOHIS-Tree: High-Dimensional Index Structure for Similarity Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mounira%20Taileb">Mounira Taileb</a>, <a href="https://publications.waset.org/search?q=Sami%20Touati"> Sami Touati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Content-Based Image Retrieval systems it is important to use an efficient indexing technique in order to perform and accelerate the search in huge databases. The used indexing technique should also support the high dimensions of image features. In this paper we present the hierarchical index NOHIS-tree (Non Overlapping Hierarchical Index Structure) when we scale up to very large databases. We also present a study of the influence of clustering on search time. The performance test results show that NOHIS-tree performs better than SR-tree. Tests also show that NOHIS-tree keeps its performances in high dimensional spaces. We include the performance test that try to determine the number of clusters in NOHIS-tree to have the best search time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=High-dimensional%20indexing" title="High-dimensional indexing">High-dimensional indexing</a>, <a href="https://publications.waset.org/search?q=k-nearest%20neighborssearch." title=" k-nearest neighborssearch."> k-nearest neighborssearch.</a> </p> <a href="https://publications.waset.org/15779/nohis-tree-high-dimensional-index-structure-for-similarity-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15779/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15779/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15779/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15779/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15779/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15779/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15779/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15779/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15779/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15779/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15779.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">1444</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">1055</span> Applying Spanning Tree Graph Theory for Automatic Database Normalization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chetneti%20Srisa-an">Chetneti Srisa-an</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In Knowledge and Data Engineering field, relational database is the best repository to store data in a real world. It has been using around the world more than eight decades. Normalization is the most important process for the analysis and design of relational databases. It aims at creating a set of relational tables with minimum data redundancy that preserve consistency and facilitate correct insertion, deletion, and modification. Normalization is a major task in the design of relational databases. Despite its importance, very few algorithms have been developed to be used in the design of commercial automatic normalization tools. It is also rare technique to do it automatically rather manually. Moreover, for a large and complex database as of now, it make even harder to do it manually. This paper presents a new complete automated relational database normalization method. It produces the directed graph and spanning tree, first. It then proceeds with generating the 2NF, 3NF and also BCNF normal forms. The benefit of this new algorithm is that it can cope with a large set of complex function dependencies.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Relational%20Database" title="Relational Database">Relational Database</a>, <a href="https://publications.waset.org/search?q=Functional%20Dependency" title=" Functional Dependency"> Functional Dependency</a>, <a href="https://publications.waset.org/search?q=Automatic%20Normalization" title=" Automatic Normalization"> Automatic Normalization</a>, <a href="https://publications.waset.org/search?q=Primary%20Key" title=" Primary Key"> Primary Key</a>, <a href="https://publications.waset.org/search?q=Spanning%20tree." title=" Spanning tree."> Spanning tree.</a> </p> <a href="https://publications.waset.org/9998331/applying-spanning-tree-graph-theory-for-automatic-database-normalization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998331/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998331/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998331/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998331/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998331/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998331/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998331/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998331/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998331/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998331/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998331.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">2866</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">1054</span> Historical Landscape Affects Present Tree Density in Paddy Field</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ha%20T.%20Pham">Ha T. Pham</a>, <a href="https://publications.waset.org/search?q=Shuichi%20Miyagawa"> Shuichi Miyagawa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Ongoing landscape transformation is one of the major causes behind disappearance of traditional landscapes, and lead to species and resource loss. Tree in paddy fields in the northeast of Thailand is one of those traditional landscapes. Using three different historical time layers, we acknowledged the severe deforestation and rapid urbanization happened in the region. Despite the general thinking of decline in tree density as consequences, the heterogeneous trend of changes in total tree density in three studied landscapes denied the hypothesis that number of trees in paddy field depend on the length of land use practice. On the other hand, due to selection of planting new trees on levees, existence of trees in paddy field now relies on their values for human use. Besides, changes in land use and landscape structure had a significant impact on decision of which tree density level is considered as suitable for the landscape.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aerial%20photographs" title="Aerial photographs">Aerial photographs</a>, <a href="https://publications.waset.org/search?q=land%20use%20change" title=" land use change"> land use change</a>, <a href="https://publications.waset.org/search?q=traditional%0D%0Alandscape" title=" traditional landscape"> traditional landscape</a>, <a href="https://publications.waset.org/search?q=tree%20in%20paddy%20fields." title=" tree in paddy fields."> tree in paddy fields.</a> </p> <a href="https://publications.waset.org/9999718/historical-landscape-affects-present-tree-density-in-paddy-field" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999718/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999718/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999718/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999718/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999718/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999718/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999718/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999718/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999718/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999718/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999718.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">1864</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">1053</span> Decision Tree-based Feature Ranking using Manhattan Hierarchical Cluster Criterion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yasmin%20Mohd%20Yacob">Yasmin Mohd Yacob</a>, <a href="https://publications.waset.org/search?q=Harsa%20A.%20Mat%20Sakim"> Harsa A. Mat Sakim</a>, <a href="https://publications.waset.org/search?q=Nor%20Ashidi%20Mat%20Isa"> Nor Ashidi Mat Isa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Feature selection study is gaining importance due to its contribution to save classification cost in terms of time and computation load. In search of essential features, one of the methods to search the features is via the decision tree. Decision tree act as an intermediate feature space inducer in order to choose essential features. In decision tree-based feature selection, some studies used decision tree as a feature ranker with a direct threshold measure, while others remain the decision tree but utilized pruning condition that act as a threshold mechanism to choose features. This paper proposed threshold measure using Manhattan Hierarchical Cluster distance to be utilized in feature ranking in order to choose relevant features as part of the feature selection process. The result is promising, and this method can be improved in the future by including test cases of a higher number of attributes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Feature%20ranking" title="Feature ranking">Feature ranking</a>, <a href="https://publications.waset.org/search?q=decision%20tree" title=" decision tree"> decision tree</a>, <a href="https://publications.waset.org/search?q=hierarchical%20cluster" title=" hierarchical cluster"> hierarchical cluster</a>, <a href="https://publications.waset.org/search?q=Manhattan%20distance." title=" Manhattan distance."> Manhattan distance.</a> </p> <a href="https://publications.waset.org/1993/decision-tree-based-feature-ranking-using-manhattan-hierarchical-cluster-criterion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1993/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1993/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1993/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1993/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1993/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1993/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1993/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1993/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1993/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1993/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1993.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">1968</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">1052</span> A Thai to English Machine Translation System Using Thai LFG Tree Structure as Interlingua</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tawee%20Chimsuk">Tawee Chimsuk</a>, <a href="https://publications.waset.org/search?q=Surapong%20Auwatanamongkol"> Surapong Auwatanamongkol</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Machine Translation (MT) between the Thai and English languages has been a challenging research topic in natural language processing. Most research has been done on English to Thai machine translation, but not the other way around. This paper presents a Thai to English Machine Translation System that translates a Thai sentence into interlingua of a Thai LFG tree using LFG grammar and a bottom up parser. The Thai LFG tree is then transformed into the corresponding English LFG tree by pattern matching and node transformation. Finally, an equivalent English sentence is created using structural information prescribed by the English LFG tree. Based on results of experiments designed to evaluate the performance of the proposed system, it can be stated that the system has been proven to be effective in providing a useful translation from Thai to English.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Interlingua" title="Interlingua">Interlingua</a>, <a href="https://publications.waset.org/search?q=LFG%20grammar" title=" LFG grammar"> LFG grammar</a>, <a href="https://publications.waset.org/search?q=Machine%20translation" title=" Machine translation"> Machine translation</a>, <a href="https://publications.waset.org/search?q=Pattern%20matching." title="Pattern matching.">Pattern matching.</a> </p> <a href="https://publications.waset.org/15130/a-thai-to-english-machine-translation-system-using-thai-lfg-tree-structure-as-interlingua" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15130/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15130/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15130/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15130/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15130/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15130/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15130/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15130/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15130/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15130/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15130.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">2295</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">1051</span> Comparison of Experimental Relationships to Determine Flow Discharge in Meandering Compound Channels Using M5 Decision Tree Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mehdi%20Kheradmand">Mehdi Kheradmand</a>, <a href="https://publications.waset.org/search?q=Mehdi%20Azhdary%20Moghaddam"> Mehdi Azhdary Moghaddam</a>, <a href="https://publications.waset.org/search?q=Abdolreza%20Zahiri"> Abdolreza Zahiri</a>, <a href="https://publications.waset.org/search?q=Khalil%20Ghorbani"> Khalil Ghorbani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This research compares results of major methods of determining the flow discharge using experimental relationships with results from the M5 decision tree model in meandering compound sections in several laboratory channels. It was found that the M5 decision tree model enjoyed greater accuracy of statistical parameters compared to methods to the said methods. This suggested that the M5 decision tree model has highly improved the calculated accuracy of the flow discharge in meandering compound channels. </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Stage-discharge%20relationship" title="Stage-discharge relationship">Stage-discharge relationship</a>, <a href="https://publications.waset.org/search?q=M5%20decision%20tree%20model" title=" M5 decision tree model"> M5 decision tree model</a>, <a href="https://publications.waset.org/search?q=compound%20section" title=" compound section"> compound section</a>, <a href="https://publications.waset.org/search?q=meandering%20compound%20channel." title=" meandering compound channel."> meandering compound channel.</a> </p> <a href="https://publications.waset.org/10013189/comparison-of-experimental-relationships-to-determine-flow-discharge-in-meandering-compound-channels-using-m5-decision-tree-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013189/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013189/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013189/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013189/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013189/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013189/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013189/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013189/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013189/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013189/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013189.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">229</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">1050</span> Processing and Economic Analysis of Rain Tree (Samanea saman) Pods for Village Level Hydrous Bioethanol Production</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dharell%20B.%20Siano">Dharell B. Siano</a>, <a href="https://publications.waset.org/search?q=Wendy%20C.%20Mateo"> Wendy C. Mateo</a>, <a href="https://publications.waset.org/search?q=Victorino%20T.%20Taylan"> Victorino T. Taylan</a>, <a href="https://publications.waset.org/search?q=Francisco%20D.%20Cuaresma"> Francisco D. Cuaresma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Biofuel is one of the renewable energy sources adapted by the Philippine government in order to lessen the dependency on foreign fuel and to reduce carbon dioxide emissions. Rain tree pods were seen to be a promising source of bioethanol since it contains significant amount of fermentable sugars. The study was conducted to establish the complete procedure in processing rain tree pods for village level hydrous bioethanol production. Production processes were done for village level hydrous bioethanol production from collection, drying, storage, shredding, dilution, extraction, fermentation, and distillation. The feedstock was sundried, and moisture content was determined at a range of 20% to 26% prior to storage. Dilution ratio was 1:1.25 (1 kg of pods = 1.25 L of water) and after extraction process yielded a sugar concentration of 22 <sup>0</sup>Bx to 24 <sup>0</sup>Bx. The dilution period was three hours. After three hours of diluting the samples, the juice was extracted using extractor with a capacity of 64.10 L/hour. 150 L of rain tree pods juice was extracted and subjected to fermentation process using a village level anaerobic bioreactor. Fermentation with yeast (<em>Saccharomyces cerevisiae</em>) can fasten up the process, thus producing more ethanol at a shorter period of time; however, without yeast fermentation, it also produces ethanol at lower volume with slower fermentation process. Distillation of 150 L of fermented broth was done for six hours at 85 °C to 95 °C temperature (feedstock) and 74 °C to 95 °C temperature of the column head (vapor state of ethanol). The highest volume of ethanol recovered was established at with yeast fermentation at five-day duration with a value of 14.89 L and lowest actual ethanol content was found at without yeast fermentation at three-day duration having a value of 11.63 L. In general, the results suggested that rain tree pods had a very good potential as feedstock for bioethanol production. Fermentation of rain tree pods juice can be done with yeast and without yeast.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fermentation" title="Fermentation">Fermentation</a>, <a href="https://publications.waset.org/search?q=hydrous%20bioethanol" title=" hydrous bioethanol"> hydrous bioethanol</a>, <a href="https://publications.waset.org/search?q=rain%20tree%20pods" title=" rain tree pods"> rain tree pods</a>, <a href="https://publications.waset.org/search?q=village%20level." title=" village level."> village level.</a> </p> <a href="https://publications.waset.org/10006391/processing-and-economic-analysis-of-rain-tree-samanea-saman-pods-for-village-level-hydrous-bioethanol-production" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006391/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006391/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006391/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006391/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006391/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006391/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006391/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006391/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006391/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006391/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006391.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">1562</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">1049</span> Semantic Spatial Objects Data Structure for Spatial Access Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kalum%20Priyanath%20Udagepola">Kalum Priyanath Udagepola</a>, <a href="https://publications.waset.org/search?q=Zuo%20Decheng"> Zuo Decheng</a>, <a href="https://publications.waset.org/search?q=Wu%20Zhibo"> Wu Zhibo</a>, <a href="https://publications.waset.org/search?q=Yang%20Xiaozong"> Yang Xiaozong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Modern spatial database management systems require a unique Spatial Access Method (SAM) in order solve complex spatial quires efficiently. In this case the spatial data structure takes a prominent place in the SAM. Inadequate data structure leads forming poor algorithmic choices and forging deficient understandings of algorithm behavior on the spatial database. A key step in developing a better semantic spatial object data structure is to quantify the performance effects of semantic and outlier detections that are not reflected in the previous tree structures (R-Tree and its variants). This paper explores a novel SSRO-Tree on SAM to the Topo-Semantic approach. The paper shows how to identify and handle the semantic spatial objects with outlier objects during page overflow/underflow, using gain/loss metrics. We introduce a new SSRO-Tree algorithm which facilitates the achievement of better performance in practice over algorithms that are superior in the R*-Tree and RO-Tree by considering selection queries.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Outlier" title="Outlier">Outlier</a>, <a href="https://publications.waset.org/search?q=semantic%20spatial%20object" title=" semantic spatial object"> semantic spatial object</a>, <a href="https://publications.waset.org/search?q=spatial%20objects" title=" spatial objects"> spatial objects</a>, <a href="https://publications.waset.org/search?q=SSRO-Tree" title="SSRO-Tree">SSRO-Tree</a>, <a href="https://publications.waset.org/search?q=topo-semantic." title=" topo-semantic."> topo-semantic.</a> </p> <a href="https://publications.waset.org/10998/semantic-spatial-objects-data-structure-for-spatial-access-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10998/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10998/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10998/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10998/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10998/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10998/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10998/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10998/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10998/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10998/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10998.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">1695</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">1048</span> Accelerating GLA with an M-Tree </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Olli%20Luoma">Olli Luoma</a>, <a href="https://publications.waset.org/search?q=Johannes%20Tuikkala"> Johannes Tuikkala</a>, <a href="https://publications.waset.org/search?q=Olli%20Nevalainen"> Olli Nevalainen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a novel improvement for the generalized Lloyd Algorithm (GLA). Our algorithm makes use of an M-tree index built on the codebook which makes it possible to reduce the number of distance computations when the nearest code words are searched. Our method does not impose the use of any specific distance function, but works with any metric distance, making it more general than many other fast GLA variants. Finally, we present the positive results of our performance experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering" title="Clustering">Clustering</a>, <a href="https://publications.waset.org/search?q=GLA" title=" GLA"> GLA</a>, <a href="https://publications.waset.org/search?q=M-Tree" title=" M-Tree"> M-Tree</a>, <a href="https://publications.waset.org/search?q=Vector%0AQuantization%20." title=" Vector Quantization ."> Vector Quantization .</a> </p> <a href="https://publications.waset.org/80/accelerating-gla-with-an-m-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/80/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/80/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/80/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/80/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/80/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/80/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/80/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/80/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/80/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/80/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/80.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">1524</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">1047</span> Decision Tree Based Scheduling for Flexible Job Shops with Multiple Process Plans </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.-H.%20Doh">H.-H. Doh</a>, <a href="https://publications.waset.org/search?q=J.-M.%20Yu"> J.-M. Yu</a>, <a href="https://publications.waset.org/search?q=Y.-J.%20Kwon"> Y.-J. Kwon</a>, <a href="https://publications.waset.org/search?q=J.-H.%20Shin"> J.-H. Shin</a>, <a href="https://publications.waset.org/search?q=H.-W.%20Kim"> H.-W. Kim</a>, <a href="https://publications.waset.org/search?q=S.-H.%20Nam"> S.-H. Nam</a>, <a href="https://publications.waset.org/search?q=D.-H.%20Lee"> D.-H. Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans, i.e. each job can be processed through alternative operations, each of which can be processed on alternative machines. The main decision variables are: (a) selecting operation/machine pair; and (b) sequencing the jobs assigned to each machine. As an extension of the priority scheduling approach that selects the best priority rule combination after many simulation runs, this study suggests a decision tree based approach in which a decision tree is used to select a priority rule combination adequate for a specific system state and hence the burdens required for developing simulation models and carrying out simulation runs can be eliminated. The decision tree based scheduling approach consists of construction and scheduling modules. In the construction module, a decision tree is constructed using a four-stage algorithm, and in the scheduling module, a priority rule combination is selected using the decision tree. To show the performance of the decision tree based approach suggested in this study, a case study was done on a flexible job shop with reconfigurable manufacturing cells and a conventional job shop, and the results are reported by comparing it with individual priority rule combinations for the objectives of minimizing total flow time and total tardiness.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Flexible%20job%20shop%20scheduling" title="Flexible job shop scheduling">Flexible job shop scheduling</a>, <a href="https://publications.waset.org/search?q=Decision%20tree" title=" Decision tree"> Decision tree</a>, <a href="https://publications.waset.org/search?q=Priority%20rules" title=" Priority rules"> Priority rules</a>, <a href="https://publications.waset.org/search?q=Case%20study." title=" Case study. "> Case study. </a> </p> <a href="https://publications.waset.org/9997827/decision-tree-based-scheduling-for-flexible-job-shops-with-multiple-process-plans" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997827/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997827/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997827/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997827/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997827/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997827/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997827/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997827/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997827/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997827/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997827.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">3318</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">1046</span> Using Data Mining Technique for Scholarship Disbursement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J.%20K.%20Alhassan">J. K. Alhassan</a>, <a href="https://publications.waset.org/search?q=S.%20A.%20Lawal"> S. A. Lawal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work is on decision tree-based classification for the disbursement of scholarship. Tree-based data mining classification technique is used in other to determine the generic rule to be used to disburse the scholarship. The system based on the defined rules from the tree is able to determine the class (status) to which an applicant shall belong whether Granted or Not Granted. The applicants that fall to the class of granted denote a successful acquirement of scholarship while those in not granted class are unsuccessful in the scheme. An algorithm that can be used to classify the applicants based on the rules from tree-based classification was also developed. The tree-based classification is adopted because of its efficiency, effectiveness, and easy to comprehend features. The system was tested with the data of National Information Technology Development Agency (NITDA) Abuja, a Parastatal of Federal Ministry of Communication Technology that is mandated to develop and regulate information technology in Nigeria. The system was found working according to the specification. It is therefore recommended for all scholarship disbursement organizations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decision%20tree" title="Decision tree">Decision tree</a>, <a href="https://publications.waset.org/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/search?q=scholarship." title=" scholarship."> scholarship.</a> </p> <a href="https://publications.waset.org/10002271/using-data-mining-technique-for-scholarship-disbursement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002271/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002271/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002271/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002271/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002271/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002271/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002271/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002271/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002271/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002271/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002271.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">2156</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">1045</span> An Efficient Algorithm for Delay Delay-variation Bounded Least Cost Multicast Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Manas%20Ranjan%20Kabat">Manas Ranjan Kabat</a>, <a href="https://publications.waset.org/search?q=Manoj%20Kumar%20Patel"> Manoj Kumar Patel</a>, <a href="https://publications.waset.org/search?q=Chita%20Ranjan%20Tripathy"> Chita Ranjan Tripathy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many multimedia communication applications require a source to transmit messages to multiple destinations subject to quality of service (QoS) delay constraint. To support delay constrained multicast communications, computer networks need to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. This is known as multicast delay problem. On the other hand, if the same message fails to arrive at each destination node at the same time, there may arise inconsistency and unfairness problem among users. This is related to multicast delayvariation problem. The problem to find a minimum cost multicast tree with delay and delay-variation constraints has been proven to be NP-Complete. In this paper, we propose an efficient heuristic algorithm, namely, Economic Delay and Delay-Variation Bounded Multicast (EDVBM) algorithm, based on a novel heuristic function, to construct an economic delay and delay-variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=EDVBM" title="EDVBM">EDVBM</a>, <a href="https://publications.waset.org/search?q=Heuristic%20algorithm" title=" Heuristic algorithm"> Heuristic algorithm</a>, <a href="https://publications.waset.org/search?q=Multicast%20tree" title=" Multicast tree"> Multicast tree</a>, <a href="https://publications.waset.org/search?q=QoS%0Arouting" title=" QoS routing"> QoS routing</a>, <a href="https://publications.waset.org/search?q=Shortest%20path." title=" Shortest path."> Shortest path.</a> </p> <a href="https://publications.waset.org/13210/an-efficient-algorithm-for-delay-delay-variation-bounded-least-cost-multicast-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13210/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13210/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13210/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13210/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13210/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13210/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13210/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13210/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13210/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13210/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13210.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">1643</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">1044</span> Pruning Method of Belief Decision Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Salsabil%20Trabelsi">Salsabil Trabelsi</a>, <a href="https://publications.waset.org/search?q=Zied%20Elouedi"> Zied Elouedi</a>, <a href="https://publications.waset.org/search?q=Khaled%20Mellouli"> Khaled Mellouli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interpretation of the belief function theory. The uncertainty can appear either in the actual class of training objects or attribute values of objects to classify. In this paper, we develop a post-pruning method of belief decision trees in order to reduce size and improve classification accuracy on unseen cases. The pruning of decision tree has a considerable intention in the areas of machine learning. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/search?q=uncertainty" title=" uncertainty"> uncertainty</a>, <a href="https://publications.waset.org/search?q=belief%20function%20theory" title=" belief function theory"> belief function theory</a>, <a href="https://publications.waset.org/search?q=belief%20decision%20tree" title=" belief decision tree"> belief decision tree</a>, <a href="https://publications.waset.org/search?q=pruning." title=" pruning."> pruning.</a> </p> <a href="https://publications.waset.org/3379/pruning-method-of-belief-decision-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3379/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3379/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3379/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3379/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3379/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3379/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3379/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3379/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3379/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3379/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3379.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1910</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1043</span> An Improved Construction Method for MIHCs on Cycle Composition Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hsun%20Su">Hsun Su</a>, <a href="https://publications.waset.org/search?q=Yuan-Kang%20Shih"> Yuan-Kang Shih</a>, <a href="https://publications.waset.org/search?q=Shin-Shin%20Kao"> Shin-Shin Kao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC-s, on interconnection networks are published. In this paper, using an improved construction method, we obtain MIHC-s on cycle composition networks with a much weaker condition than the known result. In fact, we established the existence of MIHC-s in the cycle composition networks and the result is optimal in the sense that the number of MIHC-s we constructed is maximal.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hamiltonian%20cycle" title="Hamiltonian cycle">Hamiltonian cycle</a>, <a href="https://publications.waset.org/search?q=k-ary%20n-cube" title=" k-ary n-cube"> k-ary n-cube</a>, <a href="https://publications.waset.org/search?q=cycle%20composition%20networks" title=" cycle composition networks"> cycle composition networks</a>, <a href="https://publications.waset.org/search?q=mutually%20independent." title=" mutually independent."> mutually independent.</a> </p> <a href="https://publications.waset.org/791/an-improved-construction-method-for-mihcs-on-cycle-composition-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/791/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/791/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/791/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/791/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/791/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/791/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/791/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/791/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/791/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/791/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/791.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">1389</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">1042</span> Defect Cause Modeling with Decision Tree and Regression Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Bak%C4%B1r">B. Bak谋r</a>, <a href="https://publications.waset.org/search?q=%C4%B0.%20Batmaz"> 陌. Batmaz</a>, <a href="https://publications.waset.org/search?q=F.%20A.%20G%C3%BCnt%C3%BCrk%C3%BCn"> F. A. G眉nt眉rk眉n</a>, <a href="https://publications.waset.org/search?q=%C4%B0.%20A.%20%C4%B0pek%C3%A7i"> 陌. A. 陌pek莽i</a>, <a href="https://publications.waset.org/search?q=G.%20K%C3%B6ksal"> G. K枚ksal</a>, <a href="https://publications.waset.org/search?q=N.%20E.%20%C3%96zdemirel"> N. E. 脰zdemirel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main aim of this study is to identify the most influential variables that cause defects on the items produced by a casting company located in Turkey. To this end, one of the items produced by the company with high defective percentage rates is selected. Two approaches-the regression analysis and decision treesare used to model the relationship between process parameters and defect types. Although logistic regression models failed, decision tree model gives meaningful results. Based on these results, it can be claimed that the decision tree approach is a promising technique for determining the most important process variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Casting%20industry" title="Casting industry">Casting industry</a>, <a href="https://publications.waset.org/search?q=decision%20tree%20algorithm%20C5.0" title=" decision tree algorithm C5.0"> decision tree algorithm C5.0</a>, <a href="https://publications.waset.org/search?q=logistic%20regression" title="logistic regression">logistic regression</a>, <a href="https://publications.waset.org/search?q=quality%20improvement." title=" quality improvement."> quality improvement.</a> </p> <a href="https://publications.waset.org/9221/defect-cause-modeling-with-decision-tree-and-regression-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9221/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9221/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9221/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9221/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9221/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9221/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9221/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9221/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9221/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9221/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9221.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">2518</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=complete%20K-ary%20tree&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=35">35</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&page=36">36</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=complete%20K-ary%20tree&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>