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: adaptive distributed networks</title> <meta name="description" content="Search results for: adaptive distributed networks"> <meta name="keywords" content="adaptive distributed networks"> <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="adaptive distributed networks" 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="adaptive distributed networks"> <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> 5572</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: adaptive distributed networks</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5572</span> Implementation of Distributed Randomized Algorithms for Resilient Peer-to-Peer Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Richard%20Tanaka">Richard Tanaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Zhu"> Ying Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a few randomized algorithms in application-layer peer-to-peer networks. The significant gain in scalability and resilience that peer-to-peer networks provide has made them widely used and adopted in many real-world distributed systems and applications. The unique properties of peer-to-peer networks make them particularly suitable for randomized algorithms such as random walks and gossip algorithms. Instead of simulations of peer-to-peer networks, we leverage the Docker virtual container technology to develop implementations of the peer-to-peer networks and these distributed randomized algorithms running on top of them. We can thus analyze their behaviour and performance in realistic settings. We further consider the problem of identifying high-risk bottleneck links in the network with the objective of improving the resilience and reliability of peer-to-peer networks. We propose a randomized algorithm to solve this problem and evaluate its performance by simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20randomized%20algorithms" title="distributed randomized algorithms">distributed randomized algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=peer-to-peer%20networks" title=" peer-to-peer networks"> peer-to-peer networks</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20container%20technology" title=" virtual container technology"> virtual container technology</a>, <a href="https://publications.waset.org/abstracts/search?q=resilient%20networks" title=" resilient networks"> resilient networks</a> </p> <a href="https://publications.waset.org/abstracts/133527/implementation-of-distributed-randomized-algorithms-for-resilient-peer-to-peer-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133527.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">216</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">5571</span> An Adaptive Opportunistic Transmission for Unlicensed Spectrum Sharing in Heterogeneous Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daehyoung%20Kim">Daehyoung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Pervez%20Khan"> Pervez Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoon%20Kim"> Hoon Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Efficient utilization of spectrum resources is a fundamental issue of wireless communications due to its scarcity. To improve the efficiency of spectrum utilization, the spectrum sharing for unlicensed bands is being regarded as one of key technologies in the next generation wireless networks. A number of schemes such as Listen-Before-Talk(LBT) and carrier sensor adaptive transmission (CSAT) have been suggested from this aspect, but more efficient sharing schemes are required for improving spectrum utilization efficiency. This work considers an opportunistic transmission approach and a dynamic Contention Window (CW) adjustment scheme for LTE-U users sharing the unlicensed spectrum with Wi-Fi, in order to enhance the overall system throughput. The decision criteria for the dynamic adjustment of CW are based on the collision evaluation, derived from the collision probability of the system. The overall performance can be improved due to the adaptive adjustment of the CW. Simulation results show that our proposed scheme outperforms the Distributed Coordination Function (DCF) mechanism of IEEE 802.11 MAC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spectrum%20sharing" title="spectrum sharing">spectrum sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20opportunistic%20transmission" title=" adaptive opportunistic transmission"> adaptive opportunistic transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=unlicensed%20bands" title=" unlicensed bands"> unlicensed bands</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20networks" title=" heterogeneous networks"> heterogeneous networks</a> </p> <a href="https://publications.waset.org/abstracts/51830/an-adaptive-opportunistic-transmission-for-unlicensed-spectrum-sharing-in-heterogeneous-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51830.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">350</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">5570</span> Considering the Reliability of Measurements Issue in Distributed Adaptive Estimation Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wael%20M.%20Bazzi">Wael M. Bazzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Rastegarnia"> Amir Rastegarnia</a>, <a href="https://publications.waset.org/abstracts/search?q=Azam%20Khalili"> Azam Khalili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we consider the issue of reliability of measurements in distributed adaptive estimation problem. To this aim, we assume a sensor network with different observation noise variance among the sensors and propose new estimation method based on incremental distributed least mean-square (IDLMS) algorithm. The proposed method contains two phases: I) Estimation of each sensors observation noise variance, and II) Estimation of the desired parameter using the estimated observation variances. To deal with the reliability of measurements, in the second phase of the proposed algorithm, the step-size parameter is adjusted for each sensor according to its observation noise variance. As our simulation results show, the proposed algorithm considerably improves the performance of the IDLMS algorithm in the same condition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20filter" title="adaptive filter">adaptive filter</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20estimation" title=" distributed estimation"> distributed estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%0D%0Anetwork" title=" sensor network"> sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=IDLMS%20algorithm" title=" IDLMS algorithm"> IDLMS algorithm</a> </p> <a href="https://publications.waset.org/abstracts/27648/considering-the-reliability-of-measurements-issue-in-distributed-adaptive-estimation-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27648.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">634</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">5569</span> An Interactive Methodology to Demonstrate the Level of Effectiveness of the Synthesis of Local-Area Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=W.%20Shin">W. Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Kim"> Y. Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study focuses on disconfirming that wide-area networks can be made mobile, highly-available, and wireless. This methodological test shows that IPv7 and context-free grammar are mismatched. In the cases of robots, a similar tendency is also revealed. Further, we also prove that public-private key pairs could be built embedded, adaptive, and wireless. Finally, we disconfirm that although hash tables can be made distributed, interposable, and autonomous, XML and DNS can interfere to realize this purpose. Our experiments soon proved that exokernelizing our replicated Knesis keyboards was more significant than interrupting them. Our experiments exhibited degraded average sampling rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=collaborative%20communication" title="collaborative communication">collaborative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=DNS" title=" DNS"> DNS</a>, <a href="https://publications.waset.org/abstracts/search?q=local-area%20networks" title=" local-area networks"> local-area networks</a>, <a href="https://publications.waset.org/abstracts/search?q=XML" title=" XML"> XML</a> </p> <a href="https://publications.waset.org/abstracts/96551/an-interactive-methodology-to-demonstrate-the-level-of-effectiveness-of-the-synthesis-of-local-area-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96551.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">187</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">5568</span> Optimal Simultaneous Sizing and Siting of DGs and Smart Meters Considering Voltage Profile Improvement in Active Distribution Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Sattarpour">T. Sattarpour</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Nazarpour"> D. Nazarpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the effect of simultaneous placement of DGs and smart meters (SMs), on voltage profile improvement in active distribution networks (ADNs). A substantial center of attention has recently been on responsive loads initiated in power system problem studies such as distributed generations (DGs). Existence of responsive loads in active distribution networks (ADNs) would have undeniable effect on sizing and siting of DGs. For this reason, an optimal framework is proposed for sizing and siting of DGs and SMs in ADNs. SMs are taken into consideration for the sake of successful implementing of demand response programs (DRPs) such as direct load control (DLC) with end-side consumers. Looking for voltage profile improvement, the optimization procedure is solved by genetic algorithm (GA) and tested on IEEE 33-bus distribution test system. Different scenarios with variations in the number of DG units, individual or simultaneous placing of DGs and SMs, and adaptive power factor (APF) mode for DGs to support reactive power have been established. The obtained results confirm the significant effect of DRPs and APF mode in determining the optimal size and site of DGs to be connected in ADN resulting to the improvement of voltage profile as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=active%20distribution%20network%20%28ADN%29" title="active distribution network (ADN)">active distribution network (ADN)</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20generations%20%28DGs%29" title=" distributed generations (DGs)"> distributed generations (DGs)</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20meters%20%28SMs%29" title=" smart meters (SMs)"> smart meters (SMs)</a>, <a href="https://publications.waset.org/abstracts/search?q=demand%20response%20programs%20%28DRPs%29" title=" demand response programs (DRPs)"> demand response programs (DRPs)</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20power%20factor%20%28APF%29" title=" adaptive power factor (APF)"> adaptive power factor (APF)</a> </p> <a href="https://publications.waset.org/abstracts/12261/optimal-simultaneous-sizing-and-siting-of-dgs-and-smart-meters-considering-voltage-profile-improvement-in-active-distribution-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12261.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">302</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">5567</span> An Adaptive Distributed Incremental Association Rule Mining System </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adewale%20O.%20Ogunde">Adewale O. Ogunde</a>, <a href="https://publications.waset.org/abstracts/search?q=Olusegun%20Folorunso"> Olusegun Folorunso</a>, <a href="https://publications.waset.org/abstracts/search?q=Adesina%20S.%20Sodiya"> Adesina S. Sodiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Most existing Distributed Association Rule Mining (DARM) systems are still facing several challenges. One of such challenges that have not received the attention of many researchers is the inability of existing systems to adapt to constantly changing databases and mining environments. In this work, an Adaptive Incremental Mining Algorithm (AIMA) is therefore proposed to address these problems. AIMA employed multiple mobile agents for the entire mining process. AIMA was designed to adapt to changes in the distributed databases by mining only the incremental database updates and using this to update the existing rules in order to improve the overall response time of the DARM system. In AIMA, global association rules were integrated incrementally from one data site to another through Results Integration Coordinating Agents. The mining agents in AIMA were made adaptive by defining mining goals with reasoning and behavioral capabilities and protocols that enabled them to either maintain or change their goals. AIMA employed Java Agent Development Environment Extension for designing the internal agents’ architecture. Results from experiments conducted on real datasets showed that the adaptive system, AIMA performed better than the non-adaptive systems with lower communication costs and higher task completion rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptivity" title="adaptivity">adaptivity</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=distributed%20association%20rule%20mining" title=" distributed association rule mining"> distributed association rule mining</a>, <a href="https://publications.waset.org/abstracts/search?q=incremental%20mining" title=" incremental mining"> incremental mining</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20agents" title=" mobile agents"> mobile agents</a> </p> <a href="https://publications.waset.org/abstracts/10014/an-adaptive-distributed-incremental-association-rule-mining-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10014.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">393</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">5566</span> Reliability Improvement of Power System Networks Using Adaptive Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alireza%20Alesaadi">Alireza Alesaadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reliability analysis is a powerful method for determining the weak points of the electrical networks. In designing of electrical network, it is tried to design the most reliable network with minimal system shutting down, but it is usually associated with increasing the cost. In this paper, using adaptive genetic algorithm, a method was presented that provides the most reliable system with a certain economical cost. Finally, the proposed method is applied to a sample network and results will be analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20genetic%20algorithm" title=" adaptive genetic algorithm"> adaptive genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=electrical%20network" title=" electrical network"> electrical network</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20engineering" title=" communication engineering"> communication engineering</a> </p> <a href="https://publications.waset.org/abstracts/6512/reliability-improvement-of-power-system-networks-using-adaptive-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6512.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">509</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">5565</span> Application of Artificial Neural Networks to Adaptive Speed Control under ARDUINO</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Javier%20Fernandez%20De%20Canete">Javier Fernandez De Canete</a>, <a href="https://publications.waset.org/abstracts/search?q=Alvaro%20Fernandez-Quintero"> Alvaro Fernandez-Quintero</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, adaptive control schemes are being used when model based control schemes are applied in presence of uncertainty and model mismatches. Artificial neural networks have been employed both in modelling and control of non-linear dynamic systems with unknown dynamics. In fact, these are powerful tools to solve this control problem when only input-output operational data are available. A neural network controller under SIMULINK together with the ARDUINO hardware platform has been used to perform real-time speed control of a computer case fan. Comparison of performance with a PID controller has also been presented in order to show the efficacy of neural control under different command signals tracking and also when disturbance signals are present in the speed control loops. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title="neural networks">neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=ARDUINO%20platform" title=" ARDUINO platform"> ARDUINO platform</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMULINK" title=" SIMULINK"> SIMULINK</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20speed%20control" title=" adaptive speed control"> adaptive speed control</a> </p> <a href="https://publications.waset.org/abstracts/78360/application-of-artificial-neural-networks-to-adaptive-speed-control-under-arduino" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78360.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">363</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">5564</span> Some Results on Cluster Synchronization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahed%20Vahedi">Shahed Vahedi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Salmi%20Md%20Noorani"> Mohd Salmi Md Noorani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates cluster synchronization phenomena between community networks. We focus on the situation where a variety of dynamics occur in the clusters. In particular, we show that different synchronization states simultaneously occur between the networks. The controller is designed having an adaptive control gain, and theoretical results are derived via Lyapunov stability. Simulations on well-known dynamical systems are provided to elucidate our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cluster%20synchronization" title="cluster synchronization">cluster synchronization</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20control" title=" adaptive control"> adaptive control</a>, <a href="https://publications.waset.org/abstracts/search?q=community%20network" title=" community network"> community network</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/28916/some-results-on-cluster-synchronization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28916.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">475</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">5563</span> Genetic Algorithm Based Node Fault Detection and Recovery in Distributed Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Nalini">N. Nalini</a>, <a href="https://publications.waset.org/abstracts/search?q=Lokesh%20B.%20Bhajantri"> Lokesh B. Bhajantri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Distributed Sensor Networks, the sensor nodes are prone to failure due to energy depletion and some other reasons. In this regard, fault tolerance of network is essential in distributed sensor environment. Energy efficiency, network or topology control and fault-tolerance are the most important issues in the development of next-generation Distributed Sensor Networks (DSNs). This paper proposes a node fault detection and recovery using Genetic Algorithm (GA) in DSN when some of the sensor nodes are faulty. The main objective of this work is to provide fault tolerance mechanism which is energy efficient and responsive to network using GA, which is used to detect the faulty nodes in the network based on the energy depletion of node and link failure between nodes. The proposed fault detection model is used to detect faults at node level and network level faults (link failure and packet error). Finally, the performance parameters for the proposed scheme are evaluated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20sensor%20networks" title="distributed sensor networks">distributed sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection%20and%20recovery" title=" fault detection and recovery"> fault detection and recovery</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20technology" title=" information technology"> information technology</a> </p> <a href="https://publications.waset.org/abstracts/8901/genetic-algorithm-based-node-fault-detection-and-recovery-in-distributed-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8901.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">452</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">5562</span> Optimal Planning of Dispatchable Distributed Generators for Power Loss Reduction in Unbalanced Distribution Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20M.%20Othman">Mahmoud M. Othman</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20G.%20Hegazy"> Y. G. Hegazy</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Y.%20Abdelaziz"> A. Y. Abdelaziz </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title="distributed generation">distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20approach" title=" heuristic approach"> heuristic approach</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=planning" title=" planning"> planning</a> </p> <a href="https://publications.waset.org/abstracts/31208/optimal-planning-of-dispatchable-distributed-generators-for-power-loss-reduction-in-unbalanced-distribution-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31208.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">525</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">5561</span> A Hybrid Distributed Algorithm for Solving Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a distributed hybrid algorithm is proposed for solving the job shop scheduling problem. The suggested method executes different artificial neural networks, heuristics and meta-heuristics simultaneously on more than one machine. The neural networks are used to control the constraints of the problem while the meta-heuristics search the global space and the heuristics are used to prevent the premature convergence. To attain an efficient distributed intelligent method for solving big and distributed job shop scheduling problems, Apache Spark and Hadoop frameworks are used. In the algorithm implementation and design steps, new approaches are applied. Comparison between the proposed algorithm and other efficient algorithms from the literature shows its efficiency, which is able to solve large size problems in short time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20algorithms" title="distributed algorithms">distributed algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Apache%20Spark" title=" Apache Spark"> Apache Spark</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title=" Hadoop"> Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a> </p> <a href="https://publications.waset.org/abstracts/72320/a-hybrid-distributed-algorithm-for-solving-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72320.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">387</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">5560</span> Diffusion Adaptation Strategies for Distributed Estimation Based on the Family of Affine Projection Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Shams%20Esfand%20Abadi">Mohammad Shams Esfand Abadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Ranjbar"> Mohammad Ranjbar</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Ebrahimpour"> Reza Ebrahimpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work presents the distributed processing solution problem in a diffusion network based on the adapt then combine (ATC) and combine then adapt (CTA)selective partial update normalized least mean squares (SPU-NLMS) algorithms. Also, we extend this approach to dynamic selection affine projection algorithm (DS-APA) and ATC-DS-APA and CTA-DS-APA are established. The purpose of ATC-SPU-NLMS and CTA-SPU-NLMS algorithm is to reduce the computational complexity by updating the selected blocks of weight coefficients at every iteration. In CTA-DS-APA and ATC-DS-APA, the number of the input vectors is selected dynamically. Diffusion cooperation strategies have been shown to provide good performance based on these algorithms. The good performance of introduced algorithm is illustrated with various experimental results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=selective%20partial%20update" title="selective partial update">selective partial update</a>, <a href="https://publications.waset.org/abstracts/search?q=affine%20projection" title=" affine projection"> affine projection</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20selection" title=" dynamic selection"> dynamic selection</a>, <a href="https://publications.waset.org/abstracts/search?q=diffusion" title=" diffusion"> diffusion</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks" title=" adaptive distributed networks"> adaptive distributed networks</a> </p> <a href="https://publications.waset.org/abstracts/20231/diffusion-adaptation-strategies-for-distributed-estimation-based-on-the-family-of-affine-projection-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20231.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">707</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">5559</span> MULTI-FLGANs: Multi-Distributed Adversarial Networks for Non-Independent and Identically Distributed Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akash%20Amalan">Akash Amalan</a>, <a href="https://publications.waset.org/abstracts/search?q=Rui%20Wang"> Rui Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yanqi%20Qiao"> Yanqi Qiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Emmanouil%20Panaousis"> Emmanouil Panaousis</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaitai%20Liang"> Kaitai Liang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Federated learning is an emerging concept in the domain of distributed machine learning. This concept has enabled General Adversarial Networks (GANs) to benefit from the rich distributed training data while preserving privacy. However, in a non-IID setting, current federated GAN architectures are unstable, struggling to learn the distinct features, and vulnerable to mode collapse. In this paper, we propose an architecture MULTI-FLGAN to solve the problem of low-quality images, mode collapse, and instability for non-IID datasets. Our results show that MULTI-FLGAN is four times as stable and performant (i.e., high inception score) on average over 20 clients compared to baseline FLGAN. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=federated%20learning" title="federated learning">federated learning</a>, <a href="https://publications.waset.org/abstracts/search?q=generative%20adversarial%20network" title=" generative adversarial network"> generative adversarial network</a>, <a href="https://publications.waset.org/abstracts/search?q=inference%20attack" title=" inference attack"> inference attack</a>, <a href="https://publications.waset.org/abstracts/search?q=non-IID%20data%20distribution" title=" non-IID data distribution"> non-IID data distribution</a> </p> <a href="https://publications.waset.org/abstracts/152877/multi-flgans-multi-distributed-adversarial-networks-for-non-independent-and-identically-distributed-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152877.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">158</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">5558</span> A Novel Probablistic Strategy for Modeling Photovoltaic Based Distributed Generators </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Engy%20A.%20Mohamed">Engy A. Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20G.%20Hegazy"> Y. G. Hegazy </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a novel algorithm for modeling photovoltaic based distributed generators for the purpose of optimal planning of distribution networks. The proposed algorithm utilizes sequential Monte Carlo method in order to accurately consider the stochastic nature of photovoltaic based distributed generators. The proposed algorithm is implemented in MATLAB environment and the results obtained are presented and discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=comulative%20distribution%20function" title="comulative distribution function">comulative distribution function</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title=" distributed generation"> distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo" title=" Monte Carlo"> Monte Carlo</a> </p> <a href="https://publications.waset.org/abstracts/28459/a-novel-probablistic-strategy-for-modeling-photovoltaic-based-distributed-generators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28459.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">584</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">5557</span> Identifying the Gap between Adaptive Clothing Consumers and Brands</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lucky%20Farha">Lucky Farha</a>, <a href="https://publications.waset.org/abstracts/search?q=Martha%20L.%20Hall"> Martha L. Hall</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The current adaptive clothing brands are limited in numbers and specific categories. This study explores clothing challenges for children with Down syndrome and factors that influence their perception of adaptive clothing brands. Another aim of this study was to explore brands' challenges in the adaptive business and factors that influence their perceptions towards the adaptive market. In order to determine the market barriers affecting adaptive target market needs, the researcher applied Technology Acceptance Model. After interviewing and surveying parents/caregivers having children with Down syndrome and current adaptive brands, the results found education as the significant gap in the adaptive clothing market yet to be overcome. Based on the finding, several recommendations were suggested to improve the current barriers in the adaptive clothing market. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20fashion" title="adaptive fashion">adaptive fashion</a>, <a href="https://publications.waset.org/abstracts/search?q=disability" title=" disability"> disability</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20clothing" title=" functional clothing"> functional clothing</a>, <a href="https://publications.waset.org/abstracts/search?q=clothing%20needs%20assessment" title=" clothing needs assessment"> clothing needs assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=down%20syndrome" title=" down syndrome"> down syndrome</a>, <a href="https://publications.waset.org/abstracts/search?q=clothing%20challenge" title=" clothing challenge"> clothing challenge</a> </p> <a href="https://publications.waset.org/abstracts/150986/identifying-the-gap-between-adaptive-clothing-consumers-and-brands" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150986.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">144</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">5556</span> Novel Adaptive Radial Basis Function Neural Networks Based Approach for Short-Term Load Forecasting of Jordanian Power Grid </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eyad%20Almaita">Eyad Almaita</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a novel adaptive Radial Basis Function Neural Networks (RBFNN) algorithm is used to forecast the hour by hour electrical load demand in Jordan. A small and effective RBFNN model is used to forecast the hourly total load demand based on a small number of features. These features are; the load in the previous day, the load in the same day in the previous week, the temperature in the same hour, the hour number, the day number, and the day type. The proposed adaptive RBFNN model can enhance the reliability of the conventional RBFNN after embedding the network in the system. This is achieved by introducing an adaptive algorithm that allows the change of the weights of the RBFNN after the training process is completed, which will eliminates the need to retrain the RBFNN model again. The data used in this paper is real data measured by National Electrical Power co. (Jordan). The data for the period Jan./2012-April/2013 is used train the RBFNN models and the data for the period May/2013- Sep. /2013 is used to validate the models effectiveness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load%20forecasting" title="load forecasting">load forecasting</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20neural%20network" title=" adaptive neural network"> adaptive neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=radial%20basis%20function" title=" radial basis function"> radial basis function</a>, <a href="https://publications.waset.org/abstracts/search?q=short-term" title=" short-term"> short-term</a>, <a href="https://publications.waset.org/abstracts/search?q=electricity%20consumption" title=" electricity consumption"> electricity consumption</a> </p> <a href="https://publications.waset.org/abstracts/40294/novel-adaptive-radial-basis-function-neural-networks-based-approach-for-short-term-load-forecasting-of-jordanian-power-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40294.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">344</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">5555</span> End-to-End Control and Management of Multi-AS Virtual Service Networks Using SDN and Autonomic Computing Architecture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yong%20Xue">Yong Xue</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20A.%20Menasc%C3%A9"> Daniel A. Menascé</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automated and end-to-end network resource management and provisioning for virtual service networks in a multiple autonomous systems (a.k.a multi-AS) environment is a challenging and open problem. This paper proposes a novel, scalable and interoperable high-level architecture that incorporates a number of emerging enabling technologies including Software Defined Network (SDN), Network Function Virtualization (NFV), Service Oriented Architecture (SOA), and Autonomic Computing. The proposed architecture can be used to not only automate network resource management and provisioning for virtual service networks across multiple autonomous substrate networks, but also provide an adaptive capability for achieving optimal network resource management and maintaining network-level end-to-end network performance as well. The paper argues that this SDN and autonomic computing based architecture lays a solid foundation that can facilitate the development of the future Internet based on the pluralistic paradigm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=virtual%20network" title="virtual network">virtual network</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20defined%20network" title=" software defined network"> software defined network</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20service%20network" title=" virtual service network"> virtual service network</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20resource%20management" title=" adaptive resource management"> adaptive resource management</a>, <a href="https://publications.waset.org/abstracts/search?q=SOA" title=" SOA"> SOA</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-AS" title=" multi-AS"> multi-AS</a>, <a href="https://publications.waset.org/abstracts/search?q=inter-domain" title=" inter-domain"> inter-domain</a> </p> <a href="https://publications.waset.org/abstracts/14547/end-to-end-control-and-management-of-multi-as-virtual-service-networks-using-sdn-and-autonomic-computing-architecture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14547.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">531</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">5554</span> An Experimental Testbed Using Virtual Containers for Distributed Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Parth%20Patel">Parth Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Zhu"> Ying Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Distributed systems have become ubiquitous, and they continue their growth through a range of services. With advances in resource virtualization technology such as Virtual Machines (VM) and software containers, developers no longer require high-end servers to test and develop distributed software. Even in commercial production, virtualization has streamlined the process of rapid deployment and service management. This paper introduces a distributed systems testbed that utilizes virtualization to enable distributed systems development on commodity computers. The testbed can be used to develop new services, implement theoretical distributed systems concepts for understanding, and experiment with virtual network topologies. We show its versatility through two case studies that utilize the testbed for implementing a theoretical algorithm and developing our own methodology to find high-risk edges. The results of using the testbed for these use cases have proven the effectiveness and versatility of this testbed across a range of scenarios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title="distributed systems">distributed systems</a>, <a href="https://publications.waset.org/abstracts/search?q=experimental%20testbed" title=" experimental testbed"> experimental testbed</a>, <a href="https://publications.waset.org/abstracts/search?q=peer-to-peer%20networks" title=" peer-to-peer networks"> peer-to-peer networks</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20container%20technology" title=" virtual container technology"> virtual container technology</a> </p> <a href="https://publications.waset.org/abstracts/133579/an-experimental-testbed-using-virtual-containers-for-distributed-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133579.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">146</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5553</span> Contention Window Adjustment in IEEE 802.11-based Industrial Wireless Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Maadani">Mohsen Maadani</a>, <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Ahmad%20Motamedi"> Seyed Ahmad Motamedi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of wireless technology in industrial networks has gained vast attraction in recent years. In this paper, we have thoroughly analyzed the effect of contention window (CW) size on the performance of IEEE 802.11-based industrial wireless networks (IWN), from delay and reliability perspective. Results show that the default values of CWmin, CWmax, and retry limit (RL) are far from the optimum performance due to the industrial application characteristics, including short packet and noisy environment. An adaptive CW algorithm (payload-dependent) has been proposed to minimize the average delay. Finally a simple, but effective CW and RL setting has been proposed for industrial applications which outperforms the minimum-average-delay solution from maximum delay and jitter perspective, at the cost of a little higher average delay. Simulation results show an improvement of up to 20%, 25%, and 30% in average delay, maximum delay and jitter respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=average%20delay" title="average delay">average delay</a>, <a href="https://publications.waset.org/abstracts/search?q=contention%20window" title=" contention window"> contention window</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20coordination%20function%20%28DCF%29" title=" distributed coordination function (DCF)"> distributed coordination function (DCF)</a>, <a href="https://publications.waset.org/abstracts/search?q=jitter" title=" jitter"> jitter</a>, <a href="https://publications.waset.org/abstracts/search?q=industrial%20wireless%20network%20%28IWN%29" title=" industrial wireless network (IWN)"> industrial wireless network (IWN)</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20delay" title=" maximum delay"> maximum delay</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability" title=" reliability"> reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=retry%20limit" title=" retry limit"> retry limit</a> </p> <a href="https://publications.waset.org/abstracts/36488/contention-window-adjustment-in-ieee-80211-based-industrial-wireless-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36488.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">5552</span> Enhancing Knowledge Graph Convolutional Networks with Structural Adaptive Receptive Fields for Improved Node Representation and Information Aggregation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zheng%20Zhihao">Zheng Zhihao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, Knowledge Graph Framework Network (KGCN) has developed powerful capabilities in knowledge representation and reasoning tasks. However, traditional KGCN often uses a fixed weight mechanism when aggregating information, failing to make full use of rich structural information, resulting in a certain expression ability of node representation, and easily causing over-smoothing problems. In order to solve these challenges, the paper proposes an new graph neural network model called KGCN-STAR (Knowledge Graph Convolutional Network with Structural Adaptive Receptive Fields). This model dynamically adjusts the perception of each node by introducing a structural adaptive receptive field. wild range, and a subgraph aggregator is designed to capture local structural information more effectively. Experimental results show that KGCN-STAR shows significant performance improvement on multiple knowledge graph data sets, especially showing considerable capabilities in the task of representation learning of complex structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=knowledge%20graph" title="knowledge graph">knowledge graph</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20neural%20networks" title=" graph neural networks"> graph neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20adaptive%20receptive%20fields" title=" structural adaptive receptive fields"> structural adaptive receptive fields</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20aggregation" title=" information aggregation"> information aggregation</a> </p> <a href="https://publications.waset.org/abstracts/191048/enhancing-knowledge-graph-convolutional-networks-with-structural-adaptive-receptive-fields-for-improved-node-representation-and-information-aggregation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191048.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">33</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">5551</span> Investigation of Chord Protocol in Peer to Peer Wireless Mesh Network with Mobility</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Prasanna%20Murali%20Krishna">P. Prasanna Murali Krishna</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20V.%20Subramanyam"> M. V. Subramanyam</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Satya%20Prasad"> K. Satya Prasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> File sharing in networks are generally achieved using Peer-to-Peer (P2P) applications. Structured P2P approaches are widely used in adhoc networks due to its distributed and scalability features. Efficient mechanisms are required to handle the huge amount of data distributed to all peers. The intrinsic characteristics of P2P system makes for easier content distribution when compared to client-server architecture. All the nodes in a P2P network act as both client and server, thus, distributing data takes lesser time when compared to the client-server method. CHORD protocol is a resource routing based where nodes and data items are structured into a 1- dimensional ring. The structured lookup algorithm of Chord is advantageous for distributed P2P networking applications. Though, structured approach improves lookup performance in a high bandwidth wired network it could contribute to unnecessary overhead in overlay networks leading to degradation of network performance. In this paper, the performance of existing CHORD protocol on Wireless Mesh Network (WMN) when nodes are static and dynamic is investigated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20mesh%20network%20%28WMN%29" title="wireless mesh network (WMN)">wireless mesh network (WMN)</a>, <a href="https://publications.waset.org/abstracts/search?q=structured%20P2P%0D%0Anetworks" title=" structured P2P networks"> structured P2P networks</a>, <a href="https://publications.waset.org/abstracts/search?q=peer%20to%20peer%20resource%20sharing" title=" peer to peer resource sharing"> peer to peer resource sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=CHORD%20Protocol" title=" CHORD Protocol"> CHORD Protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=DHT" title=" DHT"> DHT</a> </p> <a href="https://publications.waset.org/abstracts/34950/investigation-of-chord-protocol-in-peer-to-peer-wireless-mesh-network-with-mobility" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34950.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">480</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">5550</span> Mobility Management via Software Defined Networks (SDN) in Vehicular Ad Hoc Networks (VANETs)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Haider">Bilal Haider</a>, <a href="https://publications.waset.org/abstracts/search?q=Farhan%20Aadil"> Farhan Aadil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A Vehicular Ad hoc Network (VANET) provides various services to end-users traveling on the road at high speeds. However, this high-speed mobility of mobile nodes can cause frequent service disruptions. Various mobility management protocols exist for managing node mobility, but due to their centralized nature, they tend to suffer in the VANET environment. In this research, we proposed a distributed mobility management protocol using software-defined networks (SDN) for VANETs. Instead of relying on a centralized mobility anchor, the mobility functionality is distributed at multiple infrastructural nodes. The protocol is based on the classical Proxy Mobile IP version 6 (PMIPv6). It is evident from simulation results that this work has improved the network performance with respect to nodes throughput, delay, and packet loss. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SDN" title="SDN">SDN</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=mobility%20management" title=" mobility management"> mobility management</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/147701/mobility-management-via-software-defined-networks-sdn-in-vehicular-ad-hoc-networks-vanets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147701.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">170</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">5549</span> Overview of Adaptive Spline interpolation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rongli%20Gai">Rongli Gai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhiyuan%20Chang"> Zhiyuan Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> At this stage, in view of various situations in the interpolation process, most researchers use self-adaptation to adjust the interpolation process, which is also one of the current and future research hotspots in the field of CNC machining. In the interpolation process, according to the overview of the spline curve interpolation algorithm, the adaptive analysis is carried out from the factors affecting the interpolation process. The adaptive operation is reflected in various aspects, such as speed, parameters, errors, nodes, feed rates, random Period, sensitive point, step size, curvature, adaptive segmentation, adaptive optimization, etc. This paper will analyze and summarize the research of adaptive imputation in the direction of the above factors affecting imputation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20algorithm" title="adaptive algorithm">adaptive algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=CNC%20machining" title=" CNC machining"> CNC machining</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation%20constraints" title=" interpolation constraints"> interpolation constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=spline%20curve%20interpolation" title=" spline curve interpolation"> spline curve interpolation</a> </p> <a href="https://publications.waset.org/abstracts/147139/overview-of-adaptive-spline-interpolation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147139.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">205</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">5548</span> Advanced Simulation and Enhancement for Distributed and Energy Efficient Scheduling for IEEE802.11s Wireless Enhanced Distributed Channel Access Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fisayo%20G.%20Ojo">Fisayo G. Ojo</a>, <a href="https://publications.waset.org/abstracts/search?q=Shamala%20K.%20Subramaniam"> Shamala K. Subramaniam</a>, <a href="https://publications.waset.org/abstracts/search?q=Zuriati%20Ahmad%20Zukarnain"> Zuriati Ahmad Zukarnain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As technology is advancing and wireless applications are becoming dependable sources, while the physical layer of the applications are been embedded into tiny layer, so the more the problem on energy efficiency and consumption. This paper reviews works done in recent years in wireless applications and distributed computing, we discovered that applications are becoming dependable, and resource allocation sharing with other applications in distributed computing. Applications embedded in distributed system are suffering from power stability and efficiency. In the reviews, we also prove that discrete event simulation has been left behind untouched and not been adapted into distributed system as a simulation technique in scheduling of each event that took place in the development of distributed computing applications. We shed more lights on some researcher proposed techniques and results in our reviews to prove the unsatisfactory results, and to show that more work still have to be done on issues of energy efficiency in wireless applications, and congestion in distributed computing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20event%20simulation%20%28DES%29" title="discrete event simulation (DES)">discrete event simulation (DES)</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20computing" title=" distributed computing"> distributed computing</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20efficiency%20%28EE%29" title=" energy efficiency (EE)"> energy efficiency (EE)</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20of%20things%20%28IOT%29" title=" internet of things (IOT)"> internet of things (IOT)</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20of%20service%20%28QOS%29" title=" quality of service (QOS)"> quality of service (QOS)</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20equipment%20%28UE%29" title=" user equipment (UE)"> user equipment (UE)</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20mesh%20network%20%28WMN%29" title=" wireless mesh network (WMN)"> wireless mesh network (WMN)</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network%20%28wsn%29" title=" wireless sensor network (wsn)"> wireless sensor network (wsn)</a>, <a href="https://publications.waset.org/abstracts/search?q=worldwide%20interoperability%20for%20microwave%20access%20x%20%28WiMAX%29" title=" worldwide interoperability for microwave access x (WiMAX)"> worldwide interoperability for microwave access x (WiMAX)</a> </p> <a href="https://publications.waset.org/abstracts/98991/advanced-simulation-and-enhancement-for-distributed-and-energy-efficient-scheduling-for-ieee80211s-wireless-enhanced-distributed-channel-access-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98991.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">192</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">5547</span> Condition Monitoring of Railway Earthworks using Distributed Rayleigh Sensing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrew%20Hall">Andrew Hall</a>, <a href="https://publications.waset.org/abstracts/search?q=Paul%20Clarkson"> Paul Clarkson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Climate change is predicted to increase the number of extreme weather events intensifying the strain on Railway Earthworks. This paper describes the use of Distributed Rayleigh Sensing to monitor low frequency activity on a vulnerable earthworks sectionprone to landslides alongside a railway line in Northern Spain. The vulnerable slope is instrumented with conventional slope stability sensors allowing an assessment to be conducted of the application of Distributed Rayleigh Sensing as an earthwork condition monitoring tool to enhance the resilience of railway networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=condition%20monitoring" title="condition monitoring">condition monitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=railway%20earthworks" title=" railway earthworks"> railway earthworks</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20rayleigh%20sensing" title=" distributed rayleigh sensing"> distributed rayleigh sensing</a>, <a href="https://publications.waset.org/abstracts/search?q=climate%20change" title=" climate change"> climate change</a> </p> <a href="https://publications.waset.org/abstracts/141052/condition-monitoring-of-railway-earthworks-using-distributed-rayleigh-sensing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141052.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">206</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5546</span> The Primitive Code-Level Design Patterns for Distributed Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bing%20Li">Bing Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The primitive code-level design patterns (PDP) are the rudimentary programming elements to develop any distributed systems in the generic distributed programming environment, GreatFree. The PDP works with the primitive distributed application programming interfaces (PDA), the distributed modeling, and the distributed concurrency for scaling-up. They not only hide developers from underlying technical details but also support sufficient adaptability to a variety of distributed computing environments. Programming with them, the simplest distributed system, the lightweight messaging two-node client/server (TNCS) system, is constructed rapidly with straightforward and repeatable behaviors, copy-paste-replace (CPR). As any distributed systems are made up of the simplest ones, those PDAs, as well as the PDP, are generic for distributed programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=primitive%20APIs" title="primitive APIs">primitive APIs</a>, <a href="https://publications.waset.org/abstracts/search?q=primitive%20code-level%20design%20patterns" title=" primitive code-level design patterns"> primitive code-level design patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=generic%20distributed%20programming" title=" generic distributed programming"> generic distributed programming</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title=" distributed systems"> distributed systems</a>, <a href="https://publications.waset.org/abstracts/search?q=highly%20patterned%20development%20environment" title=" highly patterned development environment"> highly patterned development environment</a>, <a href="https://publications.waset.org/abstracts/search?q=messaging" title=" messaging"> messaging</a> </p> <a href="https://publications.waset.org/abstracts/135687/the-primitive-code-level-design-patterns-for-distributed-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/135687.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">191</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">5545</span> The Adaptive Properties of the Strategic Assurance System of the National Economy Sustainability to the Economic Security Threats</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Badri%20Gechbaia">Badri Gechbaia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Adaptive management as a fundamental element of the concept of the assurance of economy`s sustainability to the economic security of the system-synergetic type has been considered. It has been proved that the adaptive sustainable development is a transitional phase from the extensive one and later on from the rapid growth to the sustainable development. It has been determined that the adaptive system of the strategic assurance of the sustainability of the economy to the economic security threats is formed on the principles of the domination in its complex of the subsystems with weightier adaptive characteristics that negate the destructive influence of external and internal environmental factors on the sustainability of the national economy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20management" title="adaptive management">adaptive management</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20properties" title=" adaptive properties"> adaptive properties</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20security" title=" economic security"> economic security</a>, <a href="https://publications.waset.org/abstracts/search?q=strategic%20assurance" title=" strategic assurance "> strategic assurance </a> </p> <a href="https://publications.waset.org/abstracts/35350/the-adaptive-properties-of-the-strategic-assurance-system-of-the-national-economy-sustainability-to-the-economic-security-threats" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35350.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">507</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">5544</span> Pareto System of Optimal Placement and Sizing of Distributed Generation in Radial Distribution Networks Using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sani%20M.%20Lawal">Sani M. Lawal</a>, <a href="https://publications.waset.org/abstracts/search?q=Idris%20Musa"> Idris Musa</a>, <a href="https://publications.waset.org/abstracts/search?q=Aliyu%20D.%20Usman"> Aliyu D. Usman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Pareto approach of optimal solutions in a search space that evolved in multi-objective optimization problems is adopted in this paper, which stands for a set of solutions in the search space. This paper aims at presenting an optimal placement of Distributed Generation (DG) in radial distribution networks with an optimal size for minimization of power loss and voltage deviation as well as maximizing voltage profile of the networks. And these problems are formulated using particle swarm optimization (PSO) as a constraint nonlinear optimization problem with both locations and sizes of DG being continuous. The objective functions adopted are the total active power loss function and voltage deviation function. The multiple nature of the problem, made it necessary to form a multi-objective function in search of the solution that consists of both the DG location and size. The proposed PSO algorithm is used to determine optimal placement and size of DG in a distribution network. The output indicates that PSO algorithm technique shows an edge over other types of search methods due to its effectiveness and computational efficiency. The proposed method is tested on the standard IEEE 34-bus and validated with 33-bus test systems distribution networks. Results indicate that the sizing and location of DG are system dependent and should be optimally selected before installing the distributed generators in the system and also an improvement in the voltage profile and power loss reduction have been achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title="distributed generation">distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=pareto" title=" pareto"> pareto</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=power%20loss" title=" power loss"> power loss</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20deviation" title=" voltage deviation"> voltage deviation</a> </p> <a href="https://publications.waset.org/abstracts/54635/pareto-system-of-optimal-placement-and-sizing-of-distributed-generation-in-radial-distribution-networks-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54635.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">364</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">5543</span> Enhancing Organizational Performance through Adaptive Learning: A Case Study of ASML</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramin%20Shadani">Ramin Shadani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study introduces adaptive performance as a key organizational performance dimension and explores the relationship between the dimensions of a learning organization and adaptive performance. A survey was therefore conducted using the dimensions of the Learning Organization Questionnaire (DLOQ), followed by factor analysis and structural equation modeling in order to investigate the dynamics between learning organization practices and adaptive performance. Results confirm that adaptive performance is indeed one important dimension of organizational performance. The study also shows that perceived knowledge and adaptive performance mediate the positive relationship between the practices of a learning organization with perceived financial performance. We extend existing DLOQ research by demonstrating that adaptive performance, as a nonfinancial organizational learning outcome, has a significant impact on financial performance. Our study also provides additional validation of the measures of DLOQ's performance. Indeed, organizations need to take a glance at how the activities of learning and development can provide better overall improvement in performance, especially in enhancing adaptive capability. The study has provided requisite empirical support that activities of learning and development within organizations allow much-improved intangible performance outcomes, especially through adaptive performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20performance" title="adaptive performance">adaptive performance</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20learning" title=" continuous learning"> continuous learning</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20performance" title=" financial performance"> financial performance</a>, <a href="https://publications.waset.org/abstracts/search?q=leadership%20style" title=" leadership style"> leadership style</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20learning" title=" organizational learning"> organizational learning</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20performance" title=" organizational performance"> organizational performance</a> </p> <a href="https://publications.waset.org/abstracts/191916/enhancing-organizational-performance-through-adaptive-learning-a-case-study-of-asml" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191916.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">30</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=adaptive%20distributed%20networks&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&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=adaptive%20distributed%20networks&page=185">185</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&page=186">186</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=adaptive%20distributed%20networks&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>