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: locating dominating set</title> <meta name="description" content="Search results for: locating dominating set"> <meta name="keywords" content="locating dominating set"> <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="locating dominating set" 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="locating dominating set"> <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> 237</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: locating dominating set</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">237</span> Location-Domination on Join of Two Graphs and Their Complements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Analen%20Malnegro">Analen Malnegro</a>, <a href="https://publications.waset.org/abstracts/search?q=Gina%20Malacas"> Gina Malacas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dominating sets and related topics have been studied extensively in the past few decades. A dominating set of a graph G is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. Some problems involving detection devices can be modeled with graphs. Finding the minimum number of devices needed according to the type of devices and the necessity of locating the object gives rise to locating-dominating sets. A subset S of vertices of a graph G is called locating-dominating set, LD-set for short, if it is a dominating set and if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. The location-domination number λ(G) is the minimum cardinality of an LD-set for G. The complement of a graph G is a graph Ḡ on same vertices such that two distinct vertices of Ḡ are adjacent if and only if they are not adjacent in G. An LD-set of a graph G is global if it is an LD-set of both G and its complement Ḡ. The global location-domination number λg(G) is defined as the minimum cardinality of a global LD-set of G. In this paper, global LD-sets on the join of two graphs are characterized. Global location-domination numbers of these graphs are also determined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dominating%20set" title="dominating set">dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20locating-dominating%20set" title=" global locating-dominating set"> global locating-dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20location-domination%20number" title=" global location-domination number"> global location-domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=locating-dominating%20set" title=" locating-dominating set"> locating-dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=location-domination%20number" title=" location-domination number"> location-domination number</a> </p> <a href="https://publications.waset.org/abstracts/92257/location-domination-on-join-of-two-graphs-and-their-complements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92257.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">184</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">236</span> Some Codes for Variants in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sofia%20Ait%20Bouazza">Sofia Ait Bouazza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider the problem of finding a minimum identifying code in a graph. This problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications (fault diagnosis, location detection …). Suppose we have a building into which we need to place fire alarms. Suppose each alarm is designed so that it can detect any fire that starts either in the room in which it is located or in any room that shares a doorway with the room. We want to detect any fire that may occur or use the alarms which are sounding to not only to not only detect any fire but be able to tell exactly where the fire is located in the building. For reasons of cost, we want to use as few alarms as necessary. The first problem involves finding a minimum domination set of a graph. If the alarms are three state alarms capable of distinguishing between a fire in the same room as the alarm and a fire in an adjacent room, we are trying to find a minimum locating domination set. If the alarms are two state alarms that can only sound if there is a fire somewhere nearby, we are looking for a differentiating domination set of a graph. These three areas are the subject of much active research; we primarily focus on the third problem. An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most r≥1 from x. When only vertices out of the code are asked to be identified, we get the related concept of a locating dominating set. The problem of finding an identifying code (resp a locating dominating code) of minimum size is a NP-hard problem, even when the input graph belongs to a number of specific graph classes. Therefore, we study this problem in some restricted classes of undirected graphs like split graph, line graph and path in a directed graph. Then we present some results on the identifying code by giving an exact value of upper total locating domination and a total 2-identifying code in directed and undirected graph. Moreover we determine exact values of locating dominating code and edge identifying code of thin headless spider and locating dominating code of complete suns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=identiying%20codes" title="identiying codes">identiying codes</a>, <a href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set" title=" locating dominating set"> locating dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=split%20graphs" title=" split graphs"> split graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=thin%20headless%20spider" title=" thin headless spider"> thin headless spider</a> </p> <a href="https://publications.waset.org/abstracts/26380/some-codes-for-variants-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26380.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">235</span> Introduction to Transversal Pendant Domination in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nayaka%20%20%20S.R.">Nayaka S.R.</a>, <a href="https://publications.waset.org/abstracts/search?q=Putta%20%20Swamy"> Putta Swamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Purushothama%20%20S."> Purushothama S.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G=(V, E) be a graph. A dominating set S in G is a pendant dominating set if < S > contains a pendant vertex. A pendant dominating set of G which intersects every minimum pendant dominating set in G is called a transversal pendant dominating set. The minimum cardinality of a transversal pendant dominating set is called the transversal pendant domination number of G, denoted by γ_tp(G). In this paper, we begin to study this parameter. We calculate γ_tp(G) for some families of graphs. Furthermore, some bounds and relations with other domination parameters are obtained for γ_tp(G). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dominating%20set" title="dominating set">dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=pendant%20dominating%20set" title=" pendant dominating set"> pendant dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=pendant%20domination%20number" title=" pendant domination number"> pendant domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=transversal%20pendant%20dominating%20set" title=" transversal pendant dominating set"> transversal pendant dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=transversal%20pendant%20domination%20number" title=" transversal pendant domination number"> transversal pendant domination number</a> </p> <a href="https://publications.waset.org/abstracts/56600/introduction-to-transversal-pendant-domination-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56600.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">182</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">234</span> Upper Bounds on the Paired Domination Number of Cubic Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bin%20Sheng">Bin Sheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Changhong%20Lu"> Changhong Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by γₚᵣ(G), is the size of its smallest paired dominating set. Goddard and Henning conjectured that γₚᵣ(G) ≤ 4n/7 holds for every graph G with δ(G) ≥ 3, except the Petersen Graph. In this paper, we prove this conjecture for cubic graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=paired%20dominating%20set" title="paired dominating set">paired dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=upper%20bound" title=" upper bound"> upper bound</a>, <a href="https://publications.waset.org/abstracts/search?q=cubic%20graphs" title=" cubic graphs"> cubic graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=weight%20function" title=" weight function"> weight function</a> </p> <a href="https://publications.waset.org/abstracts/136021/upper-bounds-on-the-paired-domination-number-of-cubic-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136021.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">240</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">233</span> The End a Two-Party Hegemony</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mary%20Chidiebere%20Asoya">Mary Chidiebere Asoya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The dominance of two parties in multiparty democracies is a phenomenon that has come to be taken for granted. It has led to deepening corruption and redundant governance in many countries as politicians in the two dominating parties are aware of and exploit the fact that power must rotate between the two parties. As a result, politicians in two dominating parties can hobnob and frequently inter-marry between the two parties in a way that appears to suggest they are running a single dominating party. This paper explores what could end this hegemony by projecting a third party into the limelight. The argument is that long-standing frustration with corruption and increasing revolutionary tendencies could move voters away from the two dominating parties, ending the dominance of the parties. The case study is the February 25, 2023, Presidential elections in Nigeria. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=democracy" title="democracy">democracy</a>, <a href="https://publications.waset.org/abstracts/search?q=political%20party" title=" political party"> political party</a>, <a href="https://publications.waset.org/abstracts/search?q=election" title=" election"> election</a>, <a href="https://publications.waset.org/abstracts/search?q=nigeria" title=" nigeria"> nigeria</a>, <a href="https://publications.waset.org/abstracts/search?q=political%20science" title=" political science"> political science</a> </p> <a href="https://publications.waset.org/abstracts/167484/the-end-a-two-party-hegemony" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167484.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">92</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">232</span> Marriage Domination and Divorce Domination in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mark%20L.%20Caay">Mark L. Caay</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodolfo%20E.%20Maza"> Rodolfo E. Maza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the authors define two new variants of domination in graphs: the marriage and the divorce domination. A subset S ⊆ V (G) is said to be a marriage dominating set of G if for every e ∈ E(G), there exists a u ∈ V (G) such that u is one of the end vertex of e. A marriage dominating set S ⊆ V (G) is said to be a divorce dominating set of G if G\S is a disconnected graph. In this study, the authors present conditions of graphs for which the marriage and the divorce domination will take place and for which the two sets will coincide. Furthermore, the author gives the necessary and sufficient conditions for marriage domination to avoid divorce. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=domination" title="domination">domination</a>, <a href="https://publications.waset.org/abstracts/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=marriage%20domination" title=" marriage domination"> marriage domination</a>, <a href="https://publications.waset.org/abstracts/search?q=divorce%20domination" title=" divorce domination"> divorce domination</a>, <a href="https://publications.waset.org/abstracts/search?q=marriage%20theorem" title=" marriage theorem"> marriage theorem</a> </p> <a href="https://publications.waset.org/abstracts/192228/marriage-domination-and-divorce-domination-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192228.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">17</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">231</span> Minimum Vertices Dominating Set Algorithm for Secret Sharing Scheme </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20M.%20G.%20Al-Saidi">N. M. G. Al-Saidi</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20A.%20Kadhim"> K. A. Kadhim</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20A.%20Rajab"> N. A. Rajab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over the past decades, computer networks and data communication system has been developing fast, so, the necessity to protect a transmitted data is a challenging issue, and data security becomes a serious problem nowadays. A secret sharing scheme is a method which allows a master key to be distributed among a finite set of participants, in such a way that only certain authorized subsets of participants to reconstruct the original master key. To create a secret sharing scheme, many mathematical structures have been used; the most widely used structure is the one that is based on graph theory (graph access structure). Subsequently, many researchers tried to find efficient schemes based on graph access structures. In this paper, we propose a novel efficient construction of a perfect secret sharing scheme for uniform access structure. The dominating set of vertices in a regular graph is used for this construction in the following way; each vertex represents a participant and each minimum independent dominating subset represents a minimal qualified subset. Some relations between dominating set, graph order and regularity are achieved, and can be used to demonstrate the possibility of using dominating set to construct a secret sharing scheme. The information rate that is used as a measure for the efficiency of such systems is calculated to show that the proposed method has some improved values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme" title="secret sharing scheme">secret sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=dominating%20set" title=" dominating set"> dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20rate" title=" information rate"> information rate</a>, <a href="https://publications.waset.org/abstracts/search?q=access%20structure" title=" access structure"> access structure</a>, <a href="https://publications.waset.org/abstracts/search?q=rank" title=" rank"> rank</a> </p> <a href="https://publications.waset.org/abstracts/32399/minimum-vertices-dominating-set-algorithm-for-secret-sharing-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32399.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">230</span> Review of Cable Fault Locating Methods and Usage of VLF for Real Cases of High Resistance Fault Locating</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saadat%20Ali">Saadat Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Rashid%20Abdulla%20Ahmed%20Alshehhi"> Rashid Abdulla Ahmed Alshehhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cable faults are always probable and common during or after commissioning, causing significant delays and disrupting power distribution or transmission network, which is intolerable for the utilities&service providers being their reliability and business continuity measures. Therefore, the adoption of rapid localization & rectification methodology is the main concern for them. This paper explores the present techniques available for high voltage cable localization & rectification and which is preferable with regards to easier, faster, and also less harmful to cables. It also provides insight experience of high resistance fault locating by utilization of the Very Low Frequency (VLF) method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=faults" title="faults">faults</a>, <a href="https://publications.waset.org/abstracts/search?q=VLF" title=" VLF"> VLF</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20cases" title=" real cases"> real cases</a>, <a href="https://publications.waset.org/abstracts/search?q=cables" title=" cables"> cables</a> </p> <a href="https://publications.waset.org/abstracts/163853/review-of-cable-fault-locating-methods-and-usage-of-vlf-for-real-cases-of-high-resistance-fault-locating" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163853.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">112</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">229</span> Critical Terrain Slope Calculation for Locating Small Hydropower Plants</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Vrekos">C. Vrekos</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Evagelides"> C. Evagelides</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Samarinas"> N. Samarinas</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Arampatzis"> G. Arampatzis </a> </p> <p class="card-text"><strong>Abstract:</strong></p> As known, the water energy is a renewable and clean source of energy. Energy production from hydropower has been the first, and still is today a renewable source used to generate electricity. The optimal location and sizing of a small hydropower plant is a very important issue in engineering design which encourages investigation. The aim of this paper is to present a formula that can be utilized for locating the position of a small hydropower plant although there is a high dependence on economic, environmental, and social parameters. In this paper, the economic and technical side of the problem is considered. More specifically, there is a critical terrain slope that determines if the plant should be located at the end of the slope or not. Of course, this formula can be used for a first estimate and does not include detailed economic analysis. At the end, a case study is presented for the location of a small hydropower plant in order to demonstrate the validity of the proposed formula. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=critical%20terrain%20slope" title="critical terrain slope">critical terrain slope</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20analysis" title=" economic analysis"> economic analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=hydropower%20plant%20locating" title=" hydropower plant locating"> hydropower plant locating</a>, <a href="https://publications.waset.org/abstracts/search?q=renewable%20energy" title=" renewable energy"> renewable energy</a> </p> <a href="https://publications.waset.org/abstracts/84538/critical-terrain-slope-calculation-for-locating-small-hydropower-plants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84538.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">207</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">228</span> An Algorithm to Find Fractional Edge Domination Number and Upper Fractional Edge Domination Number of an Intuitionistic Fuzzy Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karunambigai%20Mevani%20Govindasamy">Karunambigai Mevani Govindasamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Sathishkumar%20Ayyappan"> Sathishkumar Ayyappan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we formulate the algorithm to find out the dominating function parameters of Intuitionistic Fuzzy Graphs(IFG). The methodology we adopted here is converting any physical problem into an IFG, and that has been transformed into Intuitionistic Fuzzy Matrix. Using Linear Program Solver software (LiPS), we found the defined parameters for the given IFG. We obtained these parameters for a path and cycle IFG. This study can be extended to other varieties of IFG. In particular, we obtain the definition of edge dominating function, minimal edge dominating function, fractional edge domination number (γ_if^') and upper fractional edge domination number (Γ_if^') of an intuitionistic fuzzy graph. Also, we formulated an algorithm which is appropriate to work on LiPS to find fractional edge domination number and upper fractional edge domination number of an IFG. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20edge%20domination%20number" title="fractional edge domination number">fractional edge domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20cycle" title=" intuitionistic fuzzy cycle"> intuitionistic fuzzy cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20graph" title=" intuitionistic fuzzy graph"> intuitionistic fuzzy graph</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20path" title=" intuitionistic fuzzy path"> intuitionistic fuzzy path</a> </p> <a href="https://publications.waset.org/abstracts/112004/an-algorithm-to-find-fractional-edge-domination-number-and-upper-fractional-edge-domination-number-of-an-intuitionistic-fuzzy-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112004.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">174</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">227</span> Localization of Near Field Radio Controlled Unintended Emitting Sources </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nurbanu%20Guzey">Nurbanu Guzey</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Jagannathan"> S. Jagannathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Locating radio controlled (RC) devices using their unintended emissions has a great interest considering security concerns. Weak nature of these emissions requires near field localization approach since it is hard to detect these signals in far field region of array. Instead of only angle estimation, near field localization also requires range estimation of the source which makes this method more complicated than far field models. Challenges of locating such devices in a near field region and real time environment are analyzed in this paper. An ESPRIT like near field localization scheme is utilized for both angle and range estimation. 1-D search with symmetric subarrays is provided. Two 7 element uniform linear antenna arrays (ULA) are employed for locating RC source. Experiment results of location estimation for one unintended emitting walkie-talkie for different positions are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=localization" title="localization">localization</a>, <a href="https://publications.waset.org/abstracts/search?q=angle%20of%20arrival%20%28AoA%29" title=" angle of arrival (AoA)"> angle of arrival (AoA)</a>, <a href="https://publications.waset.org/abstracts/search?q=range%20estimation" title=" range estimation"> range estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=array%20signal%20processing" title=" array signal processing"> array signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=ESPRIT" title=" ESPRIT"> ESPRIT</a>, <a href="https://publications.waset.org/abstracts/search?q=Uniform%20Linear%20Array%20%28ULA%29" title=" Uniform Linear Array (ULA)"> Uniform Linear Array (ULA)</a> </p> <a href="https://publications.waset.org/abstracts/22966/localization-of-near-field-radio-controlled-unintended-emitting-sources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22966.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">526</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">226</span> Introduction to Paired Domination Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Puttaswamy">Puttaswamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Anwar%20Alwardi"> Anwar Alwardi</a>, <a href="https://publications.waset.org/abstracts/search?q=Nayaka%20S.%20R."> Nayaka S. R.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=domination%20polynomial" title="domination polynomial">domination polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=paired%20dominating%20set" title=" paired dominating set"> paired dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=paired%20domination%20number" title=" paired domination number"> paired domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=paired%20domination%20polynomial" title=" paired domination polynomial"> paired domination polynomial</a> </p> <a href="https://publications.waset.org/abstracts/52964/introduction-to-paired-domination-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52964.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">232</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">225</span> Multiple Version of Roman Domination in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20C.%20Valenzuela-Tripodoro">J. C. Valenzuela-Tripodoro</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20%C3%81lvarez-Ru%C3%ADz"> P. Álvarez-Ruíz</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Mateos-Camacho"> M. A. Mateos-Camacho</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Cera"> M. Cera</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20roman%20domination%20function" title="multiple roman domination function">multiple roman domination function</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20problem%20np-complete" title=" decision problem np-complete"> decision problem np-complete</a>, <a href="https://publications.waset.org/abstracts/search?q=bounds" title=" bounds"> bounds</a>, <a href="https://publications.waset.org/abstracts/search?q=exact%20values" title=" exact values"> exact values</a> </p> <a href="https://publications.waset.org/abstracts/163297/multiple-version-of-roman-domination-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163297.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">108</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">224</span> A New Method Presentation for Locating Fault in Power Distribution Feeders Considering DG</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rahman%20Dashti">Rahman Dashti</a>, <a href="https://publications.waset.org/abstracts/search?q=Ehsan%20Gord"> Ehsan Gord</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an improved impedance based fault location method is proposed. In this method, online fault locating is performed using voltage and current information at the beginning of the feeder. Determining precise fault location in a short time increases reliability and efficiency of the system. The proposed method utilizes information about main component of voltage and current at the beginning of the feeder and distributed generation unit (DGU) in order to precisely locate different faults in acceptable time. To evaluate precision and accuracy of the proposed method, a 13-node is simulated and tested using MATLAB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distribution%20network" title="distribution network">distribution network</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20section%20determination" title=" fault section determination"> fault section determination</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation%20units" title=" distributed generation units"> distributed generation units</a>, <a href="https://publications.waset.org/abstracts/search?q=distribution%20protection%20equipment" title=" distribution protection equipment"> distribution protection equipment</a> </p> <a href="https://publications.waset.org/abstracts/41615/a-new-method-presentation-for-locating-fault-in-power-distribution-feeders-considering-dg" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41615.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">401</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">223</span> Microwave Security System in Museums: Design and Implementation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dalia%20Elsheakh">Dalia Elsheakh</a>, <a href="https://publications.waset.org/abstracts/search?q=Hala%20Elsadek"> Hala Elsadek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this paper is to propose a competitive microwave security system that can be applied with reasonable price at museums in Egypt, considering the priceless elements in 23 Egyptian museums countrywide and the lack of good recent security systems even in big ones. The system main goal is to detect valuable targets to ensure their presence in the pre-defined positions in order to protect them from being stolen. The system is based on real time microwave scanning for the required space volume through transmitting RF waves at consecutive angles and detecting the back scattered waves from required objects to detect their existence at pre-specified locations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microwave%20security%20system" title="microwave security system">microwave security system</a>, <a href="https://publications.waset.org/abstracts/search?q=object%20locating%20system" title=" object locating system"> object locating system</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20time%20locating%20system%20%28RTLS%29" title=" real time locating system (RTLS)"> real time locating system (RTLS)</a>, <a href="https://publications.waset.org/abstracts/search?q=antenna%20array" title=" antenna array"> antenna array</a>, <a href="https://publications.waset.org/abstracts/search?q=array%20electronic%20scanning" title=" array electronic scanning"> array electronic scanning</a> </p> <a href="https://publications.waset.org/abstracts/5673/microwave-security-system-in-museums-design-and-implementation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5673.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">349</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">222</span> The Influence of the Laws of Ergonomics on the Design of High-Rise Buildings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Valery%20A.%20Aurov">Valery A. Aurov</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20D.%20Bausheva"> Maria D. Bausheva</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20V.%20Uliyanova"> Elena V. Uliyanova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problems of sustainability of contemporary high-rise buildings now demand an altogether new approach, which corresponds with the laws of dialectics. We should imply the principle “going from mega-object to the so called mezzo-object.” So the scientists have arrived at the conclusion that a contemporary “skyscraper” must not increase in height but develop horizontal space axes which unite a complex of high-rise buildings into a single composition. This is necessary both for safety issues and increasing skyscrapers’ functioning qualities. As a result, architects single out a quality unit in a dominating group of high-rise constructions and make a conclusion about the influence of visual fields on the designing parameters of this group. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design" title="design">design</a>, <a href="https://publications.waset.org/abstracts/search?q=high-rise%20buildings" title=" high-rise buildings"> high-rise buildings</a>, <a href="https://publications.waset.org/abstracts/search?q=skyscrapers" title=" skyscrapers"> skyscrapers</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20fields" title=" visual fields"> visual fields</a>, <a href="https://publications.waset.org/abstracts/search?q=dominating%20group" title=" dominating group"> dominating group</a>, <a href="https://publications.waset.org/abstracts/search?q=regulations" title=" regulations"> regulations</a>, <a href="https://publications.waset.org/abstracts/search?q=design%20recommendations" title=" design recommendations"> design recommendations</a> </p> <a href="https://publications.waset.org/abstracts/40840/the-influence-of-the-laws-of-ergonomics-on-the-design-of-high-rise-buildings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40840.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">373</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">221</span> Three Tier Indoor Localization System for Digital Forensics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dennis%20L.%20Owuor">Dennis L. Owuor</a>, <a href="https://publications.waset.org/abstracts/search?q=Okuthe%20P.%20Kogeda"> Okuthe P. Kogeda</a>, <a href="https://publications.waset.org/abstracts/search?q=Johnson%20I.%20Agbinya"> Johnson I. Agbinya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile localization has attracted a great deal of attention recently due to the introduction of wireless networks. Although several localization algorithms and systems have been implemented and discussed in the literature, very few researchers have exploited the gap that exists between indoor localization, tracking, external storage of location information and outdoor localization for the purpose of digital forensics during and after a disaster. The contribution of this paper lies in the implementation of a robust system that is capable of locating, tracking mobile device users and store location information for both indoor and partially outdoor the cloud. The system can be used during disaster to track and locate mobile phone users. The developed system is a mobile application built based on Android, Hypertext Preprocessor (PHP), Cascading Style Sheets (CSS), JavaScript and MATLAB for the Android mobile users. Using Waterfall model of software development, we have implemented a three level system that is able to track, locate and store mobile device information in secure database (cloud) on almost a real time basis. The outcome of the study showed that the developed system is efficient with regard to the tracking and locating mobile devices. The system is also flexible, i.e. can be used in any building with fewer adjustments. Finally, the system is accurate for both indoor and outdoor in terms of locating and tracking mobile devices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=indoor%20localization" title="indoor localization">indoor localization</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20forensics" title=" digital forensics"> digital forensics</a>, <a href="https://publications.waset.org/abstracts/search?q=fingerprinting" title=" fingerprinting"> fingerprinting</a>, <a href="https://publications.waset.org/abstracts/search?q=tracking%20and%20cloud" title=" tracking and cloud"> tracking and cloud</a> </p> <a href="https://publications.waset.org/abstracts/65789/three-tier-indoor-localization-system-for-digital-forensics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65789.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">337</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">220</span> Institional Logics and Individual Actors: What Can an Organizational Change Agent Do? </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mira%C3%A7%20Sava%C5%9F%20Turhan">Miraç Savaş Turhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Dan%C4%B1%C5%9Fman"> Ali Danışman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> New institutional theorists in organization theory have used institutional logics perspective to explain the contradictory practices in modern western societies. Accordingly, distinct institutional logics are embedded in central institutions such as the market, state, democracy, family, and religion. Individual and organizational actors and their practices are restricted and guided by institutional logics in a particular field. Through this perspective, actors are assumed to have a situated, embedded, boundedly intentional, and adaptive role against the structure in social, cultural and political context. Since the early 1990's, increasing number of studies has attempted to explain the role of actors in creating, maintaining, and changing institutions. Yet, most of these studies have focused on organizational field-level actors, ignoring the role that can be played by individual actors within organizations. As a result, we have much information about what organizational field level actors can do, but relatively little knowledge about the ability of organizational change agents within organization in relation to institutional orders. This study is an attempt to find out how the ability of individual actors who attempt to change their organization is constrained and shaped by institutional logics dominating the field. We examine this issue in a private school in the Turkish Education field. We first describe dominating institutional logics in the Turkish Education field. Then we conducted in-depth interviews and content analysis in the school. The early results indicate that attempts and actions of organizational change agents are remarkably directed and shaped by the dominating institutional logics in the Turkish Education field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Institutional%20logics" title="Institutional logics">Institutional logics</a>, <a href="https://publications.waset.org/abstracts/search?q=individual%20actors" title=" individual actors"> individual actors</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20change" title=" organizational change"> organizational change</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20change%20agent" title=" organizational change agent"> organizational change agent</a> </p> <a href="https://publications.waset.org/abstracts/32967/institional-logics-and-individual-actors-what-can-an-organizational-change-agent-do" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32967.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">395</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">219</span> Observationally Constrained Estimates of Aerosol Indirect Radiative Forcing over Indian Ocean</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sofiya%20Rao">Sofiya Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=Sagnik%20Dey"> Sagnik Dey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Aerosol-cloud-precipitation interaction continues to be one of the largest sources of uncertainty in quantifying the aerosol climate forcing. The uncertainty is increasing from global to regional scale. This problem remains unresolved due to the large discrepancy in the representation of cloud processes in the climate models. Most of the studies on aerosol-cloud-climate interaction and aerosol-cloud-precipitation over Indian Ocean (like INDOEX, CAIPEEX campaign etc.) are restricted to either particular to one season or particular to one region. Here we developed a theoretical framework to quantify aerosol indirect radiative forcing using Moderate Resolution Imaging Spectroradiometer (MODIS) aerosol and cloud products of 15 years (2000-2015) period over the Indian Ocean. This framework relies on the observationally constrained estimate of the aerosol-induced change in cloud albedo. We partitioned the change in cloud albedo into the change in Liquid Water Path (LWP) and Effective Radius of Clouds (Reff) in response to an aerosol optical depth (AOD). Cloud albedo response to an increase in AOD is most sensitive in the range of LWP between 120-300 gm/m² for a range of Reff varying from 8-24 micrometer, which means aerosols are most sensitive to this range of LWP and Reff. Using this framework, aerosol forcing during a transition from indirect to semi-direct effect is also calculated. The outcome of this analysis shows best results over the Arabian Sea in comparison with the Bay of Bengal and the South Indian Ocean because of heterogeneity in aerosol spices over the Arabian Sea. Over the Arabian Sea during Winter Season the more absorbing aerosols are dominating, during Pre-monsoon dust (coarse mode aerosol particles) are more dominating. In winter and pre-monsoon majorly the aerosol forcing is more dominating while during monsoon and post-monsoon season meteorological forcing is more dominating. Over the South Indian Ocean, more or less same types of aerosol (Sea salt) are present. Over the Arabian Sea the Aerosol Indirect Radiative forcing are varying from -5 ± 4.5 W/m² for winter season while in other seasons it is reducing. The results provide observationally constrained estimates of aerosol indirect forcing in the Indian Ocean which can be helpful in evaluating the climate model performance in the context of such complex interactions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aerosol-cloud-precipitation%20interaction" title="aerosol-cloud-precipitation interaction">aerosol-cloud-precipitation interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=aerosol-cloud-climate%20interaction" title=" aerosol-cloud-climate interaction"> aerosol-cloud-climate interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=indirect%20radiative%20forcing" title=" indirect radiative forcing"> indirect radiative forcing</a>, <a href="https://publications.waset.org/abstracts/search?q=climate%20model" title=" climate model"> climate model</a> </p> <a href="https://publications.waset.org/abstracts/94163/observationally-constrained-estimates-of-aerosol-indirect-radiative-forcing-over-indian-ocean" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94163.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">175</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">218</span> Using GIS and AHP Model to Explore the Parking Problem in Khomeinishahr</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Davood%20Vatankhah">Davood Vatankhah</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Mokhtari%20Malekabadi"> Reza Mokhtari Malekabadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Saghaei"> Mohsen Saghaei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Function of urban transportation systems depends on the existence of the required infrastructures, appropriate placement of different components, and the cooperation of these components with each other. Establishing various neighboring parking spaces in city neighborhood in order to prevent long-term and inappropriate parking of cars in the allies is one of the most effective operations in reducing the crowding and density of the neighborhoods. Every place with a certain application attracts a number of daily travels which happen throughout the city. A large percentage of the people visiting these places go to these travels by their own cars; therefore, they need a space to park their cars. The amount of this need depends on the usage function and travel demand of the place. The study aims at investigating the spatial distribution of the public parking spaces, determining the effective factors in locating, and their combination in GIS environment in Khomeinishahr of Isfahan city. Ultimately, the study intends to create an appropriate pattern for locating parking spaces, determining the request for parking spaces of the traffic areas, choosing the proper places for providing the required public parking spaces, and also proposing new spots in order to promote quality and quantity aspects of the city in terms of enjoying public parking spaces. Regarding the method, the study is based on applied purpose and regarding nature, it is analytic-descriptive. The population of the study includes people of the center of Khomeinishahr which is located on Northwest of Isfahan having about 5000 hectares of geographic area and the population of 241318 people are in the center of Komeinishahr. In order to determine the sample size, Cochran formula was used and according to the population of 26483 people of the studied area, 231 questionnaires were used. Data analysis was carried out by usage of SPSS software and after estimating the required space for parking spaces, initially, the effective criteria in locating the public parking spaces are weighted by the usage of Analytic Hierarchical Process in the Arc GIS software. Then, appropriate places for establishing parking spaces were determined by fuzzy method of Order Weighted Average (OWA). The results indicated that locating of parking spaces in Khomeinishahr have not been carried out appropriately and per capita of the parking spaces is not desirable in relation to the population and request; therefore, in addition to the present parking lots, 1434 parking lots are needed in the area of the study for each day; therefore, there is not a logical proportion between parking request and the number of parking lots in Khomeinishahr. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GIS" title="GIS">GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=locating" title=" locating"> locating</a>, <a href="https://publications.waset.org/abstracts/search?q=parking" title=" parking"> parking</a>, <a href="https://publications.waset.org/abstracts/search?q=khomeinishahr" title=" khomeinishahr "> khomeinishahr </a> </p> <a href="https://publications.waset.org/abstracts/25857/using-gis-and-ahp-model-to-explore-the-parking-problem-in-khomeinishahr" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25857.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">308</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">217</span> Location Choice of Firms in an Unequal Length Streets Model: Game Theory Approach as an Extension of the Spoke Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kiumars%20Shahbazi">Kiumars Shahbazi</a>, <a href="https://publications.waset.org/abstracts/search?q=Salah%20Salimian"> Salah Salimian</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdolrahim%20Hashemi%20Dizaj"> Abdolrahim Hashemi Dizaj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Locating is one of the key elements in success and survival of industrial centers and has great impact on cost reduction of establishment and launching of various economic activities. In this study, streets with unequal length model have been used that is the classic extension of Spoke model; however with unlimited number of streets with uneven lengths. The results showed that the spoke model is a special case of streets with unequal length model. According to the results of this study, if the strategy of enterprises and firms is to select both price and location, there would be no balance in the game. Furthermore, increased length of streets leads to increased profit of enterprises and with increased number of streets, the enterprises choose locations that are far from center (the maximum differentiation), and the enterprises' output will decrease. Moreover, the enterprise production rate will incline toward zero when the number of streets goes to infinity, and complete competition outcome will be achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=locating" title="locating">locating</a>, <a href="https://publications.waset.org/abstracts/search?q=Nash%20equilibrium" title=" Nash equilibrium"> Nash equilibrium</a>, <a href="https://publications.waset.org/abstracts/search?q=streets%20with%20unequal%20length%20model" title=" streets with unequal length model"> streets with unequal length model</a>, <a href="https://publications.waset.org/abstracts/search?q=streets%20with%20unequal%20length%20model" title=" streets with unequal length model"> streets with unequal length model</a> </p> <a href="https://publications.waset.org/abstracts/102562/location-choice-of-firms-in-an-unequal-length-streets-model-game-theory-approach-as-an-extension-of-the-spoke-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102562.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">203</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">216</span> Finding out the Best Criteria for Locating the Best Place Resettling of Victims after the Earthquake: A Case Study for Tehran, Iran</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reyhaneh%20Saeedi">Reyhaneh Saeedi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Iran is a capable zone for the earthquake that follows the loss of lives and financial damages. To have sheltering for earthquake victims is one of the basic requirements although it is hard to select suitable places for temporary resettling after an earthquake happens. Before these kinds of disasters happen, the best places for resettling the victims must be designated. This matter is an important issue in disaster management and planning. Geospatial Information System(GIS) has a determining role in disaster management, it can determine the best places for temporary resettling after such a disaster. In this paper, the best criteria have been determined associated with their weights and buffers by use of research and questionnaire for locating the best places. In this paper, AHP method is used as decision model and to locate the best places for temporary resettling is done based on the selected criteria. Also, in this research are made the buffer layers of criteria and change them to the raster layers. Later on, the raster layers are multiplied on desired weights then, the results are added together. Finally, there are suitable places for resettling of victims by desired criteria by different colors with their optimum rate in ArcGIS software. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disaster%20management" title="disaster management">disaster management</a>, <a href="https://publications.waset.org/abstracts/search?q=temporary%20resettlement" title=" temporary resettlement"> temporary resettlement</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=criteria" title=" criteria"> criteria</a> </p> <a href="https://publications.waset.org/abstracts/25155/finding-out-the-best-criteria-for-locating-the-best-place-resettling-of-victims-after-the-earthquake-a-case-study-for-tehran-iran" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25155.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">293</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">215</span> Locating Potential Site for Biomass Power Plant Development in Central Luzon Philippines Using GIS-Based Suitability Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bryan%20M.%20Baltazar">Bryan M. Baltazar</a>, <a href="https://publications.waset.org/abstracts/search?q=Marjorie%20V.%20Remolador"> Marjorie V. Remolador</a>, <a href="https://publications.waset.org/abstracts/search?q=Klathea%20H.%20Sevilla"> Klathea H. Sevilla</a>, <a href="https://publications.waset.org/abstracts/search?q=Imee%20Saladaga"> Imee Saladaga</a>, <a href="https://publications.waset.org/abstracts/search?q=Loureal%20Camille%20Inocencio"> Loureal Camille Inocencio</a>, <a href="https://publications.waset.org/abstracts/search?q=Ma.%20Rosario%20Concepcion%20O.%20Ang"> Ma. Rosario Concepcion O. Ang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Biomass energy is a traditional source of sustainable energy, which has been widely used in developing countries. The Philippines, specifically Central Luzon, has an abundant source of biomass. Hence, it could supply abundant agricultural residues (rice husks), as feedstock in a biomass power plant. However, locating a potential site for biomass development is a complex process which involves different factors, such as physical, environmental, socio-economic, and risks that are usually diverse and conflicting. Moreover, biomass distribution is highly dispersed geographically. Thus, this study develops an integrated method combining Geographical Information Systems (GIS) and methods for energy planning; Multi-Criteria Decision Analysis (MCDA) and Analytical Hierarchy Process (AHP), for locating suitable site for biomass power plant development in Central Luzon, Philippines by considering different constraints and factors. Using MCDA, a three level hierarchy of factors and constraints was produced, with corresponding weights determined by experts by using AHP. Applying the results, a suitability map for Biomass power plant development in Central Luzon was generated. It showed that the central part of the region has the highest potential for biomass power plant development. It is because of the characteristics of the area such as the abundance of rice fields, with generally flat land surfaces, accessible roads and grid networks, and low risks to flooding and landslide. This study recommends the use of higher accuracy resource maps, and further analysis in selecting the optimum site for biomass power plant development that would account for the cost and transportation of biomass residues. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytic%20hierarchy%20process" title="analytic hierarchy process">analytic hierarchy process</a>, <a href="https://publications.waset.org/abstracts/search?q=biomass%20energy" title=" biomass energy"> biomass energy</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-criteria%20decision%20analysis" title=" multi-criteria decision analysis"> multi-criteria decision analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=site%20suitability%20analysis" title=" site suitability analysis"> site suitability analysis</a> </p> <a href="https://publications.waset.org/abstracts/40797/locating-potential-site-for-biomass-power-plant-development-in-central-luzon-philippines-using-gis-based-suitability-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40797.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">425</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">214</span> Optimization in Locating Firefighting Stations Using GIS Data and AHP Model; A Case Study on Arak City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Heydari">Hasan Heydari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent decades, locating urban services is one of the significant discussions in urban planning. Among these considerations, cities require more accurate planning in order to supply citizen needs, especially part of urban safety. In order to gain this goal, one of the main tasks of urban planners and managers is specifying suitable sites to locate firefighting stations. This study has been done to reach this purpose. Therefore effective criteria consist of coverage radius, population density, proximity to pathway network, land use (compatible and incompatible neighborhood) have been specified. After that, descriptive and local information of the criteria was provided and their layers were created in ArcGIS 9.3. Using Analytic Hierarchy Process (AHP) these criteria and their sub-criteria got the weights. These layers were classified regarding their weights and finally were overlaid by Index Overlay Model and provided the final site selection map for firefighting stations of Arak city. The results gained by analyzing in GIS environment indicate the existing fire station don’t cover the whole city sufficiently and some of the stations have established on the unsuitable sites. The output map indicates the best sites to locate firefighting stations of Arak. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=site-selection" title="site-selection">site-selection</a>, <a href="https://publications.waset.org/abstracts/search?q=firefighting%20stations" title=" firefighting stations"> firefighting stations</a>, <a href="https://publications.waset.org/abstracts/search?q=analytic%20hierarchy%20process%20%28AHP%29" title=" analytic hierarchy process (AHP)"> analytic hierarchy process (AHP)</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=index%20overlay%20model" title=" index overlay model"> index overlay model</a> </p> <a href="https://publications.waset.org/abstracts/39822/optimization-in-locating-firefighting-stations-using-gis-data-and-ahp-model-a-case-study-on-arak-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39822.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">348</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">213</span> Engineering of Stable and Improved Electrochemical Activities of Redox Dominating Charge Storage Electrode Materials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Girish%20Sambhaji%20Gund">Girish Sambhaji Gund</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The controlled nanostructure growth and its strong coupling with the current collector are key factors to achieve good electrochemical performance of faradaic-dominant electroactive materials. We employed binder-less and additive-free hydrothermal and physical vapor doping methods for the synthesis of nickel (Ni) and cobalt (Co) based compounds nanostructures (NiO, NiCo2O4, NiCo2S4) deposited on different conductive substrates such as carbon nanotube (CNT) on stainless steel, and reduced graphene oxide (rGO) and N-doped rGO on nickel foam (NF). The size and density of Ni- and Co-based compound nanostructures are controlled through the strong coupling with carbon allotropes on stainless steel and NF substrates. This controlled nanostructure of Ni- and Co-based compounds with carbon allotropes leads to stable faradaic electrochemical reactions at the material/current collector interface and within the electrode, which is consequence of strong coupling of nanostructure with functionalized carbon surface as a buffer layer. Thus, it is believed that the results provide the synergistic approaches to stabilize electrode materials physically and chemically, and hence overall electrochemical activity of faradaic dominating battery-type electrode materials through buffer layer engineering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=metal%20compounds" title="metal compounds">metal compounds</a>, <a href="https://publications.waset.org/abstracts/search?q=carbon%20allotropes" title=" carbon allotropes"> carbon allotropes</a>, <a href="https://publications.waset.org/abstracts/search?q=doping" title=" doping"> doping</a>, <a href="https://publications.waset.org/abstracts/search?q=electrochemicstry" title=" electrochemicstry"> electrochemicstry</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20supercapacitor" title=" hybrid supercapacitor"> hybrid supercapacitor</a> </p> <a href="https://publications.waset.org/abstracts/171622/engineering-of-stable-and-improved-electrochemical-activities-of-redox-dominating-charge-storage-electrode-materials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171622.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">79</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">212</span> Evaluation of a Data Fusion Algorithm for Detecting and Locating a Radioactive Source through Monte Carlo N-Particle Code Simulation and Experimental Measurement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hadi%20Ardiny">Hadi Ardiny</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Mohammad%20Beigzadeh"> Amir Mohammad Beigzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Through the utilization of a combination of various sensors and data fusion methods, the detection of potential nuclear threats can be significantly enhanced by extracting more information from different data. In this research, an experimental and modeling approach was employed to track a radioactive source by combining a surveillance camera and a radiation detector (NaI). To run this experiment, three mobile robots were utilized, with one of them equipped with a radioactive source. An algorithm was developed in identifying the contaminated robot through correlation between camera images and camera data. The computer vision method extracts the movements of all robots in the XY plane coordinate system, and the detector system records the gamma-ray count. The position of the robots and the corresponding count of the moving source were modeled using the MCNPX simulation code while considering the experimental geometry. The results demonstrated a high level of accuracy in finding and locating the target in both the simulation model and experimental measurement. The modeling techniques prove to be valuable in designing different scenarios and intelligent systems before initiating any experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nuclear%20threats" title="nuclear threats">nuclear threats</a>, <a href="https://publications.waset.org/abstracts/search?q=radiation%20detector" title=" radiation detector"> radiation detector</a>, <a href="https://publications.waset.org/abstracts/search?q=MCNPX%20simulation" title=" MCNPX simulation"> MCNPX simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=modeling%20techniques" title=" modeling techniques"> modeling techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20systems" title=" intelligent systems"> intelligent systems</a> </p> <a href="https://publications.waset.org/abstracts/167591/evaluation-of-a-data-fusion-algorithm-for-detecting-and-locating-a-radioactive-source-through-monte-carlo-n-particle-code-simulation-and-experimental-measurement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167591.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">211</span> Locating Speed Limit Signs for Highway Tunnel Entrance and Exit</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Han%20Bai">Han Bai</a>, <a href="https://publications.waset.org/abstracts/search?q=Lemei%20Yu"> Lemei Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Tong%20Zhang"> Tong Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Doudou%20Xie"> Doudou Xie</a>, <a href="https://publications.waset.org/abstracts/search?q=Liang%20Zhao"> Liang Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The brightness changes at highway tunnel entrance and exit have an effect on the physical and psychological conditions of drivers. It is more conducive for examining driving safety with quantitative analysis of the physical and psychological characteristics of drivers to determine the speed limit sign locations at the tunnel entrance and exit sections. In this study, the physical and psychological effects of tunnels on traffic sign recognition of drivers are analyzed; subsequently, experiments with the assistant of Eyelink-II Type eye movement monitoring system are conducted in the typical tunnels in Ji-Qing freeway and Xi-Zha freeway, to collect the data of eye movement indexes “Fixation Duration” and “Eyeball Rotating Speed”, which typically represent drivers' mental load and visual characteristics. On this basis, the paper establishes a visual recognition model for the speed limit signs at the highway tunnel entrances and exits. In combination with related standards and regulations, it further presents the recommended values for locating speed limit signs under different tunnel conditions. A case application on Panlong tunnel in Ji-Qing freeway is given to generate the helpful improvement suggestions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=driver%20psychological%20load" title="driver psychological load">driver psychological load</a>, <a href="https://publications.waset.org/abstracts/search?q=eye%20movement%20index" title=" eye movement index"> eye movement index</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20limit%20sign%20location" title=" speed limit sign location"> speed limit sign location</a>, <a href="https://publications.waset.org/abstracts/search?q=tunnel%20entrance%20and%20exit" title=" tunnel entrance and exit"> tunnel entrance and exit</a> </p> <a href="https://publications.waset.org/abstracts/89244/locating-speed-limit-signs-for-highway-tunnel-entrance-and-exit" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89244.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">295</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">210</span> Effect of Pozzolanic Additives on the Strength Development of High Performance Concrete</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laura%20Dembovska">Laura Dembovska</a>, <a href="https://publications.waset.org/abstracts/search?q=Diana%20Bajare"> Diana Bajare</a>, <a href="https://publications.waset.org/abstracts/search?q=Ina%20Pundiene"> Ina Pundiene</a>, <a href="https://publications.waset.org/abstracts/search?q=Daira%20Erdmane"> Daira Erdmane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this research is to estimate effect of pozzolanic substitutes and their combination on the hydration heat and final strength of high performance concrete. Ternary cementitious systems with different ratios of ordinary Portland cement, silica fume and calcined clay were investigated. Local illite clay was calcined at temperature 700oC in rotary furnace for 20 min. It has been well recognized that the use of pozzolanic materials such as silica fume or calcined clay are recommended for high performance concrete for reduction of porosity, increasing density and as a consequence raising the chemical durability of the concrete. It has been found, that silica fume has a superior influence on the strength development of concrete, but calcined clay increase density and decrease size of dominating pores. Additionally it was found that the rates of pozzolanic reaction and calcium hydroxide consumption in the silica fume-blended cement pastes are higher than in the illite clay-blended cement pastes, it strongly depends from the amount of pozzolanic substitutes which are used. If the pozzolanic reaction is dominating then amount of Ca(OH)2 is decreasing. The identity and the amount of the phases present were determined from the thermal analysis (DTA) data. The hydration temperature of blended cement pastes was measured during the first 24 hours. Fresh and hardened concrete properties were tested. Compressive strength was determined and differential thermal analysis (DTA) was conducted of specimens at the age of 3, 14, 28 and 56 days. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high%20performance%20concrete" title="high performance concrete">high performance concrete</a>, <a href="https://publications.waset.org/abstracts/search?q=pozzolanic%20additives" title=" pozzolanic additives"> pozzolanic additives</a>, <a href="https://publications.waset.org/abstracts/search?q=silica%20fume" title=" silica fume"> silica fume</a>, <a href="https://publications.waset.org/abstracts/search?q=ternary%20systems" title=" ternary systems"> ternary systems</a> </p> <a href="https://publications.waset.org/abstracts/35997/effect-of-pozzolanic-additives-on-the-strength-development-of-high-performance-concrete" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35997.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">209</span> Exploration of Sweet Potato Cultivar Markets Availability in North West Province, South Africa</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20M.%20Mmbengwa">V. M. Mmbengwa</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20R.%20M.%20Mabuso"> J. R. M. Mabuso</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20P.%20Du%20Plooy"> C. P. Du Plooy</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Laurrie"> S. Laurrie</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20D.%20van%20Schalkwyk"> H. D. van Schalkwyk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sweet potato products are necessary for the provision of essential nutrients in every household, regardless of their poverty status. Their consumption appears to be highly influenced by socio-economic factors, such as malnutrition, food insecurity and unemployment. Therefore, market availability is crucial for these cultivars to resolve some of the socio-economic factors. The aim of the study was to investigate market availability of sweet potato cultivars in the North West Province. In this study, both qualitative and quantitative research methodologies were used. Qualitative methodology was used to explain the quantitative outcomes of the variables. On the other hand, quantitative results were used to test the hypothesis. The study used SPSS software to analyse the data. Cross-tabulation and Chi-square statistics were used to obtain the descriptive and inferential analyses, respectively. The study found that the Blesbok cultivar is dominating the markets of the North West Province, with the Monate cultivar dominating in the Bojanala Platinum (75 %) and Dr Ruth Segomotsi Mompati (25 %) districts. It is also found that a unit increase in the supply of sweet potato cultivars in both local and district municipal markets is accompanied by a reduced demand of 28 % and 33 % at district and local markets, respectively. All these results were found to be significant at p<0.05. The results further revealed that in four out of nine local municipality markets, the Blesbok cultivar seems to be solely available in those four local municipal markets of North West Province. It can be concluded that Blesbok, relative to other cultivars, is the most commercialised sweet potato variety and that consumers across this Province are highly aware of it. For other cultivars to assume market prominence in this Province, a well-designed marketing campaign for creating awareness may be required. This campaign may be based on nutritional advantages of different cultivars, of which Blesbok is relatively inferior, compared to orange-fleshed sweet potato varieties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cultivar" title="cultivar">cultivar</a>, <a href="https://publications.waset.org/abstracts/search?q=malnutrition" title=" malnutrition"> malnutrition</a>, <a href="https://publications.waset.org/abstracts/search?q=markets" title=" markets"> markets</a>, <a href="https://publications.waset.org/abstracts/search?q=sweet%20potato" title=" sweet potato"> sweet potato</a> </p> <a href="https://publications.waset.org/abstracts/7769/exploration-of-sweet-potato-cultivar-markets-availability-in-north-west-province-south-africa" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7769.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">294</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">208</span> Metrology in Egyptian Architecture, Interrelation with Archaeology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Monica%20%20M.%20Marcos">Monica M. Marcos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the framework of Archaeological Research, Heritage Conservation and Restoration, the object of study is metrology applied in composition of religious architecture in ancient Egypt, and usefulness in Archaology. The objective is the determination of the geometric and metrological relations in architectural models and the module used in the initial project of the buildings. The study and data collection of religious buildings, tombs and temples of the ancient Egypt, is completed with plans. The measurements systematization and buildings modulation makes possible to establish common compositional parameters, with a module determined by the measurement unit used. The measurement system corresponding to the main period of egyptian history, was the Egyptian royal cubit. The analysis of units measurements, used in architectural design, provides exact numbers on buildable spaces dimensions. It allows establishing proportional relationships between them, and finding a geometric composition module, on which the original project was based. This responds to a philosophical and functional concept of projected spaces. In the heritage rehabilitation and restoration field, knowledge of metrology helps in excavation, reconstruction and restoration of construction elements. The correct use of metrology contributes to the identification of possible work areas, helping to locate where the damaged or missing areas are. Also in restoration projects, metrology is useful for reordering and locating decontextualized parts of buildings. The conversion of measurements taken in the current International System to the ancient egyptian measurements, allows understand its conceptual purpose and its functionality, which makes easier to carry out archaeological intervention. In the work carried out in archaeological excavations, metrology is an essential tool for locating sites and establishing work zones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=egyptology" title="egyptology">egyptology</a>, <a href="https://publications.waset.org/abstracts/search?q=metrology" title=" metrology"> metrology</a>, <a href="https://publications.waset.org/abstracts/search?q=archaeology" title=" archaeology"> archaeology</a>, <a href="https://publications.waset.org/abstracts/search?q=measurements" title=" measurements"> measurements</a>, <a href="https://publications.waset.org/abstracts/search?q=Egyptian%20cubit" title=" Egyptian cubit"> Egyptian cubit</a> </p> <a href="https://publications.waset.org/abstracts/191087/metrology-in-egyptian-architecture-interrelation-with-archaeology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191087.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">25</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=locating%20dominating%20set&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=locating%20dominating%20set&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>