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: multicast tree</title> <meta name="description" content="Search results for: multicast tree"> <meta name="keywords" content="multicast 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="multicast 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/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="multicast 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> 912</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: multicast tree</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">912</span> Fast Switching Mechanism for Multicasting Failure in OpenFlow Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Allakany">Alaa Allakany</a>, <a href="https://publications.waset.org/abstracts/search?q=Koji%20Okamura"> Koji Okamura</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multicast technology is an efficient and scalable technology for data distribution in order to optimize network resources. However, in the IP network, the responsibility for management of multicast groups is distributed among network routers, which causes some limitations such as delays in processing group events, high bandwidth consumption and redundant tree calculation. Software Defined Networking (SDN) represented by OpenFlow presented as a solution for many problems, in SDN the control plane and data plane are separated by shifting the control and management to a remote centralized controller, and the routers are used as a forwarder only. In this paper we will proposed fast switching mechanism for solving the problem of link failure in multicast tree based on Tabu Search heuristic algorithm and modifying the functions of OpenFlow switch to fasts switch to the pack up sub tree rather than sending to the controller. In this work we will implement multicasting OpenFlow controller, this centralized controller is a core part in our multicasting approach, which is responsible for 1- constructing the multicast tree, 2- handling the multicast group events and multicast state maintenance. And finally modifying OpenFlow switch functions for fasts switch to pack up paths. Forwarders, forward the multicast packet based on multicast routing entries which were generated by the centralized controller. Tabu search will be used as heuristic algorithm for construction near optimum multicast tree and maintain multicast tree to still near optimum in case of join or leave any members from multicast group (group events). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multicast%20tree" title="multicast tree">multicast tree</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20define%20networks" title=" software define networks"> software define networks</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a>, <a href="https://publications.waset.org/abstracts/search?q=OpenFlow" title=" OpenFlow"> OpenFlow</a> </p> <a href="https://publications.waset.org/abstracts/47773/fast-switching-mechanism-for-multicasting-failure-in-openflow-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47773.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">263</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">911</span> Reliable Multicast Communication in Next Generation Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muazzam%20Ali%20Khan%20Khattak">Muazzam Ali Khan Khattak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Next Generation Network is combination of different networks having different technologies. Due to mobile nature of nodes the movement of nodes occurs from one network to another network. Multicasting in such networks is still a hot issue of research because the user in today's world wants reliable communication wherever it lies. Due to heterogeneity of NGN it is very difficult to handle reliable multicast communication. In this paper we proposed an improved scheme for reliable multicast communication in next generation networks. Because multicast communication is very important to deliver same data packets to multiple receivers and minimize the network traffic. This new scheme will make the multicast communication in NGN more reliable and efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=next%20generation%20networks" title="next generation networks">next generation networks</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20request" title=" route request"> route request</a>, <a href="https://publications.waset.org/abstracts/search?q=IPT" title=" IPT"> IPT</a>, <a href="https://publications.waset.org/abstracts/search?q=NACK" title=" NACK"> NACK</a>, <a href="https://publications.waset.org/abstracts/search?q=ARQ" title=" ARQ"> ARQ</a>, <a href="https://publications.waset.org/abstracts/search?q=DTN" title=" DTN"> DTN</a> </p> <a href="https://publications.waset.org/abstracts/1931/reliable-multicast-communication-in-next-generation-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1931.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">503</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">910</span> Enabling UDP Multicast in Cloud IaaS: An Enterprise Use Case</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Patrick%20J.%20Kerpan">Patrick J. Kerpan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ryan%20C.%20Koop"> Ryan C. Koop</a>, <a href="https://publications.waset.org/abstracts/search?q=Margaret%20M.%20Walker"> Margaret M. Walker</a>, <a href="https://publications.waset.org/abstracts/search?q=Chris%20P.%20Swan"> Chris P. Swan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The User Datagram Protocol (UDP) multicast is a vital part of data center networking that is being left out of major cloud computing providers' network infrastructure. Enterprise users rely on multicast, and particularly UDP multicast to create and connect vital business operations. For example, UPD makes a variety of business functions possible from simultaneous content media updates, High-Performance Computing (HPC) grids, and video call routing for massive open online courses (MOOCs). Essentially, UDP multicast's technological slight is causing a huge effect on whether companies choose to use (or not to use) public cloud infrastructure as a service (IaaS). Allowing the ‘chatty’ UDP multicast protocol inside a cloud network could have a serious impact on the performance of the cloud as a whole. Cloud IaaS providers solve the issue by disallowing all UDP multicast. But what about enterprise use cases for multicast applications in organizations that want to move to the cloud? To re-allow multicast traffic, enterprises can build a layer 3 - 7 network over the top of a data center, private cloud, or public cloud. An overlay network simply creates a private, sealed network on top of the existing network. Overlays give complete control of the network back to enterprise cloud users the freedom to manage their network beyond the control of the cloud provider’s firewall conditions. The same logic applies if for users who wish to use IPsec or BGP network protocols inside or connected into an overlay network in cloud IaaS. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=protocols" title=" protocols"> protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=UDP%20multicast" title=" UDP multicast"> UDP multicast</a>, <a href="https://publications.waset.org/abstracts/search?q=virtualization" title=" virtualization"> virtualization</a> </p> <a href="https://publications.waset.org/abstracts/32008/enabling-udp-multicast-in-cloud-iaas-an-enterprise-use-case" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32008.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">590</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">909</span> Performance Analysis of Scalable Secure Multicasting in Social Networking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Venkatesan">R. Venkatesan</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Sabari"> A. Sabari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Developments of social networking internet scenario are recommended for the requirements of scalable, authentic, secure group communication model like multicasting. Multicasting is an inter network service that offers efficient delivery of data from a source to multiple destinations. Even though multicast has been very successful at providing an efficient and best-effort data delivery service for huge groups, it verified complex process to expand other features to multicast in a scalable way. Separately, the requirement for secure electronic information had become gradually more apparent. Since multicast applications are deployed for mainstream purpose the need to secure multicast communications will become significant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multicasting" title="multicasting">multicasting</a>, <a href="https://publications.waset.org/abstracts/search?q=scalability" title=" scalability"> scalability</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20network" title=" social network"> social network</a> </p> <a href="https://publications.waset.org/abstracts/22357/performance-analysis-of-scalable-secure-multicasting-in-social-networking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22357.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">292</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">908</span> Performance of LTE Multicast Systems in the Presence of the Colored Noise Jamming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Malisuwan">S. Malisuwan</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Sivaraks"> J. Sivaraks</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Madan"> N. Madan</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Suriyakrai">N. Suriyakrai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The ever going evolution of advanced wireless technologies makes it financially impossible for military operations to completely manufacture their own equipment. Therefore, Commercial-Off-The-Shelf (COTS) and Modified-Off-The-Shelf (MOTS) are being considered in military mission with low-cost modifications. In this paper, we focus on the LTE multicast systems for military communication systems under tactical environments with jamming condition. We examine the influence of the colored noise jamming on the performance of the LTE multicast systems in terms of the average throughput. The simulation results demonstrate the degradation of the average throughput for different dynamic ranges of the colored noise jamming versus average SNR. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=performance" title="performance">performance</a>, <a href="https://publications.waset.org/abstracts/search?q=LTE" title=" LTE"> LTE</a>, <a href="https://publications.waset.org/abstracts/search?q=multicast" title=" multicast"> multicast</a>, <a href="https://publications.waset.org/abstracts/search?q=jamming" title=" jamming"> jamming</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput "> throughput </a> </p> <a href="https://publications.waset.org/abstracts/9883/performance-of-lte-multicast-systems-in-the-presence-of-the-colored-noise-jamming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9883.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">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">907</span> Secure Transmission Scheme in Device-to-Device Multicast Communications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bangwon%20Seo">Bangwon Seo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider multicast device-to-device (D2D) direct communication systems in cellular networks. In multicast D2D communications, nearby mobile devices exchanges, their data directly without going through a base station and a D2D transmitter send its data to multiple D2D receivers that compose of D2D multicast group. We consider wiretap channel where there is an eavesdropper that attempts to overhear the transmitted data of the D2D transmitter. In this paper, we propose a secure transmission scheme in D2D multicast communications in cellular networks. In order to prevent the eavesdropper from overhearing the transmitted data of the D2D transmitter, a precoding vector is employed at the D2D transmitter in the proposed scheme. We perform computer simulations to evaluate the performance of the proposed scheme. Through the simulation, we show that the secrecy rate performance can be improved by selecting an appropriate precoding vector. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=device-to-device%20communications" title="device-to-device communications">device-to-device communications</a>, <a href="https://publications.waset.org/abstracts/search?q=wiretap%20channel" title=" wiretap channel"> wiretap channel</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20transmission" title=" secure transmission"> secure transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=precoding" title=" precoding"> precoding</a> </p> <a href="https://publications.waset.org/abstracts/64163/secure-transmission-scheme-in-device-to-device-multicast-communications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64163.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">291</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">906</span> Symbol Synchronization and Resource Reuse Schemes for Layered Video Multicast Service in Long Term Evolution Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chung-Nan%20Lee">Chung-Nan Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Sheng-Wei%20Chu"> Sheng-Wei Chu</a>, <a href="https://publications.waset.org/abstracts/search?q=You-Chiun%20Wang"> You-Chiun Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> LTE (Long Term Evolution) employs the eMBMS (evolved Multimedia Broadcast/Multicast Service) protocol to deliver video streams to a multicast group of users. However, it requires all multicast members to receive a video stream in the same transmission rate, which would degrade the overall service quality when some users encounter bad channel conditions. To overcome this problem, this paper provides two efficient resource allocation schemes in such LTE network: The symbol synchronization (S2) scheme assumes that the macro and pico eNodeBs use the same frequency channel to deliver the video stream to all users. It then adopts a multicast transmission index to guarantee the fairness among users. On the other hand, the resource reuse (R2) scheme allows eNodeBs to transmit data on different frequency channels. Then, by introducing the concept of frequency reuse, it can further improve the overall service quality. Extensive simulation results show that the S2 and R2 schemes can respectively improve around 50% of fairness and 14% of video quality as compared with the common maximum throughput method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LTE%20networks" title="LTE networks">LTE networks</a>, <a href="https://publications.waset.org/abstracts/search?q=multicast" title=" multicast"> multicast</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=layered%20video" title=" layered video"> layered video</a> </p> <a href="https://publications.waset.org/abstracts/57088/symbol-synchronization-and-resource-reuse-schemes-for-layered-video-multicast-service-in-long-term-evolution-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57088.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">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">905</span> A Hybrid Model for Secure Protocol Independent Multicast Sparse Mode and Dense Mode Protocols in a Group Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20S.%20Jimah">M. S. Jimah</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20C.%20Achuenu"> A. C. Achuenu</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Momodu"> M. Momodu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Group communications over public infrastructure are prone to a lot of security issues. Existing network protocols like Protocol Independent Multicast Sparse Mode (PIM SM) and Protocol Independent Multicast Dense Mode (PIM DM) do not have inbuilt security features. Therefore, any user or node can easily access the group communication as long as the user can send join message to the source nodes, the source node then adds the user to the network group. In this research, a hybrid method of salting and hashing to encrypt information in the source and stub node was designed, and when stub nodes need to connect, they must have the appropriate key to join the group network. Object oriented analysis design (OOAD) was the methodology used, and the result shows that no extra controlled bandwidth overhead cost was added by encrypting and the hybrid model was more securing than the existing PIM SM, PIM DM and Zhang secure PIM SM. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=group%20communications" title="group communications">group communications</a>, <a href="https://publications.waset.org/abstracts/search?q=multicast" title=" multicast"> multicast</a>, <a href="https://publications.waset.org/abstracts/search?q=PIM%20SM" title=" PIM SM"> PIM SM</a>, <a href="https://publications.waset.org/abstracts/search?q=PIM%20DM" title=" PIM DM"> PIM DM</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/89976/a-hybrid-model-for-secure-protocol-independent-multicast-sparse-mode-and-dense-mode-protocols-in-a-group-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89976.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">162</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">904</span> Network Coding with Buffer Scheme in Multicast for Broadband Wireless Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gunasekaran%20Raja">Gunasekaran Raja</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramkumar%20Jayaraman"> Ramkumar Jayaraman</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajakumar%20Arul"> Rajakumar Arul</a>, <a href="https://publications.waset.org/abstracts/search?q=Kottilingam%20Kottursamy"> Kottilingam Kottursamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Broadband Wireless Network (BWN) is the promising technology nowadays due to the increased number of smartphones. Buffering scheme using network coding considers the reliability and proper degree distribution in Worldwide interoperability for Microwave Access (WiMAX) multi-hop network. Using network coding, a secure way of transmission is performed which helps in improving throughput and reduces the packet loss in the multicast network. At the outset, improved network coding is proposed in multicast wireless mesh network. Considering the problem of performance overhead, degree distribution makes a decision while performing buffer in the encoding / decoding process. Consequently, BuS (Buffer Scheme) based on network coding is proposed in the multi-hop network. Here the encoding process introduces buffer for temporary storage to transmit packets with proper degree distribution. The simulation results depend on the number of packets received in the encoding/decoding with proper degree distribution using buffering scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encoding%20and%20decoding" title="encoding and decoding">encoding and decoding</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer" title=" buffer"> buffer</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20coding" title=" network coding"> network coding</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20distribution" title=" degree distribution"> degree distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=broadband%20wireless%20networks" title=" broadband wireless networks"> broadband wireless networks</a>, <a href="https://publications.waset.org/abstracts/search?q=multicast" title=" multicast"> multicast</a> </p> <a href="https://publications.waset.org/abstracts/48856/network-coding-with-buffer-scheme-in-multicast-for-broadband-wireless-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48856.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">903</span> Optical Multicast over OBS Networks: An Approach Based on Code-Words and Tunable Decoders</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maha%20Sliti">Maha Sliti</a>, <a href="https://publications.waset.org/abstracts/search?q=Walid%20Abdallah"> Walid Abdallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Noureddine%20Boudriga"> Noureddine Boudriga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the frame of this work, we present an optical multicasting approach based on optical code-words. Our approach associates, in the edge node, an optical code-word to a group multicast address. In the core node, a set of tunable decoders are used to send a traffic data to multiple destinations based on the received code-word. The use of code-words, which correspond to the combination of an input port and a set of output ports, allows the implementation of an optical switching matrix. At the reception of a burst, it will be delayed in an optical memory. And, the received optical code-word is split to a set of tunable optical decoders. When it matches a configured code-word, the delayed burst is switched to a set of output ports. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optical%20multicast" title="optical multicast">optical multicast</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20burst%20switching%20networks" title=" optical burst switching networks"> optical burst switching networks</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20code-words" title=" optical code-words"> optical code-words</a>, <a href="https://publications.waset.org/abstracts/search?q=tunable%20decoder" title=" tunable decoder"> tunable decoder</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20optical%20memory" title=" virtual optical memory"> virtual optical memory</a> </p> <a href="https://publications.waset.org/abstracts/11614/optical-multicast-over-obs-networks-an-approach-based-on-code-words-and-tunable-decoders" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11614.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">607</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">902</span> An Encapsulation of a Navigable Tree Position: Theory, Specification, and Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nicodemus%20M.%20J.%20Mbwambo">Nicodemus M. J. Mbwambo</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu-Shan%20Sun"> Yu-Shan Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Murali%20Sitaraman"> Murali Sitaraman</a>, <a href="https://publications.waset.org/abstracts/search?q=Joan%20Krone"> Joan Krone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a generic data abstraction that captures a navigable tree position. The mathematical modeling of the abstraction encapsulates the current tree position, which can be used to navigate and modify the tree. The encapsulation of the tree position in the data abstraction specification avoids the use of explicit references and aliasing, thereby simplifying verification of (imperative) client code that uses the data abstraction. To ease the tasks of such specification and verification, a general tree theory, rich with mathematical notations and results, has been developed. The paper contains an example to illustrate automated verification ramifications. With sufficient tree theory development, automated proving seems plausible even in the absence of a special-purpose tree solver. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automation" title="automation">automation</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20abstraction" title=" data abstraction"> data abstraction</a>, <a href="https://publications.waset.org/abstracts/search?q=maps" title=" maps"> maps</a>, <a href="https://publications.waset.org/abstracts/search?q=specification" title=" specification"> specification</a>, <a href="https://publications.waset.org/abstracts/search?q=tree" title=" tree"> tree</a>, <a href="https://publications.waset.org/abstracts/search?q=verification" title=" verification"> verification</a> </p> <a href="https://publications.waset.org/abstracts/131080/an-encapsulation-of-a-navigable-tree-position-theory-specification-and-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131080.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">166</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">901</span> A Ratio-Weighted Decision Tree Algorithm for Imbalance Dataset Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Doyin%20Afolabi">Doyin Afolabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Phillip%20Adewole"> Phillip Adewole</a>, <a href="https://publications.waset.org/abstracts/search?q=Oladipupo%20Sennaike"> Oladipupo Sennaike</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Most well-known classifiers, including the decision tree algorithm, can make predictions on balanced datasets efficiently. However, the decision tree algorithm tends to be biased towards imbalanced datasets because of the skewness of the distribution of such datasets. To overcome this problem, this study proposes a weighted decision tree algorithm that aims to remove the bias toward the majority class and prevents the reduction of majority observations in imbalance datasets classification. The proposed weighted decision tree algorithm was tested on three imbalanced datasets- cancer dataset, german credit dataset, and banknote dataset. The specificity, sensitivity, and accuracy metrics were used to evaluate the performance of the proposed decision tree algorithm on the datasets. The evaluation results show that for some of the weights of our proposed decision tree, the specificity, sensitivity, and accuracy metrics gave better results compared to that of the ID3 decision tree and decision tree induced with minority entropy for all three datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20tree" title=" decision tree"> decision tree</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=imbalance%20dataset" title=" imbalance dataset"> imbalance dataset</a> </p> <a href="https://publications.waset.org/abstracts/157609/a-ratio-weighted-decision-tree-algorithm-for-imbalance-dataset-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157609.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">136</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">900</span> A Kruskal Based Heuxistic for the Application of Spanning Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anjan%20Naidu">Anjan Naidu </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we first discuss the minimum spanning tree, then we use the Kruskal algorithm to obtain minimum spanning tree. Based on Kruskal algorithm we propose Kruskal algorithm to apply an application to find minimum cost applying the concept of spanning tree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Minimum%20Spanning%20tree" title="Minimum Spanning tree">Minimum Spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm" title=" algorithm"> algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=Heuxistic" title=" Heuxistic"> Heuxistic</a>, <a href="https://publications.waset.org/abstracts/search?q=application" title=" application"> application</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20of%20Sub%2097K90" title=" classification of Sub 97K90"> classification of Sub 97K90</a> </p> <a href="https://publications.waset.org/abstracts/30559/a-kruskal-based-heuxistic-for-the-application-of-spanning-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30559.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">444</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">899</span> Stochastic Multicast Routing Protocol for Flying Ad-Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyunsun%20Lee">Hyunsun Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Yi%20Zhu"> Yi Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless ad-hoc network is a decentralized type of temporary machine-to-machine connection that is spontaneous or impromptu so that it does not rely on any fixed infrastructure and centralized administration. As unmanned aerial vehicles (UAVs), also called drones, have recently become more accessible and widely utilized in military and civilian domains such as surveillance, search and detection missions, traffic monitoring, remote filming, product delivery, to name a few. The communication between these UAVs become possible and materialized through Flying Ad-hoc Networks (FANETs). However, due to the high mobility of UAVs that may cause different types of transmission interference, it is vital to design robust routing protocols for FANETs. In this talk, the multicast routing method based on a modified stochastic branching process is proposed. The stochastic branching process is often used to describe an early stage of an infectious disease outbreak, and the reproductive number in the process is used to classify the outbreak into a major or minor outbreak. The reproductive number to regulate the local transmission rate is adapted and modified for flying ad-hoc network communication. The performance of the proposed routing method is compared with other well-known methods such as flooding method and gossip method based on three measures; average reachability, average node usage and average branching factor. The proposed routing method achieves average reachability very closer to flooding method, average node usage closer to gossip method, and outstanding average branching factor among methods. It can be concluded that the proposed multicast routing scheme is more efficient than well-known routing schemes such as flooding and gossip while it maintains high performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Flying%20Ad-hoc%20Networks" title="Flying Ad-hoc Networks">Flying Ad-hoc Networks</a>, <a href="https://publications.waset.org/abstracts/search?q=Multicast%20Routing" title=" Multicast Routing"> Multicast Routing</a>, <a href="https://publications.waset.org/abstracts/search?q=Stochastic%20Branching%20Process" title=" Stochastic Branching Process"> Stochastic Branching Process</a>, <a href="https://publications.waset.org/abstracts/search?q=Unmanned%20Aerial%20Vehicles" title=" Unmanned Aerial Vehicles"> Unmanned Aerial Vehicles</a> </p> <a href="https://publications.waset.org/abstracts/120727/stochastic-multicast-routing-protocol-for-flying-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120727.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">123</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">898</span> Nearest Neighbor Investigate Using R+ Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rutuja%20Desai">Rutuja Desai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Search engine is fundamentally a framework used to search the data which is pertinent to the client via WWW. Looking close-by spot identified with the keywords is an imperative concept in developing web advances. For such kind of searching, extent pursuit or closest neighbor is utilized. In range search the forecast is made whether the objects meet to query object. Nearest neighbor is the forecast of the focuses close to the query set by the client. Here, the nearest neighbor methodology is utilized where Data recovery R+ tree is utilized rather than IR2 tree. The disadvantages of IR2 tree is: The false hit number can surpass the limit and the mark in Information Retrieval R-tree must have Voice over IP bit for each one of a kind word in W set is recouped by Data recovery R+ tree. The inquiry is fundamentally subordinate upon the key words and the geometric directions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title="information retrieval">information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=nearest%20neighbor%20search" title=" nearest neighbor search"> nearest neighbor search</a>, <a href="https://publications.waset.org/abstracts/search?q=keyword%20search" title=" keyword search"> keyword search</a>, <a href="https://publications.waset.org/abstracts/search?q=R%2B%20tree" title=" R+ tree"> R+ tree</a> </p> <a href="https://publications.waset.org/abstracts/33680/nearest-neighbor-investigate-using-r-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33680.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">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">897</span> A Novel PSO Based Decision Tree Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Farzan">Ali Farzan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Classification of data objects or patterns is a major part in most of Decision making systems. One of the popular and commonly used classification methods is Decision Tree (DT). It is a hierarchical decision making system by which a binary tree is constructed and starting from root, at each node some of the classes is rejected until reaching the leaf nods. Each leaf node is a representative of one specific class. Finding the splitting criteria in each node for constructing or training the tree is a major problem. Particle Swarm Optimization (PSO) has been adopted as a metaheuristic searching method for finding the best splitting criteria. Result of evaluating the proposed method over benchmark datasets indicates the higher accuracy of the new PSO based decision tree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decision%20tree" title="decision tree">decision tree</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=splitting%20criteria" title=" splitting criteria"> splitting criteria</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/32425/a-novel-pso-based-decision-tree-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32425.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">406</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">896</span> Monitoring Three-Dimensional Models of Tree and Forest by Using Digital Close-Range Photogrammetry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Y.%20Cicekli">S. Y. Cicekli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, tree-dimensional model of tree was created by using terrestrial close range photogrammetry. For this close range photos were taken. Photomodeler Pro 5 software was used for camera calibration and create three-dimensional model of trees. In first test, three-dimensional model of a tree was created, in the second test three-dimensional model of three trees were created. This study aim is creating three-dimensional model of trees and indicate the use of close-range photogrammetry in forestry. At the end of the study, three-dimensional model of tree and three trees were created. This study showed that usability of close-range photogrammetry for monitoring tree and forests three-dimensional model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=close-%20range%20photogrammetry" title="close- range photogrammetry">close- range photogrammetry</a>, <a href="https://publications.waset.org/abstracts/search?q=forest" title=" forest"> forest</a>, <a href="https://publications.waset.org/abstracts/search?q=tree" title=" tree"> tree</a>, <a href="https://publications.waset.org/abstracts/search?q=three-dimensional%20model" title=" three-dimensional model"> three-dimensional model</a> </p> <a href="https://publications.waset.org/abstracts/39825/monitoring-three-dimensional-models-of-tree-and-forest-by-using-digital-close-range-photogrammetry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39825.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">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">895</span> A Dynamic Round Robin Routing for Z-Fat Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20O.%20Adda">M. O. Adda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a topology called Zoned fat tree (Z-Fat tree) which is a further extension to the classical fat trees. The extension relates to the provision of extra degree of connectivity to maximize the number of deployed ports per routing nodes, and hence increases the bisection bandwidth especially for slimmed fat trees. The extra links, when classical routing is used, tend, in deterministic environment, to be under-utilized for some traffic patterns, hence achieving poor performance. We suggest two versions of a dynamic round robin scheme that outperforms the classical D-mod-k and S-mod-K routing and show by simulation that our proposal utilize all the extra added links to the classical fat tree, and achieve better performance for general applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deterministic%20routing" title="deterministic routing">deterministic routing</a>, <a href="https://publications.waset.org/abstracts/search?q=fat%20tree" title=" fat tree"> fat tree</a>, <a href="https://publications.waset.org/abstracts/search?q=interconnection" title=" interconnection"> interconnection</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20pattern" title=" traffic pattern"> traffic pattern</a> </p> <a href="https://publications.waset.org/abstracts/40045/a-dynamic-round-robin-routing-for-z-fat-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40045.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">484</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">894</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/abstracts/search?q=Ha%20T.%20Pham">Ha T. Pham</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuichi%20Miyagawa"> Shuichi Miyagawa</a> </p> <p class="card-text"><strong>Abstract:</strong></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 are now rely 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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aerial%20photographs" title="aerial photographs">aerial photographs</a>, <a href="https://publications.waset.org/abstracts/search?q=land%20use%20change" title=" land use change"> land use change</a>, <a href="https://publications.waset.org/abstracts/search?q=traditional%20landscape" title=" traditional landscape"> traditional landscape</a>, <a href="https://publications.waset.org/abstracts/search?q=tree%20in%20paddy%20fields" title=" tree in paddy fields"> tree in paddy fields</a> </p> <a href="https://publications.waset.org/abstracts/15536/historical-landscape-affects-present-tree-density-in-paddy-field" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15536.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">419</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">893</span> Unconventional Dating of Old Peepal Tree of Chandigarh (India) Using Optically Stimulated Luminescence</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rita%20Rani">Rita Rani</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramesh%20Kumar"> Ramesh Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The intend of the current study is to date an old grand Peepal tree that is still alive. The tree is situated in Kalibard village, Sector 9, Chandigarh (India). Due to its huge structure, it has got the status of ‘Heritage tree.’ Optically Stimulated Luminescence of sediments beneath the roots is used to determine the age of the tree. Optical dating is preferred over conventional dating methods due to more precession. The methodology includes OSL of quartz grain using SAR protocol for accumulated dose measurement. The age determination of an alive tree using sedimentary quartz is in close agreement with the approximated age provided by the related agency. This is the first attempt at using optically stimulated luminescence in the age determination of alive trees in this region. The study concludes that the Luminescence dating of alive trees is the nondestructive and more precise method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=luminescence" title="luminescence">luminescence</a>, <a href="https://publications.waset.org/abstracts/search?q=dose%20rate" title=" dose rate"> dose rate</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20dating" title=" optical dating"> optical dating</a>, <a href="https://publications.waset.org/abstracts/search?q=sediments" title=" sediments"> sediments</a> </p> <a href="https://publications.waset.org/abstracts/140440/unconventional-dating-of-old-peepal-tree-of-chandigarh-india-using-optically-stimulated-luminescence" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140440.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">176</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">892</span> Fuzzy Approach for Fault Tree Analysis of Water Tube Boiler</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Ahzam%20Tariq">Syed Ahzam Tariq</a>, <a href="https://publications.waset.org/abstracts/search?q=Atharva%20Modi"> Atharva Modi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a probabilistic analysis of the safety of water tube boilers using fault tree analysis (FTA). A fault tree has been constructed by considering all possible areas where a malfunction could lead to a boiler accident. Boiler accidents are relatively rare, causing a scarcity of data. The fuzzy approach is employed to perform a quantitative analysis, wherein theories of fuzzy logic are employed in conjunction with expert elicitation to calculate failure probabilities. The Fuzzy Fault Tree Analysis (FFTA) provides a scientific and contingent method to forecast and prevent accidents. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fault%20tree%20analysis%20water%20tube%20boiler" title="fault tree analysis water tube boiler">fault tree analysis water tube boiler</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20probability%20score" title=" fuzzy probability score"> fuzzy probability score</a>, <a href="https://publications.waset.org/abstracts/search?q=failure%20probability" title=" failure probability"> failure probability</a> </p> <a href="https://publications.waset.org/abstracts/140431/fuzzy-approach-for-fault-tree-analysis-of-water-tube-boiler" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140431.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">127</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">891</span> Handshake Algorithm for Minimum Spanning Tree Construction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nassiri%20Khalid">Nassiri Khalid</a>, <a href="https://publications.waset.org/abstracts/search?q=El%20Hibaoui%20Abdelaaziz%20et%20Hajar%20Moha"> El Hibaoui Abdelaaziz et Hajar Moha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce and analyse a probabilistic distributed algorithm for a construction of a minimum spanning tree on network. This algorithm is based on the handshake concept. Firstly, each network node is considered as a sub-spanning tree. And at each round of the execution of our algorithm, a sub-spanning trees are merged. The execution continues until all sub-spanning trees are merged into one. We analyze this algorithm by a stochastic process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Spanning%20tree" title="Spanning tree">Spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=Distributed%20Algorithm" title=" Distributed Algorithm"> Distributed Algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=Handshake%20Algorithm" title=" Handshake Algorithm"> Handshake Algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=Matching" title=" Matching"> Matching</a>, <a href="https://publications.waset.org/abstracts/search?q=Probabilistic%20Analysis" title=" Probabilistic Analysis"> Probabilistic Analysis</a> </p> <a href="https://publications.waset.org/abstracts/17743/handshake-algorithm-for-minimum-spanning-tree-construction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17743.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">658</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">890</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/abstracts/search?q=H.-H.%20Doh">H.-H. Doh</a>, <a href="https://publications.waset.org/abstracts/search?q=J.-M.%20Yu"> J.-M. Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.-J.%20Kwon"> Y.-J. Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=J.-H.%20Shin"> J.-H. Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=H.-W.%20Kim"> H.-W. Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=S.-H.%20Nam"> S.-H. Nam</a>, <a href="https://publications.waset.org/abstracts/search?q=D.-H.%20Lee"> D.-H. Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop%20scheduling" title="flexible job shop scheduling">flexible job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20tree" title=" decision tree"> decision tree</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20rules" title=" priority rules"> priority rules</a>, <a href="https://publications.waset.org/abstracts/search?q=case%20study" title=" case study"> case study</a> </p> <a href="https://publications.waset.org/abstracts/6996/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/abstracts/6996.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">358</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">889</span> Semi-Supervised Hierarchical Clustering Given a Reference Tree of Labeled Documents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Zhao">Ying Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xingyan%20Bin"> Xingyan Bin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Semi-supervised clustering algorithms have been shown effective to improve clustering process with even limited supervision. However, semi-supervised hierarchical clustering remains challenging due to the complexities of expressing constraints for agglomerative clustering algorithms. This paper proposes novel semi-supervised agglomerative clustering algorithms to build a hierarchy based on a known reference tree. We prove that by enforcing distance constraints defined by a reference tree during the process of hierarchical clustering, the resultant tree is guaranteed to be consistent with the reference tree. We also propose a framework that allows the hierarchical tree generation be aware of levels of levels of the agglomerative tree under creation, so that metric weights can be learned and adopted at each level in a recursive fashion. The experimental evaluation shows that the additional cost of our contraint-based semi-supervised hierarchical clustering algorithm (HAC) is negligible, and our combined semi-supervised HAC algorithm outperforms the state-of-the-art algorithms on real-world datasets. The experiments also show that our proposed methods can improve clustering performance even with a small number of unevenly distributed labeled data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semi-supervised%20clustering" title="semi-supervised clustering">semi-supervised clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%0D%0Aagglomerative%20clustering" title=" hierarchical agglomerative clustering"> hierarchical agglomerative clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=reference%20trees" title=" reference trees"> reference trees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20constraints" title=" distance constraints "> distance constraints </a> </p> <a href="https://publications.waset.org/abstracts/19478/semi-supervised-hierarchical-clustering-given-a-reference-tree-of-labeled-documents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19478.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">547</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">888</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/abstracts/search?q=J.%20K.%20Alhassan">J. K. Alhassan</a>, <a href="https://publications.waset.org/abstracts/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/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20tree" title=" decision tree"> decision tree</a>, <a href="https://publications.waset.org/abstracts/search?q=scholarship" title=" scholarship"> scholarship</a> </p> <a href="https://publications.waset.org/abstracts/30987/using-data-mining-technique-for-scholarship-disbursement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30987.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">375</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">887</span> Dynamic Fault Tree Analysis of Dynamic Positioning System through Monte Carlo Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20S.%20Cheliyan">A. S. Cheliyan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20K.%20Bhattacharyya"> S. K. Bhattacharyya </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dynamic Positioning System (DPS) is employed in marine vessels of the offshore oil and gas industry. It is a computer controlled system to automatically maintain a ship’s position and heading by using its own thrusters. Reliability assessment of the same can be analyzed through conventional fault tree. However, the complex behaviour like sequence failure, redundancy management and priority of failing of events cannot be analyzed by the conventional fault trees. The Dynamic Fault Tree (DFT) addresses these shortcomings of conventional Fault Tree by defining additional gates called dynamic gates. Monte Carlo based simulation approach has been adopted for the dynamic gates. This method of realistic modeling of DPS gives meaningful insight into the system reliability and the ability to improve the same. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20positioning%20system" title="dynamic positioning system">dynamic positioning system</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20fault%20tree" title=" dynamic fault tree"> dynamic fault tree</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo%20simulation" title=" Monte Carlo simulation"> Monte Carlo simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20assessment" title=" reliability assessment "> reliability assessment </a> </p> <a href="https://publications.waset.org/abstracts/58683/dynamic-fault-tree-analysis-of-dynamic-positioning-system-through-monte-carlo-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58683.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">773</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">886</span> CanVis: Towards a Web Platform for Cancer Progression Tree Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Aupetit">Michael Aupetit</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20Al-ismail"> Mahmoud Al-ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Mohamed"> Khaled Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cancer is a major public health problem all over the world. Breast cancer has the highest incidence rate over all cancers for women in Qatar making its study a top priority of the country. Human cancer is a dynamic disease that develops over an extended period through the accumulation of a series of genetic alterations. A Darwinian process drives the tumor cells toward higher malignancy growing the branches of a progression tree in the space of genes expression. Although it is not possible to track these genetic alterations dynamically for one patient, it is possible to reconstruct the progression tree from the aggregation of thousands of tumor cells’ genetic profiles from thousands of different patients at different stages of the disease. Analyzing the progression tree is a way to detect pivotal molecular events that drive the malignant evolution and to provide a guide for the development of cancer diagnostics, prognostics and targeted therapeutics. In this work we present the development of a Visual Analytic web platform CanVis enabling users to upload gene-expression data and analyze their progression tree. The server computes the progression tree based on state-of-the-art techniques and allows an interactive visual exploration of this tree and the gene-expression data along its branching structure helping to discover potential driver genes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=breast%20cancer" title="breast cancer">breast cancer</a>, <a href="https://publications.waset.org/abstracts/search?q=progression%20tree" title=" progression tree"> progression tree</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20analytics" title=" visual analytics"> visual analytics</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20platform" title=" web platform"> web platform</a> </p> <a href="https://publications.waset.org/abstracts/39156/canvis-towards-a-web-platform-for-cancer-progression-tree-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39156.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">416</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">885</span> Brain Tumor Segmentation Based on Minimum Spanning Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Simeon%20Mayala">Simeon Mayala</a>, <a href="https://publications.waset.org/abstracts/search?q=Ida%20Herdlev%C3%A6r"> Ida Herdlevær</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonas%20Bull%20Haugs%C3%B8en"> Jonas Bull Haugsøen</a>, <a href="https://publications.waset.org/abstracts/search?q=Shamundeeswari%20Anandan"> Shamundeeswari Anandan</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Gavasso"> Sonia Gavasso</a>, <a href="https://publications.waset.org/abstracts/search?q=Morten%20Brun"> Morten Brun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters. The steps involve preprocessing, making a graph, constructing a minimum spanning tree, and a newly implemented way of interactively segmenting the region of interest. In the preprocessing step, a Gaussian filter is applied to 2D images to remove the noise. Then, the pixel neighbor graph is weighted by intensity differences and the corresponding minimum spanning tree is constructed. The image is loaded in an interactive window for segmenting the tumor. The region of interest and the background are selected by clicking to split the minimum spanning tree into two trees. One of these trees represents the region of interest and the other represents the background. Finally, the segmentation given by the two trees is visualized. The proposed method was tested by segmenting two different 2D brain T1-weighted magnetic resonance image data sets. The comparison between our results and the standard gold segmentation confirmed the validity of the minimum spanning tree approach. The proposed method is simple to implement and the results indicate that it is accurate and efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=brain%20tumor" title="brain tumor">brain tumor</a>, <a href="https://publications.waset.org/abstracts/search?q=brain%20tumor%20segmentation" title=" brain tumor segmentation"> brain tumor segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20spanning%20tree" title=" minimum spanning tree"> minimum spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=segmentation" title=" segmentation"> segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a> </p> <a href="https://publications.waset.org/abstracts/148591/brain-tumor-segmentation-based-on-minimum-spanning-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148591.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">122</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">884</span> Pressure Losses on Realistic Geometry of Tracheobronchial Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michaela%20Chovancova">Michaela Chovancova</a>, <a href="https://publications.waset.org/abstracts/search?q=Jakub%20Elcner"> Jakub Elcner</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Real bronchial tree is very complicated piping system. Analysis of flow and pressure losses in this system is very difficult. Due to the complex geometry and the very small size in the lower generations is examination by CFD possible only in the central part of bronchial tree. For specify the pressure losses of lower generations is necessary to provide a mathematical equation. Determination of mathematical formulas for calculating the pressure losses in the real lungs is due to its complexity and diversity lengthy and inefficient process. For these calculations is necessary the lungs to slightly simplify (same cross-section over the length of individual generation) or use one of the models of lungs. The simplification could cause deviations from real values. The article compares the values of pressure losses obtained from CFD simulation of air flow in the central part of the real bronchial tree with the values calculated in a slightly simplified real lungs by using a mathematical relationship derived from the Bernoulli equation and continuity equation. Then, evaluate the desirability of using this formula to determine the pressure loss across the bronchial tree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pressure%20gradient" title="pressure gradient">pressure gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=airways%20resistance" title=" airways resistance"> airways resistance</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20geometry%20of%20bronchial%20tree" title=" real geometry of bronchial tree"> real geometry of bronchial tree</a>, <a href="https://publications.waset.org/abstracts/search?q=breathing" title=" breathing"> breathing</a> </p> <a href="https://publications.waset.org/abstracts/27498/pressure-losses-on-realistic-geometry-of-tracheobronchial-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27498.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">322</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">883</span> Segregation Patterns of Trees and Grass Based on a Modified Age-Structured Continuous-Space Forest Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Yang">Jian Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Atsushi%20Yagi"> Atsushi Yagi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tree-grass coexistence system is of great importance for forest ecology. Mathematical models are being proposed to study the dynamics of tree-grass coexistence and the stability of the systems. However, few of the models concentrates on spatial dynamics of the tree-grass coexistence. In this study, we modified an age-structured continuous-space population model for forests, obtaining an age-structured continuous-space population model for the tree-grass competition model. In the model, for thermal competitions, adult trees can out-compete grass, and grass can out-compete seedlings. We mathematically studied the model to make sure tree-grass coexistence solutions exist. Numerical experiments demonstrated that a fraction of area that trees or grass occupies can affect whether the coexistence is stable or not. We also tried regulating the mortality of adult trees with other parameters and the fraction of area trees and grass occupies were fixed; results show that the mortality of adult trees is also a factor affecting the stability of the tree-grass coexistence in this model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=population-structured%20models" title="population-structured models">population-structured models</a>, <a href="https://publications.waset.org/abstracts/search?q=stabilities%20of%20ecosystems" title=" stabilities of ecosystems"> stabilities of ecosystems</a>, <a href="https://publications.waset.org/abstracts/search?q=thermal%20competitions" title=" thermal competitions"> thermal competitions</a>, <a href="https://publications.waset.org/abstracts/search?q=tree-grass%20coexistence%20systems" title=" tree-grass coexistence systems"> tree-grass coexistence systems</a> </p> <a href="https://publications.waset.org/abstracts/102872/segregation-patterns-of-trees-and-grass-based-on-a-modified-age-structured-continuous-space-forest-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102872.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">160</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%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/abstracts/search?q=multicast%20tree&page=30">30</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%20tree&page=31">31</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multicast%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>